Output details
11 - Computer Science and Informatics
University of Kent
Return to search
Output 0 of 0 in the submission
Output title
Comprehending Finite Maps for Algorithmic Debugging of Higher-Order Functional Programs
Type
E - Conference contribution
Name of conference/published proceedings
PPDP '08: Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Volume number
-
Issue number
-
First page of article
205
ISSN of proceedings
-
Year of publication
2008
URL
-
Number of additional authors
1
Additional information
<09> Algorithmic debugging, introduced in 1982 by Shapiro, is effective for side-effect-free programs, such as pure functional programs. In 2005 Pope proposed a user-friendlier variant of algorithmic debugging for higher-order programs. This paper defines a formal framework that subsumes the old and new variants and mixtures of them. The paper also uncovers a side-condition for correctness of the new variant that happens to hold for well-typed programs. This framework feeds into on-going work on the Haskell tracing system Hat available from projects.haskell.org/hat. Since autumn 2013, the work has been continued by a PhD student.
Interdisciplinary
-
Cross-referral requested
-
Research group
P - Programming Languages and Systems Group
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
