Univesité Pierre et Marie CURIE Colloquium 2017http://video.upmc.fr//differe.php?collec=S_C_colloquium2017Le colloquium Pierre et Marie Curie présente des exposés consacrés à la physique contemporaine et aux disciplines connexes. Ces exposés sont destinés à tous les étudiants et à tous les enseignants et chercheurs mais plus particulièrement aux étudiants de master et aux étudiants en thèse. Les exposés ont lieu soit en français soit en anglais.http://vodcast.upmc.fr/images/vignette_colloquium_17.pngColloquium 2017http://video.upmc.fr//differe.php?collec=S_C_colloquium2017Escape from the ivory tower: the Haskell journeyhttp://video.upmc.fr//differe.php?collec=S_C_colloquium2017&video=4Haskell is my first baby, born slightly before my son Michael, who is now in his mid-20s. From somewhat academic beginnings as a remorselessly pure functional programming language, Haskell has evolved into a practical tool used for real applications and, amazingly, is still in a state of furious innovation. In this talk I'll discuss Haskell's birth and evolution, including some of the research and engineering challenges we faced in design and implementation. I'll focus particularly on the ideas that have turned out, in retrospect, to be most important and influential, as well as sketching some current developments and making some wild guesses about the future.Tue, 23 May 2017 18:00:00 +0200S_C_colloquium2017_4Induced subgraphs and coloringhttp://video.upmc.fr//differe.php?collec=S_C_colloquium2017&video=3What causes a graph to have high chromatic number? One reason is that the graph may contain a large set of pairwise adjacent vertices (called a "clique"), but what can be said if that is not the case? Around 1985 Andras Gayfas made three conjectures about structures that must be present in a graph with large chromatic number all of whose cliques have bounded size. Recently, in joint work with Alex Scott, Paul Seymour and Sophie Sprikl we proved the strongest of these conjectures, that implies the other two. In this talk we will discuss some of the proof ideas, and related problems and theorems.Tue, 25 Apr 2017 20:00:00 +0200S_C_colloquium2017_3Understanding and Verifying JavaScript Programshttp://video.upmc.fr//differe.php?collec=S_C_colloquium2017&video=2The dynamic nature of JavaScript, together with its complex semantics, makes it a difficult target for logical analysis. This talk will describe JaVerT, a JavaScript Verification Toolchain, which we believe provides the first logic-based symbolic analysis tool for JavaScript. A key goal of the project has been to establish trust in JaVert, both through theoretical results and comprehensive testing. The talk is aimed at a general audience interested in program verification. Knowledge of JavaScript is not assumed. This talk describes joint work with Jose Fragoso Santos, Petar Maksimovic, Daiva Naudziuniene and Thomas Wood.Tue, 28 Mar 2017 18:00:00 +0200S_C_colloquium2017_2Interfaces Homme-Machine : Unifier les Principes pour Diversifier l'Interactionhttp://video.upmc.fr//differe.php?collec=S_C_colloquium2017&video=1Les interfaces de nos ordinateurs ont été créées dans les années 80 pour des applications de bureautique et n’ont pratiquement pas évolué depuis, alors que les usages de l’informatique se sont radicalement diversifiés. Pourtant, la recherche en Interaction Humain-Machine (IHM) a exploré de nombreuses pistes et produit de nombreuses inventions, comme les interfaces gestuelles, la réalité mixte ou les interfaces tangibles. Je présenterai certaines de ces directions de recherche et tenterai une prospective sur l’évolution de l’IHM. J’argumenterai qu’une refondation des principes de nos interfaces est nécessaire afin de rendre ces futurs possibles, et je décrirai les travaux que j’ai engagés dans le cadre de l’ERC ONE, fondés sur les concepts d’interaction instrumentale et de substrats d'information, afin de créer des environnements interactifs que les utilisateurs puissent s’approprier et (re)composer à leur guise.Tue, 28 Feb 2017 18:00:00 +0100S_C_colloquium2017_1