Newsletter 28

July 13, 1995

  May 24-26, 1996, Philadelphia, Pennsylvania, USA   
* Topics.  ICFP is a new annual conference combining the established
  LISP and Functional Programming (LFP) and Functional Programming and
  Computer Architecture (FPCA) conferences.  Topics include language
  design; compilation methods; architectural support and interaction;
  program analysis and optimization; programming logics; program
  transformation; semantic foundations; type theory; garbage collection
  and run-time systems; input/output, control, and store effects;
  extensions for parallelism, non-determinism, and concurrency;
  implementation paradigms: direct- and continuation-passing, graph
  reduction, and data flow; parallel and distributed implementations;
  applications and case studies; and pedagogy.  Languages of interest
  include established languages such as Lisp, Scheme, Sisal, ML,
  Haskell, and Id, as well as novel designs in the functional
  programming tradition.
* Co-conferences.  ICFP'96 will be part of the Federated Computing
  Research Conference.
* Program Chair.  R. Kent Dybvig, Computer Science Department, Lindley
  Hall 215, Indiana University, Bloomington, IN 47405-4101 USA, tel:
  +1-812-855-8653, fax: +1-812-855-4829,
* Program Committee.  Luca Cardelli, Olivier Danvy, Matthias Felleisen,
  Richard Gabriel, Paul Hudak, John Launchbury, Peter Lee, Atsushi
  Ohori, Didier Remy, John Reppy, Olin Shivers, Andrew Wright.
* Submissions.  13 copies of a full paper to the program chair.  Length
  should not exceed 12 pages typeset 11 point on 16 point spacing.
  Submissions must be received by October 27, 1995.  The program chair
  will reject all late or excessively long submissions.
* Further Information.  For submission information and other inquiries
  contact This call for papers and additional
  information about the conference can be obtained via the world-wide
  web, or by anonymous ftp from

  March 28-30, 1996, Leipzig, Germany  
* Topics. ELP aims at stimulating research on extensions of logic 
  programming languages, especially those based on proof theory,
  and seeks to disseminate insights into the relations between the 
  logics of those languages, implementation techniques and the 
  use of these languages in applications. For more details see
  the WWW page.
* Program Co-Chairs. R. Dyckhoff (St. Andrews), H. Herre (Leipzig)
  and P. Schroeder-Heister (Tuebingen).
* Deadline for submissions: September 15, 1995. 
* Further Information.  WWW page.  E-mail:  Surface mail: ELP'96/Heinrich Herre,
  Institut fuer Informatik, Universitaet Leipzig, Augustusplatz 10-11,
  D-04109 Leipzig, Germany. Phone: +49 341 973 2201, Fax: +49 341 973

  April 22-26 1996, Linko"ping, Sweden  
