This package provides Type-level booleans.

This package tries to compat as many time features as possible.

Regex-tdfa is a pure Haskell regular expression library implementing POSIX extended regular expressions. It is a "tagged" DFA regex engine. It is inspired by libtre.

Zstandard compression packaged as a conduit. This is a very thin wrapper around the official hs-zstd interface.

This package addresses the 'configuration problem' which is propagating configurations that are available at run-time, allowing multiple configurations to coexist without resorting to mutable global variables or System.IO.Unsafe.unsafePerformIO.

The texmath library provides functions to read and write TeX math, presentation MathML, and OMML (Office Math Markup Language, used in Microsoft Office). Support is also included for converting math formats to pandoc's native format (allowing conversion, via pandoc, to a variety of different markup formats). The TeX reader supports basic LaTeX and AMS extensions, and it can parse and apply LaTeX macros.

This library provides an interface to GSL special functions for Haskell.

The HMatrix package provides a Haskell library for dealing with linear systems, matrix decompositions, and other numerical computations based on BLAS and LAPACK.

ghc-doctest-driver-gen is a Doctest's driver file generator. It lets you automatically generate driver file for Doctest's Cabal integration.

This package provides tools to parse Haskell sources to the template-haskell abstract syntax.

This package provides ordered containers of intervals, with efficient search for all keys containing a point or overlapping an interval. See the example code on the home page for a quick introduction.

This package provides a drop-in replacement for the standard filepath library, operating on RawFilePath values rather than FilePath values to get the speed benefits of using ByteStrings.

This Haskell package provides support for computations which consume random values.

This is a lightweight package providing commonly useful parser combinators.

This package provides an URI manipulation interface. In network-2.6 the Network.URI module was split off from the network package into this package.

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

This package provides a functional library for creating efficient memo functions using tries.

This Haskell library provides pointed and copointed data types.

Manipulate identifiers and structurally non-complex pieces of text by delimiting word boundaries via a combination of whitespace, control-characters, and case-sensitivity.

Has support for common idioms like casing of programmatic variable names, taking, dropping, and splitting by word, and modifying the first character of a piece of text.

Caution: this library makes heavy use of the text library's internal loop optimisation framework. Since internal modules are not guaranteed to have a stable API there is potential for build breakage when the text dependency is upgraded. Consider yourself warned!

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 library tries to call minimum system calls which are the bottleneck of web servers.

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

This library provides functions for use in parsing indentation sensitive contexts. It parses blocks of lines all indented to the same level as well as lines continued at an indented level below.

This package provides a data structure representing a bidirectional mapping between two key types. Each value in the bimap is associated with exactly one value of the opposite type.