Skip to main content

A Pattern Logic for Prompt Lazy Assertions in Haskell

Chitil, Olaf, Huch, Frank (2006) A Pattern Logic for Prompt Lazy Assertions in Haskell. In: Draft Proceedings of the 18th International Symposium on Implementation and Application of Functional Languages, IFL 2006. . Eotvos Lorand University, Budapest, Hungary ISBN 963-463-876-7. (KAR id:14409)

PDF
Language: English
Click to download this file (178kB) Preview
[thumbnail of A_Pattern_Logic_for_Prompt_Lazy_Assertions.pdf]
Preview
This file may not be suitable for users of assistive technology.
Request an accessible format

Abstract

Assertions test expected properties of run-time values without disrupting the normal computation of a program. Here we present a library for enriching programs in the lazy language Haskell with assertions. Expected properties are written in an expressive pattern logic that combines pattern matching with logical operations and predicates. The presented assertions are lazy: they do not force evaluation but only examine what is evaluated by other parts of the program. They are also prompt: assertion failure is reported as early as possible, before a faulty value is used by the main computation.

Item Type: Conference or workshop item (Paper)
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Olaf Chitil
Date Deposited: 24 Nov 2008 18:03 UTC
Last Modified: 16 Nov 2021 09:52 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/14409 (The current URI for this page, for reference purposes)
Chitil, Olaf: https://orcid.org/0000-0001-7986-9929
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.