Lazy Assertions

Chitil, Olaf and McNeill, Dan and Runciman, Colin (2004) Lazy Assertions. In: Implementation of Functional Languages: 15th International Workshop, IFL 2003, Sep 08-11, 2003, Edinburgh, England.

PDF
Download (157Kb)	Preview

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.

Item Type:	Conference or workshop item (Paper)
Uncontrolled keywords:	Haskell, lazy functional programming, testing
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User:	Mark Wheadon
Date Deposited:	24 Nov 2008 18:01
Last Modified:	06 Sep 2011 01:21
Resource URI:	http://kar.kent.ac.uk/id/eprint/14056 (The current URI for this page, for reference purposes)

• Depositors only (login required):