go-v.orgcodex
Menu
Page tools

codex · Philosophy

Fixed-point combinator

In combinatory logic for computer science, a fixed-point combinator (or fixpoint combinator) is a higher-order function (i.e., a function that takes a function as argument) that returns some fixed point (a value that is mapped to itself) of its argument function, if one exists. Formally, if fix is a fixed-point combinator and the function f has one or more fixed points, then fix f is one of these fixed points, i.e.,

fix f =f (fix f). Fixed-point combinators can be defined in the lambda calculus and in functional programming languages, and provide a means to allow for recursive definitions.

Wikipedia contributors, "Fixed-point combinator", Wikipedia, revision 1371908408, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex