Tom Hirschowitz

According to our database1, Tom Hirschowitz authored at least 31 papers between 2004 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 




A Cellular Howe Theorem.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Modules over Monads and Operational Semantics.
Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

Familial monads and structural operational semantics.
Proc. ACM Program. Lang., 2019

Cellular Monads from Positive GSOS Specifications.
Proceedings of the Proceedings Combined 26th International Workshop on Expressiveness in Concurrency and 16th Workshop on Structural Operational Semantics, 2019

Template Games, Simple Games, and Day Convolution.
Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

Shapely monads and analytic functors.
J. Log. Comput., 2018

Simple game semantics and Day convolution.
CoRR, 2018

What's in a game?: A theory of game models.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

An intensionally fully-abstract sheaf model for π (expanded version).
Log. Methods Comput. Sci., 2017

Justified Sequences in String Diagrams: a Comparison Between Two Approaches to Concurrent Game Semantics.
Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science, 2017

Quelques ponts entre sémantique opérationnelle et modèles dénotationnels des langages de programmation.
, 2016

Wild omega-Categories for the Homotopy Hypothesis in Type Theory.
Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications, 2015

An Intensionally Fully-abstract Sheaf Model for pi.
Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

Full abstraction for fair testing in CCS (expanded version).
Log. Methods Comput. Sci., 2014

Cartesian closed 2-categories and permutation equivalence in higher-order rewriting.
Log. Methods Comput. Sci., 2013

Fully-abstract concurrent games for pi.
CoRR, 2013

Full Abstraction for Fair Testing in CCS.
Proceedings of the Algebra and Coalgebra in Computer Science, 2013

Strategies as sheaves and interactive equivalences for CCS
CoRR, 2011

Innocent strategies as presheaves and interactive equivalences for CCS
Proceedings of the Proceedings Fourth Interaction and Concurrency Experience, 2011

Compilation of extended recursion in call-by-value functional languages.
High. Order Symb. Comput., 2009

Contraction-free Proofs and Finitary Games for Linear Logic.
Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, 2009

Encapsulation and Dynamic Modularity in the pi-calculus.
Electron. Notes Theor. Comput. Sci., 2009

Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

Graphical Presentations of Symmetric Monoidal Closed Theories
CoRR, 2008

Binding bigraphs as symmetric monoidal closed theories
CoRR, 2008

Topological Observations on Multiplicative Additive Linear Logic
CoRR, 2008

A Theory for Game Theories.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Mixin modules in a call-by-value setting.
ACM Trans. Program. Lang. Syst., 2005

Component-Oriented Programming with Sharing: Containment is Not Ownership.
Proceedings of the Generative Programming and Component Engineering, 2005

Rigid Mixin Modules.
Proceedings of the Functional and Logic Programming, 7th International Symposium, 2004

Call-by-Value Mixin Modules: Reduction Semantics, Side Effects, Types.
Proceedings of the Programming Languages and Systems, 2004