Chell is a simple and intuitive library for automated testing. It natively supports assertion-based testing, and can use companion libraries such as chell-quickcheck to support more complex testing strategies.

This library provides extensible optionally-pure exceptions for Haskell.

This package provides a monad transformer version of the ST monad for strict state threads.

A package for convenient access to high-resolution clock and timer functions of different operating systems via a unified API.

This Haskell package uses a monad transformer approach for logging.

This package provides Template Haskell functions for determining source code locations of messages.

With this package you can build a Storable instance of a record type from Storable instances of its elements in an elegant way. It does not do any magic, just a bit arithmetic to compute the right offsets, that would be otherwise done manually or by a preprocessor like C2HS. There is no guarantee that the generated memory layout is compatible with that of a corresponding C struct. However, the module generates the smallest layout that is possible with respect to the alignment of the record elements.

Most data types in the Haskell platform do not have Lift instances. This package provides orphan instances for containers, text, bytestring and vector.

This library provides a SOCKS proxy (version 5) implementation.

This package defines a class for types with default values.

This package provides ordered containers of intervals, with efficient search for all keys containing a point or overlapping an interval. See the example code on the home page for a quick introduction.

This library provides parsers and printers for bencoded data. Bencode is the encoding used by the peer-to-peer file sharing system BitTorrent for storing and transmitting loosely structured data.

This module allows tokens produced by skylighting-core to be rendered as LaTeX macros.

This library is for working with \".tar\" archive files. It can read and write a range of common variations of the tar archive format including V7, POSIX USTAR and GNU formats. It provides support for packing and unpacking portable archives. This makes it suitable for distribution but not backup because details like file ownership and exact permissions are not preserved. It also provides features for random access to archive content using an index.

This package provides a data structure representing a bidirectional mapping between two key types. Each value in the bimap is associated with exactly one value of the opposite type.

This package provides a pure interface for compressing and decompressing LZMA streams of data represented as lazy ByteStrings. A monadic incremental interface is provided as well.

The package provides mutable and immutable bit arrays.

This package provides a small, efficient, and portable regex library for Perl 5 compatible regular expressions. The PCRE library is a set of functions that implement regular expression pattern matching using the same syntax and semantics as Perl 5.

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

This library provides a class for non-negative numbers, a wrapper which can turn any ordered numeric type into a member of that class, and a lazy number type for non-negative numbers (a generalization of Peano numbers).

Compatibility layer for Data.Array.Byte providing boxed wrappers for ByteArray and MutableByteArray and relevant instances for GHC < 9.4.

This library provides a continuation-based, backtracking, logic programming monad. An adaptation of the two-continuation implementation found in the paper "Backtracking, Interleaving, and Terminating Monad Transformers" available online.

A priority search queue efficiently supports the operations of both a search tree and a priority queue. A Binding is a product of a key and a priority. Bindings can be inserted, deleted, modified and queried in logarithmic time, and the binding with the least priority can be retrieved in constant time. A queue can be built from a list of bindings, sorted by keys, in linear time.

wizards is a package designed for the quick and painless development of interrogative programs, which revolve around a dialogue with the user, who is asked a series of questions in a sequence much like an installation wizard.

Everything from interactive system scripts, to installation wizards, to full-blown shells can be implemented with the support of wizards.

It is developed transparently on top of a free monad, which separates out the semantics of the program from any particular interface. A variety of backends exist, including console-based System.Console.Wizard.Haskeline and System.Console.Wizard.BasicIO, and the pure System.Console.Wizard.Pure. It is also possible to write your own backends, or extend existing back-ends with new features. While both built-in IO backends operate on a console, there is no reason why wizards cannot also be used for making GUI wizard interfaces.

This package provides instances defined in later versions of ghc-binary package.