Loading...
Please wait, while we are loading the content...
A Representation Result for Free Cocompletions
| Content Provider | Semantic Scholar |
|---|---|
| Author | Power, John Cattani, Gian Luca Winskel, Glynn |
| Copyright Year | 1998 |
| Abstract | Given a class F of weights, one can consider the construction that takes a small category C to the free cocompletion of C under weighted colimits, for which the weight lies in F . Provided these free F cocompletions are small, this construction generates a 2-monad on Cat, or more generally on V-Cat for monoidal biclosed complete and cocomplete V. We develop the notion of a dense 2-monad on V-Cat and characterise free F -cocompletions by dense KZ-monads on V-Cat. We prove various corollaries about the structure of such 2-monads and their Kleisli 2-categories, as needed for the use of open maps in giving an axiomatic study of bisimulation in concurrency. This requires the introduction of the concept of a pseudo-commutativity for a strong 2-monad on a symmetric monoidal 2-category, and a characterisation of it in terms of structure on the Kleisli 2-category. ∗This work is supported by EPSRC grant GR/J84205: Frameworks for programming language semantics and logic. †Research carried out while this author was at BRICS. ‡Basic Research in Computer Science, A Centre of the Danish National Research Foundation. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://tidsskrift.dk/brics/article/download/19427/17048 |
| Alternate Webpage(s) | http://www.brics.dk//RS/98/21/BRICS-RS-98-21.pdf |
| Alternate Webpage(s) | http://www.brics.dk/RS/98/21/BRICS-RS-98-21.pdf |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Bisimulation Computer science Concurrency (computer science) Programming Languages Pseudo brand of pseudoephedrine Semantics (computer science) Weight |
| Content Type | Text |
| Resource Type | Article |
