Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria  Home/Search
Context Related
| di.uminho.pt/ftp/p...amsky.gfapcf.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: di.uminho.pt/ftp/pub/DI/F...clics (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ion for PCF: Preliminary Announcement Samson Abramsky, Radha Jagadeesan and Pasquale Malacaria July 23, 1993 The Full Abstraction Problem for PCF [14, 12, 4, 8] is one of the longest-standing problems in the semantics of programming languages. There is quite widespread agreement that it is one of the most difficult; there is much less agreement as to what exactly the problem is, or more particularly as to the precise criteria for a solution. The usual formulation is that one wants a "semantic... (Update)
Context of citations to this paper: More
.... were obtained subsequent to the full abstraction results reported by Abramsky, Jagadeesan and Malacaria (Abramsky et al. 1994; Abramsky et al. 1993) and Hyland and Ong (Hyland and Ong, 1993) using games semantics. The games semantics approaches the full abstraction problem...
.... suitable for sequential languages like VPCF (see, e.g. 3, 4, 6] has been open for many years (although recent announcements [2, 15, 26] suggest that a categorical framework can be constructed) Moreover, by defining call by value monads over models, we can state and...
Cited by: More
Isolating Side Effects in Sequential Languages - Riecke, Viswanathan (1995) (Correct)
Kripke Logical Relations and PCF - O'Hearn, Riecke (1995) (Correct)
Similar documents (at the sentence level):
41.7%: Full Abstraction for PCF (Extended Abstract) - Abramsky, Malacaria, Jagadeesan (Correct)
26.8%: Full Abstraction for PCF - Abramsky, Jagadeesan, Malacaria (1995) (Correct)
Active bibliography (related documents): More All
0.4: Correspondence between operational and denotational semantics: the.. - Ong (1995) (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.7: Games and Sequential Algorithms - Laird (2001) (Correct)
0.5: Sequentiality and the π-Calculus - Berger, Honda, Yoshida (2001) (Correct)
0.3: Full Abstraction for Functional Languages with Control - Laird (1997) (Correct)
Related documents from co-citation: More All
4: Syntactic control of interference (context) - Reynolds - 1989
3: Full Abstraction for Sequential Languages: the State of the Art (context) - Berry, Curien et al. - 1985
3: LCF considered as a programming language (context) - Plotkin - 1977
BibTeX entry: (Update)
Abramsky, S., Jagadeesan, R., and Malacaria, P. (1993). Games and full abstraction for PCF: preliminary announcement. Communicated to the TYPES electronic mail list, July 23, 1993. http://citeseer.ist.psu.edu/abramsky93games.html More
@misc{ abramsky93games,
author = "Abramsky, S. and R. Jagadeesan and P. Malacaria",
title = "{Games and full abstraction for {PCF}}",
month = "July",
howpublished = "Manuscript",
year = "1993",
url = "citeseer.ist.psu.edu/abramsky93games.html" }
Citations (may not include all citations):306 LCF considered as a programming language (context) - Plotkin - 1977
175 Games and Full Completeness for Multiplicative Linear Logic - Abramsky, Jagadeesan - 1992
72 Fully Abstract Models for Typed Lambda Calculi (context) - Milner - 1977
65 Sequential Algorithms and Functional Programming (context) - Curien, Combinators - 1986
61 Sequential algorithms on concrete data structures (context) - Berry, Curien - 1982
47 Fully Abstract Models of Programming Languages (context) - Stoughton - 1988
38 Full Abstraction for Sequential Languages: the State of the .. (context) - Berry, Curien et al. - 1985
18 Observable Sequentiality and Full Abstraction - Cartwright, Felleisen - 1992
16 Projecting sequential algorithms on the strongly stable func.. - Ehrhard - 1993
16 Studying the Fully Abstract Model of PCF within its Continuo.. (context) - Jung, Stoughton - 1993
13 Full Abstraction and Semantic Equivalence (context) - Mulmuley - 1987
8 Sequentiality and Full Abstraction (context) - Curien - 1992
7 Extensional embedding of a strongly stable model of PCF (context) - Bucciarelli, Ehrhard - 1991
6 Observable sequential algorithms on concrete data structures (context) - Curien - 1992
5 Modeles completement adequats et stable de lambda-calculs ty.. (context) - Berry - 1979
Documents on the same site (http://www.di.uminho.pt/ftp/pub/DI/Fundamentos/Papers/mirror-ImperialCollege/AbramskyS/clics): More
Schematic Consequence - Aczel (1992) (Correct)
Parametricity as Isomorphism - Robinson (1993) (Correct)
A Note on SDT in Filter Spaces - Moggi (1993) (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