@hackage lapack dependencies

43 results

library:lapack (22 dependencies)

@haskell/transformers

Concrete functor and monad transformers

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

@haskell/text

An efficient packed Unicode text type.

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

@haskell/deepseq

Deep evaluation of data structures

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

@haskell/containers

Assorted concrete container types

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

@haskell/base

Core data structures and operations

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

@hackage/utility-ht

Various small helper functions for Lists, Maybes, Tuples, Functions

BSD-3-Clause>=0.0.13 && <0.1

@hackage/tfp

Type-level integers, booleans, lists using type families

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

@hackage/tagged

Haskell 98 phantom types to avoid unsafely passing dummy arguments

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

@hackage/semigroups

Anything that associates

BSD-3-Clause>=0.18.3 && <1.0

@hackage/non-empty

List-like structures with static restrictions on the number of elements

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

@hackage/netlib-ffi

Helper modules for FFI to BLAS and LAPACK

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

@hackage/lazyio

Run IO actions lazily while respecting their order

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

@hackage/lapack-ffi

Auto-generated interface to Fortran LAPACK

BSD-3-Clause>=0.0.3 && <0.1

@hackage/hyper

Display class for the HyperHaskell graphical Haskell interpreter

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

@hackage/guarded-allocation

Memory allocation with added stress tests and integrity checks

BSD-3-Clause>=0.0 && <0.1

@hackage/comfort-blas

Numerical Basic Linear Algebra using BLAS

BSD-3-Clause>=0.0.3 && <0.1

@hackage/comfort-array-shape

Additional shape types for the comfort-array package

BSD-3-Clause>=0.0 && <0.1

@hackage/comfort-array

Arrays where the index type is a function of the shape type

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

@hackage/boxes

2D text pretty-printing library

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

@hackage/blaze-html

A blazingly fast HTML combinator library for Haskell

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

@hackage/blas-ffi

Auto-generated interface to Fortran BLAS

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

@hackage/Stream

A library for manipulating infinite lists.

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

executable:lapack-debug (3 dependencies)

@haskell/base

Core data structures and operations

BSD-3-Clause

@hackage/lapack

Numerical Linear Algebra using LAPACK

BSD-3-Clause

@hackage/comfort-array

Arrays where the index type is a function of the shape type

BSD-3-Clause

test:lapack-test (18 dependencies)

@haskell/transformers

Concrete functor and monad transformers

BSD-3-Clause

@haskell/random

Pseudo-random number generation

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

@haskell/base

Core data structures and operations

BSD-3-Clause

@hackage/utility-ht

Various small helper functions for Lists, Maybes, Tuples, Functions

BSD-3-Clause>=0.0.17

@hackage/unique-logic-tf

Solve simple simultaneous equations

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

@hackage/tfp

Type-level integers, booleans, lists using type families

BSD-3-Clause

@hackage/semigroups

Anything that associates

BSD-3-Clause

@hackage/quickcheck-transformer

A GenT monad transformer for QuickCheck library.

MIT>=0.3 && <0.4

@hackage/non-empty

List-like structures with static restrictions on the number of elements

BSD-3-Clause>=0.3.1

@hackage/netlib-ffi

Helper modules for FFI to BLAS and LAPACK

BSD-3-Clause

@hackage/monoid-transformer

Monoid counterparts to some ubiquitous monad transformers

BSD-3-Clause>=0.0.4 && <0.1

@hackage/lapack

Numerical Linear Algebra using LAPACK

BSD-3-Clause

@hackage/doctest-exitcode-stdio

Run doctest's in a Cabal.Test.exitcode-stdio environment

BSD-3-Clause>=0.0 && <0.1

@hackage/data-ref

Unify STRef and IORef in plain Haskell 98

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

@hackage/comfort-array-shape

Additional shape types for the comfort-array package

BSD-3-Clause

@hackage/comfort-array

Arrays where the index type is a function of the shape type

BSD-3-Clause

@hackage/QuickCheck

Automatic testing of Haskell programs

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

@hackage/ChasingBottoms

For testing partial and infinite values.

MIT>=1.2.2 && <1.4