Hash consing for arbitrary Haskell data types
OTHER License
Haskell 98 contravariant functors
pointed and copointed data
fast unique variables
higher-kinded data
infinite search in finite time with Hilbert's epsilon
Bit twiddling and bitwise serialization primitives
Compensated floating-point arithmetic
Double hashing, rolling hashes, CRCs, etc.
Higher-rank hashable
Approximate discrete values and numbers
playground for working with succinct data structures
half-precision floating-point
Provides Data.Void, which is in base since ghc 7.8 or so
the EitherT monad transformer