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… 
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… 
2001
2001
An optical waveguide device including an electro-optical crystal substrate having a top surface and a bottom surface; an optical… 
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… 
1992
1992
In this paper I present a set of conceptually simple but involved techniques used by LIAR, the MIT SCHEME compiler, to generate… 
1990
1990
We consider how the Z notation is used to produce structured specifications. In particular, we consider the technique known as… 
1974
1974
Minimal fixed point operators were introduced by Scott and De Bakker in order to describe the input-output behaviour of recursive…