Termination of Priority Rewriting

Isabelle Gnaedig 1
1 CARTE - Theoretical adverse computations, and safety
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [30 references]  Display  Hide  Download

https://hal.inria.fr/inria-00428679
Contributor : Isabelle Gnaedig <>
Submitted on : Wednesday, October 10, 2018 - 2:35:47 PM
Last modification on : Tuesday, December 18, 2018 - 4:48:02 PM
Long-term archiving on : Friday, January 11, 2019 - 4:12:35 PM

File

version-hal-lata.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

250

Files downloads

115