Relative termination
Bericht
Faculties
Fakultät für Ingenieurwissenschaften und InformatikSeries
Ulmer Informatik-Berichte
Abstract
"Relative termination" is a property that generalizes both termination and "termination modulo". In order to prove that a term rewrite system relatively terminates, one may reuse the common termination quasiorderings. Further proof methods become available by the cooperation property. Relative termination sets up new proof techniques for termination and confluence. The usefulness of the notion of relative termination is finally demonstrated by a proof of completeness for "reduced narrowing" and "normal narrowing", two attractive variants of the narrowing procedure.
Date created
1991
Subject headings
[GND]: Termersetzungssystem[LCSH]: Rewriting systems (Computer science)
[DDC subject group]: DDC 004 / Data processing & computer science
Metadata
Show full item recordDOI & citation
Please use this identifier to cite or link to this item: http://dx.doi.org/10.18725/OPARU-2427
Geser, Alfons (2012): Relative termination. Open Access Repositorium der Universität Ulm und Technischen Hochschule Ulm. http://dx.doi.org/10.18725/OPARU-2427
Citation formatter >