REDEX CAPTURING IN TERM GRAPH REWRITING

DOI10.1142/S0129054190000266MaRDI QIDQ3210897zbMATH OpenOpenAlexFDO

Authors William M. Farmer, Ronald J. Watro

Publication date 1990

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054190000266

zbMATH Keywords

functional programminggraph reductioninfinite treesTerm graphs

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Redex capturing in term graph rewriting (concise version)
• Essentials of term graph rewriting
• scientific article; zbMATH DE number 177461
• On term-graph rewrite strategies
• Term graph rewriting and parallel term rewriting

Cited in

(14)

• Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
• Term graph rewriting and garbage collection using opfibrations
• Transitive term graph rewriting
• Lambda calculus with explicit recursion
• Relating graph and term rewriting via Böhm models
• Categorical rewriting of term-like structures
• Rewriting on cyclic structures: Equivalence between the operational and the categorical description
• Transfinite reductions in orthogonal term rewriting systems
• Redex capturing in term graph rewriting (concise version)
• Relating graph and term rewriting via Böhm models
• Critical pairs in term graph rewriting
• scientific article; zbMATH DE number 969069 (Why is no real title available?)
• Infinitary combinatory reduction systems
• Modularity in noncopying term rewriting

This page was built for publication: REDEX CAPTURING IN TERM GRAPH REWRITING

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210897)