Testing Type Class Laws
Paper in proceedings, 2012

The specification of a class in Haskell often starts with stating, in comments, the laws that should be satisfied by methods defined in instances of the class, followed by the type of the methods of the class. This paper develops a framework that supports testing such class laws using QuickCheck. Our framework is a light-weight class law testing framework, which requires a limited amount of work per class law, and per datatype for which the class law is tested. We also show how to test class laws with partially-defined values. Using partially-defined values, we show that the standard lazy and strict implementations of the state monad do not satisfy the expected laws.

Testing

Functional Programming

Laws

Specification

Author

Johan Jeuring

Open University of the Netherlands

Utrecht University

Patrik Jansson

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

Claudio Amaral

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

2012 ACM SIGPLAN Haskell Symposium, Haskell 2012. Copenhagen, 13 September 2012

49-60

Areas of Advance

Information and Communication Technology

Roots

Basic sciences

Subject Categories

Software Engineering

DOI

10.1145/2364506.2364514

ISBN

978-1-4503-1574-6