Factorisation systems on domains
type: Item
instance of: scholarly article
title: Factorisation systems on domains
zbMATH Open document ID: 0951.06007
DOI: 10.1023/A:1008644319842
author: Mathias Kegelmann
published in: Applied Categorical Structures
publication date: 2000-12-18T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 06B35
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68N30
Mathematics Subject Classification ID: 18D15
zbMATH DE Number: 1347950
zbMATH Keywords: domain theory
zbMATH Keywords: factorisation systems
zbMATH Keywords: stable domains
zbMATH Keywords: Cartesian closed categories
zbMATH Keywords: continuous domains
zbMATH Keywords: bilimits
MaRDI profile type: Publication
full work available at URL: a:1008644319842
OpenAlex ID: W1540684660
description: scientific article; zbMATH DE number 1347950