This module defines the Pandoc data structure, which is used by pandoc to represent structured documents. It also provides functions for building up, manipulating and serialising Pandoc structures.

Transformers provides functor and monad transformers, inspired by the paper "Functional Programming with Overloading and Higher-Order Polymorphism", by Mark P Jones, in Advanced School of Functional Programming, 1995 http://web.cecs.pdx.edu/~mpj/pubs/springschool.html.

This package contains:

• the monad transformer class (in Control.Monad.Trans.Class)

• concrete functor and monad transformers, each with associated operations and functions to lift operations associated with other transformers.

This package can be used on its own in portable Haskell code, in which case operations need to be manually lifted through transformer stacks (see Control.Monad.Trans.Class for some examples). Alternatively, it can be used with the non-portable monad classes in the mtl or monads-tf packages, which automatically lift operations introduced by monad transformers through other transformers.

This library provides the Data.Primitive.Addr module that was a part of the primitive library before primitive-0.7.0.0.

This package provides a plugin that allows you to set breakpoints for debugging purposes. See the [README](https://github.com/aaronallen8455/breakpoint#breakpoint) for details.

This package provides functions for converting emoji names to emoji characters and vice versa.

How does it differ from the emoji package?

• It supports a fuller range of emojis, including all those supported by GitHub

• It supports lookup of emoji aliases from emoji

• It uses Text rather than String

• It has a lighter dependency footprint: in particular, it does not require aeson

• It does not require TemplateHaskell

This package provides an implementation of n-ary sums and n-ary products. The module Data.SOP is the main module of this library and contains more detailed documentation. The main use case of this package is to serve as the core of generics-sop.

This package provides utilities to inline C++ code into Haskell using inline-c.

This package provides an abstraction for communicating with line-oriented network services while abstracting over the use of SOCKS5 and TLS (via OpenSSL)

This library makes it easy to implement monads with tricky control flow. This is useful for: writing web applications in a sequential style, programming games with a uniform interface for human and AI players and easy replay capabilities, implementing fast parser monads, designing monadic DSLs, etc.

This package provides a data type for colours and transparency. Colours can be blended and composed. Various colour spaces are supported. A module of colour names ("Data.Colour.Names") is provided.

This library provides tools for ensuring that class members are shared.

Turtle is a reimplementation of the Unix command line environment in Haskell so that you can use Haskell as both a shell and a scripting language. Features include:

• Batteries included: Command an extended suite of predefined utilities.

• Interoperability: You can still run external shell commands.

• Portability: Works on Windows, OS X, and Linux.

• Exception safety: Safely acquire and release resources.

• Streaming: Transform or fold command output in constant space.

• Patterns: Use typed regular expressions that can parse structured values.

• Formatting: Type-safe printf-style text formatting.

• Modern: Supports text and system-filepath.

Read "Turtle.Tutorial" for a detailed tutorial or "Turtle.Prelude" for a quick-start guide. Turtle is designed to be beginner-friendly, but as a result lacks certain features, like tracing commands. If you feel comfortable using turtle then you should also check out the Shelly library which provides similar functionality.

This package provides testing utilities that are useful in conjunction with the Validity typeclass.

This library provides wrappers around Prelude and Data.List functions, such as head and !!, that can throw exceptions.

Provides generalisations of swap :: (a,b) -> (b,a) and assoc :: ((a,b),c) -> (a,(b,c)) to Bifunctors supporting similar operations (e.g. Either, These).

This is a Haskell library to derive Template Haskell's Lift class for datatypes.

This package provides portable implementations of parts of the unix package. This package re-exports the unix package when available. When it isn't available, portable implementations are used.

The mockery package provides support functions for automated testing.

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).

Haskell98 invariant functors (also known as exponential functors). For more information, see Edward Kmett's article Rotten Bananas.

This package provides various extra monoid-related definitions and utilities, such as monoid actions, monoid coproducts, semi-direct products, "deletable" monoids, "split" monoids, and "cut" monoids.

In Haskell you very often acquire values using the with... idiom using functions of type (a -> IO r) -> IO r. This idiom forms a Monad, which is a special case of the ContT monad (from transformers) or the Codensity monad (from kan-extensions). The main purpose behind this package is to provide a restricted form of these monads specialized to this unusually common case.

The reason this package defines a specialized version of these types is to:

• be more beginner-friendly,

• simplify inferred types and error messages, and:

• provide some additional type class instances that would otherwise be orphan instances

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 filtrable containers.