Skip to content
scrambled
Programming Language Theory Flashcard

What is the definition of the fixed-point combinator?

Question

What is the definition of the fixed-point combinator?

Answer

A fixed-point combinator is a function that finds the fixed-point of any given function regarding the Evaluation/Reduction relation.

That is, given fix as a fixed-point combinator and f as any arbitrary function, we have:

fix f→∗f (fix f)