1 Jun 1999 14:19

### CONCUR'99 Call for participation

                          CALL FOR PARTICIPATION
and
FINAL PROGRAM

CONCUR'99
10th International Conference on Concurrency Theory
Eindhoven, The Netherlands, August 24--27, 1999.

URL http://www.win.tue.nl/concur99/
E-mail concur99@...

(apologies for multiple copies)

REGISTRATION
It is now time to register for CONCUR'99. See the above mentioned WWW
pages for the registration procedure.
Early registration ends on July 1, 1999.

CONCUR
The purpose of the CONCUR conferences is to bring together researchers,
developers and students in order to advance the theory of concurrency,
and promote its applications.

PROGRAM

Monday August 23
================

CONCUR'99 Satellites:
Probmiv'99


6 Jun 1999 12:32

### Call-For-Participation: PLI 99 = ICFP + PPDP + HOOTS + IDL + ...


CALL FOR PARTICIPATION

PLI 99

Principles, Logics, and Implementations
of high-level programming languages

Paris, France,
September 27 - October 1, 1999

http://pauillac.inria.fr/pli/

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

The colloquium on Principles, Logics, and Implementations of high-level
programming languages is a collection of conferences and workshops aimed at
the advancement of high-level programming languages. The first edition of
PLI will be held in September 1999 in Paris and will bring together two
popular conferences ICFP and PPDP (previously known as PLILP/ALP) focused on
functional and declarative programming languages, and a collection of
related satellite events.

PLI 99 comprises the following conferences and workshops:

ICFP    International Conference on Functional Programming
PPDP    Principles and Practice of Declarative Programming

Two-day workshops:



7 Jun 1999 12:50

### PhD Studentship


EPSRC PhD Studentship

Department of Computer Science
University of Durham, U.K.

Applications are invited from students with good undergraduate or MSc
degrees in computer science or mathematics to study for a PhD degree. A
U.K. EPSRC research studentship is available for a suitably qualified
candidate for the October 1999 entry (or later). It covers tuition fees
and maintenance for three years.

