LICS Newsletter 53

Newsletter 54

July 17, 1998

[Past issues of the newsletter are available at and]

* The LICS'97 and LICS'98 organizers have a limited number of
  conference proceedings available for sale to the LICS community.
  Orders must be placed by individuals.  The price is $30 for the
  LICS'98 proceedings and $20 for the LICS'97 (last year's)
  proceedings, including shipping and handling.  Subsidized prices, of
  $20 and $15 respectively, apply for shipments to addresses in the
  following areas: Africa, Central and South America (including
  Mexico), Asia and Oceania (except for Japan, Australia, and New
  Zealand), the Balkans, and all former Warsaw Pact countries.
* Modes of payment.  (1) Check: Mail order with check, payable to
  "Indiana University (LICS'98)", to the following address: LICS'98,
  Computer Science Department, Indiana University, Bloomington, IN
  47405, USA.
  (2) Credit card: Use Visa or Master Card (no other card).  Provide
  your credit card number, expiration date, and your name exactly as
  it appears on your card.  Either mail or fax your order with credit
  card information to the address above, or e-mail it to  Note that for credit card orders, $4
  processing fee will be added per order (single or multiple copies),
  and orders must be received by August 31.

  Call for Nominations
* The ACM Kanellakis Theory and Practice Award is given to an
  individual or group for a specific theoretical accomplishment that
  has had a significant and demonstrable effect on the practice of
  computing.  The nature of the theoretical accomplishment may be
  either an invention itself or a major analytic study of an existing
  technique that led practitioners to adopt it.  The Award has been
  established in memory of the late Paris C. Kanellakis, whose tragic
  death in late 1995 cut short a distinguished research career.
  Winners of the award will be chosen by a 5-member committee
  appointed by the ACM Awards Committee Chair.  Membership on the
  committee will be on a rotating basis, with 5-year terms.  The
  current committee consists of David Johnson, Tom Leighton, Barbara
  Liskov, Christos Papadimitriou, and Moshe Y. Vardi (chair).
* A nomination will consist of three related parts.  (1) A discussion
  of the theoretical work being nominated, including copies of
  relevant publications or other documentation of the accomplishment.
  (2) A description of the claimed practical impact, together with
  evidence supporting the claims, either in the form of published
  references or attached statements by one or more top practitioners
  in the relevant field.  (3) Evidence of the linkage between the
  theoretical work and the practical impact, either in the form of
  documentation that implies the linkage, or attached statements from
  the implementers attesting to it.
* Nominations should be sent by October 1, 1998 to Moshe Y. Vardi,
  Dept of Computer Science, Rice University, Mail Stop 132, 6100
  S. Main Street, Houston, TX 77005-1892, Phone: 713-285-5977,
  713-285-5930 (fax),  For additional information,
  see the URLs above.

  July 2-4, 1999, Trento, Italy
  Call for papers
* Topics.  Term rewriting systems, Symbolic and algebraic computation,
  String and graph rewriting, Equational programming languages,
  Conditional and typed rewriting, Rewriting-based theorem proving,
  Lambda calculi, Completion techniques, Higher-order rewriting,
  Unification and matching algorithms, Constrained rewriting and
  deduction, Constraint solving, Parallel rewriting and deduction,
  Functional and logic programming. In addition to full research
  papers, descriptions of new working systems and problem sets that
  provide realistic, interesting challenges in the field of rewriting 
  techniques are also welcome. 
* Paper Submission.  Submissions must be unpublished, not submitted
  for publication elsewhere and should fall into one of the three
  categories: regular research papers (at most 15 pages), system
  descriptions (4 pages) or problem sets. All submissions must be sent
  electronically in Postscript form to one of the program chairs (if
  this is not possible, six hard copies may be sent).  The deadline
  for submission is December 1, 1998.
* Program Co-chairs.  Paliath Narendran, SUNY at Albany, Department of
  Computer Science, Albany, NY 12222, USA,; and
  Michael Rusinowitch, LORIA and INRIA Lorraine, 615, rue du Jardin
  Botanique, BP 101, 54602 Villers les Nancy cedex, France,
* Program Committee.  Andrea Asperti Rémi Gilleron, Bernhard Gramlich,
  Jieh Hsiang, Richard Kennaway, Delia Kesner, Klaus Madlener, William
  McCune, Paliath Narendran, Michael Rusinowitch, Klaus U. Schulz,
  Geraud Senizergues, G. Sivakumar, Andrei Voronkov.

  22-26 March 1999, Amsterdam, the Netherlands
  Call for papers
* Topics.  Verification and construction techniques; compositional and
  refinement-based methodologies; heterogeneous analysis;
  theorem-proving and model checking; analytical techniques for
  real-time, hybrid, probabilistic, and safety-critical systems; tool
  environments and tool architectures; and applications and case
* Submission.  The deadline for submissions is 28 September 1998.
  Submitted papers must be in English and must not have appeared in,
  or have been submitted to, other symposia or journals.  Papers
  should be no more than 15 pages in the Springer-Verlag LNCS style.
  Electronic submission of papers is strongly recommended; details for
  doing this may be found on the TACAS '99 Web page.
* Invited speaker. Jeff Kramer of Imperial College, UK.
* Program committee.  Rajeev Alur, Ed Brinksma, Rance Cleaveland,
  Hubert Garavel, Fausto Giunchiglia, Mike Gordon, Roberto Gorrieri,
  Jan Friso Groote, Nicolas Halbwachs, Gerard Holzmann, Kurt Jensen,
  Kim Larsen, Tiziana Margaria, David Notkin, Gregor Snelting.

  Vienna University of Technology, October 9-10, 1998
  Call for participation
* The international workshop Collegium Logicum 1998: Complexity is
  intended as a forum for the exchange of ideas and interaction
  between researchers working in computational and logical
  complexity. The workshop covers different areas of computer science,
  logic and mathematics including circuit complexity, structural
  complexity, proof complexity, finite model theory, bounded
  arithmetic, and complexity of information systems.
* Invited speakers.  A. Beckmann, H. Buhrman, A. Carbone,
  P. Crescenzi, T. Eiter, E. Grädel, M. Grohe, J. Krajicek,
  A. Leitsch, A. Razborov, Z. Sadowski, H. Veith.
* Contributed talks.  Participants are invited to present short
  contributed talks. Since there is only a limited number of time
  slots for contributed talks, participants are encouraged to contact
  the organizers before August 1, 1998 at

  Oxford University Computing Laboratory
* Requirements.  Applications are sought from candidates with
  interests both in programming tools and theory. In particular, we
  look for a good background in compiler construction, functional
  programming, systems specification, and automated theorem
  proving. UK candidates are expected to have a 1st class honours
* Benefits.  The studentships will cover fees and subsistence.
  Support is at the level of an EPSRC CASE studentship; overseas
  applicants are expected to apply for a supplementary ORS award.
  Each student is likely to have exclusive use of equipment on loan
  from Microsoft. Successful applicants may be considered for summer
  internships at Microsoft's Redmond laboratory.
* Applications and further information.  Applications should be in the
  form of a full curriculum vitae, clearly marked 'Microsoft'.  These
  should be sent to: The Secretary for Graduate Studies, Oxford
  University Computing Laboratory, Wolfson Building, Parks Road,
  Oxford, OX1 3QD.  Email applications should be sent to:; requests for further information should also
  be directed to this email address.  It is expected that interviews
  will be held at the end of July.

  Domains and Lambda Calculi
  by Roberto Amadio and Pierre-Louis Curien
  Cambridge Tracts in Theoretical Computer Science 46
  ISBN 0-521-62277-8, Cambridge University Press
* Table of Contents.  1. Continuity and computability.  2. Syntactic
  theory of the lambda-calculus.  3. D-infinity models and
  intersection types.  4. Interpretation of lambda-Calculi in CCC's.
  5. CCC's of Algebraic Dcpo's.  6. The Language PCF.  7. Domain
  equations.  8. Values and computations.  9. Powerdomains.  10. Stone
  duality.  11. Dependent and second order types.  12. Stability.
  13. Towards linear logic.  14. Sequentiality.  15. Domains and
  realizability.  16. Functions and processes.  App 1. Summary of
  recursion theory.  App 2. Summary of category theory.
* Order information. URL above or (for North-America). 

  The University of Birmingham
  School of Computer Science
* This post has arisen through a one year leave of absence granted to
  Dr de Paiva. Applications in the area of Theoretical Computer
  Science will be treated preferentially but applicants from other
  areas will also be considered. There may be an opportunity to extend
  this post beyond one year.  The teaching duties connected with this
  appointment will include a two semester introduction to computing
  for students in the Faculty of Arts.  Applicants should have or be
  about to complete a PhD in Computer Science or a closely related
  field, or should have equivalent research experience.
* Application. Application forms and further particulars available
  from: The Director of Staffing Services, The University of
  Birmingham, Edgbaston, Birmingham, B15 2TT, tel: +44 (0)121 414 6486
  (24 hours), email:  Please quote reference
  13669.  Informal enquiries to: Prof Achim Jung, tel: +44 (0)121 414
  4776, email: