Jason (jcreed) wrote,

Bleh. I think this is one of the most ugly type declarations I have ever made:
c--x:(Π-w:o.a w).Π-z:o.Π[i]y:(a·(d+·(*;x z))).a·(d+·(*;y))

Nonetheless, it serves as a useful counterexample to the approach I was trying earlier. Trying to typecheck
Y Y : a· (d+ · (*; Y Y))
Y = λ w . c- · (w;w;*)
leads to an infinite loop.

There had better be a workaround along the lines I was thinking last night, or else I'm kinda hosed.

  • (no subject)

    Something that's bugged me for a long time is this: How many paths, starting at the origin, taking N steps either up, down, left or right, end up at…

  • (no subject)

    Still sad that SAC seems to end up being as complicated as it is. Surely there's some deeper duality between…

  • (no subject)

    I had already been meaning to dig into JaneSt's "Incremental" library, which bills itself as a practical implementation (in ocaml) of the ideas in…

  • Post a new comment


    Anonymous comments are disabled in this journal

    default userpic

    Your reply will be screened

    Your IP address will be recorded