This package provides first class functional references. In addition to the usual operations of getting, setting and composition, plus integration with the state monad, lens families provide some unique features:

• Polymorphic updating

• Traversals

• Cast projection functions to read-only lenses

• Cast toList functions to read-only traversals

• Cast semantic editor combinators to modify-only traversals

For optimal first-class support use the lens-family package with rank 2/rank N polymorphism. Lens.Family.Clone allows for first-class support of lenses and traversals for those who require Haskell 98.

This package provides Haskell bindings to SDL2_mixer.

This package provides a wrapper around the Pango C library that allows high-quality rendering of Unicode text. It can be used either with Cairo to output text in PDF, PS or other documents or with Gtk+ to display text on-screen.

Diagrams is a flexible, extensible embedded domain-specific language (EDSL) for creating graphics of many types. Graphics can be created in arbitrary vector spaces and rendered with multiple backends. This package provides a standard library of primitives and operations for creating diagrams.

This library provides fast, packed, strict storable arrays with a list interface, a chunky lazy list interface with variable chunk size and an interface for write access via the ST monad. This is much like bytestring and binary but can be used for every Foreign.Storable.Storable type. See also https://hackage.haskell.org/package/vector, a library with a similar intention.

This library does not do advanced fusion optimization, since especially for lazy vectors this would either be incorrect or not applicable. See https://hackage.haskell.org/package/storablevector-streamfusion for a library that provides fusion with lazy lists.

Implementation of bidirectional TOML serialization.

To store passwords securely, they should be salted, then hashed with a slow hash function. This library uses PBKDF1-SHA256, and handles all the details. It uses the cryptohash package for speed; if you need a pure Haskell library, pwstore-purehaskell has the exact same API, but uses only pure Haskell. It is about 25 times slower than this package, but still quite usable.

This Haskell package aims to be an RFC3986 compliant URI parser that uses ByteStrings for parsing and representing the URI data.

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.

A prettyprinter/text rendering engine. Easy to use, well-documented, ANSI terminal backend exists, HTML backend is trivial to implement, no name clashes, Text-based, extensible.

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.

Long lived application data typically should not contain any thunks. This library can be used to examine values for unexpected thunks, which can then be used in assertions. This can be invaluable in avoiding memory leaks, or tracking down existing ones.

This package provides the core modules underlying diagrams, an embedded domain-specific language for compositional, declarative drawing.

This library provides a number of common functions and types useful in statistics. We focus on high performance, numerical robustness, and use of good algorithms. Where possible, we provide references to the statistical literature.

The library's facilities can be divided into four broad categories:

• Working with widely used discrete and continuous probability distributions. (There are dozens of exotic distributions in use; we focus on the most common.)

• Computing with sample data: quantile estimation, kernel density estimation, histograms, bootstrap methods, significance testing, and regression and autocorrelation analysis.

• Random variate generation under several different distributions.

• Common statistical tests for significant differences between samples.

Safe Haskell introduced the notion of safe and unsafe modules. In order to make as many as possible modules ``safe'', the well-known unsafe functions were moved to distinguished modules. This makes it hard to write packages that work with both old and new versions of GHC. This package provides a single module System.Unsafe that exports the unsafe functions from the base package. It provides them in a style ready for qualification, that is, you should import them by import qualified System.Unsafe as Unsafe.

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

The Scripting.Lua module is a wrapper of the Lua language interpreter as described in https://www.lua.org/.

This module provides set and multiset operations on ordered lists.

This package provides semigroups for Haskell. In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative binary operation. A semigroup generalizes a monoid in that there might not exist an identity element. It also (originally) generalized a group (a monoid with all inverses) to a type where every element did not have to have an inverse, thus the name semigroup.

Monad classes using type families, with instances for various monad transformers, inspired by the paper 'Functional Programming with Overloading and Higher-Order Polymorphism', by Mark P Jones. This package is almost a compatible replacement for the mtl-tf package.

This library is simply a collection of linear-algebra related modules split from the statistics library.

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

This package provides a backwards compatibility layer for Template Haskell newer than 2.8.

This package provides Haskell modules for accessing and manipulating fields of records.