Token-passing Nets for Functional Languages

DOI10.1016/j.entcs.2008.03.061zbMath1279.68044OpenAlexW2070852271MaRDI QIDQ2873684

Jorge Sousa Pinto, Miguel Vilaça, José Bacelar Almeida

Publication date: 24 January 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.03.061

zbMATH Keywords

recursion\(\lambda\)-calculusreduction strategiesinteraction nets

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) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Unnamed Item ⋮ Recursive Functions with Pattern Matching in Interaction Nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Combinatory reduction systems: Introduction and survey
• Encoding left reduction in the λ-calculus with interaction nets
• Closed reduction: explicit substitutions without $\alpha$ -conversion
• YALE
• Call-by-need in token-passing nets
• Typed Lambda Calculi and Applications
• Rewriting Techniques and Applications

This page was built for publication: Token-passing Nets for Functional Languages