This paper is concerned with the relationship between the computational and fixpoint semantics of nondeterministic recursive definitions
Summary. The text contains some schemes which allow elimination of defintions by recursion. MML Iden...
AbstractIn applicative theories the recursion theorem provides a term rec which solves recursive equ...
A theorem is presented which has applications in the numerical computation of fixed points of recurs...
AbstractThis paper is concerned with the existence and properties of various fixpoints of nondetermi...
This paper is concerned with the relationship between the computational and fixpoint semantics of no...
AbstractIn this paper, we investigate the structural properties of the set of fixpoints for the clas...
A general functorial framework for recursive definitions is presented in which simulation of a defin...
AbstractIn order to define semantics of non deterministic recursive programs we are led to consider ...
AbstractA general functorial framework for recursive definitions is presented in which simulation of...
AbstractAn expression such as ∀x(P(x)↔ϕ(P)), where P occurs in ϕ(P), does not always define P. When ...
The object of this paper is to study the mechanism of recursion in a simple, LISP-like programming l...
AbstractAn expression such as ∀x(P(x)↔ϕ(P)), where P occurs in ϕ(P), does not always define P. When ...
AbstractFor nondeterministic recursive equations over an arbitrary signature of function symbols inc...
AbstractThe classical method for constructing the least fixedpoint of a recursive definition is to g...
We show that the set of fixed-point combinators forms a recursively-enumerable subset of a larger se...
Summary. The text contains some schemes which allow elimination of defintions by recursion. MML Iden...
AbstractIn applicative theories the recursion theorem provides a term rec which solves recursive equ...
A theorem is presented which has applications in the numerical computation of fixed points of recurs...
AbstractThis paper is concerned with the existence and properties of various fixpoints of nondetermi...
This paper is concerned with the relationship between the computational and fixpoint semantics of no...
AbstractIn this paper, we investigate the structural properties of the set of fixpoints for the clas...
A general functorial framework for recursive definitions is presented in which simulation of a defin...
AbstractIn order to define semantics of non deterministic recursive programs we are led to consider ...
AbstractA general functorial framework for recursive definitions is presented in which simulation of...
AbstractAn expression such as ∀x(P(x)↔ϕ(P)), where P occurs in ϕ(P), does not always define P. When ...
The object of this paper is to study the mechanism of recursion in a simple, LISP-like programming l...
AbstractAn expression such as ∀x(P(x)↔ϕ(P)), where P occurs in ϕ(P), does not always define P. When ...
AbstractFor nondeterministic recursive equations over an arbitrary signature of function symbols inc...
AbstractThe classical method for constructing the least fixedpoint of a recursive definition is to g...
We show that the set of fixed-point combinators forms a recursively-enumerable subset of a larger se...
Summary. The text contains some schemes which allow elimination of defintions by recursion. MML Iden...
AbstractIn applicative theories the recursion theorem provides a term rec which solves recursive equ...
A theorem is presented which has applications in the numerical computation of fixed points of recurs...
DOI
Add to ORKG