Skip to main content

Algorithmic Debugging with Cyclic Traces of Lazy Functional Programs

Luo, Yong and Chitil, Olaf (2007) Algorithmic Debugging with Cyclic Traces of Lazy Functional Programs. Technical report. Computing Laboratory, University of Kent, Canterbury, Kent (KAR id:14557)

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


We have proved the correctness of algorithmic debugging if the traces are acyclic. For cyclic traces, however, does algorithmic debugging still work? There does not exist a common understanding of how to debug cyclic traces in functional programming communities for a long time. In this paper we give two small examples to demonstrate that it is extremely difficult to find a generic algorithmic debugging scheme for cyclic traces. We conjecturre that it is impossible to have a generic scheme for cyclic traces, because the examples are very small and the choices of reasonable debugging trees are very limited. We also present acyclic traces in which constants are shared unless shared constants result in a cycle. The normal algorithmic debugging scheme works fine for acyclic traces and the proof is very similar to our previous paper.

Item Type: Monograph (Technical report)
Additional information: Technical Report 9-07
Uncontrolled keywords: Haskell, Hat, 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: 16 Nov 2021 09:52 UTC
Resource URI: (The current URI for this page, for reference purposes)
Chitil, Olaf:
  • Depositors only (login required):