Conflict nets : efficient locally canonical MALL proof nets
- Submitting institution
-
The University of Bath
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 145988383
- Type
- E - Conference contribution
- DOI
-
10.1145/2933575.2934559
- Title of conference / published proceedings
- Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2016
- First page
- 437
- Volume
- -
- Issue
- -
- ISSN
- 2575-5528
- Open access status
- Compliant
- Month of publication
- July
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 7
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This was the topic of an invited talk to a 4-day international event celebrating Linear Logic in 2016. It introduces a new notion of complexity-aware proof nets, to solve the problem that proof nets can be exponentially larger than proofs. Proof nets are an essential part of the linear logic programme, and their properties reflect strongly on the logic itself; hence this is a profound idea with implications for the discipline. The paper is referenced in the article on Linear Logic in the Stanford Encyclopedia of Philosophy.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -