{\rtf1\mac\deff2 {\fonttbl{\f0\fswiss Chicago;}{\f2\froman New York;}{\f3\fswiss Geneva;}{\f4\fmodern Monaco;}{\f6\fdecor London;}{\f8\fdecor San Francisco;}{\f11\fnil Cairo;}{\f12\fnil Los Angeles;}{\f13\fnil Zapf Dingbats;}{\f14\fnil Bookman;} {\f16\fnil Palatino;}{\f18\fnil Zapf Chancery;}{\f20\froman Times;}{\f21\fswiss Helvetica;}{\f22\fmodern Courier;}{\f23\ftech Symbol;}{\f24\fnil Mobile;}{\f33\fnil Avant Garde;}{\f34\fnil New Century Schlbk;}{\f101\fnil Wartburg;}{\f118\fnil Warwick S;} {\f128\fnil Moscow;}{\f129\fnil Russian;}{\f135\fnil MATH-BES;}{\f140\fnil Lovell;}{\f149\fnil Detroit;}{\f171\fnil XB Futura ExtraBold;}{\f176\fnil H Futura Heavy;}{\f201\fnil ¡Math;}{\f512\fnil Alexandrie;}{\f2500\fnil Konstanz;}} {\colortbl\red0\green0\blue0;\red0\green0\blue255;\red0\green255\blue255;\red0\green255\blue0;\red255\green0\blue255;\red255\green0\blue0;\red255\green255\blue0;\red255\green255\blue255;}{\stylesheet{\f20 \sbasedon222\snext0 Normal;}}{\info{\title DOliste.rtf}{\author Centre International de Rencontres Mathematiques}}\paperw11880\paperh16820\margl1134\margr1134\margt1134\margb1134\deftab709\widowctrl\ftnbj\makebackup \sectd \linemod0\linex0\headery1077\footery1077\cols1\colsx709\endnhere\titlepg \pard\plain \qc\li2260\ri2812\box\brdrs \f20 {\b\i\f16\fs28 \par }\pard \qc\li2260\ri2812\box\brdrs {\b\i\f16\fs28 Programme des conf\'8erences\par }\pard \qc\li2260\ri2812\box\brdrs {\b\i\f16\fs28 \par }\pard {\f16 \par \par }\pard {\f16\fs20 \par }{\b\scaps\f16\fs20 Boerger}{\b\f16\fs20 Egon (Pise) :}{\i\f16\fs20 \tab \tab \tab On Reliable System Specification with Evolving Algebras.\par \tab \tab \tab \tab \tab \tab The Example of Lamport's Bakery Algorithms.\par \par }\pard \ri-1102 {\b\scaps\f16\fs20 DAnos V}{\b\f16\fs20 incent}{\b\scaps\f16\fs20 . (P}{\b\f16\fs20 aris VII)}{\b \tab \tab \tab }{\i Classical natural deductions\par }\pard {\i\f16\fs20 \par }{\b\f16\fs20 \par }{\b\scaps\f16\fs20 Dyckhoff}{\b\f16\fs20 Roy (St Andrew) :\tab }{\i\f16\fs20 \tab Permutations and Computations.\par }{\b\f16\fs20 \par }\pard {\b\scaps\f16\fs20 Gurevich}{\b\f16\fs20 Yuri (A. Arbor) :\tab }{\i\f16\fs20 \tab \tab Evolving Algebras : a tool for specification and complexity \tab \tab \tab \tab \tab \tab analysis.\par }\pard {\b\f16\fs20 \par }\pard {\b\scaps\f16\fs20 Hofmann}{\b\f16\fs20 Martin (Edimbourg) :}{\i\f16\fs20 \tab \tab On the interpretation of dependent types in locally \tab \tab \tab \tab \tab \tab \tab cartesian closed categories.\par }\pard {\b\f16\fs20 \par }{\b\scaps\f16\fs20 Honsell f}{\b\f16\fs20 (Udine) :\tab \tab }{\i\f16\fs20 \tab \tab Co-induction : some examples, some problems\par }{\b\f16\fs20 \par }{\b\scaps\f16\fs20 Jervell}{\b\f16\fs20 Herman (Oslo) :\tab \tab \tab }{\i\f16\fs20 Trakhtenbrot theorem for linear logic.\par }{\b\f16\fs20 \par }{\b\scaps\f16\fs20 Kanovich}{\b\f16\fs20 M. (Moscou) :\tab }{\i\f16\fs20 \tab \tab Resource sensitive type verification\par }{\b\f16\fs20 \par }\pard {\b\scaps\f16\fs20 Krivine}{\b\f16\fs20 Jean-Louis (Paris VII) :}{\i\f16\fs20 \tab \tab Weak second order lambda-calculus and imperative \tab \tab \tab \tab \tab \tab \tab programming.\par }\pard {\b\f16\fs20 \par }{\b\scaps\f16\fs20 Lambeck}{\b\f16\fs20 J. (Mac Gill) :\tab }{\i\f16\fs20 \tab \tab Titre non pr\'8ecis\'8e.\par }{\b\f16\fs20 \par }\pard {\b\scaps\f16\fs20 Leivant}{\b\f16\fs20 D. (Indiana) :\tab }{\i\f16\fs20 \tab \tab Transfer principles between logic-based approaches to \tab \tab \tab \tab \tab \tab computational complexity\par }\pard {\b\f16\fs20 \par }{\b\scaps\f16\fs20 Martin-Lof }{\b\f16\fs20 Peter (Leiden) :\tab }{\i\f16\fs20 \tab Might there exist absoluty undecidable proposition.\par }{\b\f16\fs20 \par }{\b\scaps\f16\fs20 Orlowska}{\b\f16\fs20 Ewa (Varsovie) : }{\i\f16\fs20 \tab \tab Algebraic models of information logics\par }{\b\f16\fs20 \par }\pard {\b\scaps\f16\fs20 Paulin-Mohring}{\b\f16\fs20 Christine (Lyon) :}{\i\f16\fs20 \tab Using streams to represent and prove properties of circuits \tab \tab \tab \tab \tab \tab in Coq : an example.\par }\pard {\b\scaps\f16\fs20 \par }\pard {\b\scaps\f16\fs20 Salvesen}{\b\f16\fs20 Anne (Oslo) :\tab \tab \tab }{\i\f16\fs20 Classes, inheritage and dynamic binding for type theory \tab \tab \tab \tab \tab \tab with explicite substitution.\par }\pard {\b\f16\fs20 \par }{\b\scaps\f16\fs20 Scedrov}{\b\f16\fs20 A. (Philadelphia) :}{\i\f16\fs20 \tab \tab Stochastic interaction and linear logic.\par }{\b\f16\fs20 \par }{\b\scaps\f16\fs20 Schwichtenberg}{\b\f16\fs20 Helmut (Munich) :}{\i\f16\fs20 \tab Termination for higher order rewrite systems.\par \par }\pard \ri-1008 {\b S}{\b\scaps\f16\fs20 cott p}{\b . (U}{\b\f16\fs20 ottawa)}{\b \tab \tab \tab }{\i Linear Lauchli Semantics and Full Completeness Theorems}{\i\f16\fs20 \par }\pard {\i\f16\fs20 \par }\pard \ri-1102 {\b S}{\b\scaps\f16\fs20 oloviev }{\b S}{\b\f16\fs20 oloviev}{\b . (A}{\b\f16\fs20 orrhus}{\b )}\tab \tab {\i Some sufficient conditions of the completeness of the equality \par \tab \tab \tab \tab \tab \tab of canonical morphisms in a given closed category.\par }\pard {\i\f16\fs20 \par }{\b\scaps\f16\fs20 Urzyczyn}{\b\f16\fs20 Pawel (Varsovie) :\tab }{\i\f16\fs20 \tab Remarks on recursive types.\par \par }\pard {\b\scaps\f16\fs20 Van Dalen}{\b\f16\fs20 D. (Utrecht) :\tab \tab }{\i\f16\fs20 \tab Professeur invit\'8e ne donnant pas de conf\'8erence.\par }}