Newsletter 63

December 14, 1999

[Past issues of the newsletter are available at]

  The URL for electronic paper submission to LICS 2000 is
* Submission Deadline is January 7, 2000

  An International Symposium in honor of the 150th birthday of 
  Erwin Engeler + Ernst Specker.
  Schloss Muenchenwiler, Murten (near Bern), Switzerland
  February 14 - 16, 2000
* Invited speakers: S. Adian, M. Boffa, M. Fuerer, E. Graedel,
  D. Mall, J. Meseguer, W. Pohlers, H. Schwichtenberg, D. Scott,
  O. Spinas, R. Staerk, V. Strassen, V. Weispfenning, S. Zachos.
* For further information please contact:

  Call for Papers
  Ponte de Lima, Portugal 
  July 6th, 2000 (back to back with MPC'00)
* Theme.  The aim of the workshop is is to bring together researchers
  in the area of programming languages and proof systems. The workshop
  is supported by the ESPRIT WG APPSEM (Applied Semantics), but is
  aimed at all researchers in the area, including those which are not
  formally involved in APPSEM. The emphasis of the workshop will be
  the use of subtyping and dependent types in programming languages
  and proof systems.  
* Technical topics include, but are not limited
  to subtyping in programming and proof systems, dependent types in
  programming, module systems, implementations, practical
  applications, meta-theoretical studies 
* Submission. Papers (no more than 15 pages) should be submitted
  preferably using an electronic submission form or by e-mail.  (More
  info at
* Important dates. Submission deadline 20 March 
                   Notification 30 April
                   Final version due 20 May Workshop 6 July 
* Invited speaker. Eugenio Moggi
* Program committee. Gilles Barthe, Peter Dybjer, Zhaohui Luo, Peter
  Thiemann, Simon Thompson.

  Call for Papers
  University of Geneva, Switzerland
  Saturday, 15 July 2000 (colocated with ICALP '00)
* Theme and format.  This is a workshop for researchers working on both
  the theory and practice of systems with intersection types and
  related systems (e.g., union types, refinement types, etc.).  The
  workshop will last one full day and will contain a long talk by each
  invited speaker, a panel discussion, and a short (approx. 25
  minutes) talk for each accepted paper.
* Topics for submitted papers.  The key requirement is some connection
  to intersection types or closely related systems.  Possible topics
  include principal typings, normalization properties, type inference
  algorithms, union types, refinement types, singleton types, abstract
  interpretation, contraints, denotational semantics, lambda models,
  program analysis, separate compilation, modularity, program
  extraction from proofs, etc.
* Submission.  Submit papers by e-mail to
  by 25 February 2000.  The web page details the format and submission
  requirements.  Acceptance will be decided by 31 March 2000.  Authors
  of accepted papers must complete the proceedings version by 28 April
  2000 and give a talk at the workshop.  The proceedings will be
  published by Carleton University Press in their International
  Informatics Series.
* Invited speakers.  Mariangiola Dezani-Ciancaglini, John Reynolds.
* Program committee.  Adriana Compagnoni, Maribel Fernández, Thomas
  Jensen, Jean-Louis Krivine, Jens Palsberg, Simona Ronchi Della
  Rocca, Betti Venneri, Joe Wells (Chair).

  Call for Papers
  Montreal, Canada
  18--20 September 2000 (associated with PLI 2000)
* Theme.  ICFP 2000 seeks original papers on the full spectrum of the art,
  science, and practice of functional programming.
* Applications Letters (Applets).  Conference attendees often hear only
  from those developing functional languages --- the users are too busy
  using them.  This year, the conference solicits application letters
  describing experience using functional languages to solve real-life
  problems.  Such papers may be judged by interest of the application
  and novel use of functional languages as opposed to a crisp new
  research result.
* Functional Pearls.  Ideas that are small, rounded, and glow with their
  own light may have a number of venues, but conferences are not
  typically among them.  This year, the conference invites papers that
  develop a short functional program.  Such papers may be judged by
  elegance of development and clarity of expression as opposed to a
  crisp new research result.
* Submissions.  The submission deadline is 13.00 EST (18.00 UTC), 1
  March 2000; this is a hard deadline.  Submissions will be carried out
  electronically via the Web.  (The exact method will be determined at a
  later date.)  Papers must be submitted as PostScript documents that
  are interpretable by Ghostscript, or in PDF format, and they must be
  printable on both USLetter and A4 paper.
* Submission format.  Authors should submit a 100-200 word abstract and
  a full paper.  Submissions should be no more than 12 pages in standard
  ACM conference format: two columns, nine point font on ten point
  baseline, page 20pc (3.33in) wide and 54pc (9in) tall with a column
  gutter of 2pc (0.33in).
* Program committee.  Richard Bird (Oxford), Craig Chambers
  (Washington), Charles Consel (IRISA), Susan Eisenbach (Imperial),
  Fergus Henderson (Melbourne), Ralf Hinze (Bonn), Shriram Krishnamurthi
  (Rice), Xavier Leroy (INRIA/Trusted Logic), Eugenio Moggi (Genova),
  Greg Morrisett (Cornell), Atsushi Ohori (Kyoto), Catuscia Palamedissi
  (Penn State), Philip Wadler (Bell Labs) [Chair], Andrew Wright

  Call for Papers
  Sendai, Japan
  August 17-19, 2000
* Outline: IFIP TCS2000 is the first International Conference on
  Theoretical Computer Science organized by the IFIP TC1 on
  Foundations of Computer Science. The conference aims at Exploring
  New Frontiers of Theoretical Informatics. The conference co-chairs
  are Professors G. Ausiello (U. Roma) and T. Ito (Tohoku U.), and
  Professors W. Brauer, M. O. Rabin, J. Staples, and J. Traub as the
  Steering Committee members.  The conference proceedings will be
  published as a volume of Springer Lecture Notes in Computer Science.
* Major topics: The conference consists of two tracks: Track (1):
  Algorithms, Complexity and Models of Computation analysis and design
  of algorithms, algorithm experimentation, computational complexity,
  automata and formal languages, parallel algorithms, computational
  learning theory, cryptography, probabilistic and randomized
  algorithms, molecular computing, quantum computing, computational
  finance, etc.  Track (2): Logic, Semantics, Specification and
  Verification logic and semantics of programs and languages,
  foundations of specifications, proofs and specifications in computer
  science, concurrency theory, theory of internet languages and
  systems, foundations of security, specification and verification of
  hybrid and real-time systems, term rewiting systems, constructive
  and non-standard logics in computer science, etc.
* Invited Speakers: Plenary Invited Speakers: Martin Abadi, Masami
  Hagiya, Madhu Sudan. Track (1) Invited Speakers: Ernst Mayr, Shu
  Tezuka, Mihalis Yannakakis. Track (2) Invited Speakers: Thomas
  Henzinger, Naoki Kobayashi, Gordon Plotkin. Banquet Speaker: Michael
  O. Rabin
* Submission: Format and length: typeset in LaTeX2e using Springer
  document class llncs (see, 
  and no longer than 14 pages.  Addresses: authors should email
  Postscript file to one of the following addresses by January 28,
  2000: for Track (1),; for Track
  (2),  A submission should contain
  the track name for the submission, the title of the paper, names and
  affiliations of authors, an abstract up to 300 words, and the
  contact author's name, address, phone number, fax number, and email
  address.  The submission must be in English.  (See for more detail.)
* Program Committee: PC Co-Chairs: Track (1): Jan van Leeuwen
  (U. Utrecht) Osamu Watanabe (Tokyo Inst. of Tech.)  Track (2):
  Masami Hagiya (U. Tokyo) Peter D. Mosses (U. Aarhus). PC Members:
  Track (1): R. Baeza-Yates, S.-W. Cheng, F. Cucker, R. Gennaro, A.
  Gibbons, A. Goldberg, E. Mayr, H. Nagamori, K. Sakurai, P. Vitanyi,
  J. Wiedermann, T. Yokomori. Track (2): S. Abramsky, E. Astesiano,
  L. Cardelli, R. Constable, J.  Esparza, N. Kobayashi, J. Meseguer,
  B. Pierce, D. Sangiorgi, J.  Staples, A. Tarlecki, P. Thiagarajan,
  K. Ueda, N. Yonezaki

  Logical Frameworks and Meta-languages
  Call for Papers
* Topics.  The design of logical frameworks, meta-theoretical studies,
  comparative studies, implementation, techniques of representation of
  formal systems, etc.
* Submission.  Manuscripts should be unpublished works and not
  submitted elsewhere.  Revised and enhanced versions of papers
  published in conference proceedings that have not appeared in
  archival journals are eligible for submission.  All submissions will
  be reviewed according to the usual standards of scholarship and
  originality.  The deadline for submissions is January 31, 2000.
* Guest editors.  David Basin ( and
  Amy Felty (

  R. Cignoli, I.M.L. D'Ottaviano, D.Mundici
  Algebraic Foundations of Many-Valued Reasoning,
  (Trends, in Logic, Studia Logica Library, Vol.7)
* Kluwer Academic Publishers, 2000,
  244 pp., ISBN 0-7923-6009-5, US $ 100

* This is a call for admission and grant applications from students to
  BRICS International PhD School in Computer Science at University of
  Aarhus, Denmark.  The call is aimed at students starting August
  2000, with application deadline January 31st, 2000.
* BRICS International PhD School is an integrated part of the BRICS
  (Basic Research in Computer Science) Research Centre, and both are
  funded by the Danish National Research Foundation. The school admits
  10-15 students (Danish and foreign) annually, and it provides a
  substantial number of student grants.
* The core areas of the PhD School are: Semantics of Computation;
  Logic in Computer Science; Computational Complexity; Design and
  Analysis of Algorithms; Programming Languages; Distributed
  Computing; Verification; and Data Security and Cryptology.
* For more details, please visit,
  or contact us by e-mail at

  University of New South Wales, Sydney, Australia                       
  Murdoch University, Perth, Australia 
* Two research scholarships are available to new Ph.D. candidates, one
  at the School of Information Technology, Murdoch University Murdoch
  and one at the School of Computer Science and Engineering,
  University of New South Wales, for research in temporal and
  epistemic logic, as part of Australian Research Council funded
  project.  The research will be carried out under the supervision of
  (at UNSW) Assoc. Prof. Ron van der Meyden and (at Murdoch) Dr. Mark
  Reynolds.  Candidates with Honours degrees (or equivalent) in
  Computer Science or another relevant discipline (such as Mathematics
  or Philosophy) are welcome to apply. 
* Applications are due on Monday, 20th December 1999.
* For further information see (for the position at Murdoch)
  and (for the position at UNSW)
* Inquiries should be directed to Assoc. Prof. Ron van der Meyden,
  School of Computer Science and Engineering, University of New South
  Wales, Sydney 2052 Australia, email:, phone:
  +61 2 9385 4897, fax: +61 2 9385 5995, or Dr Mark Reynolds, Senior
  Lecturer in Computer Science, School of Information Technology,
  Murdoch University, Murdoch, Perth, Western Australia 6150,
  Australia.  email: telephone: +61 8 9360