Compact Normalisation Trace via Lazy Rewriting

Compact Normalisation Trace via Lazy Rewriting (2001)

by Quang-Huy Nguyen , Loria Inria

Citations:

5 - 0 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Compact Normalisation Trace via Lazy Rewriting	user correction - Legacy Corrections
AUTHOR NAME	Quang-Huy Nguyen	user correction - Legacy Corrections
AUTHOR NAME	Loria Inria	user correction - Legacy Corrections
AUTHOR ADDR	BP 101, 54602 Villers-les-Nancy Cedex, France	user correction - Legacy Corrections
ABSTRACT	Innermost strategies are usually used in compiling term rewriting systems (TRSs) since they allow to eciently build result terms in a bottom-up fashion. However, innermost strategies do not always give the shortest normalising derivation. In many cases, using an appropriate laziness annotation on the arguments of function symbols, we evaluate lazy arguments only if it is necessary and hence, get a shorter derivation to normal forms while avoiding non-terminating reductions. We provide in this work a transformation of annotated TRSs, that allows to compute normal forms using an innermost strategy and to extract lazy derivations in the original TRS from normalising derivations in the transformed TRS. We apply our result to improve the eciency of equational reasoning in the Coq proof assistant using ELAN as an external rewriting engine.	SVM HeaderParse 0.1
YEAR	2001	user correction - Legacy Corrections
CITATIONS	20 found	ParsCit 1.0