@hackage rebase dependencies

24 results

library:rebase (24 dependencies)

@haskell/vector

Efficient Arrays

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

@haskell/transformers

Concrete functor and monad transformers

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

@haskell/text

An efficient packed Unicode text type.

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

@haskell/stm

Software Transactional Memory

BSD-3-Clause>=2.5 && <2.6

@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/bytestring

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

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

@haskell/base

Core data structures and operations

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

@hackage/void

A Haskell 98 logically uninhabited data type

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

@hackage/uuid

For creating, comparing, parsing and printing Universally Unique Identifiers

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

@hackage/unordered-containers

Efficient hashing-based container types

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

@hackage/time

A time library

BSD-2-Clause>=1.9 && <1.10

@hackage/semigroupoids

Semigroupoids: Category sans id

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

@hackage/selective

Selective applicative functors

MIT>=0.4 && <0.5

@hackage/scientific

Numbers represented using scientific notation

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

@hackage/profunctors

Profunctors

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

@hackage/hashable

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

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

@hackage/either

Combinators for working with sums

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

@hackage/dlist

Difference lists

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

@hackage/contravariant-extras

Extras for the "contravariant" package

MIT>=0.3 && <0.4

@hackage/contravariant

Contravariant functors

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

@hackage/comonad

Comonads

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

@hackage/bifunctors

Bifunctors

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