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 | 9438 reads
|
Browse archives
Active forum topics |
Recent comments
6 weeks 15 hours ago
6 weeks 19 hours ago
6 weeks 19 hours ago
28 weeks 2 days ago
32 weeks 3 days ago
34 weeks 1 day ago
34 weeks 1 day ago
36 weeks 5 days ago
41 weeks 3 days ago
41 weeks 3 days ago