Results 1 
2 of
2
Correspondence between Operational and Denotational Semantics
 Handbook of Logic in Computer Science
, 1995
"... This course introduces the operational and denotational semantics of PCF and examines the relationship between the two. Topics: Syntax and operational semantics of PCF, Activity Lemma, undefinability of parallel or; Context Lemma (first principles proof) and proof by logical relations Denotational ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
This course introduces the operational and denotational semantics of PCF and examines the relationship between the two. Topics: Syntax and operational semantics of PCF, Activity Lemma, undefinability of parallel or; Context Lemma (first principles proof) and proof by logical relations Denotational semantics of PCF induced by an interpretation; (standard) Scott model, adequacy, weak adequacy and its proof (by a computability predicate) Domain Theory up to SFP and Scott domains; non full abstraction of the standard model, definability of compact elements and full abstraction for PCFP (PCF + parallel or), properties of orderextensional (continuous) models of PCF, Milner's model and Mulmuley's construction (excluding proofs) Additional topics (time permitting): results on pure simplytyped lambda calculus, Friedman 's Completeness Theorem, minimal model, logical relations and definability, undecidability of lambda definability (excluding proof), dIdomains and stable functions Homepa...
Sequential Functions on Indexed Domains and Full Abstraction for a Sublanguage of PCF
 Proceedings of the 8th Annual Symposium on Mathematical Foundations of Program Semantics, volume 802 of Lecture Notes in Computer Science
, 1994
"... ion for a Sublanguage of PCF Stephen Brookes Shai Geva April 1993 CMUCS93163 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 To appear in Proceedings of Mathematical Foundations of Programming Semantics, New Orleans, 1993 (Springer Verlag Lecture Notes in Computer Sc ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
ion for a Sublanguage of PCF Stephen Brookes Shai Geva April 1993 CMUCS93163 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 To appear in Proceedings of Mathematical Foundations of Programming Semantics, New Orleans, 1993 (Springer Verlag Lecture Notes in Computer Science). Abstract We present a general semantic framework of sequential functions on domains equipped with a parameterized notion of incremental sequential computation. Under the simplifying assumption that computation over function spaces proceeds by successive application to constants, we construct a sequential semantic model for a nontrivial sublanguage of PCF with a corresponding syntactic restriction  that variables of function type may only be applied to closed terms. We show that the model is fully abstract for the sublanguage, with respect to the usual notion of program behavior. This research was supported in part by National Science Foundation grant CCR9006064. The views and...