Strong normalization in type systems: A model theoretical approach

Annals of Pure and Applied Logic 73 (1):53-78 (1995)
  Copy   BIBTEX

Abstract

Tait's proof of strong normalization for the simply typed λ-calculus is interpreted in a general model theoretical framework by means of the specification of a certain theory T and a certain model /oU of T. The argumentation is partly reduced to formal predicate logic by the application of certain derivability properties of T. The resulting version of Tait's proof is, within the same framework, systematically generalized to the Calculus of Constructions and other advanced type systems. The generalization proceeds along the formal level in the sense that T is modified first and that the new theory partly dictates the subsequent transformation of /oU, which is carried out in stages. The uniform and standardized character of the argumentation contributes to its perspicuity

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,227

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Natural deduction systems for some non-commutative logics.Norihiro Kamide & Motohiko Mouri - 2007 - Logic and Logical Philosophy 16 (2-3):105-146.
Strong Normalization and Typability with Intersection Types.Silvia Ghilezan - 1996 - Notre Dame Journal of Formal Logic 37 (1):44-52.
Are dynamical systems the answer?Arthur B. Markman - 2001 - Behavioral and Brain Sciences 24 (1):50-51.

Analytics

Added to PP
2014-01-16

Downloads
26 (#613,702)

6 months
3 (#983,674)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references