Axiomatic rewriting theory II: The λσ-calculus enjoys finite normalization cones

Journal of Logic and Computation

Volumn 10, Issue 3, 2000, Pages 461-487

  Melliès, Paul André ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES;

EXPLICIT SUBSTITUTIONS; LAMBDA CALCULUS; NORMALIZATION; REWRITING THEORY;

DIFFERENTIATION (CALCULUS);

EID: 0033702110     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/10.3.461     Document Type: Article

References (25)

1. M. Abadi, L. Cardelli, P.-L. Curien and J.-J. Lévy. 'Explicit substitutions'. Journal of Functional Programming, 1, 375-416, 1991.
2. H. Barendregt, The Lambda Calculus: Its Syntax and Semantics. North Holland, 1985.
3. G. Berry, Modèles Complètement Adéquats et Stables des Lambda-calculs Typés. Thèse de Doctorat d'Etat, Université Paris VII, 1979.
4. G. Boudol, Computational semantics of term rewriting systems. Algebraic methods in Semantics, M. Nivat and J. C. Reynolds, eds., Cambridge University Press, 1985.
5. H.-B. Curry and R. Feys, Combinatory Logic. Volume 1, North Holland, 1958.
6. P.-L. Curien, T. Hardin and A. Ríos. 'Strong normalization of substitutions'. Lecture Notes in Computer Science, 629, 209-217, 1992.
7. D. Clark and R. Kennaway. Event structures and non-orthogonal term graph rewriting. In Mathematical Strucv tures in Computer Science, Vol. 6, pp. 545-578, 1996.
8. M. J. O'Donnell. Computing in Systems Described by Equations. Lecture Notes in Computer Science 58, Springer Verlag, 1977.
9. G. Gonthier, J.-J. Lévy and P.-A. Melliès. An abstract standardization theorem. In Proceedings Logic In Computer Science 92, Santa Cruz, 1992.
10. T. Hardin. Confluence Results for the Pure Strong Categorical Logic CCL. λ-calculi as subsystems of CCL. Theoretical Computer Science, 65, 291-342, 1989.
11. B. P. Hilken. Towards a proof theory of rewriting: the simply typed 2λ-calculus. Theoretical Computer Science, 170, 407-444, 1996.
12. G. Huet. Confluent reductions: abstract properties and applications to term rewriting systems. J. Computer and Systems Sciences, 23, 11-21, 1981.
13. G. Huet and J.-J. Lévy. Call by need computations in non-ambiguous linear term rewriting systems. Rapport de recherche INRIA 359, 1979. Republished as Computations in orthogonal rewriting systems, I and II in Computational Logic, Essays in Honor of Alan Robinson, J.-L. Lassez and G. Plotkin, eds., pp. 395-443. MIT Press, Cambridge, MA, 1991.
14. J. Glauert and Z. Khasidashvili. Relative normalization in deterministic residual structures. In Proceedings Colloquium on Trees in Algebra And Programming 96, Linköping, Lecture Notes in Computer Science 1059, Springer Verlag, 1996.
15. J. W. Klop. Term rewriting systems. In Handboot of Logic in Computer Science, Volume 2, S. Abramsky, Dov M. Gabbay and T.S.E. Maibaum, editors, Oxford Science Publications, 1992.
16. J.-J. Lévy. Réductions Correctes et Optimales dans le λ-Calcul. Thèse de Doctorat d'Etat, Université Paris VII, 1978.
17. S. MacLane. Categories for the Working Mathematician, Springer Verlag, 1971.
18. L. Maranget. La stratégie paresseuse. Thèse de l'Université Paris VII, 1992.
19. P.-A. Melliès. Typed lambda calculi with explicit substitutions may not terminate. In Proceedings Typed Lambda Calculus and Applications 95, Edinburgh, Lecture Notes in Computer Science 902, Springer Verlag, 1995.
20. P.-A. Melliès. Description axiomatique des systèmes de réécriture. Thèse de l'Université Paris VII, December 1996.
21. P.-A. Melliès. Axiomatic rewriting theory I: An axiomatic standardization theorem, submitted to Information and Computation, 2000.
22. P.-A. Melliès, Axiomatic rewriting theory III: A factorization theorem in rewriting theory. In Proceedings Category Theory and Computer Science 97, Santa Margherita Ligure, Lecture Notes in Computer Science 1290, Springer Verlag, pp. 49-68, 1997.
23. P.-A. Melliès. Axiomatic rewriting theory IV: A stability theorem in rewriting theory. In Proceedings Logic In Computer Science 98, Indianapolis, 1998.
24. P. Taylor. The trace factorization of stable functors. Paper available at http://www.dcs.qmw.ac.uk/~pt/, 1988.
25. H. Zantema. Termination of Term Rewriting by Interpretation. LNCS 656, Springer Verlag, 1993.