Theoretical Computer Science
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Head linear reduction and pure proof net extraction
MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
Proof-nets and the Hilbert space
Proceedings of the workshop on Advances in linear logic
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
Mathematical Structures in Computer Science
Theoretical Computer Science - Logic, language, information and computation
Theoretical Computer Science
On the Meaning of Logical Completeness
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
| Hi-index | 0.00 |
Differential interaction nets (DIN) have been introduced by Thomas Ehrhard and Laurent Regnier as an extension of linear logic proof-nets. We prove that DIN enjoy an internal separation property: given two different normal nets, there exists a dual net separating them, in analogy with Böhm's theorem for the λ-calculus. Our result implies in particular the faithfulness of every non-trivial denotational model of DIN (such as Ehrhard's finiteness spaces). We also observe that internal separation does not hold for linear logic proof-nets: our work points out that this failure is due to the fundamental asymmetry of linear logic exponential modalities, which are instead completely symmetric in DIN.