| Infinets: The parallel syntax for non-wellfounded proof-theory A De, A Saurin International Conference on Automated Reasoning with Analytic Tableaux and …, 2019 | 18 | 2019 |
| Decision problems for linear logic with least and greatest fixed points A Das, A De, A Saurin 7th International Conference on Formal Structures for Computation and …, 2022 | 8 | 2022 |
| Phase semantics for linear logic with least and greatest fixed points A De, F Jafarrahmani, A Saurin 42nd IARCS Annual Conference on Foundations of Software Technology and …, 2022 | 6 | 2022 |
| Canonical proof-objects for coinductive programming: infinets with infinitely many cuts A De, L Pellissier, A Saurin Proceedings of the 23rd International Symposium on Principles and Practice …, 2021 | 6 | 2021 |
| Decision problems for linear logic with least and greatest fixed points (Extended version) A Das, A De, A Saurin | 1 | 2022 |
| Eliminating infinitely many cuts in non-wellfounded MLL proof-nets A De, L Pellissier, A Saurin | 1 | 2021 |
| Proof nets for non-wellfounded proofs A De, A Saurin | | |
