Hoogle Search
Within LTS Haskell 24.64 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
simple performant time related library Simple time library focusing on simple but powerful and performant API The backbone of the library are the Timeable and Time type classes. Each Timeable instances can be converted to type that has a Time instances, and thus are different representations of current time.
-
Utility functions for testing Megaparsec parsers with Hspec Utility functions for testing Megaparsec parsers with Hspec.
-
A collection of tools for processing XML with Haskell. The Haskell XML Toolbox bases on the ideas of HaXml and HXML, but introduces a more general approach for processing XML with Haskell. The Haskell XML Toolbox uses a generic data model for representing XML documents, including the DTD subset and the document subset, in Haskell. It contains a validating XML parser, a HTML parser, namespace support, an XPath expression evaluator, an XSLT library, a RelaxNG schema validator and funtions for serialization and deserialization of user defined data. The library makes extensive use of the arrow approach for processing XML. Since version 9 the toolbox is partitioned into various (sub-)packages. This package contains the core functionality, hxt-curl, hxt-tagsoup, hxt-relaxng, hxt-xpath, hxt-xslt, hxt-regex-xmlschema contain the extensions. hxt-unicode contains encoding and decoding functions, hxt-charproperties char properties for unicode and XML. Changes from 9.3.1.21: ghc-9.0 compatibility Changes from 9.3.1.20: ghc 8.10 and 9.0 compatibility, tuple picker up to 24-tuples, Either instance for xpickle Changes from 9.3.1.19: ghc-8.8.2 compatibility Changes from 9.3.1.15: Bug in quoting PI instructions in showXmlTrees fixed Changes from 9.3.1.14: For ghc-7.10 network-uri is automatically selected Changes from 9.3.1.13: ghc-7.10 compatibility Changes from 9.3.1.12: Bug when unpickling an empty attribute value removed Changes from 9.3.1.11: Bug fix in haddock comments Changes from 9.3.1.10: Bug in DTD validation, space and time leak in delta removed Changes from 9.3.1.9: lower bound of mtl dependency lowered to 2.0.1 Changes from 9.3.1.8: Bug in hread removed Changes from 9.3.1.7: Foldable and Traversable instances for NTree added Control.Except used instead of deprecated Control.Error Changes from 9.3.1.6: canonicalize added in hread and hreadDoc Changes from 9.3.1.4: conditionally (no default) dependency from networt changed to network-uri with flag "network-uri" Changes from 9.3.1.3: warnings from ghc-7.8.1 removed Changes from 9.3.1.2: https as protocol added Changes from 9.3.1.1: new parser xreadDoc Changes from 9.3.1.0: in readString all input decoding switched off Changes from 9.3.0.1: lower bound for network set to be >= 2.4 Changes from 9.3.0: upper bound for network set to be < 2.4 (URI signatures changed in 2.4) Changes from 9.2.2: XMLSchema validation integrated Changes from 9.2.1: user defined mime type handlers added Changes from 9.2.0: New warnings from ghc-7.4 removed
-
Integer logarithms. Math.NumberTheory.Logarithms and Math.NumberTheory.Powers.Integer from the arithmoi package. Also provides GHC.Integer.Logarithms.Compat and Math.NumberTheory.Power.Natural modules, as well as some additional functions in migrated modules.
-
Enumerative property-based testing LeanCheck is a simple enumerative property-based testing library. Properties are defined as Haskell functions returning a boolean value which should be true for all possible choices of argument values. LeanCheck applies enumerated argument values to these properties in search for a counterexample. Properties can be viewed as parameterized unit tests. LeanCheck works by producing tiers of test values: a possibly infinite list of finite sublists of same-and-increasingly-sized values. LeanCheck has lean core with only 200 lines of Haskell code.
-
Support functions for automated testing Support functions for automated testing
-
Random shuffle implementation. Random shuffle implementation, on immutable lists. Based on `perfect shuffle' implementation by Oleg Kiselyov, available on http://okmij.org/ftp/Haskell/perfect-shuffle.txt
-
Selective applicative functors Selective applicative functors: declare your effects statically, select which to execute dynamically. This is a library for selective applicative functors, or just selective functors for short, an abstraction between applicative functors and monads, introduced in this paper.
-
Basic singleton types and definitions singletons contains the basic types and definitions needed to support dependently typed programming techniques in Haskell. This library was originally presented in Dependently Typed Programming with Singletons, published at the Haskell Symposium, 2012. (https://richarde.dev/papers/2012/singletons/paper.pdf) singletons is intended to be a small, foundational library on which other projects can build. As such, singletons has a minimal dependency footprint and supports GHCs dating back to GHC 8.0. For more information, consult the singletons README. You may also be interested in the following related libraries:
- The singletons-th library defines Template Haskell functionality that allows promotion of term-level functions to type-level equivalents and singling functions to dependently typed equivalents.
- The singletons-base library uses singletons-th to define promoted and singled functions from the base library, including the Prelude.
-
Existential type: Some This library defines an existential type Some.
data Some f where Some :: f a -> Some f
in few variants, and utilities to work with it. If you are unsure which variant to use, use the one in Data.Some module.