default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTom Hirschowitz
Person information
- affiliation: Savoie Mont Blanc University, Le Bourget-du-Lac, France
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]André Hirschowitz, Tom Hirschowitz, Ambroise Lafont, Marco Maggesi
:
Variable binding and substitution for (nameless) dummies. Log. Methods Comput. Sci. 20(1) (2024)- 2023
- [i19]Tom Hirschowitz, Ambroise Lafont:
A more general categorical framework for congruence of applicative bisimilarity. CoRR abs/2303.11679 (2023) - 2022
- [j10]André Hirschowitz, Tom Hirschowitz, Ambroise Lafont:
Modules over monads and operational semantics (expanded version). Log. Methods Comput. Sci. 18(3) (2022) - [j9]Tom Hirschowitz, Ambroise Lafont:
A categorical framework for congruence of applicative bisimilarity in higher-order languages. Log. Methods Comput. Sci. 18(3) (2022) - [c20]André Hirschowitz, Tom Hirschowitz, Ambroise Lafont, Marco Maggesi:
Variable binding and substitution for (nameless) dummies. FoSSaCS 2022: 389-408 - [i18]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. CoRR abs/2204.03870 (2022) - [i17]André Hirschowitz, Tom Hirschowitz, Ambroise Lafont, Marco Maggesi:
Variable binding and substitution for (nameless) dummies. CoRR abs/2209.02614 (2022) - 2021
- [i16]Tom Hirschowitz, Ambroise Lafont:
A categorical framework for congruence of applicative bisimilarity in higher-order languages. CoRR abs/2103.16833 (2021) - 2020
- [c19]André Hirschowitz, Tom Hirschowitz, Ambroise Lafont:
Modules over Monads and Operational Semantics. FSCD 2020: 12:1-12:23 - [c18]Peio Borthelle, Tom Hirschowitz, Ambroise Lafont:
A Cellular Howe Theorem. LICS 2020: 273-286 - [i15]André Hirschowitz, Tom Hirschowitz, Ambroise Lafont:
Modules over monads and operational semantics. CoRR abs/2012.06530 (2020)
2010 – 2019
- 2019
- [j8]Tom Hirschowitz:
Familial monads and structural operational semantics. Proc. ACM Program. Lang. 3(POPL): 21:1-21:28 (2019) - [c17]Clovis Eberhart, Tom Hirschowitz, Alexis Laouar:
Template Games, Simple Games, and Day Convolution. FSCD 2019: 16:1-16:19 - [c16]Tom Hirschowitz:
Cellular Monads from Positive GSOS Specifications. EXPRESS/SOS 2019: 1-18 - 2018
- [j7]Richard Garner, Tom Hirschowitz:
Shapely monads and analytic functors. J. Log. Comput. 28(1): 33-83 (2018) - [c15]Clovis Eberhart, Tom Hirschowitz:
What's in a game?: A theory of game models. LICS 2018: 374-383 - [i14]Clovis Eberhart, Tom Hirschowitz, Alexis Laouar:
Simple game semantics and Day convolution. CoRR abs/1810.06991 (2018) - 2017
- [j6]Clovis Eberhart, Tom Hirschowitz, Thomas Seiller:
An intensionally fully-abstract sheaf model for π (expanded version). Log. Methods Comput. Sci. 13(4) (2017) - [c14]Clovis Eberhart, Tom Hirschowitz:
Justified Sequences in String Diagrams: a Comparison Between Two Approaches to Concurrent Game Semantics. CALCO 2017: 10:1-10:16 - [i13]Clovis Eberhart, Tom Hirschowitz, Thomas Seiller:
An intensionally fully-abstract sheaf model for π (expanded version). CoRR abs/1710.06744 (2017) - [i12]Clovis Eberhart, Tom Hirschowitz:
What's in a game? A theory of game models. CoRR abs/1711.10860 (2017) - 2016
- [b1]Tom Hirschowitz:
Quelques ponts entre sémantique opérationnelle et modèles dénotationnels des langages de programmation. Grenoble Alpes University, France, 2016 - 2015
- [c13]Clovis Eberhart, Tom Hirschowitz, Thomas Seiller:
An Intensionally Fully-abstract Sheaf Model for pi. CALCO 2015: 86-100 - [c12]André Hirschowitz, Tom Hirschowitz, Nicolas Tabareau:
Wild omega-Categories for the Homotopy Hypothesis in Type Theory. TLCA 2015: 226-240 - [i11]Richard Garner, Tom Hirschowitz:
Shapely monads and analytic functors. CoRR abs/1512.05980 (2015) - 2014
- [j5]Tom Hirschowitz:
Full abstraction for fair testing in CCS (expanded version). Log. Methods Comput. Sci. 10(4) (2014) - 2013
- [j4]Tom Hirschowitz:
Cartesian closed 2-categories and permutation equivalence in higher-order rewriting. Log. Methods Comput. Sci. 9(3) (2013) - [c11]Tom Hirschowitz:
Full Abstraction for Fair Testing in CCS. CALCO 2013: 175-190 - [i10]Tom Hirschowitz:
Full abstraction for fair testing in CCS. CoRR abs/1305.6184 (2013) - [i9]Clovis Eberhart, Tom Hirschowitz, Thomas Seiller:
Fully-abstract concurrent games for pi. CoRR abs/1310.4306 (2013) - 2012
- [j3]Tom Hirschowitz, Damien Pous:
Innocent Strategies as Presheaves and Interactive Equivalences for CCS. Sci. Ann. Comput. Sci. 22(1): 147-199 (2012) - 2011
- [c10]Tom Hirschowitz, Damien Pous:
Innocent strategies as presheaves and interactive equivalences for CCS. ICE 2011: 2-24 - [i8]Tom Hirschowitz, Damien Pous:
Strategies as sheaves and interactive equivalences for CCS. CoRR abs/1109.4356 (2011)
2000 – 2009
- 2009
- [j2]Tom Hirschowitz, Xavier Leroy, J. B. Wells:
Compilation of extended recursion in call-by-value functional languages. High. Order Symb. Comput. 22(1): 3-66 (2009) - [c9]Richard Garner, Tom Hirschowitz, Aurélien Pardon:
Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs. CONCUR 2009: 321-337 - [c8]André Hirschowitz, Michel Hirschowitz, Tom Hirschowitz:
Contraction-free Proofs and Finitary Games for Linear Logic. MFPS 2009: 287-305 - [e1]Tom Hirschowitz:
Proceedings Types for Proofs and Programs, Revised Selected Papers, TYPES 2009, Aussois, France, 12-15th May 2009. EPTCS 53, 2009 [contents] - [i7]Tom Hirschowitz, Xavier Leroy, J. B. Wells:
Compilation of extended recursion in call-by-value functional languages. CoRR abs/0902.1257 (2009) - [i6]André Hirschowitz, Michel Hirschowitz, Tom Hirschowitz:
Contraction-free proofs and finitary games for Linear Logic. CoRR abs/0905.4064 (2009) - [i5]Richard Garner, Tom Hirschowitz, Aurélien Pardon:
Variable binding, symmetric monoidal closed theories, and bigraphs. CoRR abs/0905.4200 (2009) - [i4]Daniel Hirschkoff, Aurélien Pardon, Tom Hirschowitz, Samuel Hym, Damien Pous:
Encapsulation and Dynamic Modularity in the Pi-Calculus. CoRR abs/0906.5446 (2009) - 2008
- [c7]Daniel Hirschkoff, Aurélien Pardon, Tom Hirschowitz, Samuel Hym, Damien Pous:
Encapsulation and Dynamic Modularity in the pi-calculus. PLACES@DisCoTec 2008: 85-100 - [i3]André Hirschowitz, Michel Hirschowitz, Tom Hirschowitz:
Topological Observations on Multiplicative Additive Linear Logic. CoRR abs/0807.2636 (2008) - [i2]Tom Hirschowitz, Aurélien Pardon:
Binding bigraphs as symmetric monoidal closed theories. CoRR abs/0810.4419 (2008) - [i1]Richard Garner, Tom Hirschowitz, Aurélien Pardon:
Graphical Presentations of Symmetric Monoidal Closed Theories. CoRR abs/0810.4420 (2008) - 2007
- [c6]Michel Hirschowitz, André Hirschowitz, Tom Hirschowitz:
A Theory for Game Theories. FSTTCS 2007: 192-203 - 2005
- [j1]Tom Hirschowitz, Xavier Leroy:
Mixin modules in a call-by-value setting. ACM Trans. Program. Lang. Syst. 27(5): 857-881 (2005) - [c5]Daniel Hirschkoff, Tom Hirschowitz, Damien Pous, Alan Schmitt, Jean-Bernard Stefani:
Component-Oriented Programming with Sharing: Containment is Not Ownership. GPCE 2005: 389-404 - 2004
- [c4]Tom Hirschowitz, Xavier Leroy, J. B. Wells:
Call-by-Value Mixin Modules: Reduction Semantics, Side Effects, Types. ESOP 2004: 64-78 - [c3]Tom Hirschowitz:
Rigid Mixin Modules. FLOPS 2004: 214-228 - 2003
- [c2]Tom Hirschowitz, Xavier Leroy, J. B. Wells:
Compilation of extended recursion in call-by-value functional languages. PPDP 2003: 160-171 - 2002
- [c1]Tom Hirschowitz, Xavier Leroy:
Mixin Modules in a Call-by-Value Setting. ESOP 2002: 6-20
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
