8 Mar 1994 18:50

### paper available


The paper advertised below is available by ftp at

theory.doc.ic.ac.uk

in the directory

/theory/papers/Huth

as a compressed dvi-file

lta.dvi.Z

Best regards,
--Michael Huth.

************************ cut here ******************************************
\documentstyle[12pt]{article}

\newcommand{\oc}[1]{{{\rm !}(#1)}}
\newcommand{\wn}[1]{{{\rm ?}(#1)}}
\newcommand{\dual}[1]{{#1}{}^\bot}

\begin{document}
\title{Linear Types and Approximation}
\author{Michael Huth, Achim Jung, and Klaus Keimel\\
Fachbereich Mathematik \\
Schlo\ss gartenstra\ss e 7 \\
\(\{ {\rm huth}, {\rm jung},


1 Mar 1994 03:23

### new dissertation and talk


Dear all,

I have just completed and successfully defended my dissertation
Linear Set Theory,'' which is to be submitted to the department of
philosophy at Stanford University. I would like to post the abstract
of the thesis in this newsgroup. This is a LaTeX fle.

This dissertation work was supervised by Grigori Mints and
Solomon Feferman. The result on LZF will be presented in
the coming 1993-1994 ASL annual meeting in Gainesville, Florida,
as one of the contributed papers (Sunday afternoon).

Please note that my talk is NOT in the recently posted program of the
meeting since it was scheduled after the program had been in print.

Thank you very much,

Masaru Shirahata

----------------------------CUT HERE-----------------------------------

\documentstyle[11pt]{article}

\begin{document}

\title{Linear Set Theory}
\author{Masaru Shirahata\\
Center for the Study of Language and Information\\
Stanford CA 94305\\


9 Mar 1994 02:03

### Evolving Algebra semantics for LL (request)


Have anybody heard of (an attempt to develop) a semantics for LL in terms
of Evolving Algebras? Or maybe you think this would be a stupid idea?


10 Mar 1994 22:07

### new dissertation available by ftp


My dissertation _Linear Set Theory_ is now available by ftp from

theory.stanford.edu

It is in the directory

pub/shirahata

under the filenames

lset_thesis.ps.Z
lset_thesis.dvi.Z

Thank you very much,

Masaru Shirahata


10 Mar 1994 14:14

### TLCA: First Call for Papers (Plain Text and Latex)


First Call for Papers, TLCA
International Conference on Typed Lambda Calculi and Applications

April 10--12, 1995, Edinburgh, Scotland

The second international conference on Typed Lambda Calculi and
Applications will be held April 10--12, 1995, at Edinburgh in Scotland.
The conference aims at providing a forum for the presentation and
discussion of recent research in the following areas:

Proof theory of type systems
Logic and type systems
Typed lambda calculi as models of (higher order) computation
Semantics of type systems
Proof verification via type systems
Type systems of programming languages
Typed term rewriting systems

The program of TLCA will consist of about 30 selected presentations in
plenary sessions.  The program committee for TLCA is chaired by
M. Dezani and has the following members:

H. Barendregt  (Catholic University of Nijmegen)
M. Dezani  (Chairperson, University of Turin)
J-Y. Girard  (University of Marseilles)
R. Hindley  (University of Swansea)
F. Honsell  (University of Udine)
J. W. Klop  (CWI)
G. Longo  (ENS)


15 Mar 1994 21:51

### summer school on partial evaluation


PRELIMINARY ANNOUNCEMENT
SUMMER SCHOOL ON PARTIAL EVALUATION

A one-week intensive course

Carnegie Mellon University
Pittsburgh, Pennsylvania, USA
Tuesday-Saturday, July 5-9, 1994

Charles Consel        Olivier Danvy           Peter Lee
consel@...    danvy <at> daimi.aau.dk     petel <at> cs.cmu.edu

Partial evaluation is an automatic program transformation technique that
specializes programs with respect to partial knowledge of their input.
Although simple in concept, partial evaluation has some rather surprising
applications and far-reaching implications for automatic program
transformation.  In particular, many problems can be shown to be
specializations'' of a more general problem.  Partial evaluation has been
used in many areas such as compiler generation, scientific computing,
computer graphics, and pattern matching.

This summer school, to be held at Carnegie Mellon University in Pittsburgh,
Pennsylvania, aims at introducing the principles, techniques, and
applications of partial evaluation.  This presentation will be done in the
context of Consel's partial evaluator for procedural programs, called
Schism.  Students will get hands-on experience with the course concepts by
working directly with Schism, studying both its use and its internals.
Also, various applications of partial evaluation will be covered such as
pattern matching and parameterized programming.


15 Mar 1994 20:03

### Re: Evolving Algebra semantics for LL (request)


> I think this would just give you a form of possible-worlds (Kripke)
> model.
I think it's not quite the same, because in Kripke semantics one has
relatively fixed binary or ternary reachability relations, and the game
becomes actually interesting when you impose certain conditions on them
(reflexivity, transitivity, etc).

> Is there some intuition that makes evolving algebras
> seem natural?
My intuition was very simple, not to call it naive: evloving algebras don't
have any problem with change (dynamics), and dynamics seems to be LL's most
salent feature. I'm not sure though I like the way dynamics is admitted
into EAs: it's the same way Einstein resolved the paradoxes with the speed
of light.

> John Mitchell
John, could you please set up public permissions to the last two summary
files (20.summary, 21.partial) on theory.stanford.edu: pub/linear?

Best regards,

615 GSB, Dept. Comp. Sci., Univ. Alberta, Edmonton, AB  T6G 2H1, CANADA


15 Mar 1994 19:07

### Re: Evolving Algebra semantics for LL (request)


Have anybody heard of (an attempt to develop) a semantics for LL in terms
of Evolving Algebras? Or maybe you think this would be a stupid idea?

I think this would just give you a form of possible-worlds (Kripke)
model. This would be nice if it worked, but I don't see how calling
such a thing an "Evolving Algebra" model would make it easier to
construct one. Is there some intuition that makes evolving algebras
seem natural?

John Mitchell


28 Mar 1994 07:04

### Papers available by Public ftp



Firstly, apologies to those of you who get both the relevant logic
mailing list and the linear logic mailing list --- you'll get two
copies of this note.

Secondly, to all interested in work in substructural logics, I bring
to your attention a collection of my preprints in the area.  These
are available by public ftp from

arp.anu.edu.au

in the directory

pub/papers/restall

The directory contains a file README with short descriptions of the
works in the directory.  They include papers on substructural logics,
the philosophy of logic, and other areas of interest to relevant/linear
logicians.  I invite you to ftp over to take a look.  (The files can
be quite large.  They are compressed postscript files, and these can
will see to getting a hardcopy to you.)

Greg Restall

Automated Reasoning Project


28 Mar 1994 23:19

### Re: Papers available by Public ftp


Date: Mon, 28 Mar 1994 15:04:37 +1000
From: Greg Restall <Greg.A.Restall@...>

The directory contains a file README with short descriptions of the
works in the directory.  They include papers on substructural logics,

With regard to your "A Useful Substructural Logic" in that directory,
it is worth mentioning that this logic supports an equational
definition of transitive closure.  See my paper

<at> InProceedings(
Pr90b,	Author="Pratt, V.R.",
Title="Action Logic and Pure Induction",
Booktitle="Logics in AI: European Workshop JELIA '90, LNCS 478",
Editor="J. van Eijck", Publisher="Springer-Verlag", Pages="97-120",

making this point, abstract appended, paper available by anonymous ftp
as boole.stanford.edu:/pub/jelia.tex.

At a talk at a 1992 conference:

<at> InProceedings(
Pr92c,  Author="Pratt, V.R.",
Title="A Roadmap of Some Two-Dimensional Logics",
Booktitle="Logic and Information Flow",
Editor="Van Eijck, J. and Visser, A.", Year="1994")
(belatedly published only this year due to unplanned change of
publisher by the organizers)