School of Computing

A Pattern Logic for Prompt Lazy Assertions in Haskell

Olaf Chitil and Frank Huch

In Draft Proceedings of the 18th International Symposium on Implementation and Application of Functional Languages, IFL 2006, Budapest, Hungary, September 2006. Eotvos Lorand University.

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 154 kbytes (PDF)

Bibtex Record

@inproceedings{2479,
author = {Olaf Chitil and Frank Huch},
title = {{A Pattern Logic for Prompt Lazy Assertions in Haskell}},
month = {September},
year = {2006},
pages = {},
keywords = {},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2006/2479},
    publication_type = {inproceedings},
    submission_id = {9176_1170272019},
    ISBN = {963 463 876 7},
    booktitle = {Draft Proceedings of the 18th International Symposium on Implementation and Application of Functional Languages, IFL 2006},
    address = {Budapest, Hungary},
    publisher = {Eotvos Lorand University},
}

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

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

Last Updated: 23/06/2011 17:22