| Quotienting the delay monad by weak bisimilarity J Chapman, T Uustalu, N Veltri Mathematical Structures in Computer Science 29 (1), 67-92, 2019 | 30 | 2019 |
| Quotienting the delay monad by weak bisimilarity J Chapman, T Uustalu, N Veltri International Colloquium on Theoretical Aspects of Computing, 110-125, 2015 | 24 | 2015 |
| Bicategories in univalent foundations B Ahrens, D Frumin, M Maggesi, N Veltri, N Van Der Weide Mathematical Structures in Computer Science 31 (10), 1232-1269, 2021 | 23 | 2021 |
| Formalizing 𝜋-calculus in guarded cubical Agda N Veltri, A Vezzosi Proceedings of the 9th ACM SIGPLAN International Conference on Certified …, 2020 | 23 | 2020 |
| Bisimulation as path type for guarded recursive types RE Møgelberg, N Veltri Proceedings of the ACM on Programming Languages 3 (POPL), 1-29, 2019 | 22 | 2019 |
| The sequent calculus of skew monoidal categories T Uustalu, N Veltri, N Zeilberger Electronic Notes in Theoretical Computer Science 341, 345-370, 2018 | 19 | 2018 |
| The delay monad and restriction categories T Uustalu, N Veltri International Colloquium on Theoretical Aspects of Computing, 32-50, 2017 | 14 | 2017 |
| A type-theoretical study of nontermination N Veltri PhD thesis, Tallinn University of Technology, 2017 | 14 | 2017 |
| Guarded recursion in agda via sized types N Veltri, N van der Weide 4th International Conference on Formal Structures for Computation and …, 2019 | 11 | 2019 |
| Ticking clocks as dependent right adjoints: Denotational semantics for clocked type theory B Mannaa, RE Møgelberg, N Veltri Logical Methods in Computer Science 16, 2020 | 10 | 2020 |
| Constructing higher inductive types as groupoid quotients N Veltri, N Van Der Weide Logical Methods in Computer Science 17, 2021 | 7 | 2021 |
| En garde! Unguarded iteration for reversible computation in the delay monad R Kaarsgaard, N Veltri International Conference on Mathematics of Program Construction, 366-384, 2019 | 7 | 2019 |
| Eilenberg-Kelly Reloaded T Uustalu, N Veltri, N Zeilberger Electronic Notes in Theoretical Computer Science 352, 233-256, 2020 | 6 | 2020 |
| Partiality and container monads T Uustalu, N Veltri Programming Languages and Systems: 15th Asian Symposium, APLAS 2017, Suzhou …, 2017 | 6 | 2017 |
| Two set-based implementations of quotients in type theory. N Veltri SPLST 1525, 194-205, 2015 | 6 | 2015 |
| Proof theory of partially normal skew monoidal categories T Uustalu, N Veltri, N Zeilberger arXiv preprint arXiv:2101.10487, 2021 | 5 | 2021 |
| Deductive systems and coherence for skew prounital closed categories T Uustalu, N Veltri, N Zeilberger arXiv preprint arXiv:2101.03809, 2021 | 5 | 2021 |
| Type-theoretic constructions of the final coalgebra of the finite powerset functor N Veltri 6th International Conference on Formal Structures for Computation and …, 2021 | 5 | 2021 |
| Finiteness and rational sequences, constructively T Uustalu, N Veltri Journal of Functional Programming 27, e13, 2017 | 5 | 2017 |
| Variations on Noetherianness D Firsov, T Uustalu, N Veltri arXiv preprint arXiv:1604.01186, 2016 | 5 | 2016 |
Tarmo UustaluProfessor, Reykjavik University / Lead research scientist, Tallinn University of TechnologyVerified email at ru.is
