't gotten
too far. Having Parsec work speedily with binary files would
absolutely rock -- I suspect there are a lot of people who've never
thought about using parser combinators to process binary data, and if
it's a feasible option ...
--
% Andre Pang : t
ting the Shapes example is the same thing.
--
% Andre Pang : trust.in.love.to.save <http://www.algorithm.com.au/>
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
that you might find useful:
http://xrl.us/ftux (Link to www.algorithm.com.au)
--
% Andre Pang : trust.in.love.to.save <http://www.algorithm.com.au/>
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
uted model really helps. While Subversion is much, much
better than CVS -- I use it everyday at work -- I think users being
able to make their own branches of GHC is a compelling case for using
Darcs.
--
% Andre Pang : trust.in.love.to.save <http://www.alg
#x27;re on Mac OS X which supports dynamic
libraries, but then you're treading on pretty new ground). You're
probably best off with a standalone CGI program.
--
% Andre Pang : trust.in.love.to.save <http://www.algorithm.com.au/>
_
some similar Haskell<->OO integration work,
and the type errors which appeared when something went wrong are quite
awesome. User-defined compile-time errors would be fantastic, but that
would require quite a lot of effort.
--
% Andre Pang : trust.in.love.to.save &l
the type errors you face when you get
things wrong are, well, long :).
I guess my point is that in theory, Haskell can support OO right now.
In practice, it's something that isn't very tasty.
--
% Andre Pang : trust.in.love.to.save
Simon Marlow wrote:
Not a problem. Have you looked at the streams proposal?
Is there a Wiki page or URL with the steram proposal?
--
% Andre Pang : trust.in.love.to.save <http://www.algorithm.com.au/>
___
Haskell-Cafe mailing list
Haskel
g e.g. stream-based lazy lists?
--
% Andre Pang : trust.in.love.to.save
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
rrogant, I think the Haskell community in general does not understand
the importance of syntactic sugar to make such tasks easier.
--
% Andre Pang : trust.in.love.to.save
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
ers try out O'Caml rather than
Haskell as their first functional programming language, and it would be
really nice if optimisation was made a bit easier.
--
% Andre Pang : trust.in.love.to.save
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
ti a Foo => SubMulti a Bar c
I haven't found elegant ways of visualising this at all: how do you
draw arrows from SuperMulti to SubMulti, for instance? Has anyone else
had a go at this?
--
% Andre Pang : trust.in.love.to.save
___
Haskell-C
e read to not require wrapping quotation
marks or, alternetively, to catch a read
exception, and do something sane?
Untested code (I'll leave you to come up with a better name than MyRead
:)
class MyRead a where myRead :: String -> a
instance MyRead Integer where myRead = read
ins
On Tuesday, August 19, 2003, at 03:33 AM, Konrad Hinsen wrote:
On Monday 18 August 2003 19:10, Andre Pang wrote:
This seems to work (with -fglasgow-exts):
module Foo where
class Vect v where
(<+>) :: v -> v -> v
data Vector a = Vector a a a
deriving (Show, Eq)
instanc
pWith (<+>) l1 l2
*Foo> (Vector 5 6 7) <+> (Vector 1 2 3)
Vector 6.0 8.0 10.0
*Foo> [Vector 1 2 3, Vector 10 20 30] <+> [Vector 100 200 300, Vector 4
5 6]
[Vector 101.0 202.0 303.0,Vector 14.0 25.0 36.0]
... or does example not do something which you want it to do?
--
% And
build system).
However, if you still want to use Project Builder, I have managed to
get GHC integration going. It's not pretty (put it this way: Perl is
involved ...), but it _does_ work. I'm planning to release it in ~2
weeks, but if you can't wai
16 matches
Mail list logo
