Ulf Nilsson | 3 Jan 10:21 1997

ILPS97: Call for Workshop PROPOSALS

 Please post and print. We apologize if you receive multiple
 copies of this posting.




 The International Logic Programming Symposium ILPS'97 will be
 held October 12-17, 1997 at Port Jefferson, NY. Sponsored by
 the Association for Logic Programming in cooperation with the
 University at Stony Brook, it is fourteenth in the series of
 symposia on logic programming initiated in the US in 1984.

 In the recent editions of the symposium the post-conference
 workshops have played an increasingly important role in
 presenting novel emerging ideas. Recognizing the importance
 of these events the organizers of ILPS'97 plan to encourage
 cooperation between the ILPS'97 workshop organizers and the
 program committee, and to indicate web links to the workshop
 material in the MIT Press volume of the proceedings of

 The persons intending to organize a workshop at ILPS'97 are
 invited to submit a workshop proposal by January 15, 1997.
 The address for submission is tswift@... with a
 copy to ilps97@...

(Continue reading)

Geoff Sutcliffe | 12 Jan 22:44 1997

CADE-14 - Call for Workshops and Tutorials



          The 14th International Conference on Automated Deduction

                  July 13-17, 1997, Townsville, Australia

                                  FINAL CALL FOR WORKSHOPS AND TUTORIALS

 Program Committee           CADE  is the  major  forum  for  presentation  of
 L. Bachmair (Stony Brook)   research  in all aspects  of automated deduction.
 H. Comon (Orsay)            Proposals for  workshops and tutorials, which are
 W. Farmer (Bedford)         to be held Sunday, July 13, are solicited for the
 M. Fujita (Tokyo)           14th CADE.  Workshops will run the whole day, and
 H. Ganzinger (Saarbruecken) tutorials for half a day.
 F. Giunchiglia (Trento)     
 J. Harrison (Turku)                             Topics
 R. Hasegawa (Kyushu)
 S. Hoelldobler (Dresden)    Recent   CADE   workshops   have   included  term
 J. Hsiang (Taipei)          schematizations  and their  applications,  visual
 D. Kapur (Albany)           reasoning,  automation of proofs by  mathematical
 C. Kirchner (Nancy)         induction, empirical studies in logic algorithms,
 C. Kreitz (Cornell)         mechanization of partial functions,  proof search
 A. Leitsch (Vienna)         in  type-theoretic   languages,  automated  model
 R. Letz (Munich)            building,  and evaluation  of automated  theorem-
 E. Lusk (Argonne)           proving  systems.  Workshops  frequently have the
 U. Martin (St. Andrews)     same  topic as those  of previous workshops,  and
 D. McAllester (Murray Hill) this  practice   is   encouraged.   Recent   CADE 
 W. McCune (Argonne)         tutorials  have  included  equality  reasoning in 
(Continue reading)

M. Bognar | 13 Jan 18:52 1997

dep. record types?

Attachment: application/octet-stream, 802 bytes
Claudia Farnik | 13 Jan 15:29 1997


[ Please feel free to re-distribute this announcement to
  any colleagues who may be interested. We apologize in
  advance for multiple receptions of this announcement   ]


Progress in Theoretical Computer Science series.



by 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:


Information can be obtained from the publisher, as well:

(for North America)
Birkhauser Boston
675 Massachussetts Avenue
Cambridge, Massachussetts 02139
Email: info@...

(outside North America)
Birkhuser Verlag AG
Klosterberg 23,
P.O. Box 133, CH-4010
Basel, Switzerland


>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.

Claudia Farnik
- Promotion -


TEL. +41 61 205 07 39
FAX. +41 61 205 07 92
E-MAIL: farnik@...

Matthew Hennessy | 13 Jan 17:55 1997

Workshop announcement

	International Scientific Cooperation


        Formal Models of Programming and their Applications

        September 17 - 20, 1997


        !!!!  CALL FOR PARTICIPATION  !!!!

The aim of the Summer School and Workshop, organised by the EU KIT
project SymSem, is to bring together in an informal atmosphere
researchers, working in the general area of the Semantic Foundations
of Computation.  Participation by Chinese researchers and students is
particularly encouraged.  Roughly half of the meeting will be devoted
to expositary seminars given by invited speakers. The remainder will
consist of workshop presentations chosen on the basis of submitted


