## A classical linear lambda-calculus (1996)

Citations: | 8 - 0 self |

### BibTeX

@TECHREPORT{Bierman96aclassical,

author = {G. M. Bierman},

title = {A classical linear lambda-calculus},

institution = {},

year = {1996}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper proposes and studies 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. This formulation is compared in detail to the sequent calculus formulation. In an appendix I shall also demonstrate a somewhat hidden connexion with the paradigm of control operators for functional languages which gives a new computational interpretation of Parigot's techniques.