A Categorical Powerdomain Construction
Loading...
No Access Until
Permanent Link(s)
Collections
Other Titles
Authors
Abstract
The class of countably based bifinites (SFP objects) is the usual mathematical framework for carrying out the constructions that arise in the semantics of programming languages. However, A. Jung showed that the construction used to define the domain-theoretic semantics of polymorphic lambda calculus, is not closed on this category. This motivates the search for a suitable category that is closed under all the constructions used in programming language semantics. T. Coquand developed categories of embeddings as a categorical generalization of the domain-theoretic structures used to give semantics of polymorphism. In this paper, we present a category- theoretic powerdomain construction that is closed on the (extensional) categories of embeddings. The construction is shown to have universal properties that resemble the universal properties of the Plotkin powerdomain.
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
1989-11
Publisher
Cornell University
Keywords
computer science; technical report
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1056
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report