Implementing conditional term rewriting by graph rewriting

Theoretical Computer Science

Volumn 262, Issue 1-2, 2001, Pages 311-331

  Ohlebusch, Enno ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; GRAPH THEORY;

CONDITIONAL TERM REWRITING SYSTEMS (CTRS); GRAPH REWRITING;

LOGIC PROGRAMMING;

EID: 0034917701     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00209-7     Document Type: Article

References (19)

1. A needed narrowing strategy
2. Bisimilarity in term graph rewriting
3. Term graph rewriting, Proc. Parallel Architectures and Languages Europe
4. Conditional rewrite rules: Confluence and termination
5. Rewrite systems
6. The integration of functions into logic programming: From theory to practice
7. On extra variables in (equational) logic programming
8. On the adequacy of term graph rewriting for simulating term rewriting
9. Term rewriting systems
10. Modularity in Noncopying Term Rewriting
11. Completeness results for basic narrowing
12. Conditional term graph rewriting, Proc. 6th Internat. Conf. on Algebraic and Logic Programming
13. Church-Rosser theorems for abstract reduction modulo an equivalence relation, Proc. 9th Internat. Conf. on Rewriting Techniques and Applications
14. Term graph rewriting
15. Church-Rosser theorems for replacement systems
16. Computation on graph-like expressions
17. Level-confluence of conditional rewrite systems with extra variables in right-hand sides, Proc. 6th Internat. Conf. on Rewriting Techniques and Applications