Simplification and Termination of Strategies in Rule-Based Languages - Archive ouverte HAL Access content directly
Conference Papers Year : 2003

Simplification and Termination of Strategies in Rule-Based Languages

(1) , (1) , (1)
1

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.
Not file

Dates and versions

inria-00099655 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00099655 , version 1

Cite

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⟩
48 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More