School of Computing

Lazy assertions

Olaf Chitil, Dan McNeill, and Colin Runciman

In Phil Trinder, Greg Michaelson, and Ricardo Pena, editors, Implementation of Functional Languages: 15th International Workshop, IFL 2003, LNCS 3145, pages 182-196. Springer, November 2004.

Abstract

Assertions test expected properties of run-time values without disrupting the normal working of a program. So in a lazy functional language assertions should be lazy - not forcing evaluation, but only examining what is evaluated by other parts of the program. We explore the subtle semantics of lazy assertions and describe sequential and concurrent variants of a method for checking lazy assertions. All variants are implemented in Haskell.

Download publication 157 kbytes (PDF)

Bibtex Record

@inproceedings{1995,
author = {Olaf Chitil and Dan McNeill and Colin Runciman},
title = {Lazy Assertions},
month = {November},
year = {2004},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2004/1995},
    publication_type = {inproceedings},
    submission_id = {28611_1099324030},
    ISBN = {3-540-23727-5},
    booktitle = {Implementation of Functional Languages: 15th International Workshop, IFL 2003},
    editor = {Phil Trinder and Greg Michaelson and Ricardo Pena},
    series = {LNCS 3145 },
    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