Abstract
One natural way to generalise domain theory is to replace partially ordered sets by categories. This kind of generalisation has recently found application in the study of concurrency. An outline is given of the elegant mathematical foundations that have been developed. This is specialised to give a construction of cartesian closed categories of domains, which throws light on standard presentations of domain theory.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Effectful semantics in bicategories: strong, commutative, and concurrent pseudomonads;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. Monoidal Kleisli bicategories and the arithmetic product of coloured symmetric sequences;Documenta Mathematica;2024-05-08
3. Making Concurrency Functional;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
4. Distributive Laws for Relative Monads;Applied Categorical Structures;2023-04
5. Towards a homotopy domain theory;Archive for Mathematical Logic;2022-11-04