Continuous Semantics for Strong Normalization

We prove a general strong normalization theorem for higher type rewrite systems based on Tait's strong computability predicates and a strictly continuous domain-theoretic semantics. The theorem applies to extensions of Godel's system T but also to various forms of bar recursion for which strong normalization was hitherto unknown.

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

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

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

[4]  Ulrich Berger.  A computational interpretation of open induction , 2004, LICS 2004.

[5]  H. Luckhardt.  Extensional Godel functional interpretation;: A consistency proof of classical analysis , 1973 .

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

[7]  Helmut Schwichtenberg,et al.  Strict Functionals for Termination Proofs , 1995, TLCA.

[8]  Helmut Von Vogel.  Ein starker Normalisationssatz für die bar-rekursiven Funktionale , 1977, Arch. Math. Log..

[9]  Marc Bezem,et al.  Strong normalization of barrecursive terms without using infinite terms , 1985, Arch. Math. Log..

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

[11]  J. Girard.  Une Extension De ĽInterpretation De Gödel a ĽAnalyse, Et Son Application a ĽElimination Des Coupures Dans ĽAnalyse Et La Theorie Des Types , 1971 .

[12]  Ralph Matthes.  Monotone Inductive and Coinductive Constructors of Rank 2 , 2001, CSL.

[13]  Mark-Jan Nederhof,et al.  Modular proof of strong normalization for the calculus of constructions , 1991, Journal of Functional Programming.

[14]  A. Troelstra.  Metamathematical investigation of intuitionistic arithmetic and analysis , 1973 .

[15]  Jean-Pierre Jouannaud,et al.  The Calculus of algebraic Constructions , 1999, RTA.

[16]  T. Coquand.  Une théorie des constructions , 1985 .

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