C.-H. L. Ong. Correspondence between operational and denotational semantics: the full abstraction problem for PCF. In D. M. Gabbay S. Abramsky and T. S. Maibaum, editors, Handbook of Logic in Computer Science (Vol. 4): Semantic Modelling, pages 269--356, Oxford, UK, 1995. Oxford University Press.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....languages, The author acknowledges the support of Oxford University Computing Laboratory particularly those with higher types, has proved to be a very subtle and difficult one. The famous Full Abstraction Problem for PCF , raised by Plotkin in 1977 and studied intensively ever since [8, 26, 29, 31], remained open until very recently, when a number of solutions emerged [1, 3, 22, 27, 28] One successful approach was via game semantics, a novel kind of model which includes more intensional information than traditional domain theoretic ones. The correspondence between the strategies used to ....

C.-H. L. Ong. Correspondence between operational and denotational semantics. In S. Abramsky, D. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, Vol 4, pages 269--356. Oxford University Press, 1995.

....model is shown to be fully abstract with respect to applicative simulation. This is, so far as we know, the first purely semantic construction of a fully abstract model for a reflexively typed sequential language. 1 Introduction Full Abstraction is a key concept in programming language semantics [9, 12, 23, 26]. The ingredients are as follows. We are given a language L, with an observational preorder on terms in L such that P Q means that every observable property of P is also satisfied by Q; and a denotational model MJ DeltaK. The model M is then said to be fully abstract with respect to if P ....

.... are present in the language, most notably higher order functions and recursion, the problem of achieving such a construction has proved to be very subtle and difficult; the most basic case is the well known Full Abstraction problem for PCF, which has been studied intensively for some 20 years [9, 18,23, 25]. In a previous paper, game semantics was used as the basis for a solution to this problem [4] namely, a description of the fully abstract model given completely independently of the syntax of PCF. This semantics can be seen as offering an analysis in the light of the results obtained in [1, ....

C.-H. L. Ong. Correspondence between operational and denotational semantics. In S. Abramsky, D. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, Vol 4, pages 269--356. Oxford University Press, 1995.

.... abstraction was coined by Robin Milner in [Mil75] In 1977 two seminal papers on the programming language PCF, by Milner and Plotkin, appeared in Theoretical Computer Science [Mil77, Plo77] These papers initiated an extensive body of work centering on the Full Abstraction problem for PCF (see [BCL86, Cur93, Ong95] for surveys) The importance of full abstraction for the semantics of programming languages is that it is one of the few quality filters we have. Specifically, it provides a clear criterion for assessing how definitive a semantic analysis of some language is. It must be admitted that to date the ....

C.-H. L. Ong. Correspondence between operational and denotational semantics: the full abstraction problem for PCF. In S. Abramsky, D. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 4, pages 270-- 356. Oxford University Press, 1995.

....of language is well understood, the problem of finding fully abstract models for sequential languages, particularly those with higher types, has proved to be a very subtle and difficult one. The famous Full Abstraction Problem for pcf , raised by Plotkin in 1977 and studied intensively ever since [5, 15, 18, 21], remained open until very recently, when a number of solutions emerged [1, 2, 13, 16, 17] One successful approach was via game semantics, a novel kind of model which includes more intensional information than traditional domain theoretic ones. The correspondence between the strategies used to ....

C. H. L. Ong. Correspondence between operational and denotational semantics: the full abstraction problem for PCF. Submitted to Handbook of logic in computer science volume 3, 1993.

....languages, The author acknowledges the support of Oxford University Computing Laboratory particularly those with higher types, has proved to be a very subtle and difficult one. The famous Full Abstraction Problem for PCF , raised by Plotkin in 1977 and studied intensively ever since [8, 26, 29, 31], remained open until very recently, when a number of solutions emerged [1, 3, 22, 27, 28] One successful approach was via game semantics, a novel kind of model which includes more intensional information than traditional domain theoretic ones. The correspondence between the strategies used to ....

C.-H. L. Ong. Correspondence between operational and denotational semantics. In S. Abramsky, D. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, Vol 4, pages 269--356. Oxford University Press, 1995.

....model is shown to be fully abstract with respect to applicative simulation. This is, so far as we know, the first purely semantic construction of a fully abstract model for a reflexively typed sequential language. 1 Introduction Full Abstraction is a key concept in programming language semantics [9, 12, 23, 26]. The ingredients are as follows. We are given a language L, with an observational preorder on terms in L such that P Q means that every observable property of P is also satisfied by Q; and a denotational model MJ DeltaK. The model M is then said to be fully abstract with respect to if ....

.... are present in the language, most notably higher order functions and recursion, the problem of achieving such a construction has proved to be very subtle and difficult; the most basic case is the well known Full Abstraction problem for PCF, which has been studied intensively for some 20 years [9, 18,23, 25]. In a previous paper, game semantics was used as the basis for a solution to this problem [4] namely, a description of the fully abstract model given completely independently of the syntax of PCF. This semantics can be seen as offering an analysis in the light of the results obtained in [1, ....

C.-H. L. Ong. Correspondence between operational and denotational semantics. In S. Abramsky, D. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, Vol 4, pages 269--356. Oxford University Press, 1995.

....methods based on a form of bisimilarity can support fixpoint induction. One advantage of the operational approach is that bisimilarity coincides exactly with contextual equivalence. The corresponding property of a denotational semantics full abstraction is notoriously hard to achieve (Ong 1994). 1 The earliest presentation of lazy lambda calculus appears to be Abramsky s thesis (1987, Chapter 6) in which he explains that the main results of Chapter 6 were obtained in the setting of Martin Lof s Domain Interpretation of his Type Theory, during and shortly after a visit to Chalmers in ....

Ong, C.-H. L. (1994, January). Correspondence between operational and denotational semantics: The full abstraction problem for PCF. Submitted to Handbook of Logic in Computer Science Volume 3, OUP 1994.

....in the rest of this section. 6. 1 Indistinguishability Two expressions exp 1 and exp 2 of type are indistinguishable if and only if for any context C[ of type unit with a hole of type we have that the evaluation of C[exp 1 ] terminates iff the evaluation of C[exp 2 ] terminates (cf. e.g. [Ong95]) One can always distinguish genuinely different values (such as 0 and 1, or true and false) in this way. The choice of unit as the result type for the distinguishing contexts is somewhat arbitrary, except that expressions of type unit are only distinguished by their termination behaviour. An ....

C.-H. L. Ong. Correspondence between operational and denotational semantics: The full abstraction problem for PCF. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, Vol. 4, pages 269--356. Oxford Univ. Press, 1995.

....another if it exhibits a smaller set of basic observables. 3. Consider the largest pre congruence over the language induced by the basic preorder. This paradigm has been the basis for assessing many semantics of sequential languages and is at the heart of the full abstraction problem, see e.g. [26]. Here, we aim at taking advantage of this paradigm also for studying models of concurrent systems and their equivalences. In this case, the choice of the basic observables is less obvious. It is well known that input output relations are not sufficient for describing the semantics of this class ....

C.-H.L. Ong. Correspondence between operational and denotational semantics: the full abstraction problem for PCF. Handbook of Logic in Computer Science, vol.4, S. Abramsky, D.M. Gabbay and T.S.E. Maibaum, ed., Oxford Science Publ., 1995.

....might use the denotational semantics to implement the language. In mathematical logic, one uses the concepts of soundness and completeness to relate a logic s proof system to its interpretation, and in semantics there are similar notions of soundness and adequacy to relate one semantics to another [12, 28]. A standard example is proving the soundness of a structural operational semantics to a denotational semantics: for program, P, and input, v, P; v) v 0 in the operational semantics implies P [ P ] v) v 0 in the denotational semantics. Adequacy is a form of inverse: if P [ P ] v) v ....

