Newsletter 78
March 25, 2002
*******************************************************************
* Past issues of the newsletter are available at
http://www.lfcs.informatics.ed.ac.uk/lics/newsletters/
* Instructions for submitting an announcement to the newsletter
can be found at
http://www.lfcs.informatics.ed.ac.uk/lics/newsletters/inst.html
*******************************************************************
TABLE OF CONTENTS
* CONFERENCES AND WORKSHOPS
Conference of the European Association for Computer Science Logic
Symposium on Principles of Programming Languages
Workshop on Implicit Computational Complexity
International Workshop on Unification
Workshop on Proof, Computation, Complexity
Workshop on Categorical Methods for Concurrency, Interaction,
and Mobility
Workshop on Term Graph Rewriting
Colloquium on the Occasion of Schwichtenberg's 60th Birthday
Workshop on Foundations of Models and Languages for Data and Objects:
Databases, Logic and Semistructured Data
Workshop on Reduction Strategies in Rewriting and Programming
Workshop on Complexity in Automated Deduction
* SUMMER SCHOOLS
North American Summer School in Logic, Language, and Information
TYPES Summer School: Theory and Practice of Formal Proofs
* BOOK ANNOUNCEMENT
Foundations of Object-Oriented Programming Languages:
Types and Semantics by Kim B. Bruce
* MISCELLANEOUS
Rolf Schock Prize Awarded to Kripke
CONFERENCE OF THE EUROPEAN ASSOCIATION FOR COMPUTER SCIENCE LOGIC (CSL'02)
22--25 September 2002
Edinburgh, UK
http://www.dcs.ed.ac.uk/csl02/
* Computer Science Logic (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 issues
significant for computer science.
* The following will deliver invited lectures: Susumu HAYASHI (Kobe),
Frank NEVEN (Limburg), Damian NIWINSKI (Warsaw)
* Important Dates:
Submission: 29 March 2002 for the title and abstract, and
7 April 2002 for the full text
Notification: 2 June 2002
Final copy due: 21 June 2002
* Programme Committee: Thorsten Altenkirch (U. Nottingham), Rajeev
Alur (U. Pennsylvania), Michael Benedikt (Bell Labs), Julian
Bradfield (U. Edinburgh (Chair)), Anuj Dawar (U. Cambridge), Yoram
Hirshfeld (U. Tel Aviv), Ulrich Kohlenbach (U. Aarhus), Johann
Makowsky (Technion Haifa), Dale Miller (Pennsylvania State U.), Luke
Ong (U. Oxford), Frank Pfenning (Carnegie Mellon U.), Philippe
Schnoebelen (ENS Cachan), Luc Segoufin (INRIA Rocquencourt), Alex
Simpson (U. Edinburgh), Thomas Streicher (T.U. Darmstadt)
30TH ANNUAL SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES (POPL'03)
Call for Papers
January 15-17, 2003
New Orleans, Louisiana
http://www.cs.berkeley.edu/~aiken/popl03
* Submission Guidelines: Papers are to be submitted in the form of an
extended abstract of 5000 words or less excluding bibliography and
figures.
* Important Dates:
Submission: Friday, July 19, 2002
Notification: Tuesday, Sept. 24, 2002
Camera-ready copy due: Tuesday, Nov. 12, 2002
The submission deadlines given above are firm.
* Program Committee: Lennart Augustsson, Rastislav Bodik, Kim Bruce,
Jack Davidson, Amy Felty, John Field, Cormac Flanagan, Joxan Jaffar,
Greg Morrisett (chair), Catuscia Palamidessi, Francois Pottier, Amr
Sabry, Davide Sangiorgi, Bjarne Steensgard, Joe Wells
WORKSHOP ON IMPLICIT COMPUTATIONAL COMPLEXITY (ICC'02)
(affiliated with FLOC 2002)
Second call for Papers
Copenhagen, 20-21 July 2002
http://http://www.cis.syr.edu/~royer/icc
* Scope: The workshop seeks original research reports on advances in
implicit computational complexity. Topics of interest include
(but are not limited to): automatic complexity analysis of
programs, complexity analysis for functional languages,
higher-type computational complexity, logical and
machine-independent characterizations of complexity classes logics
closely related to complexity classes, software that applies ICC
ideas in programming language design and in formal methods, and
type systems for controlling complexity
* All submissions must be done electronically. Please email your
submission to royer@ecs.syr.edu
* Submission Deadline : 30 April, 2002
* Program committee. Jean-Yves Girard (Institut de Mathematiques de
Luminy, Marseille) Martin Hofmann (Ludwig-Maximilians-Universitat,
Muenchen) Neil Jones (University of Copenhagen, Denmark) Jean-Yves
Marion (Loria, Nancy, France) James Royer (Syracuse University,
Syracuse, NY, USA) (Chair) Paul Voda (Comenius University,
Slovakia)
16TH INTERNATIONAL WORKSHOP ON UNIFICATION (UNIF 2002)
(affiliated with RTA 2002, part of FLoC'02)
Call for Abstracts/Participation
Copenhagen (Denmark), July 25-26, 2002
http://unif2002.lri.fr
* Goal. The main purpose of UNIF is to bring together people
interested in unification, present recent (even unfinished) work,
and discuss new ideas and trends in unification and related fields.
* Theme. Unification is concerned with the problem of identifying
given terms, either syntactically or modulo a given logical
theory. Unification is the basic operation of most automated
reasoning systems.
* Topics. General E-unification and Calculi, Special Unification
Algorithms, Matching, Narrowing, Higher-Order Unification,
Combination problems, Disunification, Typed Unification, Constraint
Solving, Unification Calculi, Type Checking and Reconstruction,
Unification-Based approaches to Grammar, Applications, Implementations.
* Submission. Anyone interested in participating to UNIF 2002, should
send an email message to unif2002@lri.fr not later than June 1,
indicating their full name and address and whether they intend to
give a talk. This does not replace the usual registration procedure
of FLoC, please see the FLoC web page (http://floc02.diku.dk) for
information on how to register (FLoC early registration deadline:
June 15). Those interested in giving a talk should also submit a
Postscript or PDF file of an extended abstract (2-4 pages prepared
using LaTeX2e) and specify whether the talk will be a short (15 min)
or a long one (30 min). Final versions of accepted submissions (5
pages maximum) will be collected in a technical report.
* Important dates:
- *Firm* Submission deadline: June 1
- Notification of acceptance: June 7
- Final versions: June 24
* Organization Committee:
Christophe Ringeissen (LORIA Nancy, France), Cesare Tinelli
(Univ. Iowa, USA), Ralf Treinen (Univ. Paris-Sud, France),
Rakesh M. Verma (Univ. Houston, USA).
WORKSHOP ON PROOF, COMPUTATION, COMPLEXITY
Call for participation
Tuebingen (Germany), April 8 - 9, 2002
* The workshop is aimed at computer scientists and logicians who share
an active interest in proof theory, computation and complexity
theory. It focusses on recent developments in these fields, and it
strongly supports discussion of perspectives in future research.
In particular, we would like to welcome young researchers to
participate.
* Further information can be obtained from the following web page:
http://www-ls.informatik.uni-tuebingen.de/logik/kahle/pcc.html
* Contact addresses:
Birgit Elbl (birgit@informatik.unibw-muenchen.de)
Reinhard Kahle (kahle@informatik.uni-tuebingen.de)
WORKSHOP ON CATEGORICAL METHODS FOR CONCURRENCY, INTERACTION, AND
MOBILITY
Brno, Czech Republic, 24 August 2002
affiliated with CONCUR 2002
http://www.cwi.nl/cmcim
* Topics of interest include: categorical algebras of processes,
categorical methods in game semantics and geometry of interaction,
categorical models of term/graph rewriting or rewriting logic,
Chu spaces, coalgebras, bialgebras, coinduction, comparing models
of concurrency, enriched categories of processes,
interaction categories, presheaf models.
* Programme committee: Samson Abramsky (Oxford), Thomas Hildebrandt
(Copenhagen), Alexander Kurz (Amsterdam), Ugo Montanari (Pisa),
Prakash Panangaden (Montreal), Horst Reichel (Dresden),
Jiri Rosicky (Brno), Bob Walters (Como).
* Submission of ps-files to kurz@cwi.nl (subject: CMCIM-submission)
* Submission deadline: May 24, 2002
INTERNATIONAL WORKSHOP ON TERM GRAPH REWRITING (TERMGRAPH 2002)
(A satellite event of The First International Conference on Graph
Transformation, ICGT 2002)
Call for Papers
Barcelona, Spain, October 7, 2002
http://www.cs.york.ac.uk/~det/Termgraph_2002/cfp.html
* Topics of interest. All aspects of term graphs and sharing of common
subexpressions in rewriting, programming, automated reasoning and symbolic
computation. This includes (but is not limited to): Theory of first-order
and higher-order term graph rewriting; graph rewriting in lambda calculus
(sharing graphs, optimality); applications in functional, logic and
functional-logic programming; applications in automated reasoning and
symbolic computation; implementation issues; system descriptions
* Submissions. Authors are invited to submit an extended abstract of 5 to
10 pages by e-mail to the program chair (det@cs.york.ac.uk). Submissions
should be in PostScript format. It is strongly recommended to use LaTeX
and ENTCS style files (http://math.tulane.edu/~entcs/).
* Publication. Accepted contributions will appear in an issue of Elsevier's
Electronic Notes in Theoretical Computer Science.
* Important dates.
Submission deadline: June 15, 2002
Notification: July 15, 2002
Final version due: September 6, 2002
* Program committee. Zena M. Ariola (University of Oregon, Eugene),
Richard Banach (University of Manchester), Rachid Echahed (IMAG, Grenoble),
Richard Kennaway (University of East Anglia, Norwich), Jan Willem Klop
(Free University of Amsterdam), Rinus Plasmeijer (University of Nijmegen),
Detlef Plump (University of York, chair)
COLLOQUIUM ON THE OCCASION OF HELMUT SCHWICHTENBERG'S 60th BIRTHDAY
Call for Participation
Munich, April 6, 2002
http://www.mathematik.uni-muenchen.de/~minlog/index.e.html
* Speakers:
Gerhard Jaeger, Berne
Hans Leiss, Munich
Peter Paeppinghaus, Munich
Robert Staerk, Zurich
Anne Troelstra, Amsterdam
Jaco van de Pol, Amsterdam
Stan Wainer, Leeds
* The colloquium will start at 9am. In the evening there will be a
birthday dinner at the restaurant "Weisses Braeuhaus". We would like
to ask you to register for the dinner before March 25th using the
following web address:
http://www.mathematik.uni-muenchen.de/~minlog/register.html
* For further information - also about accommodation and travel - please
consult:
http://www.mathematik.uni-muenchen.de/~minlog/index.e.html
or contact us by e-mail:
minlog@mathematik.uni-muenchen.de
* For the organization committee:
Ulrich Berger, Reinhard Kahle, Ralph Matthes.
ELEVENTH INTERNATIONAL WORKSHOP ON FOUNDATIONS OF MODELS AND LANGUAGES
FOR DATA AND OBJECTS: DATABASES, LOGIC AND SEMISTRUCTURED DATA (FMLDO'02)
September 24-27, 2002
Schloss Rauischholzhausen, Germany
http://www.fmldo.org/fmldo02/
* Scope of the Workshop Series: This international workshop will be
the eleventh in a series focusing on foundations of models and
languages for data and objects. The main principle of this workshop
series is to concentrate on one selected topic and to offer the
opportunity for in-depth exchange of ideas and experiences. In order
to stimulate extensive discussions, presentation slots will be about
one hour long. In addition to the talks, there will be working
groups and panel discussions.
* Topics: The general focus of this workshop will be on ``Databases,
Logic and Semistructured Data''. Our goal is to bring researchers on
deductive databases and researchers on semistructured data and the
``semantic web'' together. Papers on the combination of both areas
will be especially welcome, but we will also accept contributions on
only one of the two areas.
* Invited Speakers: Wenfei Fan (Bell Laboratories and Temple
University, Philadelphia, USA), Georg Gottlob (Technical University
of Vienna, Austria), Jack Minker (University of Maryland, USA).
* Important Dates:
Submission: May 13, 2002
Notification: July 8, 2002
Camera Ready Papers Due: August 19, 2002
Workshop: September 24-27, 2002
* Program Committee:
Stefan Brass (chair), Peter Buneman (chair), Thomas Schwentick
(chair), Francois Bry, Diego Calvanese, Vassilis Christophides,
Stefan Conrad, Alin Deutsch, Juergen Dix, Thomas Eiter, Juliana
Freire, Giorgio Ghelli, Martin Grohe, Michael Kifer, Georg Lausen,
Leonid Libkin, Udo Lipeck, Rainer Manthey, Alberto Mendelzon, Frank
Neven, Werner Nutt, Raghu Ramakrishnan, Dan Suciu, Jan Van den
Bussche, Victor Vianu, Phil Wadler, Gerd Wagner, David Warren, Carlo
Zaniolo
* Organizing Committee:
Stefan Brass, Thomas Schwentick, Stefan Conrad
2ND INTERNATIONAL WORKSHOP ON REDUCTION STRATEGIES IN REWRITING AND
PROGRAMMING (WRS 2002)
(affiliated with RTA 2002, part of FLoC 2002)
Call for Papers
Copenhagen, Denmark, July 21, 2002
Website at FLoC: http://floc02.diku.dk/WRS/
Main website: http://www.dsic.upv.es/users/elp/WRS2002
* Background: Reduction strategies in rewriting and programming have
attracted an increasing attention within the last years. Research in
this field ranges from primarily theoretical questions about
reduction strategies to very practical application and
implementation issues. The workshop wants to provide a forum for the
presentation and discussion of new ideas and results, as well as of
surveys on existing knowledge in this area.
* Topics of interest include (but are not restricted to): theoretical
foundations; strategies in different frameworks; strategies and
their application in programming languages; properties,
interrelations, combinations and applications of reduction
strategies; program analysis and other semantics-based optimization
techniques dealing with reduction strategies; specification and
implementation techniques for reduction strategies.
* Submissions should not exceed 10 pages (except for survey
papers) and be sent to wrs02@dsic.upv.es.
Submission deadline: April 15, 2002. Notification: May 27, 2002.
* Invited Speakers: Aart Middeldorp (U Tsukuba), Vincent van Oostrom
(U Utrecht).
* Program committee: S. Antoy (U Portland State), R. Di Cosmo (U Paris
VII), B. Gramlich (TU Wien, co-chair), M. Hanus (U Kiel),
C. Kirchner (LORIA, Nancy), P. Klint (CWI Amsterdam), S. Lucas (TU
Valencia, co-chair), M. Schmidt-Schauss (U Frankfurt a.M.),
Y. Toyama (U Tohoku).
* Proceedings: The final workshop proceedings will be published in the
Electronic Notes in Theoretical Computer Science (ENTCS) series
(http://www.elsevier.nl/locate/entcs) of Elsevier. Preliminary
hardcopy proceedings will be available at the workshop.
SECOND INTERNATIONAL WORKSHOP ON COMPLEXITY IN AUTOMATED DEDUCTION
(affiliated with CADE-18 within FLoC'02)
Copenhagen, Denmark
July 25-26 2002
http://www.loria.fr/~hermann/workshop2002eng.html
* The Workshop on Complexity in Automated Deduction will bring
together researchers who work on or have a serious interest in
problems that are in the interface between automated deduction and
computational complexity. The aim of the workshop is to enhance the
interaction between automated deduction and computational complexity
through invited and contributed talks that will present
comprehensive overviews, report on state-of-the art advances, and
expand the horizons of this area of research.
* Invited speakers: Marco Cadoli (Università di Roma La Sapienza,
Roma, Italy), Hubert Comon (LSV, ENS Cachan, France), Erich Grädel
(RWTH Aachen, Germany), Martin Grohe (University of Edinburgh, UK),
Phokion G. Kolaitis (University of California, Santa Cruz, USA),
Paliath Narendran (SUNY Albany, USA), Reinhard Pichler (Siemens AG
Austria and TU Wien, Vienna, Austria), Pavel Pudlak (Mathematical
Institute, Academy of Sciences, Prague, Czech Republic), Andrei
Voronkov (University of Manchester, UK)
* Contributed talks: In addition to the invited presentations, there
will be contributed talks. If you are interested in giving such a
contributed talk, please send an abstract, preferably as a
PostScript® attachment, to Miki.Hermann@loria.fr no later than
Friday, May 10, 2002.
Authors will by notified of acceptance on May 31, 2002. The final
versions of accepted papers are due on June 7, 2002.
* Organizers: Georg Gottlob (TU Wien, Vienna, Austria), Miki Hermann
(LORIA, Nancy, France), Michael Rusinowitch (LORIA, Nancy, France)
FIRST NORTH AMERICAN SUMMER SCHOOL IN LOGIC, LANGUAGE, AND INFORMATION
(NASSLI'02)
June 24-30, 2002, Stanford, California, USA
http://www.stanford.edu/group/nasslli
* Theme. The thematic focus of NASSLLI is modeled on that of its
European sister event, ESSLLI. As it is customary with schools of
this nature, the classes will run from foundational and introductory
to advanced. Each lecturer will give a set of five one hour lectures
on a topic suitable for a broad audience interested in the interface
of logic, language, and computation.
* Audience. NASSLLI is ideal for graduate and advanced undergraduate
students in linguistics, computer science, philosophy, mathematics
and psychology, as well as postdoctoral students, IT professionals,
and faculty seeking to extend their knowledge of the field.
* Program to date:
- Martin Abadi (CS, UCSC) [Computer Security]
- Samson Abramsky (CS, Oxford) [Games in Computer Science]
- Sergei Artemov (CS, CUNY New York) [Proof Polynomials]
- Patrick Blackburn (INRIA Lorraine) [Lectures on Hybrid Logic]
- Craig Boutilier (CS, University of Toronto) [Logical and Statistical
Methods in AI]
- Joan Bresnan (Linguistics, Stanford) [Optimality Theory]
- Paul Dekker (Philosophy, Amsterdam) [Dynamics, Semantics, Pragmatics]
- R.E. Jennings (Philosophy, Simon Fraser University) [Logicalization]
- Ed Keenan (Linguistics, UCLA) [A Mathematical Theory of Grammatical
Theories]
- Phokion Kolaitis (CS, UCSC) [Constraint Satisfaction, Complexity, and
Logic]
- Larry Moss (Math, Indiana) [Dynamic Epistemic Logic]
- Marc Pauly and Mike Wooldridge (Liverpool) [Modal Logic and Agents]
- Fernando C.N. Pereira (Computer and Information Science, UPenn)
[Machine Learning in Natural Language Processing]
- Frank Veltman (Logic & Cognitive Science, Amsterdam) [Logic in AI]
- Dag Westerstahl (Philosophy, Stockholm) and Stanley Peters
(Linguistics, Stanford) [Generalized Quantifiers]
* In addition to lectures, the event will include workshops, evening
lectures by distinguished researchers, as well as sporting events,
party and more.
TYPES SUMMER SCHOOL: THEORY AND PRACTICE OF FORMAL PROOFS
September 2-13, 2002, Giens, French Riviera, France
organized by the the IST European project "TYPES"
(Computer-Assisted Reasoning based on Type Theory).
URL: http://www-sop.inria.fr/certilab/types-sum-school02/
* Scope: This two weeks' course is for postgraduate students,
researchers and industrials who want to learn about interactive
proof development. There will be introductory and advanced lectures
on lambda calculus, type theory, logical frameworks, program
extraction, and other topics which give relevant theoretical
background. Several talks will be devoted to the presentation of
applications. The proof assistants presented in the school
represent the current state-of-the-art in interactive theorem
proving. Participants will get extensive opportunities to use the
systems in a workstation environment for developing their own proofs.
* Deadline for application: Friday April 19, 2002.
BOOK ANNOUNCEMENT
Foundations of Object-Oriented Programming Languages:
Types and Semantics
Kim B. Bruce
The MIT Press, 2002, ISBN 0-262-02523-X
http://www.cs.williams.edu/~kim/FOOPL.html
* This text explores the formal underpinnings of object-oriented
languages to help the reader understand the fundamental concepts of
these languages and the design decisions behind them.
* The text begins by analyzing existing object-oriented languages,
paying special attention to their type systems and impediments to
expressiveness. It then examines two key features: subtypes and
subclasses. After a brief introduction to the lambda calculus, it
presents a prototypical object-oriented language, SOOL, with a
simple type system similar to those of class-based object-oriented
languages in common use. The text offers proof that the type system
is sound by showing that the semantics preserves typing
information. It concludes with a discussion of desirable features,
such as parametric polymorphism and a MyType construct, that are not
yet included in most statically typed object-oriented languages."
* The target audience for the book includes researchers, graduate
students, and others interested in understanding the types,
semantics, and language design issues relevant to the study of
object-oriented languages.
ROLF SCHOCK PRIZE AWARDED TO KRIPKE
* The 2001 Rolf Schock Prize in Logic and Philosophy has been awarded
to Saul A. Kripke, Professor Emeritus at Princeton University, "for
his creation of the modal-logical semantics that bear his name and
for his associated original and profound investigations of identity,
reference and necessity."
* Dr. Rolf Schock, who died in 1986, specified in his will that half
of his estate should be used to fund four prizes in the fields of
logic and philosophy, mathematics, the visual arts, and music. It
was his wish that the prizes in logic and philosophy and in
mathematics should be awarded by the Royal Swedish Academy of
Sciences, and those in the visual arts and music by the Royal
Academy of Fine Arts and the Royal Swedish Academy of Music
respectively.
* Beginning in 1993, the prizes are awarded every two years at a joint
ceremony. The 2001 Prizes were presented by Princess Christina at a
ceremony in the Great Hall of the Royal Swedish Academy of Music on
October 25, 2001, and carry an award of SEK 500,000 (around
$50,000).
Back to the LICS web page.