Hosted by the Reasoning Group of the Computer Science Department at the University of Durham.
11:00-11.30 | Arrival and Coffee | |
11.30-11.40 | Welcome | |
11:40-12:20 | Proof Checking + Model Checking = LegoMC | Shenwei Yu, Durham |
12.20-13.00 | Permutation-free calculi for proof search in some constructive logics | Roy Dyckhoff, University of St. Andrews |
13:00-14:15 | Lunch | |
14:15-14:55 | Lightweight Formal Methods for Computer Algebra Systems | Martin Dunstan, St. Andrews |
14:55-15:35 | Dependently Typed Functional Programming in LEGO | Conor McBride, Edinburgh |
15:35-16:00 | Tea | |
16:00-16:40 | The type of the empty (search) tree | James McKinna, Durham |
16:40 | Close |
This is work in progress.