Nombre de documents

29

Tom Hirschowitz


Article dans une revue7 documents

Communication dans un congrès13 documents

  • Clovis Eberhart, Tom Hirschowitz, Thomas Seiller. An Intensionally Fully-abstract Sheaf Model for pi. 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), 2015, Nimègue, Netherlands. 35, pp.86--100, 2015, 〈http://drops.dagstuhl.de/opus/volltexte/2015/5528〉. 〈10.4230/LIPIcs.CALCO.2015.86〉. 〈hal-00873626v2〉
  • André Hirschowitz, Tom Hirschowitz, Nicolas Tabareau. Wild omega-Categories for the Homotopy Hypothesis in Type Theory. Typed Lambda Calculi and Applications, 2015, Varsovie, Poland. 38, pp.226-240, 2015, 〈10.4230/LIPIcs.TLCA.2015.226〉. 〈hal-01178301〉
  • Tom Hirschowitz. Full abstraction for fair testing in CCS. 5th Conference on Algebra and Coalgebra in Computer Science, 2013, Varsovie, France. 8089, pp.175-190, 2013, 〈10.1007/978-3-642-40206-7_14〉. 〈hal-00826274〉
  • Tom Hirschowitz, Damien Pous. Innocent strategies as presheaves and interactive equivalences for CCS. ICE, Jun 2011, Reykjavik, Iceland. 59, pp.2-24, 2011, EPTCS. 〈10.4204/EPTCS.59.2〉. 〈hal-00616648〉
  • Richard Garner, Tom Hirschowitz, Aurélien Pardon. Variable binding, symmetric monoidal closed theories, and bigraphs. Bravetti, Mario; Zavattaro, Gianluigi. CONCUR 2009, 2009, Bologna, Italy. Springer, 5710, pp.321-337, 2009, Lecture Notes in Computer Science. 〈10.1007/978-3-642-04081-8_22〉. 〈hal-00388100〉
  • André Hirschowitz, Michel Hirschowitz, Tom Hirschowitz. Contraction-free proofs and finitary games for Linear Logic. MFPS 2009, 2009, Oxford, United Kingdom. Elsevier, 249, pp.287-305, 2009, Electronic Notes in Theoretical Computer Science. 〈10.1016/j.entcs.2009.07.095〉. 〈hal-00387452〉
  • Daniel Hirschkoff, Aurélien Pardon, Tom Hirschowitz, Samuel Hym, Damien Pous. Encapsulation and Dynamic Modularity in the Pi-Calculus. PLACES 2008, 2008, Oslo, Norway. Elsevier, 241, pp.85 - 100, 2009, Electronic Notes in Theoretical Computer Science. 〈10.1016/j.entcs.2009.06.005〉. 〈hal-00400159〉
  • Michel Hirschowitz, André Hirschowitz, Tom Hirschowitz. A theory for game theories. FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007, New Delhi, India. Springer, 4855, pp.192-203, 2007, Lecture Notes in Computer Science. 〈10.1007/978-3-540-77050-3〉. 〈hal-00310542〉
  • Daniel Hirschkoff, Tom Hirschowitz, Damien Pous, Alan Schmitt, Jean-Bernard Stefani. Component-Oriented Programming with Sharing: Containment is not Ownership. Generative Programming and Component Engineering (GPCE), 2005, Tallinn, Estonia. Springer, 3676, pp.389-404, 2005, Lecture Notes in Computer Science. 〈10.1007/11561347_26〉. 〈hal-00310126〉
  • Tom Hirschowitz, Xavier Leroy, J. B. Wells. Call-by-value mixin modules: Reduction semantics, side effects, types. European Symposium on Programming, 2004, Barcelona, Spain. Springer, 2986, pp.64-78, 2004, Lecture Notes in Computer Science. 〈10.1007/b96702〉. 〈hal-00310123〉
  • Tom Hirschowitz. Rigid Mixin Modules. Functional and Logic Programming Symposium (FLOPS), 2004, Nara, Japan. Springer, 2998, pp.214-228, 2004, Lecture Notes in Computer Science. 〈10.1007/b96926〉. 〈hal-00310124〉
  • Tom Hirschowitz, Xavier Leroy, J. B. Wells. Compilation of extended recursion in call-by-value functional languages. PPDP '03, 2003, Uppsala, Sweden. ACM, pp.160--171, 2003, 〈10.1145/888251.888267〉. 〈hal-00310121〉
  • Tom Hirschowitz, Xavier Leroy. Mixin modules in a call-by-value setting. European Symposium on Programming, 2002, Grenoble, France. Springer, 2305, pp.207-236, 2002, Lecture Notes in Computer Science. 〈10.1007/3-540-45927-8〉. 〈hal-00310119〉

Pré-publication, Document de travail6 documents

  • Clovis Eberhart, Tom Hirschowitz. Game semantics as a singular functor, and definability as geometric realisation. 2017. 〈hal-01527171〉
  • Clovis Eberhart, Tom Hirschowitz. Justified sequences in string diagrams: a comparison between two approaches to concurrent game semantics. 2016. 〈hal-01372582〉
  • Richard Garner, Tom Hirschowitz. Shapely monads and analytic functors. 2015. 〈hal-01246365v3〉
  • André Hirschowitz, Michel Hirschowitz, Tom Hirschowitz. Topological Observations on Multiplicative Additive Linear Logic. 12 pages in two columns. Uses Paul Taylor's diagrams. 2008. 〈hal-00295949〉
  • Richard Garner, Tom Hirschowitz, Aurélien Pardon. Graphical Presentations of Symmetric Monoidal Closed Theories. Uses Paul Taylor's diagrams. 2008. 〈hal-00333750v2〉
  • Tom Hirschowitz, Aurélien Pardon. Binding bigraphs as symmetric monoidal closed theories. 17 pages, uses Paul Taylor's diagrams. 2008. 〈hal-00333753v2〉

Rapport2 documents

  • Tom Hirschowitz, Xavier Leroy, J. B. Wells. On the implementation of recursion in call-by-value functional languages. [Research Report] RR-4728, INRIA. 2003. 〈inria-00071858〉
  • Tom Hirschowitz, Xavier Leroy, Joe B. Wells. A reduction semantics for call-by-value mixin modules. [Research Report] RR-4682, INRIA. 2002. 〈inria-00071903〉

HDR1 document

  • Tom Hirschowitz. Quelques ponts entre sémantique opérationnelle et modèles dénotationnels des langages de programmation. Logique en informatique [cs.LO]. Université Grenoble Alpes, 2016. 〈tel-01400666〉