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.
-
Shell script analysis tool The goals of ShellCheck are:
- To point out and clarify typical beginner's syntax issues, that causes a shell to give cryptic error messages.
- To point out and clarify typical intermediate level semantic problems, that causes a shell to behave strangely and counter-intuitively.
- To point out subtle caveats, corner cases and pitfalls, that may cause an advanced user's otherwise working script to fail under future circumstances.
-
Prototypical type checker for Type Theory with Sized Natural Numbers Sit = Size-irrelevant types Sit is a prototypical language with an Agda-compatible syntax. It has dependent function types, universes, sized natural numbers, and case and recursion over natural numbers. There is a relevant and an irrelevant quantifier over sizes. For an example, see file test/Test.agda.
-
A Transactional cache with user-defined persistence Please see the README on GitHub at https://github.com/agocorona/TCache#readme
-
Libary for parsing ViennaRNA package output Currently contains parsers and datatypes for: RNAalifold, RNAcode, RNAdistance, RNAcofold, RNAfold, RNAplex, RNAup, RNAz. For more information on the ViennaRNA package refer to http://www.tbi.univie.ac.at/RNA/. The libary is tested with Version 2.3.2 of the ViennaRNA package.
-
Bindings to the Xft and some Xrender parts A Haskell bindings to the X Font library. With it, Haskell X11 applications can access high quality font renderings and provide fonts with anti-aliasing and subpixel rendering. The bindings also provide minimal bindings to Xrender parts.
-
Elegant Functional Reactive Programming Language for Hybrid Systems Domain-specific language embedded in Haskell for programming hybrid (mixed discrete-time and continuous-time) systems. Yampa is based on the concepts of Functional Reactive Programming (FRP).
-
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.