Samson Abramsky, Guy McCusker  Home/Search
Context Related
| users.comlab.ox.ac.uk/g...passive.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: users.comlab.ox.ac.uk/gu...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A fully abstract games model of Reynolds' Idealized Algol is described. (Update)
Context of citations to this paper: More
...the notion of observables as defined in Example 3.1. iii) The third preorder (the superscript s is for substitution) was studied in [4] in the context of the lazy k calculus. We could have defined (and similarly for the other two preorders) as: for all values but this is...
...strategies. Remarkably, there is a precise correspondence between the syntactic and semantic squares, as shown in a series of papers [4,6,8,22]. For example, relaxing the constraint of innocence allows local state to be modelled, while relaxing bracketing allows control G i G G...
Cited by: More
Games in the Semantics of Programming Languages - An Elementary.. - Jürjens (1999) (Correct)
On Semantic and Type-Theoretic - Aspects Of Polynomial-Time (Correct)
Semantics: - An Guy Mccusker (Correct)
Similar documents (at the sentence level): More
36.5%: Linearity, Sharing and State: a fully abstract game.. - Abramsky, McCusker (1997) (Correct)
34.6%: Linearity, Sharing and State: a fully game semantics for.. - Abramsky (Correct)
11.7%: Game Semantics - Abramsky, McCusker (1999) (Correct)
Active bibliography (related documents): More All
1.1: Full Abstraction for Idealized Algol with Passive Expressions - Abramsky, McCusker (1998) (Correct)
0.4: Call-by-Value Games - Abramsky, McCusker (1997) (Correct)
0.4: A Fully Game Semantics for General References - Abramsky, Honda, McCusker (Correct)
Similar documents based on text: More All
0.8: A Fully Abstract Game Semantics for Finite Nondeterminism - Harmer, McCusker (1999) (Correct)
0.7: Note on Algol and Conservatively Extending Functional Programming - O'Hearn (1995) (Correct)
0.7: Reasoning about Idealized ALGOL Using Regular Languages - Ghica, McCusker (2000) (Correct)
Related documents from co-citation: More All
17: Full abstraction for functional languages with control - Laird - 1997
15: sharing and state: a fully abstract game semantics for Idealized Algol with acti.. (context) - Abramsky, McCusker - 1996
13: Games and full completeness for multiplicative linear logic - Abramsky, Jagadeesan - 1994
BibTeX entry: (Update)
S. Abramsky and G. McCusker. Full abstraction for Idealized Algol with passive expressions. To appear in Theoretical Computer Science, 1998. http://citeseer.ist.psu.edu/abramsky98full.html More
@article{ abramsky99full,
author = "Samson Abramsky and Guy McCusker",
title = "Full abstraction for {Idealized Algol} with passive expressions",
journal = "Theoretical Computer Science",
volume = "227",
number = "1--2",
pages = "3--42",
year = "1999",
url = "citeseer.ist.psu.edu/abramsky98full.html" }
Citations (may not include all citations):359 Introduction to Higher Order Categorical Logic (context) - Lambek, Scott - 1986
322 volume 92 of Lecture Notes in Computer Science (context) - Milner, of et al. - 1980
306 LCF considered as a programming language (context) - Plotkin - 1977
194 The Formal Semantics of Programming Languages (context) - Winskel - 1993
175 Games and full completeness for multiplicative linear logic - Abramsky, Jagadeesan - 1994
156 Basic Concepts of Enriched Category Theory (context) - Kelly - 1982
132 Syntactic control of interference (context) - Reynolds - 1978
131 The essence of Algol (context) - Reynolds - 1981
97 Mathematical Structures in Computer Science (context) - Milner, processes - 1992
80 Handbook of Categorical Algebra (context) - Borceux - 1994
72 Fully abstract models of typed lambda-calculi (context) - Milner - 1977
66 What is a categorical model of intuitionistic linear logic - Bierman - 1995
54 Games and Full Abstraction for a Functional Metalanguage wit.. (context) - McCusker - 1998
51 sharing and state: a fully abstract game semantics for Ideal.. (context) - Abramsky, McCusker
51 sharing and state: a fully abstract game semantics for Ideal.. (context) - Abramsky, McCusker - 1996
51 autonomous categories and cofree coalgebras (context) - Seely - 1987
48 Hereditarily sequential functionals - Nickau - 1994
45 Algol-like Languages (context) - O'Hearn, Tennent - 1997
35 Game semantics and abstract machines (context) - Danos, Herbelin et al.
31 Names and Higher-Order Functions - Stark - 1994
31 Games and full abstraction for FPC - McCusker
28 Reasoning about local variables with operationally-based log.. - Pitts
23 Games and full abstraction for the lazy -calculus (context) - Abramsky, McCusker - 1995
21 functor categories and block structure (context) - Oles - 1985
20 A fully abstract domain model for the -calculus (context) - Stark
20 Full Abstraction for the Second Order Subset of an ALGOL-lik.. - Sieber - 1995
19 Axioms for full abstraction and full completeness (context) - Abramsky
19 Parametricity and local variables - O'Hearn, Tennent - 1995
17 A fully-abstract model for the - calculus (context) - Fiore, Moggi et al.
15 interference and the Yoneda embedding (context) - O'Hearn, Reddy - 1995
12 Finitary PCF is not decidable - Loader - 1996
12 Denotational semantics (context) - Tennent - 1994
10 Global state considered unnecessary: Object-based semantics .. (context) - Reddy - 1996
9 Accepted for publication in Information and Computation (context) - Abramsky, Jagadeesan et al. - 1997
6 Accepted for publication in Information and Computation (context) - Hyland, Ong et al. - 1997
5 a mathematical model of computing agents (context) - Milner - 1973
1 Note on Algol and conservatively extending functional progra.. (context) - O'Hearn - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://users.comlab.ox.ac.uk/guy.mccusker/papers.html): More
Games and Full Abstraction for the Lazy lambda-calculus - Abramsky, McCusker (1995) (Correct)
Full Abstraction by Translation - McCusker (1996) (Correct)
A Fully Abstract Game Semantics for Finite Nondeterminism - Harmer, McCusker (1999) (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