Termination of Order-sorted Rewriting - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Termination of Order-sorted Rewriting

Isabelle Gnaedig


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.
Fichier principal
Vignette du fichier
termin-os-conf-preprint.pdf (295.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01893012 , version 1 (11-10-2018)



Isabelle Gnaedig. Termination of Order-sorted Rewriting. ALP 1992 - 3rd International Conference on Algebraic and Logic Programming, Sep 1992, Volterra, Italy. pp.37 - 52, ⟨10.1007/bfb0013818⟩. ⟨hal-01893012⟩
25 View
137 Download



Gmail Facebook Twitter LinkedIn More