It is really counterintuitive! I will study carefully your library and the
Implicit Configurations paper. Using static dimension checking we can write
very solid code for matrix computations...
However, I don't know how to write some definitions. For instance, this is ok:
m = $(dAM [[1,2,3]])
Hi Alberto,
Those are good questions, I've added some examples which hopefully
clarify the situation. Input and output of vectors is not a strong
point of the library, but I don't think there is a good alternative to
the way I do it.
http://ofb.net/~frederik/futility/src/Vector/read-example.hs
On Friday 14 April 2006 17:02, Frederik Eaton wrote:
An index-aware linear algebra library in Haskell
Excellent work!
Is it possible to create a vector or matrix whose size is not known at compile
time?
- Due to the need to specify index types at some point, input of
vectors is difficult.
Yes, certainly... Otherwise the library would not be much use! If it
seems counterintuitive, as it did to me at first, you should check out
the Implicit Configurations paper, which uses modular arithmetic as
an example. My version of their code is in
