File(s) not publicly available
An interaction net implementation of closed reduction
Closed reduction is a very efficient reduction strategy for the lambda calculus, which is explained using a simple form of explicit substitutions. This paper introduces this strategy, and gives an implementation as a system of interaction nets. We obtain one of the most efficient implementations of this kind to date
History
Publication status
- Published
Publisher
SpringerExternal DOI
Issue
5836Page range
43-59Pages
16.0Book title
Implementation and application of functional languagesISBN
9783642244513Series
Lecture notes in computer scienceDepartment affiliated with
- Informatics Publications
Full text available
- No
Peer reviewed?
- Yes
Editors
Sven-Bodo Scholz, Olaf ChitilLegacy Posted Date
2012-11-28Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC