Trifecta is a modern parser combinator library for Haskell, with slicing and Clang-style colored diagnostics.

This package provides a Haskell type inhabited by finitely many values and indexed by type-level naturals.

SDL_image is an image file loading library. It loads images as SDL surfaces, and supports the following formats: BMP, GIF, JPEG, LBM, PCX, PNG, PNM, TGA, TIFF, XCF, XPM, XV.

This library defines a data structure for representing Jupyter notebooks, along with ToJSON and FromJSON instances for conversion to and from JSON .ipynb files.

This package provides a simple logging abstraction that allows multiple back-ends.

This Haskell library contains type definitions for Universally Unique Identifiers or UUIDs, and basic conversion functions.

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 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 package provides Unix terminal support for Vty.

This library provides extra functions for the standard Haskell libraries. Most functions are simple additions, filling out missing functionality. A few functions are available in later versions of GHC, but this package makes them available back to GHC 7.2.

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.

This package provides a simple logging abstraction that allows multiple back-ends.

A PointedList tracks the position in a non-empty list which works similarly to a zipper. A current item is always required, and therefore the list may never be empty. A circular PointedList wraps around to the other end when progressing past the actual edge.

Atomically write to a file on POSIX-compliant systems while preserving permissions. mv is an atomic operation. This makes it simple to write to a file atomically just by using the mv operation. However, this will destroy the permissions on the original file. This library preserves permissions while atomically writing to a file.

A Haskell 98 logically uninhabited data type, used to indicate that a given term should not exist.

This package provides a Haskell library for working with base16-encoded data quickly and efficiently, using the ByteString type.

This Haskell library provides a Lua module to work with file paths in a platform independent way.

This library provides phantom types for Haskell 98, to avoid having to unsafely pass dummy arguments.

The ghc-lib-parser-ex package contains GHC API parse tree utilities.

Language C is a Haskell library for the analysis and generation of C code. It features a complete, well-tested parser and pretty printer for all of C99 and a large set of GNU extensions.

This library contains simple and easy-to-use primitives for I/O using streams.

A UTF8 layer for Strings. The utf8-string package provides operations for encoding UTF8 strings to Word8 lists and back, and for reading and writing UTF8 without truncation.

IP Routing Table is a tree of IP ranges to search one of them on the longest match base. It is a kind of TRIE with one way branching removed. Both IPv4 and IPv6 are supported.

Clear to write, read and edit Haskell DSL for HTML.

• Names are consistent, and do not conflict with base or are keywords (all have suffix -).

• Same combinator can be used for attributes and elements (e.g. style_).