| Автор | ADÁMEK, JIŘÍ |
| Дата выпуска | 1997 |
| dc.description | Algebraic CPOs naturally generalize to finitely accessible categories, and Scott domains (i.e., consistently complete algebraic CPOs) then correspond to what we call Scott-complete categories: finitely accessible, consistently (co-)complete categories. We prove that the category SCC of all Scott-complete categories and all continuous functors is cartesian closed and provides fixed points for a large collection of endofunctors. Thus, SCC can serve as a basis for semantics of computer languages. |
| Издатель | Cambridge University Press |
| Название | A categorical generalization of Scott domains |
| Electronic ISSN | 1469-8072 |
| Print ISSN | 0960-1295 |
| Журнал | Mathematical Structures in Computer Science |
| Том | 7 |
| Первая страница | 419 |
| Последняя страница | 443 |
| Аффилиация | ADÁMEK JIŘÍ; Technical University of Braunschweig |
| Выпуск | 5 |
