Term graph rewriting
From MaRDI portal
Publication:4645801
DOI10.1007/3-540-61254-8_16zbMATH Open1407.68241OpenAlexW1503521015MaRDI QIDQ4645801FDOQ4645801
Authors: Jan Willem Klop 
Publication date: 11 January 2019
Published in: Higher-Order Algebra, Logic, and Term Rewriting (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61254-8_16
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Infinitary lambda calculus
- Explicit substitutions
- Transfinite reductions in orthogonal term rewriting systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lambda calculus with explicit recursion
- Explicit cyclic substitutions
- A complete proof system for nested term graphs
Cited In (14)
- Term graph rewriting and parallel term rewriting
- Title not available (Why is that?)
- Term-graph anti-unification
- A graph reduction approach to incremental term rewriting
- Simple type inference for term graph rewriting systems
- On term-graph rewrite strategies
- Complexity analysis of precedence terminating infinite graph rewrite systems
- Nested term graphs (work in progress)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Relational graph rewritings
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)
