Three Syntactic Theories for Combinatory Graph Reduction

DOI10.1007/978-3-642-20551-4_1MaRDI QIDQ3003482zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Three syntactic theories for combinatory graph reduction
• Graph reducibility of term rewriting systems
• scientific article; zbMATH DE number 48833
• A template based graph reduction system based on combinators.
• Reduction graphs in the lambda calculus
• Confluence of indirection reductions in graph rewrite systems
• scientific article; zbMATH DE number 177461
• A graph reduction approach to incremental term rewriting
• scientific article; zbMATH DE number 177434
• Combinatory reduction systems: Introduction and survey

Cites work

• scientific article; zbMATH DE number 3730111 (Why is no real title available?)
• scientific article; zbMATH DE number 108369 (Why is no real title available?)
• scientific article; zbMATH DE number 194911 (Why is no real title available?)
• scientific article; zbMATH DE number 919844 (Why is no real title available?)
• scientific article; zbMATH DE number 3351217 (Why is no real title available?)
• A computational formalization for partial evaluation
• A new implementation technique for applicative languages
• Apparent variables from the standpoint of combinatory logic
• Defunctionalized interpreters for call-by-need evaluation
• From reduction-based to reduction-free normalization
• LEAN: An intermediate language based on graph rewriting
• Lazy evaluation and delimited control
• On global dynamics of optimal graph reduction
• On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion
• Properties of a first-order functional language with sharing
• Small-step and big-step semantics for call-by-need
• The call-by-need lambda calculus
• The call-by-need lambda calculus
• The lambda calculus. Its syntax and semantics. Rev. ed.

Cited in

(6)

• On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation
• Three syntactic theories for combinatory graph reduction
• scientific article; zbMATH DE number 3909737 (Why is no real title available?)
• Syntactic theories in practice
• A template based graph reduction system based on combinators.
• On graph rewriting, reduction, and evaluation in the presence of cycles

Describes a project that uses

Uses Software

• DACTL

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

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