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.
Review
2010
Review
2010
PρLog is an experimental extension of logic programming with strategic conditional transformation rules, combining Prolog with… 
2010
2010
Common record systems only provide access to individual record fields. However, it is often useful to have generic record… 
2005
2005
Field programmable gate arrays (FPGAs) are now considered as a real alternative for digital signal processing (DSP) applications… 
2004
2004
General logic programs with negation have the 3-valued minimal Herbrand models based on the Kripke’s fixpoint knowledge revision… 
2002
2002
Separation of processes is the foundation for security and safety properties of systems. This paper reports on a collaborative… 
Review
1999
Review
1999
The study of fixed points of continuous self-maps of compact manifolds involves geometric topology in a significant way in… 
1998
1998
During the 1st workshop on AOP [AOP97] several fundamental questions were raised: What exactly are aspects? How to weave? What… 
1996
1996
We present a type inference system for a language with object-oriented features such as polymorphic record access and subtyping… 
1993
1993
We extend first-order logic with successor using the least fixed point operator and the Hamiltonian path generalized quantifier… 
1970
1970
In this paper, I present a modified and extended version of combinatory logic. Schönfinkel originated the study of combinatory…