AbstractThe fixed-point construction of Scott, giving a continuous lattice solution of equations X ≅ T(X) where T is an endofunctor on the category of continuous lattices, is extended to categories enriched by partial orderings on the morphism sets. The result allows data structures to be realized not only in the category of continuous lattices, but also in the category of complete lattices, in the category of complete partial orders, or in any of several related categories of partial orders
AbstractScott discovered his domain-theoretic models of the λ-calculus, isomorphic to their function...
AbstractA category K (of data types) is called algebraically ω-complete provided that for each endof...
AbstractWe investigate fixpoint operators for domain equations. It is routine to verify that if ever...
AbstractThe fixed-point construction of Scott, giving a continuous lattice solution of equations X ≅...
A number of lattice-theoretic fixed point rules are generalised to category theory and applied to th...
ABSTRACT. Generalizing the fact that Scott’s continuous lattices form the equational hull of the cla...
For a finite ground set X, this paper investigates properties of the set of orders with the fixed po...
The purpose of this paper is to begin the study of domain theory in a context that is also appropria...
AbstractThe purpose of this paper is to begin the study of domain theory in a context that is also a...
Recursive specifications of domains plays a crucial role in denotational semantics as developed by S...
janr,turi9 Abstract. Canonical solutions of domain equations are shown to be final coal-gebras, not ...
AbstractThe main result of this paper is a generalization of the Mezei–Wright theorem, a result on s...
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operato...
Tarski\u27s fixed point theorem for complete lattices is a fundamental theorem in lattice theory and...
Abstract. Domains with Scott topologies are frequently defined as sets of fixed points of retraction...
AbstractScott discovered his domain-theoretic models of the λ-calculus, isomorphic to their function...
AbstractA category K (of data types) is called algebraically ω-complete provided that for each endof...
AbstractWe investigate fixpoint operators for domain equations. It is routine to verify that if ever...
AbstractThe fixed-point construction of Scott, giving a continuous lattice solution of equations X ≅...
A number of lattice-theoretic fixed point rules are generalised to category theory and applied to th...
ABSTRACT. Generalizing the fact that Scott’s continuous lattices form the equational hull of the cla...
For a finite ground set X, this paper investigates properties of the set of orders with the fixed po...
The purpose of this paper is to begin the study of domain theory in a context that is also appropria...
AbstractThe purpose of this paper is to begin the study of domain theory in a context that is also a...
Recursive specifications of domains plays a crucial role in denotational semantics as developed by S...
janr,turi9 Abstract. Canonical solutions of domain equations are shown to be final coal-gebras, not ...
AbstractThe main result of this paper is a generalization of the Mezei–Wright theorem, a result on s...
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operato...
Tarski\u27s fixed point theorem for complete lattices is a fundamental theorem in lattice theory and...
Abstract. Domains with Scott topologies are frequently defined as sets of fixed points of retraction...
AbstractScott discovered his domain-theoretic models of the λ-calculus, isomorphic to their function...
AbstractA category K (of data types) is called algebraically ω-complete provided that for each endof...
AbstractWe investigate fixpoint operators for domain equations. It is routine to verify that if ever...