Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
A monad and monad transformer for nondeterministic computations. Nondeterministic computations
-
Type-level integers, using TypeNats, Data Kinds, and Closed Type Families. This package provides type level representations of the (positive and negative) integers and basic operations (addition, subtraction, multiplication, division, exponentiation) on these. The numtype-dk package differs from the numtype package in that the NumTypes are implemented using Data Kinds, TypeNats, and Closed Type Families rather than Functional Dependencies. Requires GHC 7.8 or later.
-
The OpenTelemetry Haskell Client https://opentelemetry.io
-
Optional function arguments This library provides a type for specifying Optional function arguments Read the tutorial in Data.Optional to learn more
-
Simple interface to optparse-applicative Please see the README at https://www.stackage.org/package/optparse-simple
-
Use pandoc types in Lua 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.
-
Class of types that can be constructed from their text representation This library provides the type class HasParser as a dual to Pretty. Instances of this class provide a parser than can be used to construct the type from its text representation.
-
Data structure supporting partial orders Please see README.md
-
URLs without host information Please see the README on Github at https://github.com/athanclark/path-extra#readme
-
Patience diff and longest increasing subsequence 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 of performance, nice output for humans, and implementation simplicity. For more information, see http://alfedenzo.livejournal.com/170301.html and http://bramcohen.livejournal.com/73318.html.