A proof of strong normalisation using domain theory

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2006, Pages 307-316

  Coquand, Thierry ^a   Spiwack, Arnaud ^b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BAR RECURSION; DOMAIN THEORY; NORMALISATION PROOF; NORMALIZATION;

AUTOMATA THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SEMANTICS; THEOREM PROVING;

FORMAL LOGIC;

EID: 34547325164     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2006.8     Document Type: Conference Paper

References (28)

1. P. Aczel Frege structures and the notions of proposition, truth and set. The Kleene Symposium, pp. 31-59, Stud. Logic Foundations Math., 101, North-Holland, Amsterdam-New York, 1980.
2. Y. Akama. SN Combinators and Partial Combinatory Algebras. LNCS 1379, p. 302-317, 1998.
3. Th. Altenkirch. Constructions, Inductive Types and Strong Normalization. PhD thesis, University of Edinburgh, 1993.
4. R. Amadio and P.L. Curien. Domains and Lambda-Calculi. Cambridge tracts in theoretical computer science, 46, (1997).
5. D. Aspinall. Subtyping Dependent Types. CSL'94, LNCS 933, 1994.
6. S. van Bakel. Complete restrictions of the Intersection Type Discipline. Theoretical Computer Science, 102:135-163, 1992.
7. H. Barendregt, M. Coppo and M. Dezani-Ciancaglini. A filter lambda model and the completeness of type assignment. J. Symbolic Logic 48 (1983), no. 4, 931-940 (1984).
8. M. Beeson. Foundations of constructive mathematics. Metamathematical studies. Ergebnisse der Mathematik und ihrer Grenzgebiete (3) [Results in Mathematics and Related Areas (3)], 6. Springer-Verlag, Berlin, 1985.
9. S. Berardi, M. Bezem and Th. Coquand. On the computational content of the axiom of choice. Journal of Symbolic Logic 63 (2), 600-622, 1998.
10. U. Berger and P. Oliva. Modified Bar Recursion and Classical Dependent Choice. Logic Colloquium '01, 89-107, Lect. Notes Log., 20, Assoc. Symbol. Logic, Urbana, IL, 2005.
11. U.Berger. Continuous Semantics for Strong Normalisation. LNCS 3526, 23-34, 2005.
12. U. Berger. A Computational Interpretation of Open Induction. Proceeding of LICS 2004.
13. U. Berger. Continuous Functionals of Dependent and Transfinite Types, in Models and Computability, London Mathematical Society, Lecture Note Series, p. 1-22, 1999.
14. Th. Coquand, R. Pollack and M. Takeyama. A Logical Framework with Dependently Typed Record. Fundam. Inform. 65 (1-2), p. 113-134, 2005.
15. D. Fridlender. A proof-irrelevant model of Martin-Lf's logical framework. Math. Structures Comput. Sci. 12 (2002), no. 6,771-795.
16. R Harper, F Pfenning. On equivalence and canonical forms in the LF type theory ACM Transactions on Computational Logic, p. 61-101, 2005.
17. G. Kreisel. Interpretation of analysis by means of constructive functionals of finite types. In Constructive in Mathematics, North-Holland, 1958.
18. P. Martin-Löf. Lecture note on the domain interpretation of type theory. Workshop on Semantics of Programming Languages, Chalmers, (1983).
19. B Nordstrom, K Petersson, JM Smith. Martin-Löf Type Theory. Handbook of Logic in Computer Science, 2000.
20. R. Pollack. Closure Under Alpha-Conversion. TYPES 1993, Lecture Notes in Computer Science 806, p. 313-332, 1993.
21. G. Pottinger. A type assignment for the strongly normalizable terms, in: J.P. Seldin and J.R. Hindley (eds.), To H. B. Curry: essays on combinatory logic, lambda calculus and formalism, Academic Press, London, pp. 561-577,1980.
22. G. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223-255, 1977.
23. D. Scott. Lectures on a mathematical theory of computation. Theoretical foundations of programming methodology (Munich, 1981), 145-292, NATO Adv. Study Inst. Ser. C: Math. Phys. Sci., 91, Reidel, Dordrecht, 1982.
24. D. Scott. Combinators and classes, λcalculus and computer science theory, pp. 126. Lecture Notes in Comput. Sci., Vol. 37, Springer, Berlin, 1975.
25. C. Spector. Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles in current intuitionistic mathematics. In F.D.E.Dekker, editor, Recursive Function Theory, 1962
26. Th. Streicher. Semantics of Type Theory, in the series Progress in Theoretical Computer Science. Basel: Birkhaeuser. XII, 1991.
27. W.W. Tait. Normal form theorem for bar recursive functions of finite type. Proceedings of the Second Scandinavian Logic Symposium, North-Holland, 1971.
28. B.Werner. A Proof-Irrelevant Type Theory. Unpublished manuscript, 2003.