Notions of computation and monads
Information and Computation
New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Handbook of logic in computer science (vol. 3)
Axiomatic domain theory in categories of partial maps
Axiomatic domain theory in categories of partial maps
Linear Lambda-Calculus and Categorial Models Revisited
CSL '92 Selected Papers from the Workshop on Computer Science Logic
CTCS '95 Proceedings of the 6th International Conference on Category Theory and Computer Science
Theoretical Computer Science - Domains
On an open problem of Amadio and Curien: the finite antichain condition
Information and Computation
On an open problem of Amadio and Curien: The finite antichain condition
Information and Computation
| Hi-index | 0.00 |
Domain-theoretic categories are axiomatised by means of categorical non-order-theoretic requirements on a cartesian closed category equipped with a commutative monad. In this paper we prove an enrichment theorem showing that every axiomatic domain-theoretic category can be endowed with an intensional notion of approximation, the path relation, with respect to which the category Cpo-enriches.Our analysis suggests more liberal notions of domains. In particular, we present a category where the path order is not ω-complete, but in which the constructions of domain theory (such as, for example, the existence of uniform fixed-point operators and the solution of domain equations) are available.