Event Domains, Stable Functions and Proof-Nets
Open Access
- 12 March 2007
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 172, 33-67
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- L-Nets, Strategies and Proof-Nets2005
- Softness of hypercoherences and MALL full completenessAnnals of Pure and Applied Logic, 2005
- Sequentiality vs. concurrency in games and logicMathematical Structures in Computer Science, 2003
- Concurrent games and full completeness2003
- Full completeness of the multiplicative linear logic of Chu spaces2003
- The shuffle Hopf algebra and noncommutative full completenessThe Journal of Symbolic Logic, 1998
- Games and full completeness for multiplicative linear logicThe Journal of Symbolic Logic, 1994
- New Foundations for the Geometry of InteractionInformation and Computation, 1994
- Functorial polymorphismTheoretical Computer Science, 1990
- The structure of multiplicativesArchive for Mathematical Logic, 1989