haskell-lazysmallcheck 0.5-2build2 source package in Ubuntu

Changelog

haskell-lazysmallcheck (0.5-2build2) precise; urgency=low

  * Rebuild for new GHC ABIs.
 -- Colin Watson <email address hidden>   Wed, 02 Nov 2011 16:27:39 -0400

Upload details

Uploaded by:
Colin Watson
Uploaded to:
Precise
Original maintainer:
Debian Haskell Group
Architectures:
any
Section:
haskell
Urgency:
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
haskell-lazysmallcheck_0.5.orig.tar.gz 16.7 KiB 981d48118e02501cf5c7fe726ebe01428c99d94c19005dd7f4b55e1ad414faed
haskell-lazysmallcheck_0.5-2build2.debian.tar.gz 2.6 KiB 4a40d93864960c95cb000c0e5a4d109ba9e8d80e5d6cc3cf1a29b3448f8452de
haskell-lazysmallcheck_0.5-2build2.dsc 2.2 KiB 0619930d172ea32428f0e813ef1c76d2c0152aa19e22b20c1151cac0d9575e3f

Available diffs

View changes file

Binary packages built by this source

libghc-lazysmallcheck-dev: A library for demand-driven testing of Haskell programs

 This package provides a library for the Haskell programming language.
 .
 Lazy SmallCheck is a library for exhaustive, demand-driven testing of
 Haskell programs. It is based on the idea that if a property holds
 for a partially-defined input then it must also hold for all
 fully-defined refinements of the that input. Compared to ``eager''
 input generation as in SmallCheck, Lazy SmallCheck may require
 significantly fewer test-cases to verify a property for all inputs up
 to a given depth.

libghc-lazysmallcheck-prof: A library for demand-driven testing of Haskell programs; profiling libraries

 This package provides a library for the Haskell programming language,
 compiled for profiling.
 .
 Lazy SmallCheck is a library for exhaustive, demand-driven testing of
 Haskell programs. It is based on the idea that if a property holds
 for a partially-defined input then it must also hold for all
 fully-defined refinements of the that input. Compared to ``eager''
 input generation as in SmallCheck, Lazy SmallCheck may require
 significantly fewer test-cases to verify a property for all inputs up
 to a given depth.