Copy Link
Add to Bookmark
Report

AIList Digest Volume 5 Issue 103

eZine's profile picture
Published in 
AIList Digest
 · 1 year ago

AIList Digest            Tuesday, 21 Apr 1987     Volume 5 : Issue 103 

Today's Topics:
Conferences - A typo and an addition to the MAICSS schedule &
Theoretical Aspects of Reasoning about Knowledge &
Third Institute, UT Year of Programming &
Second Workshop on Large Grained Parallelism

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

Date: Fri, 17 Apr 87 13:05:26 cdt
From: Kris Hammond <kris@ANUBIS.UCHICAGO.EDU>
Subject: Conference - A typo and an addition to the MAICSS schedule


A slight change of venue for the MAICSS conference and an additional
speaker -

The First Annual Meeting
of
The Midwest Artificial Intelligence and Cognitive
Science Society

The University of Chicago

April 24th and 25th

----> Ryerson 251
----> 1100 58th Street
----> Chicago, Illinois

Also, Professor Larry Travis will be giving an overview talk on the AI
work at the University of Wisonsin.

And, if you haven't called us yet, do so now. (312) 702-8070.

Kris Hammond
CS Department
University of Chicago

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

Date: 17 April 87 14:41-PDT
From: VARDI%ALMVMA.BITNET@wiscvm.wisc.edu
Subject: Conference - Theoretical Aspects of Reasoning about Knowledge


Call for Papers

The Second Conference on
THEORETICAL ASPECTS OF REASONING ABOUT KNOWLEDGE

March 6-9, 1988, Monterey, California

The 2nd Conference on Theoretical Aspects of Reasoning about
Knowledge, sponsored by the International Business Machines
Corporation and the American Association for Artificial
Intelligence, will be held March 6-9, 1988, at the Asilomar
Conference Center in Monterey, California. While traditionally
research in this area was mainly done by philosophers and
linguists, reasoning about knowledge has been shown recently to
be of great relevance to computer science and economics. The aim
of the conference is to bring together researchers from these
various disciplines with the intent of furthering our theoretical
understanding of reasoning about knowledge.

Some suggested, although not exclusive, topics of interest are:

Semantic models for knowledge and belief
Resource-bounded reasoning
Minimal knowledge proof systems
Analyzing distributed systems via knowledge
Knowledge acquisition and learning
Knowledge and commonsense reasoning
Knowledge, planning, and action
Knowledge in economic models

You are invited to submit ten copies of a detailed abstract (not
a complete paper) to the program chair:

Moshe Y. Vardi
IBM Research
Almaden Research Center K53-802
650 Harry Rd.
San Jose, CA 95120-6099, USA

Telephone: (408) 927-1784
Electronic address: vardi@ibm.com, vardi@almvma.bitnet

Submissions will be evaluated on the basis of significance,
originality, and overall quality. Each abstract should 1)
contain enough information to enable the program committee to
identify the main contribution of the work; 2) explain the
importance of the work - its novelty and its practical or
theoretical implications; and 3) include comparisons with and
references to relevant literature. Abstracts should be no longer
than ten double-spaced pages.

Program Committee:

J. Barwise (Stanford University)
P. van Emde Boas (University of Amsterdam)
H. Kamp (University of Texas at Austin)
K. Konolige (SRI International)
Y. Moses (Weizmann Institute of Science)
S. Rosenschein (SRI International)
T. Tan (University of Chicago)
M. Vardi (IBM Almaden Research Center)

The deadline for submission of abstracts is August 31, 1987.
Authors will be notified of acceptance by November 1, 1987
(authors who supply an electronic address might be notified
earlier). The accepted papers will be due by December 15, 1987.
Proceedings will be distributed at the conference, and will be
subsequently available for purchase through the publisher.

We hope to allow enough time between the talks for private
discussions and small group meetings. In order to ensure that
the conference remains relatively small, attendance will be
limited to invited participants and authors of accepted papers.
Support for the conference has been received from IBM and AAAI
for partial subsidy of participants' expenses; applications for
further support are pending.

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

Date: Wed 1 Apr 87 16:38:24-CST
From: Hamilton Richards <CS.HAM@R20.UTEXAS.EDU>
Subject: Conference - Third Institute, UT Year of Programming

Preliminary Announcement
The 1987 UT Year of Programming
with the support of the
U. S. Office of Naval Research
announces
The Institute on Logical Foundations of Functional Programming
Scientific Director: Dr. Gerard Huet, INRIA
Austin, Texas
8-12 June 1987

There is a growing realization that mathematical logic provides a foundation on
which programming languages and environments for software engineering can be
soundly based. Such a foundation should include a highly expressive notation
for formalisation of requirements, an efficiently implementable language for
coding programs, and a means of systematically deriving each program from its
specification, together with such proofs of correctness as are needed.

