October 29th, 2012

beartato phd

(no subject)

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.