Towards a Classical Linear λ-calculus (Preliminary Report)
Gavin M. Bierman · Electronic Notes in Theoretical Computer Science · 1996
This paper considers a typed λ-calculus for classical linear logic. I shall give an explanation of a multiple-conclusion formulation for classical logic due to Parigot and compare it to more traditional treatments by Prawitz and others. I shall use Parigot's method to devise a natural deduction formulation of classical linear logic. I shall also demonstrate a somewhat hidden connexion with the continuation-passing paradigm which gives a new computational interpretation of Parigot's techniques and possibly a new style of continuation programming.