Samson Abramsky  Home/Search
Context
Related
| web.comlab.ox.ac.uk/ouc...mdorf01.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: web.comlab.ox.ac.uk/oucl/work/... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Introduction SAMSON ABRAMSKY (samson@comlab.ox.ac.uk) Oxford University Computing Laboratory 1. Introduction Game Semantics has emerged as a powerful paradigm for giving semantics to a variety of programming languages and logical systems. It has been used to construct the first syntax-independent fully abstract models for a spectrum of programming languages ranging from purely functional languages to languages with non-functional features such as control operators and locally-scoped... (Update)
Similar documents (at the sentence level):
11.2%: Game Semantics - Abramsky, McCusker (1999) (Correct)
Active bibliography (related documents): More All
1.1: Observational equivalence of 3rd-order Idealized Algol is decidable - Ong (Correct)
0.8: The Regular-Language Semantics of First-Order Idealized ALGOL - Ghica, McCusker (Correct)
0.8: The Regular-Language Semantics of Second-Order Idealized ALGOL - Ghica, McCusker (2003) (Correct)
Similar documents based on text: More All
0.8: Reasoning about Idealized ALGOL Using Regular Languages - Ghica, McCusker (2000) (Correct)
0.7: Regular-Language Semantics for a Call-by-Value Programming Language - Ghica (2001) (Correct)
0.7: A Fully Abstract Game Semantics for Finite Nondeterminism - Harmer, McCusker (1999) (Correct)
BibTeX entry: (Update)
@misc{ abramsky-algorithmic,
author = "Samson Abramsky",
title = "Algorithmic Game Semantics",
url = "citeseer.ist.psu.edu/505714.html" }
Citations (may not include all citations):2732 Communicating Sequential Processes (context) - Hoare - 1985
1933 Communication and Concurrency (context) - Milner - 1989
1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
815 Abstract interpretation: A unified lattice model for static .. (context) - Cousot, Cousot - 1977
346 Denotational Semantics: The Scott-Strachey Approach to Progr.. (context) - Stoy - 1979
270 Bandera: Extracting finite-state models from java source cod.. - Corbett
194 The Formal Semantics of Programming Languages (context) - Winskel - 1993
175 Games and full completeness for multiplicative linear logic - Abramsky, Jagadeesan - 1994
133 Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
131 The essence of Algol (context) - Reynolds - 1978
129 Precise interprocedural dataflow analysis via graph reachabi.. - Reps, Horowitz et al. - 1995
97 Chapman and Hall (context) - Conway, Finite - 1971
58 Fully abstract game semantics for general references (context) - Abramsky, Honda et al.
56 Game-theoretic analysis of call-by-value computation - Honda, Yoshida
51 sharing and state: a fully abstract game semantics for Ideal.. (context) - Abramsky, McCusker - 1997
31 Call-by-value games - Abramsky, McCusker - 1998
28 Information and Computation (context) - Abramsky, Jagadeesan et al. - 2000
22 Game semantics - Abramsky, McCusker
19 Lecture notes for the International Summer School in Compute.. (context) - Strachey, in - 1967
16 Semantics of interaction: an introduction to game semantics (context) - Abramsky - 1997
13 A semantic analysis of control (context) - Laird - 1998
13 Non-deterministic games and program analysis: an application.. - Malacaria, Hankin - 1999
12 Denotational semantics (context) - Tennent - 1994
10 A unifying approach to data-independence - Lazic, Nowak
10 Reasoning about Idealized Algol using regular languages - Ghica, McCusker
9 A fully abstract game semantics for finite nondeterminism - Harmer, McCusker - 1999
9 Boolean programs: A model and process for software analysis (context) - Ball, Rajamani
8 Probabilistic game semantics - Danos, Harmer
7 Regular language semantics for a call-by-value programming l.. - Ghica - 2001
7 A fully abstract and universal game model (context) - Hyland, Ong et al. - 2000
5 A regular-language model for Hoare-style correctness stateme.. - Ghica
4 On model checking data-independent systems with arrays witho.. - Lazic, Newcomb et al.
3 the need for a popular formal semantics - Schmidt - 1997
2 Algol-like Languages: Volumes I and II (context) - O'Hearn, Tennent - 1997
1 Equivalence of third order Idealized Algol is decidable (context) - Ong - 2001
Documents on the same site (http://web.comlab.ox.ac.uk/oucl/work/samson.abramsky/): More
Computational Interpretations of Linear Logic - Abramsky (1993) (Correct)
A Structural Approach to Reversible Computation - Abramsky (2001) (Correct)
The Lazy Lambda Calculus - Abramsky (1990) (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