'Proof-directed debugging' revisited for a first-order version

4Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

Some 10 years ago, Harper illustrated the powerful method of proof-directed debugging for developing programs with an article in this journal. Unfortunately, his example uses both higher-order functions and continuation-passing style, which is too difficult for students in an introductory programming course. In this pearl, we present a first-order version of Harper's example and demonstrate that it is easy to transform the final version into an efficient state machine. Our new version convinces students that the approach is useful, even essential, in developing both correct and efficient programs.

Cite

CITATION STYLE

APA

Yi, K. (2006). “Proof-directed debugging” revisited for a first-order version. Journal of Functional Programming, 16(6), 663–670. https://doi.org/10.1017/S0956796806006149

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free