Strong normalization of Herbelin's explicit substitution calculus with substitution propagation

Journal of Logic and Computation

Volumn 13, Issue 5, 2003, Pages 689-706

  Dyckhoff, Roy ^a   Urban, Christian ^b  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

^b University of Cambridge   (United Kingdom)

Author keywords

Explicit substitution; Lambda calculus; Strong normalization

Indexed keywords

COMPUTER SIMULATION; FORMAL LOGIC; PROBLEM SOLVING; THEOREM PROVING;

STRONG NORMALIZATION; SUBSTITUTION PROPAGATION;

DIFFERENTIATION (CALCULUS);

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

References (20)

1. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
2. R. Bloo and H. Geuvers. Explicit substitution: on the edge of strong normalisation. Theoretical Computer Science, 211, 375-395, 1999.
3. R. Bloo and K. H. Rose. Preservation of strong normalisation in named lambda calculi with explicit substitution and garbage collection. In Proceedings of Computing Science in the Netherlands'95, pp. 62-72, 1995.
4. I. Cervesato and F. Pfenning. A linear spine calculus. Journal of Logic and Computation, 13, 639-688, 2003.
5. R. Dyckhoff and L. Pinto. Proof search in constructive logic. In Proceedings of the Logic Colloquium 1997, S. B. Cooper and J. K. Truss, eds, p. 53-65. Volume 258 of London Mathematical Society Lecture Note Series, Cambridge University Press, 1997.
6. R. Dyckhoff and L. Pinto. Cut-elimination and a permutation-free sequent calculus for intuitionistic logic. Studia Logica, 60, 107-118, 1998.
7. R. Dyckhoff and C. Urban. Strong normalisation of Herbelin's explicit substitution calculus with substitution propagation. In Proceedings of the Fourth Workshop on Explicit Substitutions Theory and Applications, P. Lescanne, ed., pp. 26-45. Logic Group Preprint Series No. 210, Institute of Philosophy, Utrecht University, 2001.
8. J. C. Espírito Santo. Revisiting the correspondence between cut elimination and normalisation. In Proceedings of the Twenty-seventh International Colloquium on Automata, Languages and Programming, U. Montanari, J. D. P. Rolim, and E. Welzl, eds, pp. 600-611. Volume 1853 of Lecture Notes in Computer Science, Springer-Verlag, 2000.
9. J. C. Espírito Santo. Conservative Extensions of the λ-calculus for the Computational Interpretation of Sequent Calculus. PhD thesis, Division of Informatics, University of Edinburgh, June 2002.
10. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13, 341-363, 2002.
11. H. Herbelin. A λ-calculus structure isomorphic to sequent calculus structure. In Proceedings of the 1994 Conference on Computer Science Logic, L. Pacholski and J. Tiuryn, eds, pp. 67-75. Volume 933 of Lecture Notes in Computer Science, Springer Verlag, 1995.
12. H. Herbelin. Explicit substitutions and reducibility. Journal of Logic and Computation, 11, 429-449, 2001.
13. F. Joachimski and R. Matthes. Short proofs of normalisation for the simply-typed lambda-calculus permutative conversions and Gödel's ⊤. Archive for Mathematical Logic, 42, 59-87, 2003.
14. P. Lescanne. From λσ to λν: a journey through calculi of explicit substitutions. In Proceedings of the Twenty-first Annual Symposium on Principles of Programming Languages, H.-J. Boehm, ed., pp. 60-69. ACM Press, 1994.
15. R. Mayr and T. Nipkow. Higher-order rewrite systems and their confluence. Theoretical Computer Science, 192, 3-29, 1998.
16. K. H. Rose. Explicit substitution: tutorial & survey. Technical report, BRICS, Department of Computer Science, University of Aarhus, 1996.
17. F. v. Raamsdonk and P. Severi. On normalisation. Technical report, TR CS-R9545, Centrum voor Wiskunde en Informatica, Amsterdam, 1996. Later incorporated into [18].
18. F. v. Raamsdonk, P. Severi, M. H. Sörensen, and H. Xi. Perpetual reductions in lambda calculus. Information and Computation, 149, 173-225, 1999.
19. R. Vestergaard and J. Brotherston. A formalised first-order confluence proof for the λ-calculus using one-sorted variable names. In Proceedings of the Twelfth International Conference on Rewriting Techniques and Applications, A. Middeldorp, ed., pp. 306-321. Volume 2051 of Lecture Notes in Computer Science, Springer-Verlag, 2001.
20. R. Vestergaard and J. Wells. Cut rules and explicit substitutions. Mathematical Structures in Computer Science, 11, 131-168, 2000.