Replacing Unevaluated Parts in the Traces of Functional Programs

Luo, Yong and Chitil, Olaf (2006) Replacing Unevaluated Parts in the Traces of Functional Programs. In: Draft Proceedings of the 18th International Symposium on Implementation and Application of Functional Languages, IFL 2006. (Full text available)

PDF
Download (363kB)
[img]
Preview

Abstract

In 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. For algorithmic debugging, this also makes the questions shorter and clearer. In this paper, we present a formal model of tracing in which unevaluated parts are replaced by the symbol <sub>.</sub> Some properties such as the correctness of algorithmic debugging will also be proved.

Item Type: Conference or workshop item (Paper)
Uncontrolled keywords: debugging, tracing, Haskell, augmented redex trail
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:03
Last Modified: 06 Sep 2011 01:32
Resource URI: http://kar.kent.ac.uk/id/eprint/14427 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year