Romain Demangeon

Reaching me

Mobile : 0033.6.26.64.13.54     Uni : Queen Mary, University of London Mile End Road LONDON E1 4NS Home : 102, Central House 32-66 High Street, Stratford LONDON E14 2NY email : romain dot demangeon at eecs dot qmul dot ac dot uk

Situation

Im a currently Research Assistant at Queen Mary, University of London, in Kohei Honda's team. Previously (October 2010) I have visited the Comète team-project at LiX. I have also defended my PhD November 23rd 2010, entitled "Termination of Concurrent Systems", in the PLUME team of the Computer Science department of l'Ecole Normale Superieure de Lyon, under the supervising of Daniel Hirschkoff and Davide Sangiorgi.

My cv here.

Research

Papers

In International journals:

• Termination in higher order concurrent calculi,
  R. Demangeon, D. Hirschkoff, D. Sangiorgi in Special issue of J. of Log. and Algebr. Program. for 20th Nordic Workshop on Programming Theory, NWPT 2008.
  
• Mobile Processes and Termination,
  R. Demangeon, D. Hirschkoff, D. Sangiorgi in Semantics and Algebraic Specification 2009: 250-273
  

  In International conference proceedings:

• On the complexity of termination inference for processes,
  R. Demangeon, D. Hirschkoff, N. Kobayashi, D. Sangiorgi , in Proc. TGC'07, November 2007.
  
• Static and dynamic typing for the termination of mobile processes,
  R. Demangeon, D. Hirschkoff, D. Sangiorgi in Proc. IFIP/TCS 2008, September 2008.
  
• Termination in higher order concurrent calculi,
  R. Demangeon, D. Hirschkoff, D. Sangiorgi in Proc. FSEN 2009, Avril 2009.
  
• Termination in impure concurrent language,
  R. Demangeon, D. Hirschkoff, D. Sangiorgi, in Proc. CONCUR 2010, September 2010.
  
• Termination in impure lambda-calculus,
  R. Demangeon, D. Hirschkoff, D. Sangiorgi, in Proc. FSEN 2011 (to appear)
  
• Full abstraction in pi-calculus with linear types,
  R. Demangeon, K. Honda, in Proc. CONCUR 2011 (to appear)
  

Presentations and other works

• Report of my Master Thesis (french)
• Slides TGC'07 On the complexity of termination inference for processes
• Slides TCS'08 Static and dynamic typing for the termination of mobile processes
• Slides NWPT'08 Type systems for the termination of mobile processes
• Slides COMPLICE 01/09 Terminaison en pi-calcul (french)
• Slides FSEN'09 Termination in higher-order concurrent calculi
• Slides WST'09 Type systems for the termination of mobile processes
• Slides YRCONCUR'09 Type systems for the termination of mobile processes
• Slides LAC/GEOCAL'10 Terminaison dans les langages fonctionnels impurs (french)
• Slides TIC'10 Termination of Mobile Processes
• Slides CONCUR'10 Termination in impure concurrent languages
• Slides PhD Thesis defence.
• Slides FSEN'11 Strong normalisation in lambda-calculi with references
• Slides DCW'11 Full abstraction in a pi-calculus with linear types .

Teachings (french)

• Monitorats 2009-2010
  • ENS Lyon: Programmation 1: paradigmes de programmation, lambda-calcoul (L3, 2009-2010).
  • UCBL: LIF5 (TP) (L2, 2009-2010).
• Monitorats 2008-2009 à l'ENS Lyon
  • Programmation 1: paradigmes de programmation, lambda-calcoul (L3, 2008-2009).
  • Programmation 2 (L3, 2009-2009).
• Monitorats 2007-2008 à l'ENS Lyon:
  • Programmation 2 : logique, sémantique et réécriture (L3, 2007-2008).
  • Fondements de l'Informatique 2: calculabilité et théorie des modèles (L3, 2007-2008).
• Projet Matlab, pour les classes préparatoires du Lycée la Martinière Monplaisir (2006-2008).

Misc. (french)

• La liste (manuscrite) de mes développements d'Informatique pour l'Agrégation de Mathématiques (année scolaire 2005-2006): ( page 1 , page 2 )

(cette page en français)