Skip to Main content
New interface
Number of documents

41

Tom Hirschowitz


Journal articles12 documents

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

Conference papers20 documents

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

Preprints, Working Papers, ...6 documents

  • Tom Hirschowitz, Ambroise Lafont. A unified treatment of structural definitions on syntax for capture-avoiding substitution, context application, named substitution, partial differentiation, and so on. 2022. ⟨hal-03633933⟩
  • Clovis Eberhart, Tom Hirschowitz. Game semantics as a singular functor, and definability as geometric realisation. 2017. ⟨hal-01527171⟩
  • Clovis Eberhart, Tom Hirschowitz. Justified sequences in string diagrams: A comparison between two approaches to concurrent game semantics. 2016. ⟨hal-01372582⟩
  • André Hirschowitz, Michel Hirschowitz, Tom Hirschowitz. Topological Observations on Multiplicative Additive Linear Logic. 2008. ⟨hal-00295949⟩
  • Richard Garner, Tom Hirschowitz, Aurélien Pardon. Graphical Presentations of Symmetric Monoidal Closed Theories. 2008. ⟨hal-00333750v2⟩
  • Tom Hirschowitz, Aurélien Pardon. Binding bigraphs as symmetric monoidal closed theories. 2008. ⟨hal-00333753v2⟩

Reports2 documents

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

Habilitation à diriger des recherches1 document

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