Origin functions in λ-calculus and term rewriting systems
- 1 January 1992
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systemsPublished by Association for Computing Machinery (ACM) ,1991
- Debugging standard ML without reverse engineeringPublished by Association for Computing Machinery (ACM) ,1990
- Explicit substitutionsPublished by Association for Computing Machinery (ACM) ,1990
- On laziness and optimality in lambda interpreters: tools for specification and analysisPublished by Association for Computing Machinery (ACM) ,1990
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theoremIndagationes Mathematicae, 1972