Difference between revisions of "Checkers"
Jump to navigation
Jump to search
m |
m (→Abstract: "most" --> "a good deal") |
||
| Line 1: | Line 1: | ||
| + | [[Category:Packages]] |
||
| + | |||
[[Category:Packages]] |
[[Category:Packages]] |
||
== Abstract == |
== Abstract == |
||
| − | '''checkers''' is a library for reusable QuickCheck properties, particularly for standard type classes (class laws and [http://conal.net/papers/simply-reactive class morphisms]). For instance, |
+ | '''checkers''' is a library for reusable QuickCheck properties, particularly for standard type classes (class laws and [http://conal.net/papers/simply-reactive class morphisms]). For instance, a good deal of [[Reactive]] can be specified and tested using just these properties. Checkers also lots of support for randomly generating data values (thanks to Thomas Davie). |
Besides this wiki page, here are more ways to find out about checkers: |
Besides this wiki page, here are more ways to find out about checkers: |
||
Revision as of 16:49, 30 October 2008
Abstract
checkers is a library for reusable QuickCheck properties, particularly for standard type classes (class laws and class morphisms). For instance, a good deal of Reactive can be specified and tested using just these properties. Checkers also lots of support for randomly generating data values (thanks to Thomas Davie).
Besides this wiki page, here are more ways to find out about checkers:
- Read the library documentation.
- Get the code repository: darcs get http://code.haskell.org/checkers.
- Install from Hackage.
- See the version history.
Please leave comments at the Talk page.