torbenm@diku.dk (Torben Mogensen) (10/03/89)
Conference Announcement and CALL for PAPERS - ** REVISED DEADLINE ** CAAP '90 - Colloquium on Trees in Algebra and programming ESOP '90 - European Symposium on Programming Copenhagen, May 15-18, 1990 DATES: October 8 1989 REVISED deadline for submission of drafts December 10 1989 notification of acceptance February 1 1990 final versions of papers due May 15-18 1990 (Tuesday to Friday) conference at Copenhagen, Denmark Authors of papers are invited to submit 7 copies of a draft paper (in English) to: CAAP '90: Andr'e Arnold, CAAP program committee Universit'e Bordeaux I Laboratoire d'Informatique 351 Cours de la Lib'eration F-33405 Talence, France ESOP '90: Neil D. Jones, ESOP program committee DIKU, University of Copenhagen Universitetsparken 1 DK-2100 Copenhagen O, Denmark Proceedings will be distributed at the conference. Local arrangements chairman: Nils Andersen, CAAP-ESOP local arrangements DIKU, University of Copenhagen Universitetsparken 1 DK-2100 Copenhagen O, Denmark Systems Exhibition Non-commercial software systems may be demonstrated in parallel with the conference. Systems of interest include, but are not restricted to: programming environments and tools, prototyping systems, term rewriting systems theorem provers, unusual compilers and partial evaluators. Authors of systems are invited to make a proposal for demonstrations, preferably on a Sun 3 or Sun 4, to the local arrangements chairman. Mailing List If you want to recieve further information about CAPP-ESOP '90, write to the local arrangements chairman, who will add you to the mailing list. CAAP '90: The previous 14 colloquia were held in France (Lille, Bordeaux, Nice and Nancy), Italy (Genova, l'Aquila and Pisa), West Germany (Berlin) and Spain (Barcelona). It was part of TAPSOFT (Theory and Practice of Software Development) in Berlin, Pisa and Barcelona and joint with ESOP in Nancy. At first the collouium series was devoted to the algebraic and combinatorial properties of trees, and their role in various fields of Computer Science. Nowadays trees are as well established in Computer Science as strings - but many other discrete structures, for example graphs, are also being used. Therefore, in keeping with CAAP's tradition and taking into account the evolution of Computer Science, CAAP '90 focuses on the following topics: - Logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.), including the theory of formal languages considered in a broad sense as that of sets of discrete structures and the theory of rewriting systems over these objects. - Application of discrete structures in Computer Science: syntax and semantics of programming languages, operational semantics, logic programming, algorithms and data structures, complexity of algorithms and implementation aspects, proof techniques for nonnumerical algorithms, formal specifications, visualization of trees and graphs, etc. The above list is not exhaustive. Invited Speakers: David Harel (Revohot, israel) G'erard Viennot (Bordeaux, France) Program Committee A. Arnold (Bordeaux, France) Chairman G. Ausiello (Rome, Italy) F. Brandenburg (Passau, West Germany) B. Courcelle (Bordeaux, France) M. Dauchet (Lille, France) J. Diaz (Barcelona, Spain) H. Ehrig (Berlin, West Germany) J. Engelfriet (Leiden, the Nederlands) G. Fil'e (Padova, Italy) D. Harel (Rehovot, Israel) M. Jantzen (Hamburg, West Germany) G. Longo (Pisa, Italy) M. Nivat (Paris, France) S. Skyum (Aarhus, Denmark) P. Wolper (Li`ege, Belgium) The program committee members are not allowed to submit papers (even co-authored). ESOP '90: The previous symposia were held in Saarbr"ucken in 1986 and in Nancy in 1988. They continue lines begun in France in Colloque sur la Programmation and in Germany in the GI-workshops on Programmiersprachen und Programmentwicklung. ESOP '90 addresses fundamental issues and important developments in the design, specification and implementation of programming languages and systems. Papers are especially encouraged that practical work based on theory, or computer experiments implementing theoretical concepts and formal models. - program development: specification, methodology, tools, environments - programming language concepts: types, data abstraction, parallelism, real-time - programs as data objects: abstract interpretation, program transformation, partial evaluation - programming styles: imperative, functional, predicative, object-oriented The above list is not exhaustive. Invited Speakers: Henk Barendregt, University of Nijmegen, Holland Robert Paige, Courant Institute, New York Program Committee: N. Jones (Copenhagen, Denmark), Chairman G. Cousineau (Paris, France) H. Ganzinger (Dortmund, West Germany) C. Hankin (London, England) B. Lang (Paris, France) P. Lescanne (Nancy, France) B. Mahr (Berlin, West Germany) T. Maibaum (London, England) J. Maluszynski (Link"obing, Sweden) P. Mosses (Aarhus, Denmark) B. Nordstr"om (Gothenburg, Sweden) P. Wadler (Glasgow, Scotland) R. Wilhelm (Saarbr"ucken, West Germany) G. Winskel (Aarhus, Denmark) The program committee members are not allowed to submit papers (even co-authored). -- Someday has arrived