Hoogle Search
Within LTS Haskell 24.49 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Asynchronous backend for co-log library Buiding block for writing asynchronous logger pipelines.
-
Highligt Haskell source Highligt Haskell source
-
A CSV toolkit based on cassava and enum-text Please see the README on GitHub at https://github.com/cdornan/columnar#readme
-
Easy REPL driven development using ComponentM This library enhances the componentm with auto-reloading capabilites for your application, allowing to ensure cleanup of resources when doing REPL driven development, or when using ghcid
-
Combinators for unorthodox structure composition Increase the unreadability of your code through operators
-
Higher-order function combinators Replacement for composition or composition-extra, exporting everything in one module.
package
constrained-categories Constrained clones of the category-theory type classes, using ConstraintKinds. Haskell has, and makes great use of, powerful facilities from category theory – basically various variants of functors. However, all those are just endofunctors in Hask, the category of all Haskell types with functions as morphisms. Which is sufficient for container / control structures that you want to be able to handle any type of data, but otherwise it's a bit limiting, seeing as there are (in maths, science etc.) many categories that cannot properly be represented this way. Commonly used libraries such as http://hackage.haskell.org/package/vector-space thus make little notion of the fact that the objects they deal with actually form a category, instead defining just specialised versions of the operations. This library generalises functors etc. to a much wider class of categories, by allowing for constraints on objects (so these can have extra properties required). At the same time, we try to keep as close as possible to the well-known Haskell type class hierarchies rather than exactly adopting the mathematicians' notions. Consider the README file, the examples, and/or the documentation to Control.Category.Constrained for how to make use of this.
-
Partially applicable constraint tuples This library provides classes and type aliases that emulate the behavior of GHC's constraint tuple syntax. Unlike GHC's built-in constraint tuples, the types in this library can be partially applied. This library exposes four different modules that provide essentially the same API with slight differences in their implementation:
- Data.Tuple.Constraint: A CTupleN class compiles to a dictionary data type with N fields. (When building with GHC 9.10 or later, this will simply re-export the constraint tuples offered by GHC.Classes.)
- Data.Tuple.Constraint.ClassNewtype: A CTupleN class compiles to a newtype around the corresponding built-in constraint tuple type with N arguments.
- Data.Tuple.Constraint.TypeFamily: A CTupleN type alias is a constraint tuple type constructor with N arguments obtained by way of a type family. This will compile to a built-in constraint tuple, but casted with a type family axiom.
- Data.Tuple.Constraint.TypeSynonym: A CTupleN type alias is a constraint tuple type constructor with N arguments obtained by way of a type synonym. This will compile directly to a built-in constraint tuple.
-
Useful combinators for boolean expressions Useful combinators for boolean expressions
-
Interpreter for Copilot. Interpreter for Copilot. Copilot is a stream (i.e., infinite lists) domain-specific language (DSL) in Haskell that compiles into embedded C. Copilot contains an interpreter, multiple back-end compilers, and other verification tools. A tutorial, examples, and other information are available at https://copilot-language.github.io.