Samson Abramsky  Home/Search
Context
Related
| comlab.ox.ac.uk/pub/Do...RR0108.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/ou...rr0108 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Connections between the sequentiality/concurrency distinction and the semantics of proofs are investigated, with particular reference to games and Linear Logic. (Update)
Similar documents (at the sentence level):
6.4%: Concurrent Games and Full Completeness - Abramsky, Melliès (1998) (Correct)
Active bibliography (related documents): More All
7.4: Sequentiality vs. Concurrency in Games and Logic - Abramsky (2001) (Correct)
0.4: A Structural Approach to Reversible Computation - Abramsky (2001) (Correct)
0.4: Games As Formal Tools Vs. Games As Explanations - Pietarinen (2000) (Correct)
Similar documents based on text: More All
0.3: Sequentiality, Monadic Second-Order Logic and Tree Automata - Comon (Correct)
0.3: Sequentiality, Second Order Monadic Logic and Tree Automata - Comon (Correct)
0.2: Polarized Games for Classical Logic - Laurent (2002) (Correct)
BibTeX entry: (Update)
@misc{ abramsky-sequentiality,
author = "Samson Abramsky",
title = "Sequentiality vs. Concurrency in Games and Logic",
url = "citeseer.ist.psu.edu/article/abramsky01sequentiality.html" }
Citations (may not include all citations):982 Theoretical Computer Science (context) - Girard - 1987
447 Prentice-Hall International (context) - Milner, Concurrency - 1989
344 Concurrent Constraint Programming (context) - Saraswat - 1993
306 LCF considered as a programming language (context) - Plotkin - 1977
283 Theoretical Computer Science (context) - Kahn, Plotkin
268 Proofs and Types (context) - Girard, Lafont et al. - 1989
223 Linear objects: logical processes with built-in inheritance - Andreoli, Pareschi - 1991
175 Games and Full Completeness for Multiplicative Linear Logic - Abramsky, Jagadeesan - 1994
168 Theoretical Computer Science (context) - Nielsen, Plotkin et al. - 1981
144 Models for Concurrency - Winskel, Nielsen - 1995
139 Cambridge University Press (context) - Baeten, Weijland - 1990
134 calculus: an algorithmic interpretation of classical natural.. (context) - Parigot - 1992
72 A new constructive logic: classical logic (context) - Girard - 1991
69 Geometry of Interaction I: Interpretation of System F (context) - Girard - 1989
69 Handbook of Logic in Computer Science (context) - Abramsky, Jung - 1994
65 sequential algorithms and functional programming (context) - Curien
63 Theoretical Computer Science (context) - Bainbridge, Freyd et al. - 1990
57 A new deconstructive logic: Linear Logic - Danos, Joinet et al. - 1996
50 New foundations for the geometry of interaction - Abramsky, Jagadeesan - 1994
50 Domains and Lambda-calculi (context) - Amadio, Curien - 1998
49 Annals of Pure and Applied Logic (context) - Blass, semantics et al. - 1992
45 Communicating and Mobile Systems: the Pi-Calculus (context) - Milner - 1999
40 Proof-nets: the parallel syntax for proof theory (context) - Girard - 1995
39 Retracing Some Paths (context) - Abramsky - 1996
38 Semantics of Interaction - Abramsky - 1997
31 Information and Computation (context) - Girard, Logic - 1998
31 Concurrent games and full completeness - Abramsky, Melli - 1998
31 Concurrent games and full completeness - Abramsky, Melli - 1999
29 Fair Games and Full Completeness for Multiplicative Linear L.. - Hyland, Ong - 1992
24 Geometry of Interaction II: Deadlock- free Algorithms (context) - Girard - 1990
22 Game Semantics - Abramsky, McCusker - 1999
21 Proof-nets and the Hilbert space - Danos, Regnier
20 North-Holland Mathematical Library (context) - Freyd, Scedrov et al. - 1990
19 Non-sequential processes (context) - Petri - 1977
16 Annals of Pure and Applied Logic (context) - Blute, Scott et al. - 1996
15 Algebraic types in PER models (context) - Hyland, Robinson et al. - 1989
15 Totality and Full Completeness (context) - Loader - 1994
15 Proof Techniques for Recursive programs (context) - Vuillemin - 1973
13 A semantic analysis of control (context) - Laird - 1999
13 A symmetric lambda calculus for classical program extraction (context) - Barbanera, Berardi - 1996
12 Finitary PCF is not decidable - Loader
11 Full completeness for models of linear logic (context) - Tan - 1996
9 Full completeness of the multiplicative linear logic of Chu .. - Devarajan, Hughes et al. - 1999
8 Models of lambda calculi and linear logic: structural - Loader - 1994
7 Geometry of Interaction III: Accommodating the Additives - Girard
5 A semantic view of classical proofs: type-theoretical (context) - Ong - 1996
5 Personal communication (context) - Blass
4 Process Realizability - Abramsky - 2000
4 To appear in Mathematical Structures in Computer Science (context) - Girard - 2001
3 A Categorical Approach to Linear Logic (context) - Haghverdi - 2000
3 Classical Logic and Computation (context) - Urban - 2000
3 A deconstruction of non-deterministic classical cut-eliminat.. - Laird
3 Lambda denability in the full type hierarchy (context) - Plotkin - 1980
3 What is the logic of parallel processing (context) - Hintikka, Sandu - 1995
2 Rendiconti del Seminario Matematico (context) - Girard - 1988
2 Fundamenta Mathematica LXXVII (context) - Blass, indeterminacy - 1972
2 Lecture Note Series Vol (context) - Girard, Lafont et al. - 1995
2 i and C.-H. L. Ong. Exhausting strategies, joker games, and .. (context) - Murawsk - 1999
2 Geometry of Interaction and models of Linear Combinatory Log.. (context) - Abramsky, Hagverdi et al. - 2000
2 Proceeses: a mathematical model of computing agents (context) - Milner
2 i and C.-H. L. Ong. Discreet games, Light Ane Logic, and PTI.. (context) - Murawsk
1 Axioms for Denability and Full Completeness (context) - Abramsky - 2000
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