headers
Ulf Nilsson | 3 Jan 1997 10:21
Picon
Picon
Picon
Favicon

ILPS97: Call for Workshop PROPOSALS

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

 --ulf

 ILPS'97 CALL FOR WORKSHOP PROPOSALS

 INTERNATIONAL LOGIC PROGRAMMING SYMPOSIUM
 http://www.ida.liu.se/~ilps97/

 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
 ILPS'97.

 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)

Permalink | Reply | 0 comments |
headers
Geoff Sutcliffe | 12 Jan 1997 22:44
Picon
Picon

CADE-14 - Call for Workshops and Tutorials

----------------------------------------------------------------------------

                                   CADE-14

          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)

Permalink | Reply | 0 comments |
headers
M. Bognar | 13 Jan 1997 18:52
Picon
Picon

dep. record types?

[This will be the first of several types postings during the next few
minutes -- I've just returned to the electronic world after a break
for POPL.  --BCP]

Hello!

I stumbled across the definition of DEPENDENT
RECORD TYPES due to G. Betarte and A. Tasistro
(in "Extension of Martin-Lof's theory of types
with record types and subtyping:
motivation, rules and type checking"),
and I would like to know more about the notion 
of record types is general. I have two questions:

- Is the definition of Betarte&Tasistro
for dependent record types *THE* definition,
or is the name (dependent) record type being
used for many more (different) notions?

-Does anybody know any relevant references
on this matter (record types, dependent record 
types, sigma types etc)?

Thanking in advance,
Mirna Bognar
Permalink | Reply | 0 comments |
headers
Claudia Farnik | 13 Jan 1997 15:29
Picon

BOOK ANNOUNCEMENT

[ 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   ]

BOOK ANNOUNCEMENT

Progress in Theoretical Computer Science series.

------------------------------------------------------
------------------------------------------------------

OBJECT-ORIENTED PROGRAMMING: A UNIFIED FOUNDATION

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:

http://www.dmi.ens.fr/~castagna/book.html

Information can be obtained from the publisher, as well:
(Continue reading)

Permalink | Reply | 0 comments |
headers
Matthew Hennessy | 13 Jan 1997 17:55
Picon
Picon

Workshop announcement


   	 EU KIT / INSTITUTE OF SOFTWARE, CAS
	International Scientific Cooperation
       ------------------------------------------------

                SUMMER SCHOOL AND WORKSHOP
                --------------------------

        Formal Models of Programming and their Applications

        September 17 - 20, 1997

        Beijing
        China

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

LIST OF INVITED SPEAKERS:

Gerard Boudol, INRIA-Sophia Antipolis, France
Zhou CaoChen, IIST, Macau
(Continue reading)

Permalink | Reply | 0 comments |
headers
Christoph & | 14 Jan 1997 15:59
Picon
Favicon

csp-list@...

[Sorry if you receive this call more than once]

------------------------------------------------------------------------------

		   CALL FOR PAPERS AND PARTICIPATION 

        Workshop on PROGRAMMING IN TEMPORAL AND NON CLASSICAL LOGICS	

	                  to be held as part of 
       15th International Joint Conference on Artificial Intelligence
                               (IJCAI-97) 
	         
		             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
(Continue reading)

Permalink | Reply | 0 comments |
headers
GM Bierman | 20 Jan 1997 18:17
Picon
Picon
Favicon

Paper Available


I should like to announce the availability of the following paper from
my home page

		  http://www.cl.cam.ac.uk/users/gmb

		     Observations on a Linear PCF
			 (Preliminary Report)

				  by
			     G.M. Bierman

Abstract: 
This paper considers some theoretical and practical issues concerning
the use of linear logic as a logical foundation of functional
programming languages such as Haskell and SML. First I give an
operational theory for a linear PCF: the (typed) linear
$\lambda$-calculus extended with booleans, conditional and
non-termination. An operational semantics is given which corresponds
in a precise way to the process of $\beta$-reduction which originates
from proof theory.  Using this operational semantics I define notions
of observational equivalence (sometimes called contextual
equivalence). Surprisingly, the linearity of the language forces a
reworking of the traditional notion of a context (the details are
given in an appendix). A co-inductively defined notion, applicative
bisimularity, is  developed and compared with observational
equivalence using a variant of Howe's method. Interestingly the
equivalence of these two notions is greatly complicated by the
linearity of the language. These equivalences are used to study a
call-by-name translation of PCF into linear PCF. It is shown that this
(Continue reading)

Permalink | Reply | 0 comments |
headers
Didier Galmiche | 20 Jan 1997 19:42
Picon
Favicon

Special issue on Proof Theory of concurrent object-oriented programming


Special Issue of Mathematical Structures of Computer Science
(Editor-in-Chief: G. Longo)
on 
        Proof Theory of Concurrent Object-Oriented Programming 

Guest Editors:   

  Jean-Paul Bahsoun     Jose Luiz Fiadeiro     Didier Galmiche
  IRIT-CNRS             Faculty of Sciences    CRIN-CNRS & UHP Nancy 1
  Toulouse, France      Lisboa, Portugal       Nancy, France

There exist various approaches to model concurrent programming
based-on logic. In this way, the use of logic for system development
concerns the specification step but also the study of the operational
aspects (through proof analysis and construction) of such development.
In this context, we have to consider different logical systems for
different uses of logic. 

Moreover, we can also consider concurrency from both points of
view: we want to reason and to specify systems where some concurrency
aspects are involved and also to have some operational interpretation
of concurrency into logic (focusing on the concept of proof).
It seems clear that we have to identify and to study, on the one hand,
the role and the treatment of objects (representation, inheritance,
modularity, communication, etc...) in this context, and on the other
hand, the interaction of work on proofs and concurrency with the
Object-Oriented Programming paradigm.  

An ECOOP'96 workshop on "Proof Theory of Concurrent Object-Oriented
(Continue reading)

Permalink | Reply | 0 comments |
headers
Christophe DONY | 24 Jan 1997 14:25
Picon
Favicon

CFP - LMO97: Languages and Models with Objects


			    =============

                           CALL FOR PAPERS

                               LMO'97 

                     LANGUAGES AND MODELS WITH OBJECTS

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

TOPICS
------

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.
(Continue reading)

Permalink | Reply | 0 comments |
headers
Hans-Ulrich Krieger | 27 Jan 1997 12:58
Picon

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


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

--Uli Krieger

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

        FIFTH MEETING ON THE MATHEMATICS OF LANGUAGE (MOL5)
                    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 ADDRESS:  djohns@...

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.
(Continue reading)

Permalink | Reply | 0 comments |

Gmane