This library provides a wrapper to the Linux kernel's inotify feature, allowing applications to subscribe to notifications when a file is accessed or modified.

This package provides Haskell 98 groups. A group is a monoid with invertibility.

More complex tests for chell.

Safe conversions between textual types

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.

Convenience functions and TH for working with constraints. See README.md for example usage.

This library provides mechanisms to efficiently run periodic, on-demand actions in Haskell.

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

ANSI terminal backend for the prettyprinter package.

This Haskell library provides strict left folds that stream in constant memory, and you can combine folds using Applicative style to derive new folds. Derived folds still traverse the container just once and are often as efficient as hand-written folds.

This library provides wrappers around Prelude and Data.List functions, such as head and !!, that can throw exceptions.

This library parses and dumps documents that are formatted according to RFC 4180, The common Format and MIME Type for Comma-Separated Values (CSV) Files. This format is used, among many other things, as a lingua franca for spreadsheets, and for certain web services.

This package provides a simple wrapper to show the used CPU time of monadic computation with an IO base.

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

A priority search queue efficiently supports the operations of both a search tree and a priority queue. A Binding is a product of a key and a priority. Bindings can be inserted, deleted, modified and queried in logarithmic time, and the binding with the least priority can be retrieved in constant time. A queue can be built from a list of bindings, sorted by keys, in linear time.

This library implements the 'patience diff' algorithm, as well as the patience algorithm for the longest increasing subsequence problem. Patience diff computes the difference between two lists, for example the lines of two versions of a source file. It provides a good balance between performance, nice output for humans, and simplicity of implementation.

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 functions to marshal and unmarshal pandoc document types to and from Lua. . The values of most types are pushed to pandoc as "userdata" objects that wrap a stable pointer to the Haskell value; these objects come with methods to access and modify their properties. . Sequences are pushed as normal Lua tables, but are augmented with convenience functions.

This package provides a mid-Level PostgreSQL client library, forked from ghc-mysql-simple.

Lets multiple threads and external processes concurrently output to the console, without it getting all garbled up.

Built on top of that is a way of defining multiple output regions, which are automatically laid out on the screen and can be individually updated by concurrent threads. Can be used for progress displays etc.

This package provides the ability to adapt to locale conventions such as date and time formats.

This package provides Haskell bindings to SDL2_ttf C++ library.

This is a Haskell library to derive Template Haskell's Lift class for datatypes.

This package provides a library implementing the XDG Base Directory spec.