Term graph rewriting
From MaRDI portal
Publication:4645801
Recommendations
Cites work
- scientific article; zbMATH DE number 3448081 (Why is no real title available?)
- scientific article; zbMATH DE number 919844 (Why is no real title available?)
- scientific article; zbMATH DE number 969070 (Why is no real title available?)
- scientific article; zbMATH DE number 234018 (Why is no real title available?)
- scientific article; zbMATH DE number 234035 (Why is no real title available?)
- A complete proof system for nested term graphs
- Explicit cyclic substitutions
- Explicit substitutions
- Infinitary lambda calculus
- Lambda calculus with explicit recursion
- Transfinite reductions in orthogonal term rewriting systems
Cited in
(15)- Foreword: special issue on term and graph rewriting
- A local graph-rewriting system for deciding equality in sum-product theories
- Term-graph rewriting in \textsc{Tom} using relative positions
- scientific article; zbMATH DE number 3921948 (Why is no real title available?)
- On term-graph rewrite strategies
- Term graph rewriting and parallel term rewriting
- From linear term rewriting to graph rewriting with preservation of termination
- Relational graph rewritings
- scientific article; zbMATH DE number 51605 (Why is no real title available?)
- A graph reduction approach to incremental term rewriting
- Simple type inference for term graph rewriting systems
- Term-graph anti-unification
- Complexity analysis of precedence terminating infinite graph rewrite systems
- Nested term graphs (work in progress)
- scientific article; zbMATH DE number 919844 (Why is no real title available?)
This page was built for publication: Term graph rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645801)