Call-by-need in token-passing nets

DOI10.1017/S0960129506005408zbMATH Open1122.68034OpenAlexW2161307913MaRDI QIDQ5482263FDOQ5482263

François-Régis Sinot

Publication date: 28 August 2006

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129506005408

Recommendations

• Token-passing nets: call-by-need for free
• Typed Lambda Calculi and Applications
• Encoding Strategies in the Lambda Calculus with Interaction Nets
• The call-by-need lambda calculus
• The call-by-need lambda calculus

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (4)

• Token-passing nets: call-by-need for free
• Token-passing nets for functional languages
• Complete laziness: a natural semantics
• Typed Lambda Calculi and Applications

This page was built for publication: Call-by-need in token-passing nets

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