Optimal evaluations of graph-like expressions

DOI10.1016/0304-3975(80)90051-1zbMath0426.68006OpenAlexW2022572034WikidataQ126439271 ScholiaQ126439271MaRDI QIDQ1136217

John Staples

Publication date: 1980

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(80)90051-1

zbMATH Keywords

graph-like expressionsoptimal evaluations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Abstract data types; algebraic specification (68Q65) Algorithms in computer science (68W99)

Related Items

Term graph rewriting and garbage collection using opfibrations, On ``On graph rewritings, Computation on graph-like expressions, Speeding up subtree replacement systems, Capturing strong reduction in director string calculus, Rewriting on cyclic structures: Equivalence between the operational and the categorical description, Transformations of structures: An algebraic approach

Cites Work

• Computation on graph-like expressions
• Speeding up subtree replacement systems
• A class of replacement systems with simple optimality theory
• Tree-Manipulating Systems and Church-Rosser Theorems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item