From functional programs to interaction nets via the rewriting calculus

DOI10.1016/J.ENTCS.2007.02.046MaRDI QIDQ2864528zbMATH OpenOpenAlexWikidataFDO

Authors Horatiu Cirstea, Maribel Fernández, Ian Mackie, François-Régis Sinot, 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

interaction netspattern-matchingrewriting calculus

Mathematics Subject Classification ID

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

Recommendations

• Recursive Functions with Pattern Matching in Interaction Nets
• Interaction nets vs. the -calculus: introducing bigraphical nets
• scientific article; zbMATH DE number 860035
• YALE: yet another lambda evaluator based on interaction nets
• YALE: yet another lambda evaluator based on interaction nets

Cites work

• A typed pattern calculus
• Combinatory reduction systems: Introduction and survey
• scientific article; zbMATH DE number 1722700 (Why is no real title available?)
• scientific article; zbMATH DE number 1722717 (Why is no real title available?)
• scientific article; zbMATH DE number 108369 (Why is no real title available?)
• scientific article; zbMATH DE number 1512623 (Why is no real title available?)
• scientific article; zbMATH DE number 194911 (Why is no real title available?)
• scientific article; zbMATH DE number 2090088 (Why is no real title available?)
• Interaction Net Implementation of Additive and Multiplicative Structures
• Interaction nets and term-rewriting systems
• Interaction nets vs. the -calculus: introducing bigraphical nets
• Lambda calculus with patterns
• Programming Languages and Systems
• Pure patterns type systems
• Rewriting calculus with(out) types
• Rewriting Techniques and Applications
• The bologna optimal higher-order machine
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Types for Proofs and Programs
• YALE: yet another lambda evaluator based on interaction nets

Cited in

(9)

• Interaction nets and term-rewriting systems
• Computation by interaction for space-bounded functional programming
• Encoding an object calculus into interaction nets
• Interaction nets vs. the -calculus: introducing bigraphical nets
• Interaction nets with nested pattern matching
• Token-passing nets for functional languages
• A simple parallel implementation of interaction nets in Haskell
• Recursive Functions with Pattern Matching in Interaction Nets
• Interpreting a finitary pi-calculus in differential interaction nets

Describes a project that uses

Uses Software

• MPINE

This page was built for publication: From functional programs to interaction nets via the rewriting calculus

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