| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
NumHask.Prelude
Description
A prelude for NumHask
- module Protolude
- module NumHask.Algebra.Additive
- module NumHask.Algebra.Basis
- module NumHask.Algebra.Distribution
- module NumHask.Algebra.Field
- module NumHask.Algebra.Integral
- module NumHask.Algebra.Magma
- module NumHask.Algebra.Metric
- module NumHask.Algebra.Module
- module NumHask.Algebra.Multiplicative
- module NumHask.Algebra.Ring
- module Data.Functor.Rep
- module NumHask.Shape
- module NumHask.Vector
- module NumHask.Matrix
Backend
NumHask imports Protolude as the prelude and replaces much of the Num heirarchy in base.
Usage of Semigroup and Monoid has been avoided to retain basic compatability.
module Protolude
Algebraic Heirarchy
Re-defines the numeric tower.
Instances for Int, Integer, Float, Double, Bool and Complex are supplied.
module NumHask.Algebra.Additive
module NumHask.Algebra.Basis
module NumHask.Algebra.Distribution
module NumHask.Algebra.Field
module NumHask.Algebra.Integral
module NumHask.Algebra.Magma
module NumHask.Algebra.Metric
module NumHask.Algebra.Module
module NumHask.Algebra.Ring
Representable Functors over numbers
NumHask uses Representable functors over number classes to supply useful vectors and matrices that are themselves numbers (ie satisfy the class laws).
Vector and Matrix instances are supplied with shape held at the type-level.
module Data.Functor.Rep
module NumHask.Shape
module NumHask.Vector
module NumHask.Matrix