February 1999 - Categories - categories.org.au

SCTA - second announcement
by scta＠mat.uc.pt 26 Feb '99

26 Feb '99

Please circulate to all interested colleagues. =================================================================== SECOND ANNOUNCEMENT =================================================================== School on Category Theory and Applications Department of Mathematics University of Coimbra Coimbra, Portugal July 13-17, 1999 The Department of Mathematics of the University of Coimbra is organizing a School on Category Theory and Applications from 13th to 17th of July, 1999. This school will consist of the following 7 hours intensive courses, at a postgraduate level: n-Categories by John Baez (University of California, USA) Algebraic Theories by M. Cristina Pedicchio (University of Trieste, Italy) Chu Spaces: duality as a common foundation for computation and mathematics by Vaughan Pratt (Stanford University, USA). ORGANIZING COMMITTEE ==================== Manuela Sobral (Universidade de Coimbra) Maria Manuel Clementino (Universidade de Coimbra) Jorge Picado (Universidade de Coimbra) Lurdes Sousa (Instituto Superior Politecnico de Viseu) REGISTRATION FEE ================ The school registration fee is set at 6000 PTE payed at arrival. This includes the courses notes, coffee breaks and a dinner. Registrations can be made directly at the School Web Page or by electronic or postal mail, filling in the Registration Form below. ACCOMMODATION ============= Please keep in mind that July is high season here and that to ensure accommodation after April 30 can be difficult. Please reserve your accommodation as soon as possible. You may book your hotel room in the hotels of the Category Theory Conference filling in the Hotel Reservation Form below and sending it to Profissional Tours. Alternatively, there will be some rooms available at UNIVERSITY Residences. There you have to pay the price for two weeks: 8.000 PTE. The participants interested on this type of accommodation should send an email to mailto:picado@mat.uc.pt IMPORTANT DATES =============== Registration: April 30, 1999. SCHOOL HOMEPAGE =================== The Registration and Hotel Reservation Forms, as well as up-to-date information, are available at our web page http://www.mat.uc.pt/~scta/ There you can also see a city map with the hotels location. SCHOOL ADDRESSES ==================== All correspondence must be sent to one of the following addresses: E-mail address: scta(a)mat.uc.pt Postal address: SCTA Departamento de MatemÃ¡tica Apartado 3008 3000 Coimbra, PORTUGAL Please find below the Registration and Hotel Reservation Forms. They may also be sent to you by fax, upon request. ------------------------------------------------------------------------------ SCHOOL ON CATEGORY THEORY AND APPLICATIONS Coimbra, Portugal, July 13-17, 1999 REGISTRATION FORM (Please send before April 30, 1999) Family name: _________________________________ First name: __________________________________ Institution (full postal address): _____________________________ ________________________________________________________________ ________________________________________________________________ e-mail address: ________________________________________________ Fax number: ____________________________________________________ ------------------------------------------------------------------------------ SCHOOL ON CATEGORY THEORY AND APPLICATIONS Coimbra, Portugal, July 13-17, 1999 HOTEL RESERVATION FORM (Please send before April 30, 1999) Accommodation prices: All prices indicated are in Portuguese escudos (1 EURO=200.482 PTE) and per room per day, including breakfast. Deadline for guaranteed room is April 30, 1999. HOTEL CAT. SINGLE DOUBLE Room Type(*) Priority Choice ROOM ROOM S / D 1 2 3 Qta. Lagrimas **** 15000 17000 ______ __ __ __ Tivoli **** 10000 12000 ______ __ __ __ Braganca *** 6400 8500 ______ __ __ __ Ibis ** 8600 9500 ______ __ __ __ Resid. Botanico *** 5900 7500 ______ __ __ __ (*) The organization will not allocate people to double rooms. So, if you are sharing a room, please indicate the name (surname, initials) of the person you will be sharing with. Date of arrival: ___/___/___ Date of departure: ___/___/___ Number of nights: _____ METHOD OF PAYMENT: By cheque # in Portuguese escudos, payable to: PROFISSIONAL TOURS # personal cheques are not acceptable and bank draft cheques or money orders in escudos are accepted only when free of charges to the organization. By credit card: VISA ____ MASTERCARD ____ EUROCARD ____ Please charge my credit card to the total amount of _______________________PTE Card Number _________________________________ Expiry date _____/_____ Signature ___________________________________ PLEASE FILL BELOW, INDEPENDENTLY OF YOUR METHOD OF PAYMENT Name _________________________________________________ Fax __________________ Full address _________________________________________ Country ______________ PLEASE SEND TO PROFISSIONAL TOURS - Av. Afonso Henriques, 45 - 3000 COIMBRA - PORTUGAL Phone (+351 39)402011 - Fax (+351 39)704317 e-mail: profissional.comercial(a)beta-viagens.pt ----------------------------------------------------------------------------

