Encoding left reduction in the λ-calculus with interaction nets
From MaRDI portal
Recommendations
Cited in
(18)- The graphical Krivine machine
- An Interaction Net Encoding of Gödel’s System $$\mathcal {T}$$
- Weak reduction and garbage collection in interaction nets
- Encoding an object calculus into interaction nets
- A calculus for interaction nets based on the linear chemical abstract machine
- Universal Boolean systems
- Hard combinators
- Token-passing nets for functional languages
- Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting
- Encoding Strategies in the Lambda Calculus with Interaction Nets
- scientific article; zbMATH DE number 4047140 (Why is no real title available?)
- scientific article; zbMATH DE number 50753 (Why is no real title available?)
- scientific article; zbMATH DE number 1953288 (Why is no real title available?)
- scientific article; zbMATH DE number 860035 (Why is no real title available?)
- YALE: yet another lambda evaluator based on interaction nets
- YALE: yet another lambda evaluator based on interaction nets
- Rewriting Techniques and Applications
- An Explicit Framework for Interaction Nets
This page was built for publication: Encoding left reduction in the λ-calculus with interaction nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4405695)