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)

Language: English
Click to download this file (363kB)
[thumbnail of Replacing_Unevaluated_Parts_in_the.pdf]
This file may not be suitable for users of assistive technology.
Request an accessible format


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 Nov 2021 09:52 UTC
Resource URI: (The current URI for this page, for reference purposes)
Chitil, Olaf:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.