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

Haddock is a documentation-generation tool for Haskell libraries. These modules expose some functionality of it without pulling in the GHC dependency. Please note that the API is likely to change so specify upper bounds in your project if you can't release often. For interacting with Haddock itself, see the ‘haddock’ package.

This module allows tokens produced by skylighting-core to be rendered as ANSI colored text.

This package provides a simple type class for converting values of different string types into values of other string types.

This Haskell package uses a monad transformer approach for logging.

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

This package provides bindings and types to bridge Haskell and <https://www.lua.org/ Lua>. . The full Lua interpreter version 5.4.4 is included. Alternatively, a system-wide Lua installation can be linked instead.

This Haskell library provides a Template Haskell deriver for unboxed vectors, given a pair of coercion functions to and from some existing type with an Unbox instance.

PCG is a family of simple fast space-efficient statistically good algorithms for random number generation. Unlike many general-purpose RNGs, they are also hard to predict. . This library implements bindings to the standard C implementation. This includes the standard, unique, fast and single variants in the pcg family. There is a pure implementation that can be used as a generator with the random package as well as a faster primitive api that includes functions for generating common types. . The generators in this module are suitable for use in parallel but make sure threads don't share the same generator or things will go horribly wrong.

This package allows you to use Template Haskell to read a file or all the files in a directory, and turn them into (path, bytestring) pairs embedded in your Haskell code.

Efficient hashing-based container types. The containers have been optimized for performance critical use, both in terms of large data quantities and high speed.

The ListLike module provides a common interface to the various Haskell types that are list-like. Predefined interfaces include standard Haskell lists, Arrays, ByteStrings, and lazy ByteStrings. Custom types can easily be made ListLike instances as well.

ListLike also provides for String-like types, such as String and ByteString, for types that support input and output, and for types that can handle infinite lists.

Wrappers and helpers to bridge Haskell and <https://www.lua.org/ Lua>. . It builds upon the /lua/ package, which allows bundling a Lua interpreter with a Haskell program.

This package provides functions for signed 15.16 precision fixed point arithmetic.

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.

Lightweight pure data validation based on Applicative and Selective functors.

This package provides a bunch of ad hoc classes for accessing parts of a container. In practice this package is largely subsumed by the ghc-lens, but it is maintained for now as it has much simpler dependencies.

An implementation of the git-lfs protocol.

This package (formerly binary-serialise-cbor) provides pure, efficient serialization of Haskell values directly into ByteStrings for storage or transmission purposes. By providing a set of type class instances, you can also serialise any custom data type you have as well.

The underlying binary format used is the 'Concise Binary Object Representation', or CBOR, specified in RFC 7049. As a result, serialised Haskell values have implicit structure outside of the Haskell program itself, meaning they can be inspected or analyzed without custom tools.

An implementation of the standard bijection between CBOR and JSON is provided by the https://hackage.haskell.org/package/cborg-json package. Also see https://hackage.haskell.org/package/cbor-tool for a convenient command-line utility for working with CBOR data.

This package provides Haskell bindings to the the POSIX network database (<netdb.h>) API.

This Haskell package provides a family of type-safe templates with simple variable interpolation. Shakespeare templates can be used inline with a quasi-quoter or in an external file and it interpolates variables according to the type being inserted.

This package provides a fully compliant Haskell 98 lexer.

This Haskell package aims to reexport all the non-conflicting and most general definitions from the "base" package.

This includes APIs for applicatives, arrows, monoids, foldables, traversables, exceptions, generics, ST, MVars and STM.

This package will never have any dependencies other than "base".

Versioning policy:

The versioning policy of this package deviates from PVP in the sense that its exports in part are transitively determined by the version of "base". Therefore it's recommended for the users of ghc-base-prelude to specify the bounds of "base" as well.

This Haskell library provides simple read-only access to the local computer's networking configuration. It is currently capable of getting a list of all the network interfaces and their respective IPv4, IPv6 and MAC addresses.

FoldMap lists are lists represented by their foldMap function. FoldMap lists have O(1) cons, snoc and append, just like DLists, but other operations might have favorable performance characteristics as well. These wild claims are still completely unverified though.