[plt-scheme] lambda calculus

From: emre berat nebioğlu (beratn at gmail.com)
Date: Tue Aug 11 08:04:42 EDT 2009

By the way i need to say something.I ask some source to learn lambda
calculus,it is true i have an exam but it is not the situation of
the original enquirer.Because i have some wish to write functional
programming to learn lambda calculus.İ am sorry but i have to meantion.This
is not necessary to say ((the situation of the original enquirer) .I aö
student who make some computer science.I have a long way but in a day future
i become computer scientist !!! Sorry for that mail.

On Tue, Aug 11, 2009 at 2:23 PM, Matthias Felleisen <matthias at ccs.neu.edu>wrote:

> On Aug 11, 2009, at 2:07 AM, Chris Stephenson wrote:
> (Your student asks general questions, so he's getting general answers.)
>  But Barendregt's trick of renaming all bound variables to have different
>> names from all free variables simplifies some proofs, but obscures the
>> issue of scope for those who interested in Lambda calculus as a model
>> for programming languages.
> The phrase you're alluding to has been misunderstood by many many computer
> scientists. Due to copying it isn't enough to distinguish free/bound
> variables in the original term. You have to do so at every step of the
> reduction. Barendregt knows this as the Yellow book shows. Computer science
> papers seem to not understand this on occasion. So yes, you're right :-) Use
> de Bruijn indices.
> -- Matthias
> _________________________________________________
>  For list-related administrative tasks:
>  http://list.cs.brown.edu/mailman/listinfo/plt-scheme
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.racket-lang.org/users/archive/attachments/20090811/c4365bf5/attachment.html>

Posted on the users mailing list.