User loginNavigation 
Lambda Calculus: fixed point theorem helpHi, I'm reading the Barendregt book Lamba Calculi with Types, but at the moment I'm studyng the untyped one, in the first part of the book. It says there is a fixed point combinator: ( \ = lambda ) Y = \f.(\x.f(xx))(\x.f(xx)) such that for any F, F(YF) = YF So, if my F is just a variable, let's say F = q, then how q(Yq) can become Yq? I am sure I am missing something. Thanks, By ilSignorCarlo at 20070919 11:45  LtU Forum  previous forum topic  next forum topic  other blogs  6131 reads

Browse archivesActive forum topics 
Recent comments
2 days 3 hours ago
1 week 3 days ago
1 week 5 days ago
1 week 5 days ago
1 week 5 days ago
1 week 5 days ago
1 week 5 days ago
1 week 5 days ago
1 week 5 days ago
1 week 5 days ago