LICS Newsletter 42

Newsletter 42

February 26, 1997

[Past issues of the newsletter are available at and]

  Mathematical Foundations of Programming Semantics (MFPS XIII)
  CMU, Pittsburgh, PA, March 23-26, 1997
  Note: registration deadline is March 1, 1997
* The Thirteenth Conference on the Mathematical Foundations of
  Programming Semantics will take place on the campus of Carnegie
  Mellon University in Pittsburgh, PA from March 23 to March 26,
  1997. The MFPS conferences are devoted to those areas of
  mathematics, logic and computer science which are related to the
  semantics of programming languages. The series particularly has
  stressed providing a forum where both mathematicians and computer
  scientists can meet and exchange ideas about problems of common
  interest. We also encourage participation by researchers in
  neighboring areas, since we strive to maintain breadth in the scope
  of the series.
* Registration information and the program are available at the URL
  above.  General inquiries about MFPS XIII can be addressed to 

  Object-oriented programming: a unified foundation
  Giuseppe Castagna
* Details about the book including: The Foreword (by Luca Cardelli),
  The table of contents, A presentation of the book, Price and
  ordering information, Pointers to related publications are available
  at the above URL.
* Ordering. For North America: Birkhauser Boston, 
  Outside North America: Birkhauser Verlag AG.
