Live briefing
Everything about Fixed-point combinator
Higher-order function which returns some fixed point of the input function
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. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Fixed-point combinatorA 5-minute orientation
- Pick up a classic book: Chemical Process SafetyThe most-reprinted book on the subject
- Read the landmark paper: Admissibility of Cut in LC with Fixed Point CombinatorCited 10 times
- Go sideways: Lambda calculusA closely related topic
- Go sideways: Anonymous recursionA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Admissibility of Cut in LC with Fixed Point Combinator
Non-existent Statman's Double Fixed Point Combinator Does Not Exist, Indeed
A Variadic Extension of Curry's Fixed-Point Combinator
On the number of fixed points of a combinator in lambda calculus
Fixed point combinators as fixed points of higher-order fixed point generators
đź“š Books worth reading
Chemical Process SafetyDaniel A. Crowl, Joseph F. Louvar · 1989
Cartesian meditationsEdmund Husserl, Dorion Cairns · 1960
Automate the Boring Stuff with PythonAl Sweigart · 2015
One damned island after anotherClive Howard · 1946
We Are the NerdsChristine Lagorio-Chafkin · 2014
Introduction to Probability and StatisticsJ. Susan Milton, Jesse C. Arnold · 1990
The history of Detroit and MichiganSilas Farmer · 1884
Computer Architecture and OrganizationJohn P. Hayes · 2002
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Lambda calculus In mathematical logic, the lambda calculus (also written as λ-calculus) is a formal system for expressing computation based on function abstraction and…
- Anonymous recursion In computer science, anonymous recursion is recursion which does not explicitly call a function by name. This can be done either explicitly, by using a…
- Church encoding In mathematics, Church encoding is a method of representing various types of data in the lambda calculus. In the untyped lambda calculus the only primitive…
- SKI combinator calculus The SKI combinator calculus is a combinatory logic system and a computational system. It can be thought of as a computer programming language, though it…
- Lambda lifting Lambda lifting is a meta-process that restructures a computer program so that functions are defined independently of each other in a global scope. An individual…
- Combinatory logic Combinatory logic is a notation to eliminate the need for quantified variables in mathematical logic. It was introduced by Moses Schönfinkel and Haskell…
- Kleene's recursion theorem In computability theory, Kleene's recursion theorems are a pair of fundamental results about the application of computable functions to their own descriptions…
- Mogensen–Scott encoding In computer science, Scott encoding is a way to represent algebraic data types in the lambda calculus, following their syntactic definition without regard…