29 Dec
2010
29 Dec
'10
10:40 p.m.
On Wed, Dec 29, 2010 at 9:22 PM, Mark Spezzano wrote: Duh, Sorry. Yes, there was a typo the second one should read If E is a combination E1 E2 then X is bound in E if and only if X is bound
in E1 or is bound in E2. Seems odd. I recommend you always work from at least three different texts.
Here's Hindley and
Seldinhttp://www.amazon.com/Lambda-Calculus-Combinators-Introduction-Roger-Hindley...
:
"An occurrence of a variable x in a term P is called
- *bound* if it is in the scope of a \x in P (NB: using \ as lambda)
- *bound and binding* iff it is the x in \x
- *free* otherwise"
The tricky question is: bound to what, exactly?
-Gregg