C.-H. L. Ong  Home/Search
Context Related
Links: ACM | comlab.ox.ac.uk/pu...rrespondence.ps.gz brics.dk/Activitie...rrespondence.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: comlab.ox.ac.uk/ou...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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... (Update)
Context of citations to this paper: More
...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...
Cited by: More
Many Cyclic Block Diagrams Do Not Need Parallel Semantics - Denckla, Mosterman (Correct)
Probability, Nondeterminism and Concurrency: Two Denotational.. - Varacca (2003) (Correct)
Processes and Games - Honda (2003) (Correct)
Similar documents (at the sentence level):
10.5%: Correspondence between operational and denotational semantics: the.. - Ong (1995) (Correct)
Active bibliography (related documents): More All
0.2: Hereditarily Sequential Functionals - Nickau (1994) (Correct)
0.2: Domains and Denotational Semantics: History, Accomplishments and.. - (Ed.) (1996) (Correct)
0.1: Sequential Functions on Indexed Domains and Full Abstraction.. - Brookes, Geva (1994) (Correct)
Similar documents based on text: More All
0.9: Full Abstraction for PCF - Abramsky, Jagadeesan, Malacaria (1996) (Correct)
0.4: Conservative Extensions of Polymorphic PCF - Akama (1996) (Correct)
0.4: Integration in Real PCF - Edalat, Escardó (1996) (Correct)
Related documents from co-citation: More All
14: Full abstraction for PCF - Abramsky, Jagadeesan et al. - 1994
9: LCF considered as a programming language (context) - Plotkin - 1977
9: Hereditarily sequential functionals - Nickau - 1994
BibTeX entry: (Update)
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. http://citeseer.ist.psu.edu/article/ong95correspondence.html More
@incollection{ ong95correspondence,
author = "C.-H. L. Ong",
title = "Correspondence between Operational and Denotational Semantics",
booktitle = "Handbook of Logic in Computer Science, Vol 4",
publisher = "Oxford University Press",
editor = "S. Abramsky and D. Gabbay and T. S. E. Maibaum",
pages = "269--356",
year = "1995",
url = "citeseer.ist.psu.edu/article/ong95correspondence.html" }
Citations (may not include all citations):419 A formulation of the simple theory of types (context) - Church - 1940 DBLP
359 Introduction to Higher Order Categorical Logic (context) - Lambek, Scott - 1986 ACM
283 Theoretical Computer Science (context) - Plotkin, language - 1977
258 A lattice-theoretical fixpoint theorem and its applications (context) - Tarski - 1955
224 Semantics of Programming Languages: Structures and Technique.. (context) - Gunter - 1992
146 A powerdomain construction (context) - Plotkin - 1976
141 Constructive mathematics and computer programming (context) - Martin-Lof - 1979 ACM
121 Intensional interpretation of functionals of finite type (context) - Tait - 1967
117 Semantic domains - Gunter, Scott - 1990 ACM DBLP
87 call-by-value and the lambda calculus (context) - Plotkin - 1975
56 Post-Graduate Lecture Notes in Advanced Domain Theory (context) - Plotkin, Tools et al. - 1981
49 Recursive functionals and quantifiers of finite types (context) - Kleene - 1959
49 Cambridge Mathematical Textbooks (context) - Davey, Priestley et al. - 1990
49 Recursive functionals and quantifiers of finite types II (context) - Kleene - 1963
46 revised edition (context) - Barendregt, Calculus - 1984
44 Uber eine bisher noch nicht benutzte Erweiterung des finiten.. (context) - Godel - 1958
35 Cambridge University Press (context) - Crole, Types - 1993
30 Information and Control (context) - Statman, the et al. - 1985
25 A type-theoretical alternative to cuch (context) - Scott - 1993
23 eles compl`etement ad (context) - Berry - 1979
22 Foundations of Recursion Theory (context) - Platek - 1966
18 Fully abstract models of typed lambda-calculus (context) - Milner - 1977
18 Provably recursive functionals of analysis: a consistency pr.. (context) - Spector - 1962
13 Full Abstraction and Semantic Equivalence (context) - Mulmuley - 1987 ACM
9 Observable algorithms on concrete data structures (context) - Curien - 1993 DBLP
7 A set-theoretical definition of application (context) - Plotkin - 1972
2 Fully abstract submodels of typed lambda calculus (context) - Mulmuley - 1986
2 Post-Graduate Lecture Notes (context) - Plotkin, partial - 1985
2 Kurt Godel Collected Works (context) - Godel - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.comlab.ox.ac.uk/oucl/users/luke.ong/publications.html): More
A Curry-Howard foundation for functional computation with control - Ong, Stewart (1997) (Correct)
Non-Determinism in a Functional Setting (Extended Abstract) - Ong (1993) (Correct)
Games Models of Untyped lambda-Calculus - Ker, Nickau, Ong (1998) (Correct)
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