On 03/08/2009 15:54, Richard Kelsall wrote:
This page
http://www.haskell.org/ghc/documentation.html
has a link to the September 2001 (Draft for GHC 5.02) document
describing GHC Core (in what is for me user-hostile .ps.gz format.)
And this page
I suggest not using Haskell for your list. Put the data in a file and
read it at runtime, or put it in a static C array and link it in.
Cheers,
Simon
On 03/08/2009 22:09, Günther Schmidt wrote:
Hi Thomas,
yes, a source file with a single literal list with 85k elements.
Günther
Hi,
I've just been informed that unpacking the binary (i386) solaris
distribution using bunzip2 and tar:
bunzip2 -c ghc-6.10.4-i386-unknown-solaris2.tar.bz2 | tar xvf -
does not work properly! Use instead:
gtar jxvf ghc-6.10.4-i386-unknown-solaris2.tar.bz2
File names longer than a hundred
On Tue, Aug 04, 2009 at 09:12:37AM +0100, Simon Marlow wrote:
I suggest not using Haskell for your list. Put the data in a file and
read it at runtime, or put it in a static C array and link it in.
On 03/08/2009 22:09, G?nther Schmidt wrote:
Hi Thomas,
yes, a source file with a single
Your function is not equivalent:
perm _|_ = _|_
permutations _|_ = _|_ : _|_
On 8/4/09, Slavomir Kaslev slavomir.kas...@gmail.com wrote:
A friend mine, new to functional programming, was entertaining himself by
writing different combinatorial algorithms in Haskell. He asked me for some
help
On Tue, Aug 4, 2009 at 8:53 PM, Krasimir Angelovkr.ange...@gmail.com wrote:
Your function is not equivalent:
perm _|_ = _|_
permutations _|_ = _|_ : _|_
Nice catch. One can use the same trick as in permutations:
perm2 [] = [[]]
perm2 xxs@(x:xs) = xxs : tail (concatMap (inter x) (perm2
Am Dienstag 04 August 2009 19:48:25 schrieb Slavomir Kaslev:
A friend mine, new to functional programming, was entertaining himself by
writing different combinatorial algorithms in Haskell. He asked me for some
help so I sent him my quick and dirty solutions for generating variations
and
On Tue, Aug 4, 2009 at 9:23 PM, Daniel Fischerdaniel.is.fisc...@web.de wrote:
Am Dienstag 04 August 2009 19:48:25 schrieb Slavomir Kaslev:
A friend mine, new to functional programming, was entertaining himself by
writing different combinatorial algorithms in Haskell. He asked me for some
help
Am Dienstag 04 August 2009 20:30:58 schrieb Slavomir Kaslev:
On Tue, Aug 4, 2009 at 9:23 PM, Daniel Fischerdaniel.is.fisc...@web.de
wrote:
Which version of ghc are you testing on? I guess, it's more recent than
mine.
6.10.3. But I think if you compiled it with 6.8.*, the library code would
On Sun, Aug 2, 2009 at 8:32 PM, Bertram Felgenhauer
bertram.felgenha...@googlemail.com wrote:
Antoine Latter wrote:
- Does anyone have a version of 'network' which builds against GHC
head? I could bludgeon in the new GHC.IO.FD.FD type myself, but I'd
thought I'd ask around first.
Your function is not equivalent:
perm _|_ = _|_
permutations _|_ = _|_ : _|_
I have a vague memory that the library version diagonalises properly,
so that if you give it a lazy infinite input, it still generates
sensible output lazily. If so, this important property should be
noted in
11 matches
Mail list logo