Revision as of 23:12, 17 November 2008 edit Natecull (talk \| contribs) 301 edits No edit summary ← Previous edit		Revision as of 12:25, 18 November 2008 edit undo Tea2min (talk \| contribs) Extended confirmed users, Pending changes reviewers 21,969 edits →I don't get it: Reply Next edit →
Line 45: Obviously this is a hugely fundamental result in basic computer science, so it must be right, and I thought I vaguely understood lambda calculus, but I can't make head or tail of this definition as written. --[[User:Natecull\|Natecull]] ([[User talk:Natecull\|talk]]) 23:12, 17 November 2008 (UTC) :As is explained in the section [[Fixed point combinator#Existence of fixed point combinators]], fixed point combinators need not exist for all settings, and need not be [[total function\|total]], i.e. they may diverge for some (even almost all) inputs. However, there are important settings such as '''CPO''', the [[cartesian closed category]] of [[complete partial order]]s with [[Scott continuity\|Scott continuous]] maps, where fix points always exist. — [[User:Tobias Bergemann\|Tobias Bergemann]] ([[User talk:Tobias Bergemann\|talk]]) 12:25, 18 November 2008 (UTC)

Talk:Fixed-point combinator: Difference between revisions