Planning (provisoire du 29.1.14 1h) des soutenances des devoirs de TAS : 8h30-13h 
------------------------------------------------------------------

10 minutes d'expose' suivies de 5 minutes de questions 


8h30-10h30 

salle 24-34 201 

CANTAIS - CHASSON : Hindley-Milner Elaboration in Applicative Style
PERUCKI - ROUX : Closed Type Families with Overlapping Equations  
DEQUEKER - VAROUMAS : On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi 
CARRE - ZIAT : une application Web ou une applet de typage d'un mini-ML fonctionnel et impe'ratif  (js_of_ocaml)
BEGAY - RAKOTONIRA : Compilation d'un langage a` la ML vers du lambda-calcul (langage d'implantation ocaml).
FITOUSSI - REICHERT : Gradual Typing Embedded Securely in JavaScript 


10h45-13h00

salle STL  : 

BADOUAL - HAREL : Refactoring Java Generics by Inferring Wildcards, In Practice
SALL : First-class Runtime Generation of High-performance Types using Exotypes 
LEROUX - MOUNIER : Rate Types for Stream Programs 
DESPOINTES - LUPINSKI  : Type Reconstruction for the Linear π-Calculus with Composite and Equi-Recursive Types 
CUI - FAZOUANE : Counter-Factual Typing for Debugging Type Errors
GASPARD_BARANTES : Bounded Linear Types in a Resource Semiring 
DAHAB  :  Profiling For Laziness
TOLZE : Profiling For Laziness

salle Mac 

MICHEL - NADARAJAH : Refactoring Java Generics by Inferring Wildcards, In Practice
PIGEOT - VIDAL :  First-class Runtime Generation of High-performance Types using Exotypes 
BAENA - DIAGNE :  Profiling For Laziness
MOUILLAC - ZENATI : Complexity of Model-Checking Call-by-Value Programs
AKCHA - BIDANE : Counter-Factual Typing for Debugging Type Errors
KASSAS : Optimal Inference of Fields in Row-Polymorphic Records 
PEYROT : Optimal Inference of Fields in Row-Polymorphic Records