Hoogle Search
Within LTS Haskell 24.36 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
A test-suite for any queue or double-ended queue satisfying an interface This package provides tests that can be used with any queue implementation that satisfies the `abstract-deque` interface.
-
Attempto Controlled English parser and printer Attempto Controlled English is a formally defined unambiguous language which is a subset of the English language. This package provides a tokenizer, parser and printer for that language. Specifically, it implements the declarative mood and the interrogative mood. The imperative mood is omitted at this time. Interpretation rules, conversion to FoL, or any further analysis is not implemented by this library.
-
Reverse-mode automatic differentiation with delimited continuations Reverse-mode automatic differentiation using delimited continuations (shift/reset). The package exposes a small and easily extensible user interface to automatic differentiation combinators. It's also lightweight as a dependency, since it only requires base and transformers. To use the library, import Numeric.AD.DelCont, which also contains all documentation. Blog post : http://ocramz.github.io/haskell/automatic-differentiation/2021/07/19/ad-delcont.html References :
- F. Wang et al, Backpropagation with Continuation Callbacks : Foundations for Efficient and Expressive Differentiable Programming, NeurIPS 2018 - https://papers.nips.cc/paper/2018/file/34e157766f31db3d2099831d348a7933-Paper.pdf
- F. Wang et al, Demystifying Differentiable Programming : Shift/Reset the Penultimate Backpropagator, ICFP 2019 - https://www.cs.purdue.edu/homes/rompf/papers/wang-icfp19.pdf
-
An implementation of Adler-32, supporting rolling checksum operation This package provides an implementation of the Adler-32 checksum algorithm. It supports a rolling checksum mode, i.e. the checksum of a sliding window of the input message can be computed efficiently. It also supports compounding, i.e. the checksum of the concatenation of two messages can be efficiently computed from the checksums of the two parts. By default, the highly optimized implementation of Adler-32 from zlib will be used. This can be disabled, in which case a pure haskell implementation will be used instead. On my system, the haskell version is 2 to 3 times slower.
-
Advent of Code REST API bindings and servant API Haskell bindings for Advent of Code REST API and a servant API. Please use responsibly! See README.md or Advent module for an introduction and tutorial.
-
Real numbers as convergent sequences of intervals Please see the README on GitHub at https://github.com/michalkonecny/aern2/#readme
-
Embed an Attoparsec text parser into an Aeson parser Embed an Attoparsec text parser into an Aeson parser
-
Better error messages when decoding JSON values. A small package which gives you the tools to build parsers to decode JSON values, and gives good error messages when parsing fails. See also http://harry.garrood.me/blog/aeson-better-errors/.
-
Aeson combinators for dead simple JSON decoding Low overhead value space Decoder on top of Aeson's Parser for combinator style decoding.
-
Parse and run JSONPath queries on Aeson documents RFC 9535 compliant JSONPath parsing and querying package. JSONPath is similar to XPath for querying XML documents.