Hsdebug: Debugging Lazy Programs by Not Being Lazy

Proceedings of the 2003 ACM SIGPLAN Haskell Workshop

Volumn , Issue , 2003, Pages 84-87

  Ennals, Robert ^a   Jones, Simon Peyton ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

Debugging; Lazy Evaluation

Indexed keywords

DEBUGGING; LAZY EVALUATION;

COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; ITERATIVE METHODS; PROGRAM DEBUGGING; SUBROUTINES;

COMPUTER PROGRAMMING;

EID: 1542748200     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. R. Ennals and S. Peyton Jones. Optimistic Evaluation: An adaptive evaluation strategy for non-strict programs. In Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2003.
2. A. Gill. Debugging haskell by observing intermediate data structures. In Proceedings of the 4th Haskell Workshop, 2000.
3. X. Leroy, D. Rémy, J. Vouillon, and D. Doligez. The Objective Caml system, documentation and user's guide. INRIA, 1998. Available at http://pauillac.inria.fr/ocaml/htmlman/.
4. R. MacLachlan, editor. CMU Common Lisp Users Manual. Carnegie Mellon University, 1992.
5. J.-W. Maessen. Eager Haskell: Resource-bounded execution yields efficient iteration. In The Haskell Workshop, Pittsburgh, 2002.
6. R. Morgan and S. Jarvis. Profiling large-scale lazy functional programs. Journal of Functional Programming,. 8(3), May 1998.
7. H. Nilsson. How to look busy while being as lazy as ever: The implementation of a lazy functional debugger. Journal of Functional Programming, 11 (6): 629-671, Nov. 2001.
8. H. Nilsson and P. Fritzson. Algorithmic debugging for lazy functional languages. In Programming Language Implementation and Logic Programming (PLILP '92), Leuven, Belgium, Aug. 1992.
9. H. Nilsson and P. Fritzson. Algorithmic debugging for lazy functional languages. Journal of Functional Programming, 4(3):337-370, July 1994.
10. H. Nilsson and J. Sparud. The evaluation dependence tree: an execution record for lazy functional debugging. Technical report, Department of Computer and Information Science, Linkoping University, 1996.
11. H. Nilsson and J. Sparud. The evaluation dependence tree as a basis for lazy functional debugging. Automated Software Engineering, 4(2):121-150, April 1997.
12. S. Peyton Jones, R. Hughes, et al. Report on the programming language Haskell 98. http:/haskell.org, Feb. 1999.
13. B. Pope. Buddha: A declarative debugger for Haskell. Honours thesis, Dept. of Computer Science, University of Melbourne, Australia, June 1998, 1998.
14. C. Reinke. Ghood - graphical visualisation and animation of haskell object observations. In Proceedings of the ACM SIGPLAN Haskell Workshop, 2001.
15. P. Sansom. Execution profiling for non-strict functional languages. Ph.D. thesis, University of Glasgow, Sept. 1994.
16. J. Sparud and C. Runciman. Tracing lazy functional computations using redex trails. In PLILP, pages 291-308, 1997.
17. J. Sparud and C. Runciman. Complete and partial redex trails of functional computations. Lecture Notes in Computer Science, 1467, 1998.
18. R. M. Stallman and R. H. Pesch. Using GDB: A guide to the GNU source-level debugger, GDB version 4.0. Technical report, Free Software Foundation, Cambridge, MA, 1991.
19. A. P. Tolmach and A. W. Appel. Debugging standard ML without reverse engineering. In Proceedings of the 1990 ACM Conference on LISP and Functional Programming, Nice, pages 1-12, New York, NY, 1990. ACM.
20. A. P. Tolmach and A. W. Appel. A debugger for standard ML. Journal of Functional Programming, 5(2): 155-200, 1995.
21. M. Wallace, O. Chitil, T. Brehm, and C. Runciman. Multipleview tracing for haskell: a new hat. In Proceedings of the Haskell Workshop, 2001.