A calculus of mobile processes, I
Information and Computation
From proof-nets to interaction nets
Proceedings of the workshop on Advances in linear logic
What is a Categorical Model of Intuitionistic Linear Logic?
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
About Translations of Classical Logic into Polarized Linear Logic
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
The differential Lambda-calculus
Theoretical Computer Science
Mathematical Structures in Computer Science
Theoretical Computer Science - Logic, language, information and computation
Theoretical Computer Science
Uniformity and the Taylor expansion of ordinary lambda-terms
Theoretical Computer Science
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Böhm trees, krivine's machine and the taylor expansion of lambda-terms
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Interpreting a finitary pi-calculus in differential interaction nets
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.00 |
We extend Ehrhard---Regnier's differential linear logic along the lines of Laurent's polarization. We provide a denotational semantics of this new system in the well-known relational model of linear logic, extending canonically the semantics of both differential and polarized linear logics: this justifies our choice of cut elimination rules. Then we show this polarized differential linear logic refines the recently introduced convolution ${\bar\lambda}\mu$-calculus, the same as linear logic decomposes *** -calculus.