J. Laird  Home/Search
Context
Related
| cogs.susx.ac.uk/users/j...absref1.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: cogs.susx.ac.uk/users/jiml/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We give a categorical description of a class of sound and adequate models of a functional language with assignable variables. This is based on a notion of \sequoidal category", a symmetric monoidal category with an additional non-commutative and non-associative tensor product. We describe a category G of games and strategies, and show that it satis es our axioms. We give an axiomatic characterization of those categories (including G) which give rise to fully abstract models. (Update)
Active bibliography (related documents): More All
0.6: Games and Sequential Algorithms - Laird (2001) (Correct)
0.5: Head Linear Reduction - Danos, Regnier (2004) (Correct)
0.4: A Game Semantics of Linearly Used Continuations - Laird (2002) (Correct)
Similar documents based on text: More All
0.2: An Example Paper - Name (Correct)
0.2: A Notion of Classical Pure Type System - Barthe, Hatcliff, al. (1997) (Correct)
0.2: How Many Argument Digits are Needed to Produce n Result Digits? - Heckmann (1999) (Correct)
BibTeX entry: (Update)
@misc{ laird-categorical,
author = "J. Laird",
title = "A Categorical Semantics of Higher Order Store",
url = "citeseer.ist.psu.edu/laird02categorical.html" }
Citations (may not include all citations):132 Syntactic control of interference (context) - Reynolds - 1978
69 Relational properties of domains - Pitts - 1996
66 What is a categorical model of intuitionistic linear logic - Bierman - 1995
58 A fully abstract games semantics for general references (context) - Abramsky, Honda et al. - 1998
54 Games and full abstraction for a functional metalanguage wit.. (context) - McCusker - 1996
51 Sharing and State: a fully abstract game semantics for Ideal.. (context) - Abramsky, McCusker - 1997
38 Information and Computation - Hyland, Ong et al. - 2000
38 Traced monoidal categories (context) - Joyal, Street et al. - 1996
38 Mathematical Structures in Computer Science (context) - Power, Robinson et al. - 1997
29 Recursion from cyclic sharing: traced monoidal categories an.. - Hasegawa - 1997
28 Information and Computation (context) - Abramsky, Jagadeesan et al. - 2000
19 Axioms for full abstraction and full completeness (context) - Abramsky - 1997
11 Linearly used continuations - Berdine, O'Hearn et al. - 2001
8 A linear logic model of state (context) - Reddy - 1993
7 A fully abstract game semantics of local exceptions (context) - Laird - 2001
5 Department of Computer Science (context) - Laird, Analysis et al. - 1998
5 A fully abstract games semantics for nite nondeterminism (context) - Harmer, McCusker - 1998
2 Reasoning about Idealised Algol using regular languages (context) - Ghica, McCusker - 2000
1 Approches Dynamiques en Se mantique de la Logique Lineair.. (context) - Baillot - 1999
1 A game semantics of ICSP (context) - Laird - 2001
Documents on the same site (http://www.cogs.susx.ac.uk/users/jiml/): More
Fully Abstract Bidomain Models of the λ-Calculus - Laird (2001) (Correct)
A game semantics of Idealized CSP - Laird (2001) (Correct)
Full Abstraction for Functional Languages with Control - Laird (1997) (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