Term graph rewriting and garbage collection using opfibrations

DOI10.1016/0304-3975(94)90090-6zbMath0817.18006OpenAlexW2048022954MaRDI QIDQ1331928

Richard Banach

Publication date: 23 July 1995

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90090-6

zbMATH Keywords

semanticspushoutsgarbage collectionopfibrationsterm graph rewriting language DACTL

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30) Theories (e.g., algebraic theories), structure, and semantics (18C10)

Related Items (5)

Weak fibrations ⋮ Relational matching for graphical calculi of relations ⋮ Locating the contractum in the double pushout approach ⋮ The contractum in algebraic graph rewriting ⋮ Modeling Pointer Redirection as Cyclic Term-graph Rewriting

Uses Software

• DACTL

Cites Work

• On graph rewritings
• Implementing term rewrite languages in DACTL
• On ``On graph rewritings
• Computation on graph-like expressions
• Optimal evaluations of graph-like expressions
• Speeding up subtree replacement systems
• Categorical models of polymorphism
• LEAN: An intermediate language based on graph rewriting
• Domain theoretic models of polymorphism
• Weak fibrations
• REDEX CAPTURING IN TERM GRAPH REWRITING
• Fibered categories and the foundations of naive category theory
• A category-theoretic account of program modules
• Transfinite reductions in orthogonal term rewriting systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Term graph rewriting and garbage collection using opfibrations