| Mixin modules in a call-by-value setting T Hirschowitz, X Leroy European Symposium on Programming, 6-20, 2002 | 90 | 2002 |
| Compilation of extended recursion in call-by-value functional languages T Hirschowitz, X Leroy, JB Wells Proceedings of the 5th ACM SIGPLAN international conference on Principles …, 2003 | 43 | 2003 |
| Cartesian closed 2-categories and permutation equivalence in higher-order rewriting T Hirschowitz Logical Methods in Computer Science 9, 2013 | 38 | 2013 |
| Innocent strategies as presheaves and interactive equivalences for CCS (expanded version) T Hirschowitz, D Pous arXiv preprint arXiv:1109.4356, 2011 | 26 | 2011 |
| Call-by-value mixin modules: Reduction semantics, side effects, types T Hirschowitz, X Leroy, JB Wells European Symposium on Programming, 64-78, 2004 | 24 | 2004 |
| An intensionally fully-abstract sheaf model for pi C Eberhart, T Hirschowitz, T Seiller 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015) 35 …, 2015 | 21* | 2015 |
| Mixin modules in a call-by-value setting T Hirschowitz, X Leroy ACM Transactions on Programming Languages and Systems (TOPLAS) 27 (5), 857-881, 2005 | 20 | 2005 |
| Shapely monads and analytic functors R Garner, T Hirschowitz Journal of Logic and Computation 28 (1), 33-83, 2018 | 19 | 2018 |
| Component-oriented programming with sharing: Containment is not ownership D Hirschkoff, T Hirschowitz, D Pous, A Schmitt, JB Stefani International Conference on Generative Programming and Component Engineering …, 2005 | 19 | 2005 |
| A cellular Howe theorem P Borthelle, T Hirschowitz, A Lafont Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020 | 18 | 2020 |
| Full abstraction for fair testing in CCS (expanded version) T Hirschowitz Logical Methods in Computer Science 10, 2014 | 14 | 2014 |
| Full abstraction for fair testing in CCS T Hirschowitz Algebra and Coalgebra in Computer Science: 5th International Conference …, 2013 | 13 | 2013 |
| Modules over monads and operational semantics (expanded version) A Hirschowitz, T Hirschowitz, A Lafont arXiv preprint arXiv:2012.06530, 2020 | 11 | 2020 |
| Modules mixins, modules et récursion étendue en appel par valeur T Hirschowitz Paris 7, 2003 | 11 | 2003 |
| A reduction semantics for call-by-value mixin modules T Hirschowitz, X Leroy, JB Wells INRIA, 2002 | 11 | 2002 |
| What's in a game? A theory of game models C Eberhart, T Hirschowitz Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018 | 10 | 2018 |
| Variable binding and substitution for (nameless) dummies A Hirschowitz, T Hirschowitz, A Lafont, M Maggesi International Conference on Foundations of Software Science and Computation …, 2022 | 8 | 2022 |
| Contraction-free proofs and finitary games for linear logic A Hirschowitz, M Hirschowitz, T Hirschowitz Electronic Notes in Theoretical Computer Science 249, 287-305, 2009 | 8 | 2009 |
| A categorical framework for congruence of applicative bisimilarity in higher-order languages T Hirschowitz, A Lafont Logical Methods in Computer Science 18, 2022 | 7 | 2022 |
| Wild omega-categories for the homotopy hypothesis in type theory A Hirschowitz, T Hirschowitz, N Tabareau 13th International Conference on Typed Lambda Calculi and Applications (TLCA …, 2015 | 7 | 2015 |
