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 word existence:
“If the heart beguiles itself in its choice [of a wife], and imagination will give excellencies which are not the portion of flesh and blood:Mwhen the dream is over, and we awake in the morning, it matters little whether ‘tis Rachael or Leah,—be the object what it will, as it must be on the earthly side ... of perfection,—it will fall short of the work of fancy, whose existence is in the clouds.”
—Laurence Sterne (1713–1768)