| Approximate normalization for gradual dependent types J Eremondi, É Tanter, R Garcia Proc. ACM Program. Lang. 3 (ICFP), 88:1--88:30, 2019 | 24 | 2019 |
| Insertion Operations on Deterministic Reversal-Bounded Counter Machines J Eremondi, I McQuillan, OH Ibarra 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015 8977 …, 2015 | 11* | 2015 |
| Deletion operations on deterministic families of automata J Eremondi, OH Ibarra, I McQuillan Information and Computation 256, 237-252, 2017 | 8 | 2017 |
| The ASPECTA toolkit: affordable full coverage displays J Petford, MA Nacenta, C Gutwin, J Eremondi, C Ede Proceedings of the 5th ACM International Symposium on Pervasive Displays, 87-105, 2016 | 7 | 2016 |
| Propositional equality for gradual dependently typed programming J Eremondi, R Garcia, É Tanter Proceedings of the ACM in Programming Languages 6 (ICFP), 165-193, 2022 | 5 | 2022 |
| On the complexity and decidability of some problems involving shuffle J Eremondi, OH Ibarra, I McQuillan Information and Computation 259, 214-224, 2018 | 5 | 2018 |
| On the density of context-free and counter languages J Eremondi, OH Ibarra, I McQuillan International Journal of Foundations of Computer Science 29 (02), 233-250, 2018 | 5 | 2018 |
| Deletion operations on deterministic families of automata J Eremondi, OH Ibarra, I McQuillan International Conference on Theory and Applications of Models of Computation …, 2015 | 5 | 2015 |
| On the design of a gradual dependently typed language for programming JS Eremondi University of British Columbia, 2023 | 3 | 2023 |
| Set Constraints, Pattern Match Analysis, and SMT J Eremondi Trends in Functional Programming 2019, 121-141, 2020 | 3 | 2020 |
| A framework for improving error messages in dependently-typed languages J Eremondi, W Swierstra, J Hage Open Computer Science 9 (1), 1-32, 2019 | 3 | 2019 |
| Improving error messages for dependent types with constraint-based unification JS Eremondi | 2 | 2016 |
| Insertion Operations on Deterministic Reversal-Bounded Counter Machines⇤ J Eremondi, OH Ibarra, I McQuillan Tech. Rep. 2014–01, University of Saskatchewan, 2014 | 1 | 2014 |
| Strictly Monotone Brouwer Trees for Well Founded Recursion over Multiple Arguments J Eremondi Proceedings of the 13th ACM SIGPLAN International Conference on Certified …, 2024 | | 2024 |
Éric TanterProfessor of Computer Science, University of ChileDirección de correo verificada de dcc.uchile.cl