1 0

Paper on linear bicategories (and non-commutative linear logic)
by Robert A.G. Seely 25 Feb '99

25 Feb '99

I would like to announce the following paper, which has been posted on my www site <http://www.math.mcgill.ca/~rags>. (The McGill ftp site is currently not functionning, but as soon as it is restored, this paper ought to appear on the Hypatia mirror site as well.) The abstract follows. =================================== Introduction to linear bicategories by J.R.B. Cockett, J. Koslowski, R.A.G. Seely Linear bicategories are a generalization of the notion of a bicategory, in which the one horizontal composition is replaced by two (linked) horizontal compositions. These compositions provide a semantic model for the tensor and par of linear logic: in particular, as composition is fundamentally noncommutative, they provides a suggestive source of models for noncommutative linear logic. In a linear bicategory, the logical notion of complementation becomes a natural linear notion of adjunction. Just as ordinary adjoints are related to (Kan) extensions, these linear adjoints are related to the appropriate notion of linear extension. There is also a stronger notion of complementation, which arises, for example, in cyclic linear logic. This sort of complementation is modelled by cyclic adjoints. This leads to the notion of a *-linear bicategory and the coherence conditions which it must satisfy. Cyclic adjoints also give rise to linear monads: these are, essentially, the appropriate generalization (to the linear setting) of Frobenius algebras. A number of examples of linear bicategories arising from different sources are described, and a number of constructions which result in linear bicategories are indicated. This paper is dedicated to Jim Lambek, as part of the celebration of his 75th birthday.

1 0

Oriented homotopy and Concurrency
by Philippe Gaucher 25 Feb '99

25 Feb '99

Dear category theorists, Here is an annoucement of preprint. URL : http://www-irma.u-strasbg.fr/~gaucher/multi_en.ps.gz or http://www-irma.u-strasbg.fr/irma/publications/1999/99010.shtml Title : Homotopy invariants of multiple categories and concurrency in computer science Abstract : We associate to any (strict) multiple category $\C$ three homology theories : the first one is called the globular homology and it contains the oriented loops of $\C$ ; both other ones are called corner homology, the negative one and the positive one, which contain the corners included in $\C$. We show up the link between this homology theories and the homotopy of paths in multiple category. At the end of the paper, we explain the reason why this theories are interesting for some geometric problems coming from computer science.

1 0

Industrial application
by michael.j.healy＠boeing.com 24 Feb '99

24 Feb '99

To all who work in category theory: Today, my colleague Keith Williamson demonstrated an "industrial-strength" application of category theory. He applied The Kestrel Institute's Specware(TM) system to generate a fairly large program from formal specifications. The program optimizes the placement of electrical equipment in an airliner, minimizing wiring subject to constraints on how the equipment can be placed. This is a demonstration of applied research, not yet in technology transfer. That having been said, the engineers are finding the program Keith generated to be potentially of great use. Of more significance, though, is their interest in the way the program was developed: It can be either improved or adapted to other applications by modifying specifications and diagrams of specification morphisms, and then replaying the software generation---as opposed to having to work with the code. Efficiency improvements to the code have already been demonstrated by working in this mode. Our slogan is "Re-use specifications, not software". I don't want to oversell this thing; the devil is in the details, as usual, and much more work needs to be done on this approach. But I'm obviously proud of the accomplishment. When I started our project about four years ago, most here thought that applying category theory to anything was a crazy notion; others thought that applications, if any, would be 12 to twenty years out (depending on to whom we were talking). Last year we had a proof-of-concept demonstration (actual code). This year, the boss said, "OK, now scale it up."---and we did! Ross Street has had an item giving an overview of our work linked to his home page for some time now. We have a paper accepted in the Journal of Intelligent Manufacturing, but I don't know when it will appear. Mike Healy Here's the standard disclaimer I must provide: This document does not represent an official position of The Boeing Company or any of its subsidiaries or suppliers. -- =========================================================================== e Michael J. Healy A FA ----------> GA (425)865-3123 | | FAX(425)865-2964 | | Ff | | Gf c/o The Boeing Company | | PO Box 3707 MS 7L-66 \|/ \|/ Seattle, WA 98124-2207 ' ' USA FB ----------> GB -or for priority mail- e "I'm a natural man." 2760 160th Ave SE MS 7L-66 B Bellevue, WA 98008 USA michael.j.healy(a)boeing.com -or- mjhealy(a)u.washington.edu ============================================================================

1 0

