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:
“God is the efficient cause not only of the existence of things, but also of their essence.
Corr. Individual things are nothing but modifications of the attributes of God, or modes by which the attributes of God are expressed in a fixed and definite manner.”
—Baruch (Benedict)
“Given the existence ... of a personal God ... who ... loves us dearly ... it is established beyond all doubt ... that man ... wastes and pines ... for reasons unknown.”
—Samuel Beckett (1906–1989)