Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,110,155 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.
2012
2012
Logical Relations for PCF
Peter Gammie
Arch. Formal Proofs
2012
Corpus ID: 6414562
We apply Andy Pitts’s methods of defining relations over domains to several classical results in the literature. We show that the…
Expand
2010
2010
Generic record combinators with static type checking
W. Jeltsch
ACM-SIGPLAN International Conference on…
2010
Corpus ID: 1728235
Common record systems only provide access to individual record fields. However, it is often useful to have generic record…
Expand
2005
2005
Data wordlength optimization for FPGA synthesis
Nicolas Hervé
,
Daniel Ménard
,
Olivier Sentieys
IEEE Workshop on Signal Processing Systems Design…
2005
Corpus ID: 18318259
Field programmable gate arrays (FPGAs) are now considered as a real alternative for digital signal processing (DSP) applications…
Expand
2005
2005
Type-specialized serialization with sharing
M. Elsman
Symposium on Trends in Functional Programming
2005
Corpus ID: 9480075
In this paper we present an implementation of a Standard ML combinator library for serializing and deserializing data structures…
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
2000
2000
Gödelization in the lambda calculus
M. Goldberg
Information Processing Letters
2000
Corpus ID: 12186607
1993
1993
Incorporating Generalized Quantifiers and the Least Fixed Point Operator
I. A. Stewart
Annual Conference for Computer Science Logic
1993
Corpus ID: 10005736
We extend first-order logic with successor using the least fixed point operator and the Hamiltonian path generalized quantifier…
Expand
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