Modeling Pointer Redirection as Cyclic Term-graph Rewriting
From MaRDI portal
Publication:2867899
DOI10.1016/j.entcs.2006.10.027zbMath1278.68076OpenAlexW1969050460MaRDI QIDQ2867899
Dominique Duval, Rachid Echahed, Frédéric Prost
Publication date: 20 December 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2006.10.027
Related Items
Inductively Sequential Term-Graph Rewrite Systems ⋮ A Heterogeneous Pushout Approach to Term-Graph Transformation ⋮ On Term-Graph Rewrite Strategies
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
- Term graph rewriting and garbage collection using opfibrations
- Double-pushout graph transformation revisited
- A needed narrowing strategy
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Handbook of Graph Grammars and Computing by Graph Transformation
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description
- Handbook of Graph Grammars and Computing by Graph Transformation
- Graph Transformations
- Adjunction for Garbage Collection with Application to Graph Rewriting
- Relational and Kleene-Algebraic Methods in Computer Science