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 an implementation of n-ary sums and n-ary products. The module Data.SOP is the main module of this library and contains more detailed documentation. The main use case of this package is to serve as the core of generics-sop.

This Haskell package provides the core MonadUnliftIO typeclass, instances for base and transformers, and basic utility functions.

This is library provides utility to use Netlink from Haskell. The scope of this package extends over general Netlink support to specific implementations of Netlink families.

This library provides tools to create command line interfaces with ease.

This package provides functions to prevent or capture writing to stdout and other handles.

This package provides strict versions of some standard Haskell data types, such as pairs, Maybe and Either. It also contains strict IO operations.

In Haskell you very often acquire values using the with... idiom using functions of type (a -> IO r) -> IO r. This idiom forms a Monad, which is a special case of the ContT monad (from transformers) or the Codensity monad (from kan-extensions). The main purpose behind this package is to provide a restricted form of these monads specialized to this unusually common case.

The reason this package defines a specialized version of these types is to:

• be more beginner-friendly,

• simplify inferred types and error messages, and:

• provide some additional type class instances that would otherwise be orphan instances

This Haskell package provides an API for constructing vectors. It provides the composable Builder abstraction, which has instances of the Monoid and Semigroup classes.

You would first use the Builder abstraction to specify the structure of the vector; then you can execute the builder to actually produce the vector.

This package provides extra instances for type-classes in the [indexed-traversable](https://hackage.haskell.org/package/indexed-traversable) package. . The intention is to keep this package minimal; it provides instances that formerly existed in @lens@ or @optics-extra@. We recommend putting other instances directly into their defining packages. The @indexed-traversable@ package is light, having only GHC boot libraries as its dependencies.

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

This package provides datatypes to construct Free monads, Free monad transformers, and useful instances. In addition it provides the constructs to avoid quadratic complexity of left associative bind, as explained in:

• Janis Voigtlander, Asymptotic Improvement of Computations over Free Monads, MPC'08

This Haskell library provides a purely functional interface for statistics based on hmatrix and GSL.

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 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.

The functions for creating temporary files and directories in the base library are quite limited. The unixutils package contains some good ones, but they aren't portable to Windows. This library just repackages the Cabal implementations of its own temporary file and folder functions so that you can use them without linking against Cabal or depending on it being installed. This is a better maintained fork of the "temporary" package.

ByteString-backed Handles

This library provides data structures for describing changes to other data structures. In this library, a patch is something that can be applied, analogous to a function, and which distinguishes returning the argument it was provided from returning something else.

Fixpoint types and recursion schemes. If you define your AST as fixpoint type, you get fold and unfold operations for free.

Thanks for contribution to: Matej Kollar, Herbert Valerio Riedel

Reasonably fast data encoding library.

The Par monad offers an API for parallel programming. The library works for parallelising both pure and IO computations, although only the pure version is deterministic. The default implementation provides a work-stealing scheduler and supports forking tasks that are much lighter weight than IO-threads.

This Haskell library provides a purely functional interface to selected numerical computations, internally implemented using GSL.

This Haskell library provides a function for computing the difference between (expression) trees. It also provides a way to compute the difference between arbitrary abstract datatypes (ADTs) using Generics-derivable helpers.

Network recv based on buffer pools