Jason (jcreed) wrote,
Jason
jcreed

Also hilariously I think my 2007 paper with Frank technically proved the same soundness result for labelled deduction and I basically totally forgot that I'd ever written it. Oh well. I think the proof based on the simpson-thesis-Hilbertization proof is much, much simpler and less technical. Dunno if it works for first-order stuff, though, which was the stated motivation of the paper, in order to safely do control effects like call/cc in a dependently typed language.
Tags: logic, math, modal logic
Subscribe

  • (no subject)

    After getting home from work immediately appeared to be a traintastrophe in the making, went to see Esther Schor talk about her book "Bridge of…

  • (no subject)

    Went to a series of maker-y talks hosted by Pivotal. The last one, by the woman who runs Genspace, "New York City's Community Biolab" was pretty…

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