[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Lambda calculus and it relation to LISP
From: |
David Kastrup |
Subject: |
Re: Lambda calculus and it relation to LISP |
Date: |
05 Oct 2002 13:44:55 +0200 |
User-agent: |
Gnus/5.09 (Gnus v5.9.0) Emacs/21.3.50 |
luke.olbrish@cc.gatech.edu (Luke A. Olbrish) writes:
> gnuist007@hotmail.com (gnuist) writes:
>
> > "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."
> >
> > I am interested in a little concrete elaboration
> > of this statement by any mathematicians, logicians
> > or practitioners/users of lisp and lisp in emacs.
>
> ((lambda (x) x x) (lambda (x) x x))
That's gibberish. You probably mean
((lambda (x) (x x)) (lambda (x) (x x)))
which will (in Scheme, not Lisp) lead to infinite recursion.
While we are on the topic of Scheme and recursion:
((lambda (f n) (f f n))
(lambda (f n) (if (= 0 n) 1 (* n (f f (- n 1))))) 5)
Recursion without a function actually calling itself!
--
David Kastrup, Kriemhildstr. 15, 44793 Bochum
Email: David.Kastrup@t-online.de
- Lambda calculus and it relation to LISP, gnuist, 2002/10/04
- Re: Lambda calculus and it relation to LISP, Luke A. Olbrish, 2002/10/05
- Re: Lambda calculus and it relation to LISP, Charles Matthews, 2002/10/05
- Re: Lambda calculus and it relation to LISP, Gareth McCaughan, 2002/10/05
- Re: Lambda calculus and it relation to LISP, William Elliot, 2002/10/06
- Re: Lambda calculus and it relation to LISP, Gareth McCaughan, 2002/10/06
- Re: Lambda calculus and it relation to LISP, gnuist, 2002/10/07
- Re: Lambda calculus and it relation to LISP, William Elliot, 2002/10/07
- Re: Lambda calculus and it relation to LISP, Barb Knox, 2002/10/07
- Re: Lambda calculus and it relation to LISP, David Kastrup, 2002/10/07