Short proofs of normalization for the simplytyped λ-calculus, permutative conversions and Gödel's T

Archive for Mathematical Logic

Volumn 42, Issue 1, 2003, Pages 59-87

  Joachimski, Felix ^a   Matthes, Ralph ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

calculus; Generalized application; G del's Tq rule; Inductive characterization; Permutative commuting conversions; Sum types

Indexed keywords

EID: 0038201057     PISSN: 09335846     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00153-002-0156-9     Document Type: Article

References (35)

1. [AJ01] Aehlig, K., Joachimski, F.: Operational aspects of normalization by evaluation. Submitted, 2001
2. [Alt93] Altenkirch, T.: A formalization of the strong normalization proof for system F in LEGO. In Bezem and Groote [BG93], pages 13-28
3. [Bar84] Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics. NorthHolland, Amsterdam, second revised edition, 1984
4. [Ber93] Berger, U.: Program extraction from normalization proofs. In Bezem and Groote [BG93], 91-106
5. [BG93] Bezem, M., Jan F. Groote, editors. Typed Lambda Calculi and Applications, volume 664 of Lecture Notes in Computer Science. Springer Verlag, 1993
6. [Dav95] David, R.: Une preuve simple de résultats classiques en λ calcul. C.R. Acad. Sci. Paris, t. 320, Série I:1401-1406, (1995)
7. [Dav0l] David, R.: Normalization without reducibility. Annals of Pure and Applied Logic 107(1-3), 121-130 (2001)
8. [dG99] de Groote, P.: On the strong normalisation of natural deduction with permutation-conversions. In Paliath Narendran and Michaël Rusinowitch, editors, Rewriting Techniques and Applications, 10th International Conference, RTA99, Trento, Italy, July 2-4, 1999, Proceedings, volume 1631 of Lecture Notes in Computer Science, 45-59. Springer Verlag, 1999
9. [Dil68] Diller, J.: Zur Berechenbarkeit primitiv-rekursiver Funktionale endlicher Typen. In Kurt Schütte, editor, Contributions to Mathematical Logic, 109-120. North-Holland, Amsterdam, 1968
10. [Gan80] Gandy, R.O.: An early proof of normalization. In J.P. Seldin and J.R. Hindley, editors, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, 453-455. Academic Press, 1980
11. [GLT89] Girard, J.-Y, Lafont, Y., Taylor, P.: Proofs and Types, volume 7 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989
12. [Göd58] Gödel, K.: Über eine bisher noch nicht benützte Erweiterung des finiten Standpunkts. Dialectica 12, 280-287 (1958)
13. [Gog94] Goguen, H.: A Typed Operational Semantics for Type Theory. PhD thesis, University of Edinburgh, August 1994. Available as LFCS Report ECS-LFCS-94-304
14. [Gog95] Goguen, H.: Typed operational semantics. In Mariangiola Dezani-Ciancaglini and Gordon Plotkin, editors, Typed Lambda Calculi and Applications, volume 902 of Lecture Notes in Computer Science, 186-200. Springer Verlag, 1995
15. [Gog99] Goguen, H.: Soundness of the logical framework for its typed operational semantics. In Jean-Yves Girard, editor, Typed Lambda Calculi and Applications, 4th International Conference, TLCA'99, L'Aquila, Italy, April 7-9,1999, Proceedings, volume 1581 of Lecture Notes in Computer Science, 177-197. Springer Verlag, 1999
16. [Hin97] Hindley, J.R.: Basic Simple Type Theory, volume 42 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1997
17. [How80] Howard, W.A.: Ordinal analysis of terms of finite type. The Journal of Symbolic Logic, 45(3), 493-504 (1980)
18. [Joa0l] Joachimski, F.: Reduction Properties of ∏IE-Systems. PhD thesis, LMU München, 2001
19. [Lei75] Leivant, D.: Strong normalization for arithmetic (variations on a theme of Prawitz). In J. Diller and G.H. Müller, editors, Proof Theory Symposion Kiel 1974, volume 500 of Lecture Notes in Mathematics, 182-197. Springer Verlag, 1975
20. [Mat98] Matthes, R.: Extensions of System F by Iteration and Primitive Recursion on Monotone Inductive Types. Dissertation (PhD thesis), Universität München, 1998
21. [Mat00] Matthes, R.: Characterizing strongly normalizing terms for a lambda calculus with generalized applications via intersection types. In José D. P. Rolim, Andrei Z. Broder, Andrea Corradini, Roberto Gorrieri, Reiko Heckel, Juraj Hromkovic, Ugo Vaccaro, and Joe B. Wells, editors, ICALP Workshops 2000, Proceedings of the Satellite Workshops of the 27th International Colloquium on Automata, Languages, and Programming, Geneva, Switzerland, volume 8 of Proceedings in Informatics, 339-353. Carleton Scientific, 2000
22. [Pra71] Prawitz, D.: Ideas and results in proof theory. In Jens E. Fenstad, editor, Proceedings of the Second Scandianvian Logic Symposium, 235-307. North-Holland, Amsterdam, 1971
23. [San67] Sanchis, L.E.: Functional defined by recursion. Notre Dame Journal of Formal Logic, Vin(3), 161-174(1967)
24. [Sch77] Schütte, K.; Proof Theory. Springer-Verlag, Berlin, 1977
25. [Sch93] Schwichtenberg, H. Proofs as programs. In P. Aczel, H. Simmons, and S.S. Wainer, editors, Proof Theory. A selection of papers from the Leeds Proof Theory Programme 1990, 81-113. Cambridge University Press, 1993
26. [Sch99] Schwichtenberg, H.: Termination of permutative conversions in intuitionistic Gentzen calculi. Theoretical Computer Science 212(1-2), 247-260 (1999)
27. [Tai67] Tait, W. W.: Intensional interpretations of functionals of finite type I. The Journal of Symbolic Logic 32(2), 198-212 (1967)
28. [Tai75] Tait, W.W.: A readability interpretation of the theory of species. In R. Parikh, editor, Logic Colloquium Boston 1971/72, volume 453 of Lecture Notes in Mathematics, 240-251. Springer Verlag, 1975
29. [Tro73] Troelstra A.S., editor: Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, volume 344 of Lecture Notes in Mathematics. Springer Verlag, Berlin, Heidelberg, New York, 1973
30. [vdP96] van de Pol, J.: Termination of higher-order rewrite systems. Quaestiones Infinitae XVI, Department of Philosophy, Utrecht University, 1996. Proefschrift (PhD thesis)
31. [vP01] von Plato, J.: Natural deduction with general elimination rules. Annals of Mathematical Logic 40(7), 541-567 (2001)
32. [vR96] van Raamsdonk, F.: Confluence and Normalisation for Higher-Order Rewriting. Academisch Proefschrift (PhD thesis), Vrije Universiteit te Amsterdam, 1996
33. [vRS95] van Raamsdonk, F., Severi, P.: On normalisation. Technical Report CS-R9545, Centrum voor Wiskunde en Informatica (CWI), Amsterdam, June 1995. Forms a part of [vR96]
34. [vRSSX99] van Raamsdonk, P., Severi, P., Sørensen, M.H.B., Xi, H. Perpetual reductions in λ-calculus. Information and Computation 149(2), 173-225 (1999)
35. [Wei97] Weiermann, A.: A proof of strongly uniform termination for Gödel'S T by methods from local predicativity. Archive for Mathematical Logic 36, 445-460 (1997)