Bold-faced **package-name
**s denote standard libraries bundled with ghc-9.4.5
.
This license report was auto-generated by the tool
cabal-plan
.
To re-generate this file, within Haskell AtCoder language environment, execute:
cd /judge/submission
sudo apt-get install -y zlib1g-dev
source ~/.ghcup/env
cabal v2-install cabal-plan --flag="+license-report"
LANG=C.UTF-8 cabal-plan license-report main > license-report.md
In this machine-generated license report, the following package's license are
missing, because they are deeply embedded within GHC and did not make their way to
Hackage, Haskell's universal package repository, where
cabal-plan
looks for license information. Instead, here I inform you with some license matters
regarding that package:
ghc-boot-th
: For license, see: https://gitlab.haskell.org/ghc/ghc/-/blob/ghc-9.4.4-release/libraries/ghc-boot-th/LICENSE (BSD-3-Clause). This package lives within the GHC's git repository and is bundled with GHC. Since this package cannot be separately reinstalled, GHC development team did not need to upload this to Hackage. However I have no idea about the real reason why they did not want to upload it.
No package has been added to this list. The following package has been removed from the list:
system-cxx-std-lib
: No copyright-protected content. This is a placeholder for the system's C++ standard library provided by GHC itself. This package has no code within it and it is not even an actual package; the real code that ensures connection to C++ library is hidden within GHC. As such, the package itself has no copyright-protected content. You don't need to consult any license for this package specifically; you just have to go to see the license of GHC.
In Freeze 3, text-2.0.2
was separately installed for dependency reason,
but in this Freeze 4, the version of text-2.0.2
bundled with GHC-9.4.5
is used.
The bundled installation does not explicitly report the dependency on system-cxx-std-lib
to cabal-plan,
so the system-cxx-std-lib
package is gone from the list.
Besides, since more packages from the GHC bundle are utilized as dependencies and the versions of some packages are upgraded, this file is not exactly the same as the previous license report (https://gist.github.com/gksato/0993d739f2ac6e81100f41815a27a978#file-2-license-report-md). However, the license of each package is the same as before; you can compare the two versions with
$ curl https://gist.githubusercontent.com/gksato/0993d739f2ac6e81100f41815a27a978/raw/7dd07251bde7ada7c42dd470ef7a98a444ee8a94/2-license-report.md > old-license-report.md
$ curl https://gist.githubusercontent.com/gksato/67ce95de203c1799841a99777758e2f5/raw/2-license-report.md > new-license-report.md
$ sed -e 's/\*//g' old-license-report.md | grep -e '^| `' | sort > old-license-report-sorted.md
$ sed -e 's/\*//g' new-license-report.md | grep -e '^| `' | sort > new-license-report-sorted.md
$ diff old-license-report-sorted.md new-license-report-sorted.md
Name | Version | SPDX License Id | Description | Also depended upon by |
---|---|---|---|---|
Cabal |
3.10.1.0 |
BSD-3-Clause |
A framework for packaging Haskell software | |
Cabal-syntax |
3.10.1.0 |
BSD-3-Clause |
A library for working with .cabal files | Cabal |
QuickCheck |
2.14.3 |
BSD-3-Clause |
Automatic testing of Haskell programs | storable-record |
adjunctions |
4.4.2 |
BSD-3-Clause |
Adjunctions and representable functors | kan-extensions |
array |
0.5.4.0 |
BSD-3-Clause |
Mutable and immutable arrays | Cabal , Cabal-syntax , adjunctions , attoparsec , binary , charset , containers , deepseq , fgl , indexed-traversable , integer-logarithms , invariant , kan-extensions , lens , parallel , reducers , regex-base , regex-tdfa , stm , text , trifecta |
attoparsec |
0.14.4 |
BSD-3-Clause |
Fast combinator parsing for bytestrings and text | parsers |
base |
4.17.1.0 |
BSD-3-Clause |
Basic libraries | (core library) |
bifunctors |
5.6.1 |
BSD-3-Clause |
Bifunctors | invariant , lens , profunctors , semigroupoids |
binary |
0.8.9.1 |
BSD-3-Clause |
Binary serialisation for Haskell values using lazy ByteStrings | Cabal-syntax , parsers , scientific , strict , text , these |
bitvec |
1.1.4.0 |
BSD-3-Clause |
Space-efficient bit vectors | vector-algorithms |
bytestring |
0.11.4.0 |
BSD-3-Clause |
Fast, compact, strict and lazy byte strings with a list interface | Cabal , Cabal-syntax , attoparsec , binary , bitvec , blaze-builder , blaze-html , blaze-markup , case-insensitive , charset , foldl , hashable , lens , massiv , megaparsec , mono-traversable , parsec , random , reducers , regex-base , regex-tdfa , scientific , strict , text , trifecta , unix , utf8-string , vector-algorithms |
comonad |
5.0.8 |
BSD-3-Clause |
Comonads | adjunctions , bifunctors , foldl , free , invariant , kan-extensions , lens , profunctors , semigroupoids , trifecta |
containers |
0.6.7 |
BSD-3-Clause |
Assorted concrete container types | Cabal , Cabal-syntax , QuickCheck , adjunctions , attoparsec , bifunctors , binary , charset , comonad , fgl , foldable1-classes-compat , foldl , free , hashable , indexed-traversable , invariant , kan-extensions , lens , linear-base , linear-generics , megaparsec , mono-traversable , mutable-containers , parallel , parsers , reducers , regex-base , regex-tdfa , scientific , semialign , semigroupoids , th-abstraction , trifecta |
contravariant |
1.5.5 |
BSD-3-Clause |
Contravariant functors | adjunctions , foldl , invariant , kan-extensions , lens , profunctors , semigroupoids |
deepseq |
1.4.8.0 |
BSD-3-Clause |
Deep evaluation of data structures | Cabal , Cabal-syntax , QuickCheck , attoparsec , bitvec , blaze-builder , bytestring , case-insensitive , containers , fgl , hashable , massiv , math-functions , megaparsec , parallel , pretty , primitive , process , psqueues , pvar , random , safe-exceptions , scheduler , scientific , splitmix , strict , tagged , text , these , time , trifecta , unboxing-vector , unordered-containers , vector |
directory |
1.3.7.1 |
BSD-3-Clause |
Platform-agnostic library for filesystem operations | Cabal , Cabal-syntax , extra , process |
distributive |
0.6.2.1 |
BSD-3-Clause |
Distributive functors -- Dual to Traversable | adjunctions , comonad , free , kan-extensions , lens , profunctors , semigroupoids |
exceptions |
0.10.7 |
BSD-3-Clause |
Extensible optionally-pure exceptions | free , lens , massiv , safe-exceptions , scheduler |
extra |
1.7.13 |
BSD-3-Clause |
Extra functions I use. | |
fgl |
5.8.1.1 |
BSD-3-Clause |
Martin Erwig's Functional Graph Library | |
filepath |
1.4.2.2 |
BSD-3-Clause |
Library for manipulating FilePaths in a cross platform way. | Cabal , Cabal-syntax , directory , extra , hashable , lens , process |
free |
5.2 |
BSD-3-Clause |
Monads for free | adjunctions , kan-extensions , lens |
ghc-bignum |
1.3 |
BSD-3-Clause |
GHC BigNum library | base , bitvec , hashable , integer-gmp , integer-logarithms |
ghc-boot-th |
9.4.5 |
MISSING | MISSING | template-haskell |
ghc-prim |
0.9.0 |
BSD-3-Clause |
GHC primitives | (core library) |
hashable |
1.4.2.0 |
BSD-3-Clause |
A class for types that can be converted to a hash value | case-insensitive , foldl , lens , linear-base , mono-traversable , psqueues , reducers , scientific , semialign , semigroupoids , strict , these , trifecta , unordered-containers |
heaps |
0.4 |
BSD-3-Clause |
Asymptotically optimal Brodal/Okasaki heaps. | |
indexed-traversable |
0.1.2.1 |
BSD-2-Clause |
FunctorWithIndex, FoldableWithIndex, TraversableWithIndex | comonad , free , indexed-traversable-instances , lens , semialign , trifecta |
indexed-traversable-instances |
0.1.1.2 |
BSD-2-Clause |
More instances of FunctorWithIndex, FoldableWithIndex, TraversableWithIndex | lens , semialign |
integer-gmp |
1.1 |
BSD-3-Clause |
Integer library based on GMP | (core library) |
integer-logarithms |
1.0.3.1 |
MIT |
Integer logarithms. | scientific |
kan-extensions |
5.2.5 |
BSD-3-Clause |
Kan extensions, Kan lifts, the Yoneda lemma, and (co)density (co)monads | lens |
lens |
5.2.2 |
BSD-2-Clause |
Lenses, Folds and Traversals | strict-lens , these-lens , trifecta |
linear-base |
0.3.1 |
MIT |
Standard library for linear types. | |
list-t |
1.0.5.6 |
MIT |
ListT done right | |
massiv |
1.0.4.0 |
BSD-3-Clause |
Massiv (Массив) is an Array Library. | |
megaparsec |
9.4.1 |
BSD-2-Clause |
Monadic parser combinators | |
mono-traversable |
1.0.15.3 |
MIT |
Type classes for mapping, folding, and traversing monomorphic containers | mutable-containers , unboxing-vector |
mtl |
2.3.1 |
BSD-3-Clause |
Monad classes for transformers, using functional dependencies | Cabal , Cabal-syntax , adjunctions , exceptions , free , kan-extensions , lens , list-t , logict , megaparsec , mmorph , parsec , parsers , random , regex-tdfa , trifecta |
mutable-containers |
0.3.4.1 |
MIT |
Abstactions and concrete implementations of mutable containers | |
mwc-random |
0.15.0.2 |
BSD-3-Clause |
Fast, high quality pseudo random number generation | |
parallel |
3.2.2.0 |
BSD-3-Clause |
Parallel programming library | lens |
parsec |
3.1.16.1 |
BSD-2-Clause |
Monadic parser combinators | Cabal , Cabal-syntax , parsers , regex-tdfa |
parser-combinators |
1.3.0 |
BSD-3-Clause |
Lightweight package providing commonly useful parser combinators | megaparsec |
pretty |
1.1.3.6 |
BSD-3-Clause |
Pretty-printing library | Cabal , Cabal-syntax , template-haskell |
primitive |
0.8.0.0 |
BSD-3-Clause |
Primitive memory-related operations | atomic-primops , bitvec , foldl , linear-base , massiv , math-functions , mutable-containers , mwc-random , pvar , scheduler , scientific , tf-random , unboxing-vector , vector , vector-algorithms |
process |
1.6.17.0 |
BSD-3-Clause |
Process libraries | Cabal , extra |
profunctors |
5.6.2 |
BSD-3-Clause |
Profunctors | adjunctions , foldl , free , invariant , kan-extensions , lens , trifecta |
psqueues |
0.2.7.3 |
BSD-3-Clause |
Pure priority search queues | |
random |
1.2.1.1 |
BSD-3-Clause |
Pseudo-random number generation | QuickCheck , foldl , massiv , mwc-random , tf-random |
reflection |
2.1.7 |
BSD-3-Clause |
Reifies arbitrary terms into types that can be reflected back into terms | lens |
regex-tdfa |
1.3.2.1 |
BSD-3-Clause |
Pure Haskell Tagged DFA Backend for "Text.Regex" (regex-base) | |
safe-exceptions |
0.1.7.3 |
MIT |
Safe, consistent, and easy exception handling | |
scientific |
0.3.7.0 |
BSD-3-Clause |
Numbers represented using scientific notation | attoparsec , megaparsec , parsers |
semialign |
1.3 |
BSD-3-Clause |
Align and Zip type-classes from the common Semialign ancestor. | |
semigroupoids |
6.0.0.1 |
BSD-2-Clause |
Semigroupoids: Category sans id | adjunctions , foldl , free , kan-extensions , lens , reducers , semialign |
split |
0.2.3.5 |
BSD-3-Clause |
Combinator library for splitting lists. | mono-traversable |
stm |
2.5.1.0 |
BSD-3-Clause |
Software Transactional Memory | StateVar , exceptions , invariant , monad-control , transformers-base |
strict |
0.5 |
BSD-3-Clause |
Strict data types and String IO. | lens , strict-lens |
strict-lens |
0.4.0.3 |
BSD-3-Clause |
Lenses for types in strict package | |
tagged |
0.8.7 |
BSD-3-Clause |
Haskell 98 phantom types to avoid unsafely passing dummy arguments | adjunctions , assoc , bifunctors , comonad , distributive , foldable1-classes-compat , indexed-traversable-instances , invariant , kan-extensions , lens , profunctors , semialign , semigroupoids |
template-haskell |
2.19.0.0 |
BSD-3-Clause |
Support library for Template Haskell | OneTuple , QuickCheck , bifunctors , bytestring , containers , exceptions , free , invariant , lens , linear-generics , primitive , reflection , scientific , semigroupoids , tagged , text , th-abstraction , unordered-containers , vector-th-unbox |
text |
2.0.2 |
BSD-2-Clause |
An efficient packed Unicode text type. | Cabal , Cabal-syntax , attoparsec , blaze-builder , blaze-html , blaze-markup , case-insensitive , foldl , hashable , lens , linear-base , megaparsec , mono-traversable , parsec , parsers , prettyprinter , prettyprinter-ansi-terminal , reducers , regex-base , regex-tdfa , scientific , strict |
tf-random |
0.5 |
BSD-3-Clause |
High-quality splittable pseudorandom number generator | |
these |
1.2 |
BSD-3-Clause |
An either-or-both data type. | lens , semialign , strict , these-lens |
these-lens |
1.0.1.3 |
BSD-3-Clause |
Lenses for These | |
time |
1.12.2 |
BSD-2-Clause |
A time library | Cabal , Cabal-syntax , directory , extra , mwc-random , tf-random , unix |
transformers |
0.6.1.0 |
BSD-3-Clause |
Concrete functor and monad transformers | Cabal , Cabal-syntax , QuickCheck , StateVar , adjunctions , attoparsec , bifunctors , comonad , contravariant , distributive , exceptions , fgl , foldable1-classes-compat , foldl , free , indexed-traversable , invariant , kan-extensions , lens , linear-base , list-t , logict , megaparsec , mmorph , monad-control , mono-traversable , mtl , parsers , primitive , profunctors , reducers , safe-exceptions , semialign , semigroupoids , storable-record , strict , tagged , transformers-base , transformers-compat , trifecta , unliftio-core |
trifecta |
2.1.2 |
BSD-3-Clause |
A modern parser combinator library with convenient diagnostics | |
unboxing-vector |
0.2.0.0 |
BSD-3-Clause |
A newtype-friendly variant of unboxed vectors | |
unix |
2.7.3 |
BSD-3-Clause |
POSIX functionality | Cabal , Cabal-syntax , directory , extra , process |
unordered-containers |
0.2.19.1 |
BSD-3-Clause |
Efficient hashing-based container types | charset , foldl , indexed-traversable-instances , invariant , lens , mono-traversable , parsers , reducers , semialign , semigroupoids , trifecta |
utility-ht |
0.0.17 |
BSD-3-Clause |
Various small helper functions for Lists, Maybes, Tuples, Functions | storable-record , storable-tuple |
vector |
0.13.0.0 |
BSD-3-Clause |
Efficient Arrays | bitvec , foldl , indexed-traversable-instances , lens , linear-base , massiv , math-functions , mono-traversable , mutable-containers , mwc-random , semialign , unboxing-vector , vector-algorithms , vector-th-unbox |
vector-algorithms |
0.9.0.1 |
BSD-3-Clause |
Efficient algorithms for vector arrays | mono-traversable |
vector-stream |
0.1.0.0 |
BSD-3-Clause |
Efficient Streams | massiv , vector |
vector-th-unbox |
0.2.2 |
BSD-3-Clause |
Deriver for Data.Vector.Unboxed using Template Haskell | |
xhtml |
3000.2.2.1 |
BSD-3-Clause |
An XHTML combinator library |
Name | Version | SPDX License Id | Description | Depended upon by |
---|---|---|---|---|
OneTuple |
0.4.1.1 |
BSD-3-Clause |
Singleton Tuple | indexed-traversable-instances |
StateVar |
1.2.2 |
BSD-3-Clause |
State variables | contravariant , invariant |
ansi-terminal |
1.0 |
BSD-3-Clause |
Simple ANSI terminal support | prettyprinter-ansi-terminal , trifecta |
ansi-terminal-types |
0.11.5 |
BSD-3-Clause |
Types and functions used to represent SGR aspects | ansi-terminal |
assoc |
1.1 |
BSD-3-Clause |
swap and assoc: Symmetric and Semigroupy Bifunctors | bifunctors , lens , strict , these |
atomic-primops |
0.8.4 |
BSD-3-Clause |
A safe approach to CAS and other atomic ops in Haskell. | scheduler |
attoparsec |
0.14.4 |
BSD-3-Clause |
Fast combinator parsing for bytestrings and text | attoparsec |
base-orphans |
0.9.0 |
MIT |
Backwards-compatible orphan instances for base | distributive , lens , parsers , profunctors , semigroupoids , storable-tuple , transformers-base |
blaze-builder |
0.4.2.2 |
BSD-3-Clause |
Efficient buffered output. | blaze-html , blaze-markup , trifecta |
blaze-html |
0.9.1.2 |
BSD-3-Clause |
A blazingly fast HTML combinator library for Haskell | trifecta |
blaze-markup |
0.8.2.8 |
BSD-3-Clause |
A blazingly fast markup combinator library for Haskell | blaze-html , trifecta |
call-stack |
0.4.0 |
MIT |
Use GHC call-stacks in a backward compatible way | lens |
case-insensitive |
1.2.1.0 |
BSD-3-Clause |
Case insensitive string comparison | megaparsec |
charset |
0.3.9 |
BSD-3-Clause |
Fast unicode character sets based on complemented PATRICIA tries | parsers , trifecta |
clock |
0.8.3 |
BSD-3-Clause |
High-resolution clock functions: monotonic, realtime, cputime. | extra |
colour |
2.3.6 |
MIT |
A model for human colour/color perception | ansi-terminal , ansi-terminal-types |
data-default-class |
0.1.2.0 |
BSD-3-Clause |
A class for types with a default value | math-functions |
fingertree |
0.1.5.0 |
BSD-3-Clause |
Generic finger-tree structure, with example instances | reducers , trifecta |
foldable1-classes-compat |
0.1 |
BSD-3-Clause |
Compatibility package for the Foldable1 and Bifoldable1 type classes | bifunctors , semigroupoids , these |
foldl |
1.4.14 |
BSD-3-Clause |
Composable, streaming, and efficient left folds | list-t |
invariant |
0.6.1 |
BSD-2-Clause |
Haskell98 invariant functors | kan-extensions |
linear-generics |
0.2.2 |
BSD-3-Clause |
Generic programming library for generalised deriving. | linear-base |
logict |
0.8.1.0 |
BSD-3-Clause |
A backtracking logic-programming monad. | list-t |
math-functions |
0.3.4.2 |
BSD-2-Clause |
Collection of tools for numeric computations | mwc-random |
mmorph |
1.2.0 |
BSD-3-Clause |
Monad morphisms | list-t |
monad-control |
1.0.3.1 |
BSD-3-Clause |
Lift control operations, like exception catching, through monad transformers | list-t |
parsers |
0.12.11 |
BSD-3-Clause |
Parsing combinators | trifecta |
prettyprinter |
1.7.1 |
BSD-2-Clause |
A modern, easy to use, well-documented, extensible pretty-printer. | prettyprinter-ansi-terminal , trifecta |
prettyprinter-ansi-terminal |
1.1.3 |
BSD-2-Clause |
ANSI terminal backend for the »prettyprinter« package. | trifecta |
pvar |
1.0.0.0 |
BSD-3-Clause |
Mutable variable with primitive values | scheduler |
reducers |
3.12.4 |
BSD-3-Clause |
Semigroups, specialized containers and a general map/reduce framework | trifecta |
regex-base |
0.94.0.2 |
BSD-3-Clause |
Common "Text.Regex.*" API for Regex matching | regex-tdfa |
scheduler |
2.0.0.1 |
BSD-3-Clause |
Work stealing scheduler. | massiv |
semigroups |
0.20 |
BSD-3-Clause |
Anything that associates | adjunctions , storable-record |
splitmix |
0.1.0.4 |
BSD-3-Clause |
Fast Splittable PRNG | QuickCheck , random |
storable-record |
0.0.7 |
BSD-3-Clause |
Elegant definition of Storable instances for records | storable-tuple |
storable-tuple |
0.1 |
BSD-3-Clause |
Storable instance for pairs and triples | linear-base |
th-abstraction |
0.5.0.0 |
ISC |
Nicer interface for reified information about data types | bifunctors , free , invariant , lens , linear-generics |
transformers-base |
0.4.6 |
BSD-3-Clause |
Lift computations from the bottom of a transformer stack | free , list-t , monad-control |
transformers-compat |
0.7.2 |
BSD-3-Clause |
A small compatibility shim for the transformers library | adjunctions , comonad , invariant , kan-extensions , lens , mmorph , monad-control , semigroupoids , transformers-base |
unliftio-core |
0.2.1.0 |
MIT |
The MonadUnliftIO typeclass for unlifting monads to IO | massiv , scheduler |
utf8-string |
1.0.2 |
BSD-3-Clause |
Support for reading and writing UTF8 Strings | trifecta |
void |
0.7.3 |
BSD-3-Clause |
A Haskell 98 logically uninhabited data type | adjunctions |