Typed λ-calculi with explicit substitutions may not terminate
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 328-334
- https://doi.org/10.1007/bfb0014062
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Termination of term rewriting by interpretationPublished by Springer Nature ,1993
- Strong normalization of substitutionsPublished by Springer Nature ,1992
- Explicit substitutionsJournal of Functional Programming, 1991
- Proof of termination of the rewriting system subst on CCLTheoretical Computer Science, 1986
- Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theoremIndagationes Mathematicae, 1972