Skip to main content
×
Home
    • Aa
    • Aa

On categories generalizing universal domains

  • VĚRA TRNKOVÁ (a1) and JIŘÍ VELEBIL (a2)
    • Published online: 01 April 1999
Abstract

Scott domains, originated and commonly used in formal semantics of computer languages, were generalized by J. Adámek to Scott complete categories. We prove that the categorical counterpart of the result of D. Scott – the existence of a countable based Scott domain universal with respect to all countably based Scott domains – is no longer valid for the categorical generalization. However, all obstacles disappear if the notion of the Scott complete category is weakened to a categorical counterpart of bifinite domains.

Copyright
Footnotes
Hide All
Both authors gratefully acknowledge the financial support of the Grant Agency of the Czech Republic under the grant No. 201/96/0119.
Footnotes
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 4 *
Loading metrics...

Abstract views

Total abstract views: 50 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 23rd September 2017. This data will be updated every 24 hours.