Termination of Order-Sorted Rewriting
Identifieur interne : 000F17 ( Crin/Curation ); précédent : 000F16; suivant : 000F18Termination of Order-Sorted Rewriting
Auteurs : I. GnaedigSource :
Abstract
In this paper, the problem of termination of rewriting in order-sorted algebras is addressed for the first time. Our goal is to perform termination proofs of programs for executable specification languages like \(OBJ3\). An extension of Lexicographic Path Ordering is proposed, that gives a termination proof for order-sorted rewrite systems, that would not terminate in the unsorted case. We mention also, that this extension provides a termination tool for unsorted terminating systems, that usual orderings cannot handle. This paper is an extended abstract of the CRIN report n. 91-R-108.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000F17
Links to Exploration step
CRIN:gnaedig92bLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="218">Termination of Order-Sorted Rewriting</title></titleStmt><publicationStmt><idno type="RBID">CRIN:gnaedig92b</idno><date when="1992" year="1992">1992</date><idno type="wicri:Area/Crin/Corpus">000F17</idno><idno type="wicri:Area/Crin/Curation">000F17</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">000F17</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Termination of Order-Sorted Rewriting</title><author><name sortKey="Gnaedig, I" sort="Gnaedig, I" uniqKey="Gnaedig I" first="I." last="Gnaedig">I. Gnaedig</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1707">In this paper, the problem of termination of rewriting in order-sorted algebras is addressed for the first time. Our goal is to perform termination proofs of programs for executable specification languages like \(OBJ3\). An extension of Lexicographic Path Ordering is proposed, that gives a termination proof for order-sorted rewrite systems, that would not terminate in the unsorted case. We mention also, that this extension provides a termination tool for unsorted terminating systems, that usual orderings cannot handle. This paper is an extended abstract of the CRIN report n. 91-R-108.</div></front></TEI><BibTex type="inproceedings"><ref>gnaedig92b</ref><crinnumber>92-R-199</crinnumber><category>3</category><equipe>PROTHEO</equipe><author><e>Gnaedig, I.</e></author><title>Termination of Order-Sorted Rewriting</title><booktitle>{Proceedings Third International Conference Algebraic and Logic Programming, Volterra (Italy)}</booktitle><year>1992</year><editor>H. Kirchner and G. Levi</editor><volume>632</volume><series>Lecture Notes in Computer Science</series><pages>37-52</pages><month>sep</month><publisher>Springer Verlag</publisher><abstract>In this paper, the problem of termination of rewriting in order-sorted algebras is addressed for the first time. Our goal is to perform termination proofs of programs for executable specification languages like \(OBJ3\). An extension of Lexicographic Path Ordering is proposed, that gives a termination proof for order-sorted rewrite systems, that would not terminate in the unsorted case. We mention also, that this extension provides a termination tool for unsorted terminating systems, that usual orderings cannot handle. This paper is an extended abstract of the CRIN report n. 91-R-108.</abstract></BibTex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000F17 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Curation/biblio.hfd -nk 000F17 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Curation
|type= RBID
|clé= CRIN:gnaedig92b
|texte= Termination of Order-Sorted Rewriting
}}
| This area was generated with Dilib version V0.6.33. |  |