Chitil, Olaf and Davie, Thomas (2008) Comprehending Finite Maps for Algorithmic Debugging of Higher-Order Functional Programs. In: PPDP '08: Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming.
Algorithmic debuggers for higher-order functional languages have to display functional values. Originally functional values had been represented as partial applications of function and constructor symbols, but a recent approach represents functional values as finite maps. The two representations require the computation tree that is central to algorithmic debugging to be structured rather differently. In this paper we present a unifying framework that formally defines algorithmic debugging for both representations in an implementation-independent way. On this basis we prove the soundness of algorithmic debugging with finite maps. Our framework shows how a single implementation can support both forms of algorithmic debugging. The proof exposed that algorithmic debugging with finite maps does not handle arbitrary functional programs, but in current practice the problematic ones are excluded by Haskell's type system. Both framework and proof suggest variations of algorithmic debugging with finite maps and thus are tools for further improvement of this form of debugging.
|Item Type:||Conference or workshop item (Paper)|
|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:||29 Mar 2010 12:12|
|Last Modified:||06 Sep 2011 04:54|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/24054 (The current URI for this page, for reference purposes)|
- Depositors only (login required):