Hoogle Search
Within LTS Haskell 24.4 (ghc-9.10.2)
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
-
Non-negative numbers Provides a class for non-negative numbers, a wrapper which can turn any ordered numeric type into a member of that class, and a lazy number type for non-negative numbers (a generalization of Peano numbers). This library is used by the event-list package.
package
quickcheck-classes-base QuickCheck common typeclasses from `base` This libary is a minimal variant of `quickcheck-classes` that only provides laws for typeclasses from base. The main purpose of splitting this out is so that primitive can depend on `quickcheck-classes-base` in its test suite, avoiding the circular dependency that arises if `quickcheck-classes` is used instead. This library provides QuickCheck properties to ensure that typeclass instances adhere to the set of laws that they are supposed to. There are other libraries that do similar things, such as `genvalidity-hspec` and checkers. This library differs from other solutions by not introducing any new typeclasses that the user needs to learn. Note: on GHC < 8.5, this library uses the higher-kinded typeclasses (Data.Functor.Classes.Show1, Data.Functor.Classes.Eq1, Data.Functor.Classes.Ord1, etc.), but on GHC >= 8.5, it uses `-XQuantifiedConstraints` to express these constraints more cleanly.
-
Align and Zip type-classes from the common Semialign ancestor. The major use of These of this is provided by the align member of Semialign class, representing a generalized notion of "zipping with padding" that combines structures without truncating to the size of the smaller input. It turns out that zip operation fits well the Semialign class, forming lattice-like structure.
-
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.