Ç×°®µÄÅóÓÑ£º
ÄúºÃ£¡
ÕâÊÇÀ´×ÔÈðÀ´ÍøÂ磨ÏÃÃÅ£©ÓÐÏÞ¹«Ë¾µÄÎʺ¸ÐлÄúÊÕ¿´Õâ·âÓʼþ¡£ÎÒÃÇÕæ³ÏµÄÏ£ÍûÄúÄܳÉΪÎÒÃÇÔÚ¹ó
µØÇøµÄÖØÒª»ï°é¡£ÎÒÃÇÊÇÒ»¼Ò²ÉÓÃÊÀ½ç¸ßм¼Êõ½á¾§£¬Ñо¿¡¢ÍƹãºÍ·¢Õ¹Ð¼¼Êõ£¬ÖÂÁ¦ÓÚ»¥ÁªÍøÐÅÏ¢·þÎñ¡¢µç
×ÓÉÌÎñ·þÎñºÍÆóÒµÓ¦Ó÷þÎñµÄ¸ßм¼ÊõÆóÒµ¡£ÏêÇéÇëä¯ÀÀ:http://www.raeline.net
anatoli anatoli at yahoo wrote:
Attached are two interpreters: one for untyped lambda calculus,
I'm afraid the attached interpreter can't be an implementation of the
lambda calculus. For one thing, it lacks the hygiene of substitutions:
Lambda :t lambdaEval (A (L X (L Y (A X Y))) T)
On Sat, 30 Mar 2002, Richard Uhtenwoldt wrote:
The bottom line is a social one: language communities compete fiercely
for programmers. There is no shortage of languages with open-sourced
implementations in which James could have written his program. (Er,
actually James is embedding a DSL
Hello,
Hal Daume III [EMAIL PROTECTED]
writes about Z_n in Haskell:
Suppose I want to define integers modulo n, I could do this something
like:
data Zn = Zn Integer Integer -- modulus, number
instance Num Zn where
(Zn m1 n1) + (Zn m2 n2)
| m1 == m2 = Zn m1 (n1 + n2 `mod` m1)
