@hackage overeasy dependencies

29 results

library:overeasy (13 dependencies)

@haskell/transformers

Concrete functor and monad transformers

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

@haskell/text

An efficient packed Unicode text type.

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

@haskell/mtl

Monad classes for transformers, using functional dependencies

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

@haskell/deepseq

Deep evaluation of data structures

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

@haskell/containers

Assorted concrete container types

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

@haskell/base

Basic libraries

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

@hackage/unordered-containers

Efficient hashing-based container types

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

@hackage/unfree

Simplistic free monad with deriving through UndecidableInstances

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

@hackage/recursion-schemes

Representing common recursion patterns as higher-order functions

BSD-2-Clause>=5.2 && <5.3

@hackage/logict

A backtracking logic-programming monad.

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

@hackage/int-like

Newtype wrappers over IntSet and IntMap

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

@hackage/hashable

A class for types that can be converted to a hash value

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

@hackage/algebraic-graphs

A library for algebraic graph construction and transformation

MIT>=0.5 && <0.7

test:overeasy-test (16 dependencies)

@haskell/transformers

Concrete functor and monad transformers

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

@haskell/text

An efficient packed Unicode text type.

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

@haskell/mtl

Monad classes for transformers, using functional dependencies

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

@haskell/deepseq

Deep evaluation of data structures

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

@haskell/containers

Assorted concrete container types

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

@haskell/base

Basic libraries

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

@hackage/unordered-containers

Efficient hashing-based container types

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

@hackage/unfree

Simplistic free monad with deriving through UndecidableInstances

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

@hackage/recursion-schemes

Representing common recursion patterns as higher-order functions

BSD-2-Clause>=5.2 && <5.3

@hackage/prop-unit

Conveniences for using Hedgehog as a unit test runner

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

@hackage/overeasy

A purely functional E-Graph library

BSD-3-Clause

@hackage/logict

A backtracking logic-programming monad.

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

@hackage/int-like

Newtype wrappers over IntSet and IntMap

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

@hackage/hedgehog

Release with confidence.

BSD-3-Clause>=1.0 && <1.1

@hackage/hashable

A class for types that can be converted to a hash value

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

@hackage/algebraic-graphs

A library for algebraic graph construction and transformation

MIT>=0.5 && <0.7