Vaughan, in the real world
by Peter Freyd 24 Feb '99

24 Feb '99

Now who says that people on this net are just too theoretical? The Chronicle of Higher Education From the issue dated February 26, 1999 Stanford Computer-Science Professor Creates a Pocket-Sized Web Server By KELLY McCOLLUM Watch where you step in the computer-science department at Stanford University. There may be a Web server hiding under that scrap of paper. Vaughan Pratt, a professor of computer science at Stanford, has created what he says is the world's smallest World-Wide Web server, a computer that is capable of sending images, sounds, or text to Web surfers around the world. But unlike most such computers, Mr. Pratt's Web server is not quite as tall and wide as a business card, and only a quarter of an inch thick. Mr. Pratt says he made the device "initially just for the impact." But, he says, the computer also makes a point about the shrinking size and cost -- and growing power -- of general-purpose computers like his Web server. "Fifty years ago, a computer with less computational power than a modern pocket calculator filled a whole room, and ran programs consisting of only a few hundred instructions," Mr. Pratt says on his Web site. "Today we can fit the extensive software needed to drive a World-Wide Web server into a computer the size of a box of matches." The Web server was partially an answer to the previous record holder, a tiny server designed by a software company in Cambridge, Mass. That earlier server was an "embedded system" -- a computer constructed to perform a specific task. Embedded systems are useful because they are inexpensive and run their programs reliably. General-purpose machines, like personal computers, have multiple uses, but are more complex and expensive. However, says Mr. Pratt, the general-purpose computers have dropped so far in price that they may be more economical than embedded systems in some cases. And in the case of a Web server, a general-purpose machine is desirable because its software can be easily replaced or upgraded. Mr. Pratt's server uses a 486 processor, like those found in older personal computers, and runs the Linux operating system. He adapted the Web server from a computer that costs about $400. The challenge was paring down the powerful Linux operating system to fit into the server's 16 megabytes of storage space and getting it to communicate with the Internet. The tiny computer's only job so far has been self-promotion: It serves up a Web pag with photographs of itself, information about its hardware, and detailed instructions for creating similar servers (http://wearables.stanford.edu/) According to Mr. Pratt, the server has sent out about 120,000 pages in the past month. He says it could handle a hit per second, although it hasn't been that busy yet. The hardware that makes the server possible is what is commonly called a "computer on a chip." Unlike most personal computers, which are built from many pieces of hardware -- a processor, memory chips, a hard drive, and so on -- the tiny server has all its components integrated on a single circuit board. That concept has been increasingly used in the personal-computer industry, which has begun integrating components like sound cards and modems as a way of cutting manufacturing costs. Mr. Pratt adds that wearable computers -- complete with eyeglass displays and wrist-mounted keyboards -- are prime uses of tiny computers like his Web server. Mr. Pratt says the tiny server would probably not work for a Web site with heavy traffic. But it could be useful where a server was needed only temporarily or where a mobile server was necessary -- perhaps for scientists hoping to serve up pages from remote places. _________________________________________________________________ http://chronicle.com Section: Information Technology Page: A25

1 0

PhD in Informatics (AI, CS, CogSci) at Edinburgh
by rbf＠dai.ed.ac.uk 24 Feb '99

24 Feb '99

PhD degrees in the Division of Informatics at the University of Edinburgh In 1998, the University of Edinburgh established a Division of Informatics, to study the structure, behaviour and interactions of both natural and artificial computational systems. The Division reflects the University's vision of Informatics as a fundamental area of study, critical for the future developments in science, engineering, and society. The Division was formed from the former Departments of Artificial Intelligence, Cognitive Science and Computer Science. The Division has positions for new research degree students pursing either an MSc(Research) (one year), an MPhil (two years) or a PhD (three years) through investigation of open problems in Informatics. The Division now contains over 75 academic staff, 66 contract researchers and about 100 research students, grouped primarily into these research institutes: Artificial Intelligence Applications Institute Institute of Computing Systems Architecture Institute for Adaptive and Neural Computation Institute for Communicating and Collaborative Systems Institute of Perception, Action and Behaviour Institute for Representation and Reasoning Laboratory for Foundations of Computer Science which reflect the main research themes in the Division: adaptive computing artificial intelligence automated and mathematical reasoning cognitive science computational complexity computational learning theory computational linguistics and natural language processing computational musicology computer-assisted formal reasoning computer and network architectures computer communications and networks computer graphics and virtual reality computer science computer vision database systems design and analysis of dependable systems diagramatic understanding formal program specification functional, logic and object-oriented programming human-computer interaction intelligent tutoring systems knowledge representation and reasoning knowledge-based systems medical informatics mobile and assembly robotics modular and component-based systems neural modelling neural networks parallel, distributed and concurrent systems planning and activity management program logics programming languages qualitative and fuzzy reasoning semantics of programming languages software engineering speech understanding and generation system level design and integration theory of computation type theory The UK Engineering and Physical Science Research Council has awarded the Division about 10 (typically) full studentships that can be used by UK and EC students. Overseas students may be eligible for ORS awards, that pay approximately half of the total costs. In general, students should have a good BS/BSc degree (or equivalent) in an appropriate topic, plus other skills appropriate to the particular research area. More information can be found on the Division's PhD WWW page at: http://www.inf.ed.ac.uk/www/public/Courses/ For application forms and further information, write to: PhD Admissions Secretary Division of Informatics University of Edinburgh James Clerk Maxwell Building King's Buildings Mayfield Road Edinburgh EH9 3JZ Email: phd-admissions(a)inf.ed.ac.uk Fax: +44 131 667 7209 Telephone: +44 131 650 5156 Please contact us if you'd like to come for a visit. **************** ALSO: MSc Positions Available **************** We also have three thriving taught MSc courses in Artificial Intelligence, Cognitive Science and Computer Science. For more information, see: http://www.inf.ed.ac.uk/www/public/Courses/

