Inductively Sequential Term-Graph Rewrite Systems

DOI10.1007/978-3-540-87405-8_7zbMath1175.68220OpenAlexW1789818915MaRDI QIDQ3540390

Rachid Echahed

Publication date: 20 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87405-8_7

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Ensuring Correctness of Model Transformations While Remaining Decidable ⋮ AGREE – Algebraic Graph Rewriting with Controlled Embedding ⋮ A strict constrained superposition calculus for graphs ⋮ Parallel rewriting of attributed graphs ⋮ Parallel coherent graph transformations ⋮ Programming with narrowing: a tutorial ⋮ Algebraic graph rewriting with controlled embedding ⋮ Compiling Collapsing Rules in Certain Constructor Systems ⋮ A Heterogeneous Pushout Approach to Term-Graph Transformation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Evaluation strategies for functional logic programming
• Lazy Context Cloning for Non-Deterministic Graph Rewriting
• Modeling Pointer Redirection as Cyclic Term-graph Rewriting
• A needed narrowing strategy
• Narrowing Data-Structures with Pointers
• Nondeterministic algebraic specifications and nonconfluent term rewriting
• Handbook of Graph Grammars and Computing by Graph Transformation
• Handbook of Graph Grammars and Computing by Graph Transformation
• Non Strict Confluent Rewrite Systems for Data-Structures with Pointers