Lazy assertions

  • Authors:
  • Olaf Chitil;Dan McNeill;Colin Runciman

  • Affiliations:
  • Department of Computer Science, The University of York, UK;Department of Computer Science, The University of York, UK;Department of Computer Science, The University of York, UK

  • Venue:
  • IFL'03 Proceedings of the 15th international conference on Implementation of Functional Languages
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

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.