Tom Hirschowitz

According to our database, Tom Hirschowitz authored at least 36 papers between 2004 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Variable binding and substitution for (nameless) dummies.

André Hirschowitz, Tom Hirschowitz, Ambroise Lafont, Marco Maggesi

Log. Methods Comput. Sci., 2024

2023

A more general categorical framework for congruence of applicative bisimilarity.

Tom Hirschowitz, Ambroise Lafont

CoRR, 2023

2022

A categorical framework for congruence of applicative bisimilarity in higher-order languages.

Tom Hirschowitz, Ambroise Lafont

Log. Methods Comput. Sci., 2022

Modules over monads and operational semantics (expanded version).

André Hirschowitz, Tom Hirschowitz, Ambroise Lafont

Log. Methods Comput. Sci., 2022

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

CoRR, 2022

2020

A Cellular Howe Theorem.

Peio Borthelle, Tom Hirschowitz, Ambroise Lafont

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

Modules over Monads and Operational Semantics.

André Hirschowitz, Tom Hirschowitz, Ambroise Lafont

Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

2019

Familial monads and structural operational semantics.

Tom Hirschowitz

Proc. ACM Program. Lang., 2019

Cellular Monads from Positive GSOS Specifications.

Tom Hirschowitz

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.

Clovis Eberhart, Tom Hirschowitz, Alexis Laouar

Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

2018

Shapely monads and analytic functors.

Richard Garner, Tom Hirschowitz

J. Log. Comput., 2018

Simple game semantics and Day convolution.

Clovis Eberhart, Tom Hirschowitz, Alexis Laouar

CoRR, 2018

What's in a game?: A theory of game models.

Clovis Eberhart, Tom Hirschowitz

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017

An intensionally fully-abstract sheaf model for π (expanded version).

Clovis Eberhart, Tom Hirschowitz, Thomas Seiller

Log. Methods Comput. Sci., 2017

Justified Sequences in String Diagrams: a Comparison Between Two Approaches to Concurrent Game Semantics.

Clovis Eberhart, Tom Hirschowitz

Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science, 2017

2016

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

Tom Hirschowitz

, 2016

2015

Wild omega-Categories for the Homotopy Hypothesis in Type Theory.

André Hirschowitz, Tom Hirschowitz, Nicolas Tabareau

Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications, 2015

An Intensionally Fully-abstract Sheaf Model for pi.

Clovis Eberhart, Tom Hirschowitz, Thomas Seiller

Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

2014

Full abstraction for fair testing in CCS (expanded version).

Tom Hirschowitz

Log. Methods Comput. Sci., 2014

2013

Cartesian closed 2-categories and permutation equivalence in higher-order rewriting.

Tom Hirschowitz

Log. Methods Comput. Sci., 2013

Fully-abstract concurrent games for pi.

Clovis Eberhart, Tom Hirschowitz, Thomas Seiller

CoRR, 2013

Full Abstraction for Fair Testing in CCS.

Tom Hirschowitz

Proceedings of the Algebra and Coalgebra in Computer Science, 2013

2011

Strategies as sheaves and interactive equivalences for CCS

Tom Hirschowitz, Damien Pous

CoRR, 2011

Innocent strategies as presheaves and interactive equivalences for CCS

Tom Hirschowitz, Damien Pous

Proceedings of the Proceedings Fourth Interaction and Concurrency Experience, 2011

2009

Compilation of extended recursion in call-by-value functional languages.

Tom Hirschowitz, Xavier Leroy, J. B. Wells

High. Order Symb. Comput., 2009

Contraction-free Proofs and Finitary Games for Linear Logic.

André Hirschowitz, Michel Hirschowitz, Tom Hirschowitz

Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, 2009

Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs.

Richard Garner, Tom Hirschowitz, Aurélien Pardon

Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008

Encapsulation and Dynamic Modularity in the pi-calculus.

Daniel Hirschkoff, Aurélien Pardon, Tom Hirschowitz, Samuel Hym, Damien Pous

Proceedings of the First Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software, 2008

Graphical Presentations of Symmetric Monoidal Closed Theories

Richard Garner, Tom Hirschowitz, Aurélien Pardon

CoRR, 2008

Binding bigraphs as symmetric monoidal closed theories

Tom Hirschowitz, Aurélien Pardon

CoRR, 2008

Topological Observations on Multiplicative Additive Linear Logic

André Hirschowitz, Michel Hirschowitz, Tom Hirschowitz

CoRR, 2008

2007

A Theory for Game Theories.

Michel Hirschowitz, André Hirschowitz, Tom Hirschowitz

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2005

Mixin modules in a call-by-value setting.

Tom Hirschowitz, Xavier Leroy

ACM Trans. Program. Lang. Syst., 2005

Component-Oriented Programming with Sharing: Containment is Not Ownership.

Daniel Hirschkoff, Tom Hirschowitz, Damien Pous, Alan Schmitt, Jean-Bernard Stefani

Proceedings of the Generative Programming and Component Engineering, 2005

2004

Rigid Mixin Modules.

Tom Hirschowitz

Proceedings of the Functional and Logic Programming, 7th International Symposium, 2004

Call-by-Value Mixin Modules: Reduction Semantics, Side Effects, Types.

Tom Hirschowitz, Xavier Leroy, J. B. Wells

Proceedings of the Programming Languages and Systems, 2004