Abstract
This chapter introduces a representation of the category of SFP domains. It uses structures similar to but more general than Scott’s information systems. Distilled from Gentzen’s sequent calculi, a basic structure called a sequent structure is produced. Sequent structures determine a major part of the axioms of information systems. A category of special kind of sequent structures called the strongly finite ones is shown to be equivalent to the category of SFP domains. Constructions like the Plotkin power domain and the function space are given, as well as a complete partial order of such structures to give solutions to recursively defined systems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media New York
About this chapter
Cite this chapter
Zhang, GQ. (1991). A Representation of SFP. In: Logic of Domains. Progress in Theoretical Computer Science. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0445-9_3
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0445-9_3
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6763-8
Online ISBN: 978-1-4612-0445-9
eBook Packages: Springer Book Archive