Skip to main content

Structure and Properties of Traces for Functional Programs

Chitil, Olaf, Luo, Yong (2007) Structure and Properties of Traces for Functional Programs. Electronic Notes in Theoretical Computer Science, 176 (1). pp. 39-63. ISSN 1571-0661. (doi:10.1016/j.entcs.2006.10.032) (KAR id:14598)

Language: English
Click to download this file (274kB) Preview
[thumbnail of Structure.pdf]
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL:


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: Article
DOI/Identification number: 10.1016/j.entcs.2006.10.032
Uncontrolled keywords: debugging, tracing, Hat, Haskell
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Olaf Chitil
Date Deposited: 24 Nov 2008 18:05 UTC
Last Modified: 16 Nov 2021 09:53 UTC
Resource URI: (The current URI for this page, for reference purposes)
Chitil, Olaf:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.