Perpetuality in a named lambda calculus with explicit substitutions

Mathematical Structures in Computer Science

Volumn 11, Issue 1, 2001, Pages 47-90

  Bonelli, Eduardo ^a  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84970910497     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129500003248     Document Type: Article

References (37)

1. Abadi, M., Cardelli, L., Curien, P.-L. and Levy, J.-J. (1991) Explicit Substitutions. Journal of Functional Programming 4 (1) 375–416.
2. Barendregt, H. P. (1984) The Lambda Calculus: its Syntax and Semantics (revised edition), Studies in Logic and the Foundations of Mathematics 103, North-Holland.
3. Barendregt, H. P. (1992) Lambda Calculi with Types. In: Abramsky, S., Gabbay, D. M. and Maibaum, T. S. E. (eds.) Handbook of Logic in Computer Science, Volume 2 - Background: Computational Structures, Oxford University Press.
4. Barendregt, H. P., Bergstra, J. A., Klop, J. W. and Volken, H. (1976) Degrees, reductions and representability in the lambda calculus. Technical report Utrecht University, 1976, Preprint no. 22.
5. Benaissa, Z.E.A., Briaud, D., Lescanne, P. and Rouyer-Degli, J. (1996), a calculus of explicit substitutions which preserves strong normalization. Journal of Functional Programming 6 (5) 699–722.
6. Bergstra, J. A. and Klop, J.W. (1982) Strong normalization and perpetual reductions in the lambda calculus. Journal of Information Processing and Cybernetics 18 403–417.
7. Bloo, R. (1997) Preservation of Termination for Explicit Substitution, Ph. D. Thesis, Eindhoven University. Bloo, R. (1999) Pure Type Systems and Explicit Substitution. In: Proceedings of the International Workshop on Explicit Substitutions: Theory and Applications to Programs and Proofs, Trento, Italy.
8. Bloo, R. and Geuvers, H. (1998) Explicit Substitution: on the edge of strong normalization. Theoretical Computer Science 204.
9. Bonelli, E. (1999) The polymorphic lambda calculus with explicit substitutions. In: Proceedings of the International Workshop on Explicit Substitutions: Theory and Applications to Programs and Proofs, Trento, Italy.
10. Church, A. and Rosser, J. B. (1936) Some properties of conversion. Transactions of the American Mathematical Society 39 472–482.
11. Dershowitz, N. (1982) Orderings for term rewriting systems. Theoretical Computer Science 17 (3) 27229–301.
12. Ferreira, M., Kesner, D. and Puel, L. (1996) Lambda-calculi with explicit substitutions and composition which preserve beta-strong normalization. Proceedings of the 5th International Conference on Algebraic and Logic Programming (ALP'96). Springer-Verlag Lecture Notes in Computer Science 1139.
13. Gallier, J. H. (1990) On Girard's ‘candidates de reducibilite’. In: Odifreddi, P. (ed.) Logic in Computer Science, Academic Press, APIC Series 31 123–203.
14. Girard, J.-Y. (1972) Interpretation Fonctionnelle et Elimination des Coupures de l'Arithmetique d'Ordre Superieur, These d'Etat, Universite Paris.
15. Girard, J.-Y., Lafont, Y. and Taylor, P. (1989) Proofs and Types, Cambridge University Press.
16. Hardin, T. and Levy, J-J. (1989) A confluent calculus of substitutions. In: France Japan Artificial Intelligence and Computer Science Symposium.
17. Kamareddine, F. and Rios, A. (1995) A lambda calculus a la de Bruijn with Explicit Substitutions. Proceedings of the 7th International Symposium on Programming Languages: Implementations, Logics and Programs (PLILP'95). Springer-Verlag Lecture Notes in Computer Science 982.
18. Kesner, D. (1996) Confluence properties of extensional and non-extensional lambda calculi with explicit substitutions. Proceedings of the 7th International Conference on Rewriting Techniques and Applications (RTA'96). Springer-Verlag Lecture Notes in Computer Science 1103.
19. Khasidashvili Z. The longest perpetual reductions in orthogonal expression reduction systems. In Proceedings of the 3rd. International Conference on Logical Foundations of Computer Science (LFCS'94). Springer-Verlag Lecture Notes in Computer Science 813.
20. Khasidashvili, Z., Ogawa, M. and van Oostrom, V. (1999) Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems. Accepted for publication in Information and Computation.
21. Klop, J. W. (1980) Combinatory Reduction Systems, Mathematical Centre Tracts 127, CWI, Amsterdam.
22. Klop, J. W. (1992) Term rewriting systems. In: Handbook of Logic in Computer Science, Volume 2, Oxford University Press.
23. Lescanne, P. (1994) From to a journey through calculi of explicit substitutions. In: Ann. ACM Symp. on Principles of Programming Languages (POPL), ACM 60–69.
24. Mellies, P.A. (1995) Typed 2-calculi with explicit substitutions may not terminate. In: TLCA'95. Springer-Verlag Lecture Notes in Computer Science 902.
25. Mellies, P.A. (1996) Description Abstraite des Systemes de Reecriture, Ph.D. thesis, Universite Paris.
26. Muoz, C. A. (1996) Confluence and Preservation of Strong Normalisation in an Explicit Substitutions Calculus. Proceedings of the Eleven Annual IEEE Symposium on Logic in Computer Science.
27. Muoz, C. A. (1996b) Dependent Types with Explicit Substitutions: A meta-theoretical development. In: Proceedings of the International Workshop TYPES'96. Springer-Verlag Lecture Notes in Computer Science 1512.
28. Muoz, C. A. (1997) A Left-Linear Variant of. In: Proceedings of the International Conference PLILP/ALP/HOA'97, Southampton, UK.
29. van Raamsdonk, F. and Severi, P. (1995) On normalization. Technical Report CS-R9545, CWI.
30. van Raamsdonk, F., Severi, P., Sorensen, M. H. and Xi, H. (1999) Perpetuality in the 2-calculus. Journal of Information and Computation 149 (2).
31. Reynolds, J. C. (1974) Towards a Theory of Type Structure. In: Robinet, B. (ed.) Programming Symposium, Proceedings, Colloque sur la Programmation. Springer-Verlag Lecture Notes in Computer Science 19.
32. Rios, A. (1993) Contribution a l'etude des -calculs avec substitutions explicites, Ph. D. Thesis, Universite de Paris.
33. Ritter, E. (1999) Characterising Explicit Subsitutions which Preserve Termination (Extended Abstract). In: Typed Lambda Calculi and Applications.
34. Rose, K. (1992) Explicit Cyclic Substitutions. In: CTRS'92. Springer-Verlag Lecture Notes in Computer Science 656.
35. Sorensen, M.H. (1996) Effective longest and infinite reduction paths in untyped 2-calculus. In: Kirchner, H. (ed.) Proc. of the 19th Internatinal Colloqium on Trees in Algebra and Programming, CAAP'96. Springer-Verlag Lecture Notes in Computer Science 1059.
36. Tait, W. W. (1975) A realizability interpretation of the theory of species. In: Parikh, R. (ed.) Logic Colloquium. Springer-Verlag Lecture Notes in Computer Science 453.
37. Xi, H. (1996) An induction measure on 2-terms and its applications. Research Report 96 192 Department of Mathematical Sciences Carnegie Mellon University.