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:
“‘Tis going, I own, like the Knight of the Woeful Countenance, in quest of melancholy adventures—but I know not how it is, but I am never so perfectly conscious of the existence of a soul within me, as when I am entangled in them.”
—Laurence Sterne (1713–1768)
“The very existence of government at all, infers inequality. The citizen who is preferred to office becomes the superior to those who are not, so long as he is the repository of power, and the child inherits the wealth of the parent as a controlling law of society.”
—James Fenimore Cooper (1789–1851)