Programme des conférences

Boerger Egon (Pise) :			On Reliable System Specification with Evolving Algebras.
						The Example of Lamport's Bakery Algorithms.

DAnos Vincent.  (Paris VII)			Classical natural deductions

Dyckhoff Roy (St Andrew) :		Permutations and Computations.

Gurevich Yuri (A. Arbor) :			Evolving Algebras : a tool for specification and complexity 						analysis.

Hofmann Martin (Edimbourg) :		On the interpretation of dependent types in locally 							cartesian closed categories.

Honsell f (Udine) :				Co-induction : some examples, some problems

Jervell Herman (Oslo) :			Trakhtenbrot theorem for linear logic.

Kanovich M. (Moscou) :			Resource sensitive type verification

Krivine Jean-Louis (Paris VII) :		Weak second order lambda-calculus and imperative 							programming.

Lambeck J. (Mac Gill) :			Titre non précisé.

Leivant D. (Indiana) :			Transfer principles between logic-based approaches to 						computational complexity

Martin-Lof Peter (Leiden) :		Might there exist absoluty undecidable proposition.

Orlowska Ewa (Varsovie) : 		Algebraic models of information logics

Paulin-Mohring Christine (Lyon) :	Using streams to represent and prove properties of circuits 						in Coq : an example.

Salvesen Anne (Oslo) :			Classes, inheritage and dynamic binding for type theory 						with explicite substitution.

Scedrov A. (Philadelphia) :		Stochastic interaction and linear logic.

Schwichtenberg Helmut (Munich) :	Termination for higher order rewrite systems.

Scott p. (Uottawa)			Linear Lauchli Semantics and Full Completeness Theorems

Soloviev Soloviev. (Aorrhus)		Some sufficient conditions of the completeness of the equality 
						of  canonical morphisms in a given closed category.

Urzyczyn Pawel (Varsovie) :		Remarks on recursive types.

Van Dalen D. (Utrecht) :			Professeur invité ne donnant pas de conférence.