Dear all,
I am very sorry for something like misprinting tragically in the
classic gcd definition. I had written
" gcd(a,b) is the *greatest* by inclusion ideal (d) among the
ones with the property of
(d) = {x*d | x <- R} to be *contained inside*
(a)+(b
Version 0.0 of NHC13, Nearly a Haskell 1.3 Compiler, by Niklas Rojemo,
is now available for download from
ftp://ftp.cs.chalmers.se/pub/haskell/nhc13
It has the following features
- Compiles Haskell 1.3
- Supports Fudgets
- Supports several kind of heap profiles:
[If this whole 'gcd' discussion is getting 'too mathematical' for this list,
I propose to continue it by private e-mail with members of the Haskell
committee. If so, please give me an e-mail address to contact.]
At 09:16 6-11-96 +0300, you wrote in reply to my 'Why not make "gcd 0 0 = 0"?':
>Hel