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:
“Realism holds that things known may continue to exist unaltered when they are not known, or that things may pass in and out of the cognitive relation without prejudice to their reality, or that the existence of a thing is not correlated with or dependent upon the fact that anybody experiences it, perceives it, conceives it, or is in any way aware of it.”
—William Pepperell Montague (1842–1910)
“Did men but consider that the sun, moon, and stars, and every other object of the senses, are only so many sensations in their minds, which have no other existence but barely being perceived, doubtless they would never fall down and worship their own ideas; but rather address their homage to that eternal invisible Mind which produces and sustains all things.”
—George Berkeley (1685–1753)