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. © Springer-Verlag 2004.
Cite
CITATION STYLE
Chitil, O., McNeill, D., & Runciman, C. (2004). Lazy Assertions. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3145, 1–19. https://doi.org/10.1007/978-3-540-27861-0_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
