Results 11  20
of
1,402,096
Free Algebras Corresponding to Multiplicative Classical Linear Logic and some Extensions.
, 1994
"... In this paper, constructions of free algebras corresponding to multiplicative classical linear logic, its affine variant and their extensions with ncontraction (n 2) are given. As an application, the cardinality problem of some onevariable linear fragments with ncontraction is solved. 1 Introdu ..."
Abstract
 Add to MetaCart
In this paper, constructions of free algebras corresponding to multiplicative classical linear logic, its affine variant and their extensions with ncontraction (n 2) are given. As an application, the cardinality problem of some onevariable linear fragments with ncontraction is solved. 1
Believe It Or Not, GOI is a Model of Classical Linear Logic
, 2007
"... We introduce the DanosRégnier category DR(M) of a linear inverse monoid M, a categorical description of geometries of interaction (GOI). The usual setting for GOI is that of a weakly Cantorian linear inverse monoid. It is wellknown that GOI is perfectly suited to describe the multiplicative fragme ..."
Abstract
 Add to MetaCart
, and no exponential—whatever M is, unless M is trivial. However, a form of coherence completion of DR(M) à la HuJoyal provides a model of full classical linear logic, as soon as M is weakly Cantorian. 1.
Lolliproc: to Concurrency from Classical Linear Logic via CurryHoward and Control
"... While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic—including doublenegation elimination—have remained elusive. Meanwhile, linearity has been used in many type systems for concurrent ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
for concurrent programs—e.g., session types—which suggests applicability to the problems of concurrent programming, but the ways in which linearity has interacted with concurrency primitives in lambda calculi have remained somewhat adhoc. In this paper we connect classical linear logic and concurrent functional
Pomset Logic: A NonCommutative Extension of Classical Linear Logic
, 1997
"... We extend the multiplicative fragment of linear logic with a noncommutative connective (called before), which, roughly speaking, corresponds to sequential composition. This lead us to a calculus where the conclusion of a proof is a Partially Ordered MultiSET of formulae. We firstly examine coherenc ..."
Abstract

Cited by 41 (10 self)
 Add to MetaCart
We extend the multiplicative fragment of linear logic with a noncommutative connective (called before), which, roughly speaking, corresponds to sequential composition. This lead us to a calculus where the conclusion of a proof is a Partially Ordered MultiSET of formulae. We firstly examine
PreCoherence Spaces with Approximation Structure: A Model for Intuitionistic Linear Logic Which is Not a Model of Classical Linear Logic
"... By using additional structure inherent in coherence spaces a new model for intuitionistic linear logic is constructed which is not a model for classical linear logic. The new class of spaces contains also the empty space, whence it yields a logical model, not only a typetheoretic one. 1 ..."
Abstract
 Add to MetaCart
By using additional structure inherent in coherence spaces a new model for intuitionistic linear logic is constructed which is not a model for classical linear logic. The new class of spaces contains also the empty space, whence it yields a logical model, not only a typetheoretic one. 1
Phase Semantics for Mixed NonCommutative Classical Linear Logic
, 1997
"... We define a mixed version of classical propositional linear logic, which combines both commutative and noncommutative connectives, with the basic features of a proof theory: sequent calculus and phase semantics. The multiplicative fragment of this logic extends commutative MLL on the one hand, and ..."
Abstract
 Add to MetaCart
We define a mixed version of classical propositional linear logic, which combines both commutative and noncommutative connectives, with the basic features of a proof theory: sequent calculus and phase semantics. The multiplicative fragment of this logic extends commutative MLL on the one hand
Acceptors as Values Functional Programming in Classical Linear Logic (Technical Summary)
, 1991
"... ..."
Submitted to: LINEARITY 2014 A Linear/Producer/Consumer Model of Classical Linear Logic
"... This paper defines a new proof and categorytheoretic framework for classical linear logic that separates reasoning into one linear regime and two persistent regimes corresponding to! and?. The resulting linear/producer/consumer (LPC) logic puts the three classes of propositions on the same semant ..."
Abstract
 Add to MetaCart
This paper defines a new proof and categorytheoretic framework for classical linear logic that separates reasoning into one linear regime and two persistent regimes corresponding to! and?. The resulting linear/producer/consumer (LPC) logic puts the three classes of propositions on the same
Under consideration for publication in Math. Struct. in Comp. Science Classical Linear Logic of Implications
, 2003
"... We give a simple term calculus for the multiplicative exponential fragment of Classical Linear Logic, by extending Barber and Plotkin’s dualcontext system for the intuitionistic case. The calculus has the nonlinear and linear implications as the basic constructs, and this design choice allows a te ..."
Abstract
 Add to MetaCart
We give a simple term calculus for the multiplicative exponential fragment of Classical Linear Logic, by extending Barber and Plotkin’s dualcontext system for the intuitionistic case. The calculus has the nonlinear and linear implications as the basic constructs, and this design choice allows a
Believe it or not, AJM's games model is a model of classical Linear Logic
, 1997
"... A general category of games is constructed, adapting and extending [1, 2]. Then, a subcategory of saturated strategies, closed under all possible codings in copy games, is shown to model reduction in classical Linear Logic. 1 Introduction The expectations of games semantics. Game theory long ago b ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
A general category of games is constructed, adapting and extending [1, 2]. Then, a subcategory of saturated strategies, closed under all possible codings in copy games, is shown to model reduction in classical Linear Logic. 1 Introduction The expectations of games semantics. Game theory long ago
Results 11  20
of
1,402,096