haskell & sparse matrices

Are there any Haskell libs for dealing with sparse matrices (or even just libraries for writing to and reading from a standard format, say, harwell boeing? - Hal -- Hal Daume III "Computer science is no more about computers| [EMAIL PROTECTED] than astronomy is about telescopes." -Dijkst

Re: ideas for compiler project

On Sat, 16 Feb 2002, Dylan Thurston wrote: > On Thu, Jan 24, 2002 at 03:38:59PM +0100, Bjorn Lisper wrote: > > I think MATLAB's matrix language provides about the right level of > > abstraction for a high-level matrix language. You can for instance write > > things like > > > > Y = inv(A)*B > > >

Composition Monad

Roughly speaking, I'm in need of a monad (say MyIO) that interprets the following code >f :: MyIO () >f = do >action1 >action2 >action3 >... >return () as applying action1 to g, then action2 to the SAME g (not the result of action1) and so on... Of cours

Re: Composition Monad

I'm not sure exactly what you mean. Say I have something like that, then what's the difference between saying: f = do { action1; action2; action3 } and simply f = do action3 ? If the result of each of the actions is ignored for the following ones, why do we need to do this

Composition Monad

Andre W B Furtado writes: | Roughly speaking, I'm in need of a monad (say MyIO) that interprets the | following code | | >f :: MyIO () | >f = do | >action1 | >action2 | >action3 | >... | >return () | | | as applying action1 to g, then action2

Re: Composition Monad

At 2002-02-17 18:52, Tom Pledger wrote: >I think it's called a reader monad or an environment monad. Here's a >fairly simple version: I made one here: -- A