article · ACM SIGPLAN Notices · 2016
Lightweight computation tree tracing for lazy functional languages
Cited by 0Abstract and details only
Abstract
A computation tree of a program execution describes computations of functions and their dependencies. A computation tree describes how a program works and is at the heart of algorithmic debugging. To generate a computation tree, existing algorithmic debuggers either use a complex implementation or yield a less informative approximation. We present a method for lazy functional languages that requires only a simple tracing library to generate a detailed computation tree. With our algorithmic debugger a programmer can debug any Haskell program by only importing our library and annotating suspected functions.
Cite this paper
Faddegon, M., & Chitil, O. (2016). Lightweight computation tree tracing for lazy functional languages. ACM SIGPLAN Notices, 51(6), 114–128. https://doi.org/10.1145/2980983.2908104
Faddegon, Maarten, and Olaf Chitil. “Lightweight computation tree tracing for lazy functional languages.” ACM SIGPLAN Notices, vol. 51, no. 6, 2016, pp. 114–28, https://doi.org/10.1145/2980983.2908104.
Faddegon, Maarten, and Olaf Chitil. 2016. “Lightweight computation tree tracing for lazy functional languages.” ACM SIGPLAN Notices 51 (6): 114–28. https://doi.org/10.1145/2980983.2908104.
Faddegon, M. and Chitil, O. (2016) ‘Lightweight computation tree tracing for lazy functional languages’, ACM SIGPLAN Notices, 51(6), pp. 114–128. Available at: https://doi.org/10.1145/2980983.2908104.
@article{faddegon2016lightweight,
title = {{Lightweight computation tree tracing for lazy functional languages}},
author = {Faddegon, Maarten and Chitil, Olaf},
journal = {ACM SIGPLAN Notices},
volume = {51},
number = {6},
pages = {114--128},
year = {2016},
doi = {10.1145/2980983.2908104}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
A Debugger for Parallel Haskell Dialects
Alberto de la Encina, Ismael Rodríguez, Fernando Rubio · Lecture notes in computer science · 2008
Cited by 1
Formalizing the Debugging Process in Haskell
Alberto de la Encina, Luis Llana, Fernando Rubio · Lecture notes in computer science · 2005
Cited by 2
Algorithmic debugging of real-world haskell programs: deriving dependencies from the cost centre stack
Maarten Faddegon, Olaf Chitil · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · 2015
Cited by 9
Algorithmic debugging of real-world haskell programs: deriving dependencies from the cost centre stack
Maarten Faddegon, Olaf Chitil · ACM SIGPLAN Notices · 2015
Cited by 7
TIP in Haskell — another exercise in functional programming
Colin Runciman · Workshops in computing · 1992
Cited by 3
On the Features of Lazy Evaluation of Haskell
Pang Jian-min, Rongcai Zhao · Journal of Information Engineering University · 2006
Cited by 0
Practical typed lazy contracts
Olaf Chitil · ACM SIGPLAN International Conference on Functional Programming (ICFP) · 2012
Cited by 28