Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,035,447 papers from all fields of science
Search
Sign In
Create Free Account
Least fixed point
Known as:
Greatest fixpoint
, Least fixpoint
, LFP
Expand
In order theory, a branch of mathematics, the least fixed point (lfp or LFP, sometimes also smallest fixed point) of a function from a partially…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
20 relations
Computer science
Context-free grammar
Corecursion
Denotational semantics
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2004
2004
Exploring the Regular Tree Types
Peter Morris
,
Thorsten Altenkirch
,
Conor McBride
Types for Proofs and Programs
2004
Corpus ID: 6141021
In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and…
Expand
Highly Cited
2003
Highly Cited
2003
Effects of process parameters on heterologous protein production in Aspergillus niger fermentation
Liping Wang
,
D. Ridgway
,
T. Gu
,
M. Moo-young
2003
Corpus ID: 45578075
Filamentous fungi such as Aspergillus niger are attractive hosts for recombinant DNA technology because of their ability to…
Expand
Highly Cited
2002
Highly Cited
2002
Generic framing procedure (GFP): the catalyst for efficient data over transport
P. Bonenfant
,
A. R. Moral
IEEE Communications Magazine
2002
Corpus ID: 62554896
We discuss the generic framing procedure (GFP) in the context of emerging nontraditional data over transport applications…
Expand
Review
2001
Review
2001
Security for Mobility
H. R. Nielson
,
F. Nielson
,
Mikael Buchholtz
Foundations of Security Analysis and Design
2001
Corpus ID: 26378404
We show how to use static analysis to provide information about security issues related to mobility. First the syntax and…
Expand
2000
2000
Axiomatizing the Least Fixed Point Operation and Binary Supremum
Z. Ésik
Annual Conference for Computer Science Logic
2000
Corpus ID: 27868232
The equational properties of the least fixed point operation on (ω-)continuous functions on (ω-)complete partially ordered sets…
Expand
Highly Cited
1998
Highly Cited
1998
Fixed-point logics on planar graphs
Martin Grohe
Proceedings. Thirteenth Annual IEEE Symposium on…
1998
Corpus ID: 15050011
We study the expressive power of inflationary fixed-point logic IFP and inflationary fixed-point logic with counting IFP+C on…
Expand
Highly Cited
1989
Highly Cited
1989
Temporal logic programming is complete and expressive
M. Baudinet
ACM-SIGACT Symposium on Principles of Programming…
1989
Corpus ID: 14926049
This paper addresses semantic and expressiveness issues for temporal logic programming and in particular for the TEMPLOG language…
Expand
1988
1988
Moving selections into linear least fixpoint queries
R. Agrawal
,
Premkumar T. Devanbu
Proceedings. Fourth International Conference on…
1988
Corpus ID: 1991041
A selection transposition algorithm is presented that allows selections that are conjunctions of predicates of the form 'column…
Expand
Highly Cited
1987
Highly Cited
1987
Skolem Normal Forms Concerning the Least Fixpoint
E. Dahlhaus
Computation Theory and Logic
1987
Corpus ID: 27988626
1983
1983
Synthesizing Least Fixed Point Queries Into Non-Recursive Iterative Programs
S. Naqvi
,
L. Henschen
International Joint Conference on Artificial…
1983
Corpus ID: 9135315
An algorithm is presented which takes a least fixed point query expressed by a basis and inductive step and transforms it into a…
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