Skip to main content

Towards a Theory of Tracing for Functional Programs based on Graph Rewriting

Chitil, Olaf, Luo, Yong (2006) Towards a Theory of Tracing for Functional Programs based on Graph Rewriting. In: Mackie, Ian, ed. Draft Proceedings of the 3rd International Workshop on Term Graph Rewriting, Termgraph 2006. . Termgraph (KAR id:14488)

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


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. Here we describe a model of the trace that captures its essential properties and allows formal reasoning. The trace structure was inspired by standard graph rewriting implementations of functional languages. The trace is a graph which is constructed by graph rewriting but goes beyond simple term graphs.

Item Type: Conference or workshop item (Paper)
Uncontrolled keywords: 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:04 UTC
Last Modified: 16 Nov 2021 09:52 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.