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  6648 reads

Browse archivesActive forum topics 
Recent comments
1 hour 26 min ago
2 hours 46 min ago
8 hours 39 min ago
1 day 24 min ago
1 day 39 min ago
1 day 50 min ago
1 day 1 hour ago
1 day 1 hour ago
1 day 3 hours ago
2 days 1 hour ago