Gerard Boudol, INRIA-Sophia Antipolis, France
Zhou CaoChen, IIST, Macau
Pierre-Louis Curien, Ecole Normale Superieure, Paris, France
Matthew Hennessy, University of Sussex, UK
Gerard Huet, INRIA-Rocquencourt, France
Colin Stirling, University of Edinburgh


We solicit submissions on original research not published or submitted
for publication elsewhere in the form of Extended Abstracts, not to
exceed 2500 words (approximately 5 pages). The abstracts must be
written in English.  The topic of the meeting is to be interpreted in
a broad sense, to include semantic and algorithmic aspects of

	* Programming languages
        * Verification methods and systems
	* Program logics
	* Concurrency: theory and applications
	* Type theory and applications
	* Program specification
	* Formal languages and automata
	* Rewriting systems

It is intended to publish a volume of papers based on the abstracts
presented at the meeting.

Three copies of abstracts should be sent to

              Huimin Lin - KIT
              PO Box 8718
              Institute of Software
              Chinese Academy of Sciences
              Beijing  100080

or alternatively electronic submissions (in the form of a uuencoded
postscript file) may be sent to



Deadline for submission of abstracts:	30/3/97
Notification of Acceptance:		30/4/97
Workshop dates:				17-20/9/97

Information on the workshop will be maintained at the website


Organising Committee:

P.L.Curien (France), M. Hennessy (UK), H.Lin (China).

Local Organiser:

H.Lin (China)

Note: TACS is on in Japan on the following week 24 (Wed) -26th Sept.


Christoph & | 14 Jan 15:59 1997


[Sorry if you receive this call more than once]




	                  to be held as part of 
       15th International Joint Conference on Artificial Intelligence
		             Nagoya, Japan, 
		     23th, 24th, or 25 August 1997	

Temporal logics originating in philosophy and formal linguistics have
been intensively investigated within both AI and traditional Computer
Science. A variety of different approaches and formalisms have been
developed, some of them admitting and supporting automated reasoning
techniques and having strong similarities to those which have evolved
in the context of classical logic. Executable fragments of these
logics have been proposed in order to provide more appropriate logical
techniques for dealing with change in time. 

Basically, two different approaches to execution of the temporal logic
formalism have evolved. The first, which is compatible with the
classical logic programming paradigm, is aimed towards a logical basis
for temporal databases and knowledge based systems for reasoning about
time and, to be more general, a robust basis for the development of
advanced AI systems. Its execution is based on deduction in tractable
fragments of suitable temporal logics. The second approach is more
motivated by a classical computer science problem, namely to define
and develop a uniform framework for programming and verification of
computer programs, especially those relying on imperative and reactive
behavior. Execution within this second approach corresponds to model
construction of the formulae in question and is based on the so called
imperative future approach. A renewed interest on programming
paradigms based on non classical logics has also been stimulated
recently by new issues in the context of concurrent constraint logic
programming, (temporal) deductive databases, programming of reactive
systems, embedded AI systems and multi-agent systems.


The aim of this workshop is to provide a forum both for the exchange
of ideas and for the identification of the potential roles and nature
of the emerging paradigm of Executable Temporal and Non Classical
Logics. Our intention is to bring together researchers in this area,
to identify common ground, relevant experiences, applications, open
problems and possible future developments. In particular, we wish to
encourage cross-fertilization between different approaches and to
improve the understanding of (tractable) execution of temporal
logics. Special emphasis will be given to the study of computation
models in the context of Artificial Intelligence, and to new
approaches to programming in the context of programming of reactive
and embedded AI systems.


This workshop will build upon the 1993 Workshop on Executable Modal
and Temporal Logics that was organized as part of IJCAI-93, and the
1995 Workshop on Executable Temporal Logics  organized as part
of IJCAI-95. Topics of interest include, but are not limited to,

       * theoretical issues in executable temporal logics
       * relationship between execution and temporal theorem-proving
       * relationship of executable temporal logics to (temporal) databases   
       * design of executable temporal logics
       * operational models and implementation techniques
       * programming support and environments
       * comparative studies of languages
       * applications and case studies


