Adding traces to a lazy monadic evaluator

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2178 LNCS, Issue , 2001, Pages 627-641

  Pareja, Cristobal ^a   Pena, Ricardo ^a   Rubio, Fernando ^a   Segura, Clara ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

SYSTEM THEORY;

EXECUTION PROCESS; FUNCTIONAL PROGRAMS; HASKELL; MODULAR APPROACH;

PROGRAM DEBUGGING;

EID: 38049173919     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45654-6_48     Document Type: Conference Paper

References (18)

1. R. Bird. Introduction to Functional Programming using Haskell. Prentice-Hall, 2 edition, 1998.
2. S. P. Booth and S. B. Jones. Walk Backwards to Happiness-Debugging by Time Travel. Technical Report CSM-143, Department of Computer Science and Mathematics, University of Stirling, Scotland, 1997.
3. 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, Selected Papers of the 12th International Workshop on Implementation of Functional Languages, LNCS 2011, pages 176-193. Springer Verlag, 2001.
4. A. Gill. Debugging Haskell by Observing Intermediate Data Structures. In Proceedings of the 4th Haskell Workshop. Technical Report of the University of Nottingham, 2000.
5. S. B. Jones and S. P. Booth. Towards a Purely Functional Debugger for Functional Programs. In Proceedings Glasgow Workshop on Functional Programming. Ullapool, Scotland, July 1995.
6. S. Peyton Jones and J. Hughes, editors. Report on the Programming Language Haskell
7. URL http://www.haskell.org, February 1999.
8. L. Naish and T. Barbour. Towards a Portable Lazy Functional Declarative Debugger. In Proceedings 19th Australasian Computer Science Conference, January 1996.
9. H. Nilsson. Declarative Debugging for Lazy Functional Languages. PhD thesis, Department of Computer and Information Science, Link̈oping University, Sweden, 1998.
10. H. Nilsson and J. Sparud. The Evaluation Dependence Tree as a Basis for Lazy Functional Debugging. Automated Software Engineering: An International Journal, April 1997.
11. S. L. Peyton-Jones. Compiling Haskell by Program Transformations: A Report from the Trenches. In ESOP'96, LNCS 1058, Sringer Verlag, 1996.
12. B. Pope. Buddha: A Declarative Debugger for Haskell. Technical report, Department of Computer Science, University of Melbourne, Australia. Honours Thesis, 1999.
13. P. Sestoft. Deriving a Lazy Abstract Machine. Journal on Functional Programming, 7(3):231-264, 1997.
14. J. Sparud. A Transformational Approach to Debugging Lazy Functional Programs. PhD thesis, Department of Computer Science, Chalmers University of Technology, Goteborg, Sweden, 1998.
15. J. Sparud and C. Runciman. Complete and Partial Redex Trails of Functional Computations. In C. Clack, K. Hammond, and T. Davie, editors, Selected Papers from 9th International Workshop on the Implementation of Functional Languages (IFL'97), pages 160-177. Springer LNCS 1467, 1997.
16. J. Sparud and C. Runciman. Tracing Lazy Functional Computations Using Redex Trails. In H. Glaser, P. Hartel, and H. Kuchen, editors, Proceedings of the 9th International Symposium on Programming Languages, Implementations, Logics and Programs (PLILP'97), pages 291-308. Springer LNCS 1292, 1997.
17. P. Wadler. Monads for Functional Programming. In J. Jeuring and E. Meijer, editors, Advanced Functional Programming. LNCS 925. Springer-Verlag, 1995.
18. P. Wadler. Functional Programming: Why No One Uses Functional Languages. SIGPLAN Notices, 33(8):23-27, August 1998. Functional Programming Column.