Tom Hirschowitz
Publications
Publications
|
|
An abstract, certified account of operational game semanticsESOP 2025 - 34th European Symposium on Programming, May 2025, Hamilton, Ontario, Canada. pp.172-199, ⟨10.1007/978-3-031-91118-7_7⟩ |
|
|
Variable binding and substitution for (nameless) dummies25th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2022), Apr 2022, Munich, Germany |
|
|
Modules over monads and operational semantics5th 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⟩ |
|
|
A Cellular Howe TheoremLICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken, Germany. pp.273-286, ⟨10.1145/3373718.3394738⟩ |
|
|
Cellular Monads from Positive GSOS Specifications26th International Workshop on Expressiveness in Concurrency and 16th Workshop on Structural Operational Semantics, 2019, Amsterdam, Netherlands. pp.1-18, ⟨10.4204/EPTCS.300.1⟩ |
|
|
Template Games, Simple Games, and Day Convolution4th 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⟩ |
|
|
What's in a game? A theory of game modelsLICS, 2018, Oxford, United Kingdom. pp.374-383, ⟨10.1145/3209108.3209114⟩ |
|
|
Justified Sequences in String Diagrams: a Comparison Between Two Approaches to Concurrent Game Semantics7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017), 2017, Ljubljana, Slovenia. pp.10, ⟨10.4230/LIPIcs.CALCO.2017.10⟩ |
Wild omega-Categories for the Homotopy Hypothesis in Type TheoryTyped Lambda Calculi and Applications, 2015, Varsovie, Poland. pp.226-240, ⟨10.4230/LIPIcs.TLCA.2015.226⟩ |
|
|
|
An Intensionally Fully-abstract Sheaf Model for pi6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), 2015, Nimègue, Netherlands. pp.86--100, ⟨10.4230/LIPIcs.CALCO.2015.86⟩ |
|
|
Full abstraction for fair testing in CCS5th Conference on Algebra and Coalgebra in Computer Science, 2013, Varsovie, France. pp.175-190, ⟨10.1007/978-3-642-40206-7_14⟩ |
|
|
Innocent strategies as presheaves and interactive equivalences for CCSICE, Jun 2011, Reykjavik, Iceland. pp.2-24, ⟨10.4204/EPTCS.59.2⟩ |
|
|
Contraction-free proofs and finitary games for Linear LogicMFPS 2009, 2009, Oxford, United Kingdom. pp.287-305, ⟨10.1016/j.entcs.2009.07.095⟩ |
|
|
Encapsulation and Dynamic Modularity in the Pi-CalculusPLACES 2008, 2008, Oslo, Norway. pp.85 - 100, ⟨10.1016/j.entcs.2009.06.005⟩ |
|
|
Variable binding, symmetric monoidal closed theories, and bigraphsCONCUR 2009, 2009, Bologna, Italy. pp.321-337, ⟨10.1007/978-3-642-04081-8_22⟩ |
|
|
A theory for game theoriesFSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007, New Delhi, India. pp.192-203, ⟨10.1007/978-3-540-77050-3⟩ |
|
|
Component-Oriented Programming with Sharing: Containment is not OwnershipGenerative Programming and Component Engineering (GPCE), 2005, Tallinn, Estonia. pp.389-404, ⟨10.1007/11561347_26⟩ |
|
|
Call-by-value mixin modules: Reduction semantics, side effects, typesEuropean Symposium on Programming, 2004, Barcelona, Spain. pp.64-78, ⟨10.1007/b96702⟩ |
|
|
Rigid Mixin ModulesFunctional and Logic Programming Symposium (FLOPS), 2004, Nara, Japan. pp.214-228, ⟨10.1007/b96926⟩ |
|
|
Compilation of extended recursion in call-by-value functional languagesPPDP '03, 2003, Uppsala, Sweden. pp.160--171, ⟨10.1145/888251.888267⟩ |
|
|
Mixin modules in a call-by-value settingEuropean Symposium on Programming, 2002, Grenoble, France. pp.207-236, ⟨10.1007/3-540-45927-8⟩ |
|
|
On the implementation of recursion in call-by-value functional languages[Research Report] RR-4728, INRIA. 2003 |
|
|
A reduction semantics for call-by-value mixin modules[Research Report] RR-4682, INRIA. 2002 |
|
|
Quelques ponts entre sémantique opérationnelle et modèles dénotationnels des langages de programmationLogique en informatique [cs.LO]. Université Grenoble Alpes, 2016 |