Computer Science Proof, Complexity and Verification Seminar Series
The idea for the PCV Seminar Series grew amongst members of our theory group who felt a need for a platform to present our work in the area of Proof Theory, Complexity Theory and Program Verification. It is intended to be a high level research seminar where we can discuss latest ideas and results, as well as address technical issues, and are able to invite speakers from outside.
In the beginning of 2005, this idea turned into the PCV Seminar.
Organizers so far have been Markus Michelbrink (see here for talks organised by him), Will Harwood, Klaus Aehlig, and Monika Seisenberger. From January 2010 on, Fredrik Nordvall Forsberg and Matthew Gwynne organise the seminar.
20062007

Tuesday 19th September 2006, 14:00, Board Room
Klaus Aehlig (Swansea)
A Finite Semantics of Simply Typed Lambda Terms for Infinite Runs of Automata

Thursday 28th September 2006, 14:00, Robert Recorde Room  Talk in the Algebraic Specification Seminar
Markus Roggenbach (Swansea)

Thursday 12th October 2006, 14:00, Robert Recorde Room  Talk in the Algebraic Specification Seminar
Pius ten Hacken (Dept of French, Swansea)

Thursday 19th October 2006, 14:00, Board Room
Jens Blanck (Swansea)
Centred dyadic approximations

Thursday 26th October 2006, 14:00, Robert Recorde Room
Jens Blank (Swansea)
Centred dyadic approximations, part II

Thursday 2nd November 2006, 14:00, Board Room
Christiano Braga (Universidad Complutense de Madrid )
Implementing Modular SOS ***TALK CANCELLED***

Thursday 16th November 2006, 14:00, Board Room
Diana Ratiu (LMU Munich)
ATranslation  From Theory to Practice and Back

Tuesday 28th November 2006, 14:00, Board Room
Paul Taylor (Manchester)
The definitive axiomatisation for ASD (maybe)

Thursday 30th November 2006, 14:00, Robert Recorde Room  Talk in the Algebraic Specification Seminar
Temesghen Kahsai (Swansea)

Thursday 14th December 2006, 14:00, Board Room
Jan Juerjens (The Open University, Milton Keynes)
Verifying Cryptoprotocol Implementations in FirstOrder Logic

Thursday 15th February 2007, 14:00, Board Room
Ulrich Berger (Swansea)
Truth in Higher Types

Thursday 8th March 2007, 14:00, Robert Recorde Room
Roger Hindley (Swansea)
Lambda Calculus II

Thursday 15th March 2007, 14:00, Board Room
Heribert Vollmer (Universität Hannover)
The Complexity of Deciding if a Boolean Function Can Be Computed by Circuits over a Restricted Basis

Thursday 26th April 2007, 14:00, Robert Recorde Room  Talk in the Algebraic Specification Seminar
Jens Blank (Swansea)
Domains, the nearly final story by JB

Thursday 17th May 2007, 14:00, Robert Recorde Room  Talk in the Algebraic Specification Seminar
Markus Roggenbach (Swansea)
Modelling Medical Systems in CSP

Tuesday 19th June 2007, 14:00, Robert Recorde Room
Olov Wilander (University of Uppsala)
Universal algebras with lazy and partial functions