Skip to Main content Skip to Navigation
Conference papers

Simplification and Termination of Strategies in Rule-Based Languages

Olivier Fissore 1 Isabelle Gnaedig 1 Hélène Kirchner 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In rule-based languages, control of rule application can be expressed thanks to strategy constructors. The paper addresses termination of such strategy-guided evaluation. To fix ideas, we use the ELAN strategy language. We first give a sufficient criterion for ELAN-like strategies to terminate, only lying on rewrite rules involved in the strategy. We then give a simplification process of strategies, itself described by rewriting, to empower the previous criterion. This simplification can also make proofs of other program properties easier.
Mots-clés : réécriture program simplification rewriting termination rule-based languages terminaison stratégies langages à base de règles simplification de programme
Complete list of metadatas
https://hal.inria.fr/inria-00099655
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 9:39:49 AM
Last modification on : Thursday, January 11, 2018 - 6:19:58 AM

Identifiers

  • HAL Id : inria-00099655, version 1

Collections

INRIA | CNRS | LORIA | UNIV-LORRAINE

Citation

Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Simplification and Termination of Strategies in Rule-Based Languages. Proceedings of the Fifth International Conference on Principles and Practice of Declarative Programming - PPDP'2003, Aug 2003, Uppsala, Sweden, pp.124-135. ⟨inria-00099655⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

120

 

Contact                    Legal Notice                    Personal Data