Dependently typed tensor algebra
|LTS Haskell 18.28:||0.2.1.1|
|Stackage Nightly 2021-06-14:||0.2.1.1|
|Latest on Hackage:||0.2.1.1|
Module documentation for 0.2.1.1
Dependently typed tensor algebra in Haskell. Useful for applications in field theory, e.g., carrying out calculations for https://doi.org/10.1103/PhysRevD.101.084025
Tensor calculus is reflected in the type system. We regard a tensor as a multilinear map from a product of vector spaces and duals thereof to the common field. The type of each tensor is its generalized rank, describing the vector spaces it acts on and assigning a label to each vector space. There are a few rules for tensor operations:
- Only tensors of the same type may be added. The result is a tensor of this type.
- Tensors may be multiplied if the resulting generalized rank does not contain repeated labels for the same (dual) vector space.
- The contraction of a tensors removes pairs of vector space and dual vector space with the same label from the generalized rank.
It is thus impossible to perform inconsistent tensor operations.
There is also an existentially typed variant of the tensor type useful for runtime computations. These computations take place in the Error monad, throwing errors if operand types are not consistent.
The approach is described in detail in the Hackage documentation.
[0.2.1.1] - 2021-02-27
- version bump of
[0.2.1.0] - 2020-07-20
- removeZeros is optional: Tensor addition and tensor contraction will not remove zero values afterwards in order to improve performance. Zero values have to be removed by explicitly applying removeZeros to a tensor.
- all data types are now instances of NFData
- added functionality to read solution from an rref matrix in a reversed manner
[0.2.0.0] - 2020-07-08
- Minor API adjustments
- major documentation improvements
- backwards compatibility with GHC 8.6.5
[0.1.0.0] - 2020-07-07