Workshop on Proof Theory and Computation
First Call for Participation
WORKSHOP ON PROOF THEORY AND COMPUTATION
Dresden University of Technology - June 3-14, 2002
We will offer the following courses of five lectures each, aimed at
researchers and graduate students with some background in proof theory.
The focus of the workshop will be on proof theory and computation: we
aim at a small, informal event where people will have plenty of time to
exchange ideas. Other talks can be accommodated based on interest.
Participation in the workshop is free of charge, but limited to a
maximum of 25 persons. Assistance will be provided in finding an
accommodation in Dresden, at prices starting from 18 EUR/day.
Registration is requested, please send an email to
<mailto:firstname.lastname@example.org>, making sure you include a very brief bio
(5-10 lines) stating your experience, interests, etc. A selection
procedure will be adopted in case of excessive demand.
Each course will be entirely contained in one of the two weeks the
workshop will span. A detailed schedule will be provided on the
workshop page. This is the list of confirmed courses:
Week 1: June 3-7, 2002
SPECIFYING AND REASONING ABOUT PROGRAMS IN PROOF SEARCH
Dale Miller (Penn State, USA)
FORMAL METHODS FOR SECURITY PROTOCOLS
Catuscia Palamidessi (Penn State, USA)
HARMONIC TYPE THEORY
Charles Stewart (TU Berlin)
Week 2: June 10-14, 2002
ALGEBRAIC THEORY OF CIRCUITS
Yves Lafont (Université de la Méditerranée, Marseille)
OPERADS AND THE GEOMETRY OF COMPUTATION
Francois Lamarche (Loria & INRIA-Lorraine, Nancy)
THE CALCULUS OF STRUCTURES
Alessio Guglielmi (TU Dresden)
Dresden, on the river Elbe, is one of the most important art cities of
Germany. You can find world-class museums and wonderful architecture
and surroundings. We will organize trips and social events.
This workshop is organized by the AI Institute at TU Dresden, and
sponsored by IQN (Rational mobile agents and systems of agents) and
Graduiertenkolleg 334 (Specification of discrete processes and systems
of processes by operational models and logics).