HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Compact Normalisation Trace via Lazy Rewriting

Quang-Huy Nguyen 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Wednesday, January 17, 2007 - 10:25:17 AM
Last modification on : Friday, February 4, 2022 - 3:21:37 AM
Long-term archiving on: : Tuesday, April 6, 2010 - 6:21:24 PM


  • 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⟩



Record views


Files downloads