From cat-dist Tue Jun 1 18:59:05 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id RAA24043 for categories-list; Tue, 1 Jun 1999 17:20:16 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Tue, 1 Jun 1999 14:19:27 +0200 (MET DST) From: sjouke@win.tue.nl (Sjouke Mauw) Message-Id: <199906011219.OAA04571@wsinfm19.win.tue.nl> To: PetriNets@daimu.aau.dk, categories@mta.ca, cav-all@csa.cs.technion.ac.il, coq-club@pauillac.inria.fr, eacsl@dimi.uniud.it, eapls@mailbase.ac.uk, eatcs-it@cs.unibo.it, facs@lboro.ac.uk, formal-methods@cs.uidaho.edu, haskell@dcs.gla.ac.uk, ifmsig@cs.tcd.ie, info-hol@leopard.cs.byu.edu, isabelle-users@cl.cam.ac.uk, kgs@dbai.tuwien.ac.at, lambda-usergroup@dcs.ed.ac.uk, lfcs-interest@dcs.ed.ac.uk, lics@research.bell-labs.com, logic@CS.Cornell.EDU, mfpsmail@math.tulane.edu, nqthm-users@cli.com, nuprllist@CS.Cornell.EDU, procos-list@comlab.ox.ac.uk, pvs@csl.sri.com, qed@mcs.anl.gov, rewriting@loria.fr, theorem-provers@ai.mit.edu, vdm-forum@mailbase.ac.uk Subject: categories: CONCUR'99 Call for participation Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: CALL FOR PARTICIPATION and FINAL PROGRAM CONCUR'99 10th International Conference on Concurrency Theory Eindhoven, The Netherlands, August 24--27, 1999. URL http://www.win.tue.nl/concur99/ E-mail concur99@win.tue.nl (apologies for multiple copies) REGISTRATION It is now time to register for CONCUR'99. See the above mentioned WWW pages for the registration procedure. Early registration ends on July 1, 1999. CONCUR The purpose of the CONCUR conferences is to bring together researchers, developers and students in order to advance the theory of concurrency, and promote its applications. PROGRAM Monday August 23 ================ CONCUR'99 Satellites: Probmiv'99 2nd International Workshop on Probabilistic Methods in Verification Express'99 6th International Workshop on Expressiveness in Concurrency VFM'99 Visual Formal Methods Symposium Please follow the CONCUR'99 registration procedure to register for one of the satellites. Admission to the satellites is free (including lunch). Tuesday August 24 ================= 8.30--9.25 Registration 9.25--9.30 Welcome by prof.dr. J.C.M. Baeten (Eindhoven University of Technology) 9.30--10.30 Invited Lecture dr. R.J. van Glabbeek (Stanford University) 11.00--12.30 Session 1 Generic Process Algebras for Asynchronous Communication F.S. de Boer, G. Zavattaro Statecharts via Process Algebra Gerald Luettgen, Michael von der Beeck, Rance Cleaveland Weak Bisimilarity with Infinite-State Systems can be Decided in Polynomial Time Antonin Kucera, Richard Mayr 14.00--15.30 Session 2 Computing Minimum and Maximum Reachability Times in Probabilistic Systems Luca de Alfaro Approximative symbolic model checking of continuous-time Markov chains Christel Baier, Joost-Pieter Katoen, Holger Hermanns Metrics for Labeled Markov Systems Josee Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden 16.00--17.00 Session 3 Validating Firewalls in Mobile Ambients Flemming Nielson, Hanne Riis Nielson, Rene Rydhof Hansen, Jacob Grydholt Jensen Open Bisimulations on Chi Processes Yuxi Fu Subtyping and Locality in Distributed Higher Order Processes Nobuko Yoshida, Matthew Hennessy 17.30--19.00 Reception at Evoluon Wednesday August 25 =================== 9.00--10.00 Invited Lecture prof.dr. J. Esparza (Technical University Munich) 10.30--12.30 Session 4 Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic Berard Beatrice, Fribourg Laurent Model Checking of Time Petri Nets Based on Partial Order Semantics Burkhard Bieber, Hans Fleischhack Generalised Composition Operations for High-Level Petri Nets Eike Best, Alexander Lavrov On the Semantics of Place/Transition Nets Remi Morin, Brigitte Rozoy 14.00--15.30 Session 5 The Expressive Power of Temporal Logic of Actions Arkady Estrin, Michael Kaminski Rectangular Hybrid Games Thomas A. Henzinger, Benjamin Horowitz, Rupak Majumdar Proof-Checking Protocols Using Bisimulations Christine Roeckl, Javier Esparza 16.00--18.00 Session 6 Event Structures as Presheaves---Two Representation Theorems Glynn Winskel Localizability of Fairness Constraints and Their Distributed Implementations Yuh-Jzer Joung Weakest-Congruence Results for Livelock-Preserving Equivalences Antti Puhakka, Antti Valmari Synthesis of Large Concurrent Programs via Pairwise Composition Paul Attie Thursday August 26 ================== 9.00--10.00 Invited Lecture prof.dr. R.J. Cleaveland (State University of New York) 10.30--12.30 Session 7 ``Next'' Heuristic for On-the-fly Model Checking Rajeev Alur, Bow-Yaw Wang Model Checking of Message Sequence Charts Rajeev Alur, Mihalis Yannakakis Robust Satisfaction Orna Kupferman, Moshe Vardi Automating Modular Verification Rajeev Alur, Luca de Alfaro, Thomas A. Henzinger, Freddy Y.C. Mang 14.00--17.30 Visit 's-Hertogenbosch 18.45--21.00 Conference Banquet at Philips Stadium Friday August 27 ================ 9.00--10.00 Invited Lecture prof.dr. C. Palamidessi (Pennsylvania State University) 10.30--12.30 Session 8 Timed automata and the theory of real numbers Hubert Comon, Yan Jurski Partial Order Reduction for Model Checking of Timed Automata Marius Minea Synchronous Structures David Nowak, Jean-Pierre Talpin, Paul Le Guernic From synchrony to asynchrony Albert Benveniste, Benoit Caillaud, Paul Le Guernic 14.00--16.00 Session 9 On Coherence Properties in Term Rewriting Models of Concurrency Thomas Noll A Partial Order Event Model for Concurrent Objects Jose Meseguer, Carolyn Talcott Generating Type Systems for Process Graphs Barbara Koenig Object Types against Races Cormac Flanagan, Martin Abadi Tutorial sessions ================= (in parallel with regular paper presentations) Tuesday 14.00--15.30 dr. P. Jancar (Technical University of Ostrava) Techniques for decidability and undecidability of bisimulation Wednesday 14.00--15.30 dr. N. Klarlund (AT&T Labs Research) Automata-based symbolic computation Friday 14.00--15.30 dr.ir. J. Tretmans (University of Twente) Testing Concurrent Systems: A Formal Approach Tool demonstration sessions =========================== (in parallel with regular paper presentations) Every day (precise schedule to be announced) ADDRESSES S. Mauw, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands. URL http://www.win.tue.nl/concur99/ E-mail concur99@win.tue.nl From cat-dist Wed Jun 2 12:31:41 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id KAA06215 for categories-list; Wed, 2 Jun 1999 10:54:51 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f From: Jiri Adamek Message-Id: <199906021353.PAA16363@math.feld.cvut.cz> Subject: categories: JPAA issue in honor of S.Mac Lane To: categories@mta.ca Date: Wed, 2 Jun 1999 15:53:25 +0200 (MET DST) Cc: adamek@math.feld.cvut.cz (Jiri Adamek) X-Mailer: ELM [version 2.4 PL25] MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: PROCEDINGS OF THE CATEGORY THEORY CONFERENCE IN COIMBRA (JULY 1999) A special issue of the Journal of Pure and Applied Algebra, dedicated to the ninetieth birthday of Saunders Mac Lane, is planned to contain the proceedings of the Coimbra meeting. Due to space limitations, only contributions closely related to lectures presented at the conference will be accepted. The submission deadline is November 30, 1999, and more detailed instructions about submissions will be announced during the conference. J. Adamek, P. Johnstone, and M. Sobral editors of the special issue From cat-dist Thu Jun 3 10:46:07 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id JAA09398 for categories-list; Thu, 3 Jun 1999 09:16:36 -0300 (ADT) X-Authentication-Warning: triples.math.mcgill.ca: barr owned process doing -bs Date: Wed, 2 Jun 1999 16:53:28 -0400 (EDT) From: Michael Barr X-Sender: barr@triples.math.mcgill.ca To: Categories list Subject: categories: My ftp directory Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: Some of you have been trying unsuccessfully to get files from my ftp directory, which mysteriously disappeared. It is now restored. The address is ftp.math.mcgill.ca/pub/barr. Michael ------------------------------------------------------------------- If a society puts up with bad plumbers because plumbing is such a low calling, and if it puts up with bad philosophers because philosophy is such a high calling---then neither its pipes nor its theories will hold water. --- Slight paraphrase of former HEW secretary John Gardner From cat-dist Thu Jun 3 10:46:08 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id JAA11294 for categories-list; Thu, 3 Jun 1999 09:14:25 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Wed, 2 Jun 1999 17:02:11 +0100 From: jno@di.uminho.pt (Jose Nuno Oliveira) Message-Id: <9906021602.AA24300@shiva.di.uminho.pt> To: categories@mta.ca Subject: categories: MPC2000: 5th Int. Conf. on Math. of Program Construction - CFP Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: MPC 2000 5th International Conference on MATHEMATICS OF PROGRAM CONSTRUCTION ----------------------------------- http://www.di.uminho.pt/mpc2000 3--7 July, 2000 Ponte de Lima, Portugal CALL FOR PAPERS This conference aims to promote the development of mathematical principles and techniques that are demonstrably useful and usable in the process of constructing computer programs (whether implemented in hardware or software). The focus of the conference is on techniques that combine precision with concision, enabling programs to be constructed by formal calculation. Within this theme, the scope of the conference is very diverse. We welcome contributions to programming methodology (for example, formal methods for program specification and transformation), to programming paradigms (for example, generic programming techniques and type systems) and to language design (for example, programming calculi and programming language semantics). Theoretical contributions are welcome provided their relevance to program construction is evident; discussion of applications is welcome provided the mathematical basis is evident. A number of workshops will be organised in conjunction with the conference. IMPORTANT DATES Deadline for submission of papers: 3rd January, 2000 Notification of acceptance/rejection: 29th February, 2000 Final papers due: 17th April, 2000 Full papers should be submitted in Postscript format by e-mail to reach Roland Backhouse or Jose Oliveira by 3rd January, 2000. INVITED SPEAKERS Cliff Jones (Harlequin Ltd., UK) Jan Rutten (CWI, The Netherlands) Mark Jones (Oregon, USA) PROGRAMME COMMITTEE Roland Backhouse (UK, cochair) Richard Bird (UK) Eerke Boiten (UK) Dave Carrington (Australia) Jules Desharnais (Canada) Jose Fiadeiro (Portugal) Jeremy Gibbons (UK) Lindsay Groves (New Zealand) Zhenjiang Hu (Japan) John Hughes (Sweden) Johan Jeuring (The Netherlands) Burghard von Karger (Germany) Dick Kieburtz (USA) Carlos Kloos (Spain) K. Rustan M. Leino (USA) Christian Lengauer (Germany) Lambert Meertens (The Netherlands) Sigurd Meldal (Norway) Eugenio Moggi (Italy) Bernhard Moeller (Germany) Oege de Moor (UK) Dave Naumann (USA) Jose Oliveira (cochair, Portugal) Kaisa Sere (Finland) Mark Utting (New Zealand) Phil Wadler (USA) FURTHER INFORMATION Please refer to the web page for further details. http://www.di.uminho.pt/mpc2000 Alternatively, email: mpc2000@di.uminho.pt or contact a member of the programme committee. From cat-dist Sun Jun 6 16:09:32 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id OAA07917 for categories-list; Sun, 6 Jun 1999 14:57:35 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Fri, 04 Jun 1999 21:44:22 +0200 From: Eva Ullan Subject: categories: CSL'99 Call for Participation X-Sender: evah@147.96.1.121 To: mosses@csl.sri.com Message-id: MIME-version: 1.0 Content-type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from quoted-printable to 8bit by mailserv.mta.ca id QAA25076 Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: ------------------------------------------------------------- CALL FOR REGISTRATION AND PARTICIPATION CSL'99 Annual Conference of the European Association for Computer Science Logic (EACSL) Madrid, Spain, September 20-25, 1999 ------------------------------------------------------------- *************************************************** INVITED LECTURERS TUTORIALS CONTRIBUTED PAPERS GENERAL INFORMATION REGISTRATION AND ACCOMODATION *************************************************** Sponsored by: Departamento Sistemas Informaticos y Programacion (SIP) - UCM European Research Consortium for Informatics and Mathematics - ERCIM Esprit Working Group - CCLII Facultad de Matematicas - UCM Ministerio de Educacion y Ciencia - CICYT Viverrectorado de Investigacion - UCM Viverrectorado de Relaciones Internacionales - UCM Organised by: SIP-UCM DACYA-UCM 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) Local Organizing Committee: J. Carlos Gonzalez-Moreno, Teresa Hortala-Gonzalez, Javier Leach-Albert (chair), Paco Lopez-Fraguas, Fernando Saenz-Perez, Eva Ullan-Hernandez. Programm commitee of CSL'99: 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), Martin Wirsing (Munich, Germany). The 1999 Annual Conference of the European Association for Computer Science Logic follows previous CSL Conferences: CSL'98 (Brno, Czech Republic), CSL'97 (Aarhus, Danemark), CSL'96 (Utrecht, Netherlands), CSL'95 (Paderborn, Germany), CSL'94 (Kasimierz, Poland), CSL'93 (Swansea, Great Britain), CSL'92(San Miniato/Pisa, Italy), CSL'91 (Bern, CH), CSL'90 (Heidelberg, Deutchland), CSL'89 (Kaiserslautern, Deutchland), CSL'88 (Duisburg, Deutchland), and CSL'87 (Karlsruhe, Deutchland), CSL'99 will be held in Madrid (Spain). The event is organized jointly by the Computer Science Departments (SIP and DACYA) of Universidad Complutense de Madrid (UCM). The scientific program includes 34 selected papers from among 91 submissions, five invited lectures, and two tutorials on theorem proving and rewriting techniques, scheduled on September 24 afternoon (Friday) and September 25 morning (Saturday), immediately after the main conference. In addition to the scientific program, the social program includes an excursion to Segovia (a nearby historic city), and a conference dinner. Madrid, a city of contrasts, traditional and contemporary at the same time, offers the opportunity to enjoy both Spain and one of the most attractive capitals in Europe. In this document you can find the Invited Lecturers, Tutorials, Accepted papers, General Information, Registration and Accommodation Information. The CSL'99 Web page (http://mozart.sip.ucm.es:1580/csl99/) contains additional information. INVITED LECTURERS: Jose Luis Balcazar - Universidad Politecnica Cataluna Title: Computation theoretic connections in logic Javier Esparza - Technische Universitat Munchen Title: Partial order semantics help Martin Grohe - Albert-Ludwig-Universitat Freiburg Title to be announced Peter D. Mosses - University of Aarhus Title: Logical specification of operational semantics Victor Vianu - University California San Diego Title: Topological queries in spatial databases TUTORIALS: Douglas J. Howe - Bell Labs Title: Interactive theorem proving using type theory Aart Middeldorp - University of Tsukuba Title: Term rewriting CONTRIBUTED PAPERS: Thorsten Altenkirch, Bernhard Reus Monadic presentations of lambda terms using generalized inductive types C. Areces, P. Blackburn, M. Marx A Roadmap on Complexity for Hybrid Logics Thomas Arts, Jurgen Giesl Rewriting Techniques for Verification of Erlang Processes Vincent Balat, Roberto Di Cosmo A linear logical view of linear type isomorphisms L.D. Beklemishev Open least element principle and bounded query computation Eduardo Bonelli Using fields and explicit substitutions to implement objects and functions in a de Bruijn setting J. C. Bradfield Fixpoint alternation and the game quantifier Adriana Compagnoni, Healfdene Goguen Anti-Symmetry of Higher-Order Subtyping Volker Diekert and Paul Gastin An expressively complete temporal logic without past tense operators for Mazurkiewicz traces Maribel Fernandez, Ian Mackie Closed reductions in the lambda calculus Martin Fraenzle Analysis of Hybrid Systems: An ounce of realism can save an infinity of states Paul Gastin and Mike Mislove A Truly Concurrent Semantics for a Simple Parallel Programming Language Herman Geuvers, Erik Poll, Jan Zwanenburg Safe Proof Checking in Type Theory with $Y$ Erich Gradel, Stephan Kreutzer Descriptive complexity theory for constraint databases Shigeki Hagihara, Naoki Yonezaki Resolution Method for Modal Logic with Well-founded Frames Jo Erskine Hannay Specification Refinement with System F Yoram Hirshfeld , Alexander Rabinovich Quantitative Temporal Logic Furio Honsell, Donald Sannella Pre-logical relations Samin Ishtiaq and David J. Pym Kripke resource models of a dependently-typed, bunched $\lambda$-calculus A. D. Ker, H. Nickau, C.-H. L. Ong More Universal Game Models of Untyped Lambda-Calculus: The Bohm Tree Strikes Back Yonit Kesten and Amir Pnueli Can Abstraction Replace Deduction Yoshiki Kinoshita, John Power Data-refinement for call-by-value programming languages A. Kucera, J. Esparza A Logical Viewpoint on Finite-State Descriptions of Processes Clemens Lautemann, Bernhard Weinzinger MonadicNLIN and quantifier-free reductions Daniel Leivant Applicative control and computational complexity Jerzy Marcinkowski Directed reachability: from Ajtai-Fagin to Ehrenfeucht-Fraise games Thomas Marthedal Rasmussen Signed Interval Logic Jesper Moller, Jakob Lichtenberg, Henrik Reif Andersen, Henrik Hulgaard Difference Decision Diagrams Luca Roversi A Proof of Completeness for Light Logics Helmut Seidl, Andreas Neumann On Guarding Nested Fixpoints Iain A. Stewart Program schemes, arrays, Lindstrom quantifiers and zero-one laws Stephan Tobies A NExpTime-complete Description Logic Strictly Contained in C^2 Jacobo Toran Lower Bounds for Space in Resolution Marina De Vos, Dirk Vermeir Choice logic programs and Nash equilibria in strategic games GENERAL INFORMATION Place and travel The Conference will be held in Madrid (Spain), at the Faculty of Mathematics of Universidad Complutense de Madrid (UCM), from the 20th to the 25th of September, 1999. Madrid has direct flights from most major cities and generally good connections from elsewhere. Barajas, the international Madrid airport, is only about10 km from the city. There are frequent regular buses and taxis to the city, as well as the new metropolitan line. The Faculty of Mathematics can be reached by metro (metropolitan station Ciudad Universitaria or Metropolitano) or by bus (bus lines 132, F, or 82). The CSL'99 Web page (http://mozart.sip.ucm.es:1580/csl99/) contains additional information such as the metropolitan network map, and the surroundings to CSL host site map. Social Events A guided excursion to Segovia will be held on Wednesday, 22th. The departure will be after lunch, at 14:00. Registered participants have this excursion included, and accompanying persons can buy an excursion ticket (60 euros) during the Registration and Opening Session to CSL'99. The excursion includes dinner. Languages The official language of the Conference is English. REGISTRATION AND ACCOMMODATION INFO REGISTRATION INFO CSL'99 Registration to the Conference and/or Tutorial must be made sending the Conference Registration Form and/or the Tutorial Registration Form and a copy of your corresponding bank transfer (via fax) directly to: CSL'99 attention of ms. Eva Ullan fax +34/91/394 46 02 Electronic mail registration will not be accepted The conference registration fee includes: - admission to the conference - morning and afternoon coffee breaks during the conference - lunches during the conference - excursion and social event - a copy of the proceedings volume - one year subscription to EACSL The tutorial registration fee includes: - admission to the tutorials - afternoon and morning coffee breaks during the tutorials - working material EARLY CONFERENCE REGISTRATION FEE: 270 EUROS. For early registration, the registration form together with a the copy of your bank remittance must reach us by July 15, 1999 LATE CONFERENCE REGISTRATION FEE: 300 EUROS. After July 15, 1999 SUBSIDISED STUDENT CONFERENCE REGISTRATION FEE: 150 EUROS If you want to apply for subsidised student registration fee, please type out your e-mail address and send the applying form for student registration fee, with a copy of your student certification via fax before July 1, 1999. You will receive a notification before July 5, 1999 if there is a student grant available for you. Since there are a reduced number of student grants, a positive answer will be possible only on a first come first serve basis. TUTORIAL REGISTRATION FEE: 60 EUROS For early tutorial registration, the tutorial registration form with a copy of your bank remittance must reach us by July 15, 1999 LATE TUTORIAL REGISTRATION FEE: 80 EUROS. After July 15, 1999 Payments should be made in EURO currency by bank transfer WITHOUT CHARGES FOR THE BENEFICIARY payable to: CAJA DE MADRID Donoso Cortes 80 28015 MADRID FUNDACION GENERAL UCM (CSL'99) Account: 2038/1735/09/2000001375 Do not forget the specification CSL'99 !!! ACCOMMODATION INFO CSL'99 A) For those who would like a simple accommodation lodging in a student room, we have made arrangements with "Colegio Mayor Loyola", Paseo Juan XXIII 17, 28040 MADRID, SPAIN, Fax +34/91/535 22 05 In "Colegio Mayor Loyola" the price for single rooms, full board, is 4,600 pts + 7% VAT per day (27.646 EUROS + 7% VAT) If you want a "Colegio Mayor Loyola" accommodation you have to fill in the accommodation form and return in printed form via fax before July 15, 1999 to "Colegio Mayor Loyola". After July 15, the accommodation is not guaranteed. B) For those who would like a three/four star hotel accommodation, we have made arrangements with "Grandes Rutas Travel", fax +34/91/543 35 50 Hotel "Tirol" (***) Room for 1 person, breakfast included, 8,800 pts + 7% VAT Room for 2 persons, breakfast for 2 persons included, 11,500 pts + 7% VAT Hotel "Conde Duque" (****) Room for 1 person, breakfast included, 11,600 pts + 7% VAT Room for 2 persons, breakfast for 2 persons included, 14,800 pts + 7% VAT If you want a hotel accommodation you have to fill in the hotel accommodation form and return in printed form via fax before July 15, 1999 to "Grandes Rutas Travel". If you have any problem in relation with your hotel accommodation please get in contact via telephone with Mauro Martin or Ana Garcia (+34/91/543 33 62). <><><><><><><><><><><><> Cut here <><><><><><><><><><><><> CONFERENCE REGISTRATION FORM Please type out and return via fax with a copy of your bank remittance to CSL'99 attention of ms. Eva Ullan FAX +34/91/394 46 02 Surname ____________________________________________________ First Name(s) ______________________________________________ Mr/Ms + Title ______________________________________________ Affiliation ________________________________________________ Home or Work Address: Street _____________________________________________________ Code, City _________________________________________________ Country ____________________________________________________ e-mail _____________________________________________________ Hereby please receive a copy of my bank transfer. Signature: <><><><><><><><><><><><> Cut here <><><><><><><><><><><><> APPLYING FORM FOR A SUBSIDISED STUDENT REGISTRATION FEE Please type out and return via fax with a copy of your student certification to CSL'99 attention of ms. Eva Ullan FAX +34/91/394 46 02 I apply for a subsidised student certification fee. Surname ____________________________________________________ First Name(s) ________________________________________________ Affiliation ___________________________________________________ e-mail address________________________________________________ Hereby please receive a copy of my student certification. Signature: <><><><><><><><><><><><> Cut here <><><><><><><><><><><><> TUTORIAL REGISTRATION FORM Please type out and return via fax with a copy of your bank remittance to CSL'99 attention of ms. Eva Ullan FAX +34/91/394 46 02 Surname ____________________________________________________ First Name(s) ______________________________________________ Mr/Ms + Title ______________________________________________ Affiliation ________________________________________________ Home or Work Address: Street _____________________________________________________ Code, City _________________________________________________ Country ____________________________________________________ e-mail _____________________________________________________ Hereby please receive a copy of my bank transfer. Signature: <><><><><><><><><><><><> Cut here <><><><><><><><><><><><> ACCOMMODATION FORM FOR COLEGIO MAYOR LOYOLA Please fill in and return before the July 15, 1999 via fax to CSL'99 "Colegio Mayor Loyola" attention of ms. Aurora fax +34/91/535 22 05 Surname(s) ____________________________________________________ First Name(s) ______________________________________________ Mr/Ms + Title ______________________________________________ Affiliation ________________________________________________ Arrival day ________________________________________________ Departure day ______________________________________________ Home or Work Address: Street _____________________________________________________ Code, City _________________________________________________ Country ____________________________________________________ Signature: <><><><><><><><><><><><> Cut here <><><><><><><><><><><><> ACCOMMODATION FORM FOR "GRANDES RUTAS TRAVEL" Please fill in and return before the July 15, 1999 via fax to CSL'99 "Grandes Rutas Travel" attention of mr. Mauro Martin or Ana Garcia fax +34/91/543 35 50 Hotel _____________________________________________________ Surname(s) __________________________________________________ First Name(s) ______________________________________________ Mr/Ms + Title ______________________________________________ [ ] Single room [ ] Double room Arrival day ________________________________________________ Departure day ______________________________________________ Home or Work Address: Street _____________________________________________________ Code, City _________________________________________________ Country ____________________________________________________ Signature: From cat-dist Tue Jun 8 15:14:12 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id NAA09559 for categories-list; Tue, 8 Jun 1999 13:41:15 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-Id: <4.1.19990608103343.009f8bb0@pop.apk.net> X-Sender: cwells@pop.apk.net X-Mailer: QUALCOMM Windows Eudora Pro Version 4.1 Date: Tue, 08 Jun 1999 10:37:16 -0400 To: categories@mta.ca From: Charles Wells Subject: categories: CTCS '93? Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: While updating the bibliography for the third edition of Barr & Wells, Category Theory for Computing Science, I discovered that I had no record of a Category Theory and Computer Science conference for 1993, although they are supposed to be held biennially and were held in 1989, 1991, 1995 and 1997. This may only mean that no library in Ohio has a copy of the proceedings. Any information on this would be appreciated. Charles Wells, Department of Mathematics, Case Western Reserve University, 10900 Euclid Ave., Cleveland, OH 44106-7058, USA. EMAIL: charles@freude.com. OFFICE PHONE: 216 368 2893. FAX: 216 368 5163. HOME PHONE: 440 774 1926. HOME PAGE: URL http://www.cwru.edu/artsci/math/wells/home.html From cat-dist Sat Jun 12 20:09:45 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id TAA08498 for categories-list; Sat, 12 Jun 1999 19:05:37 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-Id: <199906121742.NAA05420@celeste.INS.CWRU.Edu> Date: Sat, 12 Jun 1999 13:42:13 -0400 (EDT) X-Sender: cxm7@pop.cwru.edu X-Mailer: Windows Eudora Version 1.4.4 Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" To: categories@mta.ca From: cxm7@po.cwru.edu (Colin McLarty) Subject: categories: "Universes" within ZFC Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: The following improves on remarks I made to some people at the recent Buffalo meeting, and on the FOM e-mail list. This is a step towards showing Grothendieck's method of universes for algebraic geometry can be formalized nearly unchanged in ZFC, without the further axiom asserting existence of Grothendieck universes. To any set of sites (or ringed sites) we associate a "generating cardinal" k and consider as universes the sets V(i) where i is a limit ordinal larger than k and k not cofinal in i. ZFC proves every set is a member of such a "universe". These universes are at least models of Zermelo set theory plus countable replacement. So, for example, for any set S and finitary operation on S in the universe, the closure of S under that operation is also in the universe. This obviously suffices for most of Grothendieck's theorems in TOHOKU and SGA. The only theorem that stands out as needing more is existence of injectives in AB5 categories with generators. I will show these universes suffice for that theorem, for the AB5 categories associated to those (ringed) sites. The problem is simply to find bounds on the transfinite inductions we use. But these are not as simple as I had thought. For any site C we can construct a generator U for the category of Abelian sheaves on C, which works no matter which universe of sets we use to define the topos on C (assuming, of course, that C is in the universe). Any of the standard constructions have this property. And U has a fixed poset of subsheaves (up to equivalence as monics to U) also independent of the universe of sets. The "generating cardinal" for C is the first infinite cardinal greater than the number of subobjects of U. Actually we can make it smaller by a slightly more complicated definition: We can take the first infinite cardinal greater than the length of any chain of subobjects of U well ordered by inclusion. If we use a ringed site and modules over that ring, then U depends on both the site and the sheaf of rings, but it still does not depend on the universe of sets. The generating cardinal for a set of (ringed) sites is the supremum of the generating cardinals for each one. Suppose we have a set of sites, and it has generating cardinal k. Let i be any limit ordinal larger than k and k not cofinal in i. We will use "small" to mean "a member of V(i)." So "small" here does not mean "of small enough cardinality". It means "of low enough rank". A small set can be isomorphic to a non-small one. The key fact is that the axiom of replacement holds within V(i) for any countable family of sets and for any family of sets indexed by k. That is, any set of small sets which is the range of a function defined on k is itself a small set. The reason is this: Consider any function f:k-->S where S is a subset of V(i) but we do not assume f is small. Compose f with the rank function from S to the ordinals, taking each element of S to its rank. This composite cannot be unbounded in V(i), by assumption, so its image has a supremum m inside of V(i), and so f is a subset of V(m) and so is small. We use locally small categories in V(i): any subset of V(i) may be objects, but for any objects A and B there is a small set of morphisms hom(A,B) from A to B. An AB5 category is an Abelian category with all small colimits, such that suprema of small filtered sets of subobjects (of a given object B) are preserved by intersection (with any subobject of B). It follows that every small filtered set of subobjects is a stably effective epimorphic family over its supremum. When we speak of a well-powered category we assume each object A has a selected small set Sub(A) of one representative of each equivalence class of monics to A. By a "subobject" of A we mean one of these selected representatives. The following lemmas and theorems hold for any well-powered AB5 category with generator U. Lemma 1: Given any objects C and D, there is a small set isomorphic to the set of all partial morphisms from C to D, that is all morphisms f:V-->D from subobjects V>->C. PROOF: There is a small set of subobjects Sub(C+D). A subset of C+D whose projection onto C is monic, is the graph of a partial morphism, and vice versa. LEMMA 2: An object M is injective iff it looks injective to U. That is, iff every morphism h:V-->M from a subobject V>->U extends to some g:U-->M. PROOF: Given any subobject B>->A and morphism f:B-->M consider the obvious partially ordered set E of pairs where B' is a subobject of A containing B, and f' extends f. By Lemma 1 this is isomorphic to a small poset, and so every linearly ordered subset of it is small. So AB5 and Zorn's lemma show it has maximal elements. The assumption on M implies that any maximal element of E must have B'=A. LEMMA 3: Each object A has a monic A>->M1 such that every morphism f:V-->A from a subobject V>->U extends to a morphism from U to M1. PROOF: Consider the set I of all morphisms f:V-->A from any subobject V of U, to A. For each such f:V-->A we will paste a copy of U onto A by identifying V with its image under f. The result of all that pasting is M1. It is the cokernel of the natural morphism from (the coproduct of all domains of morphisms in I) to A+(the I-fold copower of U). By Lemma 1, the set I is isomorphic to a small set so that the coproducts do exist. THEOREM: Every object a has a monic A>->M where M is injective. PROOF: We iterate the construction from Lemma 2 transfinitely, for each Mj give a monic Mi>- >M(j+1), continuing to the first cardinal larger than Sub(U). Let the colimit be M. By AB5, each Mj has a monic Mj>->M. Now take any subobject V>->U and any f:V-->M. If we knew that f factored as V-->Mj for some ordinal j we would be done, since by construction f would extend to a morphism U-->M(j+1). So consider the subobjects Vj>->V gotten by pulling back Mj>->M along f. This is an increasing chain of subjects, and Sub(U) cannot be cofinal in this chain, so the chain is eventually constant. Say it is constant from Vs onwards. By AB5 the supremum of this chain is V, and so V=Vs and f factors through Ms. That proves the theorem. Notice we could have just iterated the construction to the first cardinal larger than any chain of subobjects of U well ordered by inclusion. From cat-dist Sat Jun 12 20:10:21 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id TAA06947 for categories-list; Sat, 12 Jun 1999 19:05:13 -0300 (ADT) X-Authentication-Warning: triples.math.mcgill.ca: barr owned process doing -bs Date: Sat, 12 Jun 1999 09:04:33 -0400 (EDT) From: Michael Barr To: Categories list Subject: categories: Question on subobject classifiers Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: I am reviewing a paper whose main result sounds like it ought to be known. Is it and can anyone give me a citation? Let E be a cocomplete category with a small dense subcategory C (so every e of E is the colimit of C/e --> E). Then an object \Omega of E is a subobject classifier in E iff it represents the subobject functor restricted to C. ------------------------------------------------------------------- If a society puts up with bad plumbers because plumbing is such a low calling, and if it puts up with bad philosophers because philosophy is such a high calling---then neither its pipes nor its theories will hold water. --- Slight paraphrase of former HEW secretary John Gardner From cat-dist Wed Jun 16 15:20:40 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id NAA13389 for categories-list; Wed, 16 Jun 1999 13:22:09 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f X-Received: from porky.mta.ca (porky.mta.ca [138.73.101.9]) by mailserv.mta.ca (8.9.3/8.9.3) with SMTP id KAA23168 for ; Wed, 16 Jun 1999 10:50:01 -0300 (ADT) X-Received: FROM bommel.math.uu.nl BY porky.mta.ca ; Wed Jun 16 10:54:52 1999 X-Received: from verkwil.math.uu.nl (verkwil [131.211.23.35]) by bommel.math.uu.nl (VMailer) with ESMTP id 3CE2214527; Wed, 16 Jun 1999 15:51:21 +0200 (MET DST) X-Received: (from moerdijk@localhost) by verkwil.math.uu.nl id PAA04627 (8.8.8/IDA-1.6 for RROSEBRUGH@mta.ca); Wed, 16 Jun 1999 15:51:20 +0200 (MET DST) Date: Wed, 16 Jun 1999 15:51:20 +0200 (MET DST) From: "I. Moerdijk" Message-ID: <199906161351.PAA04627@verkwil.math.uu.nl> To: categories@mta.ca Subject: categories: Preprint: I. Moerdijk: "On the Connes-Kreimer construction of Hopf algebras" Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: I. Moerdijk: "On the Connes-Kreimer construction of Hopf algebras" Abstract: We give a universal construction of families of Hopf P-algebras for any Hopf operad P. As a special case, we recover the Connes-Kreimer Hopf algebra of rooted trees. Available from http://www.math.uu.nl/people/moerdijk/preprints.html. --------------------------------------- From cat-dist Thu Jun 17 10:43:48 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id JAA12316 for categories-list; Thu, 17 Jun 1999 09:12:17 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Wed, 16 Jun 1999 22:24:26 -0700 From: Vaughan Pratt Message-Id: <199906170524.WAA20618@coraki.Stanford.EDU> To: categories@mta.ca Subject: categories: Dinaturality in the CCC Poset Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: The cartesian closed category Pos of posets comes with functors built using x and ->. Are there any spurious dinatural transformations between these functors, in the sense that they cannot be represented in a suitable simply-typed lambda-calculus? While the general question is for n-ary functors, the case of unary functors like Ax(A->A) -> AxAxA should constitute the nub of the problem. Bob Pare mentioned to me at CT97 in Vancouver that A->A in Pos was "clean" in this sense, having only the expected dinaturals from A->A to A->A, namely the Church numerals. This is in contrast to Set, where Pare and Roman in a JPAA paper last year (pp. 33-92) gave a litany of spurious dinaturals for this functor, and also to Chu(Set,2), which likewise has spurious dinaturals from A-oA to A-oA, albeit of a quite different character from those of Set. The only closed monoidal category I'm aware of that contains no spurious dinaturals in this sense is Girard's *-autonomous category Coh of coherence spaces, for which Audrey Tan obtained full completeness for multiplicative linear logic in her 1997 Ph.D. thesis. That is, the only dinaturals between functors built using tensor product and -o are those corresponding to cut-free MLL proofs, the MLL criterion for "no spurious dinaturals." What other monoidal closed categories arise in nature that have no spurious dinaturals? Are any of them cartesian closed? In particular is Pos such? And how about PER? Vaughan Pratt From cat-dist Fri Jun 18 11:26:31 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id JAA11674 for categories-list; Fri, 18 Jun 1999 09:20:41 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-Id: <199906181008.TAA23364@apollon.ito.ecei.tohoku.ac.jp> To: categories@mta.ca Subject: categories: IFIP TC1 TCS Conference Y2000 in Japan Mime-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Date: Fri, 18 Jun 1999 19:11:19 +0900 From: "ito@ito.ecei.tohoku.ac.jp" Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: "International Conference on Theoretical Computer Science" --- Exploring New Frontiers of Theoretical Informatics --- organized by IFIP Technical Committee TC1 on Foundations of Computer Science in cooperation with Information Processing Society of Japan Japan Society of Software Science and Technology (*) Institute of Electronics, Information and Communication Engineers of Japan (*) European Association of Theoretical Computer Science Association for Symbolic Logic (*) Association for Computing Machinery-SIGACT (*) indicates "to be verified". Date: August 17 - 19, 2000 Place: Aoba Memorial Building, Faculty of Engineering, Tohoku University, Sendai, Japan Web page: http://tcs2000.ito.ecei.tohoku.ac.jp/tcs2000.html Email: For any inquiry on TCS2000, <> TCS2000@ito.ecei.tohoku.ac.jp Conference Co-Chairs: Giorgio Ausiello, IFIP TC1 Chair and University of Roma "La Sapienza" Takayasu Ito, Tohoku University Steering Committee: Giorgio Ausiello, University of Roma "La Sapienza" (chair) Wilfried Brauer, Technical University of Muenchen Takayasu Ito, Tohoku University Michael Rabin, Harvard University John Staples, University of Queensland Joseph Traub, Columbia University Organizing Committee: Co-Chairs: Takayasu Ito, Tohoku University Yasuyoshi Inagaki, Nagoya University Setsuo Arikawa, Kyushu University Members: (To be announced) Program Committee: TRACK (1): "Algorithms, Complexity and Models of Computation" Co-Chairs: Jan van Leeuwen, University of Utrecht Osamu Watanabe, Tokyo Institue of Technology TRACK (2): "Logic, Semantics, Specification and Verification" Co-Chairs: Peter D. Mosses, University of Aarhus Masami Hagiya, University of Tokyo PC Members: (To be announced) Major Topics: TRACK (1): "Algorithms, Complexity and Models of Computation" Analysis and design of algorithms Continuous algorithms and complexity Computational complexity Descriptional complexity Cellular automata and machines Automata and formal languages Hardware algorithms and parallel algorithms Computational learning theory Algorithmic aspects in discovery science Cryptography Combinatorics Molecular computing and algorithmic aspects of bioinformatics Probabilistic and randomized algorithms Quantum computing Neural network computing Evolutionary and genetic algorithms Computational geometry Computational mathematical finance Bridging complexity and semantics TRACK (2): "Logic, Semantics, Specification and Verification" Logic and semantics for programs and languages Foundations of system specification Term rewriting systems Proofs and specifications in computer science Types and category theory in computer science Theoretical aspects of specification and verification of hardware and software Theoretical aspects of software concepts Concurrency theory Theory of parallel and distributed systems Theory of internet languages and systems Constructive and non-standard logics in computer science Foundations of security Theoretical foundations of data bases Logic, specification and verification of hybrid and real-time systems Theoretical foundations of open systems Bridging semantics and complexity Keynote Plenary Speakers: (to be announced) Invited Speakers for TRACKs: (to be announced) Call for Papers: (to be announced) [Important Dates] Deadline for submission: January 28 (Friday), 2000 Notification of acceptance: April 7 (Friday), 2000 Deadline for final text: May 5 (Friday), 2000 ============================================================================= From cat-dist Sun Jun 20 18:03:30 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id QAA23397 for categories-list; Sun, 20 Jun 1999 16:43:12 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Sat, 19 Jun 1999 12:35:14 -0700 From: Vaughan Pratt Message-Id: <199906191935.MAA12330@coraki.Stanford.EDU> To: categories@mta.ca, linear@cs.stanford.edu Subject: categories: Coimbra course notes on Chu Spaces Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: The notes for my course on Chu Spaces in Coimbra next month are online at http://boole.stanford.edu/pub/coimbra.ps.gz Vaughan Pratt From cat-dist Mon Jun 21 20:48:15 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id TAA12395 for categories-list; Mon, 21 Jun 1999 19:46:49 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Mon, 21 Jun 1999 16:19:46 -0400 From: "Robert A.G. Seely" Message-Id: <199906212019.QAA00852@triples.math.mcgill.ca> To: categories@triples.math.mcgill.ca, types@cis.upenn.edu Subject: categories: "OctoberFest" category theory meeting in Montreal Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: Centre de Recherche en Theorie des Categories -- Montreal -- Category Theory Research Center ----------------------------------------------------------------------------- Category Theory OctoberFest McGill University, Montreal Saturday - Sunday, October 16 - 17, 1999 ----------------------------------------------------------------------------- We invite you to join us in Montreal next October for a weekend meeting in Category Theory, the "not-quite-annual" OctoberFest. As has been the tradition with these meetings, we invite talks from all participants. If you wish to give a talk, send your request along with a short abstract (before the end of September please) to Robert Seely at the address below. Early in October the program committee will announce a preliminary schedule on the Categories email list, and on the CTRC/CRTC web site. The final schedule will be announced at the meeting. We will meet in the Bronfman Building, 1001 Sherbrooke West, on Saturday morning, October 16th. Coffee will be available from 8:30 am. The first talk will be at 9:00. Registration will take place during the morning, before the first talk and during the first coffee break. There will be a registration fee of about $CAN45 (approximately $US30), with luck, less: all possible attempts will be made to keep this as low as we can. The precise amount will be announced in early October, along with the proposed schedule. There will be a dinner/party to be held Saturday evening, hosted by Marta Bunge. (Instructions for getting to the Bunge home will be announced at the meeting.) Please let us know if you intend to join us by sending a short email (before the end of September if possible) to Robert Seely, also indicating whether or not you will bring a guest to the party. (We need to have a good estimate of how many people will attend the party about a week before the meeting.) Below you will find a list of hotels and tourist rooms close to McGill. Please note that October is a popular month for visiting Montreal, and early booking is recommended. If you have any further questions, please contact one of us. -------------------------------------------------------------------------------- Michael Barr [barr@barrs.org] Robert Seely [rags@math.mcgill.ca] Dept of Mathematics and Statistics McGill University 805 Sherbrooke West Montreal, Quebec CANADA H3A 2K6 -------------------------------------------------------------------------------- Hotels: (Montreal area code = 514) * L'Appartement, 455 Sherbrooke W, 284-3634, $85 * Howard Johnson Plaza, 475 Sherbrooke W, 842-3961, $94 (1-800-842-3961). (Mention McGill Maths Dept.) * Mariott Courtyard , 410 Sherbrooke W, 844-8851, $140 * Holiday Inn, 420 Sherbrooke W, 842-6111, $99 (Mention McGill Maths Dept.) * Hotel du Parc, 3625 Park Ave, 288-6666, $109 * Versailles*, 1659 Sherbrooke W, 933-3611, $91 (B&B) Tourist Rooms: (Prices vary depending on choice of single/double room, private/shared bathroom.) * Ambrose, 3422 Stanley, 288-6922, $50-80 (excellent) * Armor*, 157 Sherbrooke E, 285-0140, $55-109 * Bienvenue B&B** 3950 Laval, 844-5897, $65-95 (1-800-227-5897) * Casa Bella, 258 Sherbrooke W, 849-2777, $45-98 (Mention McGill Maths Dept for an additional discount, approx 10%) * Centre Ville B&B*, 3458 Laval, 289-9749, $55-65-85 * Pierre*, 169 Sherbrooke E, 288-8519, $60 *15 minute walk from McGill **30 minute walk from McGill From cat-dist Tue Jun 22 11:48:10 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id JAA22424 for categories-list; Tue, 22 Jun 1999 09:39:04 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-ID: <376F24E0.2781@maths.usyd.edu.au> Date: Tue, 22 Jun 1999 15:53:36 +1000 From: Claudio Hermida Organization: School of Mathematics and Statistics, University of Sydney X-Mailer: Mozilla 3.01Gold (X11; I; OSF1 V4.0 alpha) MIME-Version: 1.0 To: categories@mta.ca Subject: categories: preprint: Representable Multicategories Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: The preprint `Representable multicategories' is available at http://www.maths.usyd.edu.au:8000/u/hermida Abstract: We introduce the notion of representable multicategory, which stands in the same relation to that of monoidal category as fibration does to contravariant pseudofunctor (into Cat). We give an abstract reformulation of multicategories as monads in a suitable Kleisli bicategory of spans. We describe representability in elementary terms via universal arrows. We also give a doctrinal characterisation of representability based on a fundamental monadic adjunction between the 2-category of multicategories and that of strict monoidal categories. The first main result is the coherence theorem for representable multicategories, asserting their equivalence to strict ones, which we establish via a new technique based on the above doctrinal characterisation. The other main result is a 2-equivalence between the 2-category of representable multicategories and that of monoidal categories and strong monoidal functors. This correspondence extends smoothly to one between bicategories and a localised version of representable multicategories. -- Claudio Hermida School of Mathematics and Statistics F07, University of Sydney, Sydney, NSW 2006, Australia From cat-dist Wed Jun 23 11:13:59 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id JAA07489 for categories-list; Wed, 23 Jun 1999 09:08:36 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-Id: <4.1.19990622202045.00a20100@mail.oberlin.net> X-Sender: cwells@mail.oberlin.net X-Mailer: QUALCOMM Windows Eudora Pro Version 4.1 Date: Tue, 22 Jun 1999 20:25:40 -0400 To: categories@mta.ca From: Charles Wells Subject: categories: Correct email address Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: My correct email address is charles@freude.com. If you are still using the apk.net address be warned that it will die very very soon. Thanks, Charles Wells, Department of Mathematics, Case Western Reserve University, 10900 Euclid Ave., Cleveland, OH 44106-7058, USA. EMAIL: charles@freude.com. OFFICE PHONE: 216 368 2893. FAX: 216 368 5163. HOME PHONE: 440 774 1926. HOME PAGE: URL http://www.cwru.edu/artsci/math/wells/home.html From cat-dist Wed Jun 23 11:28:21 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id JAA11823 for categories-list; Wed, 23 Jun 1999 09:51:12 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Wed, 23 Jun 1999 13:43:52 +0100 (BST) Message-Id: <9569.199906231243@craro.dcs.ed.ac.uk> To: categories@mta.ca Subject: categories: CTCS 99 CALL FOR PARTICIPATION, DEADLINE 19th July From: "Martin Hofmann" Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: CATEGORY THEORY AND COMPUTER SCIENCE (CTCS'99) 10-12 SEPTEMBER 1999, EDINBURGH, SCOTLAND http://www.dcs.ed.ac.uk/home/ctcs99 CALL FOR PARTICIPATION CTCS '99 is the 8th conference on "Category Theory and Computer Science." The purpose of the conference series is the advancement of the foundations of computing using the tools of category theory. While the emphasis is upon applications of category theory, it is recognized that the area is highly interdisciplinary. Previous meetings have been held in Guildford (Surrey), Edinburgh, Manchester, Paris, Amsterdam, Cambridge, and S. Margherita Ligure (Genova). This document contains 1. Invited speakers 2. List of accepted papers 3. Programme committee 4. Registration form A WWW-version containing all this information plus abstract of contributed papers can be found under www.dcs.ed.ac.uk/home/ctcs99 1. Invited speakers ------------------- Ryu Hasegawa Univ. of Tokyo (Japan) Peter Freyd Univ. of Pennylvania (USA) Marcelo Fiore Univ. of Sussex (UK) Doug Smith Kestrel Institute (USA) 2. List of accepted papers (19 out of 39 submissions) -------------------------- Concurrent Realizations of Reactive Systems. Marek Bednarczyk, Andrzej Borzyszkowski Functorial semantics for Petri nets under the individual token philosophy. Roberto Bruni, Jose Meseguer, Ugo Montanari, Vladimiro Sassone Equational Lifting Monads. Anna Bucalo, Alex Simpson, Carsten Fuehrmann Structured Theories and Institutions F Duran, J Meseguer Coalgebra to Algebra Morphisms. A Eppendahl On the Semantics of Message Passing Processes. Lindsay Errington A Fully abstract presheaf semantics for SCCS with finite delay. Thomas Hildebrandt Abstract Games for Linear Logic. Martin Hyland, Andrea Schalk Internal Languages for Autonomous and *-Autonomous Categories. T W Koh and C-H L Ong Dependent Coercions. Zhaohui Luo and Sergei Soloviev Precategories for combining probabilistic automata. Paulo Mateus, Amilcar Sernadas, Cristina Sernadas Monads, shapely functors, and traversals. E Moggi, G Belle, C B Jay Exhausting Strategies, Joker Games and IMLL with Units. A S Murawski and C-H L Ong Hilbert Q-Modules and Nuclear Ideals in the Category of v-Semilattices with a Duality. Jan Paseka A Coalgebraic Foundation for Linear Time Semantics. John Power, Daniele Turi Denotational Completeness Revisited. Thomas Streicher A domain-theoretic semantics of lax generic functions. Hideki Tsuiki A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting. Fabio Gadducci, Reiko Heckel and Merce Llabres. Higher-dimensional syntax. Martin Wehr. 3. Programme committee ---------------------- J. Adamek TU Braunschweig (Germany) N. Benton Microsoft Research, Cambridge (UK) R. Blute U. Ottawa (Canada) T. Coquand Chalmers (Sweden) M. Escardo LFCS Edinburgh (UK) M. Hasegawa Kyoto Univ. (Japan) M. Hofmann (Chair) LFCS Edinburgh (UK) P. O'Hearn Queen Mary West (UK) D. Pavlovic Kestrel Institute (California) H. Reichel TU Dresden (Germany) G. Rosolini U. Genova (Italy) A. Scedrov U. Penn (Pennsylvania) Organising Committee -------------------- S. Abramsky LFCS Edinburgh (UK) P. Dybjer Chalmers U. (Sweden) E. Moggi U. Genova (Italy) A. Pitts U. Cambridge (UK) 4. Registration form -------------------- Please complete this form and email it to ctcs99-reg@dcs.ed.ac.uk before 19th July 1999. You can also fax the form to +44 131 667 7209 Attn: CTCS-REG or send it to M Lekuse, CTCS-REG, JCMB, KB, Mayfield Rd, Edinburgh EH9 3JZ, UK. ******************************************************* * REGISTRATION FOR CTCS '99 * ******************************************************* A PERSONAL DETAILS ------------------ LAST NAME: _______________________________ FIRST NAME: ______________________________ AFFILIATION: _____________________________ ADDRESS: _________________________________ _________________________________ _________________________________ PHONE NUMBER: ____________________________ FAX: _____________________________________ E-MAIL: __________________________________ WWW (optional): __________________________ DATE OF ARRIVAL: __/__ 1999 DATE OF DEPARTURE: __/__ 1999 ANY SPECIAL DIETARY REQUIREMENTS (e.g. vegetarian): ______________________ B CONFERENCE FEES ----------------- The conference fee will cover lunches, coffee breaks, and proceedings. (It also includes costs for invited speakers and seminar room bookings.) Regular Student -------------------------------------------- Early registration: GBP115 GBP95 by 19th July Late registration: GBP170 GBP170 after 19th July There will be a conference dinner on Saturday, 11th September. It will cost GBP30 (students GBP15). I will attend the dinner YES ( ) NO ( ) Total fees payable: GBP ____ I have paid the fees by ____________________ on __/__1999. Please pay your fee by - bank draft in GBP - Eurocheque in GBP - any other cheque drawn on a British bank payable to "The University of Edinburgh". Unfortunately, we cannot acccept credit cards and bank transfers. C ACCOMMODATION --------------- We should like to ask you to book your own accommodation directly. The Edinburgh Tourist Board offers a very efficient booking service. You can either book by phone (+44-131-473-3874), fax (+44-131-473-3636) or e-mail (conventions@eltb.org). When you contact them they will supply you with a booking form which lists a number of accommodation types from simple guest houses to 5* hotels. Please book early. Although the Edinburgh International Festival will be over, September is still a very busy time. ---------------------------------------------------------------- **Please state clearly on the accommodation booking form that your accommodation should be within easy reach of the King's Buildings, University of Edinburgh.** ---------------------------------------------------------------- You should receive confirmation of your booking within one day. You need to give them your credit card number which will serve as a security. You will actually have to pay your accommodation directly later. If you do not have a credit card, or you encounter any difficulties in booking your accommodation, then please get in touch with us directly. Please contact (ctcs99-reg@dcs.ed.ac.uk) and state your requirements. The conference will be held in the James Clerk Maxwell Building (Lecture theatre B), King's Buildings, Edinburgh EH9 3JZ. You will find maps at http://www.visres.ed.ac.uk/internal/maps. Important dates --------------- 9 April 1999 Notification of intention to submit 23 April 1999 Submission deadline 4 June 1999 Notification of authors of accepted papers 30 July 1999 Deadline for final versions of accepted papers Address for paper submissions ----------------------------- Martin Hofmann Laboratory for Foundations of Computer Science Division of Informatics JCMB, King's Buildings Mayfield Road Edinburgh EH9 3JZ Scotland Local organization ------------------ Monika Lekuse Laboratory for Foundations of Computer Science Division of Informatics JCMB, King's Buildings Mayfield Road Edinburgh EH9 3JZ Scotland Conference e-address ctcs99@dcs.ed.ac.uk -------------------- Conference homepage http://www.dcs.ed.ac.uk/home/ctcs99 ------------------- Related event 2nd APPSEM workshop, 6-9 September 1999 ------------- http://www.md.chalmers.se/Cs/Research/Semantics/APPSEM/index.html From cat-dist Thu Jun 24 16:15:03 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id OAA21498 for categories-list; Thu, 24 Jun 1999 14:48:51 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Thu, 24 Jun 1999 08:53:40 -0500 From: Walter Tholen Subject: categories: HHA article available To: categories@mta.ca X-Mailer: Z-Mail Pro 6.2, NetManage Inc. [ZM62_16E] X-Priority: 3 (Normal) References: <199906241108.OAA06392@rmi-sun.rmi.acnet.ge> Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; CHARSET=ISO-8859-1 Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: The following paper is now available: A Categorical Guide to Separation, Compactness and Perfectness Walter Tholen Based on a rather arbitrary class of morphisms in a category, which play the role of "closed maps", we present a general approach to separation and compactness, both at the object and the morphism levels. It covers essential parts of the classical topological theory, generalizes various previous categorical treatments of the theme, and allows for a number of less expected applications outside topology. Homology, Homotopy and Applications, Vol. 1, 1999, No. 6, pp 147-161 http://www.rmi.acnet.ge/hha/volumes/1999/n6/n6.dvi http://www.rmi.acnet.ge/hha/volumes/1999/n6/n6.ps http://www.rmi.acnet.ge/hha/volumes/1999/n6/n6.dvi.gz http://www.rmi.acnet.ge/hha/volumes/1999/n6/n6.ps.gz ftp://ftp.rmi.acnet.ge/pub/hha/volumes/1999/n6/n6.dvi ftp://ftp.rmi.acnet.ge/pub/hha/volumes/1999/n6/n6.ps ftp://ftp.rmi.acnet.ge/pub/hha/volumes/1999/n6/n6.dvi.gz ftp://ftp.rmi.acnet.ge/pub/hha/volumes/1999/n6/n6.ps.gz From cat-dist Thu Jun 24 16:17:50 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id OAA10129 for categories-list; Thu, 24 Jun 1999 14:35:07 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f From: Thomas Streicher Message-Id: <199906241455.AA212296118@fb0448.mathematik.tu-darmstadt.de> Subject: categories: Announcement WD'99 To: categories@mta.ca Date: Thu, 24 Jun 1999 16:55:17 +0200 (MESZ) Cc: appsem@cs.chalmers.se, comprox@doc.ic.ac.uk, tics@doc.ic.ac.uk X-Mailer: ELM [version 2.4ME+ PL47 (25)] Mime-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: Sorry, if you receive this announcement several times ! 2nd Announcement of 5th DOMAINS WORKSHOP (Darmstadt, 23. - 26. September 1999) Dear colleagues, the 5th Workshop on Domains will take place in Darmstadt from Thursday, the 23rd of September till Sunday, the 26th of September. We will start on Thursday after lunch. In this session there will be talks by D.Scott and A.Jung on the occasion of Klaus Keimel's 60th Birthday. Afterwards, there will be a football match in the early evening followed by a barbecue. Whether there will be program on Sunday or it will be the day of departure will depend on the number of talks that people want to deliver. The idea of having in principle two full days for talks is motivated mainly by the intention to avoid a too dense schedule and leave enough time for discussion. The talks should concentrate on the following topics - Classical Domain Theory - Denotational Semantics of Programming Languages - Categorical Logic and Realisability - Synthetic Domain Theory - Non-Classical Domain Theory (Stable Domains, Full Abstraction ...) - Exact Computation on Classical Spaces This list is not exclusive and talks on related topics are encouraged. As usual there will be "open house" in the sense that there is no refereeing and people are invited to talk about work in progress. For registration, please, send a message to marz@mathematik.tu-darmstadt.de together with title and abstract of your talk. If you want to give a talk you have to tell us till 23rd August 1999. More information about the workshop can be found at the homepage http://www.mathematik.tu-darmstadt.de/~erker/wd5/ In particular, there you can find an address via which you can reserve accommodation. We also plan to organise some private accommodation for undergraduate students who cannot afford to pay the hotel expenses. Awaiting your registration Michael Marz, Thomas Streicher From cat-dist Sun Jun 27 12:27:15 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id LAA32708 for categories-list; Sun, 27 Jun 1999 11:16:24 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Sat, 26 Jun 1999 17:19:47 +0100 (BST) From: Marta Z Kwiatkowska Message-Id: <199906261619.RAA22190@gromit.cs.bham.ac.uk> To: categories@mta.ca Subject: categories: PROBMIV'99: Call for Participation Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: [Please circulate this to anyone interested. Apologies for multiple copies.] _________________________________________________________________________ CALL FOR PARTICIPATION PROBMIV'99 2nd International Workshop on Probabilistic Methods in Verification http://fmt.cs.utwente.nl/probmiv99/ a satellite to CONCUR'99 Eindhoven, 23rd Aug 1999 (to coincide with EXPRESS'99, another satellite) >>>>>>>>>>>EARLY REGISTRATION FOR CONCUR ENDS 1st JULY<<<<<<<<<<<<<<<<<<< _________________________________________________________________________ SCOPE OF THE WORKSHOP Probability inherently features in software and hardware systems, either as a means to derive efficient solutions (e.g. randomization), or as a result of unreliable or unpredictable behaviour (e.g. fault-tolerant systems, computer networks, etc). *Probabilistic verification* encompasses a range of theoretical, algorithmic and programming methods that assist in establishing the correctness of probabilistic systems against specifications. Typically this involves calculating the probability bounds for a temporal logic formula being satisfied, based on an appropriate probability space on computations, but also includes properties such as cost analysis and long-run average. Additionally, probabilistic verification can provide guarantees the specifications hold with satisfactory probability in cases when conventional model checking is not feasible. The idea of this workshop is to bring together researchers that apply probabilistic methods across the whole spectrum of verification. The meeting aims to enable cross-fertilisation of ideas and techniques between areas that are usually not in regular contact through conferences, from semantics, probability theory, performance analysis and computational linear algebra, through randomized algorithms, probabilistic logics, model checking, abstract interpretation, to practical experimental work, tools and applications. This is the second workshop of this kind. The first meeting, PROBMIV'98 was held in 1998 as a satellite to LICS. In 1999, the workshop takes place as a satellite to CONCUR. _________________________________________________________________________ INVITED PAPERS Rance Cleaveland, SUNY at Stony Brook: Probabilistic Model Checking via the Modal Mu-Calculus Bengt Jonsson, University of Uppsala: On Model Checking Infinite-State Probabilistic Systems Kim Larsen, Aalborg University: Testing and Verification of Probabilistic Systems Oded Maler, Verimag: On the Representation of Probabilities over Structured Domains _________________________________________________________________________ ACCEPTED CONTRIBUTIONS Christel Baier, University of Mannheim, and Holger Hermanns, University of Twente: A lazy synchronous calculus of fully probabilistic processes Luca de Alfaro, University of California at Berkeley: The Verification of Probabilistic Systems under Memoryless Partial-Information Policies is Hard Josee Desharnais, McGill University: A logical characterization of probabilistic simulation Alessandra Di Pierro, University of Pisa, and Herbert Wiklicky, Imperial College: Ergodic Average in Constraint Programming Manfred Jaeger, Max-Planck-Institut at Saarbrucken: Fairness, Computable Fairness and Randomness Jeremy Sproston, University of Birmingham: Analysing subclasses of probabilistic hybrid automata _________________________________________________________________________ STEERING AND PROGRAM COMMITTEE Rajeev Alur, University of Pennsylvania Christel Baier, University of Mannheim Luca de Alfaro, University of California at Berkeley Michael Huth, Kansas State University Joost-Pieter Katoen, University of Twente Marta Kwiatkowska, University of Birmingham (chair) Roberto Segala, University of Bologna Prakash Panangaden, McGill University _________________________________________________________________________ RELATED EVENTS PROBMIV'99 is organized as a satellite workshop of CONCUR'99, the 10th International Conference on Concurrency Theory, which will take place in Eindhoven on August 24-27, 1999. PROBMIV'99 coincides with the EXPRESS'99 workshop on Expressiveness in Concurrency, another satellite of CONCUR'99. REGISTRATION is via the registration form for CONCUR'99, available at URL http://www.win.tue.nl/concur99/ There is no registration charge for PROBMIV'99, but pre-registration is required. Note that early registration for CONCUR'99 ends on ***1st July***. _________________________________________________________________________ LOCAL ORGANISATION Holger Hermanns, University of Twente Erik de Vink, Free University Amsterdam _________________________________________________________________________ FURTHER INFORMATION For more information please see URLs PROBMIV'99 http://fmt.cs.utwente.nl/probmiv99/ CONCUR'99 http://www.win.tue.nl/concur99/ EXPRESS'99 http://www.docs.uu.se/~victor/Express/express99.shtml PROBMIV'98 http://www.cs.bham.ac.uk/~mzk/probmiv98.html _________________________________________________________________________ From cat-dist Mon Jun 28 12:45:41 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id KAA09094 for categories-list; Mon, 28 Jun 1999 10:57:17 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f X-Sender: street@hera.mpce.mq.edu.au Message-Id: Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Mon, 28 Jun 1999 13:33:28 +1000 To: categories@mta.ca From: Ross Street Subject: categories: The Scott Russell Johnson Memorial Fellowship Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: Dear "Categories" Would you please post this advertisement on your electronic Bulletin Board? Regards, Ross MACQUARIE UNIVERSITY DIVISION OF INFORMATION AND COMMUNICATION SCIENCES MATHEMATICS DEPARTMENT Research Fellow in Mathematics (Full time, fixed term) **Scott Russell Johnson Memorial Fellowship** This Fellowship is funded by a generous donation to the Centre of Australian Category Theory (CoACT) in memory of Dr Scott Russell Johnson. The appointee will conduct research within CoACT; other duties include seminar presentations, postgraduate supervision and relevant teaching. Applicants must have an outstanding PhD (or the equivalent), or post-doctoral research achievements at an outstanding level, in a relevant field of mathematics such as category theory, algebraic topology, algebraic geometry, or low-dimensional topology. Enquiries should be addressed to the Director of CoACT, Prof Ross Street (email , phone (02)9850 8921), or Mrs Elaine Vaughan (email , phone (02) 9850 8947, fax (02) 9850 8114). The position is available immediately for a period of three years. The appointment will be subject to the satisfactory completion of a probationary period of three months. Salary Range: Level A $34,647 to $47,019 per annum. An appointee with a PhD will commence at least at Point 6 on the salary scale, at $43,803 per annum, plus superannuation. Level B $49,495 to $58,776 per annum. Level of appointment will depend on relevant experience. Applications including curriculum vitae setting out research interests and publications, the reference number, Australian visa status, and the names and addresses (including email) of three referees should be forwarded to the Recruitment Manager, Personnel Office, Macquarie University, NSW 2109 by 6 August 1999. Women are particularly encouraged to apply. Equal Employment Opportunity and No Smoking in the Workplace are University Policies.