This package provides tools to parse and produce literals efficiently from strict or lazy bytestrings.

This Haskell library provides pointed and copointed data types.

This library provides Haskell bindings to the MySQL mysqlclient client library. It is a fairly faithful, low level library that implements most of the MySQL client API. The major departure from the C API is that in Haskell, resource management is mostly automatic and safe.

This library deliberately avoids the question of providing a ``good'' API. Its purpose is to serve as a base upon which higher-level libraries can be built.

This package implements selective applicative functors, which allow you to declare your effects statically, and select which to execute dynamically. See the paper on selective functors for more details.

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 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 library provides finger trees, a general sequence representation with arbitrary annotations, for use as a base for implementations of various collection types. It includes examples, as described in section 4 of Ralf Hinze and Ross Paterson, "Finger trees: a simple general-purpose data structure".

This package provides helper functions for working with haskell-src-exts trees.

Takes an error-throwing expression and puts it back in the Maybe it belongs in.

Note that this suffers from the https://ghc.haskell.org/trac/ghc/ticket/5902. Buyer beware.

This library uses GHC.Generics to derive efficient optics (traversals, lenses and prisms) for algebraic data types in a type-directed way, with a focus on good type inference and error messages when possible. The library exposes a van Laarhoven interface. For an alternative interface, supporting an opaque optic type, see generic-optics.

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

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.

th-reify-many provides functions for recursively reifying top level declarations. The main intended use case is for enumerating the names of datatypes reachable from an initial datatype, and passing these names to some function which generates instances.

GHC 7.4 introduced a new casMutVar PrimOp which is difficult to use safely, because pointer equality is a highly unstable property in Haskell. This library provides a safer method based on the concept of Tickets.

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.

Regex-tdfa is a pure Haskell regular expression library implementing POSIX extended regular expressions. It is a "tagged" DFA regex engine. It is inspired by libtre.

Implementation of bidirectional TOML serialization.

This library provides some useful extensions for ghc-commonmark to parser core commonmark syntax: smart quotes, definition lists, tables, footnotes, math, and more.

Provides an efficient Haskell implementation of Peano numbers

This package provides Haskell APIs to efficiently access the <https://www.unicode.org/ucd/ Unicode character database> (UCD). Performance is the primary goal in the design of this package. The Haskell data structures are generated programmatically from the UCD files.

Haskell library for opening the web browser.

cassava is a library for parsing and encoding RFC 4180 compliant comma-separated values (CSV) data, which is a textual line-oriented format commonly used for exchanging tabular data.

cassava's API includes support for:

• Index-based record-conversion

• Name-based record-conversion

• Typeclass directed conversion of fields and records

• Built-in field-conversion instances for standard types

• Customizable record-conversion instance derivation via GHC generics

• Low-level bytestring builders (see Data.Csv.Builder)

• Incremental decoding and encoding API (see Data.Csv.Incremental)

• Streaming API for constant-space decoding (see Data.Csv.Streaming)

Moreover, this library is designed to be easy to use; for instance, here's a very simple example of encoding CSV data:

>>> Data.Csv.encode [("John",27),("Jane",28)]
"John,27\r\nJane,28\r\n"

This package provides a library that performs fast, accurate conversion between double precision floating point and text.

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