An explicit Eta rewrite rule
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 94-108
- https://doi.org/10.1007/bfb0014047
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Eta-conversion for the languages of explicit substitutionsPublished by Springer Nature ,2005
- Explicit substitutions with de bruijn's levelsLecture Notes in Computer Science, 1995
- Typed λ-calculi with explicit substitutions may not terminatePublished by Springer Nature ,1995
- An explicit Eta rewrite rulePublished by Springer Nature ,1995
- Explicit substitutionsJournal of Functional Programming, 1991
- Confluence results for the pure strong categorical logic CCL. λ-calculi as subsystems of CCLTheoretical Computer Science, 1989
- Categorical combinatorsInformation and Control, 1986
- Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theoremIndagationes Mathematicae, 1972