Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

34 relations
Böhm treeChurch encodingCombinatory logicComputable topology

Broader (1)

Lambda calculus

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
An Abductive Model for Human Reasoning
In this paper we contribute to bridging the gap between human reasoning as studied in Cognitive Science and commonsense reasoning… 
2008
2008
Transactional events for ML
Transactional events (TE) are an approach to concurrent programming that enriches the first-class synchronous message-passing of… 
2003
2003
A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions, I: The Two-Level Case
Abstract2LS is a decidable many-sorted set-theoretic language involving one sort for elements and one sort for sets of elements… 
2002
2002
Creating High Confidence in a Separation Kernel
Separation of processes is the foundation for security and safety properties of systems. This paper reports on a collaborative… 
Highly Cited
2002
Highly Cited
2002
Monads for incremental computing
This paper presents a monadic approach to incremental computation, suitable for purely functional languages such as Haskell. A… 
1998
1998
Fowards a Generic Framework for AOP
During the 1st workshop on AOP [AOP97] several fundamental questions were raised: What exactly are aspects? How to weave? What… 
1988
1988
Moving selections into linear least fixpoint queries
A selection transposition algorithm is presented that allows selections that are conjunctions of predicates of the form 'column… 
1984
1984
Annotations to Control Parallelism and Reduction Order in the Distributed Evaluation of Functional Programs
When evaluating a functional program on a network of processors, it is necessary to decide when parallelism is desirable, which… 
Highly Cited
1982
Highly Cited
1982
Relational queries computable in polynomial time (Extended Abstract)
Query languages for relational databases have received considerable attention. In 1972 Codd [Cod72] showed that two natural… 
1970
1970
Combinatory logic with discriminators
In this paper, I present a modified and extended version of combinatory logic. Schönfinkel originated the study of combinatory… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)