* Topics.  
  CAAP: basic objects in computation processes, especially words, trees,
  graphs and their languages; techniques for manipulating these objects,
  such as automata, grammars, regular expressions, rewriting,
  unification, matching and constraint solving; applications of these
  structures to syntax and semantics of programming languages,
  transition systems and models of concurrency, logic and formal
  verification; and theoretical problems arising in software
  CC: tools for any phase of compilation, methods and techniques for
  code generation and optimization, compilation for parallel
  architectures, compilation of computer languages (imperative,
  functional, logic, object-oriented, parallel, etc.), translation of
  application and specification languages, and other tools closely
  related to compiler construction (debuggers, data flow analyzers,
  ESOP: software specification and verification (including algebraic
  techniques and model checking), programming paradigms and their
  integration (including functional, logic, concurrent and
  object-oriented), semantics facilitating the formal development and
  implementation of programming languages and systems, advanced type
  systems (including polymorphism and subtyping), program analysis
  (including abstract interpretation and constraint systems), program
  transformation (including partial evaluation and term rewriting), and
  implementation techniques (including compilation).
* Submissions.  Five copies of a full draft paper (at most 15 pages in
  the standard Springer Lecture Notes format) and to electronically mail
  a plain ascii title and abstract to the appropriate address.  Deadline
  for submission : 19 September 1995.
  CAAP'96: attn. Helene Kirchner, CRIN & INRIA-Lorraine, Batiment LORIA,
  Campus Scientifique, BP 239 , F-54506 Vandoeuvre-les-Nancy, France.
  Telephone: +33 83 59 30 12.  Telefax: +33 83 27 83 19.  E-mail:
  CC'96: attn. Tibor Gyimothy, Department of Informatics, Jozsef Attila
  University, P.O. Box 652, H-6701 Szeged, Hungary.  Telephone: +36
  62310011/3771.  Telefax: +36 62312508.  E-mail:
  ESOP'96: attn. Hanne Riis Nielson, Computer Science Department, Aarhus
  University, Ny Munkegade, Bldg. 540, DK-8000 Aarhus C, Denmark.
  Telephone: +45 8942 3188.  Telefax: +45 8942 3255.  E-mail:
* Program Committees.
  CAAP'96: H. Kirchner (chair), M. Filgueiras, D. Hofbauer, J.R. Kennaway,
  P.D. Mosses, R. Nieuwenhuis, T. Nipkow, D. Niwinski, R. Pinzani,
  F. Rossi, D. Sannella, S. Tison.
  CC'96: T. Gyimothy (chair), M. Bartha, P. Fritzson,
  P. Franchi-Zannettacci, R. Gupta, N. Horspool, M. Jourdan,
  S. Jahnichen, U. Kastens, K. Koskimies, B. Magnusson, T. Reps,
  G. Riedewald, B. Ryder, J. Uhl, D.A. Watt.
  ESOP'96: H.R. Nielson (chair), R. Cousot, P. Degano, R. Giegerich,
  C.L. Hankin, P. Klint, A. Mycroft, O. Nierstrasz, F. Orejas,
  R. Plasmeijer, D. Re'my, B. Steffen, C. Talcott, A. Tarlecki.
* Invited Speakers.  CAAP'96: Samson Abramsky, Frank Pfenning.  CC'96:
  William Waite.  ESOP'96: Cliff Jones, Simon Peyton-Jones.
* Local Arrangements.  CAAP/CC/ESOP'96, attn. Peter Fritzson,
  Department of Computer and Information Science, Linko"ping University,
  S-581 83 Linko"ping, Sweden.  Telephone: +46 13 282297.  Telefax: +46
  13 282666.  E-mail:

  April 15-17, 1996, Cesena, Italy
* Topics.  Coordination problems within concurrent, distributed, object
  oriented, functional and logic programming.  Concurrent computation,
  constraint programming, computation models based on the chemical
  reaction metaphor and related areas.  Software environments for the
  development of coordinated applications.  Semantics and reasoning
  about coordination.  Case studies with industrial relevance
  (e.g. Workflow, groupware, distributed artificial intelligence,
  distributed software engineering).
* Submissions.  Full papers (in English, up to 15 pages) to the PC
  chair.  Electronic submission is encouraged via e-mail, in the form of
  uuencoded compressed PostScript(TM) files.
* Program Chair.  Chris Hankin, Department of Computing, Imperial
  College, 180 Queen's Gate, LONDON SW7 2BZ, UK.
* Program Committee (Provisional).  Gul Agha, Jean-Marc Andreoli, Marc
  Bourgois, Luca Cardelli, Paolo Ciancarini, Laurent Dami, David Garlan,
  David Gelernter, Jos\'e Meseguer, Daniel Le M\'etayer, Oscar
  Nierstrasz, Ant\'onio Porto, David Sands, Akinori Yonezawa.
* Further Information.  From program chair.

  December 6-8, 1995, University of Twente, Enschede, the Netherlands
* Topics.  This workshop will focus on algebraic methods in formal
  languages, programming languages and natural languages.  Aims of the
  Workshop The aim of this workshop is to bring together those
  researchers on formal language theory, programming language theory and
  natural language description theory, that have a common interest in
  the use of algebraic methods to describe syntactic, semantic and
  pragmatic properties of language. The workshop does not concentrate on
  natural language only. There is interesting use of algebraic methods
  in programming language processing (compiler construction and
  development of programming language environments) and (obviously) in
  formal language theory. Moreover, it is becoming clear that some of
  the methods developed in these fields can play a role in natural
  language description and processing.
* Invited Speakers.  (Preliminary list.)  An Algebraic Framework for
  Analogies and Metaphors, Bibin Indurkhya.  Implication Structures and
  Residuated Algebras related to Formal Grammar, Wojciech Buszkowski.
  An Algebraic Perspective on Grammatical Theories for Natural Language,
  Theo M.V. Janssen.  Algebraic Processing of Programming Languages, Teo
  Rus.  Contextual Grammars with Depth-First Derivation, Carlos Martin
  Vide, J. Miquel-Verges & Gh. Paun.  Tools for Contextual Syntactic
  Analysis, Francois Barthelemy.  Parsing Schemata and Correctness of
  Parsing Algorithms, Klaas Sikkel.
* Further Information.

  September 19-22, 1995 Cassis, France
  [CFP in Newsletter 21]
* Program.  Final program available.
* Invited Lectures.  What is Symbolic Computation?, Bruno Buchberger.
  Automatic Generation of Invariants and Intermediate Assertions,
  Nikolai Bjorner, Anca Browne and Zohar Manna.
* Tutorials.  Constraint Solving for Combinatorial Search Problems: A
  Tutorial, Pascal van Hentenryck.  The Concurrent Constraint
  Programming research programmes, Vijay Saraswat.
* Satellite Workshops.  "Over-Constrained Systems", Monday, September
  18; contact Gene Freuder (  "Constraints for Graphics
  and Visualization", Monday, September 18; contact Pascal Van
  Hentenryck (  "Set Constraints and Constrained Logic
  Programming", Saturday, September 23; contact Leszek Pacholski
  (  "Studying and Solving Really Hard
  Problems", Saturday, September 23, contact Jihad Jaam
* Further Information.  Alain Colmerauer, Lab. d'Informatique de
  Marseille, Faculte des Sciences de Luminy, 163, Avenue de Luminy,
  F-13288 Marseille CEDEX 9, France.  E-mail:

  (previously: Theoretical Aspects of Reasoning about Knowledge)
  March 17-20, 1996, De Zeeuwse Stromen, The Netherlands
* Topics.  The mission of the bi-annual TARK conferences is to bring
  together researchers from a wide variety of fields -- including
  Artificial Intelligence, Cryptography, Distributed Computing,
  Economics and Game Theory, Linguistics, Philosophy, and Psychology --
  in order to further our understanding of interdisciplinary issues
  involving formal reasoning about rationality and knowledge. Topics of
  interest include, but are not limited to, semantic models for
  knowledge, for belief, and for uncertainty, bounded rationality and
  resource-bounded reasoning, commonsense epistemic reasoning, knowledge
  and action, applications of reasoning about knowledge and other mental
  states, and belief revision.
* Submissions.  12 copies of a detailed abstract (not a full paper) of
  at most ten double-spaced pages (4,000 words) to the program chair by
  October 10, 1995.
* Program Committee.  Barbara Grosz, Peter G"ardenfors, Sergiu Hart,
  Hans Kamp, Daphne Koller, Stephen Morris, Gil Neiger, Christos
  Papadimitriou, Krister Segerberg, Yoav Shoham (chair), Moshe
  Tenneholtz, Michael Wellman.
* Program Chair. Yoav Shoham, Computer Science Department, Stanford
  University , Stanford, CA 94305, USA.  Phone: +415-723-3432, fax:
  +415-725-1449.  Email:
* Further Information. Peter van Emde Boas / John-Jules Charles Meyer,
  Department of Mathematics and Computer Science, Utrecht University,
  Padualaan 14, De Uithof, 3508 TB, Utrecht, The Netherlands.  Tel:
  +31-(0)30-534117, fax: +31-(0)30-513791.  Email:

  August 9-17, Haifa, Israel  
[Previous announcement in Newsletter 26]
* Updates.  Visit the WWW page for updated travel and other useful

Christoph Beierle, Lutz Pluemer (eds): (Studies in Computer Science
and Artifical Intelligence, Volume 11) North Holland, 1995, 418 pages,
Hardbound, Price: Dfl. 250.00 (US$142.75) ISBN O-444-82092-2.
* Summary.
  There is growing evidence of a convergence between the technical
  challenges of developing advanced software systems on the one hand,
  and the formal techniques, tools and features evolving from the logic
  programming paradigm on the other. This book aims at promoting such
  convergence. It provides contributions towards different aspects of
  logic programming, which are relevant to the development of complex
  and reliable software systems, and describes a number of advanced
  The papers are organised around four main themes. The first part
  covers special aspects of the formal foundations of logic programming,
  namely operational semantics and correctness issues (including
  verification of Prolog compilation). Language extensions and
  methodology are the topics of the second section, dealing with
  modules, types and objects.  Part Three focuses on the paradigm of
  constraint logic programming and demonstrates its relevance to
  combinatorial problems. The fourth chapter presents a number of
  applications of logic programming, ranging from scheduling and robot
  control to image processing. The publication closes with an outlook on
  the challenges and opportunities lying ahead in the field of logic