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 2007-09-19 11:45 | LtU Forum | previous forum topic | next forum topic | other blogs | 9327 reads
|
Browse archives
Active forum topics
|
Recent comments
15 weeks 8 hours ago
19 weeks 2 days ago
20 weeks 6 days ago
20 weeks 6 days ago
23 weeks 4 days ago
28 weeks 1 day ago
28 weeks 1 day ago
28 weeks 4 days ago
28 weeks 4 days ago
31 weeks 3 days ago