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.KeywordsProof SystemType ExpressionRelative CompletenessDenotational SemanticType ConstructionThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
