Monadic prompt lazy assertions in Haskell

Chitil, Olaf and Huch, Frank (2007) Monadic prompt lazy assertions in Haskell. In: Shao, Zhong, ed. Programming Languages and Systems. Lecture Notes in Computer Science Vol. 4807, 4807. Springer pp. 38-53. ISBN 3540766367. (Full text available)

PDF
Download (143kB)
[img]
Preview
Official URL
http://dx.doi.org/10.1007/978-3-540-76637-7_4

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.

Item Type: Conference or workshop item (Paper)
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:04
Last Modified: 06 Sep 2011 01:35
Resource URI: http://kar.kent.ac.uk/id/eprint/14528 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year