Abstract
This chapter introduces a logic of SFP. The logical framework lays the foundation for the derivation, from a denotational semantics, a sound and complete proof system for a programming language. Given a programming language, the domain for its denotational semantics specifies a type. That type allows the identification, in a uniform manner, an assertion language and a proof system from the general framework. Any proof system so derived is guaranteed to agree with the denotational semantics in the sense described in Section 1.4.
This is a preview of subscription content, log in via an institution to check access.
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 Logic 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_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0445-9_4
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