This package contains the generics system described in the /Scrap Your Boilerplate/ papers (see the website). 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.

This Haskell package contains code for generating high quality random numbers that follow either a uniform or normal distribution. The generated numbers are suitable for use in statistical applications.

The uniform PRNG uses Marsaglia's MWC256 (also known as MWC8222) multiply-with-carry generator, which has a period of 2^8222 and fares well in tests of randomness. It is also extremely fast, between 2 and 3 times faster than the Mersenne Twister.

This package provides a library to parse and render YAML documents.

This library provides access to system information and functionality to Lua scripts via Haskell's System module. Intended usage for this package is to preload it by adding the loader function to package.preload. Note that the Lua package library must have already been loaded before the loader can be added.

This package includes Hakell modules providing various helper functions for Lists, Maybes, Tuples, Functions.

hscolour is a small Haskell script to colourise Haskell code. It currently has six output formats: ANSI terminal codes (optionally XTerm-256colour codes), HTML 3.2 with <font> tags, HTML 4.01 with CSS, HTML 4.01 with CSS and mouseover annotations, XHTML 1.0 with inline CSS styling, LaTeX, and mIRC chat codes.

This package defines orphan instances that mimic instances available in later versions of base to a wider (older) range of compilers.

This Haskell package provides a validator that can validate an email address string against RFC 5322.

Random shuffle implementation, on immutable lists. Based on perfect shuffle implementation by Oleg Kiselyov.

inline-c lets you seamlessly call C libraries and embed high-performance inline C code in Haskell modules. Haskell and C can be freely intermixed in the same source file, and data passed to and from code in either language with minimal overhead. No FFI required.

This library provides some useful tools from the C standard library.

This package provides a collection of Haskell functions for splitting lists into parts, akin to the split function found in several mainstream languages.

This library provides an efficient implementation of Int-indexed arrays (both mutable and immutable), with a powerful loop optimisation framework.

This library provides functions for parsing and pretty printing Roman numerals. Because the notation of Roman numerals has varied through the centuries this package allows for some customisation using a configuration that is passed to the conversion functions.

This is a Haskell module for PortMidi audio library, which supports real-time MIDI input and output.

This package provides tools to parse Haskell sources to the template-haskell abstract syntax.

This library provides core modules of a markup combinator library for Haskell.

This package provides combinators for building fast hashing functions. It includes hashing functions for all basic Haskell98 types.

This library provides bindings for the Dot language used by the Graphviz suite of programs for visualising graphs, as well as functions to call those programs. Main features of the graphviz library include:

1. Almost complete coverage of all Graphviz attributes and syntax

2. Support for specifying clusters

3. The ability to use a custom node type

4. Functions for running a Graphviz layout tool with all specified output types

5. Generate and parse Dot code with two options: strict and liberal

6. Functions to convert FGL graphs and other graph-like data structures

7. Round-trip support for passing an FGL graph through Graphviz to augment node and edge labels with positional information, etc.

This package provides a compatibility layer for using GHC call stacks with different versions of the compiler.

Haskeline wrapper for GHCi-like REPL interfaces. Composable with normal mtl transformers.

Provides Arbitrary instances for fgl graphs to avoid adding a QuickCheck dependency for fgl whilst still making the instances available to others. Also available are non-fgl-specific functions for generating graph-like data structures.

This package provides implementation of the Wagner-Fischer dynamic programming algorithm to find the optimal edit script and cost between two sequences. The implementation in this package is specialised to sequences represented with Data.Vector but is otherwise agnostic to:

• The type of values in the vectors;

• The type representing edit operations; and

• The type representing the cost of operations.

This library provides one module layer over regex-posix to replace Text.Regex.