@hackage folds dependencies

19 results

library:folds (19 dependencies)

@haskell/vector

Efficient Arrays

BSD-3-Clause>=0.10 && <0.13

@haskell/transformers

Concrete functor and monad transformers

BSD-3-Clause>=0.3 && <0.7

@haskell/mtl

Monad classes for transformers, using functional dependencies

BSD-3-Clause>=2.0.1 && <2.4

@haskell/base

Basic libraries

BSD-3-Clause>=4.9 && <5

@hackage/unordered-containers

Efficient hashing-based container types

BSD-3-Clause>=0.2 && <0.3

@hackage/tagged

Haskell 98 phantom types to avoid unsafely passing dummy arguments

BSD-3-Clause>=0.7 && <1

@hackage/semigroups

Anything that associates

BSD-3-Clause>=0.8 && <1

@hackage/semigroupoids

Semigroupoids: Category sans id

BSD-2-Clause>=4 && <6

@hackage/reflection

Reifies arbitrary terms into types that can be reflected back into terms

BSD-3-Clause>=1.3 && <3

@hackage/profunctors

Profunctors

BSD-3-Clause>=5 && <6

@hackage/pointed

Pointed and copointed data

BSD-3-Clause>=4 && <6

@hackage/lens

Lenses, Folds and Traversals

BSD-2-Clause>=4 && <6

@hackage/distributive

Distributive functors -- Dual to Traversable

BSD-3-Clause>=0.3 && <1

@hackage/data-reify

Reify a recursive data structure into an explicit graph.

BSD-3-Clause>=0.6 && <0.7

@hackage/contravariant

Contravariant functors

BSD-3-Clause>=0.4.2 && <2

@hackage/constraints

Constraint manipulation

BSD-2-Clause>=0.4 && <1

@hackage/comonad

Comonads

BSD-3-Clause>=4 && <6

@hackage/bifunctors

Bifunctors

BSD-3-Clause>=4 && <6

@hackage/adjunctions

Adjunctions and representable functors

BSD-3-Clause>=4.2 && <5