Article contents
A general method for proving the normalization theorem for first and second order typed λ-calculi
Published online by Cambridge University Press: 01 December 1999
Abstract
In this paper we describe a method for proving the normalization property for a large variety of typed lambda calculi of first and second order, which is based on a proof of equivalence of two deduction systems. We first illustrate the method on the elementary example of simply typed lambda calculus, and then we show how to extend it to a more expressive dependent type system. Finally we use it to prove the normalization theorem for Girard's system F.
- Type
- Research Article
- Information
- Copyright
- 1999 Cambridge University Press
- 3
- Cited by