with abstracts

Programme

Friday 18th November 2011

10:00 – 10:15	Welcome
10:15 – 11:15	Jamie Gabbay	Proof-theory for meta-programming and modal type theory
	Didier Galmiche	Label-free Natural Deduction Systems for intuitionistic modal logics
11:15 – 11:30	Break
11:30 – 12:30	Mehrnoosh Sadrzadeh	Algebra and Proof Theory for a Logic of Propositions, Actions and Adjoint Modal Operators
	Marta Bilkova - Jiri Velebil	Substructural logics are coalgebraic
12:30 – 14:15	Lunch
14:15 – 15:15	Vladimir Komendantsky	Verification of functional programs in higher order type theory and Coq
	Jael Kriener	Formalising a Determinacy Analysis for Prolog in Coq
15:15 – 15:30	Break
15:30 – 16:30	Nordstrom Bengt	Towards a basis for human-computer dialogues
	Peter Foldiak	Neural representation and categories
16:30 – 17:00	Break
17:00 – 19:00	Reception
19:00 – ...	Dinner in local restaurant	Number 40, The Scores, St. Andrews, KY16 9AS

Saturday 19th November 2011

09:30 – 10:30	James McKinna	From proof theory to HCI and back again
	Luís Pinto	Normal forms in sequent calculus
10:30 – 11:00	Break
11:00 – 12:30	Christian Urban	Formalising Regular Language Theory with Regular Expressions Only
	William Stirton	Polymorphically typed combinatory logic
	Natasha Alechina	The logic of joint action
12:30 – 14:00	Lunch
14:00 – 15:00	Sara Negri	The geometry of proof analysis: From rule systems to systems of rules
	Stephen Read	On GE-harmony
15:00 – 15:30	Break
15:30 – 16:30	Peter Schroeder-Heister	Proof-theoretic semantics, self-contradition, and the format of deductive reasoning
	Rob Rothenberg	On Labelled Sequents and Hypersequents
19:00 – ...	For those who are still here, dinner together