Encoding Strategies in the Lambda Calculus with Interaction Nets

DOI10.1007/11964681_2MaRDI QIDQ3623947zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

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

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

Cited in

(10)

• Encoding an object calculus into interaction nets
• Interaction nets vs. the -calculus: introducing bigraphical nets
• Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting
• Encoding left reduction in the λ-calculus with interaction nets
• scientific article; zbMATH DE number 2016068 (Why is no real title available?)
• scientific article; zbMATH DE number 860035 (Why is no real title available?)
• Modal embeddings and calling paradigms
• Call-by-need in token-passing nets
• Typed Lambda Calculi and Applications
• Proof nets and the call-by-value \(\lambda\)-calculus

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)