From functional programs to interaction nets via the rewriting calculus
From MaRDI portal
Publication:2864528
DOI10.1016/J.ENTCS.2007.02.046zbMATH Open1277.68100OpenAlexW2100747846WikidataQ126275038 ScholiaQ126275038MaRDI QIDQ2864528FDOQ2864528
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
Recommendations
- Recursive Functions with Pattern Matching in Interaction Nets
- Interaction nets vs. the \(\rho\)-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
- Title not available (Why is that?)
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Combinatory reduction systems: Introduction and survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Programming Languages and Systems
- Title not available (Why is that?)
- Lambda calculus with patterns
- Title not available (Why is that?)
- Rewriting calculus with(out) types
- Pure patterns type systems
- Rewriting Techniques and Applications
- Types for Proofs and Programs
- Interaction nets and term-rewriting systems
- YALE
- The bologna optimal higher-order machine
- A typed pattern calculus
- Title not available (Why is that?)
- Interaction nets vs. the \(\rho\)-calculus: introducing bigraphical nets
- Interaction Net Implementation of Additive and Multiplicative Structures
Cited In (5)
Uses Software
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)
