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 | 37 | 2003 |

Cartesian closed 2-categories and permutation equivalence in higher-order rewriting T Hirschowitz Logical Methods in Computer Science 9, 2013 | 33 | 2013 |

Innocent strategies as presheaves and interactive equivalences for CCS (expanded version) T Hirschowitz, D Pous arXiv preprint arXiv:1109.4356, 2011 | 29 | 2011 |

Call-by-value mixin modules T Hirschowitz, X Leroy, JB Wells European Symposium on Programming, 64-78, 2004 | 26 | 2004 |

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 | 21 | 2005 |

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 | 21 | 2005 |

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 | 18* | 2015 |

Full abstraction for fair testing in CCS T Hirschowitz International Conference on Algebra and Coalgebra in Computer Science, 175-190, 2013 | 15 | 2013 |

Shapely monads and analytic functors R Garner, T Hirschowitz Journal of Logic and Computation 28 (1), 33-83, 2018 | 14 | 2018 |

Full abstraction for fair testing in CCS (expanded version) T Hirschowitz Logical Methods in Computer Science 10, 2014 | 14 | 2014 |

Modules over monads and operational semantics A Hirschowitz, T Hirschowitz, A Lafont 5th International Conference on Formal Structures for Computation and …, 2020 | 10 | 2020 |

Modules mixins, modules et récursion étendue en appel par valeur T Hirschowitz Paris 7, 2003 | 10 | 2003 |

A reduction semantics for call-by-value mixin modules T Hirschowitz, X Leroy, JB Wells INRIA, 2002 | 10 | 2002 |

A cellular Howe theorem P Borthelle, T Hirschowitz, A Lafont Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020 | 9 | 2020 |

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 | 8 | 2018 |

Compilation of extended recursion in call-by-value functional languages T Hirschowitz, X Leroy, JB Wells Higher-Order and Symbolic Computation 22 (1), 3-66, 2009 | 8 | 2009 |

Compilation of extended recursion in call-by-value functional languages T Hirschowitz, X Leroy, JB Wells Higher-Order and Symbolic Computation 22 (1), 3-66, 2009 | 8 | 2009 |

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 | 7 | 2009 |

Rigid mixin modules T Hirschowitz International Symposium on Functional and Logic Programming, 214-228, 2004 | 7 | 2004 |