Luo, Yong and Chitil, Olaf (2007) Replacing unevaluated parts in the traces of functional programs. Technical report. University of Kent, Canterbury, Kent, Canterbury, Kent (KAR id:14560)
PDF
Language: English |
|
Download this file (PDF/392kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader |
Abstract
In non-strict functional programming languages such as Haskell, it happens often that some parts of a program are not evaluated because their values are not demanded. In practice, those unevaluated parts are often replaced by a placeholder (e.g. <sub>)</sub> in order to keep the trace size smaller. In the process of algorithmic debugging, one needs to answer several questions in order to locate a program fault. Replacing unevaluated parts makes these questions shorter and semantically clearer. In this paper, we present a formal model of tracing in which unevaluated parts are replaced by the symbol <sub>.</sub> The most important property, the correctness of algorithmic debugging, is proved.
Item Type: | Reports and Papers (Technical report) |
---|---|
Additional information: | Technical Report 7-07 |
Uncontrolled keywords: | tracing |
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:49 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/14560 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):