The programmer provides a specification of the program, in the form of properties which functions should satisfy, and QuickCheck then tests that the properties hold in a large number of randomly generated cases.

Specifications are expressed in Haskell, using combinators defined in the QuickCheck library. QuickCheck provides combinators to define properties, observe the distribution of test data, and define test data generators.

This package provides a random number library.

Interface API for regex-posix,pcre,parsec,tdfa,dfa

One module layer over regex-posix to replace Text.Regex

The posix regex backend for regex-base

Adapted to openSUSE packaging guidelines.

Combinator library and utility functions for splitting lists.

A modular composable concurrency abstraction.

This package contains the generics system described in the Scrap Your Boilerplate papers (see http://www.cs.uu.nl/wiki/GenericProgramming/SYB). It defines the Data class of types permitting folding and unfolding of constructor applications, instances of this class for primitive types, and a variety of traversals.

An efficient packed, immutable Unicode text type (both strict and lazy), with a powerful loop fusion optimization framework.

The Text type represents Unicode character strings, in a time and space-efficient manner. This package provides text processing capabilities that are optimized for performance critical use, both in terms of large data quantities and high speed.

The Text type provides character-encoding, type-safe case conversion via whole-string case conversion functions. It also provides a range of functions for converting Text values to and from ByteStrings, using several standard encodings.

Efficient locale-sensitive support for text IO is also supported

Haskell 98 part of a monad transformer library, inspired by the paper "Functional Programming with Overloading and Higher-Order Polymorphism", by Mark P Jones, in Advanced School of Functional Programming

An efficient implementation of Int-indexed arrays (both mutable and immutable),
with a powerful loop optimisation framework

This package provides combinators for producing XHTML 1.0, including the Strict, Transitional and Frameset variants.

This package provides a pure interface for compressing and decompressing streams of data
represented as lazy ByteStrings. It uses the zlib C library so it has high performance.
It supports the "zlib", "gzip" and "raw" compression formats.

It provides a convenient high level API suitable for most tasks and for the few cases
where more control is needed it provides access to the full zlib feature set.

Happy is a parser generator system for Haskell, similar to the tool `yacc' for
C. Like `yacc', it takes a file containing an annotated BNF specification of a
grammar and produces a Haskell module containing a parser for the grammar.

Happy is flexible: you can have several Happy parsers in the same program, and
several entry points to a single grammar. Happy can work in conjunction with a
lexical analyser supplied by the user (either hand-written or generated by
another program), or it can parse a stream of characters directly (but this
isn't practical in most cases).

Authors:
--------
Simon Marlow
Andy Gill

The Haskell Platform is the easiest way to get started with programming Haskell. It comes with all you need to get up and running. Think of it as "Haskell: batteries included".

This package is based on the package 'knemo' from project 'openSUSE:Factory:Contrib'.

KNemo offers a network monitor similar to the one found in Windows. It
displays an icon in the systray for every network interface.