Strong normalisation for applied lambda calculi

Logical Methods in Computer Science

Volumn 1, Issue 2, 2005, Pages

  Berger, Ulrich ^a  

^a SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

Domain theory; Higher order term rewriting; Lambda calculus; Proof theory; Strong normalisation

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; COMPUTATIONAL MECHANICS; PATHOLOGY;

DOMAIN THEORY; HIGHER ORDER TERMS; LAMBDA CALCULUS; NORMALISATION; PROOF THEORY;

DIFFERENTIATION (CALCULUS);

EID: 26944439646     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-1(2:3)2005     Document Type: Article

References (23)

1. S. Abramsky and A. Jung. Domain theory. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 3, pages 1-168. Clarendon Press, 1994.
2. T. Altenkirch. Constructions, Inductive Types and Strong Normalization. PhD thesis, The University of Edinburgh, Department of Computer Science, Edinburgh, 1993.
3. H. Barendregt. Lambda calculi with types. In S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 117-309. Clarendon Press, Oxford, 1992.
4. S. Berardi, M. Bezem, and T. Coquand. On the computational content of the axiom of choice. Journal of Symbolic Logic, 63(2):600-622, 1998.
5. U. Berger. A computational interpretation of open induction. In F. Titsworth, editor, Proceedings of the Ninetenth Annual IEEE Symposium on Logic in Computer Science, pages 326-334. IEEE Computer Society, 2004.
6. U. Berger. Strong normalization proofs based on continuous semantics, 2004.
7. M. Bezem. Strong normalization of barrecursive terms without using infinite terms. Archive for Mathematical Logic, 25:175-181, 1985.
8. F. Blanqui, J-P. Jouannaud, and M. Okada. The calculus of algebraic constructions. In P. Narendran and M. Rusinowitch, editors, Proceedings of RTA’99, number 1631 in LNCS, pages 301-316. Springer Verlag, Berlin, Heidelberg, New York, 1999.
9. U. Berger and P. Oliva. Modified bar recursion and classical dependent choice. In Logic Colloquium 2001. Springer, 2005.
10. S. Cook and A. Urquhart. Functional interpretations of feasibly constructive arithmetic. Annals of Pure and Applied Logic, 63:103-200, 1993.
11. R.L. Constable et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, New Jersey, 1986.
12. J-Y. Girard. Une extension de l’interpr´etation de Gödel à l’analyse, et son application à l’´elimination des coupures dans l’analyse et la th´eorie des types. In J.E. Fenstad, editor, Proceedings of the Second Scandinavian Logic Symposium, pages 63-92. North-Holland, Amsterdam, 1971.
13. E. Griffor, I. Lindström, and V. Stoltenberg-Hansen. Mathematical theory of domains. Cambridge University Press, 1993.
14. K. Gödel. Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes. Dialectica, 12:280-287, 1958.
15. C. St. J.A. Nash-Williams. On well-quasi-ordering finite trees. Proc. Cambridge Phil. Soc., 59:833-835, 1963.
16. G.D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223-255, 1977.
17. C. Paulin-Mohring. Inductive definitions in the system Coq; rules and properties. In M. Bezem and J.F. Groote, editors, Typed Lambda Calculi and Applications, pages 328-345. LNCS Vol. 664, 1993.
18. 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: Proc. Symposia in Pure Mathematics, volume 5, pages 1-27. American Mathematical Society, Providence, Rhode Island, 1962.
19. W.W. Tait. Normal form theorem for barrecursive functions of finite type. In J.E. Fenstad, editor, Proceedings of the Second Scandinavian Logic Symposium, pages 353-367. North-Holland, Amsterdam, 1971.
20. W.W. Tait. A realizability interpretation of the theory of species. In R. Parikh, editor, Logic Colloquium Boston 1971/72, volume 453 of Lecture Notes in Mathematics, pages 240-251. Springer Verlag, Berlin, Heidelberg, New York, 1975.
21. A.S. Troelstra. Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, volume 344 of Lecture Notes in Mathematics. Springer, 1973.
22. J. van de Pol and H. Schwichtenberg. Strict functionals for termination proofs. In M. Dezani-Ciancaglini and G. Plotkin, editors, Typed Lambda Calculi and Applications, volume 902 of LNCS, pages 350-364. Springer Verlag, Berlin, Heidelberg, New York, 1995.
23. H. Vogel. Ein starker Normalisationssatz für die barrekursiven Funktionale. Archive for Mathematical Logic, 18:81-84, 1985.