Replacing unevaluated parts in the traces of functional programs

Luo, Yong and Chitil, Olaf (2007) Replacing unevaluated parts in the traces of functional programs. Technical report. University of Kent, Canterbury, Kent, Canterbury, Kent (Full text available)

PDF
Download (391kB)
[img]
Preview

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: Monograph (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: 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:36
Resource URI: http://kar.kent.ac.uk/id/eprint/14560 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year