of course there's a standard word - from set theory - extensional! Subject: Trakhtenbrot Symposium Program, June 10-12, Tel-Aviv ADVANCE PROGRAM An International Symposium on Theoretical Computer Science in honor of BORIS A. TRAKHTENBROT on the occasion of his Retirement and Seventieth Birthday sponsored by The Moise & Frida Eskenasy Institute of Computer Sciences TEL AVIV UNIVERSITY, JUNE 10-12, 1991 MONDAY June 10 9:00 REGISTRATION 9:30 OPENING SESSION (Schreiber Bldg., Ramneceanu Hall) Amiram Yehudai, Tel-Aviv U., Organizing Chair Dan Amir, Vice Rector, Tel-Aviv University David Horn, Dean, Raymond and Beverly Sackler Faculty of Exact Sciences Albert R. Meyer, MIT, Symposium Chair 10:00 J. Barzdins (U. Latvia) Inductive synthesis: old and new approaches 10:35 Break 11:05 Eli Shamir (Hebrew U.) PAC learning of fuzzy concept classes by quantizing the underlying domain 11:40 Michail A. Taitslin (Tver' U., USSR) Datalog and expert systems 12:15 LUNCH break 14:00 Arnon Avron (Tel-Aviv U.) Problems of decidability and safety in databases 14:35 Jean-Jacques Levy (INRIA, France) Explicit substitutions and Pascal compiling schemes 15:10 Break 15:40 Robert Constable (Cornell U. and Weizmann Inst.) Constructive type theory as a foundation for computer science 16:15 Gordon D. Plotkin (Edinburgh U.) Resumption semantics for dataflow nets 16:50 End of session 17:00-18:30 RECEPTION (in front of Schreiber Bldg.) TUESDAY June 11 9:00 REGISTRATION 9:30 B.A. (Boaz) Trakhtenbrot (Tel-Aviv U.) To be announced 10:20 Break 10:40 Alex Rabinovich (IBM Watson, USA) The consequence relation of process logic 10:15 Albert R. Meyer (MIT) Systems of concurrent automata 11:50 Vaughan Pratt (Stanford U.) Must schedule-automaton duality entail conflict persistence? 12:25 LUNCH break 14:15 Amir Pnueli (Weizmann Inst.) Fair completeness without ordinals 14:50 Wolfgang Reisig (TU Munich) Concurrent temporal logic 15:25 Break 15:55 Rob van Glabbeek (Stanford U.) Bisimulation semantics for higher-dimensional automata 16:30 Manfred Broy (TU Munich) A functional calculus for nondeterministic interactive systems 17:05 Samson Abramsky (Imperial College, London) Proofs as processes 17:40 End of session WEDNESDAY June 12 9:00 REGISTRATION 9:30 Rusins Freivalds (U. Latvia) Advantages and limitations on advantages of probabilistic machines 10:05 Leonid Levin (Boston U.) Probability in computing 10:40 Break 11:10 Klaus Wagner (U. Wuerzburg, Germany) Complexity classes defined by the local behaviour of nondeterministic machines 11:45 Zvi Galil (Tel-Aviv U. and Columbia U.) Parallel string matching, upper and lower bounds 12:20 LUNCH break 14:15 Nachum Dershowitz (U. Illinois) Infinite rewriting 14:50 Val Breazu-Tannen (U. Pennsylvania) Law-abiding constructors 15:25 Break 15:55 V. Yu. Sazonov (Program Sys. Inst., Pereslavl-Zalessky, USSR) Some dependence-independence, conservativity and expressibility results on weak theories without exponentiation 16:30 Yuri Gurevich (U. Michigan) Evolving algebras 17:05 End of Symposium 20:00 BANQUET The public is invited to attend the lectures and reception without charge. A limited number of banquet tickets may be purchased at registration. Lectures will be 30 minutes long plus 5 minutes for questions and will be held in the Wladimir Schreiber Institute of Mathematics, Room 006, Tel-Aviv University, Ramat Aviv (by the Diaspora Museum). Parking through Gate 1. There will be a post-symposium excursion on Thursday, June 13. SYMPOSIUM CHAIR: Albert R. Meyer (MIT) ORGANIZING COMMITTEE: Zvi Galil (Tel-Aviv U.), Albert R. Meyer (MIT), Amir Pnueli (Weizmann Inst.), Amiram Yehudai (Tel-Aviv U.) Direct inquiries to the ORGANIZING CHAIR: Prof. Amiram Yehudai Computer Science Department Tel-Aviv University Tel-Aviv, Israel 69978 Phone: +972-3-5450037 (office) +972-3-5450040 (messages) +972-3-6423307 (home) FAX: +972-3-6422378 TELEX: 342171 VERSY IL EMAIL: amiram@taurus.bitnet, amiram@math.tau.ac.il