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
Wallace, Malcolm; Chitil, Olaf; Brehm, Thorsten; Runciman, Colin (2001)
Languages: English
Types: Unknown
Subjects: QA76
Different tracing systems for Haskell give different views of a program at work. In practice, several views are complementary and can productively be used together. Until now each system has generated its own trace, containing only the information needed for its particular view. Here we present the design of a trace that can serve several views. The trace is generated and written to file as the computation proceeds. We have implemented both the generation of the trace and several different viewers.
  • 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 CSM-143, University of Stirling, 1997.
    • [2] Olaf Chitil, Colin Runciman, and Malcolm Wallace. Freja, Hat and Hood - A comparative evaluation of three systems for tracing and debugging lazy functional programs. In Markus Mohnen and Pieter Koopman, editors, Implementation of Functional Languages, 12th International Workshop, IFL 2000, LNCS 2011, pages 176-193. Springer, 2001.
    • [3] Andy Gill. Debugging Haskell by observing intermediate data structures. In 2000 ACM SIGPLAN Haskell Workshop, 2000. Technical Report NOTTCSTR-00-1, University of Nottingham.
    • [4] N. D. Jones and A. Mycroft. Data Flow Analysis of Applicative Programs using Minimal Function Graphs. In Proc. 13th Annual Symposium on the Principles of Programming Languages (POPL'86), pages 296-306, ACM Press, January 1986.
    • [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] Claus Reinke. GHood - Graphical visualisation and animation of Haskell object observations. Proceedings of ACM Sigplan Haskell Workshop 2001, September 2001.
    • [8] E. Y. Shapiro. Algorithmic Program Debugging. MIT Press, 1983.
    • [9] Jan Sparud. Tracing and Debugging Lazy Functional Computations. PhD thesis, Chalmers University of Technology, G¬®oteborg, Sweden, 1999.
    • [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.
  • No related research data.
  • No similar publications.

Share - Bookmark

Download from

Cite this article