File(s) not publicly available
Efficient lambda-Evaluation with Interaction Nets
This paper presents an efficient implementation of the ?-calculus using the graph rewriting formalism of interaction nets. Building upon a series of previous works, we obtain one of the most efficient implementations of this kind to date: out performing existing interaction net implementations, as well as other approaches. We conclude the paper with extensive testing to demonstrate the capabilities of this evaluator.
History
Publication status
- Published
Publisher
SpringerPages
15.0Presentation Type
- paper
Event name
Lecture Notes in Computer ScienceEvent type
conferenceISBN
3-540-22153-0Department affiliated with
- Informatics Publications
Full text available
- No
Peer reviewed?
- Yes