Redex capturing in term graph rewriting (concise version)

DOI10.1007/3-540-53904-2_82zbMath1503.68104OpenAlexW1546346749MaRDI QIDQ5055745

William M. Farmer, Ronald J. Watro

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-53904-2_82

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Simple type inference for term graph rewriting systems ⋮ Collapsed tree rewriting: Completeness, confluence, and modularity

Cites Work

• On graph rewritings
• On ``On graph rewritings
• Computation on graph-like expressions
• Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
• Transfinite reductions in orthogonal term rewriting systems
• REDEX CAPTURING IN TERM GRAPH REWRITING
• A new implementation technique for applicative languages
• Unnamed Item
• Unnamed Item