Encoding Strategies in the Lambda Calculus with Interaction Nets

DOI10.1007/11964681_2zbMATH Open1236.68032OpenAlexW1569330921MaRDI QIDQ3623947FDOQ3623947

Ian Mackie

Publication date: 28 April 2009

Published in: Implementation and Application of Functional Languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11964681_2

Recommendations

• Encoding left reduction in the λ-calculus with interaction nets
• Typed Lambda Calculi and Applications
• Call-by-need in token-passing nets
• YALE: yet another lambda evaluator based on interaction nets
• Token-passing nets: call-by-need for free

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Functional programming and lambda calculus (68N18)

Cited In (6)

• Title not available (Why is that?)
• Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting
• Title not available (Why is that?)
• Proof nets and the call-by-value \(\lambda\)-calculus
• Encoding left reduction in the λ-calculus with interaction nets
• Typed Lambda Calculi and Applications

This page was built for publication: Encoding Strategies in the Lambda Calculus with Interaction Nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3623947)