Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic-Reference-Cited by-同舟云学术

Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic

Published:2022-08-02 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
language:
Short-container-title:

Author:

Accattoli Beniamino¹

Affiliation:

1. LIX, Inria & École Polytechnique, France

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3531130.3532445

Reference74 articles.

1. Explicit substitutions

2. Computational interpretations of linear logic

3. Beniamino Accattoli . 2012 . An Abstract Factorization Theorem for Explicit Substitutions. In 23rd International Conference on Rewriting Techniques and Applications (RTA’12) , RTA 2012, May 28 - June 2, 2012, Nagoya, Japan(LIPIcs, Vol. 15), Ashish Tiwari (Ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 6–21. https://doi.org/10.4230/LIPIcs.RTA.2012.6 Beniamino Accattoli. 2012. An Abstract Factorization Theorem for Explicit Substitutions. In 23rd International Conference on Rewriting Techniques and Applications (RTA’12), RTA 2012, May 28 - June 2, 2012, Nagoya, Japan(LIPIcs, Vol. 15), Ashish Tiwari (Ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 6–21. https://doi.org/10.4230/LIPIcs.RTA.2012.6

4. Beniamino Accattoli . 2013 . Linear Logic and Strong Normalization. In 24th International Conference on Rewriting Techniques and Applications, RTA 2013 , June 24-26, 2013, Eindhoven, The Netherlands(LIPIcs, Vol. 21), Femke van Raamsdonk (Ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 39–54. https://doi.org/10.4230/LIPIcs.RTA. 2013.39 Beniamino Accattoli. 2013. Linear Logic and Strong Normalization. In 24th International Conference on Rewriting Techniques and Applications, RTA 2013, June 24-26, 2013, Eindhoven, The Netherlands(LIPIcs, Vol. 21), Femke van Raamsdonk (Ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 39–54. https://doi.org/10.4230/LIPIcs.RTA.2013.39

5. Beniamino Accattoli . 2018 . Proof Nets and the Linear Substitution Calculus. In Theoretical Aspects of Computing - ICTAC 2018 - 15th International Colloquium, Stellenbosch, South Africa , October 16-19, 2018, Proceedings(Lecture Notes in Computer Science, Vol. 11187), Bernd Fischer and Tarmo Uustalu (Eds.). Springer, 37–61. https://doi.org/10.1007/978-3-030-02508-3_3 Beniamino Accattoli. 2018. Proof Nets and the Linear Substitution Calculus. In Theoretical Aspects of Computing - ICTAC 2018 - 15th International Colloquium, Stellenbosch, South Africa, October 16-19, 2018, Proceedings(Lecture Notes in Computer Science, Vol. 11187), Bernd Fischer and Tarmo Uustalu (Eds.). Springer, 37–61. https://doi.org/10.1007/978-3-030-02508-3_3

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Operational Theory of the CPS-Calculus: Towards a Theoretical Foundation for IRs;Proceedings of the ACM on Programming Languages;2024-08-15

2. Sharing a Perspective on the -Calculus;Proceedings of the 2023 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software;2023-10-18

3. Canonicity of Proofs in Constructive Modal Logic;Lecture Notes in Computer Science;2023

4. Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02