Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Will Simmons and Aleks Kissinger. Higher-Order Causal Theories Are Models of BV-Logic. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 80:1-80:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{simmons_et_al:LIPIcs.MFCS.2022.80, author = {Simmons, Will and Kissinger, Aleks}, title = {{Higher-Order Causal Theories Are Models of BV-Logic}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {80:1--80:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-256-3}, ISSN = {1868-8969}, year = {2022}, volume = {241}, editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.80}, URN = {urn:nbn:de:0030-drops-168789}, doi = {10.4230/LIPIcs.MFCS.2022.80}, annote = {Keywords: Causality, linear logic, categorical logic, probabilistic coherence spaces, quantum channels} }
Published in: LIPIcs, Volume 82, 26th EACSL Annual Conference on Computer Science Logic (CSL 2017)
Andrea Aler Tubella, Alessio Guglielmi, and Benjamin Ralph. Removing Cycles from Proofs. In 26th EACSL Annual Conference on Computer Science Logic (CSL 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 82, pp. 9:1-9:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{alertubella_et_al:LIPIcs.CSL.2017.9, author = {Aler Tubella, Andrea and Guglielmi, Alessio and Ralph, Benjamin}, title = {{Removing Cycles from Proofs}}, booktitle = {26th EACSL Annual Conference on Computer Science Logic (CSL 2017)}, pages = {9:1--9:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-045-3}, ISSN = {1868-8969}, year = {2017}, volume = {82}, editor = {Goranko, Valentin and Dam, Mads}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2017.9}, URN = {urn:nbn:de:0030-drops-77008}, doi = {10.4230/LIPIcs.CSL.2017.9}, annote = {Keywords: proof theory, deep inference, proof complexity} }
Published in: LIPIcs, Volume 6, Proceedings of the 21st International Conference on Rewriting Techniques and Applications (2010)
Alessio Guglielmi, Tom Gundersen, and Michel Parigot. A Proof Calculus Which Reduces Syntactic Bureaucracy. In Proceedings of the 21st International Conference on Rewriting Techniques and Applications. Leibniz International Proceedings in Informatics (LIPIcs), Volume 6, pp. 135-150, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
@InProceedings{guglielmi_et_al:LIPIcs.RTA.2010.135, author = {Guglielmi, Alessio and Gundersen, Tom and Parigot, Michel}, title = {{A Proof Calculus Which Reduces Syntactic Bureaucracy}}, booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications}, pages = {135--150}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-18-7}, ISSN = {1868-8969}, year = {2010}, volume = {6}, editor = {Lynch, Christopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.135}, URN = {urn:nbn:de:0030-drops-26490}, doi = {10.4230/LIPIcs.RTA.2010.135}, annote = {Keywords: Logic, Proof theory, Deep Inference, Flow graphs, Proof Systems, Open Deduction, Rewriting, Confluence, Termination} }
Feedback for Dagstuhl Publishing