Programme

Friday, 13 November 2015

12.15-bus from the Institute of Cybernetics
12.35-bus from the city center (Russian cultural centre)
12.45-bus from the passenger port, Terminal D
13.00-bus from the airport
14.30-arrival and check-in
15.00-16.00lunch
16.00-17.00 Jan von Plato In search of the roots of formal computation
17.00-17.30coffee
17.30-19.00 Denis Firsov Dependently typed programming with finite sets
Niccolò Veltri Constructive finiteness and rational datatypes
Jan von Plato How to linearize a tree derivation?
19.00-20.00dinner
 
 

Saturday, 14 November 2015

8.00-9.00breakfast
9.00-10.30 Sara Negri Glivenko sequent classes in the light of structural proof theory
José Carlos Espírito Santo Curry-Howard for sequent calculus at last
10.30-11.00coffee
11.00-12.30 Fausto Barbero and Gabriel Sandu Independence-friendly logic: an overview
Kristjan Liiva Real quantifier elimination by virtual term substitution of unbounded degree
12.30-13.30lunch
13.30-14.30time to see the town
14.30-16.00 Gianluigi Bellin Proof nets / essential nets for FILL- and BILL-
Luís Pinto Analysis of proof search through typed lambda-calculi
16.00-16.30sandwiches and coffee
16.30-18.00 Sara Negri Proof theory for Lewis counterfactuals and conditional logic
Wolfgang Jeltsch Intuitionistic temporal logic from reactive programming
18.00-walk to Rakvere theatre (1.5 km)
19.00(-20.20)concert by Bonzo
21.00-dinner
 
 

Sunday, 15 November 2015

8.00-9.00breakfast
9.00-10.30 Aarne Ranta GF: a logical framework for grammars [tutorial]
Martin Aher Epistemic and deontic questions in the miners' puzzle
10.30-11.00coffee
11.00-12.30 James Chapman Relative monads
Danel Ahman Fibred computational effects
Tarmo Uustalu Coalgebraic bar recursion and bar induction
12.30-13.30lunch
13.30- check-out, departure to the airport, passenger port, city and institute
 
Tarmo Uustalu
Last update 12 November 2015