Fixed-point combinator
id:
fixed-point-combinator-174-13599245
title:
Fixed-point combinator
text:
In combinatory logic for computer science, a fixed-point combinator, is a higher-order function that returns some fixed point 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.
- 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.
brand slug:
wiki
category slug:
encyclopedia
description:
Higher-order function Y for which Y f = f (Y f)
original url:
https://en.wikipedia.org/wiki/Fixed-point_combinator
date created:
2002-11-23T20:01:10Z
date modified:
2024-09-02T21:51:08Z
main entity:
{"identifier":"Q2976255","url":"https://www.wikidata.org/entity/Q2976255"}
image:
fields total:
13
integrity:
15