Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,732,004 papers from all fields of science
Search
Sign In
Create Free Account
Fixed-point combinator
Known as:
Fixed point operator
, Fixpoint combinator
, U combinator
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
34 relations
Böhm tree
Church encoding
Combinatory logic
Computable topology
Expand
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
Steffen Hölldobler
,
Tobias Philipp
,
C. Wernhard
AAAI Spring Symposium: Logical Formalizations of…
2011
Corpus ID: 7702775
In this paper we contribute to bridging the gap between human reasoning as studied in Cognitive Science and commonsense reasoning…
Expand
2008
2008
Transactional events for ML
Laura Effinger-Dean
,
M. Kehrt
,
D. Grossman
ACM SIGPLAN International Conference on…
2008
Corpus ID: 15495200
Transactional events (TE) are an approach to concurrent programming that enriches the first-class synchronous message-passing of…
Expand
2003
2003
A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions, I: The Two-Level Case
Domenico Cantone
,
J. Schwartz
,
C. Zarba
Journal of automated reasoning
2003
Corpus ID: 6989869
Abstract2LS is a decidable many-sorted set-theoretic language involving one sort for elements and one sort for sets of elements…
Expand
2002
2002
Creating High Confidence in a Separation Kernel
W. B. Martin
,
P. D. White
,
F. S. Taylor
International Conference on Automated Software…
2002
Corpus ID: 7524945
Separation of processes is the foundation for security and safety properties of systems. This paper reports on a collaborative…
Expand
2001
2001
Formalizing non-termination of recursive programs
R. Kahle
,
T. Studer
J. Log. Algebraic Methods Program.
2001
Corpus ID: 1925499
2000
2000
Gödelization in the lambda calculus
M. Goldberg
Information Processing Letters
2000
Corpus ID: 12186607
1998
1998
Fowards a Generic Framework for AOP
Pascal Fradet
,
Mario Südholt
ECOOP Workshops
1998
Corpus ID: 2069454
During the 1st workshop on AOP [AOP97] several fundamental questions were raised: What exactly are aspects? How to weave? What…
Expand
1996
1996
Combining Algebraic Rewriting, Extensional Lambda Calculi, and Fixpoints
R. D. Cosmo
,
D. Kesner
Theoretical Computer Science
1996
Corpus ID: 12995661
1985
1985
Fixpoints and Program Looping: Reductions form the Propositional MU-Calculus into Propositional Dynamic Logics of Looping
Robert S. Streett
Logic of Programs
1985
Corpus ID: 13349148
The propositional mu-calculus is a propositional logic of programs which incorporates a least fixpoint operator and subsumes the…
Expand
1970
1970
Combinatory logic with discriminators
John T. Kearns
Journal of Symbolic Logic (JSL)
1970
Corpus ID: 12249270
In this paper, I present a modified and extended version of combinatory logic. Schönfinkel originated the study of combinatory…
Expand
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)
ACCEPT & CONTINUE