Existence of Fixed-point Combinators
In certain mathematical formalizations of computation, such as the untyped lambda calculus and combinatory logic, every expression can be considered a higher-order function. In these formalizations, the existence of a fixed-point combinator means that every function has at least one fixed point; a function may have more than one distinct fixed point.
In some other systems, for example in the simply typed lambda calculus, a well-typed fixed-point combinator cannot be written. In those systems any support for recursion must be explicitly added to the language. In still others, such as the simply typed lambda calculus extended with recursive types, fixed-point operators can be written, but the type of a "useful" fixed-point operator (one whose application always returns) may be restricted. In polymorphic lambda calculus (System F) a polymorphic fixed-point combinator has type ∀a.(a→a)→a, where a is a type variable.
Read more about this topic: Fixed-point Combinator
Famous quotes containing the words existence of and/or existence:
“The very existence of society depends on the fact that every member of it tacitly admits he is not the exclusive possessor of himself, and that he admits the claim of the polity of which he forms a part, to act, to some extent, as his master.”
—Thomas Henry Huxley (1825–95)
“Sometimes I think that the biggest difference between men and women is that more men need to seek out some terrible lurking thing in existence and hurl themselves upon it.... Women know where it lives but they can let it alone.”
—Russell Hoban (b. 1925)