To encourage informal interaction and the exchange of ideas,
attendance will be limited to approximately 30 invited participants.
Those wishing to attend are encouraged to submit either

 (a) an extended abstract (of no more than 5000 words) describing
     relevant preliminary or completed work to be presented at the 
     workshop by March 1st, 1997, or,

 (b) a statement of interest consisting of a single page description
     of research interests and current work, to be used to demonstrate
     the ability of the non-presenting participants to contribute to
     the discussions by April 25th 1997. 

Selected participants will be asked to provide complete papers to be
distributed as preprints to the workshop participants.


All submissions should include: author's name(s), affiliation,
(complete) mailing address, phone and fax number, and e-mail
address. Preferably, the submission should be sent in Postscript
format (uuencoded, gzipped/compressed) by email to either of the
programme chairs below. The deadline for receipt of submissions is
March 1st 1997.

        Christoph Brzoska                    Email: brzoska@...
        Department of Computer Science         Tel: (+49) 721 608 35 64
        University of Karlsruhe                Fax: (+49) 721 60 77 21
        P.O. Box 69 80
        D-76128 Karlsruhe, Germany

        Michael Fisher                       Email: M.Fisher@...
        Department of Computing                Tel: (+44) 161 247 1488
        Manchester Metropolitan University     Fax: (+44) 161 247 1483
        Chester Street
        Manchester  M1 5GD, United Kingdom

Alternatively, five (5) paper copies of all submitted materials may be
sent to either of the programme chairs.


Marianne Baudinet             (Free University of Brussels, Belgium)
Christoph Brzoska [co-chair]  (Karlsruhe University, Germany)
Thom Fruehwirth               (Ludwig Maximilians University, Germany) 
Michael Fisher    [co-chair]  (Manchester Metropolitan University, UK)   
Rajeev Gore		      (Australian National University, Australia)  
Vineet Gupta		      (Xerox Palo Alto Research Center, USA)
Shinji Kono                   (University of the Ryukyus, Japan)
Stephan Merz                  (Ludwig Maximilians University, Germany) 
Ben Moszkowski                (Newcastle University, UK)
Vijay Saraswat                (AT & T Research Labs, USA) 
Karl Sch\"afer		      (Karlsruhe University, Germany)
Mehmet Orgun                  (Macquarie University, Australia)

Papers will be refereed and notification of acceptance will be given
by March 21th 1997. Authors of accepted papers will then be given the
opportunity to revise their papers prior to the final submission (due
April 15th, 1997).


   Deadline for paper Submissions:                 March 1st, 1997
   Author notification by:                         March 21st, 1997
   Camera ready version of the paper due:          April 15th, 1997
   Deadline for statements of interest:            April 25th, 1997
   Workshop:                                       during August 23-25, 1997

Copies of accepted papers will be provided as a pre-proceedings by the IJCAI 
organizers at the workshop itself. 


The proceedings of the 1993 IJCAI workshop on Executable Modal and
Temporal Logics were published by Springer-Verlag as a volume in the
Lecture Notes in Artificial Intelligence series, while revised
contributions from the 1995 IJCAI workshop on Executable Temporal
Logics are appearing in a special issue of the Journal of Symbolic
Computation. Our intention is again to publish polished versions of
the papers from the workshop proceedings. Selected contributions
of the 1997 workshop may be considered for publication by
Springer-Verlag as a special volume in the LNAI series. 


All workshop participants will be required to be registered to the
main IJCAI'97 conference. An additional fee of $US  50 will be charged
to cover costs of the workshop. 


Information about IJCAI'97 can be accessed via the IJCAI home page:


Information about the workshop will be available via



Christoph Brzoska				
Institute for logic, complexity, and deductive systems
University of Karlsruhe				Phone: + 49 721 608 35 64
P.O.Box 69 80		                  	Fax:   + 49 721 60 77 21
D - 76128 Karlsruhe, Germany			E-mail: brzoska@...
URL: iseran.ira.uka.de/~brzoska
Please address administrative mail regarding the lambda Prolog mailing list to
lprolog-request@...  See http://www.cis.upenn.edu/~dale/lProlog.