* From the back cover.  The language Simula is the precursor of all
  object-oriented languages. This language imposed a certain style of
  programming that was followed by all class-based object-oriented
  languages until the appearance of the so-called multiple-dispatching
  languages, like CLOS, in which a different style of object-oriented
  programming arose.  Although much work has been done to define a
  theory of object-oriented languages, efforts have concentrated
  mostly on languages that follow Simula's style, ignoring
  multiple-dispatching languages. This book fills the gap. It
  elucidates object-oriented concepts, facilitate comparisons of these
  two different styles of programming and sheds new light on some
  long-standing problems concerning, for example, the use of
  covariance and contravariance, or the typing of binary methods.
  This book also shows that it is possible to smoothly integrate both
  Simula's and CLOS's styles of programming into a single
  language. The book is self-contained and does not assume any
  expertise in object-oriented programming or type theory.  It will be
  consulted by professional computer scientists interested in the
  theory of programming and can serve as the text for a variety of
  advanced courses in type theory of object-oriented programming.

  Annual Conference of the European Association for Computer Science 
  Logic (CSL'97)
  August 23-29, 1997, Aarhus, Denmark
* CSL is the annual conference of the European Association for
  Computer Science Logic (EACSL).  The conference is intended for
  computer scientists whose research activities involve logic, as well
  as for logicians working on topics significant for computer science.
* Tutorials will be given by: S. Abramsky, A. E. Emerson, W. Thomas
  (Kiel) and I. Walukiewicz.
* Invited speakers. S.  Buss (San Diego), H.  Comon (Paris),
  T. Coquand (Gothenburg), M.  Hyland (Cambridge), N. Immerman
  (Amherst), N.  Klarlund (Murray Hill), Y.  Moschovakis (Los
  Angeles), L. Pacholski (Wroclaw).
* Submissions.  Submit a draft or full paper (up to 12 pages) by April
  15, 1997.  Electronic submissions are encouraged (see the above URL
  for more information). Alternatively, five hardcopies should be sent
  to: Prof. Mogens Nielsen, CSL '97, Department of Computer Science,
  University of Aarhus, Ny Munkegade, Bldg. 540, DK-8000 Aarhus C,
* Program Committee. K. Compton, J. Flum, J.-Y. Girard, F. Honsell,
  J.W. Klop, W. Marek, M. Nielsen (vice-chair), P. Pudlak,
  E. Robinson, A. Tarlecki, W. Thomas (Chair), I. Walukiewicz.

  Workshop  on Tools and Algorithms for the Construction 
  and Analysis of Systems
  April 2-4, 1997, University of Twente, Enschede, NL
  Warning: early deadline 1st March.
* The aim of the workshop is to bring together researchers and
  practitioners interested in the development and application of tools
  and algorithms for the specification, verification, analysis and
  construction of distributed and embedded systems.  The support
  offered by interacting or fully automatic tools is an important
  aspect of this workshop. There are theoretical papers with a clear
  link to tool construction, and tool descriptions with a conceptual
  message.  Scientific talks and tool presentations appear together in
  the programme and proceedings.

  Workshop on Formal Design of Safety Critical Embedded Systems
  16-18 April 1997, Munich, Germany

  Engineering Complex Computer Systems Minitrack
  part of the Emerging Technologies Track of the 31st Annual
  Hawaii International Conference on Systems Sciences (HICSS)
  Big Island of Hawaii,  January 6-9, 1998
* Goals.  The ECCS Minitrack, at its second year at HICSS, will bring
  together industrial, academic, and government experts from these
  various disciplines, to determine how the disciplines' problems and
  solution techniques interact within the whole system.  Researchers,
  practitioners, tool developers and users, and technology transition
  experts are all welcome.
* Topics.  Realtime architectures, tools, environments and languages,
  AI and intelligent systems, Database and data management, Virtual
  reality, multimedia, realtime imaging, Algorithms, optimization and
  analysis, Performance estimation, prediction and optimization,
  Prototyping and testing techniques, Formal methods and formal
  specification techniques, Hardware/software codesign,
  Communications, networking, mobile computing, Highly heterogeneous,
  distributed and parallel platforms, Case studies and project
* Submission.  Submit 6 copies of the full paper, consisting of 20-25
  double spaced typewritten pages including title page, abstract,
  references, and diagrams directly to: ALBERTO BROGGI, HICSS'98 ECCS
  Minitrack Coordinator, Dipartimento di Ingegneria dell'Informazione,
  Universit`a di Parma, I-43100 Parma, Italy. The deadline is March
  15, 1997. 

  International Workshop on Hybrid and Real-Time Systems (HART'97)
  Grenoble, March 26-28, 1997
* Preceded by the spring school: Methods and Tools for the
  Verification of Infinite State Systems.

  Computability and Complexity from a Programming Perspective
  Neil D. Jones
  MIT Press, 1997
  ISBN number: 0-262-10064-9 
* Ordering information. Web address:, or e-mail  
* This book's goal is to build a bridge between computability and
  complexity theory and other areas of computer science, making
  computability and complexity more accessible to computer scientists
  and more applicable to practical programming problems. In a shift
  away from the classical Turing machine- and Goedel number-oriented
  approaches, it uses concepts familiar from programming
  languages. New results include a proof that constant time factors do
  matter for its programming-oriented model of computation. (In
  contrast, Turing machines have a counterintuitive "constant speedup"
  property: that almost any program can be made to run faster, by any
  amount. Its proof involves techniques irrelevant to practice.)
  Further results include simple characterizations in programming
  terms of the central complexity classes PTIME and LOGSPACE, and a
  new approach to complete problems for NLOGSPACE, PTIME, NPTIME, and
  PSPACE, uniformly based on Boolean programs.

  International Logic Programming Symposium 97 (ILPS97)
  Pt Jefferson, NY, USA, October 12-17, 1997
* Original papers on all aspects of logic programming are
  solicited. The topics of interest include, but are not limited to:
  Theoretical foundations, Language design and implementation,
  Integration of LP with other paradigms, Programming methodology,
  Programming environments, Constraints, Deductive databases,
  Inductive LP, Concurrency and parallelism, Reasoning about programs,
  Program analysis and transformation, Non-monotonic reasoning, LP and
  Internet, LP and natural language.
* Papers must describe work not previously published. They must not be
  submitted concurrently to an archival journal or to another
  conference. Accepted papers must be presented at the
  conference. Papers must not exceed 5000 words (15 pages of the MIT
  Press proceedings format). Authors are invited to send manuscripts
  by electronic mail as uuencoded gzipped Postscript or dvi
  files. (Instructions are available in the conference home page.) In
  addition a separate e-mail message should be sent containing the
  paper title and abstract, authors, keywords, postal address, e-mail
  address and fax number. The e-mail address for submissions is:  If e-mail is not available five (5) copies of
  the paper should be sent to: Jan Maluszynski, Linkoeping University,
  Department of Computer and Information Science, S-581 83 Linkoeping,
  Sweden. All submissions (electronic and hardcopy) should be received
  before April 4 1997 at 5:00 PM GMT.