Call-by-value -graph rewriting without rewriting

DOI10.1007/3-540-45832-8_8MaRDI QIDQ4438766zbMATH OpenFDO

Authors Maribel Fernández, Ian Mackie

Publication date 10 December 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2505/25050075.htm

Mathematics Subject Classification ID

Logic in computer science (03B70) 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
• The dynamic geometry of interaction machine: a token-guided graph rewriter
• Encoding Strategies in the Lambda Calculus with Interaction Nets
• Typed Lambda Calculi and Applications
• Parallel implementation models for the -calculus using the geometry of interaction. Extended abstract

Cited in

(5)

• A fully labelled lambda calculus: towards closed reduction in the geometry of interaction machine
• The dynamic geometry of interaction machine: a token-guided graph rewriter
• New developments in environment machines
• (Definitely not) boring interaction abstract machines
• Proof nets and the call-by-value \(\lambda\)-calculus

This page was built for publication: Call-by-value \(\lambda\)-graph rewriting without rewriting

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