Hoogle Search
Within LTS Haskell 24.18 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
crypton conduit Conduit bridge for crypton For now only provide a conduit version for hash and hmac, but with contribution, this could provide cipher conduits too, and probably other things.
-
CSS parser and renderer. Please see the README and generated docs at https://www.stackage.org/package/css-text
-
Efficient manipulating of 2D cubic bezier curves. This library supports efficient manipulating of 2D cubic bezier curves, for use in graphics or typography. Supported features are: Evaluating bezier curves and derivatives, affine transformations on bezier curves, arclength and inverse arclength, intersections between two curves, intersection between a curve and a line, curvature and radius of curvature, finding tangents parallel to a vector, finding inflection points and cusps. It also supports polynomial root finding with Bernstein polynomials. The module Geom2D.CubicBezier exports all the cubic bezier functions. The module Geom2D contains general 2D geometry functions and transformations.
-
Purely Functional Cursors Purely Functional Cursors for common data structures See https://cs-syd.eu/tags/cursors for more information.
-
A basic framework for effect systems based on effects represented by GADTs. A basic framework for a Haskell effect system library based on GADTs-based effect representations with a style that separates first-order effects and higher-order effects. This library set was created by being separated from the Heftia extensible effects library.
-
A basic framework for effect systems based on effects represented by GADTs. This library provides core definitions of data-effects.
-
Set and bag operations on ordered lists This module provides set and multiset operations on ordered lists.
-
Reify a recursive data structure into an explicit graph. 'data-reify' provided the ability to turn recursive structures into explicit graphs. Many (implicitly or explicitly) recursive data structure can be given this ability, via a type class instance. This gives an alternative to using Ref for observable sharing. Observable sharing in general is unsafe, so we use the IO monad to bound this effect, but can be used safely even with unsafePerformIO if some simple conditions are met. Typically this package will be used to tie the knot with DSL's that depend of observable sharing, like Lava. Providing an instance for MuRef is the mechanism for allowing a structure to be reified into a graph, and several examples of this are provided. © 2009 Andy Gill; BSD3 license.
-
Decidable propositions. This package provides a Dec type.
type Neg a = a -> Void data Dec a = Yes a | No (Neg a)
-
A library for unit-testing concurrent programs. [Déjà Fu is] A martial art in which the user's limbs move in time as well as space, […] It is best described as "the feeling that you have been kicked in the head this way before" -- Terry Pratchett, Thief of Time This package builds on the concurrency package by enabling you to deterministically test your concurrent programs. See the website or README for more.