Three Syntactic Theories for Combinatory Graph Reduction

DOI10.1007/978-3-642-20551-4_1zbMath1326.68090OpenAlexW2268291652MaRDI QIDQ3003482

Olivier Danvy, Ian Zerny

Publication date: 27 May 2011

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20551-4_1

Mathematics Subject Classification ID

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

Related Items (2)

On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation ⋮ On graph rewriting, reduction, and evaluation in the presence of cycles

Uses Software

• DACTL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properties of a first-order functional language with sharing
• The lambda calculus. Its syntax and semantics. Rev. ed.
• On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion
• LEAN: An intermediate language based on graph rewriting
• Apparent variables from the standpoint of combinatory logic
• Defunctionalized Interpreters for Call-by-Need Evaluation
• Small-step and big-step semantics for call-by-need
• From Reduction-Based to Reduction-Free Normalization
• A new implementation technique for applicative languages
• The call-by-need lambda calculus
• The call-by-need lambda calculus
• A computational formalization for partial evaluation
• Lazy evaluation and delimited control
• On global dynamics of optimal graph reduction

This page was built for publication: Three Syntactic Theories for Combinatory Graph Reduction