A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
A semantics for lazy assertions
2011
Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation - PERM '11
Lazy functional programming languages need lazy assertions to ensure that assertions preserve the meaning of programs. Examples in this paper demonstrate that previously proposed lazy assertions nonetheless break basic semantic equivalences, because they include a non-deterministic disjunction combinator. The objective of this paper is to determine "correct" definitions for lazy assertions. The starting point is our formalisation of basic properties such as laziness, taking them as axioms of
doi:10.1145/1929501.1929527
dblp:conf/pepm/Chitil11
fatcat:wl6o2i4ehbgudji34vdqclcufq