No CrossRef data available.
Article contents
Encoding left reduction in the λ-calculus with interaction nets
Published online by Cambridge University Press: 17 January 2003
Abstract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.
This paper presents a simple implementation of the λ-calculus in the interaction net paradigm. It is based on a two-fold translation. λ-terms are coded (for duplication) or decoded (for execution), and reduction is achieved by switching between these two states: decoding corresponds to head reduction and encoding to left reduction.
Information
- Type
- Research Article
- Information
- Copyright
- 2002 Cambridge University Press
You have
Access
- 17
- Cited by