A Proof of Strong Normalisation using Domain Theory

U. Berger, (2005) significantly simplified Tait's normalisation proof for bar recursion, replacing Tait's introduction of infinite terms by the construction of a domain having the property that a term, is strongly normalizing if its semantics is neperp. The goal of this paper is to show that, using ideas from the theory of intersection types and Martin-Lof's domain interpretation of type theory, we can in turn simplify U, Berger's argument in the construction of such a domain model. We think that our domain model can be used to give modular proofs of strong normalization for various type theory. As an example, we show in some details how it can be used to prove strong normalization for Martin-Lof dependent type theory extended with bar recursion, and with some form of proof-irrelevance

[1]  Steffen van Bakel,et al.  Complete Restrictions of the Intersection Type Discipline , 1992, Theor. Comput. Sci..

[2]  Randy Pollack,et al.  Closure Under Alpha-Conversion , 1994, TYPES.

[3]  T. Streicher.  Semantics of Type Theory , 1991, Progress in Theoretical Computer Science.

[4]  Paulo Oliva,et al.  MODIFIED BAR RECURSION AND CLASSICAL DEPENDENT CHOICE , 2004 .

[5]  Ulrich Berger,et al.  Continuous Semantics for Strong Normalization , 2005, CiE.

[6]  Ulrich Berger,et al.  Continuous Functionals of Dependent and Transfinite Types , 1999 .

[7]  Ulrich Berger,et al.  Continuous semantics for strong normalisation , 2006, Mathematical Structures in Computer Science.

[8]  Per Martin-Löf,et al.  An intuitionistic theory of types , 1972 .

[9]  Mariangiola Dezani-Ciancaglini,et al.  A filter lambda model and the completeness of type assignment , 1983, Journal of Symbolic Logic.

[10]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[11]  D. Dalen.  Review: Georg Kreisel, Godel's Intepretation of Heyting's Arithmetic; G. Kreisel, Relations Between Classes of Constructive Functionals; Georg Kreisel, A. Heyting, Interpretation of Analysis by Means of Constructive Functionals of Finite Types , 1971 .

[12]  Daniel Fridlender,et al.  A proof-irrelevant model of Martin-Löf's logical framework , 2002, Mathematical Structures in Computer Science.

[13]  G. Pottinger,et al.  A type assignment for the strongly normalizable |?-terms , 1980 .

[14]  Rasmus Ejlers Møgelberg,et al.  Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science , 2007 .

[15]  Frank Pfenning,et al.  On equivalence and canonical forms in the LF type theory , 2001, TOCL.

[16]  M. Beeson.  Foundations of Constructive Mathematics: Metamathematical Studies , 1985 .

[17]  Roberto M. Amadio,et al.  Domains and lambda-calculi , 1998, Cambridge tracts in theoretical computer science.

[18]  Dana S. Scott,et al.  Lectures on a Mathematical Theory of Computation , 1982 .

[19]  Vincent van Oostrom,et al.  Combinatory Reduction Systems: Introduction and Survey , 1993, Theor. Comput. Sci..

[20]  C. Spector.  Provably recursive functionals of analysis: a consistency proof of analysis by an extension of princ , 1962 .

[21]  David Aspinall,et al.  Subtyping dependent types , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[22]  Thierry Coquand,et al.  On the computational content of the axiom of choice , 1994, The Journal of Symbolic Logic.

[23]  Yohji Akama.  SN Combinators and Partial Combinatory Algebras , 1998, RTA.

[24]  Ulrich Berger,et al.  Strong normalisation for applied lambda calculi , 2005, ArXiv.

[25]  W. Tait.  Normal Form Theorem for Bar Recursive Functions of Finite Type , 1971 .

[26]  Thorsten Altenkirch,et al.  Constructions, inductive types and strong normalization , 1993, CST.

[27]  Thierry Coquand,et al.  A Logical Framework with Dependently Typed Records , 2003, Fundam. Informaticae.

[28]  Samson Abramsky,et al.  Handbook of logic in computer science. , 1992 .

[29]  Giovanni Sambin,et al.  Twenty-five years of constructive type theory. , 1998 .

[30]  P. Aczel.  Frege Structures and the Notions of Proposition, Truth and Set* , 1980 .

[31]  Ulrich Berger,et al.  A computational interpretation of open induction , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[32]  Roberto M. Amadio,et al.  Domains and Lambda-Calculi (Cambridge Tracts in Theoretical Computer Science) , 2008 .

[33]  Dana S. Scott,et al.  Combinators and classes , 1975, Lambda-Calculus and Computer Science Theory.

[34]  Colin Riba,et al.  Strong Normalization as Safe Interaction , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).