File(s) not publicly available
Encoding strategies in the lambda calculus with interaction nets
Interaction nets are a graphical paradigm of computation based on graph rewriting. They have proven to be both useful and enlightening in the encoding of linear logic and the ?-calculus. This paper offers new techniques for the theory of interaction nets, with applications to the encoding of specific strategies in the ?-calculus. In particular we show how to recover the usual call-by-value and call-by-name reduction strategies from general encodings.
History
Publication status
- Published
Publisher
SpringerExternal DOI
Page range
19-36Pages
17.0Presentation Type
- paper
Event name
Lecture Notes in Computer ScienceEvent type
conferenceEvent date
2006ISBN
3-540-69174-XDepartment affiliated with
- Informatics Publications
Full text available
- No
Peer reviewed?
- Yes
Legacy Posted Date
2012-02-06Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC