This Haskell package uses a monad transformer approach for logging.

This package provides Template Haskell functions for determining source code locations of messages.

A cross-platform library for retrieving information about disk space usage.

This Haskell package allows Haskell programs to access data storage systems like PostgreSQL, SQLite, and MariaDB in a type-safe way.

This package provides a compatibility layer providing Binary instances for strict and lazy text types for versions older than 1.2.1 of the text package.

A clone of wl-pprint for use with the text library.

This Haskell package provides a validator that can validate an email address string against RFC 5322.

This package provides Prism and Traversals for These.

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

Highlighting-kate is a syntax highlighting library with support for nearly one hundred languages. The syntax parsers are automatically generated from Kate syntax descriptions, so any syntax supported by Kate can be added. An (optional) command-line program is provided, along with a utility for generating new parsers from Kate XML syntax descriptions.

This Haskell package includes tools for generating and consuming feeds in both RSS (Really Simple Syndication) and Atom format.

With this package you can build a Storable instance of a record type from Storable instances of its elements in an elegant way. It does not do any magic, just a bit arithmetic to compute the right offsets, that would be otherwise done manually or by a preprocessor like C2HS. There is no guarantee that the generated memory layout is compatible with that of a corresponding C struct. However, the module generates the smallest layout that is possible with respect to the alignment of the record elements.

This package provides a quasiquoter for non-interpolated strings, texts and bytestrings.

This Haskell package provides three useful generalizations:

class Functor f => FunctorWithIndex i f | f -> i where
  imap :: (i -> a -> b) -> f a -> f b

class Foldable f => FoldableWithIndex i f | f -> i where
  ifoldMap :: Monoid m => (i -> a -> m) -> f a -> m

class (FunctorWithIndex i t, FoldableWithIndex i t, Traversable t)
       => TraversableWithIndex i t | t -> i where
  itraverse :: Applicative f => (i -> a -> f b) -> t a -> f (t b)

The ghc-keys package provides similar functionality, but uses associated TypeFamilies instead of FunctionalDependencies.

This package provides a quasiquoter for raw string literals, i.e. string literals that don't recognise the standard escape sequences. Basically, they make your code more readable by freeing you from the responsibility to escape backslashes. They are useful when working with regular expressions, DOS/Windows paths and markup languages (such as XML).

This package provides functions to marshal values from Haskell to Lua, and /vice versa/. . This package is part of HsLua, a Haskell framework built around the embeddable scripting language <https://lua.org Lua>.

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

Bindings to the Xft, X Free Type interface library, and some Xrender parts.

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 module locates the full directory of the running program, to allow the use of paths relative to it. FindBin supports invocation of Haskell programs via "ghci", via "runhaskell/runghc", as well as compiled as an executable.

The package provides mutable and immutable bit arrays.

Types that are parametric on a functor are like Barbies that have an outfit for each role. This package provides the basic abstractions to work with them comfortably.

Provides a small set of helper functions for testing Megaparsec parsers with Hspec.

This library provides an efficient implementation of Int-indexed arrays (both mutable and immutable), with a powerful loop optimisation framework.

The doctest program checks examples in source code comments. It is modeled after doctest for Python, see the Doctest website.