School of Computing

A pattern logic for prompt lazy assertions

Olaf Chitil and Frank Huch

In Implementation and Application of Functional Languages, 18th International Workshop, IFL 2006, LNCS 4449, pages 182-196, April 2007.

Abstract

Assertions test expected properties of run-time values without disrupting the normal computation of a program. Here we present a library for enriching programs in the lazy language Haskell with assertions. Expected properties are written in an expressive pattern logic that combines pattern matching with logical operations and predicates. The presented assertions are lazy: they do not force evaluation but only examine what is evaluated by other parts of the program. They are also prompt: assertion failure is reported as early as possible, before a faulty value is used by the main computation.

Download publication 145 kbytes (PDF)

Bibtex Record

@inproceedings{2510,
author = {Olaf Chitil and Frank Huch},
title = {A Pattern Logic for Prompt Lazy Assertions},
month = {April},
year = {2007},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2007/2510},
    publication_type = {inproceedings},
    submission_id = {21674_1176295069},
    booktitle = { Implementation and Application of Functional Languages, 18th International Workshop, IFL 2006},
    series = {LNCS 4449},
    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