A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic
From MaRDI portal
Publication:3540183
DOI10.1007/978-3-540-87531-4_19zbMath1156.03322OpenAlexW2166745846MaRDI QIDQ3540183
Publication date: 20 November 2008
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87531-4_19
Related Items (2)
Visible acyclic differential nets. I: Semantics ⋮ A System of Interaction and Structure III: The Complexity of BV and Pomset Logic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Softness of hypercoherences and MALL full completeness
- LCF considered as a programming language
- The structure of multiplicatives
- A stable programming language
- Asynchronous Games: Innocence Without Alternation
- Acyclicity and Coherence in Multiplicative Exponential Linear Logic
- A semantic characterisation of the correctness of a proof net
This page was built for publication: A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic