@hackage galois-field dependencies

41 results

library:galois-field (12 dependencies)

@haskell/vector

Efficient Arrays

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

@haskell/integer-gmp

Integer library based on GMP

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

@haskell/base

Basic libraries

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

@hackage/wl-pprint-text

A Wadler/Leijen Pretty Printer for Text values

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

@hackage/semirings

two monoids as one, in holy haskimony

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

@hackage/protolude

A small prelude.

MIT>=0.2 && <0.4

@hackage/poly

Polynomials

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

@hackage/mod

Fast type-safe modular arithmetic

MIT>=0.1.0 && <0.2

@hackage/groups

Groups

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

@hackage/bitvec

Space-efficient bit vectors

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

@hackage/QuickCheck

Automatic testing of Haskell programs

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

@hackage/MonadRandom

Random-number generation monad.

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

test:galois-field-tests (15 dependencies)

@haskell/vector

Efficient Arrays

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

@haskell/integer-gmp

Integer library based on GMP

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

@haskell/base

Basic libraries

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

@hackage/wl-pprint-text

A Wadler/Leijen Pretty Printer for Text values

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

@hackage/tasty-quickcheck

QuickCheck support for the Tasty test framework.

MIT>=0.10 && <0.11

@hackage/tasty

Modern and extensible testing framework

MIT>=1.2 && <1.3

@hackage/semirings

two monoids as one, in holy haskimony

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

@hackage/protolude

A small prelude.

MIT>=0.2 && <0.4

@hackage/poly

Polynomials

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

@hackage/mod

Fast type-safe modular arithmetic

MIT>=0.1.0 && <0.2

@hackage/groups

Groups

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

@hackage/galois-field

Galois field library

@hackage/bitvec

Space-efficient bit vectors

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

@hackage/QuickCheck

Automatic testing of Haskell programs

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

@hackage/MonadRandom

Random-number generation monad.

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

benchmark:galois-field-benchmarks (14 dependencies)

@haskell/vector

Efficient Arrays

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

@haskell/integer-gmp

Integer library based on GMP

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

@haskell/base

Basic libraries

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

@hackage/wl-pprint-text

A Wadler/Leijen Pretty Printer for Text values

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

@hackage/semirings

two monoids as one, in holy haskimony

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

@hackage/protolude

A small prelude.

MIT>=0.2 && <0.4

@hackage/poly

Polynomials

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

@hackage/mod

Fast type-safe modular arithmetic

MIT>=0.1.0 && <0.2

@hackage/groups

Groups

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

@hackage/galois-field

Galois field library

@hackage/criterion

Robust, reliable performance measurement and analysis

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

@hackage/bitvec

Space-efficient bit vectors

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

@hackage/QuickCheck

Automatic testing of Haskell programs

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

@hackage/MonadRandom

Random-number generation monad.

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