| A formal framework for specifying sequent calculus proof systems D Miller, E Pimentel Theoretical Computer Science 474, 98-116, 2013 | 59 | 2013 |
| An extended framework for specifying and reasoning about proof systems V Nigam, E Pimentel, G Reis Journal of Logic and Computation 26 (2), 539-576, 2016 | 43 | 2016 |
| Modularisation of sequent calculi for normal and non-normal modalities B Lellmann, E Pimentel ACM Transactions on Computational Logic (TOCL) 20 (2), 1-46, 2019 | 41 | 2019 |
| A general proof system for modalities in concurrent constraint programming V Nigam, C Olarte, E Pimentel CONCUR 2013–Concurrency Theory: 24th International Conference, CONCUR 2013 …, 2013 | 38 | 2013 |
| Using linear logic to reason about sequent systems D Miller, E Pimentel Automated Reasoning with Analytic Tableaux and Related Methods …, 2002 | 34 | 2002 |
| Proof search in nested sequent calculi B Lellmann, E Pimentel Logic for Programming, Artificial Intelligence, and Reasoning: 20th …, 2015 | 31 | 2015 |
| On the specification of sequent systems E Pimentel, D Miller Logic for Programming, Artificial Intelligence, and Reasoning: 12th …, 2005 | 31 | 2005 |
| Subexponential concurrent constraint programming C Olarte, E Pimentel, V Nigam Theoretical Computer Science 606, 98-120, 2015 | 28 | 2015 |
| Specifying proof systems in linear logic with subexponentials V Nigam, E Pimentel, G Reis Electronic Notes in Theoretical Computer Science 269, 109-123, 2011 | 26 | 2011 |
| Linear logic as a framework for specifying sequent calculus D Miller, E Pimentel Logic Colloquium 99, 111-135, 1999 | 23 | 1999 |
| Intersection Types from a proof-theoretic perspective E Pimentel, S Ronchi Della Rocca, L Roversi Fundamenta Informaticae 121 (1-4), 253-274, 2012 | 22 | 2012 |
| A uniform framework for substructural logics with modalities. B Lellmann, C Olarte, E Pimentel LPAR, 435-455, 2017 | 17 | 2017 |
| Lazy strong normalization L Paolini, E Pimentel, SR Della Rocca Electronic Notes in Theoretical Computer Science 136, 103-116, 2005 | 16 | 2005 |
| From axioms to synthetic inference rules via focusing S Marin, D Miller, E Pimentel, M Volpe Annals of Pure and Applied Logic 173 (5), 103091, 2022 | 15 | 2022 |
| Dynamic spaces in concurrent constraint programming C Olarte, V Nigam, E Pimentel Electronic Notes in Theoretical Computer Science 305, 103-121, 2014 | 15 | 2014 |
| On subexponentials, focusing and modalities in concurrent systems V Nigam, C Olarte, E Pimentel Theoretical Computer Science 693, 35-58, 2017 | 14 | 2017 |
| Intersection types: a proof-theoretical approach E Pimentel, SR Della Rocca, L Roversi Fakultät Informatik, 189, 2005 | 14 | 2005 |
| An ecumenical notion of entailment E Pimentel, LC Pereira, V de Paiva Synthese 198 (Suppl 22), 5391-5413, 2021 | 13 | 2021 |
| A semantical view of proof systems E Pimentel Logic, Language, Information, and Computation: 25th International Workshop …, 2018 | 13 | 2018 |
| A proof theoretic study of soft concurrent constraint programming E Pimentel, C Olarte, V Nigam Theory and Practice of Logic Programming 14 (4-5), 649-663, 2014 | 13 | 2014 |
Carlos OlarteAssociate Professor at Université Sorbonne Paris NordVerified email at lipn.univ-paris13.fr
