Tom Hirschowitz

Publications

Article dans une revue (13)

Variable binding and substitution for (nameless) dummies André Hirschowitz,Tom Hirschowitz,Ambroise Lafont,Marco Maggesi Logical Methods in Computer Science, 2024, 20 (1), ⟨10.46298/lmcs-20(1:18)2024⟩ Article dans une revue hal-04487704v1
A categorical framework for congruence of applicative bisimilarity in higher-order languages Tom Hirschowitz,Ambroise Lafont Logical Methods in Computer Science, 2022, 18 (3), pp.37 Article dans une revue hal-02966439v6
Modules over monads and operational semantics (expanded version) André Hirschowitz,Tom Hirschowitz,Ambroise Lafont Logical Methods in Computer Science, 2022, 18 (3) Article dans une revue hal-03447952v2
Familial Monads and Structural Operational Semantics Tom Hirschowitz Proceedings of the ACM on Programming Languages, 2019, 3 (POPL), pp.1-28. ⟨10.1145/3290334⟩ Article dans une revue hal-01815328v4
Fibred Pseudo Double Categories for Game Semantics Clovis Eberhart,Tom Hirschowitz Theory and Applications of Categories, 2019, 34, pp.514 - 572 Article dans une revue hal-02274815v1
Shapely monads and analytic functors Richard Garner,Tom Hirschowitz Journal of Logic and Computation, 2018, 28 (1), pp.33-83. ⟨10.1093/logcom/exx029⟩ Article dans une revue hal-01246365v3
An intensionally fully-abstract sheaf model for pi (expanded version) Clovis Eberhart,Tom Hirschowitz,Thomas Seiller Logical Methods in Computer Science, 2017, 13 (4), pp.9. ⟨10.23638/LMCS-13(4:9)2017⟩ Article dans une revue hal-01609945v2
Full abstraction for fair testing in CCS (expanded version) Tom Hirschowitz Logical Methods in Computer Science, 2014, 10 (4), pp.2. ⟨10.2168/LMCS-10(4:2)2014⟩ Article dans une revue hal-00869469v3
Cartesian closed 2-categories and permutation equivalence in higher-order rewriting Tom Hirschowitz Logical Methods in Computer Science, 2013, 9 (3), pp.10. ⟨10.2168/LMCS-9(3:10)2013⟩ Article dans une revue hal-00540205v2
Saturating directed spaces André Hirschowitz,Michel Hirschowitz,Tom Hirschowitz Journal of Homotopy and Related Structures, 2013, pp.25-8. ⟨10.1007/s40062-013-0025-8⟩ Article dans une revue hal-00761352v1
Innocent strategies as presheaves and interactive equivalences for CCS (expanded version) Tom Hirschowitz,Damien Pous Scientific Annals of Computer Science, 2012, 22 (1), pp.147-199. ⟨10.7561/SACS.2012.1.147⟩ Article dans une revue hal-00555144v3
Compilation of extended recursion in call-by-value functional languages Tom Hirschowitz,Xavier Leroy,J. B. Wells Higher-Order and Symbolic Computation, 2009, 22 (1), pp.3-66. ⟨10.1007/s10990-009-9042-z⟩ Article dans une revue hal-00359213v1
Mixin modules in a call-by-value setting Tom Hirschowitz,Xavier Leroy ACM Transactions on Programming Languages and Systems (TOPLAS), 2005, 27 (5), pp.857 - 881. ⟨10.1145/1086642.1086644⟩ Article dans une revue hal-00310317v1

Communication dans un congrès (21)

