[Prev][Next][Index][Thread]
Book on Linear Logic (deadline extension)
-
To: linear-tmr-book@iml.univ-mrs.fr, Logique de la Programmation <tous-ldp@iml.univ-mrs.fr>, appsem@cs.chalmers.se, bra-types@cs.chalmers.se, categories@mta.ca, concurrency@cwi.nl, cs-logic@cs.indiana.edu, eacsl@dimi.uniud.it, eatcs-it@cs.unibo.it, lics@research.bell-labs.com, rewriting@ens-lyon.fr, theory-logic@cs.cmu.edu, tmr-linear@iml.univ-mrs.fr, types@cis.upenn.edu
-
Subject: Book on Linear Logic (deadline extension)
-
From: Paul RUET <ruet@iml.univ-mrs.fr>
-
Date: Fri, 02 Feb 2001 11:23:49 +0100
-
Delivery-Date: Fri Feb 2 08:47:30 2001
-
Organization: Institut de =?iso-8859-1?Q?Math=E9matiques?= de Luminy
-
Sender: ruet@iml.univ-mrs.fr
The submission deadline for the Book on Linear Logic is extended to
March 1st, 2001.
CALL FOR PAPERS
Book on Linear Logic
On the occasion of its International Summer School
http://linear.di.fc.ul.pt/
held in the Azores from August 30 to September 7, 2000, the TMR Linear
network
http://iml.univ-mrs.fr/ldp/LINEAR/
wishes to edit a book devoted to recent advances in Linear Logic. This
book will consist of a few invited papers and some refereed
contributions (not necessarily written by people who gave a talk at the
School). All submitted contributions will be refereed. They must be in
English and may not exceed 25 pages, and the results must be unpublished
and not submitted for publication elsewhere, including the proceedings
of symposia or workshops. Submissions (in postscript format) must be
sent by E-mail to
linear-tmr-book@iml.univ-mrs.fr
by March 1st, 2001.
Suggested, but not exclusive, topics of interest for submissions
include:
* Proof theory: proof-nets, ludics, non-commutative logic, proof
theory of classical logic.
* Complexity: polynomial and elementary linear logics, decision
problems, feasible arithmetics.
* Semantics: phase semantics, categorical semantics, denotational
semantics, game semantics, geometry of interaction.
* Concurrency: categorical models for concurrency, interaction nets.
* Applications: sharing reductions in lambda-calculus and optimality,
linear functional programming linear constraint logic programming,
proof search and focalisation.
New submission deadline: March 1st, 2001.
Tentative publisher:
Cambridge University Press, in the "London Mathematical Society Lecture
Note Series".
Editorial board:
Thomas Ehrhard
Jean-Yves Girard
Paul Ruet
Phil Scott