Hoogle Search
Within LTS Haskell 24.45 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
GHC style name Z-encoding and Z-decoding Implements GHC's name mangling. This code was taken directly from the GHC source.
-
Zigzag encoding of integers into unsigned integers. Zigzag encoding is usually a precursor to a varint encoding such as LEB128. It has the advantage that numbers nearer zero are represented with only the lower-order bits set.
-
Operations on zip archives Operations on zip archives.
-
ZIP archive streaming using conduits Process (extract and create) zip files as streams (e.g., over the network), accessing contained files without having to write the zip file to disk (unlike zip-conduit).
-
Low-level bindings to the zlib package. Low-level bindings to the zlib package.
-
Haskell bindings to the Zstandard compression algorithm A fast lossless compression algorithm, targeting real-time compression scenarios at zlib-level and better compression ratios.
-
A binding for the OpenAL Utility Toolkit A Haskell binding for the OpenAL Utility Toolkit, which makes managing of OpenAL contexts, loading sounds in various formats and creating waveforms very easy. For more information about the C library on which this binding is based, please see: http://distro.ibiblio.org/rootlinux/rootlinux-ports/more/freealut/freealut-1.1.0/doc/alut.html.
-
Num instance for Applicatives provided via the ANum newtype Num instance for Applicatives provided via the ANum newtype
-
Mapping between Aeson's JSON and Bson objects. This package lets you convert between Aeson's JSON and Bson objects.
-
A dependently typed functional programming language and proof assistant Agda is a dependently typed functional programming language: It has inductive families, which are similar to Haskell's GADTs, but they can be indexed by values and not just types. It also has parameterised modules, mixfix operators, Unicode characters, and an interactive Emacs interface (the type checker can assist in the development of your code). Agda is also a proof assistant: It is an interactive system for writing and checking proofs. Agda is based on intuitionistic type theory, a foundational system for constructive mathematics developed by the Swedish logician Per Martin-Löf. It has many similarities with other proof assistants based on dependent types, such as Rocq (formerly known as Coq), Idris, Lean and NuPRL. This package includes both a command-line program (agda) and an Emacs mode.