Computation on graph-like expressions
From MaRDI portal
Cites work
- A class of replacement systems with simple optimality theory
- Aspects of Applicative Programming for Parallel Processing
- Can programming be liberated from the von Neumann style?
- Dynamics of discrete systems and pattern reproduction
- scientific article; zbMATH DE number 3466555 (Why is no real title available?)
- scientific article; zbMATH DE number 3478372 (Why is no real title available?)
- scientific article; zbMATH DE number 3556036 (Why is no real title available?)
- scientific article; zbMATH DE number 3591400 (Why is no real title available?)
- scientific article; zbMATH DE number 3630695 (Why is no real title available?)
- scientific article; zbMATH DE number 3322506 (Why is no real title available?)
- scientific article; zbMATH DE number 3423994 (Why is no real title available?)
- Optimal evaluations of graph-like expressions
- Speeding up subtree replacement systems
Cited in
(12)- On ``On graph rewritings
- Optimal evaluations of graph-like expressions
- Speeding up subtree replacement systems
- Term graph rewriting and garbage collection using opfibrations
- Bisimilarity in term graph rewriting.
- Annual Meeting of the Association for Symbolic Logic, Los Angeles, 1989
- Implementing term rewriting by jungle evaluation
- Transformations of structures: An algebraic approach
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description
- Redex capturing in term graph rewriting (concise version)
- Implementing conditional term rewriting by graph rewriting
- Structure sharing for quantified terms: Fundamentals
This page was built for publication: Computation on graph-like expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1134513)
