Perpetual Reductions in λ-Calculus

Information and Computation

Volumn 149, Issue 2, 1999, Pages 173-225

  Van Raamsdonk, Femke ^a   Severi, Paula ^b   Sørensen, Morten Heine B ^c   Xi, Hongwei ^d  

^a CWI   (Netherlands)

^b UNIVERSIDAD DE LA REPÚBLICA   (Uruguay)

^c UNIVERSITY OF COPENHAGEN   (Denmark)

^d CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001330520     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2750     Document Type: Article

References (88)

1. Abramsky, S., Gabbay, D. M., and Maibaum, T. S. E. (Eds.) (1992), "Handbook of Logic in Computer Science," Vol. II, Oxford Univ. Press, London.
2. Barendregt, H. P. (1984), "The Lambda Calculus: Its Syntax and Semantics," 2nd revised ed., North-Holland, Amsterdam.
3. Deleted.
4. Barendregt, H. P., Bergstra, J., Klop, J. W., and Voken, H. (1976), "Degrees, Reproductions and Representability in the Lambda Calculus," Technical Report Preprint 22, Department of Mathematics, University of Utrecht.
5. Barendregt, H. P., Kennaway, J. R., Klop, J. W., and Sleep, M. R. (1987), Needed reduction and spine strategies for the lambda calculus, Inform. and Comput. 75, 191-231.
6. Bergstra, J. A., and Klop, J. W. (1979), Church-Rosser strategies in the lambda calculus, Theoret. Comput. Sci. 9, 27-38.
7. Bergstra, J. A., and Klop, W. (1982), Strong normalization and perpetual reductions in the lambda calculus, J. Inform. Process. Cybernet. 18, 403-417.
8. Bezem, M., and Groote, J. F. (Eds.) (1993), "Typed Lambda Calculus and Applications," Lecture Notes in Computer Science, Vol. 664, Springer-Verlag, Berlin/New York.
9. Böhm, C., Coppo, M., and Dezani-Ciancaglini, M. (1975), Termination tests inside λ-calculus, in "λ-Calculus and Computer Science Theory" (A. Salomaa and M. Steinby, Eds.), pp. 95-110, Lecture Notes in Computer Science, Vol. 37, Springer-Verlag, Berlin/New York.
10. Böhm, C., and Dezani-Ciancaglini, M. (1975), λ-terms as total or partial functions on normal forms, in "λ-Calculus and Computer Science Theory" (C. Böhm, Ed.), pp. 96-121, Lecture Notes in Computer Science, Springer-Verlag, Berlin/New York.
11. Capretta, V., and Valentini, S., A general method to prove the normalization theorem for first and second order typed λ-calculi, Math. Struct. Comput. Sci., to appear.
12. Church, A. (1941), λThe Calculi of Lambda-Conversion,λ Princeton Univ. Press, Princeton, NJ.
13. Church, A., and Rosser, J. B. (1936), Some properties of conversion, Trans. Amer. Math. Soc. 39, 11-21.
14. Curien, P.-L. (1995), Algèbre universelle, introduction au λ-calcul et aux logiques combinatoires (notes de cours), Technical Report Liens-95-30, Ecole Normale Supériere.
15. Curry, H. B., and Feys, R. (1958), "Combinatory Logic," North-Holland, Amsterdam.
16. Deleted.
17. Deleted
18. Ghilezan, S. (1994), Application of typed lambda calculi in the untyped lambda calculus, "Symposium on Logical Foundations of Computer Science" (A. Nerode and Yu. V. Matiyasevich, Eds.), pp. 129-139, Lecture Notes in Computer Science, Vol. 813, Springer-Verlag, Berlin/New York.
19. Girard, J.-Y. (1972), "Interprétation fonctionelle et élimination des coupures dans l'arithmétique d'ordre supérieur," Thèse d'État, Université Paris VII.
20. Gramlich, B. (1996), "Termination and Confluence Properties of Structured Rewrite Systems," Ph.D. Thesis, Fachbereich Informatik der Universität Kaiserslautern.
21. Hindley, J. R. (1978), Reductions of residuals are finite, Trans. Amer. Math. Soc. 240, 345-361.
22. Hindley, J. R. (1989), BCK-combinators and linear λ-terms have types, Theoret. Comput. Sci. 64, 97-105.
23. Hindley, J. R., and Seldin, J. P. (1986), "Introduction to Combinators and λ-Calculus," Cambridge Univ. Press, London.
24. Honsell, F., and Lenisa, M. (1993), Some results on the full abstraction problem for restricted lambda calculi, "Symposium on Mathematical Foundations of Computer Science" (A. M. Borzyszkowski and S. Sokolowski, Eds.), pp. 84-104, Lecture Notes in Computer Science, Vol. 711, Springer-Verlag, Berlin/New York.
25. Howard, W. (1980), Ordinal analysis of terms of finite type, J. Symbolic Logic 45(3), 493-504.
26. Huet, G., and Lévy, J.-J. (1979), Call by need computations in non-ambiguous linear term rewriting systems, Preprint 359, INRIA.
27. Hyland, J. M. E. (1973), A simple proof of the Church-Rosser theorem, Oxford University.
28. Deleted.
29. Karr, M. (1985), "Delayability" in proofs of strong normalizability in the typed lambda calculus, "Mathematical Foundations of Computer Software" (H. Ehrig, C. Floyd, M. Nivat, and J. Tatcher, Eds.), pp. 208-222, Lecture Notes in Computer Science, Vol. 185, Springer-Verlag, Berlin/New York.
30. Kfoury, A. J., and Wells, J. (1995), "New Notions of Reduction and Non-semantic Proofs of β-Strong Normalization in Typed λ-Calculi," Technical Report 94-01, Boston University Computer Science Department. Also in Logic Comput. Sci.
31. Khasidashvili, Z. (1988), β-reductions and β-developments with the least number of steps, in "International Conference on Computer Logic" (P. Martin-Löf and G. Mints, Eds.), pp. 105-111, Lecture Notes in Computer Science, Vol. 417, Springer-Verlag, Berlin/New York.
32. Khasidashvili, Z. (1988), "Form Reduction Systems and Reductions of Contracted Forms and Lambda-Terms," Ph.D. Thesis, Tbilisi State University. [In Russian]
33. Khasidashvili, Z. (1993), Optimal normalization in orthogonal term rewriting systems, "Rewriting Techniques and Applications" (C. Kirchner, Ed.), pp. 243-258, Lecture Notes in Computer Science, Vol. 690, Springer-Verlag, Berlin/New York.
34. Khasidashvili, Z. (1994), The longest perpetual reductions in orthogonal expression reduction systems, in "Symposium on Logical Foundations of Computer Science" (A. Nerode and Yu. V. Matiyasevich, Eds.), pp. 191-203, Lecture Notes in Computer Science, Vol. 813, Springer-Verlag, Berlin/New York.
35. Khasidashvili, Z. (1994), On higher order recursive program schemes, in "Colloquium on Trees in Algebra and Programming," pp. 172-186, Lecture Notes in Computer Science, Vol. 787, Springer-Verlag, Berlin/New York.
36. Khasidashvili, Z., and Glauert, J. (1996), Discrete normalization and standardization in deterministic residual structures, in "Algebraic and Logic Programming" (S. Tison, Ed.), pp. 135-149, Lecture Notes in Computer Science, Vol. 1139, Springer-Verlag, Berlin/New York.
37. Khasidashvili, Z., and Ogawa, M. (1997), Perpetuality and uniform normalization, in "Algebraic and Logic Programming" (M. Hanus and J. Heering, Eds.), pp. 240-255, Springer-Verlag, Berlin/ New York.
38. Klop, J. W. (1980), "Combinatory Reduction Systems," Ph.D. thesis, Utrecht University. Volume 127 of CWI Tracts, Amsterdam.
39. Deleted.
40. Komori, Y. (1987), BCK-algebras and lambda calculus, in "Proceedings, 10th Symposium on Semigroups," pp. 5-11, Josai University, Sakado.
41. Krivine, J.-L. (1993), "Lambda-Calculus, Types and Models," Ellis Horwood Series in Computers and Their Applications, Masson and Ellis Horwood, Chichester. [English Edition]
42. Lercher, B. (1976), Lambda-calculus terms that reduce to themselves, Notre Dame J. Formal Logic XVII(2), 291-292.
43. Lévy, J.-J. (1978), "Réductions corrects et optimales dans le lambda-calcul," Ph.D. thesis, Université de Paris VII.
44. Deleted.
45. Melliès, P.-A. (1996), "Description Abstraite des Systèmes de Réécriture," Ph.D. thesis, Université Paris VII.
46. Mitschke, G. (1979), The standardization theorem in λ-calculus, Z. Math. Logik Grundlag. Math. 25, 29-31.
47. Nederpelt, R. (1973), "Strong Normalization for a Typed Lambda Calculus with Lamda Structured Types," Ph.D. thesis, Eindhoven.
48. Nederpelt, R., Geuvers, J. H., and de Vrijer, R. C. (Eds.) (1994), "Selected Papers on Automath," Elsevier Science B.V., Amsterdam.
49. van Oostrom, V. (1994), "Confluence for Abstract and Higher-Order Rewriting," Ph.D. thesis, Vrije Universiteit Amsterdam.
50. van Oostrom, V. (1996), "Take Five," IR-406, Vrije Universiteit Amsterdam.
51. van Oostrom, V. (1997), Finite family developments, in "Rewriting Techniques and Applications" (H. Comon, Ed.), pp. 308-322, Lecture Notes in Computer Science, Vol. 1232, Springer-Verlag, Berlin/New York.
52. van Oostrom, V., and van Raamsdonk, F. (1994), Comparing combinatory reduction systems and higher-order rewrite systems, in "Higher Order Algebra, Logic and Term Rewriting" (J. Heering, K. Meinke, B. Möller, and T. Nipkow, Eds.), Lecture Notes in Computer Science, Vol. 816, Springer-Verlag, Berlin/New York.
53. Parigot, M. (1990), Internal labellings in lambda-calculus, in "Symposium on Mathematical Foundations of Computer Science" (B. Rovan, Ed.), pp. 439-445, Lecture Notes in Computer Science, Vol. 452, Springer-Verlag, Berlin/New York.
54. Plaisted, D. A. (1993), Polynomial time termination and constraint satisfaction tests, in "Rewriting Techniques and Applications" (C. Kirchner, Ed.), pp. 405-420, Lecture Notes in Computer Science, Vol. 690, Springer-Verlag, Berlin/New York.
55. van de Pol, J. (1994), Termination proofs for higher-order rewrite systems, "Higher Order Algebra, Logic and Term Rewriting" (J. Heering et al., Eds.), pp. 305-325, Lecture Notes in Computer Science, Vol. 816, Springer-Verlag, Berlin/New York.
56. van de Pol, J. (1996), "Termination of Higher-Order Rewrite Systems," Ph.D. thesis, University of Utrecht. Volume 16 of "Questions Infinitae."
57. van de Pol, J., and Schwichtenberg, H. (1995), Strict functionals for termination proofs, in "Typed Lambda Calculus and Applications" (M. Dezani-Ciancaglini and G. Plotkin, Eds.), pp. 350-364, Lecture Notes in Computer Science, Vol. 902, Berlin/New York.
58. van Raamsdonk, F. (1996), "Confluence and Normalisation for Higher-Order Rewriting," Ph.D. thesis, Vrije Universiteit Amsterdam.
59. van Raamsdonk, F., and Severi, P. (1995), "On Normalisation," Technical Report CS-R9545, CWI.
60. Regnier, L. (1994), Une équivalence sur les lambda-termes, Theoret. Comput. Sci. 126, 281-292.
61. Schroer, D. E. (1965), "The Church-Rosser Theorem," Ph.D. thesis, Cornell University.
62. Schwichtenberg, H. (1982), Complexity of normalization in the pure typed lambda-calculus, in "The L.E.J. Brouwer Centenary Symposium" (A. S. Troelstra and D. van Dalen, Eds.), pp. 453-457, North-Holland, Amsterdam.
63. Schwichtenberg, H. (1991), An upper bound for reduction sequences in the typed lambda-calculus, Arch. Math. Logic 30, 405-408.
64. Seldin, J. P., and Hindley, J. R. (Eds.) (1980), "To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism," Academic Press, New York.
65. Severi, P. (1996), "Normalisation in Lambda Calculus and Its relation to Type Inference," Ph.D. thesis, Eindhoven University of Technology.
66. Sørensen, M. H. (1996), Effective longest and infinite reduction paths in untyped λ-calculi, in "Colloquium on Trees in Algebra and Programming" (H. Kirchner, Ed.), pp. 287-301, Lecture Notes in Computer Science, Vol. 1059, Springer-Verlag, Berlin/New York.
67. Sørensen, M. H. (1996), Properties of infinite reduction paths in untyped λ-calculus, in "Proceedings, Tbilisi Symposium on Language, Logic, and Computation" (J. Ginzburg, Z. Khasidashvili, J. J. Lévy, E. Vogel, and E. Vallduvi, Eds.), CLSI Lecture Notes, to appear.
68. Sørensen, M. H. (1997), øNormalization in λ-Calculus and Type Theory," Ph.D. thesis, Department of Computer Science, University of Copenhagen.
69. Sørensen, M. H. (1997), Strong normalization from weak normalization in typed λ-calculi, Inform. and Comput. 133, 35-71.
70. Sørensen, M. H. (1998), A note on shortest developments, submitted for publication.
71. Deleted.
72. Statman, R. (1991), "A Local Translation of Untyped λ Calculus into Simply Typed λ Calculus," Research Report 91-134, Carnegie-Mellon University.
73. Tait, W. W. (1967), Intensional interpretations of functionals of finite type I, J. Symbolic Logic 32(2), 190-212.
74. Takahashi, M. (1995), Parallel reductions in λ-calculus, Inform. and Comput. 118, 120-127.
75. Terlouw, J. (1985), Reduction of higher type levels by means of an ordinal analysis of finite terms, Ann. Pure Appl. Logic 28, 73-102.
76. Terlouw, J. (1995), Strong normalization in type systems: A model theoretical approach, Ann. Pure Appl. Logic 73, 53-78.
77. Terlouw, J. (Feb. 1998), A proof of strong normalization for generalized labeled β-reduction by means of Horward's successor relation method, manuscript, Rijksuniversiteit Groningen, The Netherlands.
78. de Vrijer, R. C. (1985), A direct proof of the finite developments theorem, J. Symbolic Logic 50, 339-343.
79. de Vrijer, R. C. (1987), Exactly estimating functionals and strong normalization, Koninklijke Nederlandse Akademie van Wetenschappen 90(4). Also appeared in Indag. Math. 49, 479-493.
80. de Vrijer, R. C. (1987), Exactly estimating functionals and strong normalization, Koninklijke Nederlandse Akademie van Wetenschappen 90(4). Also appeared in Indag. Math. 49, 479-493.
81. de Vrijer, R. C. (1987), Exactly estimating functionals and strong normalization, Indag. Math. 49, 479-493.
82. de Vrijer, R. C. (1987), "Surjective Pairing and Strong Normalization: Two Themes in Lambda Calculus," Ph.D. thesis, University of Amsterdam.
83. Xi, H. (1996), "An Induction Measure on λ-Terms and Its Applications," Research Report 96-192, Department of Mathematical Sciences, Carnegie Mellon University.
84. Xi, H. (1996), "On Weak and Strong Normalisations," Research Report 96-187, Department of Mathematical Sciences, Carnegie Mellon University.
85. Xi, H. (1996), Separating developments, manuscript.
86. Xi, H. (1997), Upper bounds for standardization and an application, J. Symbolic Logic, to appear. An earlier version appeared in "Proceedings, 5th Kurt Gödel Colloquium," pp. 335-348, Lecture Notes in Computer Science, Vol. 1289, Springer-Verlag, Berlin/New York.
87. Xi, H. (1997), Upper bounds for standardization and an application, J. Symbolic Logic, to appear. An earlier version appeared in "Proceedings, 5th Kurt Gödel Colloquium," pp. 335-348, Lecture Notes in Computer Science, Vol. 1289, Springer-Verlag, Berlin/New York.
88. Xi, H. (1997), Weak and strong beta normalisations in typed λ-calculi, in "Typed Lambda Calculus and Applications" (P. de Groote and J. R. Hindley, Eds.), Lecture Notes in Computer Science, Vol. 1210, Springer-Verlag, Berlin/New York.