[Haskell-cafe] Bound and free variables

[Roman Cheplyaka]

On 23/09/14 16:01, Barak A. Pearlmutter wrote:
> On Mon, 22 Sep 2014 19:30:33 -0400, Michael Orlitzky wrote:
> 
>> It's hard to tell from your example, but if you want, you can
>> translate the let binding directly to lambda calculus and then go from
>> there where the rules are simple.
>>
>> In Haskell,
>>
>>   let <name> = <argument> in <expression>
>>
>> translates to,
>>
>>   (\<name> -> <expression>) <argument>
> 
> Although this list might not be for homework problems, there is an
> element of terminological confusion and a quest for nomenclature in the
> question that don't seem entirely unreasonable.  Even if we're not going
> to answer the question per se, we shouldn't give hints that are
> misleading, or true in Scheme and lambda calculus but false in Haskell.

I am not sure which question in this thread you regard as a homework
problem and suggest not answering.

Roman