The functional graph library, FGL, is a collection of type and function definitions to address graph problems. The basis of the library is an inductive definition of graphs in the style of algebraic data types that encourages inductive, recursive definitions of graph algorithms.

This package provides datatypes to construct Free monads, Free monad transformers, and useful instances. In addition it provides the constructs to avoid quadratic complexity of left associative bind, as explained in:

• Janis Voigtlander, Asymptotic Improvement of Computations over Free Monads, MPC'08

This Haskell package provides striped pooling abstraction for managing flexibly-sized collections of resources such as database connections.

This package provides a full-featured binding to the C libmagic library. With it, you can determine the type of a file by examining its contents rather than its name.

This library provides a wide array of (semi)groupoids and operations for working with them. A Semigroupoid is a Category without the requirement of identity arrows for every object in the category. A Category is any Semigroupoid for which the Yoneda lemma holds. Finally, to work with these weaker structures it is beneficial to have containers that can provide stronger guarantees about their contents, so versions of Traversable and Foldable that can be folded with just a Semigroup are added.

The texmath library provides functions to read and write TeX math, presentation MathML, and OMML (Office Math Markup Language, used in Microsoft Office). Support is also included for converting math formats to pandoc's native format (allowing conversion, via pandoc, to a variety of different markup formats). The TeX reader supports basic LaTeX and AMS extensions, and it can parse and apply LaTeX macros.

A decimal number has an integer mantissa and a negative exponent. The exponent can be interpreted as the number of decimal places in the value.

This package defines a class for types with default values.

This Haskell package allows Haskell programs to access data storage systems like PostgreSQL, SQLite, and MariaDB in a type-safe way.

This Haskell package provides additional data structures, and other added capabilities layered on top of the Par monad.

This package provides the bytestring builder that is debuting in bytestring-0.10.4.0, which should be shipping with GHC 7.8. Compatibility package for older packages.

This package provides IO operations from async package lifted to any instance of MonadBase or MonadBaseControl.

This package provides a generic interface for multiple Vty platforms in one package so you don't have to conditionally depend on them in your cabal file.

This is a set of macros to be used when writing Haskell FFI. They were designed to be able to fully describe C interfaces, so that hsc2hs can extract from them all Haskell code needed to mimic such interfaces. All Haskell names used are automatically derived from C names, structures are mapped to Haskell instances of Storable, and there are also macros you can use with C code to help write bindings to inline functions or macro functions.

This package provides an interface to file locking functionalities.

Atomically write to a file on POSIX-compliant systems while preserving permissions. mv is an atomic operation. This makes it simple to write to a file atomically just by using the mv operation. However, this will destroy the permissions on the original file. This library preserves permissions while atomically writing to a file.

The PGP Word List consists of two phonetic alphabets, each with one word per possible byte value. A string of bytes is translated with these alphabets, alternating between them at each byte.

The PGP words corresponding to the bytes 5B 1D CA 6E are "erase breakaway spellbind headwaters", for example.

For further information, see http://en.wikipedia.org/wiki/PGP_word_list.

This package provides fast unicode character sets for Haskell, based on complemented PATRICIA tries.

Network recv based on buffer pools

Convenience functions and TH for working with constraints. See README.md for example usage.

This package provides the following modules: Math.NumberTheory.Logarithms and Math.NumberTheory.Powers.Integer from the arithmoi package, GHC.Integer.Logarithms.Compat and Math.NumberTheory.Power.Natural, as well as some additional functions in migrated modules.

This package provides a custom prelude with no dependencies apart from the base package.

Foundation has the following goals:

1. provide a base like sets of modules that provide a consistent set of features and bugfixes across multiple versions of GHC (unlike base).

2. provide a better and more efficient prelude than base's prelude.

3. be self-sufficient: no external dependencies apart from base;

4. provide better data-types: packed unicode string by default, arrays;

5. Numerical classes that better represent mathematical things (no more all-in-one Num);

6. I/O system with less lazy IO.

This package provides a Dec type for representing deciable relations.

type Neg a = a -> Void

data Dec a
    = Yes a
    | No (Neg a)

This package provides the ShortText type which is suitable for keeping many short strings in memory. This is similar to how ShortByteString relates to ByteString.

The main difference between Text and ShortText is that ShortText uses UTF-8 instead of UTF-16 internally and also doesn't support zero-copy slicing (thereby saving 2 words). Consequently, the memory footprint of a (boxed) ShortText value is 4 words (2 words when unboxed) plus the length of the UTF-8 encoded payload.