I've uploaded source RPMs and Linux RPMs (glibc) of the following programs
to our FTP server ftp://ftp.informatik.uni-muenchen.de/pub/local/pms :
* Alex: Chris Dornan's scanner generator for Haskell
* GHC: The Glorious Glasgow Haskell Compilation System (from CVS)
* Green Card: A forei
Hello:
Suppose I have a function 'g' which either iteratively or recursively sums
up results of calls to 'f'. I've predetermined that there will only ever
be 20 things to sum up.
I think the easiest solution would be iteration. However, I'm new to
Haskell and it doesn't seem to have looping co
Hi,
I recently noticed in a test program, that updating a table of
fixed size (index and entries of type Int) was slower using an
Array instead of our AVL implementation.
Does anybody know which compiler option I must give on the
command line that the Array is translated to a C array?
I w
Hi Folks,
There's now a 3.02 dist for Linux/glibc available from the web page, or the
Glasgow ftp site:
ftp://ftp.dcs.gla.ac.uk/pub/haskell/glasgow/3.02/ghc-3.02-i386-unknown-linux
glibc.tar.gz
All our future Linux binary bundles are likely to be of the glibc variety,
so if you haven't
> To the ex-Glaswegians: If I read its license correctly, Happy is freely
> distributable and GHC's status is changing "real soon now". But what
> about Haskell Direct?
It'll be 'soon', rather than 'real soon'. And H/Direct will be the same
deal.
Simon
> I recently noticed in a test program, that updating a table of
> fixed size (index and entries of type Int) was slower using an
> Array instead of our AVL implementation.
>
> Does anybody know which compiler option I must give on the
> command line that the Array is translated to a C array?
>
