A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic
From MaRDI portal
Publication:3540183
Recommendations
Cites work
- scientific article; zbMATH DE number 2134916 (Why is no real title available?)
- scientific article; zbMATH DE number 786488 (Why is no real title available?)
- scientific article; zbMATH DE number 937366 (Why is no real title available?)
- A semantic characterisation of the correctness of a proof net
- A stable programming language
- Acyclicity and Coherence in Multiplicative Exponential Linear Logic
- Asynchronous Games: Innocence Without Alternation
- LCF considered as a programming language
- Linear logic
- Softness of hypercoherences and MALL full completeness
- The structure of multiplicatives
Cited in
(12)- Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (Abstract)
- A System of Interaction and Structure III: The Complexity of BV and Pomset Logic
- Visible acyclic differential nets. I: Semantics
- Softness of MALL proof-structures and a correctness criterion with Mix
- scientific article; zbMATH DE number 786498 (Why is no real title available?)
- Softness of hypercoherences and MALL full completeness
- scientific article; zbMATH DE number 1499082 (Why is no real title available?)
- Non-uniform (hyper/multi)coherence spaces
- scientific article; zbMATH DE number 786488 (Why is no real title available?)
- Acyclicity and Coherence in Multiplicative Exponential Linear Logic
- On phase semantics and denotational semantics in multiplicative-additive linear logic
- Coherent interaction graphs
This page was built for publication: A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540183)