CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Testing Type Class Laws

Johan Jeuring ; Patrik Jansson (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)) ; Claudio Amaral (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers))
2012 ACM SIGPLAN Haskell Symposium, Haskell 2012. Copenhagen, 13 September 2012 p. 49-60. (2012)
[Konferensbidrag, refereegranskat]

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.

Nyckelord: Testing, Functional Programming, Specification, Laws



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2012-07-24. Senast ändrad 2016-08-18.
CPL Pubid: 160720

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)