| 8:45 - 9:00 | Opening | ||
| 9:00 - 10:00 invited talk |
Investigations into the Duality of Computation | Hugo Herbelin |  |
| 10:00 - 10:30 | Coffee Break | ||
| 10:30 - 11:10 full paper |
A classical version of system Fω. | Stéphane Lengrand and Alexandre Miquel | |
| 11:10 - 11:50 full paper |
Call-by-Name Reduction and Cut-Elimination on Classical Logic | Kentaro Kikuchi | |
| 11:50 - 12:30 full paper |
A sequent calculus for Limit Computable Mathematics | Stefano Berardi and Yoriyuki Yamagata | |
| 12:30 - 14:30 | Lunch Break | ||
| 14:30 - 15:30 invited talk |
Programs from Classical Proofs in Minlog | Monika Seisenberger | |
| 15:30 - 15:55 short paper |
Classical Logic is better than Intuitionistic Logic: A Conjecture about Double-Negation Translations | Christian Urban and Diana Ratiu | |
| 15:55 - 16:30 | Coffee Break | ||
| 16:30 - 17:10 full paper |
What could a Boolean category be? | Lutz Straßburger | |
| 17:10 - 17:35 full paper |
Simplifying Programs Extracted from Classical Proofs | Yevgeniy Makarov | |
| 17:35 - 18:00 short paper |
Types, Relevance & Classical Logic | Robert K. Meyer | |
| 18:00 | Announcements and Goodbye | ||
| short paper (not presented) |
On untyped Curien-Herbelin calculus | Silvia Likavec and Pierre Lescanne | |