Natural Deduction And Sequent Typed Lambda Calculus (1999)
Abstract:
Two different formulations of the simply typed lambda calculus: the natural deduction and the sequent system, are considered. An analogue of cut elimination is proved for the sequent lambda calculus.
Citations
| 353 | The formulas-as-types notion of construction – Howard |
| 264 | Proofs and Types – Girard, Taylor, et al. - 1989 |
| 45 | A λ-calculus structure isomorphic to Gentzen-style sequent calculus structure. Available at http://coq.inria.fr/~herbelin/LAMBDA-BAR-FULL.dvi.gz – Herbelin - 1994 |
| 7 | Logic without structural rules. (Another look at Cut Elimination – Lambek - 1993 |
| 1 | Poetic effects – Barendregt, Ghilezan - 1992 |
| 1 | Normalization as a homomorphic image of cut-elimination, Ann – Pottinger - 1977 |

