A Lambda Calculus with Letrecs and Barriers

We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion □ A is replaced by [[ s ]] A whose intended reading is " s is a proof of A ". A term calculus for this formulation yields a typed ...

The Curry-Howard isomorphism is the correspondence between propositions and types, proofs and lambda-terms, and proof normalization and evaluation. In Curry-Howard isomorphism, we find a duality between values and continuations in pure functional ...

Linear logic enjoys strong symmetries inherited from classical logic while providing a constructive framework comparable to intuitionistic logic. However, the computational interpretation of sequent calculus presentations of linear logic remains ...