Chitil, Olaf and Luo, Yong (2007) Structure and Properties of Traces for Functional Programs. In: Mackie, Ian, ed. Electronic Notes in Theoretical Computer Science (ENTCS). ENTCS, 176. Elsevier pp. 39-63.
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support program comprehension and debugging. The trace was named the augmented redex trail. Its structure was inspired by standard graph rewriting implementations of functional languages. Here we describe a model of the trace that captures its essential properties and allows formal reasoning. The trace is a graph constructed by graph rewriting but goes beyond simple term graphs. Although the trace is a graph whose structure is independent of any rewriting strategy, we define the trace inductively, thus giving us a powerful method for proving its properties.
|Item Type:||Conference or workshop item (Paper)|
|Uncontrolled keywords:||debugging, tracing, Hat, Haskell|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group|
|Depositing User:||Mark Wheadon|
|Date Deposited:||24 Nov 2008 18:05|
|Last Modified:||06 Sep 2011 01:37|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/14598 (The current URI for this page, for reference purposes)|
- Depositors only (login required):