From Functional Programs to Interaction Nets via the Rewriting Calculus

DOI10.1016/j.entcs.2007.02.046zbMath1277.68100OpenAlexW2100747846WikidataQ126275038 ScholiaQ126275038MaRDI QIDQ2864528

Horatiu Cirstea, Ian Mackie, François-Régis Sinot, Maribel Fernández, Germain Faure

Publication date: 6 December 2013

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.2007.02.046

zbMATH Keywords

pattern-matchinginteraction netsrewriting calculus

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Recursive Functions with Pattern Matching in Interaction Nets

Uses Software

• MPINE

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Lambda calculus with patterns
• Combinatory reduction systems: Introduction and survey
• Interaction nets and term-rewriting systems
• A typed pattern calculus
• Pure patterns type systems
• Interaction Net Implementation of Additive and Multiplicative Structures
• The bologna optimal higher-order machine
• YALE
• Types for Proofs and Programs
• Programming Languages and Systems
• Rewriting Techniques and Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: From Functional Programs to Interaction Nets via the Rewriting Calculus