GM Bierman | 20 Jan 18:17 1997

Paper Available

Attachment: application/octet-stream, 1688 bytes
Didier Galmiche | 20 Jan 19:42 1997

Special issue on Proof Theory of concurrent object-oriented programming

Attachment: application/octet-stream, 3732 bytes
Christophe DONY | 24 Jan 14:25 1997

CFP - LMO97: Languages and Models with Objects


                           CALL FOR PAPERS



                  BREST,  OCTOBER 22, 23 and 24, 1997


LMO'97 will  take place   in Brittany,  close  to Brest.  Previous LMO
conferences were held in Grenoble, Nancy and Leysin. As usual, the LMO
conference will mainly focus on the concept of object in the fields of
software development, knowledge representation and data bases. It will
also aim to  analyse and compare the  different approaches and  future


1- Object-oriented Representation:

     Object-oriented KR models (description logics, conceptual graphs, 
     composite objects, frames, etc.); data models; semantics and
     inference mechanisms of these models (classification, inheritance,
     filtering, etc.); reification.

2- Object-oriented Programming:

    Objects and types (inheritance, sub-typing, etc.); objects and
    behaviours; object specifications; parallelism and objects;
    actors; reflexivity; etc.

3- Objets and Persistence:

    Object-oriented data base management systems; data mining;
    indexing by classification; etc.

4- Objects-Oriented Engineering:

    Object life cycle; object evolution and versioning; software security;
    analysis and design methods; formal and semi-formal
    specifications; frameworks, etc.

5- Orthogonal topics:

     Constraints and objects; rules and objects; case-based
    reasoning and objects, etc.

6- Applications:

    Objects and algorithms; objects for chemistry, music, life sciences, CAD,
    intelligent tutoring systems, telecommunications, etc.

Submissions that  establish relationships  and constructive comparison
betweeen the different object approaches are strongly encouraged.


French and  English-written   papers  are accepted.   However,  french
speakers are  strongly  invited to  submit  and speak  in french;  and
discussions and panels will be mainly in french.


* 4 April 1997 : Receipt of hard-copy and electronic submissions

* 15 June 1997 : Notification of authors about acceptance or rejection of

* 1 September 1997 : Receipt of camera-ready papers

* 22, 23 and 24 October 1997 : conference


Three types  of contributions can  be  submitted: papers, posters  and
problem presentations. They should written in french or in english for
non french speakers.

Papers, should be limited  to 5000 words (or  12 pages, A4  format, 50
lines,  12-point  times    font,    including  tables,  figures    and
references). The first  page must include  the title of the paper, the
authors' postal  and e-mail addresses, fax and  phone numbers, a short
abstract   of about 10 lines,  and  a list of  up  to 3 keywords. Each
submissions  will  be  assessed by  three  reviewers,  members of  the
program committee.

Poster should be limited to one page including the title, the authors'
postal and e-mail addresses and fax and phone numbers, and an abstract
-limited to half a page. Selection will mainly be one  on the basis of
topics  and/or application  aspects. Posters  will be  published in an
appendix of the proceedings.

Problems are dedicated to  the presentation of  well-defined technical
problems in our domain and to the emergence of fruitful discussions on
how they could be solved. To propose some solutions is not required to
submit a problem  presentation. A problem  submission is similar  to a
poster submission (one page).

Submissions must be  received before  April  4th 1997.   Authors  must
submit both a hard and an "electronic" copy.

   * Hard copies: send 4 copies at the following address:

	R. Ducournau
	LIRMM, Universite de Montpellier 2
	161 rue ADA					
   * Electronic copies:

         * by Ftp (for papers) : save a printable Postcript file at
           the following address: 
         * send by email the first page the first page of the paper,
           in text format - ascii isolatin1 - including the name of
           the postcript2 file, to: LMO97@...

           For posters and problem presentations, the first page by email 
           is sufficient for electronical submission.


   * by  email : LMO97@...

   * Detailed information regarding LMO97 can be found on the World
     Wide Web: http://www-lmo97.enst-bretagne.fr

It is envisaged that, this year,  the proceedings will be published by
a french publisher. We plan to  biennially collect the english version
of the best papers and to publish it by an international publisher.


