Syntax vs. semantics: a polarized approach

Authors:
Olivier Laurent
Affiliations:
Preuves Programmes Systèmes, CNRS - Université Paris VII, Paris Cedex, France
Venue:
Theoretical Computer Science - Game theory meets theoretical computer science
Year:
2005

Citing 17
Cited 7

Linear logic

Theoretical Computer Science
Games and full completeness for multiplicative linear logic

Journal of Symbolic Logic
Full abstraction for idealized Algol with passive expressions

Theoretical Computer Science - Special issue on linear logic, 1
On full abstraction for PCF: I, II, and III

Information and Computation
Full abstraction for PCF

Information and Computation
Hereditarily Sequential Functionals

LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Games Semantics for Full Propositional Linear Logic

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Full abstraction for functional languages with control

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Full Completeness of the Multiplicative Linear Logic of Chu Spaces

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Concurrent Games and Full Completeness

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Proof Nets for Unit-free Multiplicative-Additive Linear Logic (Extended abstract)

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Dependent choice, 'quote' and the clock

Theoretical Computer Science
Obsessional experiments for linear logic proof-nets

Mathematical Structures in Computer Science
Locus Solum: From the rules of logic to the logic of rules

Mathematical Structures in Computer Science
Control categories and duality: on the categorical semantics of the lambda-mu calculus

Mathematical Structures in Computer Science
Linear Logic in Computer Science (London Mathematical Society Lecture Note Series)

Linear Logic in Computer Science (London Mathematical Society Lecture Note Series)
Classical isomorphisms of types

Mathematical Structures in Computer Science

Classical isomorphisms of types

Mathematical Structures in Computer Science
Rewritings for Polarized Multiplicative and Exponential Proof Structures

Electronic Notes in Theoretical Computer Science (ENTCS)
Thick Subtrees, Games and Experiments

TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
An exact correspondence between a typed pi-calculus and polarised proof-nets

Theoretical Computer Science
A logical calculus for modelling interferences

ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Preface

Theoretical Computer Science
Compressing Polarized Boxes

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a notion of sliced proof-nets for the polarized fragment of Linear Logic and a corresponding game model. We show that the connection between them is very strong through an equivalence of categories (this contains soundness, full completeness and faithful completeness).