@hackage inf-backprop dependencies

53 results

library:inf-backprop (26 dependencies)

@hackage/lens

Lenses, Folds and Traversals

BSD-2-Clause<5.4

@hackage/extra

Extra functions I use.

BSD-3-Clause<1.9

@hackage/vector-sized

Size tagged vectors

BSD-3-Clause<1.7

@hackage/deepseq

Deep evaluation of data structures

BSD-3-Clause<1.6

@hackage/comonad

Comonads

BSD-3-Clause<5.1

@hackage/base

Core data structures and operations

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

@hackage/primitive

Primitive memory-related operations

BSD-3-Clause<0.10

@hackage/ghc-prim

GHC primitives

BSD-3-Clause<0.14

@hackage/optics

Optics as an abstract interface

BSD-3-Clause<0.5

@hackage/hashable

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

BSD-3-Clause<1.6

@hackage/indexed-list-literals

Type safe indexed list literals

BSD-3-Clause<0.3

@hackage/Stream

A library for manipulating infinite lists.

BSD-3-Clause<0.5

@hackage/profunctors

Profunctors

BSD-3-Clause<5.7

@hackage/simple-expr

Minimalistic toolkit for simple mathematical expression.

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

@hackage/text

An efficient packed Unicode text type.

BSD-2-Clause<2.2

@hackage/numhask

A numeric class hierarchy.

BSD-3-Clause<0.14

@hackage/transformers

Concrete functor and monad transformers

BSD-3-Clause<0.7

@hackage/vector

Efficient Arrays

BSD-3-Clause<0.14

@hackage/unordered-containers

Efficient hashing-based container types

BSD-3-Clause<0.3

@hackage/data-fix

Fixpoint data types

BSD-3-Clause<0.4

@hackage/composition

Combinators for unorthodox function composition

BSD-3-Clause<1.1

@hackage/finite-typelits

A type inhabited by finitely many values, indexed by type-level naturals

BSD-3-Clause<0.3

@hackage/safe

Library of safe (exception free) functions

BSD-3-Clause<0.4

@hackage/fixed-vector

Generic vectors with statically known size.

BSD-3-Clause<2.1

@hackage/isomorphism-class

Isomorphism typeclass as a lawful solution to the conversion problem

MIT<0.4

@hackage/combinatorial

Count, enumerate, rank and unrank combinatorial objects

BSD-3-Clause<0.2

test:doctests (27 dependencies)

@hackage/lens

Lenses, Folds and Traversals

BSD-2-Clause

@hackage/extra

Extra functions I use.

BSD-3-Clause

@hackage/vector-sized

Size tagged vectors

BSD-3-Clause

@hackage/deepseq

Deep evaluation of data structures

BSD-3-Clause

@hackage/comonad

Comonads

BSD-3-Clause

@hackage/base

Core data structures and operations

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

@hackage/doctest

Test interactive Haskell examples

MIT

@hackage/primitive

Primitive memory-related operations

BSD-3-Clause

@hackage/ghc-prim

GHC primitives

BSD-3-Clause

@hackage/optics

Optics as an abstract interface

BSD-3-Clause

@hackage/hashable

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

BSD-3-Clause

@hackage/indexed-list-literals

Type safe indexed list literals

BSD-3-Clause

@hackage/Stream

A library for manipulating infinite lists.

BSD-3-Clause

@hackage/profunctors

Profunctors

BSD-3-Clause

@hackage/simple-expr

Minimalistic toolkit for simple mathematical expression.

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

@hackage/text

An efficient packed Unicode text type.

BSD-2-Clause

@hackage/numhask

A numeric class hierarchy.

BSD-3-Clause

@hackage/transformers

Concrete functor and monad transformers

BSD-3-Clause

@hackage/vector

Efficient Arrays

BSD-3-Clause

@hackage/unordered-containers

Efficient hashing-based container types

BSD-3-Clause

@hackage/data-fix

Fixpoint data types

BSD-3-Clause

@hackage/composition

Combinators for unorthodox function composition

BSD-3-Clause

@hackage/finite-typelits

A type inhabited by finitely many values, indexed by type-level naturals

BSD-3-Clause

@hackage/safe

Library of safe (exception free) functions

BSD-3-Clause

@hackage/fixed-vector

Generic vectors with statically known size.

BSD-3-Clause

@hackage/isomorphism-class

Isomorphism typeclass as a lawful solution to the conversion problem

MIT

@hackage/combinatorial

Count, enumerate, rank and unrank combinatorial objects

BSD-3-Clause