This Institute concentrates on a particularly simple paradigm. The type
verification rules of a programming language such as PASCAL or ADA may be
seen as a logical inference system. The rules of inference can be extended in
a uniform manner to check the validity of a program with respect to more
general formalized comments, assertions, and specifications. A powerful
constructive logic may thus be considered as the backbone of a pure, strongly
typed, functional programming language. We may thus envision programming
environments for such languages in which programs are designed consistently
with formal specifications. In such a system, a well-typed program serves as
its own proof of correctness, which may be checked by type-checking throughout
the period of program development. There is hope that in the future some of
the more routine parts of programs can be generated with machine assistance.

This approach to software engineering is currently the subject of much
speculation and research, involving both theory and practical implementation.
One of the leading research projects is Project Formel, which is jointly
sponsored by INRIA (Rocquencourt, France) and Ecole Normale Superieure (Paris)
and led by Dr. Gerard Huet of INRIA and Prof. Guy Cousineau of ENS. The Year
of Programming has invited Dr. Huet and his senior colleagues to present
their work in the Institute on the Foundations of Functional Programming.

The first three days of the Institute will be a tutorial on type theory,
functional programming, and their relationship to one another. It will prepare
students with some background in theoretical computer science for the more
advanced Research Seminar on Thursday and Friday, at which presentations will
be made of research in progress in several countries around the world.

