The Evaluation Dependence Tree as a Basis forLazy

Abstract

Lazy functional languages are declarative and allow the programmer to write programs where operational issues such as the evaluation order are left implicit. This should be reeected in the design of debuggers for such languages to avoid burdening the programmer with operational details, e.g. concerning the actual evaluation order. Conventional debugging techniques tend to focus too much on operational aspects to be suitable in this context. A record of the execution that only captures the declarative aspects of the execution, leaving out operational details, would be a viable basis for debugging lazy functional programs. Various declarative debugging tools could then be developed on top of such records. In this paper we propose a structure which we call the Evaluation Dependence Tree (EDT) for this purpose, and we describe two diierent construction methods. Performance problems are discussed along with possible solutions.

Extracted Key Phrases

Cite this paper

@inproceedings{Nilsson1995TheED, title={The Evaluation Dependence Tree as a Basis forLazy}, author={Henrik Nilsson and Jan Sparud}, year={1995} }