[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: Lambda calculus and it relation to LISP

From: Joona I Palaste
Subject: Re: Lambda calculus and it relation to LISP
Date: 6 Oct 2002 13:46:13 GMT
User-agent: tin/1.4.2-20000205 ("Possession") (UNIX) (OSF1/V4.0 (alpha))

Thaddeus L Olczyk <> scribbled the following
on sci.math:
> On 4 Oct 2002 20:20:49 -0700, (gnuist) wrote:
>>"The lambda calculus is a mathematical formalism 
>>having to do with the way functions instantiate
>>their arguments. To some extent it is the theoretical
>>basis for Lisp and plenty of other computer languages."

> To really see a PL that "implements lambda calculus"
> lok at Haskel, not Lisp.

Haskell, not Haskel. In Haskell the backslash \ means the lambda
operator. For example it's possible to say:

(\f. (f 1)) (\x. x + 1), which means:
(\x. x + 1) 1, which means:
1 + 1, which means:

Haskell gets its name from Haskell Curry, who has also been attributed
for the concept of "currying", which I'm told should really be called

/-- Joona Palaste ( ---------------------------\
| Kingpriest of "The Flying Lemon Tree" G++ FR FW+ M- #108 D+ ADA N+++|
|       W++ B OP+                     |
\----------------------------------------- Finland rules! ------------/
"To doo bee doo bee doo."
   - Frank Sinatra

reply via email to

[Prev in Thread] Current Thread [Next in Thread]