const is:package
Not on Stackage, so not searched.
Read-only mutable primitives
Constraint manipulation
GHC 7.4 gave us the ability to talk about ConstraintKinds.
They stopped crashing the compiler in GHC 7.6.
This package provides a vocabulary for working with them.
Utility package for constraints
Convenience functions and TH for working with constraints. See
README.md for example usage.
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.
Not on Stackage, so not searched.
Reified constraints
Not on Stackage, so not searched.
Existential type that can be constrained
Not on Stackage, so not searched.
Manipulating constraints and deriving class instances programmatically.
Not on Stackage, so not searched.
Dynamic typing with retained constraints
Not on Stackage, so not searched.
Typeclasses and instances for monads with constraints.
Not on Stackage, so not searched.
Some conviencience type functions for manipulating constraints.
Not on Stackage, so not searched.
Defer instance lookups until runtime
Not on Stackage, so not searched.
Compiler plugin for constant math elimination
Not on Stackage, so not searched.
A safe interface for Const summarization
Not on Stackage, so not searched.
Parse ByteStrings of a prescribed length.
Not on Stackage, so not searched.
Generalization of standard Functor, Foldable, and Traversable classes
Not on Stackage, so not searched.
Constrained Categories
Not on Stackage, so not searched.
Normalised Deep Embeddings for Constrained Type-Class Instances
Not on Stackage, so not searched.
Various typeclasses using ConstraintKinds
Not on Stackage, so not searched.
Constraint reflection
Not on Stackage, so not searched.
strict versions of many things in base
A Haskell version of the
Construct library for Python. A
succinct file format specification provides both a parser and the
serializer for the format.
Not on Stackage, so not searched.
Exact computation with constructible real numbers
Not on Stackage, so not searched.
A library of constructive algebra.
Not on Stackage, so not searched.
Equality by only Constructor
Not on Stackage, so not searched.
Instances of standard platform types for 'constrained' package.