From cat-dist Wed Apr 2 11:53:53 1997 Received: by mailserv.mta.ca; id AA20776; Wed, 2 Apr 1997 11:51:11 -0400 Date: Wed, 2 Apr 1997 11:51:10 -0400 (AST) From: categories To: categories Subject: Lectureships Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: O X-Status: Date: Wed, 2 Apr 1997 16:14:34 +0100 (BST) From: Matthew Hennessy Apologies for multiple copies of this email SCHOOL OF COGNITIVE AND COMPUTING SCIENCES Computer Science and Artificial Intelligence - 2 Lectureships Applications are invited for two lectureships in the Computer Science and Artificial Intelligence Subject Group with an expected start date of October 1997. Candidates for the first Lectureship should be able to show evidence of significant research achievement in any aspect of the Foundations of Computation. Candidates for the second Lectureship should be undertaking innovatory research in some aspect of Vision, Neural Computation or Evolutionary and Adaptive Systems. All candidates should be willing to teach in areas other than their research speciality. The appointments are planned on the Lecturer Grade A scale 15,593-20,424 per annum (under review). For exceptional candidates, an appointment on the Lecturer Grade B scale, 21,277-27,196 per annum (under review), may be considered. The posts can be discussed informally with Dr Hilary Buxton on (01273) 678569, email hilaryb@cogs.susx.ac.uk. Details of the School are available at http://www.cogs.susx.ac.uk. Application forms and further particulars are available from and should be returned to Sandra Jenks, Staffing Services, University of Sussex, Falmer Brighton, East Sussex, BN1 9RH. Tel: (01273) 606755, ext 3768. Email: S.Jenks@sussex.ac.uk. Closing date: Monday 21 April 1997. From cat-dist Thu Apr 3 13:41:58 1997 Received: by mailserv.mta.ca; id AA25763; Thu, 3 Apr 1997 13:40:17 -0400 Date: Thu, 3 Apr 1997 13:40:16 -0400 (AST) From: categories To: categories Subject: Third Special Australasian Issue of Theoretical Computer Science Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: O X-Status: Date: Thu, 03 Apr 1997 15:52:05 +1000 From: James Harland [Apologies if you receive multiple copies of this announcement.] Third Special Australasian Issue of Theoretical Computer Science ---------------------------------------------------------------- Call for Papers ---------------- The recent CATS'97 meeting in Sydney endorsed arrangements for a third special issue of the journal "Theoretical Computer Science" (TCS) devoted to work by anyone connected to Australia or New Zealand in some way. This includes expanded versions of papers presented at CATS'97, or some other recent and relevant conference in Australia or New Zealand, or papers of which at least one author is resident in Australia or New Zealand. The submission criteria are the same as for normal TCS papers, and can be found in any recent issue of TCS. If it should happen that there are more acceptable papers than can appear in the special issue, then the excess will appear in a regular issue of the journal. The deadline for submissions is 31st May, 1997. Papers should be submitted to: James Harland Department of Computer Science Royal Melbourne Institute of Technology GPO Box 2476V Melbourne, 3001 Victoria, Australia (e-mail jah@cs.rmit.edu.au) Please forward to any interested parties, not already listed. From cat-dist Fri Apr 4 15:40:07 1997 Received: by mailserv.mta.ca; id AA20801; Fri, 4 Apr 1997 15:38:43 -0400 Date: Fri, 4 Apr 1997 15:38:42 -0400 (AST) From: categories To: categories Subject: Article on "Higher dimensional group theory" Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: RO X-Status: Date: Fri, 4 Apr 1997 12:55:42 +0100 (BST) From: Ronnie Brown I have put on the web http://www.bangor.ac.uk/~mas010/hdaweb2.htm an article with the above title. This is intended to give general readers an idea of what this subject is about, so it is non technical, and that is why it has a link from the sculpture site. We want to inform scientists and young mathematicians of what is going on, and to get discussion of these ideas. The references could be enlarged and improved, and I would welcome suggestions on this. I would welcome comments on this article before submitting it for publication. Ronnie Prof R. Brown, School of Mathematics, University of Wales, Bangor Dean St., Bangor, Gwynedd LL57 1UT, United Kingdom Tel. direct:+44 1248 382474|office: 382475 fax: **(from Monday March 17, +44 1248 383663)** World Wide Web: home page: http://www.bangor.ac.uk/~mas010/ Symbolic Sculpture and Mathematics: http://www.bangor.ac.uk/~mas007/ Mathematics and Knots: http://www.bangor.ac.uk/ma/CPM/exhibit/welcome.htm From cat-dist Sat Apr 5 08:46:34 1997 Received: by mailserv.mta.ca; id AA12749; Sat, 5 Apr 1997 08:45:53 -0400 Date: Sat, 5 Apr 1997 08:45:53 -0400 (AST) From: categories To: categories Subject: BarrFest (Montreal) - 2nd notice Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: RO X-Status: Date: Fri, 4 Apr 1997 18:05:00 -0500 From: Robert A. G. Seely C --- R | / | CENTRE de RECHERCHE en THEORIE des CATEGORIES | / | CATEGORY THEORY RESEARCH CENTER T --- C CATEGORY THEORY BARRFEST: SECOND ANNOUNCEMENT McGill University, Montreal Thursday-Saturday, May 29-31, 1997 Dear Colleague, We invite you to join us in Montreal next May for a special three-day conference in honour of Michael Barr's sixtieth birthday. The meeting will take place the last three days of May. The following students, mentors, and friends of Mike have agreed to participate as invited speakers: Peter Chu, Jack Duskin, Peter Freyd, Murray Gerstenhaber, John Kennison, Jim Lambek, Fred Linton, Saunders MacLane, Michael Makkai, James Otto, John Power, Myles Tierney, Don VanOsdol, Charles Wells. We will have time for a limited number of other speakers. In keeping with the spirit of the conference, we ask that talks be concerned with one of the subjects to which Mike Barr has contributed: Homological algebra, triples, embeddings, exact catgeories, torsion theories, topos theory, topology, *-autonomous categories, universal algebra, logic, computer science, or linguistics. If you wish to give a talk, send your request as soon as possible to Tom Fox at the address below. The conference proceedings will be published in a special number of the Journal of Pure and Applied Algebra. We will meet in the Bronfman Building, 1001 Sherbrooke West. The first talk will be at 9:00, May 29th. Registration will take place the morning of the 29th from 8:30-9:00 and during the morning break. There will be a registration fee of $80 for faculty, $40 for students, including a dinner/party to be held Friday evening. Please let us know if you intend to join us by sending a short email to fox@triples.math.mcgill.ca, indicating whether or not you will bring a guest to the dinner. Below you will find a list of hotels and tourist rooms close to McGill. If you have any further questions, please contact Tom Fox or Robert Seely. CRTC Dept of Mathematics and Statistics McGill University 805 Sherbrooke West Montreal, Quebec CANADA H3A 2K6 Tom Fox fox@triples.math.mcgill.ca Robert Seely rags@triples.math.mcgill.ca ---------------------------------------------------------- Hotels: L'Appartement, 455 Sherbrooke W, 284-3634, $75 Howard Johnson Plaza, 475 Sherbrooke W, 842-3961, $79 (1-800-8423961) Citadelle, 410 Sherbrooke W, 844-8851, $89 Holiday Inn, 420 Sherbrooke W, 842-6111, $99 Hotel du Parc, 3625 Park Ave, 288-6666, $85 Versailles*, 1659 Sherbrooke W, 933-3611, $89 (B&B) Tourist Rooms: Ambrose, 3422 Stanley, 288-6922, $40-50 (excellent) Armor*, 151 Sherbrooke E, 285-0140, $38-70 Bienvenue B&B** 3950 Laval, 844-5897, $60-75 (1-800-2275897) Casa Bella, 258 Sherbrooke W, 849-2777, $40-65 Centre Ville B&B*, 3458 Laval, 289-9749, $40-55 Pierre*, 169 Sherbrooke E, 288-8519, $65 *15 minute walk from McGill **30 minute walk from McGill From cat-dist Wed Apr 9 11:36:07 1997 Received: by mailserv.mta.ca; id AA19255; Wed, 9 Apr 1997 11:34:17 -0300 Date: Wed, 9 Apr 1997 11:34:17 -0300 (ADT) From: categories To: categories Subject: PSSL 64, second announcement Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: O X-Status: Date: Tue, 8 Apr 1997 13:04:41 +0200 (MET DST) From: koslowj@iti.cs.tu-bs.de PERIPATETIC SEMINAR ON SHEAVES AND LOGIC 64th meeting - second announcement Just a reminder for those who haven't sent in their registration forms. Please do so before next week so we can make hotel reservations. The 64th meeting of the seminar will be held at the Department of Theoretical Computer Science of the Technical University in Braunschweig, Germany, over the weekend of May 10-11, 1997. The seminar welcomes talks using or addressing category theory or logic, either explicitly or implicitly, in the study of any aspect of mathematics or science. On Friday, May 9, 13:00, i.e., before the regular seminar, there will be an official Colloquium Talk by Maria Cristina Pedicchio on Exactness and Regularity for Locally Presentable Categories After that, we would like to invite those who arrive here early to visit the Herzog August Library in Wolfenb"uttel with its famous collection of medieval books. Gotthold Ephraim Lessing used to be a librarian there. Braunschweig is located about 60 km East of Hannover and can easily be reached by car or train. The closest airport is in Hannover; the airport bus to the Hannover train station takes about 20 minutes, and the train from there to Braunschweig takes about 40 minutes or less. We will send further information on the location of the seminar, along with details on local travel and accommodation to those who register, at least a week before the meeting. Jiri Adamek J"urgen Koslowski ------------------------------------------------------------------------------- Please return to J"urgen Koslowski , preferably before April 13. Postal address: Institut f"ur Theoretische Informatik TU Braunschweig Postfach 3329 D-38023 Braunschweig Germany I intend to come to the 64th meeting of the PSSL in Braunschweig * I intend to give a talk entitled ..................................... * I intend to visit the Herzog August Library on Friday afternoon * Please reserve accommodation for Thursday/Friday/Saturday/Sunday night(s) Name : Address: Email : Phone : *Delete if inapplicable -- J"urgen Koslowski % If I don't see you no more in this world ITI % I meet you in the next world TU Braunschweig % and don't be late! koslowj@iti.cs.tu-bs.de % Jimi Hendrix (Voodoo Child) From cat-dist Wed Apr 9 11:36:07 1997 Received: by mailserv.mta.ca; id AA16872; Wed, 9 Apr 1997 11:35:04 -0300 Date: Wed, 9 Apr 1997 11:35:04 -0300 (ADT) From: categories To: categories Subject: CSL'97 Deadline Approaching Fast Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: O X-Status: Date: Tue, 8 Apr 1997 13:11:58 +0200 (MET DST) From: Uffe Henrik Engberg ************************************************************************** ************************************************************************** ************************************************************************** ************* CSL'97 Deadline for Submissions ************* ************* ************* ************* April 15, 1997 ************* ************* ************* ************* LAST REMINDER ************* ************************************************************************** ************************************************************************** ************************************************************************** CSL '97 Annual Conference of the European Association for Computer Science Logic August 23-29, 1997 7 Aarhus, Denmark 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 topics significant for computer science. Submissions =========== Authors are invited to submit a draft or full paper (up to 12 pages). The cover page should include title, authors, and corresponding authors (name, address, phone/fax number, e-mail address). Electronic submissions are encouraged. Submission forms can be obtained from http://www.brics.dk/CSL97/subm.html or by sending an empty message with Subject: CSL submission form to: csl97-subm@brics.dk. Alternatively, five hardcopies should be sent to: Prof. Mogens Nielsen, CSL '97 Department of Computer Science University of Aarhus Phone: +45 8942 3260 Ny Munkegade, Bldg. 540 Fax: +45 8942 3255 DK-8000 Aarhus C, Denmark E-mail: csl97@brics.dk Deadline of Submission: April 15, 1997 Authors will be notified of acceptance for presentation at the conference by June 15, 1997. A preliminary version of the full paper to be submitted to the Proceedings volume (LNCS Springer-Verlag) should be available at the conference. Authors will be notified of acceptance of their paper by December 15, 1997. Students Grants =============== A limited number of grants to attend the Conference and the Tutorials are available for students. The grants will cover local expenses (accomodation at the nearby Youth Hostel and conference fee, including lunches and coffes during the conference, excursion and conference dinner). They will not cover travel expenses. The deadline for application is June 22, 1997. More informations about the meeting, the students grants, the EACSL Association as well as a full copy of the Call for Papers can be found at the conference URL: http://www.brics.dk/CSL97. From cat-dist Thu Apr 10 10:56:55 1997 Received: by mailserv.mta.ca; id AA23115; Thu, 10 Apr 1997 10:55:57 -0300 Date: Thu, 10 Apr 1997 10:55:57 -0300 (ADT) From: categories To: categories Subject: SAS'97 (Extended Deadline Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: O X-Status: Date: Thu, 10 Apr 1997 09:19:10 -0400 (EDT) From: pvh for conference Given the large number of requests for extensions, we decided to extend the deadline for submissions to April 22. This is a HARD deadline. /----------------------------------------------------------------/ CALL FOR PAPERS International Static Analysis Symposium (SAS'97) Paris, France, 8--10 September 1997 http://lix.polytechnique.fr/~radhia/sas97 Static Analysis is increasingly recognised as a fundamental tool for high performance implementations and verification systems of high-level programming languages. The last two decades have witnessed substantial developments in this area, ranging from theoretical frameworks to design, implementation, and application of analysers in optimising compilers. The Fourth International Static Analysis Symposium (SAS'97) will be held in Paris to celebrate the 20th anniversary of the publication of the seminal paper of Patrick and Radhia Cousot in the Proceedings of the Principles of Programming Languages Conference (POPL'77). Previous symposia were held in Namur, Glasgow, and Aachen. The technical program for SAS'97 will consist of invited lectures, tutorials, panels, presentations of refereed papers, and software demonstrations. Contributions are welcome on all aspects of Static Analysis, including, but not limited to Abstract Interpretation Optimising Compilers Complexity Theoretical Frameworks Experimental Evaluation Verification Systems Specific Analyses Type Inference Partial Evaluation Abstract Domains Submissions can address any programming paradigm, including concurrent, constraint, functional, imperative, logic and object-oriented programming. Survey papers that present some aspect of the above topics with a new coherence are also welcome. Papers must be written in English, must not exceed 15 pages (excluding references and figures), and must contain a cover page containing the following: a 200-word abstract, keywords, postal and electronic mailing addresses, and phone numbers and fax numbers of one of the authors. Submissions should arrive by APRIL 7, 1997 either by email (a Postscript file) or by post (six paper copies) at the address Post: Pascal Van Hentenryck Department of Computer Science Box 1912 115 Waterman St. 4th floor Providence, RI 02906 Email: sas97@cs.brown.edu Phone: + 1 401 863 76 34 Fax: + 1 401 863 76 57 Electronic submission is preferred, but do ensure that your submission is self-contained and prints on A4 paper. At the time of submission a message containing an ASCII or LATEX version of the paper's cover page should be sent by email and all electronic submissions will be acknowledged. Authors will be notified of the acceptance or rejection of their papers by JUNE 2, 1997. Final versions of the accepted papers must be received in camera-ready form by JUNE, 23 1997. The proceedings will be published by Springer-Verlag in the LNCS series. Conference Chair: R. Cousot (CNRS & Polytechnique) Program Chair: P. Van Hentenryck (Brown) Program Committee: F. Bourdoncle (Mines, Paris) M. Bruynooghe (Leuven) A. Cortesi (Venice) S. Debray (Arizona) A. Deutsch (INRIA) R. Giacobazzi (Pisa) C. Hankin (Imperial College) N. Halbwachs (Grenoble) L. Hendren (McGill) F. Henglein (DIKU) D. Le Me'tayer (INRIA/IRISA) T. Marlowe (Seton Hall) J. Palsberg (Purdue) W. Winsborough (Penn State) Invited Speakers: P. Cousot W. Harrison N. Jones B. Le Charlier K. Marriott B. Ryder Important Dates: Hard Deadline: 22 April Notification: 2 June Final Version: 23 June From cat-dist Thu Apr 10 16:35:14 1997 Received: by mailserv.mta.ca; id AA01854; Thu, 10 Apr 1997 16:34:26 -0300 Date: Thu, 10 Apr 1997 16:34:26 -0300 (ADT) From: categories To: categories Subject: Preprint available. Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: O X-Status: Date: Thu, 10 Apr 1997 17:04:46 +0100 From: Marcelo Fiore The following preprint is available at http://www.dcs.ed.ac.uk/home/mf/ADT/ as cub.dvi and cub.ps. Best, Marcelo. Complete Cuboidal Sets in Axiomatic Domain Theory Marcelo Fiore Gordon Plotkin John Power Department of Computer Science Laboratory for Foundations of Computer Science University of Edinburgh, The King's Buildings Edinburgh EH9 3JZ, Scotland Synopsis We study the enrichment of models of axiomatic domain theory. To this end, we introduce a new and broader notion of domain, viz. that of complete cuboidal set, that complies with the axiomatic requirements. We show that the category of complete cuboidal sets provides a general notion of enrichment for a wide class of axiomatic domain-theoretic structures. Cuboidal sets play a role similar to that played by posets in the traditional setting. They are the analogue of simplicial sets but with the simplicial category enlarged to the cuboidal category of cuboids, i.e. of finite products O_n1 x ... x O_ni of finite ordinals. These cuboids are the possible shapes of paths. A cuboidal set P has a set P(C) of paths of every shape C = n1 x ... x ni; indeed, it is a (rooted) presheaf over the cuboidal category. The set of points of P is P(O_1). The set of (one-dimensional) paths of length n is P(O_n+1); they can be thought of as (linear) computations conditional on the occurrence of n linearly ordered events e_1 < ... < e_n. Evidently, O_n is the partial order associated to this simple linear event structure, and can be considered as a sequential process of length n. At higher dimensions, P(O_n1 x ... x O_ni) can be thought of as the set of computations conditional on the occurrence of n_1 + ... + n_i events ordered by e_1,1 < ... < e_1,n1 ; ... ; e_i,1 < ... < e_i,ni. This is the event structure which can be considered as i sequential processes, of respective lengths O_n1, ..., O_ni, running concurrently. Complete cuboidal sets are cuboidal sets equipped with a formal-lub operator satisfying three algebraic laws, which are exactly those needed of the lub operator in order to prove the fixed-point theorem. Computationally, the passage from cuboidal sets to complete cuboidal sets corresponds to allowing infinite processes. In fact, the formal-lub operator assigns paths of shape C to `paths of shape C x omega', for every C. Here the set of paths of shape C x omega is the colimit of the paths of shape C x O_n; such paths can be thought of as the higher-dimensional analogue of the increasing sequences of traditional domain theory. From cat-dist Sat Apr 12 16:02:13 1997 Received: by mailserv.mta.ca; id AA06208; Sat, 12 Apr 1997 16:01:01 -0300 Date: Sat, 12 Apr 1997 16:01:01 -0300 (ADT) From: categories To: categories Subject: new preprint available Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: RO X-Status: Date: Sat, 12 Apr 97 16:40:29 +1000 From: Max Kelly A LaTeX preprint of the paper "On the monadicity over graphs of categories with limits", by G.M. Kelly and I.J. Le Creurer, and to appear in Cahiers de Topologie et Ge'om. Diff. Cate'goriques, is in our public site sydcat at maths.usyd.edu.au (=129.78.68.2), in the directory sydcat/papers/kelly, as the file named monograph.tex . I presume I already announced another comparatively-recent preprint there: to wit, the file jk.tex contains "The Reflectiveness of Covering Morphisms in Algebra and Geometry", by G. Janelidze and G.M. Kelly, which is still with the referee. Max Kelly. From cat-dist Sun Apr 20 18:17:53 1997 Received: by mailserv.mta.ca; id AA26743; Sun, 20 Apr 1997 18:16:28 -0300 Date: Sun, 20 Apr 1997 18:16:28 -0300 (ADT) From: categories To: categories Subject: Summer School on Games and Computation Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: O X-Status: Date: Fri, 18 Apr 1997 18:14:45 +0100 From: Samson Abramsky MATHFIT SUMMERSCHOOL IN EDINBURGH GAMES AND COMPUTATION Laboratory for the Foundations of Computer Science JUNE 23-24 1997 The use of games to model various aspects of computation has been notably successful over the past few years. In particular, two areas where there has been rapid progress recently are: game semantics and its applications to programming languages and logic; and the use of games in verifying properties of concurrent processes. Game semantics has been used to give the first syntax-independent constructions of fully abstract models for functional languages such as PCF and FPC (Abramsky,Jagadeesan and Malacaria, Hyland and Ong, Nickau, McCusker), for imperative languages such as Idealized Algol (Abramsky and McCusker), and for languages with non-local control operators such as call-cc (Ong, Laird). There are promising applications to object-oriented languages in progress. In the area of concurrency, games have been used to explicate bisimulation and proof-search in the modal mu-calculus (Stirling). This has been applied to the Edinburgh Concurrency Workbench by Perdita Stevens, and has resulted in improvements to the efficiency of the implementation. SPEAKERS Samson Abramsky, Edinburgh University Martin Hyland, Cambridge University Perdita Stevens, Edinburgh University Colin Stirling, Edinburgh University Wolfgang Thomas, Christian-Albrechts University, Kiel GRANTS A small number of grants for the Summer School are available for PhD students. Further information and registration forms can be found at: http://www.dcs.ed.ac.uk/home/cps/school.html The Summer School is supported by the U.K. Engineering and Physical Sciences Research Council and the London Mathematical Society. Samson Abramsky and Colin Stirling From cat-dist Wed Apr 16 17:20:34 1997 Received: by mailserv.mta.ca; id AA25149; Wed, 16 Apr 1997 17:19:26 -0300 Date: Wed, 16 Apr 1997 17:19:26 -0300 (ADT) From: categories To: categories Subject: protected files Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: O X-Status: Date: Mon, 14 Apr 97 15:20:49 +1000 From: Max Kelly Several readers have pointed out that the new files monograph.tex and jk.tex, whose availability on our site sydcat I announced the other day were protected; this oversight has now been corrected, Max Kelly. From cat-dist Wed Apr 16 17:21:51 1997 Received: by mailserv.mta.ca; id AA21992; Wed, 16 Apr 1997 17:21:41 -0300 Date: Wed, 16 Apr 1997 17:21:41 -0300 (ADT) From: categories To: categories Subject: ICCL'98: Preliminary Call For Papers Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: O X-Status: Date: Mon, 14 Apr 1997 17:17:44 -0500 From: Christopher Colby PRELIMINARY CALL FOR PAPERS IEEE Computer Society 1998 International Conference on Computer Languages Loyola University Chicago Chicago, USA, 14-16 May 1998 Sponsored by the IEEE Computer Society Technical Committee on Computer Languages, and by ACM Special Interest Group on Programming Languages This is the sixth in a series of conferences devoted to all aspects of computer languages, serving to bring together people broadly interested in machine processable descriptions. The hallmarks of ICCL are diversity, openness to a wide range of linguistic research, and international representation. The focus is on new ideas in languages and language technology which are innovative or experimental in nature. Papers are sought that describe significant new theoretical or experimental results in the design, evaluation or implementation of programming/specification languages. Areas of particular interest include but are not limited to: * Implementation, optimization * Theory, semantics * Abstract interpretation, flow analysis * Partial evaluation * Parallel and distributed languages * Object-oriented languages * Functional and logic languages * Multiparadigm languages * Real-time and fault-tolerant languages * Requirements, design, and specification languages * Internet programming languages * Domain-specific languages Papers should be at most 20 double-spaced pages in length, should have an abstract of 250 words, and a separate cover page indicating the title, authors, and a list of keywords. Papers will be judged on the basis of their relevance, significance, originality, correctness, and clarity. Accepted papers will appear in a full proceedings published by the IEEE Computer Society Press, for which authors will be expected to sign a copyright release form. Papers may be submitted electronically by sending an e-mail containing a platform-independent PostScript file (which can be printed on A4 and/or on 11" x 8.5" paper) to the address iccl98@csc.ncsu.edu, or by sending 5 copies of papers to Purush Iyer, program committee co-chair, at the address below. Submissions should be accompanied by a cover letter that includes a return mailing address, telephone number and email address. The papers are due by Oct 1, 1997. Authors will be notified of acceptance or rejection by Jan 20, 1998. Camera ready versions of accepted papers will be due Feb 15, 1998. On the day prior to the Conference, a workshop on Internet programming languages is being planned by Henri Bal (bal@cs.vu.nl) and Boumediene Belkhouche (bb@eecs.tulane.edu); details for this and other pre-conference activities will be publicized in a separate announcement. PROGRAM COMMITTEE CO-CHAIRS CONFERENCE CHAIR Purush Iyer Young-il Choo David Schmidt Dept of Computer Gifford-Fong Computing and Info. Science Associates Sciences Dept. North Carolina State yic@gfa-genesis.com Nichols Hall 234 University Kansas State University Raleigh, NC 27695-8206 Manhattan, KS 66506, USA Tel: +1 919-515-7291 Tel: +1-913-532-6350 Fax: +1 919-515-2878 Fax: +1-913-532-7353 purush@csc.ncsu.edu schmidt@cis.ksu.edu PROGRAM COMMITTEE Henri Bal (Vrije University, NL) Boumediene Belkhouche (Tulane University, US) Young-Il Choo (Gifford-Fong Associates, US) Radhia Cousot (CNRS, Ecole Polytechnique, FR) Pascal Fradet (IRISA, FR) Dan Friedman (Indiana University, US) Rajiv Gupta (University of Pittsburgh, US) Laurie Hendren (McGill University, CA) Fritz Henglein (DIKU, DK) Purush Iyer (NC State University, US) Joxan Jaffar (National University of Singapore, SG) Kim Marriott (Monash University, AU) Martin Odersky (University of South Australia, AU) Jens Palsberg (Purdue University, US) Uday Reddy (University of Illinois, Urbana, US) John Reppy (AT&T Research, US) Tom Reps (University of Wisconsin, US) Jeremy Gibbons (Oxford Brookes University, UK) Dave Schmidt (Kansas State University, US) Bernhard Steffen (University of Passau, DE) LOCAL ARRANGEMENTS CHAIR STEERING COMMITTEE Konstantin Laufer Joseph Urban (Chair), Arizona State Univ., USA Loyola University Boumediene Belkhouche, Tulane University, USA Chicago, IL, USA Pei Hsia, University of Texas, Arlington, USA From cat-dist Wed Apr 16 17:23:27 1997 Received: by mailserv.mta.ca; id AA22955; Wed, 16 Apr 1997 17:23:24 -0300 Date: Wed, 16 Apr 1997 17:23:24 -0300 (ADT) From: categories To: categories Subject: 4th WoLLIC'97 - third call Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: RO X-Status: Date: Wed, 16 Apr 1997 09:28:19 -0300 From: ruy@di.ufpe.br [An HTML version of the Call for Contributions is available via the WoLLIC'97 web page at http://www.di.ufpe.br/~wollic97 The usual apologies apply if you receive multiple copies of this message.] Third Call for Contributions 4th Workshop on Logic, Language, Information and Computation (WoLLIC'97) August 20-22, 1997 ! NEW TUTORIALS >> (Tutorial Day: August 19th) << NEW TUTORIALS ! Fortaleza (Ceara'), Brazil The "4th Workshop on Logic, Language, Information and Computation" (WoLLIC'97) will be held in Fortaleza, Ceara' (Brazil), from August 20th to 22nd 1997. Contributions are invited in the form of two-page (600 words) abstracts in all areas related to logic, language, information and computation, including: pure logical systems, proof theory, model theory, algebraic logic, type theory, category theory, constructive mathematics, lambda and combinatorial calculi, program logic and program semantics, logics and models of concurrency, nonclassical logics, nonmonotonic logic, logic and language, discourse representation, logic and artificial intelligence, automated deduction, foundations of logic programming, logic and computation, and logic engineering. There will be a number of guest speakers, including: Keith Devlin (St.Mary's Coll), Abbas Edalat (Imperial Coll), Rob van Glabbeek (Stanford Univ), Yuri Gurevich (Michigan Univ), Peter Johnstone (Cambridge Univ), Roman Kossak (CUNY), Daniel Lehmann (Jerusalem Univ), Drew McDermott (Yale Univ), Michael Moortgat (Utrecht Univ), Moshe Vardi (Rice Univ), Paulo Veloso (PUC-Rio). Submission: Two-page abstracts, preferably by e-mail to *** wollic97@di.ufpe.br *** must be RECEIVED by JUNE 1st, 1997 by one of the Co-Chairs of the Organising Committee. Authors will be notified of acceptance by July 1st, 1997. The 4th WoLLIC'97 is under the official auspices of the Interest Group in Pure and Applied Logics (IGPL), The European Association for Logic, Language and Information (FoLLI), and co-sponsored by the Association for Symbolic Logic (ASL), and the Sociedade Brasileira de Computacao (SBC). Abstracts will be published in the Journal of the IGPL (ISSN 0945-9103) (Oxford University Press) as part of the meeting report. Selected contributed papers will be invited for submission (in full version) to a special issue of the Journal of the IGPL (http://www.mpi-sb.mpg.de/igpl/Journal). The location: Located near the equatorial line in the northeastern coast of Brazil, Fortaleza, the capital of the state of Ceara', lies by the beach between the Ceara' and the Coco' rivers, in the middle of 570km (360mi) of sandy beaches of the State's coast. The hightest point in the city is only 30m (100ft) high and its beach front is formed of sand dunes up to 10m high and coconut trees. The weather is dry and sunny. A permanent breeze comes from the ocean and keeps the air clean and healthy while the temperature rests on a nice level year around. The lack of rain during most of the year, now a blessing for the visitors, prevented a definitive settlement in the area of Fortaleza until the middle of the 17th century. At that time, need to assure the hold of the land, the Portuguese established the "Fortaleza de Nossa Senhora da Assuncao" in the same place where a hundred years before the dutch had built the Schoonenbroch Fort. Fortaleza, named after the fortress, has been since then an important trading center and an artistic and cultural center of the country. (http://www.bec.hosting.ibm.com/pagina/ifortale.html) Programme Committee: A. Avron (Tel-Aviv Univ., Israel), J. van Benthem (ILLC, Amsterdam), W. A. Carnielli (UNICAMP, Campinas), N. da Costa (USP, Sao Paulo), I. Hodkinson (Imperial College, London), L. Moss (Indiana Univ., Bloomington), V. de Paiva (Birmingham Univ., UK), T. Pequeno (UFC, Fortaleza), R. de Queiroz (UFPE, Recife), P. Veloso (PUC, Rio). Organising Committee: M. Aragao (UFC), F. Carvalho (UFC), A. T. C. Martins (UFC), H. Nogueira (UFC), A. G. de Oliveira (UFBA/UFPE), M. Pequeno (UFC) (Chair), T. Pequeno (UFC), R. de Queiroz (UFPE), W. Vasconcelos (UECE). For further information, contact the Co-Chairs of the Organising Committee: Ruy de Queiroz, Departamento de Informatica, Univ. Federal de Pernambuco, CP 7851, Recife, PE 50732-970, Brazil, e-mail: ruy@di.ufpe.br, tel.: +55 81 271 8430, fax: +55 81 271 8438. Marcelino Pequeno, Laboratorio de Inteligencia Artificial, Univ. Federal do Ceara', CP 12166, Fortaleza, CE 60455-760, Brazil, e-mail: marcel@lia.ufc.br, tel.: +55 85 287 1333, fax: +55 85 288 9845. Web homepage: http://www.di.ufpe.br/~wollic97 From cat-dist Thu Apr 24 15:24:16 1997 Received: by mailserv.mta.ca; id AA07047; Thu, 24 Apr 1997 15:22:50 -0300 Date: Thu, 24 Apr 1997 15:22:50 -0300 (ADT) From: categories To: categories Subject: TCS Special Issue: Proof-search in Type-theoretic Languages. Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: O X-Status: Date: Tue, 22 Apr 1997 16:47:40 +0100 (BST) From: David Pym [Apologies for multiple copies of this message.] Dear Colleague, This message is to remind you that a special issue of TCS dedicated to the topic "Proof-search in type-theoretic languages" has been announced, with Didier Galmiche and I as guest editors. Following some requests, we have delayed the submission deadline. So, please find enclosed the corresponding last call for papers. The new (and firm) submission deadline is 15 September, 1997. Prospective contributors are warmly invited to contact either of the guest editors to discuss the suitability of topics and papers. The submissions should satisfy the usual standards of scholarship, originality and high-quality of the TCS journal. Kind regards, David Pym ------------------------------------------------------------------------------ ******************************************************************* * * * 2nd Call for Papers --- Submission Deadline Extended to * * 15 September, 1997 * * * ******************************************************************* Special Issue of Theoretical Computer Science (TCS) (Editor-in-Chief: M. Nivat) on ******************************************** * Proof-search in Type-theoretic Languages * ******************************************** Guest Editors: Didier Galmiche David Pym CRIN-CNRS & UHP Nancy 1 Queen Mary & Westfield College Nancy, France University of London Algorithmic proof-search is a fundamental enabling technology throughout artificial intelligence and computer science. There is a long history of work in proof-search in a variety of systems of logic, including classical, intuitionistic, relevant, linear and modal systems, at the propositional, first- and higher-order levels. Such work has ranged from the most abstract to the most practical and has employed the full spectrum of logical techniques, from proof theory, model theory and recursion theory. Recently, there has been a great deal of work on proof-search in type-theoretic languages. Such languages can be thought of as logical frameworks to represent proofs and to formalize connections between proofs and programs. Two recent workshops on "Proof-search in Type-theoretic Languages" (Nancy, 1994 and Rutgers University, NJ, 1996) have provide exchanges of ideas and experiences in topics concerned with proof-search in type theory, logical frameworks and their underlying (e.g., classical, intuitionistic, linear) logics. Here again, the scope of languages studied and techniques employed has been wide, stretching to include algebraic and categorical methods. From the computational point of view, the type-theoretic component of logical languages, which may involve propositional, first-order, higher-order or polymorphic assignment regimes, introduces significant challenges for both theoreticians and implementors. *************** * TOPICS * *************** Topics of interest include, but are not restricted to: * Natural deduction, sequent calculi systems for type-theoretic languages. Based-on tableaux, matrix or resolution methods for proof-search in type-theoretic languages. * Semantic techniques in proof-search. Search vs. deduction as the basis of logic; consequences for model theory * Theorem proving and program development with type-theoretic languages: concepts, techniques, implementation and experimentation * Logic programming in type-theoretic languages as search-based computation; integration of model-theoretic semantics and imperative aspects of logic programming * Operational semantics and proof theory of search-based computation. Denotational semantics and model theory of search-based computation. * Complexity of search problems in type-theoretic languages; comparisons with non-type-theoretic systems. *************** * SUBMISSIONS * *************** Prospective contributors are warmly invited to contact either, or both, of the guest editors (see addresses below) to discuss the suitability of topics and papers. The submissions should satisfy the usual standards of scholarship, originality and high-quality of the TCS journal. * SUBMISSION DEADLINE ********************** The new submission deadline is * 15 September, 1997 * ********************** * SUBMISSION FORMAT Please submit either 4 paper copies or, preferably, a postscript file to either of the addresses given below. * SUBMISSION ADDRESSES Either: Didier Galmiche, CRIN-CNRS & UHP Nancy 1, Batiment LORIA, Campus Scientifique, B.P. 239, 54506 Vandoeuvre-les-Nancy France Didier.Galmiche@loria.fr Tel: +33 (0)3 83 59 20 15 Fax: +33 (0)3 83 41 30 79 WWW: http://www.loria.fr/~galmiche or: David Pym, Department of Computer Science, Queen Mary and Westfield College, University of London, Mile End Road, London E1 4NS, England U.K. pym@dcs.qmw.ac.uk Tel: +44 (0)171 975 5237 Fax: +44 (0)181 980 6533 WWW: http://www.dcs.qmw.ac.uk/~pym ------------------------------------------------------------------------------ From cat-dist Thu Apr 24 15:24:46 1997 Received: by mailserv.mta.ca; id AA29990; Thu, 24 Apr 1997 15:24:39 -0300 Date: Thu, 24 Apr 1997 15:24:39 -0300 (ADT) From: categories To: categories Subject: preprint available Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: O X-Status: Date: Tue, 22 Apr 1997 21:26:04 +0200 (METDST) From: Anders Kock The article: "Geometric Construction of the Levi-Civita Parallelism" by Anders Kock is available from ftp://ftp.mi.aau.dk/pub/kock/parallel.ps (about 150 kb). (The Levi-Civita Parallellism is also called the Riemannian Connection; it is the unique symmetric affine connection compatible with a given Riemannian metric. We present a geometric construction of it, using variational principles and synthetic differential geometry.) From cat-dist Thu Apr 24 15:28:41 1997 Received: by mailserv.mta.ca; id AA31635; Thu, 24 Apr 1997 15:28:34 -0300 Date: Thu, 24 Apr 1997 15:28:34 -0300 (ADT) From: categories To: categories Subject: Notes of two lectures Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Content-Transfer-Encoding: QUOTED-PRINTABLE Status: O X-Status: Date: Thu, 24 Apr 1997 15:37:19 +1100 From: Ross Street This is to announce the placement on the WWW of the notes of my two lectures at the Conference on Higher Category Theory and Mathematical Physics, Northwestern University (Evanston, Illinois; 28-30 March 1997). The site is: [I have tried to eliminate offending fonts and to accommodate funny US paper size. Thanks to Sjoerd Crans for helping here.] Title: The role of Michael Batanin's monoidal globular categories Lecture I: Globular categories and trees Lecture II: Higher operads and weak omega-categories This is a report on recent work of Michael Batanin. The goal of his work is to provide an environment for defining the concepts associated with weak omega-categories and for developing the ensuing theory. The approach is "globular". To put this in context, I might mention some important steps in the development of weak omega-categories. Categories were defined by Eilenberg-Mac Lane in 1945. Monoidal and symmetric monoidal categories were defined by Mac Lane in 1963. Ehresmann defined (strict) n-categories in 1966. B=E9nabou defined bicategories in 1967. In the early 80s, monoidal bicategories were in the air but a full definition was not published in that period. Joyal-Street defined braided monoidal categories in 1985. Gordon-Power-Street defined tricategories in 1991 (this, and the coherence theorem, were published in 1995). Braided monoidal categories were defined by Kapranov-Voevodsky-Baez-Neuchl-Breen around 1993. Trimble produced a definition of tetracategory in 1995. Diverse approaches to weak n-categories for all n have appeared. Street (1985) suggested a simplicial definition with horn filler conditions. Trimble (1994) approached the problem using operads and Stasheff associahedra. Baez-Dolan (1995) have a definition using typed operads and opetopes. Tamsamani (1996) gave a multisimplicial definition. Batanin uses higher operads and globular sets. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Ross Street email: street@mpce.mq.edu.au Mathematics Department phone: +612 9850 8921 Macquarie University fax: +612 9850 8114 Sydney, NSW 2109 Australia Internet: http://www.mpce.mq.edu.au/~street/ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ From cat-dist Thu Apr 24 15:30:23 1997 Received: by mailserv.mta.ca; id AA29542; Thu, 24 Apr 1997 15:30:16 -0300 Date: Thu, 24 Apr 1997 15:30:16 -0300 (ADT) From: categories To: categories Subject: Call for contributions Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: O X-Status: Date: Thu, 24 Apr 1997 10:32:32 +0200 From: Pino Rosolini [An HTML version of the Call for Contributions is available at http://www.disi.unige.it/conferences/new-trends97/ Apologies if you receive copies of the message.] Call for Contributions NEW TRENDS IN SEMANTICS Satellite Workshop to ICALP '97 July 4-5, 1997 Bologna, Italy The purpose of the workshop is to gather researchers in the field of semantics of programming languages and to investigate new developments. Special emphasis will be given to game semantics. Contributions are invited in the form of a short abstract on topics related to semantics of computations. We welcome contributions about novel applications to semantics from areas such as type theory, category theory, domain theory, logic, as well as others. Invited speakers are Samson Abramsky, LFCS, Edinburgh Vincent Danos, Paris VII Andre` Joyal, Univ. de Quebec, Montreal Davide Sangiorgi, INRIA, Sophia-Antipolis The next announcements will be distributed electronically only to those who will have so requested. Please, send the appended form to ntis97@athena.disi.unige.it. Submission: Fill in the form appended below with information about title and abstract, and send it, preferably by e-mail, to ntis97@athena.disi.unige.it by May 22, 1997. A provisional programme will be drawn and distributed on May 25, before the deadline for early registration at ICALP, trying to include as many talks as time permits. The programme will then be finalized by May 30 -- we intend to allow for late submissions if slots in the programme remain available after May 25. Organizing committee: Andrea Asperti (Bologna) asperti@cs.unibo.it Eugenio Moggi (Genova) moggi@disi.unige.it Giuseppe Rosolini (Genova) rosolini@disi.unige.it Information about the workshop or about accomodation in Bologna can be found at the URL above. For further information, please contact G. Rosolini or Renza Morino R. Morino G. Rosolini tel: +39 (0)10 3536965 tel: +39 (0)10 3536630 fax: +39 (0)10 3536960 fax: +39 (0)10 3536699 email: morino@dima.unige.it email: rosolini@disi.unige.it address: DIMA, Univ. di Genova, via Dodecaneso 35, 16146 Genova, Italy ---------MAIL ASAP TO ntis@athena.disi.unige.it-------------- Name: Address: email: URL (if available): I would like to receive future announcements about the workshop. I would like to give a talk entitled: which should last (15/25/40 minutes, please specify). Abstract: From cat-dist Mon Apr 28 07:29:28 1997 Received: by mailserv.mta.ca; id AA09760; Mon, 28 Apr 1997 07:28:01 -0300 Date: Mon, 28 Apr 1997 07:28:01 -0300 (ADT) From: categories To: categories Subject: weak \omega-categories Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: RO X-Status: Date: Fri, 25 Apr 1997 14:56:43 +1100 From: Olga Batanin The preprint version of my paper "Monoidal globular categories as a natural environment for the theory of weak n-categories" is now available. The dvi file is at http://www-math.mpce.mq.edu.au/~mbatanin/coh0.dvi Please, contact me if you have any difficulties with printing it out. I can mail hard copies. Michael Batanin. Abstract. The paper is devoted to the problem of defining weak $\omega$-categories. The definition presented here is based on a nontrivial generalization of the apparatus of operads and their algebras, originally developed by P.May \cite{May} for the needs of algebraic topology. Yet, for the purposes of higher order category theory, a higher dimensional notion of operad is required. Briefly, the idea of a higher operad may be explained as follows. An ordinary non-symmetric operad in $Set$ associates a set $A_{n}$ to every integer $n$. The set of integers may be interpreted as the set of $1$-cells in the free category generated by one object and one nonidentity endomorphism of this object. To find a higher order generalization of the notion of operad we have to describe the free strict $\omega$-category generated by one object and one nonidentity endomorphism of this object and one nonidentity endomorphism of this endomorphism and so on (so, for example, the set of integers is the one-dimensional part of this category). The required $\omega$-category $Tr$ will be the category of planar trees of a special type. The $k$-th composition of cells will be given by the colimit of the diagram of trees over a special tree $M_{n}^{k}$. The other component of the theory of operads is an appropriate monoidal category (with some extrastructure like braiding or symmetry) where one can consider the notion of operad. We need also a monoidal category (perhaps, with extrastructure as well) where one can define the notion of algebra for an operad. Finally, the corresponding coherence theorems for both types of monoidal categories are required. I call all these components a natural environment for a given theory of operads. One of my main goals was to find a natural environment for the theory of higher order operads. For this I introduce monoidal globular categories and show they are suitable for the development of the theory of higher order operads. The crucial point here is a coherence theorem for monoidal globular categories (section 4) which includes as special cases the coherence theorems for monoidal, symmetric monoidal, and braided monoidal categories and a sort of pasting theorem for $\omega$-categories. A primary example of a globular monoidal category is the globular category of $n$-spans $Span$. The $0$-spans are just the sets. The $1$-spans are the spans in $Set$ in the usual sense. In some informal sense, an $n$-span is a relation between two $(n-1)$-spans. This globular monoidal category plays the same role for higher-order category theory as the category of sets does for ordinary category theory. These results allow me to formulate the notion of higher order operad. An $\omega$-operad will associate an $n$-span to every $n$-cell in $Tr$ for every $n\ge 0$.} There are also the units and multiplications and some axioms for these operations. The category of non-symmetric operads (in the category of sets) is just a one-dimensional subcategory of the category of $\omega$-operads. Finally, Iintroduce a notion of a contractible $\omega$-operad, So the main definition is: A weak $\omega$-category is a globular set together with the structure of algebra over a universal contractible $\omega$-operad. I construct also a fundamental $n$-groupoid functor from topological spaces to the category of weak $n$categories for all $n$ including $\omega$ and consider another examples of weak $n$-categories, hifger operads and their algebras. From cat-dist Mon Apr 28 07:59:07 1997 Received: by mailserv.mta.ca; id AA10444; Mon, 28 Apr 1997 07:58:27 -0300 Date: Mon, 28 Apr 1997 07:58:27 -0300 (ADT) From: categories To: categories Subject: AMAST'97 CFP Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: RO X-Status: Date: Mon, 28 Apr 1997 00:20:07 +1000 From: Michael Johnson AMAST'97 (Algebraic Methodology and Software Technology) particularly welcomes papers in category theory as a foundation for computer science, and as a tool in software engineering. If you would like to submit, but may have trouble meeting the May 15 deadline, please contact mike.johnson@mq.edu.au as soon as possible. ------------------------------------------------------------------- Final Call for Papers Sixth International AMAST Conference AMAST '97, December 13-17, 1997, Sydney, Australia. ------------------------------------------------------------------- Goals The major goal of the AMAST Conferences is to put software development technology on a firm, mathematical foundation. Particular emphasis is given to algebraic and logical foundations of software technology. An eventual goal is to establish algebraic and logical methodologies as practically viable and attractive alternatives to the prevailing approaches to software engineering. Previous meetings of AMAST were held in Iowa (1989 and 1991), Twente, Holland (1993), Montreal (1995) and Munich (1996). During these meetings, AMAST has attracted an international spread of researchers and practitioners interested in software technology, programming methodology and their algebraic and logical foundations. In addition, the first day of each conference has been dedicated to Mathematics Education for Software Engineers. Following this successful trend, the sixth AMAST International Conference will be held at Macquarie University, Sydney, Australia, from December 13 to December 17, 1997. ------------------------------------------------------------------- Submissions As in the previous years we invite papers reporting original research in algebra and logic, suitable as a foundation for software technology, as well as software technologies developed by means of logic and algebraic methodologies. Submissions should not have been published and should not be under consideration for publication elsewhere. The topics of interest include, but are not limited to, the following: SOFTWARE TECHNOLOGY systems software technology, application software technology, concurrent and reactive systems, formal methods in industrial software development, formal techniques for software requirements, design. PROGRAMMING METHODOLOGY logic programming, functional programming, object paradigms, constraint programming and concurrency, program verification and transformation, specification languages and tools, formal specification and development case studies. ALGEBRAIC AND LOGICAL FOUNDATIONS logic, category theory, relation algebra, computational algebra, algebraic foundations for languages and systems, theorem proving and logical frameworks for reasoning, logics of programs. SYSTEMS AND TOOLS (for system demonstrations or ordinary papers) software development environments, support for correct software development, system support for reuse, tools for prototyping, validation and verification, computer algebra systems, theorem proving systems. We invite prospective authors to submit electronically previously unpublished papers of high quality. Papers should be between five and fifteen pages in LNCS style. Ten page papers are ideal, and papers longer than fifteen pages may be rejected without detailed refereeing. Please see details at http://www.cs.mq.edu.au/amast97 under "submission" which explain how to get a paper number, and then send a fully self-contained postscript file (preferably derived from LaTeX with the LNCS style on a Unix system) to amast97@mpce.mq.edu.au . If for any reason it is impossible to submit electronically authors may send six paper copies of their submission to the programme chair at the address below. All papers will be refereed by the programme committee, and will be judged based on their significance, technical merit, and relevance to the conference. As in the past, we expect the proceedings to be published by Springer-Verlag in their Lecture Notes in Computer Science Series. Papers should be received by May 15, 1997. ------------------------------------------------------------------- Address for non-electronic submissions and enquiries Michael Johnson AMAST'97 Programme chair School of Maths and Computing Macquarie University Sydney, 2109, Australia Phone: ++61 (0)2 9850 9583 Fax: ++61 (0)2 9850 9551 Email: amast97@mpce.mq.edu.au ------------------------------------------------------------------- AMAST General Chair: Maurice Nivat (France) Programme Chair: Michael Johnson (Australia) ------------------------------------------------------------------- Programme Committee V.S. Alagar (Canada), Egidio Astesiano (Italy), Didier Begay (France), Richard Buckland (Australia), John Cannon (Australia), Kokichi Futatsugi (Japan), Armando Haeberer (Brazil), Paola Inverardi (Italy), Michael Johnson (Australia), Rocco De Nicola (Italy), Anton Nijholt (Netherlands), Fernando Orejas (Spain), Mehmet Orgun (Australia), John Plaice (Canada) John Potter (Microsoft Research Institute), R. Ramanujam (India), Charles Rattray (Great Britain), Teodor Rus (USA), T. Sakabe (Japan), Giuseppe Scollo (Netherlands), R.K. Shyamasundar (India), Andrzej Tarlecki (Poland), R.F.C. Walters (Australia), Martin Wirsing (Germany). ------------------------------------------------------------------- Organizing Committee Chair and Finances: Michael Johnson Tools and Demos: Richard Buckland Local arrangements: Vicki Carruthers ------------------------------------------------------------------- Important Dates Submission of Papers: May 15, 1997 Submission of System Demo Proposals: June 15, 1997 Author notificaiton of ouctome: August 1, 1997 Camera read copy received by: September 1, 1997 Education Day: December 13, 1997 Conference Days: December 14-17, 1997 ------------------------------------------------------------------- Further information For regularly updated details of the conference organisation see http://www.cs.mq.edu.au/amast97 or send email to amast97@mpce.mq.edu.au ------------------------------------------------------------------- From cat-dist Tue Apr 29 15:24:46 1997 Received: by mailserv.mta.ca; id AA15225; Tue, 29 Apr 1997 15:23:28 -0300 Date: Tue, 29 Apr 1997 15:23:28 -0300 (ADT) From: categories To: categories Subject: IC-EATCS Annual Advanced School Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: O X-Status: Date: Mon, 28 Apr 1997 19:17:49 +0100 From: Catuscia Palamidessi I apologize for multiple copies. Regards, Catuscia Palamidessi ======================================================== 3rd IC-EATCS Annual Advanced School "Models and Paradigms of Concurrency" 15-19 September 1997, CISM, Udine, Italy Organized by Furio Honsell Catuscia Palamidessi Paolo Serafini University of Udine (Scientific Coordinator) University of Udine University of Genova Sponsored by Italian CNR UNESCO University of Udine ---------------------------------------------------------------------------- For further information see the URL: http://www.disi.unige.it/person/PalamidessiC/IC-EATCSschool/index.html ---------------------------------------------------------------------------- SCOPE The IC-EATCS (European Association of Theoretical Computer Science) Advanced Schools focus on specific subjects of Theoretical Computer Science, and address an international public formed both by PhD students and by researchers who wish to deepen their knowledge of the field. Besides the didactical purpose, these events aim at the dissemination of advanced scientific knowledge and at the promotion of international contacts and exchange of ideas among scientists. They intend to be an occasion, especially for the youngest participants, to meet other people interested in their research with whom to discuss ideas and to compare approaches and results. The IC-EATCS 1997 Advanced School will focus on "Models and Paradigms for Concurrency". The aim is to provide a overview of some of the hot topics in the field of Concurrency Theory, particularly concerning computational models and linguistic paradigms. If there are PhD students interested in taking an examination at the conclusion of the School, such an examination will be scheduled on Saturday 20 September, and will consist of exercises agreed upon by the Organizers and the Lecturers. ---------------------------------------------------------------------------- PROGRAMME There will be 3 main courses of 10 hours each. Every course will be parted in 5 lectures of 2 hours, one per day. Additionally, there will be invited talks, one per day, of 1 hour and half each. MAIN COURSES Samson Abramsky Interaction Categories University of Edimburgh, UK Prakash Panangaden Probabilistic Theories and Methods for Mc Gill University, Ca Concurrency Davide Sangiorgi An introduction to the Pi-calculus INRIA Sophia-Antipolis, Fr INVITED TALKS Pierpaolo Degano (to be announced) University of Pisa, It Moreno Falaschi Concurrent Constraint Programming University of Udine, It Roberto Gorrieri Security and Privacy in Process Algebras University of Bologna, It Furio Honsell (to be announced) University of Udine, It Simone Martini Distributed Cut-elimination in Proof-nets University of Udine, It ---------------------------------------------------------------------------- APPLICATION To apply, participants should fill the enclosed Application Form and return it, either by hard or electronic mail, to: IC-EATCS 1997 Advanced School Secretariat CISM, Palazzo del Torso Piazza Garibaldi 18 33100 UDINE - ITALY Tel: +39 432 294989 or 508251. Fax: +39 432 501523. Email: cism@uniud.it Please send a copy of your application (preferably by email) also to Catuscia Palamidessi, DISI, via Dodecaneso, 35, 16146 Italy. Email: catuscia@disi.unige.it. DEADLINE Early registration: 30 June 1997. Late registration: 15 August 1997 FEES The Participation fee is 600,000 ITL (Italian Lira) for early registration, and 700,000 ITL for late registration (1 USD is about 1,700 ITL). It includes coffee breaks and printed material relative to the courses. It does not include accomodation or meals. FURTHER INFORMATION For further information please contact Ms.Carla Toros, Cism Secretary. Tel. +39 432 294989. Email: cism@hydrus.cc.uniud.it ---------------------------------------------------------------------------- GRANTS A limited number of participants who cannot be entirely supported by their own Institution can be offered scholarship and/or lodging and/or partial support of travel expenses. In order to have a large attendance applicants are encouraged to solicit partial support also from other institutions. The request for support should be sent by 30 June 1997 together with the Application, and it should include: * the enclosed Grant Application Form * the Curriculum Vitae of the participant * (optional) one or two letters of recommendation. The request should be sent either by hard or electronic mail, to: IC-EATCS 1997 Advanced School Secretariat CISM, Palazzo del Torso Piazza Garibaldi 18 33100 UDINE - ITALY Tel: +39 432 294989 or 508251. Fax: +39 432 501523. Email: cism@uniud.it Please send a copy of your request also to Catuscia Palamidessi, DISI, via Dodecaneso, 35, 16146 Italy. Email: catuscia@disi.unige.it. The letters of recommendation, if sent by email, should be send directly by the people who write them. Awarding of grants will be notified by 30 July 1997. ---------------------------------------------------------------------------- ACCOMODATION AND TRAVEL There are many hotel opportunities in Udine. A list of them, with reduced prices for the CISM schools participants, is enclosed below. Participants are kindly requested to make the hotel reservation directly. A map of Udine, showing the location of CISM and of the various hotels, is available at the URL http://www.disi.unige.it/person/PalamidessiC/IC-EATCSschool/index.html A limited number of participants can be lodged in the Student House of the University of Udine. More information about this will be made available at the URL above. Participants to the school can get meals at the "Mensa Universitaria" for about 10,000 ITL. The best way to reach Udine by plane is to arrive at the airport of Trieste. From this airport, there are frequent buses to Udine. The trip takes about half an hour. More information about travel will be made available at the URL above. 8<-------------------------------------------------------------------------- APPLICATION FORM Family name: _____________________ Name: ___________________________ Date of Birth: ___________________ Cytizenship: ____________________ Position: __________________ Affiliation: __________________________ Address: ____________________________________________________________ Phone: ________________ Fax: ______________ Email: ________________ ..................................................................... Please select your preferred form of payment for the fee by replacing the "o" with an "*" o Check of Lire: ___________ sent to CISM. o Payment of Lire: ___________ made on CISM Bank Account N. 3000, ROLO Banca 1473, Agenzia 2, UDINE (ABI 3556, CAB 12303). Bank transfer must be free of charge for the organizers. o Charge of Lire on the Credit card: _______________________ (Cartasi, Eurocard, Mastercard or Visa) Number: _________________________ Expiration date: _______ Name on card: _____________________________________________ ..................................................................... Please indicate to whom the invoice should be addressed here below. This name should also appear on all bank documents Name: ______________________________________________ Address: ___________________________________________ VAT number or Fiscal Number: _______________________ (Only for EC or Italian residents or foreigners with permanent business activity in Italy): 8<-------------------------------------------------------------------------- GRANT APPLICATION FORM (to be sent together with the application form) I hereby apply for the following support for attending the ``IC-EATCS Advanced School on Models and Paradigms for Concurrency'', CISM, Udine, 15-19 September 1997 : - travel expenses: Yes No - living expenses: Yes No - participation fee: Yes No When using the most economical way of travelling, my travel costs amount to: ________________________________ Other sources will contribute to my expenses for: - travel expenses: Yes No Partially (up to _________________________) - living expenses: Yes No Partially (up to _________________________) - participation fee: Yes No Partially (up to _______________________) I do not receive any further support and I hereby declare that the above information is correct and to the best of my knowledge. Date: _________________ Signature: ____________________________________________________________ 8<-------------------------------------------------------------------------- HOTELS IN UDINE Approximate Prices in Lire January 97 (*) Single room Double room ......................................................................... **** (first category) AMBASSADOR PALACE HOTEL, 91.000 Via Carducci 46 112.000 164.000 Tel. +39 0432/50 37 77, Fax 50 37 11 break.incl. break.incl. ASTORIA HOTEL ITALIA, 140.000 180.000 Piazza XX Settembre 24 break.incl. break.incl. Tel. +39 0432/50 50 91, Fax 50 90 70 special discounted prices for week-ends 130.000 170.000 ......................................................................... *** (second category) CRISTALLO 76.000 118.000 Piazzale D'Annunzio 73 breakfast 13.000 Tel. +39 0432/50 19 19, Fax 50 16 73 additional discount for direct payment 72.000 110.000 FRIULI, 85.000 150.000 Viale Ledra 24 105.000 Tel. +39 0432/23 43 51, Fax 23 46 06 break.incl. break.incl. PRESIDENT, 90.000 Via Duino 8 105.000 140.000 Tel. +39 0432/50 99 05, Fax 50 72 87 break.incl. break.incl. PRINCIPE, 90.000 Viale Europa Unita 51 100.000 150.000 Tel. +39 0432/50 60 00, Fax 50 22 21 break.incl. break.incl. SAN GIORGIO, 90.000 Piazzale Cella 3 110.000 130.000 Tel. +39 0432/50 55 77, Fax 50 61 10 break.incl. break.incl. CONTINENTAL 90.000 Viale Tricesimo 71 99.000 135.000 Tel. +39 0432/46 969, Fax 52 60 02 break.incl. break.incl. ......................................................................... ** (third category) QUO VADIS, 55.000 80.000 Piazziale Cella 28 breakfast 7.000 90.000 Tel. +39 0432/21 0 91, Fax 21 0 92 ......................................................................... * (fourth category) SUITE INN - Meubli, Via di Toppo 25 no single rooms 60.000 Tel. +39 0432/50 16 83 break. not incl. ......................................................................... Interested persons are kindly requested to make the hotel reservation directly. International code number for Udine is: +39432. For national calls, the code is 0432. (*) These are special prices for CISM participants. When contacting the hotel, please make clear that you are a CISM participant. From cat-dist Tue Apr 29 20:23:29 1997 Received: by mailserv.mta.ca; id AA27163; Tue, 29 Apr 1997 20:23:05 -0300 Date: Tue, 29 Apr 1997 20:23:05 -0300 (ADT) From: categories To: categories Subject: weak \omega-categories Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: O X-Status: Date: Tue, 29 Apr 1997 23:13:53 +1000 From: Michael Batanin Some people informed me that they have had the difficulties in printing out the dvi file of my paper "Monoidal globular categories as a natural environment for the theory of weak n-categories" It seems that the following address works better http://www-math.mpce.mq.edu.au/~mbatanin/papers.html You can find here the .ps file of my paper. Michael Batanin. From cat-dist Wed Apr 30 20:01:55 1997 Received: by mailserv.mta.ca; id AA07380; Wed, 30 Apr 1997 20:00:16 -0300 Date: Wed, 30 Apr 1997 20:00:16 -0300 (ADT) From: categories To: categories Subject: Notes of two lectures Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: O X-Status: Date: Wed, 30 Apr 1997 11:39:29 +1100 From: Ross Street With computers, things we expect to be simple never are! Last week I announced the placement on the WWW of the notes (see the short description below) of my two lectures at the Conference on Higher Category Theory and Mathematical Physics, Northwestern University (Evanston, Illinois; 28-30 March 1997). The site is: I'll spare you the details of the problems, but, up until today, what was at this site was an old version prepared before the conference. This is not what I had intended. I am truly sorry to people who have downloaded that version already. The correct version is NOW at the site. There still seems to be a problem when the document is viewed (by some "ghost" technology) but it does (at least for us) print out pretty well. There is a colour table on page 2 which even seems to view correctly! I am extremely grateful to Ross Moore and Sjoerd Crans for helping me out of the mess I (and my little Mac) created. I invite people who have downloaded the old version to try again; I am really sorry. Title: The role of Michael Batanin's monoidal globular categories Lecture I: Globular categories and trees Lecture II: Higher operads and weak omega-categories This is a report on recent work of Michael Batanin. The goal of his work is to provide an environment for defining the concepts associated with weak omega-categories and for developing the ensuing theory. The approach is "globular". Apart from providing a precise definition of weak omega-category, the work gives a new algebra of planar trees and uses them to define higher operads which I believe will find many other applications. Note that, in the meantime (and again not without trouble!), Michael Batanin has announced his paper containing the full details of this part of his work. It is available at: Happy surfing and enjoy the trees. Ross