Re: [Haskell-cafe] An APL library for Haskell

2013-09-16 Thread Simon Peyton-Jones
PS: Oddly I sent this message in March 2012. I don't know why it has taken over year for it to be delivered! Simon From: Haskell-Cafe [mailto:haskell-cafe-boun...@haskell.org] On Behalf Of Simon Peyton-Jones Sent: 08 March 2012 13:45 To: hask...@haskell.org; Haskell Cafe Cc: Lennart Augustsson;

Re: [Haskell-cafe] An APL library for Haskell

2013-09-16 Thread Austin Seipp
The message was held by Mailman, because it thought you had too many recipients in the message. Gershom noticed this while we were doing some maintenance, and released it. We also bumped the recipient limit to 20 people, so this shouldn't be a problem again. On Mon, Sep 16, 2013 at 4:32 PM, Simon

Re: [Haskell-cafe] An APL library for Haskell

2013-09-16 Thread Carter Schonwald
Hey All, As Dan Peebles remarks, Repa and similar libs give a great haskelly vocabulary for this. Indeed, most of the examples in the wiki page are very much expressible with the REPA data model. I'd like to take this opportunity note that I'll be releasing a prototype library for numerical array

Re: [Haskell-cafe] An APL library for Haskell

2013-09-16 Thread MIMUW
Dear Haskellers & APLers, On 03/08/2012 02:44 PM, Simon Peyton-Jones wrote: > Friends > > Many of you will know the array language > APL. It > focuses on arrays and in particular has a rich, carefully-thought-out array > algebra. >

Re: [Haskell-cafe] An APL library for Haskell

2013-09-15 Thread Daniel Peebles
Interesting idea. It seems like building this on top of REPA would save a lot of work, since it has a native notion of "rank" encoded in the type system. I'd then see the APL-like combinators as a "niche" API for REPA, rather than as a library of their own. And of course, you'd get parallelization