Chitil, Olaf and McNeill, Dan and Runciman, Colin (2004) Lazy Assertions. In: Trinder, Phil and Michaelson, Greg and Pena, Ricardo, eds. Implementation of Functional Languages 15th International Workshop. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 1-19. ISBN 978-3-540-23727-3. E-ISBN 978-3-540-27861-0. (doi:10.1007/978-3-540-27861-0_1) (KAR id:14056)
PDF
Language: English |
|
Download this file (PDF/160kB) |
|
Request a format suitable for use with assistive technology e.g. a screenreader | |
Official URL: http://dx.doi.org/10.1007/978-3-540-27861-0_1 |
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: | Book section |
---|---|
DOI/Identification number: | 10.1007/978-3-540-27861-0_1 |
Uncontrolled keywords: | Haskell, lazy functional programming, testing |
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:01 UTC |
Last Modified: | 05 Nov 2024 09:48 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/14056 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):