Implementing term rewriting by jungle evaluation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4164141 (Why is no real title available?)
- scientific article; zbMATH DE number 3827230 (Why is no real title available?)
- scientific article; zbMATH DE number 4049017 (Why is no real title available?)
- scientific article; zbMATH DE number 4080885 (Why is no real title available?)
- scientific article; zbMATH DE number 177461 (Why is no real title available?)
- scientific article; zbMATH DE number 177826 (Why is no real title available?)
- scientific article; zbMATH DE number 3553769 (Why is no real title available?)
- scientific article; zbMATH DE number 3633737 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- Computation on graph-like expressions
- Graph grammars and operational semantics
- On graph rewritings
- Proving termination with multiset orderings
Cited in
(24)- A flexible categorial formalisation of term graphs as directed hypergraphs
- Symbol different term rewrite systems
- Critical pairs in term graph rewriting
- Bisimilarity in term graph rewriting.
- More problems in rewriting
- scientific article; zbMATH DE number 7450012 (Why is no real title available?)
- Essentials of term graph rewriting
- scientific article; zbMATH DE number 2090085 (Why is no real title available?)
- scientific article; zbMATH DE number 4080885 (Why is no real title available?)
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
- Towards ``mouldable code via nested code graph transformation
- On termination of graph rewriting
- Jungle rewriting: an abstract description of a lazy narrowing machine
- Term-Graph Rewriting Via Explicit Paths
- The generative power of delegation networks
- scientific article; zbMATH DE number 1738297 (Why is no real title available?)
- Term rewriting in \(\mathrm{CT}_\Sigma \)
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description
- Collapsed tree rewriting: Completeness, confluence, and modularity
- Single pushout transformations of equationally defined graph structures with applications to actor systems
- From Jinja bytecode to term rewriting: a complexity reflecting transformation
- scientific article; zbMATH DE number 4160147 (Why is no real title available?)
- scientific article; zbMATH DE number 4164141 (Why is no real title available?)
- A simple parallel implementation of interaction nets in Haskell
This page was built for publication: Implementing term rewriting by jungle evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3486867)