A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Tracing piece by piece
1999
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming - ICFP '99
The advantage of lazy functional languages is that programs may be written declaratively without specifying the exact evaluation order. The ensuing order of evaluation can however be quite involved which makes it difficult to debug such programs using traditional, operational techniques. A solution is to trace the computation in a way which focuses on the declarative aspects and hides irrelevant operational details. The main problem with this approach is the immense cost in time and space of
doi:10.1145/317636.317782
dblp:conf/icfp/Nilsson99
fatcat:em3ds4qbkze77e7fk3qlqv4fle