Output details
11 - Computer Science and Informatics
University of Kent
Output title
A semantics for lazy assertions
Type
E - Conference contribution
Name of conference/published proceedings
Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation
Volume number
-
Issue number
-
First page of article
182
ISSN of proceedings
-
Year of publication
2011
Number of additional authors
-
Additional information
<10> Since the seminal work by Findler and Felleisen, assertions / contracts are established means for improving the quality of eager functional programs. However, for lazy functional languages several different assertion systems with different shortcomings have been proposed. This is the first paper to attack the problem by starting with semantics. Desirable axioms are identified. The paper shows that these axioms limit the expressiveness of assertions. A most general assertion system is derived from the axioms. Any future work on assertion systems for lazy functional languages has to relate to these semantical foundations. See Output 4 for an implementation.
Interdisciplinary
-
Cross-referral requested
-
Research group
P - Programming Languages and Systems Group
Citation count
3
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
