Title: °Ü¿ïö Â÷ ¾ÈÀÇ ÂòÁú¹æ !! Â÷·®¿ë °Ç° ¿Âµ¹ ½ÃÆ® !!
- ÀÌ ±¤°í¸ÞÀÏÀº ´õ ÀÌ»ó ¹ß¼ÛÇÏÁö ¾Ê½À´Ï´Ù
-
°Ü¿ïö
Â÷ ¾ÈÀÇ ÂòÁú¹æ !! Â÷·®¿ë °Ç° ¿Âµ¹ ½ÃÆ® !!
¾Æ¹«¸®
Ãß¿î °Ü¿ï¿¡µµ 1ºÐÈĸé ÈƱ⸦ ´À³¥ ¼ö ÀÖ½À´Ï´Ù½¡ÀÇ
People write on gcd 0 0 :
Alan Bawden [EMAIL PROTECTED]
If you take the point-of-view that gcd is actually an operation on
ideals, then gcd(0, 0) is 0. I.e. define gcd(x, y) to be the smallest
z = 0 such that {m*x + n*y | m, n in Z} = {n*z | n in Z}. This is
probably the most natural
Hi
I'm not entirely clear how Integer can be an Enum
instance. I thought Integer was arbitrary size, while for the Enum class you
need to define a mapping from and to Int, which is bounded (in a machine
dependent way, even ?). I'm probably missing something obvious...
CheersFrank Dellaert
From: Tony Davie [EMAIL PROTECTED]
Subject: Re: We need Documentation (Was: Re: Integer to String Conversion?)
Date: Tue, 4 Dec 2001 09:38:49 +
The material we have is simply lacking. What we need is a good tutorial and a
comprehensive reference book.
...
I suggest you look at
I taught myself Python in about two weeks with the online Python tutorial, I think
something similar for Haskell would greatly increase the number of Haskell users.
I'm not familiar with the Python tutorial, but the Java tutorial which
resides at java.sun.com is pretty much the most highly
From: Hal Daume III [EMAIL PROTECTED]
Subject: Re: We need Documentation
Date: Thu, 13 Dec 2001 09:07:12 -0800 (PST)
Where is the Python tutorial located and is it more-or-less the same as
the Java one?
http://www.python.org/doc/current/tut/tut.html
Would anyone be interested in working on
I think we should move this off the mailing list. I'm willing to
spear-head such an effort. Anyone who is interested in contributing,
please email me. I'll compile a list of people and we can figure out what
we want to do.
- Hal
--
Hal Daume III
Computer science is no more about computers
Recently I've hacked up a (yet another) TeX package for typesetting
literate scripts in TeX, which, I think belongs in
http://haskell.org/libraries/#tex;. What's different about lambdaTeX
is that it is not a cumbersome preprocessor, but a full TeX program
(an almost-complete Haskell lexical
From: S.D.Mechveliani [EMAIL PROTECTED]
Date: Thu, 13 Dec 2001 12:53:32 +0300
Further, the definintion
gcd(x, y) to be the smallest
z = 0 such that {m*x + n*y | m, n in Z} = {n*z | n in Z}
is not natural. In particular, how does it generalize to gcd X Y
for
