Revision as of 03:24, 10 January 2014 edit Thepigdog (talk \| contribs) Extended confirmed users 5,174 edits →Existence of fixed-point combinators ← Previous edit		Revision as of 03:28, 10 January 2014 edit undo Thepigdog (talk \| contribs) Extended confirmed users 5,174 edits →Existence of fixed-point combinators Next edit →
Line 332: ::<math>(\lambda f.(\lambda x.f\ (x\ x))\ (\lambda x.f\ (x\ x))) (\lambda p.\lambda a.\lambda b.p\ b\ a) </math> ::And the re-cursion is, ::<math>(\lambda x.(\lambda p.\lambda a.\lambda b.p\ b\ a)\ (x\ x))\ (\lambda x.(\lambda p.\lambda a.\lambda b.p\ b\ a)\ (x\ x)) </math> ::<math>(\lambda p.\lambda a.\lambda b.p\ b\ a)\ ((\lambda x.(\lambda p.\lambda a.\lambda b.p\ b\ a)\ (x\ x))\ (\lambda x.(\lambda p.\lambda a.\lambda b.p\ b\ a)\ (x\ x))) </math> ::<math>\lambda a.\lambda b.((\lambda x.(\lambda p.\lambda a.\lambda b.p\ b\ a)\ (x\ x))\ (\lambda x.(\lambda p.\lambda a.\lambda b.p\ b\ a)\ (x\ x)))\ b\ a </math> ::<math>\lambda a.\lambda b.(\lambda a.\lambda b.((\lambda x.(\lambda p.\lambda a.\lambda b.p\ b\ a)\ (x\ x))\ (\lambda x.(\lambda p.\lambda a.\lambda b.p\ b\ a)\ (x\ x)))\ b\ a)\ b\ a </math> :: ... ::<math>(\lambda x.(\lambda p.\lambda a.\lambda b.p\ b\ a)\ (x\ x))\ (\lambda x.(\lambda p.\lambda a.\lambda b.p\ b\ a)\ (x\ x)) </math> ::Which is the first line and will re-curse indefinitely. [[User:Thepigdog\|Thepigdog]] ([[User talk:Thepigdog\|talk]]) 01:10, 10 January 2014 (UTC)

Talk:Fixed-point combinator: Difference between revisions