lambda-calculus, type theory and mathematical logic.
How to reach the Computer Science Department
|
THURSDAY, 27.06.2002
Session 1 9:00-9:45 Pierre LESCANNE (Lyon) Explicit substitutions and intersection types 9:45-10:30 Waszkiewicz (Krakow) Modelling topological spaces by domains Coffee Break (10.30 - 11.00) Session 2: 11:00 - 11:45 Rene DAVID (Chambery) Some strong normalization results. 11:45 - 12:30 Silvia GHILEZAN (Lyon) A type system and a lambda model characterising computational behaviours of terms Session 3: 15:15 - 16:00 Pawel URZYCZYN (Warszawa) "On the problem of type retractions (work in progress) " 16:00 - 16:45 Zdzislaw SPLAWSKI (Wroclaw) "Defining recursors in second-order lambda calculus". Coffee Break (16:45 - 17:15) Seesion 4 17:15 - 18:00 Rene DAVID, Christophe RAFFALI (Chambery) Computer assisted teaching in mathematics 18:00 - 18:45 Noel BERNAR (Chambery) "Investigating the logical aspects of the pi-calculus". |
FRIDAY 28.06.2002
Session 5 9:00 - 9:45 Yves BERTINI (Chambery) About the easyness notion in the lambda-calculus. 9:45 - 10:30 Etienne LOZES (Lyon) Separability, Expressiveness and Decidability of the Ambient Logic" Coffee Break (10.30 - 11.00) Session 6 11:00 - 11:45 Jean DUPRAT (Lyon) Using proof assistant for plane geometry 11:45 - 12:30 Edward SZCZYPKA (Krakow) "Object complexity" Session 7 15:15 - 16:00 Pawel IDZIAK (Krakow) "Generative complexity in algebra" 16:00 - 16:45 Christophe RAFFALI (Chambery) System ST Coffee Break (16:45 - 17:15) Session 8 17:15 - 18:00 David TELLER (Lyon) Using Ambients to Control Resources. 18:00 - 18:45 Marek ZAIONC (Krakow) "Asymptotic properties of logics"
|
|---|---|