Bugs item #865518, was opened at 2003-12-24 14:09
Message generated for change (Tracker Item Submitted) made by Item Submitter
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=865518group_id=8032
Category: Compiler
Group: None
Status: Open
Resolution: None
On Tue, Dec 16, 2003 at 02:05:14PM -, Simon Marlow wrote:
The (Interactive) Glasgow Haskell Compiler -- version 6.2
And, for Christmas, we at Debian bring
Ian Lynagh [EMAIL PROTECTED] writes:
The (Interactive) Glasgow Haskell Compiler -- version 6.2
And, for Christmas, we at Debian bring you sackful of debs!
On Dec 24, 2003, at 2:29 AM, Sean L. Palmer wrote:
It occurs to me that Haskell would be quite a bit easier for OO and
traditional programmers to grasp if Haskell would actually use the
correct, or at least more commonly used, names for things.
I don't think changing a few keywords will have
Hi,
I have some code (http://www.acooke.org/andrew/ReadTest.hs) that reads
data from a file (an image in ppm format; example data (256*256 pixels) at
http://www.acooke.org/andrew/test.ppm) and stores it in an array of Word8
values. The aim is to read a file that contains 5000 * 5000 * 3 Word8
(1) use unboxed arrays, otherwise you're wasting too much space with
pointers. that is, unless you need laziness on the elements, which i
don't think you do based on your list
(2) (maybe) use imperative arrays; this will help you ensure that
everything is being evaluated quickly.
On Wed, 24
Thanks. I should have added that I will only use the array for reading
once it's created. I don't mind whether creating is lazy or eager (it's
currently eager because I was fighting a space leak, but I think that was
down to some other error).
I don't fully understand how either of the
one other thing you might find useful is to read it imperatively and then
use unsafeFreezeArray (i think that's the name) to get a pure array out of
it. since all you'll be doing is reading, this should work nicely for
you.
On Wed, 24 Dec 2003, andrew cooke wrote:
Thanks. I should have
On Tue, Dec 16, 2003 at 02:05:14PM -, Simon Marlow wrote:
The (Interactive) Glasgow Haskell Compiler -- version 6.2
And, for Christmas, we at Debian bring
Ian Lynagh [EMAIL PROTECTED] writes:
The (Interactive) Glasgow Haskell Compiler -- version 6.2
And, for Christmas, we at Debian bring you sackful of debs!
Hi
Sorry to take so long: I've spent a week watching paint dry, so I can
confirm that this is more interesting.
Jon Cast wrote:
Conor McBride [EMAIL PROTECTED] wrote:
snip
I've always been a little bothered by the MonadPlus class: zero and
plus are associated (no pun intended) in my
[switching to Haskell-cafe]
At 19:37 23/12/03 +0100, Tomasz Zielonka wrote:
On Tue, Dec 23, 2003 at 05:26:20PM +, Graham Klyne wrote:
[1] http://www.ninebynine.org/Software/Learning-Haskell-Notes.html
Thanks, that was a nice reading :)
Thanks!
(If by any chance there's anything here that
On Wed, Dec 24, 2003 at 10:39:33AM +, Graham Klyne wrote:
It now seems to me that (some?) Monads are kinds of Functors, generalized
to handle the no value case, and also composition.
This also had me thinking about sequence: is there a generalization to
arbitrary monads that
13 matches
Mail list logo
