Hat

Hat is a source-level tracer for the programming language Haskell. Hat gives access to detailed, otherwise invisible information about a computation. Hat helps locating errors in programs. Furthermore, it is useful for understanding how a (correct) program works, especially for teaching and program maintenance. Hat is not a time or space profiler. Hat can be used for programs that terminate normally, that terminate with an error message or that terminate when interrupted by the programmer.


References in zbMATH (referenced in 20 articles , 1 standard article )

Showing results 1 to 20 of 20.
Sorted by year (citations)

  1. Alpuente, María; Ballis, Demis; Frechina, Francisco; Romero, Daniel: Julienne: a trace slicer for conditional rewrite theories (2012)
  2. Alpuente, María; Ballis, Demis; Frechina, Francisco; Romero, Daniel: Backward trace slicing for conditional rewrite theories (2012)
  3. Alpuente, María; Ballis, Demis; Espert, Javier; Romero, Daniel: Backward trace slicing for rewriting logic theories (2011)
  4. Ochoa, Claudio; Silva, Josep; Vidal, Germán: Dynamic slicing of lazy functional programs based on redex trails (2008)
  5. Braßel, Bernd: A framework for interpreting traces of functional logic computations (2007)
  6. Brassel, Bernd; Fischer, Sebastian; Huch, Frank: A program transformation for tracing functional logic computations (2007)
  7. Braßel, Bernd; Hanus, Michael; Fischer, Sebastian; Huch, Frank; Vidal, Germán: Lazy call-by-value evaluation (2007)
  8. Chitil, Olaf; Luo, Yong: Structure and properties of traces for functional programs (2007)
  9. de la Encina, Alberto; Llana, Luis; Rubio, Fernando: Introducing debugging capabilities to natural semantics (2007)
  10. Hanus, Michael: Reporting failures in functional logic programs (2007)
  11. Silva, Josep; Vidal, Germán: Forward slicing of functional logic programs by partial evaluation (2007)
  12. Achten, Peter: The feasibility of interactively probing quiescent properties of GUI applications (2005)
  13. Chitil, Olaf: Source-based trace exploration (2005)
  14. de la Encina, Alberto; Llana, Luis; Rubio, Fernando: Formalizing the debugging process in Haskell (2005)
  15. Nilsson, Henrik: Dynamic optimization for functional reactive programming using generalized algebraic data types (2005)
  16. Christiansen, Jan; Huch, Frank: Searching for deadlocks while debugging Concurrent Haskell programs (2004)
  17. Claessen, Koen; Runciman, Colin; Chitil, Olaf; Hughes, John; Wallace, Malcolm: Testing and tracing lazy functional programs using QuickCheck and Hat (2003)
  18. Chitil, Olaf; Runciman, Colin; Wallace, Malcolm: Freja, Hat and Hood - A comparative evaluation of three systems for tracing and debugging lazy functional programs (2001)
  19. Nilsson, Henrik: How to look busy while being as lazy as ever: The implementation of a lazy functional debugger. (2001)
  20. Pareja, Cristóbal; Peña, Ricardo; Rubio, Fernando; Segura, Clara: Adding traces to a lazy monadic evaluator (2001)