Termination of Priority Rewriting

Isabelle Gnaedig (1)

1 CARTE - Theoretical adverse computations, and safety

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.

Mots clés: abstraction; ordering constraint; innermost; narrowing; mechanical verification; mathematical induction; priority rewriting; termination

Domaines: Logique en informatique [cs.LO]

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⟩