Factorisation systems on domains
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.
scientific article; zbMATH DE number 1347950