Nombre de documents trouvés : 19 documents

1 - 2

Innocent strategies as presheaves and interactive equivalences for CCS (expanded version) Hirschowitz T., Pous D. [hal-00555144 - version 2] (20/09/2011)

Innocent strategies as presheaves and interactive equivalences for CCS Hirschowitz T., Pous D. Electronic Proceedings in Theoretical Computer Science 59 (2011) 2-24 [hal-00616648 - version 1]

Cartesian closed 2-categories and permutation equivalence in higher-order rewriting Hirschowitz T. [hal-00540205 - version 2] (29/01/2011)

Encapsulation and Dynamic Modularity in the Pi-Calculus Hirschkoff D., Pardon A., Hirschowitz T., Hym S., Pous D. Dans Proceedings of the First Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software (PLACES 2008) - PLACES 2008, Norvège (2008) [hal-00400159 − version 1]

Variable binding, symmetric monoidal closed theories, and bigraphs Garner R., Hirschowitz T., Pardon A. Dans CONCUR 2009 - Concurrency Theory - CONCUR 2009, Italie (2009) [hal-00388100 − version 1]

Contraction-free proofs and finitary games for Linear Logic Hirschowitz A., Hirschowitz M., Hirschowitz T. Dans Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics (MFPS 2009) - MFPS 2009, Royaume-Uni (2009) [hal-00387452 − version 1]

Compilation of extended recursion in call-by-value functional languages Hirschowitz T., Leroy X., Wells J.B. Higher-Order and Symbolic Computation 22, 1 (2009) 3-66 [hal-00359213 - version 1]

Binding bigraphs as symmetric monoidal closed theories Hirschowitz T., Pardon A. [hal-00333753 − version 2] (08/06/2009)

Graphical Presentations of Symmetric Monoidal Closed Theories Garner R., Hirschowitz T., Pardon A. [hal-00333750 − version 2] (08/06/2009)

Topological Observations on Multiplicative Additive Linear Logic Hirschowitz A., Hirschowitz M., Hirschowitz T. [hal-00295949 - version 1] (2008-07-11)

1 - 2

L'URL de cette page est : http://hal.archives-ouvertes.fr/aut/Tom Hirschowitz/