Newsgroups: comp.lang.scheme
Path: cantaloupe.srv.cs.cmu.edu!nntp.club.cc.cmu.edu!godot.cc.duq.edu!news.duke.edu!eff!news.kei.com!yeshua.marcam.com!charnel.ecst.csuchico.edu!csusac!csus.edu!netcom.com!netcom7!vanmeule
From: vanmeule@netcom7.netcom.com (Andre van Meulebrouck)
Subject: parsing lambda calculus
Message-ID: <VANMEULE.94Sep10053951@netcom7.netcom.com>
Sender: vanmeule@netcom.com (Andre van Meulebrouck)
Organization: NETCOM On-line services
Date: Sat, 10 Sep 1994 12:39:51 GMT
Lines: 18

I have a question regarding the parsing of lambda calculus
expressions.  As far as I know there's no lambda calculus mailing
list, so hopefully this list is close enough.

Here's the expression:
 
Lf.(Ly.yx)((Lyz.y(yz)) f)

wherein I use L for lambda and of course Lyz is shorthand for Ly.Lz

What does the expression beta reduce to?

(What's behind the question is to get at how the rule regarding
application binding tighter than abstraction is applied when parsing
complicated expressions).

Thanks.
-- 
for personal data:  finger vanmeule@netcom.com