An abstract, certified account of operational game semantics Peio Borthelle,Tom Hirschowitz,Guilhem Jaber,Yannick Zakowski ESOP 2025 - 34th European Symposium on Programming, May 2025, Hamilton, Ontario, Canada. pp.172-199, ⟨10.1007/978-3-031-91118-7_7⟩ Communication dans un congrès hal-04583895v2
Variable binding and substitution for (nameless) dummies André Hirschowitz,Tom Hirschowitz,Ambroise Lafont,Marco Maggesi 25th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2022), Apr 2022, Munich, Germany Communication dans un congrès hal-03547002v1
Modules over monads and operational semantics André Hirschowitz,Tom Hirschowitz,Ambroise Lafont 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020), 2020, Paris, France. pp.12:1--12:23, ⟨10.4230/LIPIcs.FSCD.2020.12⟩ Communication dans un congrès hal-02338144v3
A Cellular Howe Theorem Peio Borthelle,Tom Hirschowitz,Ambroise Lafont LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken, Germany. pp.273-286, ⟨10.1145/3373718.3394738⟩ Communication dans un congrès hal-02880876v1
Cellular Monads from Positive GSOS Specifications Tom Hirschowitz 26th International Workshop on Expressiveness in Concurrency and 16th Workshop on Structural Operational Semantics, 2019, Amsterdam, Netherlands. pp.1-18, ⟨10.4204/EPTCS.300.1⟩ Communication dans un congrès hal-02273790v1
Template Games, Simple Games, and Day Convolution Clovis Eberhart,Tom Hirschowitz,Alexis Laouar 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019), 2019, Dortmund, Germany. pp.16:1--16:19, ⟨10.4230/LIPIcs.FSCD.2019.16⟩ Communication dans un congrès hal-01897309v3
What's in a game? A theory of game models Clovis Eberhart,Tom Hirschowitz LICS, 2018, Oxford, United Kingdom. pp.374-383, ⟨10.1145/3209108.3209114⟩ Communication dans un congrès hal-01634162v1
Justified Sequences in String Diagrams: a Comparison Between Two Approaches to Concurrent Game Semantics Clovis Eberhart,Tom Hirschowitz 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017), 2017, Ljubljana, Slovenia. pp.10, ⟨10.4230/LIPIcs.CALCO.2017.10⟩ Communication dans un congrès hal-01715405v1
Wild omega-Categories for the Homotopy Hypothesis in Type Theory André Hirschowitz,Tom Hirschowitz,Nicolas Tabareau Typed Lambda Calculi and Applications, 2015, Varsovie, Poland. pp.226-240, ⟨10.4230/LIPIcs.TLCA.2015.226⟩ Communication dans un congrès hal-01178301v1
An Intensionally Fully-abstract Sheaf Model for pi Clovis Eberhart,Tom Hirschowitz,Thomas Seiller 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), 2015, Nimègue, Netherlands. pp.86--100, ⟨10.4230/LIPIcs.CALCO.2015.86⟩ Communication dans un congrès hal-00873626v2
Full abstraction for fair testing in CCS Tom Hirschowitz 5th Conference on Algebra and Coalgebra in Computer Science, 2013, Varsovie, France. pp.175-190, ⟨10.1007/978-3-642-40206-7_14⟩ Communication dans un congrès hal-00826274v1
Innocent strategies as presheaves and interactive equivalences for CCS Tom Hirschowitz,Damien Pous ICE, Jun 2011, Reykjavik, Iceland. pp.2-24, ⟨10.4204/EPTCS.59.2⟩ Communication dans un congrès hal-00616648v1
Contraction-free proofs and finitary games for Linear Logic André Hirschowitz,Michel Hirschowitz,Tom Hirschowitz MFPS 2009, 2009, Oxford, United Kingdom. pp.287-305, ⟨10.1016/j.entcs.2009.07.095⟩ Communication dans un congrès hal-00387452v1
Encapsulation and Dynamic Modularity in the Pi-Calculus Daniel Hirschkoff,Aurélien Pardon,Tom Hirschowitz,Samuel Hym,Damien Pous PLACES 2008, 2008, Oslo, Norway. pp.85 - 100, ⟨10.1016/j.entcs.2009.06.005⟩ Communication dans un congrès hal-00400159v1
Variable binding, symmetric monoidal closed theories, and bigraphs Richard Garner,Tom Hirschowitz,Aurélien Pardon CONCUR 2009, 2009, Bologna, Italy. pp.321-337, ⟨10.1007/978-3-642-04081-8_22⟩ Communication dans un congrès hal-00388100v1
A theory for game theories Michel Hirschowitz,André Hirschowitz,Tom Hirschowitz FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007, New Delhi, India. pp.192-203, ⟨10.1007/978-3-540-77050-3⟩ Communication dans un congrès hal-00310542v1
Component-Oriented Programming with Sharing: Containment is not Ownership Daniel Hirschkoff,Tom Hirschowitz,Damien Pous,Alan Schmitt,Jean-Bernard Stefani Generative Programming and Component Engineering (GPCE), 2005, Tallinn, Estonia. pp.389-404, ⟨10.1007/11561347_26⟩ Communication dans un congrès hal-00310126v1
Call-by-value mixin modules: Reduction semantics, side effects, types Tom Hirschowitz,Xavier Leroy,J. B. Wells European Symposium on Programming, 2004, Barcelona, Spain. pp.64-78, ⟨10.1007/b96702⟩ Communication dans un congrès hal-00310123v1
Rigid Mixin Modules Tom Hirschowitz Functional and Logic Programming Symposium (FLOPS), 2004, Nara, Japan. pp.214-228, ⟨10.1007/b96926⟩ Communication dans un congrès hal-00310124v1
Compilation of extended recursion in call-by-value functional languages Tom Hirschowitz,Xavier Leroy,J. B. Wells PPDP '03, 2003, Uppsala, Sweden. pp.160--171, ⟨10.1145/888251.888267⟩ Communication dans un congrès hal-00310121v1
Mixin modules in a call-by-value setting Tom Hirschowitz,Xavier Leroy European Symposium on Programming, 2002, Grenoble, France. pp.207-236, ⟨10.1007/3-540-45927-8⟩ Communication dans un congrès hal-00310119v1

