A semantics for lazy assertions

Chitil, Olaf (2011) A semantics for lazy assertions. In: Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation, 24-25 Jan 2011, Austin, Texas,USA. (doi:10.1145/1929501.1929527) (Full text available)

PDF - Author's Accepted Manuscript
Download (200kB) Preview
[img]
Preview
Official URL
http://doi.acm.org/10.1145/1929501.1929527

Abstract

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 our design space. We develop the first denotational semantics for lazy assertions; assertions denote subdomains. We define a weak disjunction combinator and together with a conjunction combinator assertions form a bounded distributive lattice. From the established laws we derive an efficient prototype implementation of lazy assertions for Haskell as a library.

Item Type: Conference or workshop item (Paper)
Uncontrolled keywords: languages, reliability, theory
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User: Olaf Chitil
Date Deposited: 21 Sep 2012 09:49 UTC
Last Modified: 28 Oct 2016 11:13 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/30775 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year