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 . Springer, Berlin, Germany, pp. 38-53. ISBN 978-3-540-76636-0. E-ISBN 978-3-540-76637-7. (doi:10.1007/978-3-540-76637-7_4) (KAR id:14528)

PDF Language: English
Download this file (PDF/143kB)
Request a format suitable for use with assistive technology e.g. a screenreader
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:	Book section
DOI/Identification number:	10.1007/978-3-540-76637-7_4
Uncontrolled keywords:	Pattern Logic, Expected Property, Assertion Check, Program Fault, Success Continuation
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User:	Olaf Chitil
Date Deposited:	24 Nov 2008 18:04 UTC
Last Modified:	05 Nov 2024 09:49 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/14528 (The current URI for this page, for reference purposes)

University of Kent Author Information

Chitil, Olaf.

Creator's ORCID:	https://orcid.org/0000-0001-7986-9929
CReDIT Contributor Roles:

Depositors only (login required):

Altmetric

Download Statistics

Total unique views for this document in KAR since July 2020. For more details click on the image.