Pré-publication, Document de travail (8)

Locally presentable initial-algebra semantics for (multimodal) dependent type theories André Hirschowitz,Tom Hirschowitz,Ambroise Lafont 2025 Pré-publication, Document de travail hal-05535887v1
A more general categorical framework for congruence of applicative bisimilarity Tom Hirschowitz,Ambroise Lafont 2023 Pré-publication, Document de travail hal-03999584v1
A unified treatment of structural definitions on syntax for capture-avoiding substitution, context application, named substitution, partial differentiation, and so on Tom Hirschowitz,Ambroise Lafont 2022 Pré-publication, Document de travail hal-03633933v1
Game semantics as a singular functor, and definability as geometric realisation Clovis Eberhart,Tom Hirschowitz 2017 Pré-publication, Document de travail hal-01527171v1
Justified sequences in string diagrams Clovis Eberhart,Tom Hirschowitz 2016 Pré-publication, Document de travail hal-01372582v1
Graphical Presentations of Symmetric Monoidal Closed Theories Richard Garner,Tom Hirschowitz,Aurélien Pardon 2008 Pré-publication, Document de travail hal-00333750v2
Topological Observations on Multiplicative Additive Linear Logic André Hirschowitz,Michel Hirschowitz,Tom Hirschowitz 2008 Pré-publication, Document de travail hal-00295949v1
Binding bigraphs as symmetric monoidal closed theories Tom Hirschowitz,Aurélien Pardon 2008 Pré-publication, Document de travail hal-00333753v2

Rapport (2)

On the implementation of recursion in call-by-value functional languages Tom Hirschowitz,Xavier Leroy,J. B. Wells [Research Report] RR-4728, INRIA. 2003 Rapport (rapport de recherche) inria-00071858v1
A reduction semantics for call-by-value mixin modules Tom Hirschowitz,Xavier Leroy,Joe B. Wells [Research Report] RR-4682, INRIA. 2002 Rapport (rapport de recherche) inria-00071903v1

HDR (1)

Quelques ponts entre sémantique opérationnelle et modèles dénotationnels des langages de programmation Tom Hirschowitz Logique en informatique [cs.LO]. Université Grenoble Alpes, 2016 HDR tel-01400666v1