Compact Normalisation Trace via Lazy Rewriting - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2001

Compact Normalisation Trace via Lazy Rewriting


Innermost strategy is usually used in compiling term rewriting systems (TRSs) because it allows to build efficiently the result term in a bottom-up fashion. However, the innermost strategy does not always give the shortest normalising derivation. In many cases, using an appropriate laziness annotation on the arguments of the function symbols, we evaluate the lazy arguments only if it is necessary and hence, get a shorter derivation to the normal form while avoiding the non-terminating reductions. We provide in this work a transformation of the annotated TRSs, that allows to compute the normal form using an innermost strategy and to extract a lazy derivation in the original TRS from the normalising derivation in the transformed TRS. We apply our result to improve the efficiency of equational reasoning in the {\Coq} proof assistant using {\ELAN} as an external rewriting engine.
Fichier principal
Vignette du fichier
A01-R-139.pdf (296.94 Ko) Télécharger le fichier

Dates and versions

inria-00107874 , version 1 (17-01-2007)


  • HAL Id : inria-00107874 , version 1


Quang-Huy Nguyen. Compact Normalisation Trace via Lazy Rewriting. 1st International Workshop on Reduction Strategies in Rewriting and Programming - WRS'2001, S. Lucas and B. Gramlich, 2001, Utrecht, Pays-Bas, pp.79-96. ⟨inria-00107874⟩
103 View
633 Download


Gmail Facebook Twitter LinkedIn More