The advantage of lazy functional languages is that programs may be written declaratively without specifying the exact evaluation order.The ensuing order of evaluation cna however be quite involved which makes it difficult to debug such programs using traditional,operational techniques.A solution is to trace the ocmputation in a way which focuses on the declarative aspects and hides irrelevant operational details.the main problem with this approach is the imense cost in time and space of tracing large compuatations.Dealing with these poerformanc eissues is thus the key to practical,geenral purpose debuggers for lazy functional languages.In this paper we show that computing partial traces on demand by re-executing the traced program is a viable way to over-come these difficulties.This allows any program to be traced using only a fixed amount of extra storage.Since it takes a lot of time to build a complete trace,most of which is wasted since only a fraction of a typical trace is inveestigated duirng debugging,partial tracing and repeated re-exectution iis also attractive from a time perspective.perormane figurses are presented to substantiate our claims.
展开▼
