Location of Repository

Short Proofs of Normalization for the simply-typed λ-calculus, permutative conversions and Gödel's T

By Felix Joachimski and Ralph Matthes


Inductive characterizations of the sets of terms, the subset of strongly normalizing terms and normal forms are studied in order to reprove weak and strong normalization for the simplytyped λ-calculus and for an extension by sum types with permutative conversions. The analogous treatment of a new system with generalized applications inspired by von Plato's generalized elimination rules in natural deduction shows the flexibility of the approach which does not use the strong computability/candidate style a la Tait and Girard. It is also shown that the extension of the system with permutative conversions by -rules is still strongly normalizing, and likewise for an extension of the system of generalized applications by a rule of "immediate simplification". By introducing an innitely branching inductive rule the method even extends to Gödel's T

Year: 1998
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.tcs.informatik.uni-... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.