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)
|
PDF
Language: English |
|
|
Download this file (PDF/150kB) |
Preview |
| Request a format suitable for use with assistive technology e.g. a screenreader | |
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: | 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: | 05 Nov 2024 09:48 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/14488 (The current URI for this page, for reference purposes) |
University of Kent Author Information
Chitil, Olaf.
| Creator's ORCID: |
 https://orcid.org/0000-0001-7986-9929
|
|---|---|
| CReDIT Contributor Roles: |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Download Statistics
Download Statistics
