S. Abramsky, D. R. Ghica, A. S. Murawski, C.-H. L. Ong, I. D. B. Stark  Home/Search
Context
Related
| web.comlab.ox.ac.uk/oucl...nominal04.ps 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/w...pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce nominal games for modelling programming languages with dynamically generated local names, as exemplified by Pitts and Stark's nu-calculus. Inspired by Pitts and Gabbay's recent work on nominal sets, we construct arenas and strategies in the world (or topos) of Fraenkel-Mostowski sets (or simply FM-sets). We fix an infinite set N of names to be the "atoms" of the FM-theory, and interpret the type of names as the flat arena whose move-set is N . This approach leads to a clean and... (Update)
Active bibliography (related documents): More All
0.4: Local Variable Scoping and - Kleene Algebra With (Correct)
0.4: Relational Semantics for Higher-Order - Functional Programs Kamal (Correct)
0.4: An approach to deciding observational equivalence of Algol-like.. - Ong (Correct)
Similar documents based on text: More All
0.4: Evolving Games and Essential Nets for Affine Polymorphism - Murawski, Ong (Correct)
0.3: Discreet Games, Light Affine Logic and PTIME Computation - Murawski, Ong (Correct)
0.3: Evolving Games and Essential Nets for Ane Polymorphism - Murawski Ong Oxford (Correct)
BibTeX entry: (Update)
@misc{ abramsky-nominal,
author = "S. Abramsky and D. R. Ghica and A. S. Murawski and C.-H. L. Ong and I.
D. B. Stark",
title = "Nominal Games and Full Abstraction for the Nu-Calculus",
url = "citeseer.ist.psu.edu/703016.html" }
Citations (may not include all citations):106 the observable properties of higher order functions that dyn.. - Pitts, Stark - 1993
87 Notions of computation and monads - Moggi - 1989
68 On Full Abstraction for PCF (context) - Hyland, Ong - 2000
58 Fully abstract game semantics for general reference (context) - Abramsky, Honda et al.
56 Game-theoretic analysis of callby -value computation - Honda, Yoshida - 1999
51 sharing and state: a fully abstract game semantics for Ideal.. (context) - Abramsky, McCusker - 1997
45 A new approach to abstract syntax with variable binding - Gabbay, Pitts - 2002
45 Communicating and Mobile Systems: The Pi-Calculus (context) - Milner - 1999
42 Operational reasoning for functions with local state - Pitts, Stark - 1998
38 A metalanguage for programming with bound names modulo renam.. - Pitts, Gabbay - 2000
31 Call-by-value games - Abramsky, McCusker - 1998
31 Names and Higher-Order Functions - Stark - 1994
31 Lisp and Symbolic Computation (context) - Stark, for - 1996
13 Premonoidal categories and notions of computation MSCS - Power, Robinson - 1997
11 Games for Recursive Types - McCusker - 1998
9 relations: Practical ways to reason about new (context) - Stark, equations - 1998
7 A fully abstract game semantics of local exception (context) - Laird - 2001
5 Operational semantics and program equivalence - Pitts - 2002
3 A game semantics of local names and good variables (context) - Laird - 2004
3 Observational equivalence of third-order Idealized Algol is .. (context) - Ong - 2002
Documents on the same site (http://web.comlab.ox.ac.uk/oucl/work/samson.abramsky/pubs.html): More
A Game Semantics for Generic Polymorphism - Samson Abramsky And (2003) (Correct)
High-Level Methods for Quantum Computation and Information - Samson Abramsky Oxford (Correct)
A Categorical Semantics of Quantum Protocols - Samson Abramsky And (2004) (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