@techreport{R-92-17,
TITLE = {Algorithmic Debugging for Lazy Functional Languages},
AUTHOR = {Henrik Nilsson and Peter Fritzson},
YEAR = {1992},
NUMBER = {R-92-17},
INSTITUTION = ida,
ADDRESS = idaaddr,
ABSTRACTURL = {/publications/cgi-bin/tr-fetch.pl?r-92-17+abstr},
ABSTRACT = {Lazy functional languages have non-strict semantics and are purely declarative, i.e. they support the notion of referential transparency and are devoid of side effects. Traditional debugging techniques are, however, not suited for lazy functional languages since computations generally do not take place in the order one might expect. Since algorithmic debugging allows the user to concentrate on the declarative aspects of program semantics, and will semi-automatically find functions containing bugs, we propose to use this technique for debugging lazy functional programs. In this paper we present an algorithmic debugger for a lazy functional language and some experience in using it. Because of the non-strict semantics of lazy functional languages, arguments to functions are in general partially evaluated expressions. The user is, however, usually more concerned with the values that these expressions represent. We address this problem by providing the user with a strictified view of the execution trace whenever possible. We believe, supported by [2], that this is the first algorithmic debugger for a lazy functional language.},
IDANR = {LiTH-IDA-R-92-17},
NOTE = {In Proceedings of PLILP'92, Symposium on Programming Language Implementation and Logic Programming, LNCS, Springer Verlag, Leuven, Belgium, August 26-28, 1992. Accepted to the Journal of Functional Programming, 1993}