School of Computing

Towards a theory of tracing for functional programs based on graph rewriting

Olaf Chitil and Yong Luo

In Ian Mackie, editor, Draft Proceedings of the 3rd International Workshop on Term Graph Rewriting, Termgraph 2006, page 10, April 2006.

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.

Download publication 132 kbytes (PDF)

Bibtex Record

@inproceedings{2367,
author = {Olaf Chitil and Yong Luo},
title = {Towards a Theory of Tracing for Functional Programs based on Graph Rewriting},
month = {April},
year = {2006},
pages = {10},
keywords = {Tracing, Hat, Haskell},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2006/2367},
    publication_type = {inproceedings},
    submission_id = {29583_1140800299},
    booktitle = {Draft Proceedings of the 3rd International Workshop on Term Graph Rewriting, Termgraph 2006},
    editor = {Ian Mackie},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 12/03/2012 17:24