NB: This captures the licenses associated with a particular set of dependency versions. If your own build solves differently, it’s possible that the licenses may have changed, or even that the set of dependencies itself is different. Please make sure you run cabal-plan license-report on your own components rather than assuming this is authoritative.
Bold-faced **package-name**s denote standard libraries bundled with ghc-9.10.1.
| Name | Version | SPDX License Id | Description | Also depended upon by |
|---|---|---|---|---|
QuickCheck |
2.14.3 |
BSD-3-Clause |
Automatic testing of Haskell programs | |
base |
4.20.0.0 |
BSD-3-Clause |
Core data structures and operations | (core library) |
yaya |
0.6.2.2 |
MISSING | MISSING |
| Name | Version | SPDX License Id | Description | Depended upon by |
|---|---|---|---|---|
OneTuple |
0.4.2 |
BSD-3-Clause |
Singleton Tuple | indexed-traversable-instances |
StateVar |
1.2.2 |
BSD-3-Clause |
State variables | contravariant, invariant |
adjunctions |
4.4.2 |
BSD-3-Clause |
Adjunctions and representable functors | kan-extensions |
array |
0.5.7.0 |
BSD-3-Clause |
Mutable and immutable arrays | adjunctions, binary, containers, deepseq, indexed-traversable, invariant, kan-extensions, lens, parallel, stm, text |
assoc |
1.1.1 |
BSD-3-Clause |
swap and assoc: Symmetric and Semigroupy Bifunctors | bifunctors, lens, strict, these |
base-orphans |
0.9.2 |
MIT |
Backwards-compatible orphan instances for base | distributive, lens, profunctors, semigroupoids, transformers-base |
bifunctors |
5.6.2 |
BSD-3-Clause |
Bifunctors | either, invariant, lens, profunctors, semigroupoids |
binary |
0.8.9.2 |
BSD-3-Clause |
Binary serialisation for Haskell values using lazy ByteStrings | strict, text, these |
bytestring |
0.12.1.0 |
BSD-3-Clause |
Fast, compact, strict and lazy byte strings with a list interface | binary, filepath, hashable, lens, os-string, random, strict, text |
call-stack |
0.4.0 |
MIT |
Use GHC call-stacks in a backward compatible way | lens |
comonad |
5.0.8 |
BSD-3-Clause |
Comonads | adjunctions, bifunctors, free, invariant, kan-extensions, lens, profunctors, semigroupoids, yaya |
containers |
0.7 |
BSD-3-Clause |
Assorted concrete container types | QuickCheck, adjunctions, bifunctors, binary, comonad, free, hashable, indexed-traversable, invariant, kan-extensions, lens, parallel, semigroupoids, th-abstraction |
contravariant |
1.5.5 |
BSD-3-Clause |
Contravariant functors | adjunctions, invariant, kan-extensions, lens, profunctors, semigroupoids |
deepseq |
1.5.0.0 |
BSD-3-Clause |
Deep evaluation of data structures | QuickCheck, bytestring, containers, filepath, hashable, os-string, parallel, pretty, primitive, random, splitmix, strict, tagged, text, these, unordered-containers, vector |
distributive |
0.6.2.1 |
BSD-3-Clause |
Distributive functors -- Dual to Traversable | adjunctions, comonad, free, kan-extensions, lens, profunctors, semigroupoids |
either |
5.0.2 |
BSD-3-Clause |
Combinators for working with sums | yaya |
exceptions |
0.10.7 |
BSD-3-Clause |
Extensible optionally-pure exceptions | filepath, free, lens, os-string |
filepath |
1.5.2.0 |
BSD-3-Clause |
Library for manipulating FilePaths in a cross platform way. | hashable, lens |
free |
5.2 |
BSD-3-Clause |
Monads for free | adjunctions, kan-extensions, lens, yaya |
ghc-bignum |
1.3 |
BSD-3-Clause |
GHC BigNum library | ghc-internal, hashable |
ghc-boot-th |
9.10.1 |
BSD-3-Clause |
Shared functionality between GHC and the @template-haskell@ library | template-haskell |
ghc-internal |
9.1001.0 |
BSD-3-Clause |
Basic libraries | base |
ghc-prim |
0.11.0 |
BSD-3-Clause |
GHC primitives | (core library) |
hashable |
1.5.0.0 |
BSD-3-Clause |
A class for types that can be converted to a hash value | lens, semigroupoids, strict, these, unordered-containers |
indexed-traversable |
0.1.4 |
BSD-2-Clause |
FunctorWithIndex, FoldableWithIndex, TraversableWithIndex | comonad, free, indexed-traversable-instances, lens |
indexed-traversable-instances |
0.1.2 |
BSD-2-Clause |
More instances of FunctorWithIndex, FoldableWithIndex, TraversableWithIndex | lens |
invariant |
0.6.3 |
BSD-2-Clause |
Haskell98 invariant functors | kan-extensions |
kan-extensions |
5.2.6 |
BSD-3-Clause |
Kan extensions, Kan lifts, the Yoneda lemma, and (co)density (co)monads | lens, yaya |
lens |
5.3.2 |
BSD-2-Clause |
Lenses, Folds and Traversals | yaya |
mtl |
2.3.1 |
BSD-3-Clause |
Monad classes for transformers, using functional dependencies | adjunctions, either, exceptions, free, kan-extensions, lens, random |
os-string |
2.0.2 |
BSD-3-Clause |
Library for manipulating Operating system strings. | filepath, hashable |
parallel |
3.2.2.0 |
BSD-3-Clause |
Parallel programming library | lens |
pretty |
1.1.3.6 |
BSD-3-Clause |
Pretty-printing library | template-haskell |
primitive |
0.9.0.0 |
BSD-3-Clause |
Primitive memory-related operations | vector |
profunctors |
5.6.2 |
BSD-3-Clause |
Profunctors | adjunctions, either, free, invariant, kan-extensions, lens, yaya |
random |
1.2.1.2 |
BSD-3-Clause |
Pseudo-random number generation | QuickCheck |
reflection |
2.1.8 |
BSD-3-Clause |
Reifies arbitrary terms into types that can be reflected back into terms | lens |
semigroupoids |
6.0.1 |
BSD-2-Clause |
Semigroupoids: Category sans id | adjunctions, either, free, kan-extensions, lens |
semigroups |
0.20 |
BSD-3-Clause |
Anything that associates | adjunctions |
splitmix |
0.1.0.5 |
BSD-3-Clause |
Fast Splittable PRNG | QuickCheck, random |
stm |
2.5.3.1 |
BSD-3-Clause |
Software Transactional Memory | StateVar, exceptions, invariant, transformers-base |
strict |
0.5.1 |
BSD-3-Clause |
Strict data types and String IO. | lens, yaya |
tagged |
0.8.8 |
BSD-3-Clause |
Haskell 98 phantom types to avoid unsafely passing dummy arguments | adjunctions, bifunctors, comonad, distributive, indexed-traversable-instances, invariant, kan-extensions, lens, profunctors, semigroupoids |
template-haskell |
2.22.0.0 |
BSD-3-Clause |
Support library for Template Haskell | OneTuple, QuickCheck, bifunctors, bytestring, containers, exceptions, filepath, free, invariant, lens, os-string, primitive, reflection, semigroupoids, tagged, text, th-abstraction, unordered-containers, yaya |
text |
2.1.1 |
BSD-2-Clause |
An efficient packed Unicode text type. | hashable, lens, strict |
th-abstraction |
0.7.0.0 |
ISC |
Nicer interface for reified information about data types | bifunctors, free, invariant, lens, yaya |
these |
1.2.1 |
BSD-3-Clause |
An either-or-both data type. | lens, strict |
transformers |
0.6.1.1 |
BSD-3-Clause |
Concrete functor and monad transformers | QuickCheck, StateVar, adjunctions, bifunctors, comonad, contravariant, distributive, exceptions, free, indexed-traversable, invariant, kan-extensions, lens, mtl, primitive, profunctors, semigroupoids, strict, tagged, transformers-base, transformers-compat, yaya |
transformers-base |
0.4.6 |
BSD-3-Clause |
Lift computations from the bottom of a transformer stack | free |
transformers-compat |
0.7.2 |
BSD-3-Clause |
A small compatibility shim for the transformers library | adjunctions, comonad, invariant, lens, semigroupoids, transformers-base |
unordered-containers |
0.2.20 |
BSD-3-Clause |
Efficient hashing-based container types | indexed-traversable-instances, invariant, lens, semigroupoids |
vector |
0.13.1.0 |
BSD-3-Clause |
Efficient Arrays | indexed-traversable-instances, lens |
vector-stream |
0.1.0.1 |
BSD-3-Clause |
Efficient Streams | vector |
void |
0.7.3 |
BSD-3-Clause |
A Haskell 98 logically uninhabited data type | adjunctions |