[Haskell-cafe] OT - lamba calculus definition - alpha reduction

2006-05-29 Thread Dušan Kolář
Hello all, I'm asking in place of several my colleagues and myself of course. The question is almost off topic. It is from lambda calculus definition, in particular, definition of alpha reduction (and others as well). Alpha reduction definition: a lambda expression (\v.e) can be

Re: [Haskell-cafe] OT - lamba calculus definition - alpha reduction

2006-05-29 Thread Matthieu Sozeau
Le 29 mai 06 à 14:30, Dušan Kolář a écrit : Hello all, I'm asking in place of several my colleagues and myself of course. The question is almost off topic. It is from lambda calculus definition, in particular, definition of alpha reduction (and others as well). Alpha reduction

Re: [Haskell-cafe] OT - lamba calculus definition - alpha reduction

2006-05-29 Thread Dušan Kolář
I'm asking in place of several my colleagues and myself of course. The question is almost off topic. It is from lambda calculus definition, in particular, definition of alpha reduction (and others as well). Alpha reduction definition: a lambda expression (\v.e) can be transformed

Re: [Haskell-cafe] OT - lamba calculus definition - alpha reduction

2006-05-29 Thread Brian Hulley
Dušan Kolář wrote: [snip] OK. If we have these two expressions: 1) (\x.x b x) 2) (\x.x c x) The question is, are they equal? (They are not identical, of course.) For answer no, there is a strong argument - there is no reduction sequence that can make these identical. On the other hand, their

Re: [Haskell-cafe] OT - lamba calculus definition - alpha reduction

2006-05-29 Thread Jon Fairbairn
On 2006-05-29 at 15:46+0200 =?UTF-8?B?RHXFoWFuIEtvbMOhxZk=?= wrote: OK. If we have these two expressions: 1) (\x.x b x) 2) (\x.x c x) The question is, are they equal? (They are not identical, of course.) For answer no, there is a strong argument - there is no reduction sequence