Skip to main content

Replacing Unevaluated Parts in the Traces of Functional Programs

Luo, Yong, 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. . pp. 304-325. Eotvos Lorand University, Budapest, Hungary ISBN 963-463-876-7. (KAR id:14427)

PDF
Language: English
Download (405kB) Preview
[thumbnail of Replacing_Unevaluated_Parts_in_the.pdf]
Preview
This file may not be suitable for users of assistive technology.
Request an accessible format

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: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Olaf Chitil
Date Deposited: 24 Nov 2008 18:03 UTC
Last Modified: 16 Feb 2021 12:25 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/14427 (The current URI for this page, for reference purposes)
Chitil, Olaf: https://orcid.org/0000-0001-7986-9929
  • Depositors only (login required):