Practical aspects of Declarative Debugging in Haskell 98

Proceedings of the ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn 5, Issue , 2003, Pages 230-240

  Pope, Bernard ^a   Naish, Lee ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Declarative debugging; Input and output; Printing values; Resource usage

Indexed keywords

ABSTRACTING; COMPUTER PROGRAM LISTINGS; COMPUTER PROGRAMMING LANGUAGES; GRAPH THEORY; PRINTING; PROGRAM COMPILERS;

DECLARATIVE DEBUGGING; INPUT AND OUTPUT; PRINTING VALUES; RESOURCE USAGE;

PROGRAM DEBUGGING;

EID: 1242310183     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/888251.888273     Document Type: Conference Paper

References (23)

1. Haskell 98 Foreign Function Interface. www.haskell.org/definition, 2002.
2. Haskell 98 Language Report. www.haskell.org/onlinereport, 2002.
3. R. Caballero and M. Rodríguez-Artalejo. A declarative debugging system for lazy functional logic programs. In M. Hanus, editor, Electronic Notes in Theoretical Computer Science, volume 64. Elsevier Science Publishers, 2002.
4. O. Chitil, C. Runciman, and M. Wallace. Freja, Hat and Hood - a comparative evaluation of three systems for tracing and debugging lazy functional programs. In M. Mohnen and P. Koopman, editors, Proceedings of the 12th International Workshop on Implementation of Functional Languages, volume LNCS 2011, pages 176-193, 2001.
5. A. Gill. Debugging Haskell by observing intermediate data structures. Technical report, University of Nottingham, 2000. In Proceedings of the 4th Haskell Workshop, 2000.
6. S. P. Jones, S. Marlow, and A. Reid. The STG runtime system (revised). Technical report, Microsoft Research Ltd, Cambridge, England, 2001.
7. L. Naish. Declarative debugging of lazy functional programs. Australian Computer Science Communications, 15(1):287-294, 1993.
8. L. Naish and T. Barbour. Towards a portable lazy functional declarative debugger. Australian Computer Science Communications, 18(1):401-408, 1996.
9. H. Nilsson. Declarative Debugging for Lazy Functional Languages. PhD thesis, Department of Computer and Information Science, Linköpings Universitet, S-581 83, Linköping, Sweden, 1998.
10. H. Nilsson. Tracing piece by piece: affordable debugging for lazy functional languages. In Proceedings of the 1999 ACM SIGPLAN international conference on Functional programming, pages 36-47, Paris, France, 1999. ACM Press.
11. 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, November 2001.
12. H. Nilsson and J. Sparud. The evaluation dependence tree as a basis for lazy functional debugging. Automated Software Engineering, 4(2): 121-150, 1997.
13. S. Peyton-Jones. The Implementation of Functional Programming Languages. Prentice-Hall International, 1986.
14. S. Peyton-Jones, A. Reid, F. Henderson, C. A. R. Hoare, and S. Marlow. A semantics for imprecise exceptions. In SIGPLAN Conference on Programming Language Design and Implementation, pages 25-36, 1999.
15. S. Peyton-Jones and P. Wadler. Imperative functional programming. In Conference record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, South Carolina, pages 71-84, 1993.
16. B. Pope. Buddha: A declarative debugger for Haskell. Technical Report 98/12, The Department of Computer Science and Software Engineering, The University of Melbourne, 1998.
17. B. Pope and L. Naish. Rolling your own I/O in Haskell 98. www.cs.mu.oz.au/̃bjpop/papers.html.
18. B. Pope and L. Naish. Specialisation of higher-order functions for debugging. In M. Hanus, editor, Proceedings of the International Workshop on Functional and (Constraint) Logic Programming (WFLP 2001), pages 87-100, 2001.
19. B. Pope and L. Naish. A program transformation for debugging Haskell 98. In M. Oudshoorn, editor, Twenty Sixth Australasian Computer Science Conference, volume 16, pages 227-236, 2003.
20. J. Sparud. Tracing and Debugging Lazy Functional Computations. PhD thesis, Chalmers University of Technology, Sweden, 1999.
21. J. Sparud and C. Runciman. Complete and partial redex trails of functional computations. In T. D. C. Clack, K. Hammond, editor, Selected papers from 9th International Workshop on the Implementation of Functional Languages, volume LNCS 1467, pages 160-177, 1997.
22. J. Sparud and C. Runciman. Tracing lazy functional computations using redex trails. In PLILP, pages 291-308, 1997.
23. M. Wallace, O. Chitil, T. Brehm, and C. Runciman. Multiple-view tracing for Haskell: a new hat. In Preliminary Proceedings of the 2001 ACM SIGPLAN Haskell Workshop, pages 151-170, 2001.