<li><b>[12.20-12.55]</b> Joachim Niehren (LIFL): <i>Learning node selecting tree
transducer from completely annotated examples</i>
<p/><b>[13.00-14.00] Repas (pot ENS)</b><p/></li>
...
...
@@ -50,7 +50,7 @@ the content by <a href="examples.html#site">the following CDuce program</a>.
<li><b>[14.25-14.50]</b> Daniele Varacca (ENS):<i>Semantic subtyping for the pi-calculus.</i></li>
<li><b>[14.50-15.15]</b> Iovka Boneva (LIFL): <i>Class of automata for unranked unordered
trees and connection with the TQL logic.</i> (<ahref="http://www.lifl.fr/~boneva/papers/tralala041103.pdf">slides</a>)</li>
<li><b>[15.15-15.40]</b> Anca Muscholl (LIAFA): <i>Automates avec des conditions Presburger.</i>
<li><b>[15.15-15.40]</b> Anca Muscholl (LIAFA): <i>Automates avec des conditions Presburger.</i> (<ahref="http://www.cduce.org/tralala_documents/presburg.pdf">slides</a>).
<p/><b>[15.40-16.00] Pause</b><p/></li>
<li><b>[16.00-18.30]</b><i> Discussion et organisation gnrale</i> (planification, prochaines runions, coordination, etc.)</li>