Event Domains, Stable Functions and Proof-Nets
From MaRDI portal
Publication:2864146
DOI10.1016/j.entcs.2007.02.003zbMath1277.03058OpenAlexW2009804064WikidataQ57006631 ScholiaQ57006631MaRDI QIDQ2864146
Publication date: 6 December 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2007.02.003
Semantics in the theory of computing (68Q55) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Softness of hypercoherences and MALL full completeness
- Functorial polymorphism
- Petri nets, event structures and domains. I
- The structure of multiplicatives
- Concrete domains
- New foundations for the geometry of interaction
- The shuffle Hopf algebra and noncommutative full completeness
- Games and full completeness for multiplicative linear logic
- Sequentiality vs. concurrency in games and logic
- Traced monoidal categories
- Proof nets for unit-free multiplicative-additive linear logic
- Computer Science Logic
- Retracing some paths in process algebra
