Faddegon, Maarten and Chitil, Olaf (2016) Lightweight Computation Tree Tracing for Lazy Functional Languages. In: Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI Programming Language Design and Implementation . ACM, New York, USA, pp. 114-128. ISBN 978-1-4503-4261-2. (doi:10.1145/2908080.2908104) (KAR id:55352)
PDF (Includes page numbers and artifact evaluation badge)
Author's Accepted Manuscript
Language: English |
|
Download this file (PDF/388kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader | |
Official URL: http://dx.doi.org/10.1145/2908080.2908104 |
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.
Item Type: | Book section |
---|---|
DOI/Identification number: | 10.1145/2908080.2908104 |
Uncontrolled keywords: | algorithmic debugging, lazy evaluation, tracing |
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, > QA76.76 Computer software |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Olaf Chitil |
Date Deposited: | 10 May 2016 11:02 UTC |
Last Modified: | 05 Nov 2024 10:44 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/55352 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):