The successful candidate is expected to work in the Computer-Assisted
Reasoning Group (URL: http://www.dur.ac.uk/CARG), and in particular with
Dr. Z. Luo and Dr. R. Pollack on the EPSRC-funded project An open proof
checker based on type theory' (http://www.dur.ac.uk/~dcs0zl/open.html).
The student's work will involve both the theory and pragmatics of
type-theoretic proof checking.

Further enquiries and applications can be sent to

Dr. Zhaohui Luo,
Dept. of Computer Science,
University of Durham,
Durham DH1 3LE,
U.K.

Email:  Zhaohui.Luo@...
Phone:  +44 (0)191 374 3657


18 Jun 1999 12:07

### IFIP TC1 TCS Conference Y2000 in Japan


"International Conference on Theoretical Computer Science"

--- Exploring New Frontiers of Theoretical Informatics ---

organized by

IFIP Technical Committee TC1 on Foundations of Computer Science

in cooperation with

Information Processing Society of Japan
Japan Society of Software Science and Technology (*)
Institute of Electronics, Information and Communication Engineers of Japan (*)
European Association of Theoretical Computer Science
Association for Symbolic Logic (*)
Association for Computing Machinery-SIGACT

(*) indicates "to be verified".

Date:     August 17 - 19, 2000

Place:    Aoba Memorial Building, Faculty of Engineering, Tohoku University,
Sendai, Japan

Web page: http://tcs2000.ito.ecei.tohoku.ac.jp/tcs2000.html

Email:    For any inquiry on TCS2000,
<<to be formed as follows>>
TCS2000@...


21 Jun 1999 21:39

### Type Fixpoints: Iteration vs. Recursion

I have the pleasure to announce the availability of the following paper:

Type Fixpoints: Iteration vs. Recursion
---------------------------------------

(To appear in Proc. 4th ICFP, Paris, France, September 1999.)

Authors: Zdzislaw Splawski, Faculty of Informatics and Management,
Wroc\l aw University of Technology, Poland
zs@...

Pawel Urzyczyn, Institute of Informatics, Warsaw University, Poland
urzy@...

The paper can be downloaded from  http://zls.mimuw.edu.pl/~urzy/ftp.html

Abstract
--------
Positive recursive (fixpoint) types can be added to the polymorphic
(Church-style) lambda calculus \lambda 2 (System {\bf F}) in several different
ways, depending on the choice of the elimination operator. We compare several
such definitions and we show that they fall into two equivalence classes with
respect to mutual interpretability. Elimination operators for fixpoint types
are thus classified as either iterators'' or recursors''. This
classification has an interpretation in terms of the Curry-Howard
correspondence: types of iterators and recursors can be seen as images
of induction axioms under different dependency-erasing maps.
Systems with recursors are equivalent to a calculus of recursive types
with the operators Fold :
sigma[mu alpha.sigma/alpha] -> mu alpha.sigma  and


21 Jun 1999 22:19

### "OctoberFest" category theory meeting in Montreal


Centre de Recherche en Theorie des Categories
-- Montreal --
Category Theory Research Center

-----------------------------------------------------------------------------
Category Theory OctoberFest

McGill University, Montreal
Saturday - Sunday, October 16 - 17, 1999

-----------------------------------------------------------------------------
We invite you to join us in Montreal next October for a weekend meeting
in Category Theory, the "not-quite-annual" OctoberFest. As has been the
tradition with these meetings, we invite talks from all participants. If
you wish to give a talk, send your request along with a short abstract
(before the end of September please) to Robert Seely at the address
below. Early in October the program committee will announce a
preliminary schedule on the Categories email list, and on the CTRC/CRTC
web site. The final schedule will be announced at the meeting.

We will meet in the Bronfman Building, 1001 Sherbrooke West, on Saturday
morning, October 16th. Coffee will be available from 8:30 am. The first
talk will be at 9:00. Registration will take place during the morning,
before the first talk and during the first coffee break.

There will be a registration fee of about $CAN45 (approximately$US30),
with luck, less: all possible attempts will be made to keep this as low
as we can. The precise amount will be announced in early October,
along with the proposed schedule.  There will be a dinner/party to be


21 Jun 1999 23:39

### New paper: How Good is Local Type Inference?

We are pleased to announce a report on our experiences with an
implementation of a local type inference algorithm.  It is available
through:

http://www.yl.is.s.u-tokyo.ac.jp/~haruo/papers/hgilti.ps.gz
or   http://www.cis.upenn.edu/~bcpierce/papers/hgilti.ps.gz

Regards,

Haruo Hosoya
Benjamin Pierce

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

HOW GOOD IS LOCAL TYPE INFERENCE?

Haruo Hosoya and Benjamin Pierce

Abstract:

A partial type inference technique should come with a simple and
precise specification, so that users predict its behavior and
understand the error messages it produces.  Local type inference
techniques attain this simplicity by inferring missing type
information only from the types of adjacent syntax nodes, without
using global mechanisms such as unification variables.

The paper reports on our experience with programming in a
full-featured programming language including higher-order
polymorphism, subtyping, parametric datatypes, and local type


22 Jun 1999 05:04

### Static Interpretation of Modules

I am happy to announce the availability of a paper to appear in the
Fourth International Conference on Functional Programming (ICFP'99),
Paris, France, September 1999:

Title:       Static Interpretation of Modules

Author:      Martin Elsman, Computer Science Division, University of
California, Berkeley. (Work done while at University of
Copenhagen.)

WWW:         http://www.cs.berkeley.edu/~mael/papers.html

Abstract:    This paper presents a technique for compiling Standard ML
Modules into typed intermediate language fragments, which
may be compiled separately and linked using traditional
linking technology to form executable code. The technique
is called _static_interpretation_ and allows compile-time
implementation details to propagate across module
boundaries. Static interpretation eliminates all
module-level code at compile time.

The technique scales to full Standard ML and is used in
the ML Kit with Regions compiler. A framework for smart
recompilation makes the technique useful for compiling
large programs.

Best Regards,

--

--
-- Martin                    / <at> .-\


23 Jun 1999 14:42

### CTCS '99 CALL FOR PARTICIPATION DEADLINE 19th July

           CATEGORY THEORY AND COMPUTER SCIENCE (CTCS'99)
10-12 SEPTEMBER 1999, EDINBURGH, SCOTLAND
http://www.dcs.ed.ac.uk/home/ctcs99

CALL FOR PARTICIPATION
EARLY REGISTRATION DEADLINE: 19 July 1999

CTCS '99 is the 8th conference on "Category Theory and Computer
Science."  The purpose of the conference series is the advancement of
the foundations of computing using the tools of category theory. While
the emphasis is upon applications of category theory, it is recognized
that the area is highly interdisciplinary.

Previous meetings have been held in Guildford (Surrey), Edinburgh,
Manchester, Paris, Amsterdam, Cambridge, and S. Margherita Ligure
(Genova).

This document contains

1. Invited speakers
2. List of accepted papers
3. Programme committee
4. Registration form

A WWW-version containing all this information plus abstract of
contributed papers can be found under www.dcs.ed.ac.uk/home/ctcs99

1. Invited speakers
-------------------



23 Jun 1999 17:32

### Posts at Heriot-Watt

Posts at the level of lecturer (assistant professor), senior lecturer
and reader (associate professor) are available at the department of
Computing and Electrical Engeneering at Heriot-Watt University,
Edinburgh Scotland.  The posts are in a number of areas of Computer
Science.  I would strongly encourage applications from academics whose
research area is on type theory, term rewriting, logic, and the
foundations of programming languages and theorm proving.  Look at the web
pages of the dependable systems group http://www.cee.hw.ac.uk/~dsg/
which also includes the ULTRA group http://www.cee.hw.ac.uk/ultra/
for information on the areas we are involved in DSG.  Look at
the posts.  If you have any questions, contact the head of department
Roger Clarke (rjc@...) and if your questions are related to
the above areas, contact Fairouz Kamareddine (fairouz@...).

The department of Computing and Electrical at Heriot-Watt is a very
lively, active and friendly place with a supportive spirit.  The
department is expanding fast and is committed to excellence and is
investing a lot in the future.  So, if you can contribute to this
excellence and you want to play an influential role in a supportive
environment, send your application. Deadline of applications (on
official applications forms obtainable from the personnel office) is 6
August.

Heriot-Watt is located in beautiful parklands on the outskirsts of
Edinburgh, the capital of Scotland and a beautiful and historic city.
Rob Pooley, Phil Trinder, Joe Wells, and myself have only moved to
Heriot-Watt in the last year and we have enjoyed everything so far
(email any of us {rjp, trinder, jbw, fairouz} <at> cee.hw.ac.uk) to ask
about our experiences since our arrival to Heriot-Watt).