Add to ORKGWe show that the set of fixed-point combinators forms a recursively-enumerable subset of a larger set of terms that is (A) not recursively enumerable, and (B) the terms of which are observationally equivalent to fixed-point combinators in any computable context
AbstractAn expression such as ∀x(P(x)↔ϕ(P)), where P occurs in ϕ(P), does not always define P. When ...
AbstractIn applicative theories the recursion theorem provides a term rec which solves recursive equ...
AbstractIn order to define semantics of non deterministic recursive programs we are led to consider ...
We show that the set of fixed-point combinators forms a recursively-enumerable subset of a larger se...
International audienceThe λ-calculus enjoys the property that each λ-term has at least one fixed poi...
AbstractIn this article we give some classes of fragments of weak combinatory logic and show that th...
AbstractWe consider certain radical versions of familiar combinators. Some are shown not to exist wh...
AbstractThis paper is concerned with the existence and properties of various fixpoints of nondetermi...
In this report, we establish that the use of an automated theorem- proving program to study deep que...
AbstractIn this paper, we investigate the structural properties of the set of fixpoints for the clas...
We show that recursive programs where variables range over finite domains can be effectively and eff...
AbstractThe paper generalizes the Ginsburg-Rice Schützenberger ALGOL-like fixed-point theorem showin...
Abstract Say you want to prove something about an infinite data-structure, such as a stream or an in...
This paper is concerned with the relationship between the computational and fixpoint semantics of no...
AbstractAn expression such as ∀x(P(x)↔ϕ(P)), where P occurs in ϕ(P), does not always define P. When ...
AbstractAn expression such as ∀x(P(x)↔ϕ(P)), where P occurs in ϕ(P), does not always define P. When ...
AbstractIn applicative theories the recursion theorem provides a term rec which solves recursive equ...
AbstractIn order to define semantics of non deterministic recursive programs we are led to consider ...
We show that the set of fixed-point combinators forms a recursively-enumerable subset of a larger se...
International audienceThe λ-calculus enjoys the property that each λ-term has at least one fixed poi...
AbstractIn this article we give some classes of fragments of weak combinatory logic and show that th...
AbstractWe consider certain radical versions of familiar combinators. Some are shown not to exist wh...
AbstractThis paper is concerned with the existence and properties of various fixpoints of nondetermi...
In this report, we establish that the use of an automated theorem- proving program to study deep que...
AbstractIn this paper, we investigate the structural properties of the set of fixpoints for the clas...
We show that recursive programs where variables range over finite domains can be effectively and eff...
AbstractThe paper generalizes the Ginsburg-Rice Schützenberger ALGOL-like fixed-point theorem showin...
Abstract Say you want to prove something about an infinite data-structure, such as a stream or an in...
This paper is concerned with the relationship between the computational and fixpoint semantics of no...
AbstractAn expression such as ∀x(P(x)↔ϕ(P)), where P occurs in ϕ(P), does not always define P. When ...
AbstractAn expression such as ∀x(P(x)↔ϕ(P)), where P occurs in ϕ(P), does not always define P. When ...
AbstractIn applicative theories the recursion theorem provides a term rec which solves recursive equ...
AbstractIn order to define semantics of non deterministic recursive programs we are led to consider ...