Registration
This shows you the differences between two versions of the page.
|
workshop_4 [2014/06/27 16:02] ong [Planning] |
workshop_4 [2014/06/30 11:02] (current) ong [Planning] |
||
|---|---|---|---|
| Line 29: | Line 29: | ||
| ^Monday 23 June||| | ^Monday 23 June||| | ||
| |9h30-10h30|//Registration and Introduction//|| | |9h30-10h30|//Registration and Introduction//|| | ||
| - | |11h00-12h00|Martin Hofmann|//Abstract Interpretation from Buchi Automata//| | + | |11h00-12h00|Martin Hofmann|//[[https://dl.dropboxusercontent.com/u/75950203/hofmann.pdf|Abstract Interpretation from Buchi Automata]]//| |
| - | |14h30-15h30|Olivier Serre|//What are collapsible pushdown automata good for?//| | + | |14h30-15h30|Olivier Serre|//[[http://www.liafa.univ-paris-diderot.fr/~serre/IHP/IHP_Serre_Full.pdf|What are collapsible pushdown automata good for?]]//| |
| |16h00-17h00|Sylvain Salvati|//Models for model checking higher-order programs//| | |16h00-17h00|Sylvain Salvati|//Models for model checking higher-order programs//| | ||
| ^Tuesday 24 June||| | ^Tuesday 24 June||| | ||
| Line 36: | Line 36: | ||
| |11h00-12h00|Giuseppe Castagna|//[[http://www.pps.univ-paris-diderot.fr/~gc/slides/polydeuces-slides.pdf|Polymorphic Functions with Set-Theoretic Types]]//| | |11h00-12h00|Giuseppe Castagna|//[[http://www.pps.univ-paris-diderot.fr/~gc/slides/polydeuces-slides.pdf|Polymorphic Functions with Set-Theoretic Types]]//| | ||
| |14h30-15h30|Ranjit Jhala|//[[http://goto.ucsd.edu/~rjhala/IHP14/lhs/Index.lhs.slides.html|Liquid Types For Haskell]]//| | |14h30-15h30|Ranjit Jhala|//[[http://goto.ucsd.edu/~rjhala/IHP14/lhs/Index.lhs.slides.html|Liquid Types For Haskell]]//| | ||
| - | |16h00-17h00|Jakob Rehof|//Types as Programs: Foundations of Combinatory Logic Synthesis//| | + | |16h00-17h00|Jakob Rehof|//[[https://dl.dropboxusercontent.com/u/75950203/rehof.pdf|Types as Programs: Foundations of Combinatory Logic Synthesis]]//| |
| |from 18h|//Cocktail at the Institut Henri Poincaré//|| | |from 18h|//Cocktail at the Institut Henri Poincaré//|| | ||
| ^Wednesday 25 June||| | ^Wednesday 25 June||| | ||
| - | | 9h30-10h30|Andrey Rybalchenko|//Solving (quantified) Horn constraints for program verification and synthesis//| | + | | 9h30-10h30|Andrey Rybalchenko|//[[https://dl.dropboxusercontent.com/u/75950203/rybalchenko.pdf|Solving (quantified) Horn constraints for program verification and synthesis]]//| |
| - | |11h00-12h00|Helmut Seidl|//Efficiently intertwining widening and narrowing//| | + | |11h00-12h00|Helmut Seidl|//[[https://dl.dropboxusercontent.com/u/75950203/seidl.pdf|Efficiently intertwining widening and narrowing]]//| |
| ^Thursday 26 June||| | ^Thursday 26 June||| | ||
| - | | 9h30-10h30|Colin Stirling|//Deciding equivalence using type checking//| | + | | 9h30-10h30|Colin Stirling|//[[http://homepages.inf.ed.ac.uk/cps/paris.pdf|Deciding equivalence using type checking]]//| |
| - | |11h00-12h00|Kazushige Terui|//On applications of models of linear logic//| | + | |11h00-12h00|Kazushige Terui|//[[https://dl.dropboxusercontent.com/u/75950203/terui.pdf|On applications of models of linear logic]]//| |
| |14h30-15h30|Paul-André Melliès|//Linear logic and higher-order model-checking//| | |14h30-15h30|Paul-André Melliès|//Linear logic and higher-order model-checking//| | ||
| - | |16h00-17h00|Pierre Clairambault|//[[http://www.pps.univ-paris-diderot.fr/~gc/slides/polydeuces-slides.pdf|Strategies as Higher-Order Recursion Schemes]]//| | + | |16h00-17h00|Pierre Clairambault|//[[http://perso.ens-lyon.fr/pierre.clairambault/Clairambault-IHP260614.pdf|Strategies as Higher-Order Recursion Schemes]]//| |
| ^Friday 27 June||| | ^Friday 27 June||| | ||
| | 9h30-10h30|Rupak Majumdar|//[[http://www.mpi-sws.org/~rupak/Talks/IHP2014.ppt|Abstractions in the Continuous World]]//| | | 9h30-10h30|Rupak Majumdar|//[[http://www.mpi-sws.org/~rupak/Talks/IHP2014.ppt|Abstractions in the Continuous World]]//| | ||