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.
-
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.
-
Near-future Sci-Fi roguelike and tactical squad combat game Allure of the Stars is a near-future Sci-Fi roguelike and tactical squad combat game. Binaries and the game manual are available at the homepage. You can also try the game out in the browser at http://allureofthestars.com/play. Not a single image in this game. You have to imagine everything yourself, like with a book (a grown-up book, without pictures). Once you learn to imagine things, though, you can keep exploring and mastering the world and making up stories for a long time. The game is written in Haskell using the LambdaHack roguelike game engine http://hackage.haskell.org/package/LambdaHack. Please see the changelog file for recent improvements and the issue tracker for short-term plans. Long term goals are high replayability and auto-balancing through procedural content generation and persistent content modification based on player behaviour. Contributions are welcome. This is a workaround .cabal file, flattened to eliminate internal libraries until generating haddocks for them is fixed. The original .cabal file is in .cabal.bkp file.
-
A compiler front-end generator. The BNF Converter is a compiler construction tool generating a compiler front-end from a Labelled BNF grammar. It was originally written to generate Haskell code, but can also be used for generating Agda, C, C++, Java, Ocaml and XML code. Given a Labelled BNF grammar the tool produces: an abstract syntax as a Haskell, Agda, C, C++, Ocaml module or Java package, a case skeleton for the abstract syntax in the same language, an Alex, Flex, JLex, JFlex, or ocamllex lexer generator file, a Happy, CUP, Bison, Antlr, ocamlyacc or menhir parser generator file, a pretty-printer as a Haskell, Agda, C, C++, Java, or Ocaml module, an XML representation, a LaTeX file containing a readable specification of the language.