Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

30

Voted
HASKELL

2006

ACM

2006

ACM

Many numerical algorithms are speciﬁed in terms of operations on vectors and matrices. Matrix operations can be executed extremely eﬃciently using specialized linear algebra kernels in libraries such as ATLAS or LAPACK. The resulting programs can be orders of magnitude faster than naive implementations in C, and this is one reason why matrix computation interpreters such at Matlab and Octave are popular in scientiﬁc computing. However, the process of expressing an algorithm in terms of matrices can be error-prone. Typical matrix languages are weakly-typed. If we could expose certain properties of operands to a type system, so that their consistency could be statically veriﬁed by a type checker, then we would be able to catch many common errors at compile time. We call this idea “strongly typed linear algebra” and describe a prototype implementation in which dimensions are exposed to the type system, which is based on Alberto Ruiz’s GSLHaskell [Ruiz(2005)] and uses techni...

Added |
13 Jun 2010 |

Updated |
13 Jun 2010 |

Type |
Conference |

Year |
2006 |

Where |
HASKELL |

Authors |
Frederik Eaton |

Comments (0)