Static Contract Checking for Haskell
Journal article, 2009

Program errors are hard to detect and are costly both to programmers who spend significant efforts in debugging, and for systems that are guarded by runtime checks. Static verification techniques have been applied to imperative and object-oriented languages, like Java and C#, but few have been applied to a higher-order lazy functional language, like Haskell. In this paper, we describe a sound and automatic static verification framework for Haskell, that is based on contracts and symbolic execution. Our approach is modular and gives precise blame assignments at compile-time in the presence of higher-order functions and laziness.

static

contract checking

functional language

verification

contract satisfaction

Author

D. N. Xu

University of Cambridge

S. P. Jones

Microsoft Research

Koen Lindström Claessen

Chalmers, Computer Science and Engineering (Chalmers), Software Engineering and Technology (Chalmers)

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

07308566 (ISSN)

Vol. 44 1 41-52

Subject Categories

Computer and Information Science

DOI

10.1145/1594834.1480889

More information

Latest update

3/2/2022 6