Sequential and concurrent abstract machines for interaction nets

DOI10.1007/3-540-46432-8_18MaRDI QIDQ4508308zbMATH OpenFDO

Authors Jorge Sousa Pinto

Publication date 3 October 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46432-8_18

zbMATH Keywords

\(\lambda\)-calculusinteraction nets

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)

Recommendations

• Interaction Net Implementation of Additive and Multiplicative Structures
• Rewriting Techniques and Applications
• Parallel implementation models for the -calculus using the geometry of interaction. Extended abstract
• YALE: yet another lambda evaluator based on interaction nets
• YALE: yet another lambda evaluator based on interaction nets

Cited in

(25)

• Operational equivalence for interaction nets.
• Encoding linear logic with interaction combinators
• The graphical Krivine machine
• Parallel implementation models for the -calculus using the geometry of interaction. Extended abstract
• Parallel evaluation of interaction nets with MPINE
• Interaction nets with McCarthy's \(\mathsf{amb}\)
• Weak reduction and garbage collection in interaction nets
• A calculus for interaction nets based on the linear chemical abstract machine
• From functional programs to interaction nets via the rewriting calculus
• Realizing monads in interaction nets via generic typed rules
• scientific article; zbMATH DE number 2059570 (Why is no real title available?)
• Strategic port graph rewriting: an interactive modelling framework
• Parallelism and synchronization in an infinitary context
• Towards a GPU-based implementation of interaction nets
• An implementation model for interaction nets
• A simple parallel implementation of interaction nets in Haskell
• An abstract concurrent machine for rewriting
• Abstract machines, optimal reduction, and streams
• Recursive Functions with Pattern Matching in Interaction Nets
• Compilation of interaction nets
• Interaction automata and the ia2d interpreter
• CONCUR 2005 – Concurrency Theory
• An Explicit Framework for Interaction Nets
• An encoding of interaction nets in OCaml
• Nets, sequential components and concurrency relations

This page was built for publication: Sequential and concurrent abstract machines for interaction nets

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