Theoretical Computer Science
Computational interpretations of linear logic
Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
The largest cartesian closed category of stable domains
Theoretical Computer Science
Domains and lambda-calculi
Stable Models of Typed lambda-Calculi
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
On the Largest Cartesian Closed Category of Stable Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
The aim of this paper is to establish some Cartesian closed categories which are between the two Cartesian closed categories: SLP (the category of L-domains and stable functions) and DI (the full subcategory of SLP whose objects are all dI-domains). First we show that the exponentials of every full subcategory of SLP are exactly the spaces of stable functions. Then we prove that the full subcategories SDMBC, SDCBC and SDABC of SLP which contain DI are all Cartesian closed, where the objects of SDMBC (resp., SDCBC, SDABC) are all distributive bc-domains which are meet-continuous (resp., continuous, algebraic). We also obtain many non-Cartesian closed full subcategories of SLP and present some reflective relations between those categories concerned.