REDEX CAPTURING IN TERM GRAPH REWRITING

DOI10.1142/S0129054190000266zbMath0723.68057OpenAlexW2025108869MaRDI QIDQ3210897

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 programminginfinite treesgraph reductionTerm graphs

Mathematics Subject Classification ID

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

Related Items (13)

Term graph rewriting and garbage collection using opfibrations ⋮ Redex capturing in term graph rewriting (concise version) ⋮ Transitive term graph rewriting ⋮ Lambda calculus with explicit recursion ⋮ Relating graph and term rewriting via Böhm models ⋮ Critical pairs in term graph rewriting ⋮ Rewrite, rewrite, rewrite, rewrite, rewrite, \dots ⋮ Modularity in noncopying term rewriting ⋮ Categorical rewriting of term-like structures ⋮ Infinitary combinatory reduction systems ⋮ Rewriting on cyclic structures: Equivalence between the operational and the categorical description ⋮ Transfinite reductions in orthogonal term rewriting systems ⋮ Relating graph and term rewriting via Böhm models

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