Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Chitil, Olaf; Runciman, Colin; Wallace, Malcolm (2000)
Languages: English
Types: Unknown
Subjects: QA76
In this paper we compare three systems for tracing and debugging Haskell programs: Freja, the Redex Trail System and Hood. We identify the similarities and differences of these systems and we evaluate their usefulness in practice by applying them to a number of small to medium programs in which errors had deliberately been introduced.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • 1. Simon P Booth and Simon B Jones. Walk backwards to happiness - debugging by time travel. Technical Report Technical Report CSM-143, Department of Computer Science and Mathematics, University of Stirling, 1997. This paper was presented at the 3rd International Workshop on Automated Debugging (AADEBUG'97), hosted by the Department of Computer and Information Science, Link¨oping University, Sweden, May 1997.
    • 2. Andy Gill. Debugging Haskell by observing intermediate data structures. In Proceedings of the 4th Haskell Workshop, 2000. Technical report of the University of Nottingham.
    • 3. Simon B. Jones and Simon P. Booth. Towards a purely functional debugger for functional programs. In Proceedings Glasgow Workshop on Functional Programming 1995, Ullapool, Scotland, July 1995.
    • 4. Lee Naish and Tim Barbour. Towards a portable lazy functional declarative debugger. In Proc. 19th Australasian Computer Science Conference, January 1996.
    • 5. Henrik Nilsson. Declarative Debugging for Lazy Functional Languages. PhD thesis, Link¨oping, Sweden, May 1998.
    • 6. Henrik Nilsson and Jan Sparud. The evaluation dependence tree as a basis for lazy functional debugging. Automated Software Engineering: An International Journal, 4(2):121-150, April 1997.
    • 7. Alastair Penney. Augmenting Trace-based Functional Debugging. PhD thesis, Department of Computer Science, University of Bristol, September 1999.
    • 8. Simon L. Peyton Jones, John Hughes, et al. Haskell 98: A non-strict, purely functional language. http://www.haskell.org, February 1999.
    • 9. Bernard Pope. Buddha: A declarative debugger for Haskell. Technical report, Dept. of Computer Science, University of Melbourne, Australia, June 1998. Honours Thesis.
    • 10. Jan Sparud and Colin Runciman. Complete and partial redex trails of functional computations. In C. Clack, K. Hammond, and T. Davie, editors, Selected papers from 9th Intl. Workshop on the Implementation of Functional Languages (IFL'97), pages 160-177. Springer LNCS Vol. 1467, September 1997.
    • 11. Jan Sparud and Colin Runciman. Tracing lazy functional computations using redex trails. In H. Glaser, P. Hartel, and H. Kuchen, editors, Proc. 9th Intl. Symposium on Programming Languages, Implementations, Logics and Programs (PLILP'97), pages 291-308. Springer LNCS Vol. 1292, September 1997.
    • 12. Philip Wadler. Functional programming: Why no one uses functional languages. SIGPLAN Notices, 33(8):23-27, August 1998. Functional programming column.
    • 13. R. D. Watson. Tracing Lazy Evaluation by Program Transformation. PhD thesis, Southern Cross, Australia, October 1996.
  • No related research data.
  • No similar publications.

Share - Bookmark

Download from

Cite this article