1 0

Paper Announcement: Control Categories and Duality
by Peter Selinger 23 Feb '99

23 Feb '99

Dear Category Theorists, The paper "Control Categories and Duality: on the Categorical Semantics of the Lambda-Mu Calculus" is now available from http://www.math.lsa.umich.edu/~selinger/papers.html http://hypatia.dcs.qmw.ac.uk/author/SelingerP This is a revised and improved version of a paper I presented at MFPS'98. Let me briefly summarize the part of the paper that I think will be the most interesting to category theorists; the actual abstract is appended at the end. Consider a category C with distributive finite products and coproducts and a distinguished object R, such that all exponentials of the form R^A exist. Let R^C denote the full subcategory of C consisting of objects of the form R^A. It is an old observation that R^C is cartesian-closed. This observation is at the heart of continuation passing style (CPS) interpretations of programming languages with control operators, and it has been used recently by Hofmann and Streicher to give a sound and complete categorical model of Parigot's lambda-mu calculus. (The lambda-mu calculus generalizes the simply-typed lambda calculus; it is a proof term calculus for propositional classical logic). In this paper, I give an independent, algebraic characterization of the structure of categories of the form R^C. By "independent", I mean that it does not depend on an ambient category C, and by "algebraic", that it is given in terms of operations and equations only. The crucial structure that R^C has, besides cartesian closure, is an operation called "classical disjunction" that takes R^A and R^B to R^(AxB). This operation is functorial in each argument, but not bifunctorial; it forms a premonoidal structure in the sense of Power and Robinson. Abstracting from R^C, I define the class of "control categories", which are cartesian-closed categories with a premonoidal structure and suitable axioms. The presence of an operation which is not bifunctorial leads to some interesting twists, as one has to be a bit careful about how one defines concepts such as weak structure-preserving functors and equivalences of categories. The main theorem is a structure theorem, which shows that every control category is equivalent to a category of the form R^C (and, of course, vice versa). An algebraic class of categories calls out for an internal language. I prove that the call-by-name lambda-mu calculus (with product and disjunction types) forms an internal language for control categories. Thus, these categories can be considered as models for (a certain kind of) proof theory of classical logic. Also, the call-by-value lambda-mu-calculus forms an internal language for the dual class of co-control categories. As a consequence of this categorical duality, it follows that there is a syntactic duality between the call-by-name and the call-by-value calculus, i.e., there are mutually inverse translations between call-by-name and call-by-value that preserve the categorical (and also the operational) semantics. Such dualities have been observed in a different setting by Filinski. In the case of the lambda-mu calculus, such a syntactic duality was conjectured by Streicher and Reus. Comments are welcome. Best wishes, -- Peter Selinger ---------------------------------------------------------------------- ABSTRACT: We give a categorical semantics to the call-by-name and call-by-value versions of Parigot's lambda-mu calculus with disjunction types. We introduce the class of control categories, which combine a cartesian-closed structure with a premonoidal structure in the sense of Power and Robinson. We prove, via a categorical structure theorem, that the categorical semantics is equivalent to a CPS semantics in the style of Hofmann and Streicher. We show that the call-by-name lambda-mu calculus forms an internal language for control categories, and that the call-by-value lambda-mu calculus forms an internal language for the dual co-control categories. As a corollary, we obtain a syntactic duality result: there exist syntactic translations between call-by-name and call-by-value which are mutually inverse and which preserve the operational semantics. This answers a question of Streicher and Reus.

