School of Computing

Monadic prompt lazy assertions in Haskell

Olaf Chitil and Frank Huch

In Zhong Shao, editor, Programming Languages and Systems, 5th Asian Symposium, APLAS 2007, LNCS 4807, pages 182-196. Springer, November 2007.

Abstract

Assertions test expected properties of run-time values without disrupting the normal computation of a program. We present a library for enriching Haskell programs with assertions. Expected properties can be specified in a parser-combinator like language. The assertions are lazy: they do not force evaluation but only examine what is evaluated by the program. They are also prompt: assertion failure is reported as early as possible. The implementation is based on lazy observations and continuation-based coroutines.

Download publication 140 kbytes (PDF)

Bibtex Record

@inproceedings{2644,
author = {Olaf Chitil and Frank Huch},
title = {Monadic prompt lazy assertions in {Haskell}},
month = {November},
year = {2007},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2007/2644},
    publication_type = {inproceedings},
    submission_id = {20159_1201811310},
    booktitle = {Programming Languages and Systems, 5th Asian Symposium, APLAS 2007},
    editor = {Zhong Shao},
    series = {LNCS 4807},
    publisher = {Springer},
    refereed = {yes},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014