Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Tom Hirschowitz
2010 – today
- 2013
[c9]- [i10]
- [i9]Tom Hirschowitz: Cartesian closed 2-categories and permutation equivalence in higher-order rewriting. CoRR abs/1307.6318 (2013)
- 2012
- [j5]Tom Hirschowitz, Damien Pous: Innocent Strategies as Presheaves and Interactive Equivalences for CCS. Sci. Ann. Comp. Sci. 22(1): 147-199 (2012)
- 2011
- [c8]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
- [j4]Daniel Hirschkoff, Aurélien Pardon, Tom Hirschowitz, Samuel Hym, Damien Pous: Encapsulation and Dynamic Modularity in the pi-calculus. Electr. Notes Theor. Comput. Sci. 241: 85-100 (2009)
- [j3]André Hirschowitz, Michel Hirschowitz, Tom Hirschowitz: Contraction-free Proofs and Finitary Games for Linear Logic. Electr. Notes Theor. Comput. Sci. 249: 287-305 (2009)
- [j2]Tom Hirschowitz, Xavier Leroy, J. B. Wells: Compilation of extended recursion in call-by-value functional languages. Higher-Order and Symbolic Computation 22(1): 3-66 (2009)
- [c7]Richard H. G. Garner, Tom Hirschowitz, Aurélien Pardon: Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs. CONCUR 2009: 321-337
- [e1]
- [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 H. G. 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
- [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 H. G. 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]
- 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]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:06 CEST by the dblp team