Implementing conditional term rewriting by graph rewriting

For reasons of efficiency, term rewriting is usually implemented by graph rewriting. Barendregt et al. showed that graph rewriting is a sound and complete implementation of (almost) orthogonal term rewriting systems. Their result was strengthened by Kennaway et al. who showed that graph rewriting is...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science Jg. 262; H. 1-2; S. 311 - 331
1. Verfasser: Ohlebusch, Enno
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 06.07.2001
Elsevier
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Computer science; control theory; systems
Exact sciences and technology
Graph theory
Mathematics
Sciences and techniques of general use
Theoretical computing
Term rewriting system
Rewriting
Conditional term rewriting system
Graph rewriting
Logical programming
Graph theory
Functional programming
Implementation
ISSN:0304-3975, 1879-2294
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:For reasons of efficiency, term rewriting is usually implemented by graph rewriting. Barendregt et al. showed that graph rewriting is a sound and complete implementation of (almost) orthogonal term rewriting systems. Their result was strengthened by Kennaway et al. who showed that graph rewriting is adequate for simulating term rewriting. In this paper, we extend the aforementioned results to a class of conditional term rewriting systems which plays a key role in the integration of functional and logic programming. In these systems extra variables are allowed in conditions and right-hand sides of rules. Moreover, it is shown that orthogonal conditional rules give rise to a subcommutative conditional graph rewrite relation. This implies that the graph rewrite relation is level-confluent.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/S0304-3975(00)00209-7