C.H.-L. Ong. Correspondence between operational and denotational semantics. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Computer Science, Vol. 4. Oxford Univ. Press, 1995.

....C[X] and for any program value n, if C[s] and C[t] are both programs and if C[s] n then C[t] n. The Full Abstraction Problem for pcf is concerned with the search for an abstract, syntaxindependent order fully abstract model of pcf. This problem has been studied intensively for over 15 years [Plo77, Mil77, Cur93, Ong95]. The next two sections set the scene: we give a racy overview of the category of arenas and innocent strategies in section 2, and sketch the fully abstract game interpretation of pcf in section 3. The reader is directed to [HO94] for a full account in which proofs of all results cited in the ....

C.-H. L. Ong. Correspondence between operational and denotational semantics. In S. Abramsky, D. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, Vol 4. Oxford Univ. Press, 1995. To appear.

No context found.

C.-H. L. Ong. Correspondence between operational and denotational semantics: the full abstraction problem for PCF. In D. M. Gabbay S. Abramsky and T. S. Maibaum, editors, Handbook of Logic in Computer Science (Vol. 4): Semantic Modelling, pages 269--356, Oxford, UK, 1995. Oxford University Press.

No context found.

C.-H. Luke Ong. Correspondence between operational and denotational semantics. In S. Abramsky, D. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, Vol 4, pages 269--356. Oxford University Press, 1995.

No context found.

Ong, L., Correspondence between operational and denotational semantics. Handbook of Logic in Computer Science, Vol 4, pp. 269-356, Oxford University Press.

No context found.

C.-H. L. Ong. Correspondence between operational and denotational semantics: the full abstraction problem for PCF. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 4, pages 269-356. cp, 1995.

No context found.

C.-H. L. Ong. Correspondence between Operational and Denotational Semantics: The Full Abstraction problem for PCF. To appear in S. Abramsky et. al., editors, Handbook of Theoretical Computer Science, volume 3. Oxford University Press.

No context found.

C.-H.L.Ong. Correspondence between Operational and Denotational Semantics: The Full Abstraction Problem for PCF. Handbook of Logic in Computer Science 3, Oxford University Press, 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC