Sequentiality vs. concurrency in games and logic

Connections between the sequentialitysconcurrency distinction and the semantics of proofs are investigated, with particular reference to games and Linear Logic.

[1]  Stefano Berardi,et al.  A Symmetric Lambda Calculus for Classical Program Extraction , 1994, Inf. Comput..

[2]  Samson Abramsky,et al.  Process Realizability , 2015, Realizability Semantics and Applications@FLoC.

[3]  Philip J. Scott,et al.  Linear Läuchli Semantics , 1996, Ann. Pure Appl. Log..

[4]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[5]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[6]  J. Girard,et al.  Advances in Linear Logic , 1995 .

[7]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[8]  Esfandiar Haghverdi,et al.  A categorical approach to linear logic, geometry of proofs and full completeness. , 2000 .

[9]  Pierre-Louis Curien.  Categorical Combinators, Sequential Algorithms, and Functional Programming , 1993, Progress in Theoretical Computer Science.

[10]  John Longley.  The sequentially realizable functionals , 2002, Ann. Pure Appl. Log..

[11]  Gordon D. Plotkin,et al.  Concrete Domains , 1993, Theor. Comput. Sci..

[12]  Samson Abramsky,et al.  Concurrent games and full completeness , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[13]  Samson Abramsky.  Axioms for definability and full completeness , 2000, Proof, Language, and Interaction.

[14]  S. Abramsky.  Game Semantics , 1999 .

[15]  Jean-Yves Girard,et al.  Geometry of interaction 2: deadlock-free algorithms , 1990, Conference on Computer Logic.

[16]  J. Vuillemin.  Proof techniques for recursive programs , 1973 .

[17]  Olivier Laurent,et al.  Polarized and focalized linear and classical proofs , 2005, Ann. Pure Appl. Log..

[18]  Vijay A. Saraswat,et al.  Concurrent constraint programming , 1989, POPL '90.

[19]  Prakash Panangaden,et al.  The semantic foundations of concurrent constraint programming , 1991, POPL '91.

[20]  Radha Jagadeesan,et al.  New foundations for the geometry of interaction , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[21]  Radha Jagadeesan,et al.  A fully abstract semantics for a functional language with logic variables , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[22]  S. Shelah,et al.  Annals of Pure and Applied Logic , 1991 .

[23]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[24]  Jean-Yves Girard,et al.  Locus Solum: From the rules of logic to the logic of rules , 2001, Mathematical Structures in Computer Science.

[25]  James Laird,et al.  A Deconstruction of Non-deterministic Classical Cut Elimination , 2001, TLCA.

[26]  Roberto M. Amadio,et al.  Domains and lambda-calculi , 1998, Cambridge tracts in theoretical computer science.

[27]  Jean-Yves Girard,et al.  Light Linear Logic , 1998, Inf. Comput..

[28]  Ralph Loader.  Models of Lambda Calculi and Linear Logic: Structural, Equational and Proof-Theoretic Characterisati , 1994 .

[29]  C.-H. Luke Ong,et al.  A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[30]  Jean-Yves Girard,et al.  Geometry of Interaction 1: Interpretation of System F , 1989 .

[31]  Vincent Danos,et al.  A new deconstructive logic: linear logic , 1997, Journal of Symbolic Logic.

[32]  Andreas Blass,et al.  A Game Semantics for Linear Logic , 1992, Ann. Pure Appl. Log..

[33]  César Fernández,et al.  Non-sequential Processes , 1986, Advances in Petri Nets.

[34]  Andrzej S. Murawski,et al.  Exhausting strategies, joker games and full completeness for IMLL with Unit , 2003, Theor. Comput. Sci..

[35]  Gordon D. Plotkin,et al.  Full completeness of the multiplicative linear logic of Chu spaces , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[36]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[37]  Edmund Robinson,et al.  Algebraic Types in PER Models , 1989, Mathematical Foundations of Programming Semantics.

[38]  Ralph Loader.  Finitary PCF is not decidable , 2001, Theor. Comput. Sci..

[39]  J. Girard,et al.  Proofs and types , 1989 .

[40]  César Fernández.  Non-sequential Processes , 1986, Advances in Petri Nets.

[41]  J. Girard.  Geometry of interaction III: accommodating the additives , 1995 .

[42]  Andrzej S. Murawski,et al.  Discreet Games, Light Affine Logic and PTIME Computation , 2000, CSL.

[43]  Samson Abramsky,et al.  Geometry of Interaction and linear combinatory algebras , 2002, Mathematical Structures in Computer Science.

[44]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[45]  Ralph Loader.  Linear logic, totality and full completeness , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[46]  Radha Jagadeesan,et al.  Games and Full Completeness for Multiplicative Linear Logic , 1994, J. Symb. Log..

[47]  Robin Milner,et al.  Processes: A Mathematical Model of Computing Agents , 1975 .

[48]  Andrzej S. Murawski,et al.  Exhausting Strategies, Joker Games and Full Completeness for IMLL with Unit (Preliminary Version) , 1999 .

[49]  Andreas Blass,et al.  Degrees of indeterminacy of games , 1972 .

[50]  Samson Abramsky,et al.  Retracing some paths in Process Algebra , 1996, CONCUR.

[51]  Christian Urban.  Classical Logic and Computation , 2000 .

[52]  Jean-Yves Girard,et al.  A new constructive logic: classic logic , 1991, Mathematical Structures in Computer Science.

[53]  François Lamarche.  Games semantics for full propositional linear logic , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[54]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[55]  Michel Parigot,et al.  Lambda-Mu-Calculus: An Algorithmic Interpretation of Classical Natural Deduction , 1992, LPAR.

[56]  Mogens Nielsen,et al.  Models for Concurrency , 1992 .

[57]  J. Girard.  PROOF-NETS : THE PARALLEL SYNTAX FOR PROOF-THEORY , 1996 .

[58]  Jaakko Hintikka,et al.  What is the Logic of Parallel Processing? , 1995, International Journal of Foundations of Computer Science.

[59]  Vincent Danos,et al.  Proof-nets and the Hilbert space , 1995 .

[60]  Vincent Danos,et al.  Local and asynchronous beta-reduction (an analysis of Girard's execution formula) , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[61]  James David Laird,et al.  A semantic analysis of control , 1999 .

[62]  Andre Scedrov,et al.  Functorial Polymorphism , 1990, Theor. Comput. Sci..