Explicit substitutions with de bruijn's levels
- 1 January 1995
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 294-308
- https://doi.org/10.1007/3-540-59200-8_65
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Typed Lambda Calculi and ApplicationsPublished by Springer Nature ,1995
- From λσ to λυPublished by Association for Computing Machinery (ACM) ,1994
- Explicit substitutionsJournal of Functional Programming, 1991
- An abstract machine for Lambda-terms normalizationPublished by Association for Computing Machinery (ACM) ,1990
- Incremental reduction in the lambda calculusPublished by Association for Computing Machinery (ACM) ,1990
- Rewrite SystemsPublished by Elsevier ,1990
- Completion for rewriting modulo a congruenceTheoretical Computer Science, 1989
- Confluence results for the pure strong categorical logic CCL. λ-calculi as subsystems of CCLTheoretical Computer Science, 1989
- Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theoremIndagationes Mathematicae, 1972