This package provides Haskell bindings to bibutils, a library that interconverts between various bibliography formats using a common MODS-format XML intermediate.

Wrapper for the Data.Version.Version Haskell type.

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 Haskell package provides an either monad transformer.

This library implements unicode-casemap, the simple, non locale-sensitive unicode collation algorithm described in RFC 5051. Proper unicode collation can be done using text-icu, but that is a big dependency that depends on a large C library, and rfc5051 might be better for some purposes.

This package provides a custom prelude with no dependencies apart from the base package.

Foundation has the following goals:

1. provide a base like sets of modules that provide a consistent set of features and bugfixes across multiple versions of GHC (unlike base).

2. provide a better and more efficient prelude than base's prelude.

3. be self-sufficient: no external dependencies apart from base;

4. provide better data-types: packed unicode string by default, arrays;

5. Numerical classes that better represent mathematical things (no more all-in-one Num);

6. I/O system with less lazy IO.

The Union/Find algorithm implements these operations in (effectively) constant-time:

1. Check whether two elements are in the same equivalence class.

2. Create a union of two equivalence classes.

3. Look up the descriptor of the equivalence class.

This library provides everything that microlens provides plus instances to make each, at, and ix usable with arrays, ByteString, and containers. This package is a part of the microlens family; see the readme on Github.

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

This library provides access to system information and functionality to Lua scripts via Haskell's System module. Intended usage for this package is to preload it by adding the loader function to package.preload. Note that the Lua package library must have already been loaded before the loader can be added.

This library provides support for parsing and generating BitTorrent files.

Network.HostName is a simple package providing a means to determine the hostname.

This package provides a Conduit interface for the LZMA compression algorithm used in the .xz file format.

This package provides the following modules: Math.NumberTheory.Logarithms and Math.NumberTheory.Powers.Integer from the arithmoi package, GHC.Integer.Logarithms.Compat and Math.NumberTheory.Power.Natural, as well as some additional functions in migrated modules.

This haskell library provides validity and validity-based testing for ghc-hspec.

For examples and an introduction to the library please take a look at the <https://github.com/CRogers/should-not-typecheck#should-not-typecheck- README> on github.

Haskellers are usually familiar with monoids and semigroups. A monoid has an appending operation <> (or mappend), and an identity element, mempty. A semigroup has an appending <> operation, but does not require a mempty element. A Semiring has two appending operations, plus and times, and two respective identity elements, zero and one. More formally, a Semiring R is a set equipped with two binary relations + and *, such that: (R,+) is a commutative monoid with identity element 0, (R,*) is a monoid with identity element 1, (*) left and right distributes over addition, and . multiplication by 0 annihilates R.

Annotations are useful for coloring. This is a limited version of wl-pprint-extras without support for point effects and without the free monad. Like in annotated-wl-pprint, only annotations are supported. Compared to annotated-wl-pprint this library provides a slightly modernized interface.

This library provides Control.Lens. The combinators in Control.Lens provide a highly generic toolbox for composing families of getters, folds, isomorphisms, traversals, setters and lenses and their indexed variants.

Per Conor McBride, the Newtype typeclass represents the packing and unpacking of a newtype, and allows you to operate under that newtype with functions such as ala'.

This package enables users to expand type synonyms in Template Haskell abstract syntax trees (ASTs).

Lua module wrapping Text.DocLayout.

This package provides bifunctors for Haskell.

This package converts between bytestrings and their hexadecimal string representation.