@hackage/hashable-time
Hashable instances for Data.Time
@hackage/either
Combinators for working with sums
@hackage/semigroupoids
Semigroupoids: Category sans id
@hackage/deepseq
Deep evaluation of data structures
@hackage/void
A Haskell 98 logically uninhabited data type
@hackage/comonad
Comonads
@hackage/base
Core data structures and operations
@hackage/stm
Software Transactional Memory
@hackage/mtl
Monad classes for transformers, using functional dependencies
@hackage/uuid
For creating, comparing, parsing and printing Universally Unique Identifiers
@hackage/hashable
A class for types that can be converted to a hash value
@hackage/dlist
Difference lists
@hackage/vector-instances
Orphan Instances for 'Data.Vector'
@hackage/profunctors
Profunctors
@hackage/scientific
Numbers represented using scientific notation
@hackage/text
An efficient packed Unicode text type.
@hackage/bifunctors
Bifunctors
@hackage/transformers
Concrete functor and monad transformers
@hackage/vector
Efficient Arrays
@hackage/containers
Assorted concrete container types
@hackage/unordered-containers
Efficient hashing-based container types
@hackage/time
A time library
@hackage/contravariant
Contravariant functors
@hackage/bytestring
Fast, compact, strict and lazy byte strings with a list interface
@hackage/selective
Selective applicative functors