Publication date
November 2014
DOI Publisher
Cambridge University Press (CUP)Abstract
International audienceIn this paper it is proved that Girard’s proof nets for multiplicative linear logic characterise free semi-⋆-autonomous-categories
International audienceIn this paper it is proved that Girard’s proof nets for multiplicative linear logic characterise free semi-⋆-autonomous-categories
International audienceThis two-parts paper offers a survey of linear logic and ludics, which were in...
Bi-Intuitionistic Linear Logic (BILL) is an extension of Intuitionistic Linear Logic with a par, dua...
[Analysis of algorithms and problem complexity]: Nonnumerical algorithms and problems—Complexity of ...
International audienceIn this paper it is proved that Girard’s proof nets for multiplicative linear ...
http://www.lmcs-online.orgInternational audienceIn the first part of this paper we present a theory ...
In the first part of this paper we present a theory of proof nets for full multiplicative linear log...
13th Annual Conference of the EACSL. Colloque avec actes et comité de lecture. internationale.Intern...
The essential interaction between classical and intuitionistic features in the system of linear logi...
International audienceThis paper is the second part of an introduction to linear logic and ludics, b...
MLL proof equivalence is the problem of deciding whether two proofs in multiplicative linear logic a...
From the publisher's description: "This book is the refereed proceedings of the First International ...
International audienceThe goal of this paper is to demonstrate how the very rich notion of proof-net...
By Boolean category we mean something which is to a Boolean algebra what a category is to a poset. W...
Uses Paul Taylor's diagrams.We define a notion of symmetric monoidal closed (SMC) theory, consisting...
Abstract proof structures in multiplicative linear logic are graphs with some extra structure, and t...
International audienceThis two-parts paper offers a survey of linear logic and ludics, which were in...
Bi-Intuitionistic Linear Logic (BILL) is an extension of Intuitionistic Linear Logic with a par, dua...
[Analysis of algorithms and problem complexity]: Nonnumerical algorithms and problems—Complexity of ...
International audienceIn this paper it is proved that Girard’s proof nets for multiplicative linear ...
http://www.lmcs-online.orgInternational audienceIn the first part of this paper we present a theory ...
In the first part of this paper we present a theory of proof nets for full multiplicative linear log...
13th Annual Conference of the EACSL. Colloque avec actes et comité de lecture. internationale.Intern...
The essential interaction between classical and intuitionistic features in the system of linear logi...
International audienceThis paper is the second part of an introduction to linear logic and ludics, b...
MLL proof equivalence is the problem of deciding whether two proofs in multiplicative linear logic a...
From the publisher's description: "This book is the refereed proceedings of the First International ...
International audienceThe goal of this paper is to demonstrate how the very rich notion of proof-net...
By Boolean category we mean something which is to a Boolean algebra what a category is to a poset. W...
Uses Paul Taylor's diagrams.We define a notion of symmetric monoidal closed (SMC) theory, consisting...
Abstract proof structures in multiplicative linear logic are graphs with some extra structure, and t...
International audienceThis two-parts paper offers a survey of linear logic and ludics, which were in...
Bi-Intuitionistic Linear Logic (BILL) is an extension of Intuitionistic Linear Logic with a par, dua...
[Analysis of algorithms and problem complexity]: Nonnumerical algorithms and problems—Complexity of ...
Add to ORKG