Theoretical Computer Science
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From proof-nets to interaction nets
Proceedings of the workshop on Advances in linear logic
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
The differential Lambda-calculus
Theoretical Computer Science
On Köthe sequence spaces and linear logic
Mathematical Structures in Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
A semantics for lambda calculi with resources
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Uniformity and the Taylor expansion of ordinary lambda-terms
Theoretical Computer Science
On the Meaning of Logical Completeness
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
The Cut-Elimination Theorem for Differential Nets with Promotion
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Differential Linear Logic and Polarization
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Parallel Reduction in Resource Lambda-Calculus
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Differential structure in models of multiplicative biadditive intuitionistic linear logic
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
An exact correspondence between a typed pi-calculus and polarised proof-nets
Theoretical Computer Science
The separation theorem for differential interaction nets
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Interpreting a finitary pi-calculus in differential interaction nets
Information and Computation
Confluence of pure differential nets with promotion
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Categorical Models for Simply Typed Resource Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Exponentials with infinite multiplicities
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Intuitionistic differential nets and lambda-calculus
Theoretical Computer Science
Probabilistic coherence spaces as a model of higher-order probabilistic computation
Information and Computation
Realizability proof for normalization of full differential linear logic
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Linearity and PCF: a semantic insight!
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
The Scott model of linear logic is the extensional collapse of its relational model
Theoretical Computer Science
Interpreting a finitary pi-calculus in differential interaction nets
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
A hierarchy of expressiveness in concurrent interaction nets
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
We introduce interaction nets for a fragment of the differential lambda-calculus and exhibit in this framework a new symmetry between the of course and the why not modalities of linear logic, which is completely similar to the symmetry between the tensor and par connectives of linear logic. We use algebraic intuitions for introducing these nets and their reduction rules, and then we develop two correctness criteria (weak typability and acyclicity) and show that they guarantee strong normalization. Finally, we outline the correspondence between this interaction nets formalism and the resource lambda-calculus.