The dynamic geometry of interaction machine: a token-guided graph rewriter

MaRDI QIDQ4972738zbMATH OpenFDO

Authors Koko Muroya, Dan R. Ghica

Publication date 26 November 2019

Full work available at URL https://arxiv.org/abs/1803.00427

zbMATH Keywords

cost analysisevaluation strategiegeometry of interaction

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Recommendations

• The Dynamic Geometry of Interaction Machine: A Call-by-Need Graph Rewriter
• scientific article; zbMATH DE number 2016068
• Rewriting Techniques and Applications
• An abstract machine for strong call by value
• Reversible, irreversible and optimal \(\lambda\)-machines

Cites work

• (Leftmost-outermost) beta reduction is invariant, indeed
• A call-by-name lambda-calculus machine
• A functional perspective on machine learning via programmable induction and abduction
• Call-by-name, call-by-value, call-by-need and the linear lambda calculus
• Call-by-value in a basic logic for interaction
• Closed reduction: explicit substitutions without $\alpha$ -conversion
• Computation by interaction for space-bounded functional programming
• Deriving a lazy abstract machine
• Distilling abstract machines
• Functorial Boxes in String Diagrams
• Geometry of synthesis III
• Geometry of synthesis. IV: Compiling affine recursion into static hardware
• Geometry of synthesis: a structured approach to VLSI design
• scientific article; zbMATH DE number 4123722 (Why is no real title available?)
• scientific article; zbMATH DE number 2016068 (Why is no real title available?)
• Jumping Boxes
• Linear dependent types and relative completeness
• Linear dependent types in a call-by-value scenario
• Linear logic
• Memoryful geometry of interaction. II: Recursion and adequacy
• Memoryful geometry of interaction: from coalgebraic components to algebraic effects
• New developments in environment machines
• On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation
• On the value of variables
• Strongly reducing variants of the Krivine abstract machine
• The Dynamic Geometry of Interaction Machine: A Call-by-Need Graph Rewriter
• The geometry of parallelism: classical, probabilistic, and quantum effects
• The Mechanical Evaluation of Expressions
• The Negligible and Yet Subtle Cost of Pattern Matching
• The structural \(\lambda \)-calculus
• The useful MAM, a reasonable implementation of the strong -calculus
• Typed Lambda Calculi and Applications

Cited in

(8)

• scientific article; zbMATH DE number 1722659 (Why is no real title available?)
• scientific article; zbMATH DE number 1722666 (Why is no real title available?)
• A fully labelled lambda calculus: towards closed reduction in the geometry of interaction machine
• scientific article; zbMATH DE number 2016068 (Why is no real title available?)
• scientific article; zbMATH DE number 7456059 (Why is no real title available?)
• Abstract machines, optimal reduction, and streams
• The Dynamic Geometry of Interaction Machine: A Call-by-Need Graph Rewriter
• Rewriting for symmetric monoidal categories with commutative (co)monoid structure

This page was built for publication: The dynamic geometry of interaction machine: a token-guided graph rewriter

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