Results 1  10
of
11
Concurrent Games and Full Completeness
, 1998
"... A new concurrent form of game semantics is introduced. This overcomes the problems which had arisen with previous, sequential forms of game semantics in modelling Linear Logic. It also admits an elegant and robust formalization. A Full Completeness Theorem for MultiplicativeAdditive Linear Logic is ..."
Abstract

Cited by 49 (16 self)
 Add to MetaCart
A new concurrent form of game semantics is introduced. This overcomes the problems which had arisen with previous, sequential forms of game semantics in modelling Linear Logic. It also admits an elegant and robust formalization. A Full Completeness Theorem for MultiplicativeAdditive Linear Logic is proved for this semantics. 1 Introduction This paper contains two main contributions: ffl the introduction of a new form of game semantics, which we call concurrent games. ffl a proof of full completeness of this semantics for MultiplicativeAdditive Linear Logic. We explain the significance of each of these in turn. Concurrent games Traditional forms of game semantics which have appeared in logic and computer science have been sequential in format: a play of the game is formalized as a sequence of moves. The key feature of this sequential format is the existence of a global schedule (or polarization) : in each (finite) position, it is (exactly) one player's turn to move 1 . This seq...
Geometry of Interaction and Linear Combinatory Algebras
, 2000
"... this paper was quite di#erent, stemming from the axiomatics of categories of tangles (although the authors were aware of possible connections to iteration theories. In fact, similar axiomatics in the symmetric case, motivated by flowcharts and "flownomials" had been developed some years ea ..."
Abstract

Cited by 42 (10 self)
 Add to MetaCart
this paper was quite di#erent, stemming from the axiomatics of categories of tangles (although the authors were aware of possible connections to iteration theories. In fact, similar axiomatics in the symmetric case, motivated by flowcharts and "flownomials" had been developed some years earlier by Stefanescu (Stefanescu 2000).) However, the first author realized, following a stimulating discussion with Gordon Plotkin, that traced monoidal categories provided a common denominator for the axiomatics of both the Girardstyle and AbramskyJagadeesanstyle versions of the Geometry of Interaction, at the basic level of the multiplicatives. This insight was presented in (Abramsky 1996), in which Girardstyle GoI was dubbed "particlestyle", since it concerns information particles or tokens flowing around a network, while the AbramskyJagadeesan style GoI was dubbed "wavestyle", since it concerns the evolution of a global information state or "wave". Formally, this distinction is based on whether the tensor product (i.e. the symmetric monoidal structure) in the underlying category is interpreted as a coproduct (particle style) or as a product (wave style). This computational distinction between coproduct and product interpretations of the same underlying network geometry turned out to have been partially anticipated, in a rather di#erent context, in a pioneering paper by E. S. Bainbridge (Bainbridge 1976), as observed by Dusko Pavlovic. These two forms of interpretation, and ways of combining them, have also been studied recently in (Stefanescu 2000). He uses the terminology "additive" for coproductbased (i.e. our "particlestyle") and "multiplicative" for productbased (i.e. our "wavestyle"); this is not suitable for our purposes, because of the clash with Linear Logic term...
Sequentiality vs. Concurrency in Games and Logic
 Math. Structures Comput. Sci
, 2001
"... Connections between the sequentiality/concurrency distinction and the semantics of proofs are investigated, with particular reference to games and Linear Logic. ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
Connections between the sequentiality/concurrency distinction and the semantics of proofs are investigated, with particular reference to games and Linear Logic.
Logical Predicates for Intuitionistic Linear Type Theories
 In Typed Lambda Calculi and Applications (TLCA'99), Lecture Notes in Computer Science 1581
, 1999
"... We develop a notion of Kripkelike parameterized logical predicates for two fragments of intuitionistic linear logic (MILL and DILL) in terms of their categorytheoretic models. Such logical predicates are derived from the categorical glueing construction combined with the free symmetric monoidal co ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
We develop a notion of Kripkelike parameterized logical predicates for two fragments of intuitionistic linear logic (MILL and DILL) in terms of their categorytheoretic models. Such logical predicates are derived from the categorical glueing construction combined with the free symmetric monoidal cocompletion. As applications, we obtain full completeness results of translations between linear type theories.
Chu’s Construction: A Prooftheoretic Approach
 LOGIC FOR CONCURRENCY AND SYNCHRONISATION”, KLUWER TRENDS IN LOGIC N.18, 2003, PP.93114. LAMBDA CALCULUS 37
, 2001
"... ..."
On categorical models of classical logic and the geometry of interaction
, 2005
"... It is wellknown that weakening and contraction cause naïve categorical models of the classical sequent calculus to collapse to Boolean lattices. In previous work, summarized briefly herein, we have provided a class of models called classical categories which is sound and complete and avoids this co ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
It is wellknown that weakening and contraction cause naïve categorical models of the classical sequent calculus to collapse to Boolean lattices. In previous work, summarized briefly herein, we have provided a class of models called classical categories which is sound and complete and avoids this collapse by interpreting cutreduction by a posetenrichment. Examples of classical categories include boolean lattices and the category of sets and relations, where both conjunction and disjunction are modelled by the settheoretic product. In this article, which is selfcontained, we present an improved axiomatization of classical categories, together with a deep exploration of their structural theory. Observing that the collapse already happens in the absence of negation, we start with negationfree models called Dummett categories. Examples include, besides the classical categories above, the category of sets and relations, where both conjunction and disjunction are modelled by the disjoint union. We prove that Dummett categories are MIX, and that the partial order can be derived from homsemilattices which have a straightforward prooftheoretic definition. Moreover, we show that the GeometryofInteraction construction can be extended from multiplicative linear logic to classical logic, by applying it to obtain a classical
Technical Report Softness of Hypercoherences and MALL Full Completeness
, 2003
"... We prove a full completeness theorem for multiplicativeadditive linear logic (i.e. MALL) using a double gluing construction applied to Ehrhard’s ∗autonomous category of hypercoherences. This is the first nongametheoretic full completeness theorem for this fragment. Our main result is that every ..."
Abstract
 Add to MetaCart
We prove a full completeness theorem for multiplicativeadditive linear logic (i.e. MALL) using a double gluing construction applied to Ehrhard’s ∗autonomous category of hypercoherences. This is the first nongametheoretic full completeness theorem for this fragment. Our main result is that every dinatural transformation between definable functors arises from the denotation of a cutfree MALL proof. Our proof consists of three steps. We show: • Dinatural transformations on this category satisfy Joyal’s softness property for products and coproducts. • Softness, together with multiplicative full completeness, guarantees that every dinatural transformation corresponds to a Girard MALL proofstructure. • The proofstructure associated to any dinatural transformation is a MALL proofnet, hence a denotation of a proof. This last step involves a detailed study of cycles in additive proof structures.
Completeness
, 2003
"... Abstract We prove a full completeness theorem for multiplicativeadditive linear logic (i.e. MALL) using a double gluing construction applied to Ehrhard's \Lambdaautonomous category of hypercoherences. This is the first nongametheoretic full completeness theorem for this fragment. Our main r ..."
Abstract
 Add to MetaCart
Abstract We prove a full completeness theorem for multiplicativeadditive linear logic (i.e. MALL) using a double gluing construction applied to Ehrhard's \Lambdaautonomous category of hypercoherences. This is the first nongametheoretic full completeness theorem for this fragment. Our main result is that every dinatural transformation between definable functors arises from the denotation of a cutfree MALL proof. Our proof consists of three steps. We show: ffl Dinatural transformations on this category satisfy Joyal's softness property for products and coproducts. ffl Softness, together with multiplicative full completeness, guarantees that every