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

Termination of Priority Rewriting


Introducing priorities in rewriting increases the expressive power of rules and helps to limit computations. Priority rewriting is used in rule-based programming as well as in functional programming. Termination of priority rewriting is then important to guarantee that programs give a result. We describe an inductive proof method for termination of priority rewriting, relying on an explicit induction on the termination property and working by generating proof trees, which model the rewriting relation by using abstraction and narrowing.
Fichier principal
Vignette du fichier
version-hal-lata.pdf (394.99 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00428679 , version 1 (10-10-2018)



Isabelle Gnaedig. Termination of Priority Rewriting. Third International Conference on Language and Automata Theory and Applications - LATA 2009, Apr 2009, Tarragona, Spain. pp.386-397, ⟨10.1007/978-3-642-00982-2_33⟩. ⟨inria-00428679⟩
90 View
52 Download



Gmail Facebook X LinkedIn More