Computational logic and Applications.
How to reach the workshop room
| Monday, 20.06.2005 9:00-9:30 Marek Zaionc (Krakow) Counting terms and types 9:45-10:15 Jakub Kozik (Krakow) Relative densities of languages- decidability analysis. Coffee Break (10.15 - 10.45) 10.45- 11:15 Jean Duprat (Lyon) "Inductive definitions for
discrete plane geometry" 11:30 - 12:00 Pawel Idziak (Krakow) Decidability of first order theories of finite algebras. 12:00 - 14:00 Lunch 14:00 - 15:00 Daniele Gardy (Versailles) "Random boolean expressions " 15:30 - 16:00 Khelifa Saber (Chambéry) "Confluence of the call by value
lambda mu calculus" Coffee Break (16:00 - 16:30)
"Probabilty of normalization in pure lambda calculus" 17:15 - 17:45 Stephane Leroux (Lyon) "Induction, Rewriting and Game
Theory"
|
Tuesday, 21.06.2005
9:00 - 10:00 Daniele Gardy (Versailles) "Random boolean expressions
" Coffee Break (10.00 - 10.30) 10::30 - 11:00 Przemyslaw Broniek (Krakow) "Solving equations over small multi-unary algebras." 11:15 - 11:45 Pawel Waszkiewicz (Krakow) "Modelling topological spaces by domains -history and perspectives''12:00 - 12:30 Damien Pous (Lyon) "Up-to Techniques for Weak Bisimulation" 12:30 - 14:30 Lunch 14:30- 15:00 Bartlomiej Bosek (Krakow) "Online Chain Covering of Upgrowing Interval Posets" 15:15-15:45
Iwona Cieslik (Krakow) Coffee Break (15:45 - 16:15)
16:15 - 16:45 Piotr Micek (Krakow) "Online Chain Covering of Upgrowing Semi-Orders". 17:00 - 17:30 René David, Karim Nour
(Chambéry) "Classical Combinatory Logic"
|
||