The purpose of this paper is to begin the study of domain theory in a context that is also appropriate for semantic models of other aspects of computation, that is in cartesian closed categories with a natural numbers object. I show that if D is an internally ω-complete partial order with bottom in such a category, then the usual construction of least fixed point of an ω-continuous endomorphism can be internalized as an arrow from the object of ω-continuous endomorphisms of D (suitably defined) to D itself.
Recursive specifications of domains plays a crucial role in denotational semantics as developed by S...
International audienceFixed points of endofunctors play a central role in program semantics (initial...
The aim of this paper is to establish some Cartesian closed categories which are between the two Car...
AbstractThe purpose of this paper is to begin the study of domain theory in a context that is also a...
AbstractMost studies of fixed points involve their existence or construction. Our interest is in the...
AbstractThe paper addresses the question of when the least-fixed-point operator, in a cartesian-clos...
The paper addresses the question of when the least-fixed-point operator, in a cartesian closed categ...
AbstractThe fixed-point construction of Scott, giving a continuous lattice solution of equations X ≅...
AbstractWe construct cartesian closed extensions of concrete categories with special (topological) p...
AbstractWe investigate fixpoint operators for domain equations. It is routine to verify that if ever...
AbstractThis paper continues the study of the general theory, begun in [4], of semantic domains base...
AbstractIn this paper we show how the natural duality between the category CPOU of cpos and continuo...
The paper considers algebraic directed-complete partial orders with a semi-regular Scott topology, c...
Introduction Partial maps are naturally ordered according to their extent of definition. Constructi...
AbstractLet B be the closed term model of the λ-calculus in which terms with the same Böhm tree are ...
Recursive specifications of domains plays a crucial role in denotational semantics as developed by S...
International audienceFixed points of endofunctors play a central role in program semantics (initial...
The aim of this paper is to establish some Cartesian closed categories which are between the two Car...
AbstractThe purpose of this paper is to begin the study of domain theory in a context that is also a...
AbstractMost studies of fixed points involve their existence or construction. Our interest is in the...
AbstractThe paper addresses the question of when the least-fixed-point operator, in a cartesian-clos...
The paper addresses the question of when the least-fixed-point operator, in a cartesian closed categ...
AbstractThe fixed-point construction of Scott, giving a continuous lattice solution of equations X ≅...
AbstractWe construct cartesian closed extensions of concrete categories with special (topological) p...
AbstractWe investigate fixpoint operators for domain equations. It is routine to verify that if ever...
AbstractThis paper continues the study of the general theory, begun in [4], of semantic domains base...
AbstractIn this paper we show how the natural duality between the category CPOU of cpos and continuo...
The paper considers algebraic directed-complete partial orders with a semi-regular Scott topology, c...
Introduction Partial maps are naturally ordered according to their extent of definition. Constructi...
AbstractLet B be the closed term model of the λ-calculus in which terms with the same Böhm tree are ...
Recursive specifications of domains plays a crucial role in denotational semantics as developed by S...
International audienceFixed points of endofunctors play a central role in program semantics (initial...
The aim of this paper is to establish some Cartesian closed categories which are between the two Car...