Computation on graph-like expressions

DOI10.1016/0304-3975(80)90013-4zbMath0423.68007OpenAlexW2022014483MaRDI QIDQ1134513

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)90013-4

zbMATH Keywords

efficient evaluations of expressions

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (12)

Term graph rewriting and garbage collection using opfibrations ⋮ Redex capturing in term graph rewriting (concise version) ⋮ On ``On graph rewritings ⋮ Annual Meeting of the Association for Symbolic Logic, Los Angeles, 1989 ⋮ Implementing term rewriting by jungle evaluation ⋮ Optimal evaluations of graph-like expressions ⋮ Speeding up subtree replacement systems ⋮ Structure sharing for quantified terms: Fundamentals ⋮ Rewriting on cyclic structures: Equivalence between the operational and the categorical description ⋮ Implementing conditional term rewriting by graph rewriting ⋮ Bisimilarity in term graph rewriting. ⋮ Transformations of structures: An algebraic approach

Cites Work

• Optimal evaluations of graph-like expressions
• Speeding up subtree replacement systems
• Dynamics of discrete systems and pattern reproduction
• Aspects of Applicative Programming for Parallel Processing
• Can programming be liberated from the von Neumann style?
• A class of replacement systems with simple optimality theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computation on graph-like expressions