Fixed-point combinator

Known as: Fixed point operator, Fixpoint combinator, U combinator 
In computer science, a fixed-point combinator (or fixpoint combinator) is a higher-order function y that satisfies the equation or in words: y, when… (More)
Wikipedia

Related topics

Related topics

34 relations
Böhm treeChurch encodingCombinatory logicComputable topology
(More)

Broader (1)

Lambda calculus

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
The Optimal Fixed Point Combinator
In this paper, we develop a general theory of fixed point combinators, in higher-order logic equipped with Hilbert’s epsilon… (More)
Is this relevant?
2010
2010
The Optimal Fixed Point Combinator — Long Version
In this paper, we develop a general theory of fixed point combinators, in higher-order logic equipped with Hilbert’s epsilon… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Decentralized charging control for large populations of plug-in electric vehicles
The paper develops a novel decentralized charging control strategy for large populations of plug-in electric vehicles (PEVs). We… (More)
  • figure 1
  • table I
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2009
2009
Proof Pearl : A Practical Fixed Point Combinator for Type Theory
Type theories need to enforce some restrictions on recursive definitions in order to remain sound. Depending on the… (More)
Is this relevant?
2005
2005
A Variadic Extension of Curry's Fixed-Point Combinator
We present a systematic construction of a variadic applicative-order multiple fixed-point combinator in Scheme. The resulting… (More)
Is this relevant?
2004
2004
On the Recursive Enumerability of Fixed-Point Combinators
  • Mayer Goldberg BRICS
  • 2004
We show that the set of fixed-point combinators forms a recursivelyenumerable subset of a larger set of terms that is (A) not… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Complete Axioms for Categorical Fixed-Point Operators
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operator is defined, embodying the… (More)
Is this relevant?
1997
1997
Non-existent Statman's Double Fixedpoint Combinator Does Not Exist, Indeed
Corrado Bo hm pointed out the role of combinator SI in the theory of fixed point combinators (see [1], 6.5.3). In particular, any… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Fixed-Point Extensions of First-Order Logic
In 1979 Aho and Ullman [3] noted that the relational calculus is unable to express the transitive closure of a given relation… (More)
Is this relevant?
1984
1984
Experiments in Diffused Combinator Reduction
In recent years there has been a fair amount of interest both in using combinators to represent functional programs, and in using… (More)
  • figure 4-1
  • figure 5-2
  • figure 5-1
  • figure 5-4
Is this relevant?