Skip to main content

A Type Generic Definition for Debugging Lazy Functional Programs by Value Observation

Faddegon, Maarten, Chitil, Olaf (2017) A Type Generic Definition for Debugging Lazy Functional Programs by Value Observation. Computer Languages, Systems & Structures, 52 . pp. 92-110. ISSN 1477-8424. (doi:10.1016/j.cl.2017.05.001) (KAR id:62530)

PDF Author's Accepted Manuscript
Language: English


Download (277kB) Preview
[thumbnail of typeGenericDefDebugging.pdf]
Preview
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL
https://dx.doi.org/10.1016/j.cl.2017.05.001

Abstract

Observing intermediate values helps to understand what is going on when your program runs. Gill presented an observation method for lazy functional languages that preserves the program's semantics. However, users need to define for each type how its values are observed: a laborious task and strictness of the program can easily be affected. Here we define how any value can be observed based on the structure of its type by applying generic programming. Furthermore we present an extension to specify per observation point how much to observe of a value.

Item Type: Article
DOI/Identification number: 10.1016/j.cl.2017.05.001
Additional information: Email 6a. JAC 04/08/2017
Uncontrolled keywords: tracing, debugging, lazy evaluation, Haskell
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, > QA76.76 Computer software
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Olaf Chitil
Date Deposited: 02 Aug 2017 15:07 UTC
Last Modified: 16 Feb 2021 13:47 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/62530 (The current URI for this page, for reference purposes)
Chitil, Olaf: https://orcid.org/0000-0001-7986-9929
  • Depositors only (login required):

Downloads

Downloads per month over past year