Theoretical Computer Science
Fucusing and Proof-Nets in Linear and Non-commutative Logic
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Focussing Proof-Net Construction as a Middleware Paradigm
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Ludics Nets, a game Model of Concurrent Interaction
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
L-Nets, strategies and proof-nets
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
A logical calculus for modelling interferences
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Jumping boxes: representing lambda-calculus boxes by jumps
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
An approach to innocent strategies as graphs
Information and Computation
| Hi-index | 0.00 |
We introduce a new class of multiplicative proof nets, J-proof nets, which are a typed version of Faggian and Maurel’s multiplicative L-nets. In J-proof nets, we can characterize nets with different degrees of sequentiality, by gradual insertion of sequentiality constraints. As a byproduct, we obtain a simple proof of the sequentialisation theorem.