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

Chitil, Olaf and 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 (Full text available)

PDF
Download (136kB)
[img]
Preview

Abstract

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: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:04
Last Modified: 06 Sep 2011 01:34
Resource URI: http://kar.kent.ac.uk/id/eprint/14488 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year