Organizing Committee: 

         Chairman: S. Garlatti, Telecom Bretagne

         Secretariat: G. Le Gall, Telecom Bretagne

         Communication: C. Dony, LIRMM-Universite Montpellier II

         Organization: P. Kuntz, Telecom Bretagne

         Tel : (33) 02 98 00 14 25
         Fax: (33) 02 98 00 10 30 
         Email: lmo97@...
         WWW : http://www-lmo97.enst-bretagne.fr/

Program Committee:


        R. Ducournau    LIRMM                      Montpellier


        H. Ait-Kaci	Simon Fraser University    Burnaby, Canada
        P. Albert  	ILOG	                   Paris
        A. Borgida	Rutgers University	   Piscataway, USA
        J.P. Briot 	Laforia                    Paris
        B. Carre	LIFL	                   Lille
        Y. Caseau	Bouygues-ENS               Paris
        G. Castagna	LIENS-ENS                  Paris         
        M. Dao          CNET                       Paris
        Y. Dennebouy	EPFL                       Lausanne, Suisse
        J. Euzenat	INRIA Rhone-Alpes          Grenoble
        S. Garlatti	Telecom Bretagne           Brest
        R. Godin	UQaM	                   Montreal, Canada
        R. Guerraoui	EPFL	                   Lausanne, Suisse
        M. Huchard	LIRMM	                   Montpellier
        J. Malenfant	EMN	                   Nantes
        A. Napoli	CRIN	                   Nancy
        O. Nierstrasz 	Universite de Berne	   Berne, Suisse
        R. Rousseau	I3S	                   Nice
        J.C. Royer	ERIN	                   Nantes


LMO collaborates with ECOOP   (European Conference on  Object-Oriented
Programming): http://www.ecoop97.jyu.fi/

Hans-Ulrich Krieger | 27 Jan 12:58 1997

MOL5---Deadline Extension: Feb. 28, 1997

MOL 5 Call for Papers - PLEASE NOTE EXTENDED DEADLINE (sorry for multiple 

--Uli Krieger

NOTE NEW MOL WEBPAGE: http://www.cis.upenn.edu/~ircs/mol/mol.html

                    Call for Papers

Sponsored by the Association for the Mathematics of Language (a special
interest group of the Association for Computational Linguistics)

DATES: 25-27 August 1997

LOCATION:  Schloss Dagstuhl, Saarbruecken, Germany

SUBMISSION DEADLINE: February 28, 1997


SUBMISSION REQUIREMENTS:  Submissions are invited from all areas of
study that deal with the mathematical properties of natural language.
These areas include, but are not limited to, mathematical models of
syntax, semantics and phonology; computational complexity of
linguistic frameworks/theories and models of natural language
processing; mathematical theories of language learning; parsing theory;
and quantitative models of language.

If the co-chairs feel the area of a submitted paper cannot be adequately
reviewed by the program committee, an attempt will be made to get
outside reviews.

SUBMISSION FORMATS: All contributions to MOL5 are to be made electronically
as either an unformatted (plain text) ASCII file or LaTex file.
Authors are responsible for their submissions printing without special
actions by the program committee. Submissions should consist of an abstract
of original, previously unpublished work. Abstract length should be no
more than five (5) pages.

PROCEEDINGS: No unrefereed proceedings are planned. It is anticipated
that selected papers will be published after peer review as a special
issue or collection.

Tilman Becker (DFKI), Patrick Blackburn (Saarlandes),
Christophere Fouquere (Paris), David Johnson, co-chair (IBM),
Aravind Joshi, co-chair (Penn), Larry Moss (Indiana),
Walt Savitch (UCSD), Andras Kornai (IBM), Uli Krieger (DFKI),
Mark-Jan Nederhof (Groningen), Giorgio Satta (Padua)

LOCAL ARRANGEMENTS: Tilman Becker (DFKI), Hans-Ulrich Krieger (DFKI)
Send queries about local arrangements to:  krieger@...

SCHLOSS DAGSTUHL INFORMATION: http://www.dag.uni-sb.de
They have reserved 30--40 single rooms (with shower) from Aug. 25
to 27.  Price per room incl. full catering: 135 German Marks