@hackage distributors dependencies

46 results

library:distributors (21 dependencies)

@hackage/lens

Lenses, Folds and Traversals

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

@hackage/QuickCheck

Automatic testing of Haskell programs

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

@hackage/template-haskell

Support library for Template Haskell

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

@hackage/adjunctions

Adjunctions and representable functors

BSD-2-Clause>=4.4 && <5

@hackage/base

Core data structures and operations

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

@hackage/witherable

filterable traversable

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

@hackage/distributive

Distributive functors -- Dual to Traversable

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

@hackage/mtl

Monad classes for transformers, using functional dependencies

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

@hackage/th-abstraction

Nicer interface for reified information about data types

ISC>=0.4 && <1

@hackage/profunctors

Profunctors

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

@hackage/text

An efficient packed Unicode text type.

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

@hackage/bifunctors

Bifunctors

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

@hackage/transformers

Concrete functor and monad transformers

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

@hackage/monad-loops

Monadic loops

LicenseRef-PublicDomain>=0.4.3 && <1

@hackage/vector

Efficient Arrays

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

@hackage/containers

Assorted concrete container types

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

@hackage/contravariant

Contravariant functors

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

@hackage/bytestring

Fast, compact, strict and lazy byte strings with a list interface

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

@hackage/MemoTrie

Trie-based memo functions

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

@hackage/tagged

Haskell 98 phantom types to avoid unsafely passing dummy arguments

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

@hackage/random

Pseudo-random number generation

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

test:test (25 dependencies)

@hackage/lens

Lenses, Folds and Traversals

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

@hackage/QuickCheck

Automatic testing of Haskell programs

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

@hackage/template-haskell

Support library for Template Haskell

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

@hackage/adjunctions

Adjunctions and representable functors

BSD-2-Clause>=4.4 && <5

@hackage/base

Core data structures and operations

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

@hackage/doctest

Test interactive Haskell examples

MIT>=0.18 && <1

@hackage/witherable

filterable traversable

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

@hackage/distributive

Distributive functors -- Dual to Traversable

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

@hackage/mtl

Monad classes for transformers, using functional dependencies

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

@hackage/megaparsec

Monadic parser combinators

BSD-2-Clause>=9.0 && <10

@hackage/th-abstraction

Nicer interface for reified information about data types

ISC>=0.4 && <1

@hackage/profunctors

Profunctors

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

@hackage/text

An efficient packed Unicode text type.

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

@hackage/bifunctors

Bifunctors

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

@hackage/transformers

Concrete functor and monad transformers

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

@hackage/monad-loops

Monadic loops

LicenseRef-PublicDomain>=0.4.3 && <1

@hackage/vector

Efficient Arrays

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

@hackage/containers

Assorted concrete container types

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

@hackage/hspec

A Testing Framework for Haskell

MIT>=2.7 && <3

@hackage/contravariant

Contravariant functors

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

@hackage/bytestring

Fast, compact, strict and lazy byte strings with a list interface

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

@hackage/distributors

Unifying Parsers, Printers & Grammars

BSD-3-Clause

@hackage/MemoTrie

Trie-based memo functions

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

@hackage/tagged

Haskell 98 phantom types to avoid unsafely passing dummy arguments

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

@hackage/random

Pseudo-random number generation

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