We describe the design and implementation of a system for tracing computations in a lazy functional language. The basis of our tracing method is a program transformation carried out by the compiler: transformed programs compute the same values as the original, but embedded in functional data structures that also include redex trails showing how the values were obtained. A special-purpose display program enables detailed but selective exploration of the redex trails, with cross-links to the source program.
CITATION STYLE
Sparud, J., & Runciman, C. (1997). Tracing lazy functional computations using redex trails. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1292, pp. 291–308). Springer Verlag. https://doi.org/10.1007/bfb0033851
Mendeley helps you to discover research relevant for your work.