Token-passing nets for functional languages
From MaRDI portal
Recommendations
Cites work
- Call-by-need in token-passing nets
- Closed reduction: explicit substitutions without $\alpha$ -conversion
- Combinatory reduction systems: Introduction and survey
- Encoding left reduction in the λ-calculus with interaction nets
- scientific article; zbMATH DE number 439891 (Why is no real title available?)
- scientific article; zbMATH DE number 4035108 (Why is no real title available?)
- scientific article; zbMATH DE number 786495 (Why is no real title available?)
- Linear logic
- Rewriting Techniques and Applications
- The optimal implementation of functional programming languages
- Token-passing nets: call-by-need for free
- Typed Lambda Calculi and Applications
- YALE: yet another lambda evaluator based on interaction nets
Cited in
(5)
This page was built for publication: Token-passing nets for functional languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2873684)