ESOP 2015
Tue 14 - Thu 16 April 2015 London, United Kingdom
Wed 15 Apr 2015 12:00 - 12:30 at Skeel - Session 4 Chair(s): Lars Birkedal

Datatypes and codatatypes are useful for specifying and reasoning about (possibly infinite) computational processes. The Isabelle/HOL proof as- sistant has recently been extended with a definitional package that supports both. We describe a complete procedure for deriving nonemptiness witnesses in the general mutually recursive, nested case—nonemptiness being a proviso for intro- ducing types in higher-order logic.

Wed 15 Apr

esop-2015-papers
10:30 - 12:30: ESOP - Session 4 at Skeel
Chair(s): Lars BirkedalAarhus University
esop-2015-papers142908660000010:30 - 11:00
Talk
Mark BattyUniversity of Cambridge, Kayvan MemarianUniversity of Cambridge, Kyndylan NienhuisUniversity of Cambridge, Jean Pichon-PharabodUniversity of Cambridge, Peter SewellUniversity of Cambridge
esop-2015-papers142908840000011:00 - 11:30
Talk
Parosh Aziz Abdulla, Mohamed Faouzi AtigUppsala University, Tuan Phong NgoUppsala University
esop-2015-papers142909020000011:30 - 12:00
Talk
Ilya SergeyIMDEA Software Institute, Aleksandar NanevskiIMDEA Software Institute, Anindya BanerjeeIMDEA Software Institute
esop-2015-papers142909200000012:00 - 12:30
Talk
Jasmin Christian BlanchetteTU Munich, Andrei PopescuMiddlesex University, London, Dmitriy TraytelTU Munich