Site Navigation
Categories:
Lambda calculus
Mathematics of computing
Fixed points
Combinatory logic

Summary Of: Fixed point combinator

We now investigate what happens when a fixed point combinator FIX is applied to... and then use any fixed point combinator FIX to obtain FACT as FIX... can see that this function acts as a fixed point combinator by applying it to an example function... The simplest fixed point combinator in the SK... Another common fixed point combinator is the Turing fixed... any fixed point combinator is also a non... it is possible to define a fixed point combinator using the defining equation of the fixed point combinator... programming language of this kind effectively solves the fixed point combinator equation by means of its own... This implementation of a fixed point combinator in Haskell is sometimes referred to as defining the... The listing below shows the implementation of a fixed point combinator in Haskell that exploits Haskell... This fixed point combinator is traditionally called...

Encyclodia Page On: Fixed point combinator

These Are Links To Other Documents
Y Combinator | higher-order function | fixed point | lambda calculus | untyped lambda calculus | Haskell Curry | simply typed lambda calculus | function literals | recursive functions | bind | identifiers | untyped lambda calculus | beta reduction | factorial function | Church encoding | lambda calculus | syntactic sugar | recursive equations | call site | bound variable | argument | bound | higher-order function | function literals | expression | evaluation strategy | type checker | untyped lambda calculus | combinatory logic | simply typed lambda calculus | recursive types | polymorphic lambda calculus | System F | type variable | untyped lambda calculus | Haskell B. Curry | β-reduction | α-conversion | evaluation strategy | recursively enumerable | applicative-order | η-expansion | SKI-calculus | Alan Turing | lazy evaluation | type checker | System F | inferred | strict programming language | stack overflow | OCaml | closure | monomorphic | inner classes | Java | Function objects | C++ | recursive types | System Fω | not bound | Javascript | anonymous functions | Fixed point iteration | Anonymous function | Eigenfunction | folklore | ISBN 1590598733 | ISBN 3540211462 | folklore | ISBN 1590598733 | Categories | Lambda calculus | Mathematics of computing | Fixed points | Combinatory logic |
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Fixed point combinator".