Theoretical Computer Science
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computational interpretations of linear logic
Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
Obsessional experiments for linear logic proof-nets
Mathematical Structures in Computer Science
A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Acyclicity and coherence in multiplicative exponential linear logic
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
| Hi-index | 0.00 |
The purpose of this note is to show that the correctness of a multiplicative proof net with mix is equivalent to its semantic correctness: a proof structure is a proof net if and only if its semantic interpretation is a clique, where one given finite coherence space interprets all propositional variables.This is just an example of what can be done with these kinds of semantic techniques; for more information and further results, the reader is referred to Retoré (1994).