1 0

Spring School on Categorical Methods in Logic & Computer Science
by Gradkolleg LI 22 Feb '99

22 Feb '99

Spring School on CATEGORICAL METHODS in LOGIC and COMPUTER SCIENCE Ludwig-Maximilians-University Munich 12-16 April 1999 This school is organised by the PhD Programme "Logic in Computer Science". It aims at providing a general introduction into categorical logic and type theory. Moreover, two important concepts in this context, sheaves and fibered categories, will be considered in more detail. Ideally, at the end of the week connections and interrelations between these topics will have evolved and the students have ideas of the relations of categorical logic to their own research. SHEAVES by Giuseppe Rosolini FIBERED CATEGORIES by Thomas Streicher CATEGORICAL LOGIC and TYPE THEORY by Martin Hyland Schedule: For each of the series there will be 5 lectures of 90 minutes, scheduled from monday to friday. Location: The lectures will take place in the Institute of Computer Science, Oettingenstr.63. Prerequisites: Some familiarity with basic category theory (e.g. Saunders Mac Lane, Categories for the Working Mathematician, chapters I - V), predicate logic, typed lambda calculus. Further details may depend on the suggestions of the lecturers. Registration: The number of participants is limited. If you are interested, please register by sending an email to mailto:gkli@rz.mathematik.uni-muenchen.de containing the following information: name, email, affiliation, research interests. Registration fee is 200,- DM (approximately 100 Euro), to be payed in cash at the registration. We can offer help in finding accommodation. Programme Committee: Thorsten Altenkirch Bernhard Reus Helmut Schwichtenberg Martin Wirsing Local Organisation: Alexander Kurz Dirk Pattinson Felix Joachimski Updated information can be obtained under http://helios.pst.informatik.uni-muenchen.de/spring-school99/ Felix Joachimski -- Graduiertenkolleg Logik in der Informatik Department of Mathematical Logic University of Munich http://www.mathematik.uni-muenchen.de/~gkli

1 0

MSc in Informatics (AI, CS, CogSci) at Edinburgh
by rbf＠dai.ed.ac.uk 22 Feb '99

22 Feb '99

Master of Science degrees in the Division of Informatics at the University of Edinburgh The Division of Informatics offers three 1 year courses in different topics in Informatics: 1. MSc in Artificial Intelligence, whose primary focus is on development and understanding of intelligent computational processes for the benefit of both creating useful artifacts and helping better understand intelligence (human or otherwise). The course contains five themes: Foundations of AI, Intelligent Robotics, Knowledge-based Systems, Natural Language Processing, and Non-Symbolic AI. 2. MSc in Cognitive Science and Natural Language. This MSc is concerned with computational, formal and experimental approaches to understanding cognition and natural language. In Cognitive Science, the disciplines of formal linguistics, psychology, neuroscience and philosophy are brought together in different kinds of computational frameworks. This MSc is particularly concerned with how language is represented and processed. 3. The MSc in Computer Science contains three themes. The Advanced Computer Systems theme embraces the theory and practice of designing programmable systems. The Systems Level Integration theme teaches the principles underlying the design of integrated software and hardware systems in silicon. The Theoretical Computer Science theme introduces students to core areas of theoretical Computer Science and to the technologies through which theory-based tools are implemented. From October to April students attend taught modules. During the period May - September inclusive, each student undertakes a major practical project under the supervision of a member of academic staff. The projects can involve industrial collaboration and may be proposed by the student. These courses have been approved by the UK Engineering and Physical Science Research Council for the tenure of Advanced Course Studentships (about 40 across the three courses). In general, students should have a good BS/BSc degree (or equivalent) in an appropriate topic, plus other skills approporate to the particular MSc course. More information can be found on the Division's MSc WWW page at: http://www.inf.ed.ac.uk/www/public/Courses/ For further information, write to: MSc Admissions Secretary Division of Informatics University of Edinburgh 5 Forrest Hill Edinburgh, EH1 2QL Scotland, UK Fax: +44-(131)-650-6899 Telephone: +44-(131)-650-3904 Email: msc-admissions(a)inf.ed.ac.uk **************** ALSO: PhD Positions Available **************** We also have a thriving PhD course. For more information, see: http://www.inf.ed.ac.uk/www/public/Courses/

1 0

CSL'99 Last CFP (Text & LaTex versions)
by Eva Ullan 19 Feb '99

19 Feb '99

