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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
In this paper we contribute to bridging the gap between human reasoning as studied in Cognitive Science and commonsense reasoning… 
2008
2008
Transactional events (TE) are an approach to concurrent programming that enriches the first-class synchronous message-passing of… 
2003
2003
Abstract2LS is a decidable many-sorted set-theoretic language involving one sort for elements and one sort for sets of elements… 
2002
2002
Separation of processes is the foundation for security and safety properties of systems. This paper reports on a collaborative… 
2001
2001
1998
1998
During the 1st workshop on AOP [AOP97] several fundamental questions were raised: What exactly are aspects? How to weave? What… 
1985
1985
The propositional mu-calculus is a propositional logic of programs which incorporates a least fixpoint operator and subsumes the… 
1970
1970
In this paper, I present a modified and extended version of combinatory logic. Schönfinkel originated the study of combinatory…