Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-25T02:39:07.810Z Has data issue: false hasContentIssue false
  • English
  • Français

A categorical generalization of Scott domains

Published online by Cambridge University Press:  01 October 1997

JIŘÍ ADÁMEK
JIŘÍ ADÁMEK
Affiliation:
Technical University of Braunschweig, P.O. Box 3329, 38023 Braunschweig, Germany. Email: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 7 , Issue 5 , October 1997 , pp. 419 - 443
Copyright
1997 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)