Recursive Functions with Pattern Matching in Interaction Nets

DOI10.1016/J.ENTCS.2009.10.017MaRDI QIDQ5170281zbMATH OpenOpenAlexFDO

Authors

Publication date 23 July 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.2009.10.017

zbMATH Keywords

interaction netspattern matchingrecursion

Mathematics Subject Classification ID

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

Recommendations

• Interaction nets with nested pattern matching
• On recurrent and recursive interconnection patterns
• Pattern avoiding languages and recurrence relations interpretation
• Recursion and Petri nets
• Interaction nets and term-rewriting systems
• scientific article; zbMATH DE number 860037
• scientific article; zbMATH DE number 1804102
• From functional programs to interaction nets via the rewriting calculus

Cites work

• A typed pattern calculus
• Combinatory reduction systems: Introduction and survey
• From functional programs to interaction nets via the rewriting calculus
• 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 2059570 (Why is no real title available?)
• scientific article; zbMATH DE number 1487844 (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 nets and term-rewriting systems
• Interaction nets vs. the -calculus: introducing bigraphical nets
• LCF considered as a programming language
• Programming Languages and Systems
• Rewriting calculus with(out) types
• Rewriting Techniques and Applications
• The bologna optimal higher-order machine
• Token-passing nets for functional languages
• YALE: yet another lambda evaluator based on interaction nets

Cited in

(8)

• On recurrent and recursive interconnection patterns
• Refined compilation of pattern-matching for functional languages
• scientific article; zbMATH DE number 1638660 (Why is no real title available?)
• From functional programs to interaction nets via the rewriting calculus
• Interaction nets with nested pattern matching
• Transport of finiteness structures and applications
• A sound strategy to compile general recursion into finite depth pattern matching
• Compilation of extended recursion in call-by-value functional languages

Describes a project that uses

Uses Software

• MPINE

This page was built for publication: Recursive Functions with Pattern Matching in Interaction Nets

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