____________________________________________________ My apologies if you receive this more than once! ____________________________________________________ ******************************************************** **** D E A D L I N E March 19, 1999 **** ******************************************************** =================================== LAST CALL FOR PAPERS -- CSL'99 Annual Conference of the European Association for Computer Science Logic September 20-25, 1999, Madrid, Spain =================================== CSL is the annual conference of the European Association for Computer Science Logic (EACSL). The conference is intended for computer scientists whose research activities involve logic, as well as for logicians working on issues significant for computer science. Suggested, but not exclusive, topics of interest include: * abstract datatypes, * automated deduction, * categorical and topological approaches, * concurrency theory, * constructive mathematics, * database theory, * domain theory, * finite model theory, * lambda and combinatory calculi, * logical aspects of computational complexity, * logical foundations of programming paradigms, * linear logic, * modal and temporal logics, * model checking, * program logics and semantics, * program specification, transformation and verification, * rewriting, * symbolic computation. PROGRAM COMMITEE Samson Abramsky (Edinburgh, UK) Marc Bezem (Utrecht, The Netherlands) Peter Clote (Munich, Germany) Hubert Comon (Cachan, France) Jorg Flum (Freiburg i.Br., Germany) (co-chair) Harald Ganzinger (Saarbrucken, Germany) Neil Immerman (Amherst, USA) Neil Jones (Copenhagen, Denmark) Jan Maluszynski (Linkoping, Sweden) Michael Maher (Brisbane, Australia) Catuscia Palamidessi (Pennsylvania, USA) Mario Rodriguez-Artalejo (Madrid, Spain) (co-chair) Wolfgang Thomas (Aachen, Germany) Jerzy Tiuryn (Warsaw, Poland) Glynn Winskel (Aarhus, Denmark) Martin Wirsing (Munich, Germany) SCIENTIFIC PROGRAMME In addition to invited lectures and contributed papers, there will be two tutorials on theorem proving and rewriting techniques, scheduled on September 24 afternoon (Friday) and September 25 morning (Saturday), immediately after the main conference. ** September 20--24, 1999: Invited Lectures and Contributed Papers The list of invited speakers will include: Jose Luis Balcazar (Barcelona, Spain) Javier Esparza (Munich, Germany) Martin Grohe (Freiburg, Germany) Peter D. Mosses (Aarhus, Denmark) V. Vianu (San Diego, USA) ** September 24--25, 1999: CSL Tutorials Douglas Howe (Bell Labs, USA) Aart Middeldorp (Tsukuba, Japan) LOCAL ORGANIZING COMMITTEE J. Carlos Gonzalez-Moreno Teresa Hortala-Gonzalez Javier Leach-Albert (chair) Paco Lopez-Fraguas Fernando Saenz-Perez Eva Ullan EACSL BOARD Marc Bezem (Utrecht, President) Ian Stewart (Leicester, Vice-President) Clemens Lautemann (Mainz, Treasurer) Peter Hajek (Prague) Simone Martini (Udine) Christine Paulin (Paris) Moshe Vardi (Houston) Johann Makowsky (Haifa) Alexander Razborov (Moscow) EACSL homepage: http://www.dimi.uniud.it/~eacsl IMPORTANT DATES Paper submissions March 19, 1999 Notifications of acceptance May 31, 1999 Final version due: July 12, 1999 CSL'99 main conference September 20-24, 1999 CSL'99 Tutorials September 24-25, 1999 PAPER SUBMISSIONS Submitted papers must be written in English and describe work not previously published. They must not be submitted concurrently to a journal or to another conference. Papers authored or coauthored by members of the Program Committee are not allowed. Submissions must not exceed 15 pages, including title page, figures, and references. The title page must contain: title and authors; physical and e-mail addresses; telephone and (if available) fax number for each author; identification of corresponding author, if not the first author; an abstract of no more than 200 words; a list of keywords. Submissions must arrive by March 19, 1999, and notifications of acceptance will be sent by May 31, 1999. Authors are invited to send manuscripts by electronic mail, as uuencoded gzipped postcript files: * see the conference home page for instructions http://mozart.sip.ucm.es:1580/csl99 * or send an empty message with subject "submission information'' to csl99org(a)eucmos.sim.ucm.es Those authors without access to the facilities for electronic submission can alternatively submit five hardcopies to: Prof. Mario Rodriguez Artalejo, CSL'99 Departamento de Sistemas Informaticos y Programacion Facultad de Matematicas, Universidad Complutense de Madrid Av. Complutense s/n E-28040 Madrid Spain E-mail: mario(a)sip.ucm.es Phone: +34 91 3 94 45 12 Fax: +34 91 3 94 46 07 PUBLICATION Papers accepted by the Program Committee must be presented at the conference and will appear in a proceedings volume, to be published by Springer Verlag in the "Lecture Notes in Computer Science" series. The second refereeing round which was requested in previous CSL editions before accepting a paper for publication in the proceedings, has been suppressed following the decision taken by the EACSL membership meeting held during CSL'98 (Brno, Czech Republic, August 25th 1998). Final versions of accepted papers will be due by July 12, 1999. The format for camera-ready manuscripts will be that of Springer LNCS; instructions can be found in the LNCS home page at: http://www.springer.de/comp/lncs/index.html ADDITIONAL INFORMATION CSL'99 home page: http://mozart.sip.ucm.es:1580/csl99 CSL'99 local organization: csl99org(a)eucmos.sim.ucm.es %%%%%%%%%%%%%%%%%%%%%% LATEX VERSION %%%%%%%%%%%%%% % 2nd Call for Papers, CSL'99. % Last revision: September 24, 1998. \documentstyle{article} \oddsidemargin 6pt \evensidemargin 6pt \marginparwidth 90pt \marginparsep 10pt \topmargin -30pt \headheight 12pt \headsep 25pt \footheight 12pt \footskip 30pt \columnsep 10.5pt \columnseprule 0pt \addtolength{\oddsidemargin}{-2.3cm} \setlength{\textwidth}{20cm} %{18.7cm} \addtolength{\topmargin}{-1cm} \setlength{\textheight}{27cm} \pagestyle{empty} \begin{document} % Heading \begin{center} {\large \bf 3rd CALL FOR PAPERS -- CSL'99} \end{center} \begin{center} {\Large \bf Annual Conference of the }\\[1.5ex] {\Large \bf European Association for Computer Science Logic} \end{center} \begin{center} {\large \bf Madrid, Spain, September 20-25, 1999} \end{center} \vspace*{0.15in} % Left column \parbox[t]{6.5cm}{%6.3cm \footnotesize \noindent {\bf Program Committee:} \vspace*{0.05in} \begin{tabular}{l} Samson Abramsky (Edinburgh, UK)\\ Marc Bezem (Utrecht, The Netherlands)\\ Peter Clote (Munich, Germany)\\ Hubert Comon (Cachan, France)\\ J\"{o}rg Flum (Freiburg i.Br., Germany) \\ \hspace{1cm} ({\bf co-chair})\\ Harald Ganzinger (Saarbr\"{u}cken, Germany)\\ Neil Immerman (Amherst, USA)\\ Neil Jones (Copenhagen, Denmark)\\ Jan Maluszynski (Link\"{o}ping, Sweden)\\ Michael Maher (Brisbane, Australia)\\ Catuscia Palamidessi (Pennsylvania, USA)\\ Mario Rodr\'{\i}guez-Artalejo (Madrid, Spain) \\ \hspace{1cm} ({\bf co-chair})\\ Wolfgang Thomas (Aachen, Germany)\\ Jerzy Tiuryn (Warsaw, Poland)\\ Glynn Winskel (Aarhus, Denmark)\\ Martin Wirsing (Munich, Germany)\\ \end{tabular} \vspace*{0.10in} \noindent {\bf Invited Speakers:} \vspace*{0.05in} \begin{tabular}{l} Jos\'{e} Luis Balc\'{a}zar (Barcelona, Spain)\\ Javier Esparza (Munich, Germany)\\ Martin Grohe (Freiburg, Germany)\\ Peter D. Mosses (Aarhus, Denmark)\\ V. Vianu (San Diego, USA) \end{tabular} \vspace*{0.10in} \noindent {\bf Tutorialists:} \vspace*{0.05in} \begin{tabular}{l} Douglas Howe (Bell Labs, USA)\\ Aart Middeldorp (Tsukuba, Japan) \end{tabular} \vspace*{0.10in} \noindent {\bf Local Organizing Committee:} \vspace*{0.05in} \begin{tabular}{l} J. Carlos Gonz\'{a}lez-Moreno\\ Teresa Hortal\'{a}-Gonz\'{a}lez\\ Javier Leach-Albert ({\bf chair})\\ Paco L\'{o}pez-Fraguas\\ Fernando S\'{a}enz-P\'{e}rez\\ Eva Ull\'{a}n \end{tabular} \vspace*{0.10in} \noindent {\bf EACSL Board:} \vspace*{0.05in} \begin{tabular}{l} Marc Bezem (Utrecht, President)\\ Ian Stewart (Leicester, Vice-President)\\ Clemens Lautemann (Mainz, Treasurer)\\ Peter Hajek (Prague)\\ Simone Martini (Udine)\\ Christine Paulin (Paris)\\ Moshe Vardi (Houston)\\ Johann Makowsky (Haifa)\\ Alexander Razborov (Moscow)\\ \end{tabular} \vspace*{0.15in} \noindent {\bf EACSL homepage:} \vspace*{0.05in} \begin{tabular}{l} http://www.dimi.uniud.it/\~{}eacsl \end{tabular} \vspace*{0.15in} \noindent {\bf Important Dates:} \vspace*{0.05in} \begin{tabular}{l} Paper submissions: \\ ~~~~ March 19, 1999 \\ Notifications of acceptance: \\ ~~~~ May 31, 1999 \\ Final version due: \\ ~~~~ July 12, 1999 \\ CSL'99 main conference: \\ ~~~~ September 20-24, 1999 \\ CSL'99 Tutorials: \\ ~~~~ September 24-25, 1999 \end{tabular} } % \end{parbox} % Right column. No blank line here! \parbox[t]{5mm}{ \rule[-22.0cm]{0.2mm}{22.5cm} } %\end{parbox} \begin{minipage}[t]{11.0cm}%{11.5cm} \small {\bf Aims and Scope of the Conference:} {\bf CSL} is the annual conference of the {\em European Association for Computer Science Logic} (EACSL). The conference is intended for computer scientistswhose research activities involve logic, as well as for logicians working on issues significant for computer science. Suggested, but not exclusive, topics of interest include: abstract datatypes, automated deduction, categorical and topological approaches, concurrency theory, constructive mathematics, database theory, domain theory, finite model theory, lambda and combinatory calculi, logical aspects of computational complexity, logical foundations of programming paradigms, linear logic, modal and temporal logics, model checking, program logics and semantics, program specification, transformation and verification, rewriting, symbolic computation. \vspace*{0.12in} \noindent {\bf Scientific Programme:} In addition to invited lectures and contributed papers, there will be two tutorials on theorem proving and rewriting techniques, scheduled on September 24 afternoon (Friday) and September 25 morning (Saturday), immediately after the main conference. \vspace*{0.12in} \noindent {\bf Paper Submissions:} Submitted papers must be written in English and describe work not previously published. They must not be submitted concurrently to a journal or to another conference. Papers authored or co-authored by members of the Program Committee are not allowed. Submissions must not exceed 15 pages, including title page, figures, and references. The title page must contain: title and authors; physical and e-mail addresses; telephone and (if available) fax number for each author; identification of corresponding author, if not the first author; an abstract of no more than 200 words; a list of keywords. Submissions must arrive by {\bf March 19, 1999}, and notifications of acceptance will be sent by {\bf May 31, 1999}. Authors are invited to send manuscripts by electronic mail, as uuencoded gzipped postcript files (see the conference home page for instructions, or send an empty message with subject ``submission information'' to csl99org(a)eucmos.sim.ucm.es) Those authors without access to the facilities for electronic submission can alternatively submit {\em five hardcopies} to: \vspace*{0.05in} \begin{tabular}{l} Prof. Mario Rodr\'{\i}guez-Artalejo, CSL'99 \\ Departamento de Sistemas Inform\'{a}ticos y Programaci\'{o}n \\ Facultad de Matem\'{a}ticas, Universidad Complutense de Madrid \\ Av. Complutense s/n ~~~~~~~~~~ Phone: +34 91 3 94 45 12 \\ E-28040 Madrid ~~~~~~~~~~~~~~~~~ Fax: +34 91 3 94 46 07 \\ Spain ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ E-mail: mario(a)sip.ucm.es \end{tabular} \vspace*{0.12in} \noindent {\bf Publication:} Papers accepted by the Program Committee must be presented at the conference and {\bf will appear in a proceedings volume}, to be published by Springer Verlag in the ``Lecture Notes in Computer Science'' series. The second refereeing round which was requested in previous CSL editions before accepting a paper for publication in the proceedings, has been suppressed following the decision taken by the EACSL membership meeting held during CSL'98 (Brno, Czech Republic, August 25th 1998). Final versions of accepted papers will be due by {\bf July 12, 1999}. The format for camera-ready manuscripts will be that of Springer LNCS; instructions can be found in the LNCS home page at http://www.springer.de/comp/lncs/index.html. \vspace*{0.12in} \noindent {\bf Important Remark:} The proceedings volume will be available at the conference. In order to enable this, the deadlines for paper submission and notification of acceptance have been slightly modified w.r.t. the announcement made in the 1st call for papers. \vspace*{0.15in} \noindent {\bf Additional Information:} \vspace*{0.05in} \begin{tabular}{ll} CSL'99 home page: & http://mozart.sip.ucm.es:1580/csl99 \\ CSL'99 local organization: & E-mail: csl99org(a)eucmos.sim.ucm.es \end{tabular} \end{minipage} \end{document}

1 0