Return-Path: Date: Fri, 30 Oct 92 11:37:19 PST From: masaru@Csli.Stanford.EDU (Masaru Shirahata) To: linear@theory.stanford.edu Subject: question about rules for ! Sender: lincoln@cs.stanford.edu --text follows this line-- In the categorical interpretation, ! is characterized as the right adjoint to the inclusion between closed monoidal category C and the category of comonoids in C, denoted ComC. So, in the formulation (II), B is supposed to be an object of ComC while A is of C. Then the answer to the question is they are equivalent when the right adjoint ! is onto. In other words, B |- B\otimes B is derivable only when B = !C for some object C. Masaru Shirahata Return-Path: Date: Sat, 7 Nov 92 15:38:02 EST From: hodas@saul.cis.upenn.edu (Josh Hodas) Posted-Date: Sat, 7 Nov 92 15:38:02 EST Subject: Announcing "Lolli", An Interpreter for Linear-Logic Programming To: linear@cs.stanford.edu Sender: lincoln@cs.stanford.edu --text follows this line-- In conjunction with the upcoming Joint International Conference and Symposium on Logic Programming, and in particular the Workshop on Linear Logic and Logic Programming, I am pleased to announce the first public distribution of Lolli, an interpreter for logic programming based on linear logic principles. The language Lolli (named for the linear logic implication operator "-o" called lollipop), is a full implementation of the language described in the paper "Logic Programming in a Fragment of Intuitionistic Linear Logic" (Josh Hodas & Dale Miller, to appear in Information and Computation), though it differs a bit in syntax, and has several built-in extra-logical predicates and operators. Lolli can be viewed as a refinement of the the Hereditary Harrop formulas of Lambda-Prolog. All the operators (though not the higher order unification) of Lambda-Prolog are supported, but with the addition of linear variations. Thus a Lolli program distinguishes between clauses which can be used as many, or as few, times as desired, and those that must be used exactly once. These features have been used to provide a perspicuous, logical implementation of a number of example problems, including object-oriented programming with mutable state, database update, and term rewriting. Lolli has also been used as the setting for the development of a filler-gap dependency parser for natural language processing. This last is described in the paper "Specifying Filler-Gap Dependency Parsers in a Linear Logic Programming Language", by Josh Hodas, to be presented at JICSLP '92. This preliminary implementation was developed over the last year and is based on code written by Frank Pfenning and Conal Elliot for their paper "A Semi-Functional Implementation of a Higher-Order Logic Programming Language" which appears in "Topics in Advanced Language Implementation", MIT Press, Peter Lee editor. DVI files for this paper, as well as the two papers mentioned above, are included with the distribution. To retrieve a copy of the Lolli system, ftp (anonymously) to ftp.cis.upenn.edu and retrieve the file pub/Lolli/Lolli-07.tar.Z. (Be sure to set ftp to BINARY transfer first.) This distribution includes full ML source, along with a Makefile, as well as the papers mentioned above and a collection of example programs. For those who do not have SML-NJ at their site, we hope to provide pre-built binaries for a variety of architectures. These binaries can be found on ftp.cis.upenn.edu in the directory pub/Lolli/binaries. At present Sparc and NeXT binaries are available. If you compile lolli on a new architecture, please contact me so that I can make your binary available. Return-Path: <@Sunburn.Stanford.EDU:gtall@ogre.cica.indiana.edu> Date: Mon, 9 Nov 92 09:53:35 EST From: Gerry Allwein To: Linear@CS.Stanford.edu Subject: Neighborhood Semantics for the Exponentials Sender: lincoln@cs.stanford.edu --text follows this line-- Folks, the abstract for an extended abstract for a paper I intend to submit to a conference appears below. The Postscript or DVI file can be had by anonymous ftp at ftp.cica.indiana.edu. Go to the directory /pub/gtall/neighborhood. The Kripke model paper of Mike Dunn and myself is in the other directory, /pub/gtall/relation. Send mail to gtall@cs.indiana.edu if you have any problems getting the abstract or with the content. The full paper will include the non-commutative, non-associative case. Space considerations prevented me from including this here. The full paper is symmetric with respect to <> (Girard's ?) working with + and -<, >- (the cotensor product and the coimplication operators) in the same manner that [] works with o and ->,<- (tensor product and implication operators). I didn't do anything with the intensional analogues of Sheffer's stroke and dagger but I may later on. All axioms are added conservatively. One need not start with a negation or commutation or association axioms. Shortly, I put up for anonymous ftp a paper on the categorical duality between the Kripke models and the algebras for LL. But now that I have the exponentials done, I may want to go back and extend that work. Gerry \centerline{\bf Abstract} {\narrower This paper presents a neighborhood semantics for the ``exponentials'' of Girard's Linear Logic. In Allwein and Dunn, {\it Kripke Models for Linear Logic}, the lattice representation work of Alasdair Urquhart, {\it A topological representation theory for lattices}, is used to yield a Kripke style semantics for propositional Linear Logic without the exponentials. The theory presented there treated logics much weaker than Linear Logic and allows one to add axioms to the Hilbert style system for the weakest Linear Logic until the full propositional form is reached with soundness and completeness following at each addition. This paper extends that theory to cover the exponentials for Linear Logic using neighborhoods around each world such as presented in Chellas' {\bf Modal Logic}. Familiarity with the Allwein and Dunn paper will help to understand this paper but is not absolutely necessary. \smallbreak} Return-Path: <@Sunburn.Stanford.EDU:SCPSG@acadvm1.uottawa.ca> Date: Fri, 20 Nov 92 00:36:58 EST From: SCPSG@acadvm1.uottawa.ca Subject: Paper by Bellin & Scott To: Linear Sender: lincoln@cs.stanford.edu --text follows this line-- A paper by Gianluigi Bellin and Philip Scott, entitled "On the Pi Calculus and Linear Logic", is available by anonymous ftp from Imperial College. ftp to theory.doc.ic.ac.uk , in the directory theory/papers/Scott . The paper works out some connections between a version of Milner's Pi-Calculus (a language for concurrent processes) and Abramsky's proofs-as-processes generalization of Curry-Howard. Here is the official abstract. \begin{abstract} We detail Abramsky's ``proofs-as-processes'' paradigm for interpreting classical linear logic (CLL) into a ``synchronous'' version of the $\pi$-calculus recently proposed by Milner. The translation is given at the abstract level of proof structures. We give a detailed treatment of information flow in proof-nets and show how to mirror various evaluation strategies for proof normalization. We also give Soundness and Completeness results for the process-calculus translations of various fragments of CLL. The paper also gives a self-contained introduction to some of the deeper proof-theory of CLL, and its process interpretation. \end{abstract} Phil Scott scpsg@acadvm1.uottawa.ca Gianluigi Bellin bellin@maths.oxford.ac.uk Return-Path: <@Sunburn.Stanford.EDU:dean.rosenzweig@uni-zg.ac.mail.yu> X400-Received: by mta ixgate.gmd.de in /PRMD=GmD/ADMD=DbP/C=DE/; Relayed; Sat, 28 Nov 1992 13:43:43 +0100 X400-Received: by /PRMD=ac/ADMD=mail/C=yu/; Relayed; Sat, 28 Nov 1992 13:40:28 +0100 Date: Sat, 28 Nov 1992 13:40:28 +0100 X400-Originator: dean.rosenzweig@uni-zg.ac.mail.yu X400-Recipients: linear@cs.stanford.edu X400-Mts-Identifier: [/PRMD=ac/ADMD=mail/C=yu/;921128134028] X400-Content-Type: P2-1984 (2) Content-Identifier: 683 Conversion: Prohibited From: Dean Rosenzweig To: Subject: journal - call for papers Sender: lincoln@cs.stanford.edu --text follows this line-- Journal of Computing and Information Technology CIT Casopis za racunarstvo i informacijske tehnologije C A L L F O R P A P E R S Published by: University Computing Centre Zagreb, Croatia EDITORIAL POLICY The Journal of Computing and Information Technology (CIT) will address the area of computer science, modelling and simulation, information systems and information technology. Such a broad spectrum of disciplines and particularly the aspects of research, education and application in them are of special interest in Central and East European regions. Therefore, besides the topics like the theory of computing, numerical and symbolical computing, artificial intelligence, image processing, pattern recognition, robot vision, real-time systems, operating systems, software engineering, communication networks, strategic management, database systems, decision support systems, security, discrete and continuous simulation, computational statistics, natural language processing and computational linguistics, the Journal will pay special attention to the educational, social, legal and managerial aspects of computing and information technology. In this respect the Journal will enable the exchange of ideas, experience and knowledge between regions with different technological and even cultural background. The papers submitted for publication should be original and stimulating, possibly even provocative. English reprints of papers previously published in some other language will be taken into consideration if they are of interest to a wider community. Both theoretical and practical papers, and especially case studies describing the application and critical evaluation of theory, are welcome. The Journal will be publishing contributed papers, survey papers, tutorial expositions and technical notes. All full-length papers will be reviewed by two international referees. Short notes, book reviews and letters will be reviewed by the editors. The Journal will be published jointly with the Croatian professional newsletter on computing and information technology. The Journal will be published quarterly. The first number is expected to be issued in January, 1993. Articles for submission should be sent to: CIT Editorial Office UNIVERSITY COMPUTING CENTRE P.O.B. 741 Engelsova bb 41000 Zagreb Fax: +38 41 518 451 CROATIA E-Mail: CIT@UNI-ZG.AC.MAIL.YU New publications should be sent to the Book Review Editor: Vlado Glavinic Tel: +38 41 629 955 Fax: +38 41 629 653 EDITORS Leo Budin (University of Zagreb, CROATIA) Vlatko Ceric (University of Zagreb, CROATIA) Slobodan Ribaric (University of Zagreb, CROATIA) Dean Rosenzweig (University of Zagreb, CROATIA) EDITORIAL BOARD Egon Boerger (University of Pisa, ITALY) Felix Breitenecker (Technical University of Vienna, AUSTRIA) Bojan Cestnik ("Jozef Stefan" Institute, Ljubljana, SLOVENIJA) Georgios I. Doukidis (Athens University of Economics and Business, Athens, GREECE) Ivan Futo (MULTILOGIC Ltd., Budapest, HUNGARY) Yuri Gurevich (University of Michigan, USA) Andras Javor (KFKI Research Institute for Measurement and Computer Techniques, Budapest, HUNGARY) Branko Jeren (University of Zagreb, CROATIA) Vesna Luzar (University Computing Centre, Zagreb, CROATIA) Heinrich Niemann (Universitaet Erlangen, Nuernberg, GERMANY) Ray Paul (London School of Economics, UNITED KINGDOM) Nikola Pavesic (University of Ljubljana, SLOVENIJA) Jerzy Rosenblit (University of Arizona, USA) Andrew Seila (University of Georgia, USA) Jadranka Skorin-Kapov (State University of New York, Stony Brook, USA) Asim Smailagic (Carnegie Mellon University, USA) Mladen Vouk (North Caroline State University, USA) Zvonko Vranesic (University of Toronto, CANADA) Robert W. Zmud (The Florida State University, USA) INSTRUCTIONS TO AUTHORS Manuscript requirements 1. Manuscripts should be written in English. Manuscripts should be typed on one side of the paper, in double spacing, with ample margins. The pages should be numbered consecutively. Four copies of the manuscripts should be submitted to CIT Editorial Office. 2. Papers should not normally exceed 14 Journal pages (about 8000 words). 3. A title page should be supplied bearing the title of the paper, the names and addresses of the editors, and the name and full postal address of the author to whom correspondence is to be directed. Telephone and fax numbers and E-mail address of this author should also be provided where possible. The authors' names and addresses should not appear in the body of the manuscript, to preserve anonymity. 4. Authors are requested to provide a short biography of no more than 50 words for use in an editorial section. 5. At the head of each paper there should be a summary of not more than 200 words. This should be self contained and understandable by the general reader outside the context of the full paper. 6. Illustrations, photographs and tables should be provided on separate sheets, and take account of the page size of the Journal. The original artwork should be supplied together with two photocopies. The figures and tables should be numbered consecutively as they appear in the text. Captions must be provided on a separate sheet at the end of the text. 7. A running head of not more than 30 characters should be supplied for papers with longer titles. 8. Sections and subsections should be clearly differentiated but should NOT be numbered. 9. Papers must be written without the use of footnotes. 10. Mathematical expressions and Greek or other symbols should be written clearly with ample spacing. Any unusual characters should be indicated on a separate sheet. 11. References in the text are indicated by authors' names and year of publication in parentheses. If a referenced paper has three or more authors the reference should always appear as the first author followed by et al. The references are listed alphabetically at the end of the manuscript. Journal titles should not be abbreviated. Journal L. FRAZIER, J.D. FODOR (1978) The sausage machine: A new two-stage parsing model. Cognition, 6, 291-325. Book M. NAGAO (1988) Knowledge and Inference. Academic Press, Boston. Contributed volume E.S. CORDINGLEY (1989) Knowledge elicitation techniques for knowledge-based systems. In Knowledge Elicitation: Principles, Techniques and Applications (D. DIAPER, Ed.), pp. 179-194. Ellis Horwood, Chichester. Conference paper R.L. WATROUS, L. SHASTRI (1987) Learning phonetic features using connectionist networks: An experiment in speech recognition. Presented at the Proceedings of the IEEE International Conference on Neural Networks, San Diego, CA. Unpublished reports/theses J.W. ROZENBLIT (1985) A conceptual basis for model-based system design. PhD. Thesis, Wayne State University, Detroit, Michigan. Proofs and reprints 12. Proofs of papers will be sent to authors for checking. Alterations to diagrams should be avoided where possible. It will not be possible to accept major textual changes at this stage. Proofs must be returned to the publishers within 48 hours of receipt by fax, first-class post airmail or courier. Failure to return the proof will result in the paper being delayed. 13. 30 offprints of full-length papers will be provided free to the corresponding author. Additional offprints may also be ordered. If the offprint forms are not received until after the issue has gone to press, charges for reprinting will necessarily be higher. Offprints of short notes, book reviews and letters are not available. Copyright 14. The copyright of all material published is vested in the Journal. 15. The author must complete and return the copyright form enclosed with the proofs. 16. Authors wishing to submit papers which have been published elsewhere in a foreign language should approach the original Publisher before submission. 17. Authors wishing to use material previously published in CIT should consult the Publishers. Disk submission The manuscripts are intended to be submitted on disk wherever possible. ASCII format on 3 1/2 or 5 1/4 inch disks (MS-DOS Format). Return-Path: <@Sunburn.Stanford.EDU:pvh@cs.brown.edu> Date: Tue, 1 Dec 92 18:43:10 -0500 From: pvh@cs.brown.edu (Pascal van Hentenryck) To: linear@cs.stanford.edu Subject: CFP: Workshop on Principles and Practice of Constraint Programming Sender: lincoln@cs.stanford.edu --text follows this line-- \documentstyle[times,10pt]{article} \setlength{\oddsidemargin}{-0.50in} \setlength{\evensidemargin}{0in} \setlength{\textwidth}{7.5in} \setlength{\topmargin}{-0.2in} \setlength{\headsep}{0.0in} \setlength{\textheight}{23.5cm} \pagestyle{empty} \hbadness=10000 \begin{document} \begin{center} {\Large\bf PPCP93 --- Call For Papers} \\ \end{center} \begin{center} {\large\bf First Workshop on Principles and Practice of Constraint Programming} \\ {\large April 28--30, 1993}, \\ {\large Newport, Rhode Island, USA} \\ {\large Sponsored by the Office of Naval Research} \end{center} \vspace{0.5cm} \parbox{1.7in}{ {\bf Organizing Committee} \\ P. Kanellakis, {\em Brown}\\ J-L. Lassez, {\em IBM Watson} \\ C. Lau, {\em ONR} \\ V. Saraswat, {\em Xerox PARC} \\ R. Wachter, {\em ONR} \\ D. Wagner, {\em ONR} \\ \\ {\bf Invited Speakers} \\ ({\em preliminary list}) \\ A. Colmerauer, {\em Marseille} \\ H. Gallaire, {\em Xerox Corp.} \\ \\ {\bf Program Committee} \\ A. Borning, {\em Washington} \\ J. Cohen, {\em Brandeis} \\ D. Dill, {\em Stanford} \\ J. de Kleer, {\em Xerox PARC} \\ E. Freuder, {\em New Hampshire} \\ J. Hooker, {\em CMU} \\ J. Jaffar, {\em IBM Watson} \\ D. Kapur, {\em SUNY Albany} \\ P. Kanellakis, {\em Brown} \\ D. Kozen, {\em Cornell} \\ J-L. Lassez, {\em IBM Watson} \\ J-C. Latombe, {\em Stanford} \\ N. Lynch, {\em MIT} \\ D. McAllester, {\em MIT} \\ A. Meyer, {\em MIT} \\ A. Nerode, {\em Cornell} \\ F. Pereira, {\em AT\&T Bell Labs} \\ R. Ramakrishnan, {\em Wisconsin} \\ V. Saraswat, {\em Xerox PARC} \\ P. Van Hentenryck, {\em Brown} \\ \\ {\bf Local Organization \&} \\ {\bf Publicity} \\ Pascal Van Hentenryck \\ Brown University \\ Box 1910, \\ Providence, RI 02912 \\ pvh@cs.brown.edu \\ tel: 401-863-7634 \\ fax: 401-863-7657 \\ } \ $\; \;$ \ \parbox{4.8in}{ \setlength{\parindent}{0.5cm} The First Workshop on the Principles and Practice of Constraint Programming (April 28--30, 1993 in Newport, RI) will be an inter-disciplinary meeting focusing on constraint programming as a general paradigm for computation. The workshop will be sponsored by the Office of Naval Research (ONR). Conventional computing paradigms, such as functional, imperative, and object-oriented programming, deal primarily with full information notions of objects and data-types. Constraint programming (CP) is based on the ability to represent and manipulate partial information about objects, i.e., constraints such as equalities and inequalities. CP augments conventional notions of state, state-change, and control with notions of monotonic accumulation of partial information about objects of interest, and with operations involving constraints such as consistency and entailment. Early studies, in the 60's and 70's, introduced and made use of CP in graphics and in artificial intelligence. In the 80's, considerable progress was achieved with the emergence of constraint logic programming and of concurrent constraint programming. CP has been applied with some success to operations research scheduling problems, hardware verification, user-interface design, decision-support systems, and simulation and diagnosis in model-based reasoning. Currently, CP is contributing exciting new directions in research areas such as: artificial intelligence, computational linguistics, concurrent and distributed computing, database systems, graphical interfaces, operations research and combinatorial optimization, programming language design and implementation, symbolic computing algorithms and systems. The purpose of this workshop is to bring together researchers from all the above areas with an active interest in constraint programming. The meeting shall focus on understanding the common principles of this computing paradigm and investigating its use across different disciplines. The meeting will be small and informal, providing forums for prepared presentations, panels, and discussions. Participation will be by invitation of the program committee, and will be restricted primarily to authors of accepted position papers. The program committee solicits position papers describing preliminary or completed research and new directions or possible uses of CP. Authors are invited to submit (by hardcopy mail, e-mail or FAX) five copies of a short position paper, not exceeding 2000 words, by Friday {\bf January 22, 1993} to one of the program co-chairs: \\ \begin{tabular}{lll} {\em Paris Kanellakis} & {\em Jean-Louis Lassez} & {\em Vijay Saraswat} \\ Brown University & IBM T.J. Watson & Xerox Palo Alto \\ Dept. of Computer Science & Research Center & Research Center \\ Box 1910 & P.O. Box 704 & 3333 Coyote Hill Road \\ Providence, & Yorktown Heights, & Palo Alto, \\ RI 02912 & NY 10598 & CA 94304 \\ pck@cs.brown.edu & jll@watson.ibm.com & saraswat@parc.xerox.com \\ tel: 401-863-7647 & tel: 914-784-7841 & tel: 415-812-4747 \\ fax: 401-863-7657 & fax: 914-784-7455 & fax: 415-812-4334 \\ \end{tabular} \\ Authors will be notified of the acceptance or rejection of their papers by {\bf February 26, 1993}. Full versions of the accepted papers must be received by {\bf March 26, 1993}. Proceedings will be available in technical report form at the workshop and, including feedback from the workshop, will be published in book format. } \end{document} Return-Path: <@Sunburn.Stanford.EDU:danos@logique.jussieu.fr> Date: Wed, 2 Dec 92 13:00:38 +0100 From: danos@logique.jussieu.fr To: Linear@cs.stanford.edu Subject: local and asynchronous beta-reduction Sender: lincoln@cs.stanford.edu --text follows this line-- We build a confluent, local, asynchronous reduction on lambda-terms, using infinite objects (partial one-to-one transformations in Girard's algebra Lambda*), which is simple (only one move), intelligible (semantic setting of the reduction), general (based on a large-scale decomposition of beta reduction), and may be mechanized. A paper virtred.dvi.Z describing this construction is ftp-able at frege.logique.jussieu.fr in /pub/scratch/ Vincent Danos & Laurent Regnier. Return-Path: <@Sunburn.Stanford.EDU:girard@margaux.inria.fr> Date: Fri, 4 Dec 92 15:37:29 +0100 From: Jean-Yves Girard To: linear@cs.stanford.edu Subject: Answer to Carolyn Sender: lincoln@cs.stanford.edu --text follows this line-- Answer to Carolyn This is not an answer ; just one remark together with questions ! For me the problem is not to determine the relative strength of (I) and (II), but rather to determine which is the correct formulation. In this respect, the main problem is with the proof-theoretical status of (II), (I) being unproblematic. QUESTION 1 : does (II) enjoy cut-elimination ? I mean a real result, not something without any subformula property. It seems that the premises B /- 1 and B /- B times B can be used to handle erasing and duplication of B. Of course the subformula property is spoiled with 1 and tensors, but it is not definitely destroyed. QUESTION 2 : what is the denotational status of (II) ? A usual bang is a comonoid, but arbitrary weakenings and duplication will not enjoy (co) neutrality and (co) associativity. QUESTION 3 : what about geometry of interaction of (II) ? It might be quite cumbersome... As far as phase semantics is concerned, the natural way to form !A is to consider the double perp of the intersection of A with a given set of phases F ; F is in turn the intersection of the fact 1 with a set of phases G : in the case of (I) G is the set of idempotents, whereas in the case of (II) G consists of those x such that, for all y, if xxy is in BOTTOM, so is xy.. If one wants to obtain completeness wrt very concrete phase spaces (eg integers), (I) must be excluded for want of idempotents. Again this was everything but an answer : just an attempt to compare the two formulations. By the way I take this opportunity to give my new coordinates : Laboratoire de Mathematiques Discretes, UPR 9016 163 Avenue de Luminy, case 930 13288 Marseille cedex 09 Please do not use my previous home address (rue Sibuet) that I was using only because of the unreliability of the mail in Jussieu-Paris VII. Tel : (33) 91827025 91827026 (secretary : Mme Bodin) Fax : 91827015 the new Email is not yet working jean-yves girard Return-Path: <@Sunburn.Stanford.EDU:jv@lipn.univ-paris13.fr> Date: Tue, 8 Dec 92 04:33:09 +0100 From: jv@lipn.univ-paris13.fr (Jacqueline Vauzeille) To: linear@cs.stanford.edu Subject: Generating plans im linear logic Sender: lincoln@cs.stanford.edu --text follows this line-- The increasing interest for applications of linear logic motivates the present announcement of our own works on "Planification and Linear Logic". These works - performed before the beginning of the current mailing list - have been largely diffused (in Europ and in the world) since 1990, especially at the German Congress on Artificial Intelligence (GWAI'91), workshop Logic and Change. Up to 1989, several attempts in the relation between logic and the changes involved in reasoning and specifically in plan generation, have been made, either by embedding actions into a classical framework or by using non-standard formalisms. We have thought that these attempts, though promising, missed their objectives, for a want of a suitable logic. We have shown how to obtain a strong and clean correspondence between proofs and sequences of actions only by using linear logic. A theorem is presented which expresses the new adequacy between proofs and actions. After the proof theoretical study, M. Masseron has proposed a new characterization of actions, in the spirit of proof-nets in the conjunctive case. The work on the disjunctive case has also be treated : a preliminary version has been diffused since 1991 ; an achieved version will be presented at the ESPRIT workshop "Logic and Change" at Lisboa (january 1993). M. Masseron, C. Tollu, J. Vauzeilles References 1. Masseron M. Tollu C. Vauzeilles J. : "Plan Generation and Linear LogicJ". Proceedings of FST-TCS 10. Lectures Notes in Computer Science. 1990, p.63-75. 2. Masseron M. Tollu C. Vauzeilles J. : "Planification et Logique Lineaire". Proceedings of "8ieme Congres Reconnaissance des Formes et Intelligence Artificielle". AFCET. Lyon-nov 25-29 1991, p.751-761. and Revue d'Intelligence Artificielle, octobre 1992, p.285-311. 3. Masseron M. Tollu C. Vauzeilles J. : "Generating Plans in Linear Logic : I. Actions as proofs". Theoretical Computer Science, vol 113, juin 93 (to appear). 4. Masseron M. : "Generating Plans in Linear Logic : II. A geometry of conjunctive actions". Theoretical Computer Science, vol 113, juin 93 (to appear). Return-Path: <@Sunburn.Stanford.EDU:sa@doc.ic.ac.uk> Date: Thu, 10 Dec 1992 14:11:31 +0000 (GMT) From: Samson Abramsky Mime-Version: 1.0 Content-Type: text/plain; charset=US-ASCII To: linear@cs.stanford.edu Subject: Introduction to Bellin-Scott paper Sender: lincoln@cs.stanford.edu --text follows this line-- At the suggestion of the authors, I have written a short introductory note to ``On the pi-calculus and Linear Logic'' by Gianluigi Bellin and Phil Scott. This is now available by anonymous-ftp from theory.doc.ic.ac.uk, in papers/Abramsky/picalcintro.dvi. Samson Abramsky