Factorisation systems on domains
From MaRDI portal
Domain Theory aims to model computer programming languages. To model a typed programming language a Cartesain closed category is needed. The classical examples are Scott-domains with continuous functions and Berry's DI-domains with stable functions. In this paper, the author presents a Cartesian closed category of continuous domains containing the classical examples above. He furthermore shows that the category is closed with respect to bilimits and that there is an algebraic and a generalised topological description of its morphisms.
Recommendations
Cited in
(5)- scientific article; zbMATH DE number 2125649 (Why is no real title available?)
- scientific article; zbMATH DE number 1310565 (Why is no real title available?)
- scientific article; zbMATH DE number 1559386 (Why is no real title available?)
- Continuous domains and their information system representation as logical systems
- scientific article; zbMATH DE number 956831 (Why is no real title available?)
This page was built for publication: Factorisation systems on domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306711)