BLC Newsletter May 2009

Registered Charity No 275541

President           Professor J M E Hyland [Cambridge]
Vice-President      Professor T Williamson FBA FRSE [Oxford]
Treasurer           Professor D Macpherson [Leeds]
Secretary           Dr N Alechina [Nottingham]
                     Dr U Berger [Swansea]
                     Dr E Ritter [Birmingham]
                     Dr G Wilmers [Manchester]


(1) The BLC 2009 web page is available at:

(2) PhD position in Type Theory at Nottingham



(1) The web page of the British Logic Colloquium meeting
to be held in September 2009 is available at:


(2) PhD position in Type Theory at Nottingham

A new PhD position is available in the Functional Programming Laboratory at
 the University of Nottingham. The topic of research for the project is 
"Programming and Reasoning with Infinite Structures": it consists in the theoretical 
study and development of software tools for coinductive types and structured

The candidate must be a UK resident with an excellent degree in Computer
Science or Mathematics at MSc (preferred) or BSc level (first class or
equivalent). The applicant should have a good background in mathematical logic,
theoretical computer science or functional programming. (S)he should be
interested doing research in type theory, constructive mathematics, category
theory and foundations of formal reasoning.

We offer: PhD place with living expenses (standard UK level) for 3 years. The
grants also provide laptops and travel expenses for conference and workshop
visits. Nottingham University provides a vibrant research environment in the
Functional Programming Laboratory.

Deadline for applications: 20 June 2009.
Send a cover letter and your CV to Venanzio Capretta (
Please contact Venanzio Capretta for any additional information that you need.




The Tenth International Workshop on Logic and Computational Complexity
will be held in Los Angeles on August 10, 2009, as an affiliated meeting
of LiCS'09 (,
and in conjunction with SAS'09 (

LCC meetings are aimed at the foundational interconnections between 
logic and computational complexity, as present, for example,  in 
implicit computational complexity (descriptive and type-theoretic methods); 
deductive formalisms as they relate to complexity (e.g. ramification, 
weak comprehension, bounded arithmetic, linear logic and resource logics); 
complexity aspects of finite model theory and databases; 
complexity-mindful program derivation and verification;
computational complexity at higher type; and proof complexity. 

The LCC'09 program will consist of invited lectures as well as
contributed papers selected by the program committee.
This year there will be no published proceedings, and work submitted
or published elsewhere is welcome, provided all pertinent information
is disclosed at submission time.  Papers should be written in English,
be accessible to non-specialists, start with a clear statement of the
issues and results, and not exceed 15 pages.

Proposed papers should be uploaded to,
by Friday, June 5, 2009,
with expected notification date of Monday, June 22.
For additional information see,
or email inquiries to
Further information about previous LCC meetings can be found at


   * Patrick Baillot (CNRS-ENS Lyons, Co-chair)
   * Markus Lohrey (Leipzig, Co-Chair)
   * Albert Atserias (UP de Catalunya)
   * Pablo Barcelo (U de Chile)
   * Arnold Beckmann (Swansea)
   * Lauri Hella (Tampere)
   * Andrei Krokhin (Durham)
   * Chris Pollett (San Jose SU)

STEERING COMMITTEE: Michael Benedikt (Oxford, Co-chair),
Daniel Leivant (Indiana U, Co-chair), Robert Constable (Cornell),
Anuj Dawar (Cambridge), Fernando Ferreira (Lisbon),
Martin Hofmann (U Munich), Neil Immerman (U Mass. Amherst),
Neil Jones (Copenhagen), Bruce Kapron (U Victoria),
Jean-Yves Marion (LORIA Nancy), Luke Ong (Oxford),
Martin Otto (Darmstadt), James Royer (Syracuse),
Helmut Schwichtenberg (U Munich), and Pawel Urzyczyn (Warsaw)

Home Index


Page maintained by

Last modified: Wed May 27 16:22:08 BST 2009