Jason (jcreed) wrote,
Jason
jcreed

Hmm. So I actually can code up the typing rules for proof irrelevance inside good ol' vanilla LF, but it requires an ugly predicate of kind ((var -> tm) -> var -> tm) -> ((var -> tm) -> var -> tm) -> type whose definition has size proportional to the size of the language, and the whole affair is hideously anti-modular. A small victory nonetheless. I should get back to real work, though.
Subscribe

  • (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

    Error

    Anonymous comments are disabled in this journal

    default userpic

    Your reply will be screened

    Your IP address will be recorded 

  • 0 comments