The tutorial on functional programming and type theory will present a unified
view of computational structures described by categorical combinators. These
combinators may be seen as proof combinators from a sequent formulation of
intuitionistic logic, or alternatively as the building blocks of an
environment-manipulating machine well suited for executing lambda-calculus and
other functional programming languages. This introduces the Categorical
Abstract Machine (CAM) (a simplification of Landin's SECD machine) for
executing call-by-value lambda-calculus. The language CAML (Categorical
Abstract Machine Language) is closely derived from languages such as ML and
Hope. The compilation of CAML on the CAM will be discussed and compared with
related projects (ML on the FAM and the G-machine, Amber on the Amber machine).

Polymorphic types and the problems of type synthesis will be discussed at two
levels: ML's parametric polymorphism, and full polymorphism in Girard's
second-order lambda-calculus. A very general logical framework, the Calculus
of Constructions, will be described. It will be shown how this formalism
combines the expressive power of Girard's higher-order polymorphic
lambda-calculus, Martin-Lof's theory of types, and de Bruijn's AUTOMATH. The
tutorial will be taught by Prof. Cousineau and Dr. Huet, the scientific leaders
of Project Formel where CAM, CAML, and the Calculus of Constructions have
been designed and implemented. An implementation of CAML on SUN workstations
will be available for demonstrations and practical exercise sessions.

The Research Seminar will present research topics in Linear Logic and
Constructive Semantics. Linear Logic, a new formalism designed to serve as a
logical foundation for parallel programming, will be presented by its inventor,
Prof. Jean-Yves Girard, Groupe de Logique Mathematique, Universite Paris 7.
Under the general title of Constructive Semantics, recent research in Type
Theory under way at various centres in the USA and in Japan will be presented
by four research leaders in the field: Prof. Albert Meyer (MIT), Dr. John
Mitchell (AT&T Bell Laboratories), Dr. Susumu Hayashi (RIMS, Kyoto University),
and Prof. Andre Scedrov (U. of Pennsylvania). The Seminar program will be
augmented by short communications of research work in progress by the seminar
participants.

It is recommended that potential participants in the seminar register early.
In order to facilitate interaction, the number of participants will be limited.



Tentative schedule.

1. Tutorial on Functional Programming and Type Theory (June 8-10)

Monday.
8-10 Elements of category theory (GH)
10-12 Introduction to the ML language (GC)
2-4 A tutorial on lambda-calculus (GH)
4-5 Programming session: CAML

Tuesday.
8-10 Polymorphic type-checking (GC)
10-12 Natural deduction, the Propositions as Types principle (GH)
2-4 The Categorical Abstract Machine (GC)
4-5 Programming session: CAM

Wednesday.
8-10 The polymorphic lambda-calculus (GH)
10-12 Compiling functional languages; CAML Implementation (GC)
2-4 Type theory, the Calculus of Constructions (GH)
4-5 Programming session: Constructions


2. Research Seminar on Linear Logic and Constructive Semantics (June 11-12)

Thursday.
8-12 Qualitative domains, Coherent spaces. (J.Y. Girard)
2-330 Guest Lecture 1 (A. Meyer)
330-5 Guest Lecture 2 (J. Mitchell)

Friday.
8-12 Linear Logic. (J.Y. Girard)
2-330 Guest Lecture 3 (S. Hayashi)
330-5 Guest Lecture 4 (A. Scedrov)

Prerequisites: same as for graduate-level course in theoretical computer
science; programming experience is recommended.


Recommended readings:

G. Cousineau, P.L. Curien and B. Robinet, eds., Combinators and Functional
Programming Languages. Springer-Verlag, Lecture Notes in Computer Science 242,
1986.

L. Cardelli and P. Wegner. "On Understanding Types, Data abstraction, and
Polymorphism". ACM Computing Surveys 17, 4 (Dec. 1985): 471-522.

J. R. Hindley and J. P. Seldin. Introduction to combinatory logic and lambda
calculus. Cambridge University Press, 1986.

H. Abelson and G. J. Sussman. Structure and Interpretation of Computer
Programs. MIT Press 1985.

J. Lambek and P. J. Scott. Introduction to higher order categorical logic.
Cambridge University Press, 1986.


The U. T. Year of Programming

The Institute on Logical Foundations of Functional Programming is the third in
a series of Programming Institutes comprising the 1987 U. T. Year of
Programming, which is underwritten principally by the U.S. Office of Naval
Research, with supplementary funding from the University of Texas, Lockheed
Missiles and Space Company, and other sponsors. The other Institutes in the
series are:

Concurrent Programming (23 February - 6 March)
C.A.R. Hoare (Texas and Oxford)

Encapsulation, Modularization, and Reusability (1-10 April)
D. Gries (Cornell)

Formal Specification and Verification of Hardware (29 June - 3 July)
M.J.C. Gordon (Cambridge)

Declarative Programming (24-29 August ) D.A. Turner (Kent)

Specification and Design (14-25 September) J.R. Abrial (Paris)

Formal Development of Programs and Proofs (autumn) E.W. Dijkstra (Texas)


FOR FURTHER INFORMATION

To receive announcements and application forms for individual Programming
Institutes (this one or any of the others), please contact the Year of
Programming Office at one of the following addresses:

U. T. Year of Programming INTERNET: cs.ham@R20.UTEXAS.EDU
Department of Computer Sciences INTERNET: ham@SALLY.UTEXAS.EDU
Taylor Hall 2.124
The University of Texas at Austin telephone: 512-471-9526
Austin, Texas 78712-1188

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

Date: Friday, 17 April 1987 10:18:22 EST
From: Mario.Barbacci@sei.cmu.edu
Subject: Conference - Second Workshop on Large Grained Parallelism


PRELIMINARY CALL FOR ABSTRACTS
SECOND WORKSHOP ON LARGE GRAINED PARALLELISM
OCTOBER 11-14, 1987
HIDDEN VALLEY, PENNSYLVANIA

Organized by the Software Engineering Institute and the Department of
Computer Science, Carnegie Mellon University, with the cooperation of
the Computer Society of the IEEE (pending approval).

The Second Workshop on Large Grained Parallelism is being organized to
bring together researchers in the areas of programming languages,
methodologies, and formalisms for loosely-coupled computer
networks, and developers of applications who would benefit from such
work. Issues of interest within these areas include, but are not limited
to, performance, fault tolerance, real-time execution, and heterogeneity of
the environment.

Attendance is by invitation only. Researchers interested in participating
must submit five (5) copies of a short (1 or 2 pages long) abstract
describing their activities in the areas of interest outlined above.

The workshop technical sessions will consist of a combination of
formal presentations, panel sessions, and working group meetings. Only a
subset of the participants will address the audience in the formal
sessions. All of the abstracts will be published as conference
proceedings and will be available to the participants upon arrival. The
participants will have the option of submitting a revised version
of their abstracts a few weeks prior to the meeting.

Submit abstracts to: Relevant dates:

Professor Jeannette M. Wing Deadline for Abstracts: July 15, 1987
Department of Computer Science Invitation to Authors: August 14, 1987
Carnegie Mellon University Deadline for Registration and
Pittsburgh, PA 15213-3890 Revised Abstracts: September 11, 1987
Telephone: (412) 268-3068
ArpaNet: WING@K.CS.CMU.EDU

Workshop Committee: Mario Barbacci (Carnegie Mellon University),
Maurice Herlihy (Carnegie Mellon University), Paul Leach (Apollo
Computer), Jack Stankovic (University of Massachusetts), and Jeannette Wing
(Carnegie Mellon University)

Location: The Hidden Valley Resort Community and Conference Center is
located in the scenic Allegheny mountains, 60 miles east of Pittsburgh, and
is easily reachable via the Pennsylvania Turnpike.

The Software Engineering Institute is a Federally Funded Research and
Development Center, sponsored by the Department of Defense.

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

End of AIList Digest
********************

← previous
next →
loading
sending ...
New to Neperos ? Sign Up for free
download Neperos App from Google Play
install Neperos as PWA

Let's discover also

Recent Articles

Recent Comments

Neperos cookies
This website uses cookies to store your preferences and improve the service. Cookies authorization will allow me and / or my partners to process personal data such as browsing behaviour.

By pressing OK you agree to the Terms of Service and acknowledge the Privacy Policy

By pressing REJECT you will be able to continue to use Neperos (like read articles or write comments) but some important cookies will not be set. This may affect certain features and functions of the platform.
OK
REJECT