ResourceT is a monad transformer which creates a region of code where you can safely allocate resources.

A cross-platform library with functions for adjusting code pages on Windows. On all other operating systems, the library does nothing.

This library provides opaque unique identifiers in primitive state monads and a GADT-like type using them as witnesses of type equality.

This library implements the 'patience diff' algorithm, as well as the patience algorithm for the longest increasing subsequence problem. Patience diff computes the difference between two lists, for example the lines of two versions of a source file. It provides a good balance between performance, nice output for humans, and simplicity of implementation.

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

This library defines an existential type Some'. . @ data Some f where \ Some :: f a -> Some f @ . in few variants, and utilities to work with it. . If you are unsure which variant to use, use the one in "Data.Some" module.

This package allows simple reflection of expressions containing variables. Reflection here means that a Haskell expression is turned into a string. The primary aim of this package is teaching and understanding; there are no options for manipulating the reflected expressions beyond showing them.

This Haskell package is intended for those who are tired of keeping long lists of dependencies to the same essential libraries in each package as well as the endless imports of the same APIs all over again.

It also supports the modern tendencies in the language.

To solve those problems this package does the following:

• Reexport the original APIs under the Rebase namespace.

• Export all the possible non-conflicting symbols from the Rebase.Prelude module.

• Give priority to the modern practices in the conflicting cases.

The policy behind the package is only to reexport the non-ambiguous and non-controversial APIs, which the community has obviously settled on. The package is intended to rapidly evolve with the contribution from the community, with the missing features being added with pull-requests.

Wrappers and helpers to bridge Haskell and <https://www.lua.org/ Lua>. . It builds upon the /lua/ package, which allows bundling a Lua interpreter with a Haskell program.

The base library exposes the hGetEcho and hSetEcho functions for querying and setting echo status, but unfortunately, neither function works with MinTTY consoles on Windows. This library provides an alternative interface which works with both MinTTY and other consoles.

This library provides monad morphism utilities, most commonly used for manipulating monad transformer stacks.

This package provides a Haskell module for creating 2D and 3D plots using gnuplot.

This library tries to call minimum system calls which are the bottleneck of web servers.

This package contains the Control.Monad.Fail module providing the MonadFail class that became available in base-4.9.0.0 for older base package versions. This package turns into an empty package when used with GHC versions which already provide the Control.Monad.Fail module.

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 provides a dependent sum is a generalization of a particular way of thinking about the Either type. Either a b can be thought of as a 2-tuple (tag, value), where the value of the tag determines the type of the value. In particular, either tag = Left and value :: a or tag = Right and value :: b. This package allows you to define your own dependent sum types by using your own "tag" types.

PCG is a family of simple fast space-efficient statistically good algorithms for random number generation. Unlike many general-purpose RNGs, they are also hard to predict. . This library implements bindings to the standard C implementation. This includes the standard, unique, fast and single variants in the pcg family. There is a pure implementation that can be used as a generator with the random package as well as a faster primitive api that includes functions for generating common types. . The generators in this module are suitable for use in parallel but make sure threads don't share the same generator or things will go horribly wrong.

This package provides vaults for Haskell. A vault is a persistent store for values of arbitrary types. It's like having first-class access to the storage space behind IORefs. The data structure is analogous to a bank vault, where you can access different bank boxes with different keys; hence the name. Also provided is a locker type, representing a store for a single element.

This package provides both mutable and immutable Bloom filter data types, along with a family of hash functions and an easy-to-use interface.

This library provides the core data types and functions for parsing Commonmark. The parser is fully Commonmark-compliant and passes the test suite. It is designed to be customizable and easily extensible. To customize the output, create an AST, or support a new output format, one need only define some new typeclass instances. It is also easy to add new syntax elements or modify existing ones.

Accurate information about source positions is available for all block and inline elements. Thus the library can be used to create an accurate syntax highlighter or an editor with live preview. The parser has been designed for robust performance even in pathological cases that tend to cause stack overflows or exponential slowdowns in other parsers, with parsing speed that varies linearly with input length.

This is a Haskell library for writing CGI programs.

The threadDelay and timeout functions from the Haskell base library use the bounded Int type for specifying the delay or timeout period. This package provides alternative functions which use the unbounded Integer type.

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 package provides optimized functions to determine the edit distances for fuzzy matching, including Levenshtein and restricted Damerau-Levenshtein algorithms.