Categories

Download

categories-list@categories.org.au

July 1996

1 participants
1 discussions

Re: Monoidal adjunctions
by None 01 Jul '96

01 Jul '96

Date: Mon, 1 Jul 1996 15:09:45 +1000 From: Ross Street <street(a)mpce.mq.edu.au> Answer to the question of Achim Jung, Mathias Kegelmann & Eike Ritter: See a paper of Max Kelly in Springer Lecture Notes in Math 420 called "Doctrinal adjunction" pages 257-280. The Proposition has other clauses: e.g., an adjunction in the 2-category of (symm) monoidal categories and monoidal functors is exactly of the kind you describe. -- Ross Street Date: Mon, 1 Jul 1996 10:53:26 -0300 (ADT) Subject: Re: E-address needed for Vera Trnkova, Charles Univ., Prague Date: Mon, 1 Jul 96 10:11 BST From: Dr. P.T. Johnstone <P.T.Johnstone(a)pmms.cam.ac.uk> I have the address trnkova(a)karlin.mff.cuni.cz for Vera Trnkova. I haven't used it recently, but it was certainly working a year ago when I was sending out messages about the Cambridge category theory meeting. Peter Johnstone Date: Mon, 1 Jul 1996 10:55:15 -0300 (ADT) Subject: Re: Monoidal adjunctions Date: Mon, 1 Jul 1996 13:36:36 +0200 From: Max Kelly <kelly_m(a)maths.su.oz.au> Dear Jung et al., the result you mention, in a more general form, is in my paper "Doctrinal adjunction" in Springer Lecture Notes in Math. 420 (1974). Regards, Max Kelly. Date: Mon, 1 Jul 1996 20:47:52 -0300 (ADT) Subject: Re: Monoidal adjunctions Date: Mon, 01 Jul 1996 15:11:06 +0100 From: Nick Benton <Nick.Benton(a)cl.cam.ac.uk> Achim wrote: >LEMMA > >Let (F,G) be an adjunction between (symmetric) monoidal categories C >and C'. If F (the left adjoint) is a (symmetric) monoidal functor such >that n consists of isomorphisms and p is an isomorphism then G is also >monoidal and unit and counit are monoidal natural transformations. > > >The proof is pretty straightforward. Yet, we could not find such a >lemma anywhere in the literature. Can anyone help with pointers to >existing work? As well as the paper cited by Ross Street, this is mentioned, though not actually stated as a lemma, on page 15 of the technical report version of my paper A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models Technical report 352 University of Cambridge Computer Laboratory October 1994 I noticed it in connection with a proof-theoretically unpleasant `adjoint' presentation of LNL logic (Section 3.1.2) in which the rules for the two functors are just F\Theta |- A (in L) ------------ \Theta |- GA (in C) and \Theta |- GA (in C) ------------ F\Theta |- A (in L) Since G doesn't appear on the left in either of these rules, it's not *immediately* clear why G has to behave well with respect to the monoidal structures interpreting the commas in the antecedents. The answer is in the lemma above. Nick Benton Date: Wed, 24 Jul 1996 10:33:32 -0300 (ADT) Subject: ACSW'97 2nd call for papers Date: Wed, 10 Jul 1996 11:48:09 +1000 From: Len Hamey <len(a)mpce.mq.edu.au> ---------------------- SECOND CALL FOR PAPERS ---------------------- AUSTRALASIAN COMPUTER SCIENCE WEEK ================================== encompassing... 20th Australasian Computer Science Conference Computing: The Australasian Theory Symposium The Australasian Computer Architecture Conference 3-7 February 1997, Macquarie University, Sydney, Australia ACSC'97, CATS'97, and ACAC'97 The Australasian Computer Science Week has emerged as a regular event on the academic calendar. It is held under the auspices of the Computer Science Association and this year it encompasses three main conferences 5-7 February: The 20th Australasian Computer Science Conference 3-4 February: Computing: The Australasian Theory Symposium 3-4 February: The Australasian Computer Architecture Conference and also a variety of allied events. All conferences will be hosted by the Department of Computing at Macquarie University. We invite submissions for the three conferences, as set out below. All conferences share a common set of important dates: +----------------------------------------------+ | Submission Deadline: 15 August 1996 | | Notification: 1 November 1996 | | Camera-ready copy: 24 November 1996 | +----------------------------------------------+ Full submission details and further information about the week can be obtained at http://www.mq.edu.au/acsw97 or acsw97(a)mpce.mq.edu.au. Organising Chair: Sponsors: Jan Hext, Macquarie Apple Computer Australia Pty Ltd Arnott's Biscuits Ltd Organising Committee: Joint Research Centre for Advanced System Engineering John Debenham, UTS Macquarie University Len Hamey, Macquarie Microsoft Research Institute Michael Johnson, Macquarie University of Technology, Sydney Mehmet Orgun, Macquarie Malti Patel, Macquarie Kang Zhang, Macquarie -----------------+----------------- ACSC'97 - Twentieth Australasian Computer Science Conference ============================================================ 5-7 February 1997 Macquarie University, Sydney, Australia ACSC'97 is the major Australasian computer science conference and is now in its twentieth year. The conference has a high reputation for the quality of the research presented, ranging from theory and experiment to practice and application. Submissions are now invited for ACSC'97. We welcome papers describing original contributions in all fields of Computer Science research and education. Each paper will be judged on its originality, significance, correctness, and clarity. Its contribution should be clearly explained in both general and technical terms, and authors should make every effort to ensure that its technical content is understandable by a broad audience. Submission of a paper should be regarded as an undertaking that, should the paper be accepted, at least one of the authors will attend the conference to present the work. Submitted papers should be no longer than 6,000 words. To be considered, four printed copies must reach the address below by the submission date, which is a hard deadline. ACSC'97 Department of Computer Science The University of Melbourne Parkville, VIC 3052 Australia Enquiries about the program should be directed to acsc97(a)cs.mu.oz.au. Program Chair: Rao Kotagiri, Melbourne Justin Zobel, RMIT Program Committee: David Abramson, Griffith Chris McDonald, UWA Paul Bailes, Queensland Kim Marriott, Monash Richard Brent, ANU Alistair Moffat, Melbourne Cristian Calude, Auckland Ron Morrison, St. Andrews Geoff Dromey, Griffith John O'Callaghan, CSIRO Peter Eades, Newcastle Mehmet Orgun, Macquarie Jenny Edwards, UTS Michael Oudshoorn, Adelaide Norman Foo, UNSW David Powers, Flinders Rhys Francis, CSIRO Anand Rao, AAII Andrzej Goscinski, Deakin John Roddick, South Australia John Gough, QUT John Rosenberg, Sydney Stephen Hood, DSTO Ron Sacks-Davis, Melbourne Ray Jarvis, Monash Arun Sharma, UNSW Chris Johnson, ANU John Staples, Queensland Jyrki Katajainen, Copenhagen Ling Tok Wang, NU of Singapore Ian Witten, Waikato -----------------+----------------- CATS'97 - Computing: The Australasian Theory Symposium ====================================================== 3-4 February 1997 Macquarie University, Sydney, Australia CATS aims at bringing together computing theorists from the Australasian region. Papers are solicited on all aspects of the theory of computer science, including, but not limited to: Category Theory, Complexity, Concurrency, Formal Semantics, Logic, Specification and Verification, and all aspects of the theory of Algorithms (including combinatorial algorithms, distributed algorithms, geometric algorithms, and parallel algorithms). CATS'97 follows on from CATS'94 which was held in Sydney in December 1994, and CATS'96 which was held in Melbourne in February 1996. It is hoped that the meeting will have an `active workshop' atmosphere, with ample time for discussions. Contributions describing work in progress are welcome. Submissions should be sent in Postscript format to cats97(a)cs.rmit.edu.au by the submission deadline. For final submissions, LaTEX style files and MS Word style sheets will be provided via the URL http://www.cs.rmit.edu.au/cats97. Authors unable to access or use these style files will be asked to prepare papers of at most ten pages in 10-point, two-column format. Papers will be judged on originality, significance, correctness, and clarity. The contribution of the paper should be clearly explained in both general and technical terms, and authors should make every effort to ensure that the technical content of their papers is understandable by a broad audience. Submission of a paper should be regarded as an undertaking that, should the paper be accepted, at least one of the authors will attend the conference to present the work. General Chair: Program Committee: Barry Jay, UTS Cristian Calude, Auckland Hossam ElGindy, Newcastle Program Chair: Jeremy Gibbons, Auckland Kurt Mehlhorn, Max Planck Ins. James Harland, RMIT Dale Miller, Pennsylvania Eugenio Moggi, Genoa Local Chair: Tadao Takaoka, Ibaraki Arun Sharma, UNSW Michael Johnson, Macquarie Harald So/ndergaard, Melbourne Antonius Symvonis, Sydney Phil Wadler, Glasgow -----------------+----------------- ACAC'97 - Australasian Computer Architecture Conference ======================================================= 3-4 February 1997 Macquarie University, Sydney, Australia ACAC is the principal annual Australasian conference on computer architecture. ACAC'97 follows on from previous computer architecture workshops held in Hobart, Brisbane and Adelaide, and its highly successful emergence as a fully refereed 2-day research conference in Melbourne in 1996. ACAC'97 will contain sessions for research group reports as well as for formal research papers. This forum will allow those involved in the field to see what new research is happening in the region and to encourage cooperative research and sharing of resources. ACAC'97 invites the following two categories of papers: Original research papers: Original papers in all areas of computer architecture research are invited. Papers describing implemented systems and novel applications are particularly welcomed. All papers will be refereed and accepted papers will be published in the conference proceedings. LaTEX style files will be made available on acceptance. Australasian research group reports: Reports on Australasian computer architecture research projects are also invited. They should be in the same format and will be included in a section of the proceedings but will not go through the full rigorous reviewing process. Papers should be submitted in uuencoded Postscript form to acac97(a)ee.newcastle.edu.au. If electronic submission is not possible, four paper copies should be sent to: ACAC'97 c/- Andrew Spray Department of Electrical and Computer Engineering The University of Newcastle, Callaghan, NSW 2308 Australia General Chair: Program Committee: John Morris, UWA David Abramson, Griffith Greg Egan, Monash Program Chair: Michael Groves, Flinders Mohan Kumar, Curtin Andrew Spray, Newcastle David Powers, Flinders Clemens Szyperski, QUT Publication Chair: Ronald Pose, Monash Date: Wed, 24 Jul 1996 10:39:48 -0300 (ADT) Subject: LOGSEM workshop in Birmingham Date: Thu, 11 Jul 1996 14:07:49 +0100 From: Valeria DePaiva <V.DePaiva(a)cs.bham.ac.uk> The researchers from the EU-funded projects Categorical Logic in Computer Science (CLiCS) I and II are holding a meeting dedicated to the theme "Logic and Semantics in Programming" at the School of Computer Science, University of Birmingham. The meeting is happenning over the weekend 13-16th September and talks are invited on the broad topics of mathematical structures in semantics, type systems for programming languages, logic and concurrency theory. Accomodation is available at 23.55 per night in University House, just across the street from the campus. We intend to start after lunch on Friday and finish with lunch on Monday, so it may be possible for some of you to travel on Friday and/or Monday. All the best, Valeria de Paiva and Achim Jung. ----------------------------------------------------------------------------- LOGSEM Workshop Logic and Semantics of Programming Languages September 13 - 16, 1996 School of Computer Science The University of Birmingham REGISTRATION FORM ================= Name: ---- Affiliation: ----------- Do you want to give a talk? --------------------------- Arrival: ------- Departure: --------- Shall we reserve a room for you in University House? (23.55 B&B): ---------------------------------------------------------------- Date: Wed, 24 Jul 1996 10:42:24 -0300 (ADT) Subject: Vancouver Meeting Date: Tue, 16 Jul 96 21:46:48 -0700 From: John MacDonald <johnm(a)math.ubc.ca> Category Meetings at Vancouver July 13-18, 1997 Preliminary Announcement As announced at the Sussex meetings Vancouver will host meetings in Category Theory during July 1997. These meetings will be held at the University of British Columbia campus in Vancouver, Canada. The UBC Conference Centre has set aside a block of rooms for this meeting including some double rooms and some rooms for families as well as single rooms. There are hotels available off the campus as well. We are interested in having as many category theorists and students of category theory as possible attend these meetings in order to provide the best chance for everyone to have a memorable and valuable mathematical experience. Details regarding this conference will be given in future announcements. In particular an accomodation form will be sent by email early in 1997 as well as information concerning submission of abstracts by those wishing to speak and registration information for those wishing to attend. John MacDonald Date: Wed, 24 Jul 1996 10:43:13 -0300 (ADT) Subject: paper Date: Wed, 17 Jul 1996 18:07:50 +0100 (BST) From: Dusko Pavlovic <D.Pavlovic(a)doc.ic.ac.uk> Dear Categories, The following preprint by me (to appear in MSCS) is available via http://www.cogs.susx.ac.uk/users/duskop/index.html or by anonymous ftp from ftp.cogs.susx.ac.uk file pub/users/duskop/CLNA.ps.gz. Regards, -- Dusko Pavlovic CATEGORICAL LOGIC OF NAMES AND ABSTRACTION IN ACTION CALCULI Abstract. Milner's action calculus implements abstraction in monoidal categories, so that familiar lambda-calculi can be subsumed together with the pi-calculus and the Petri nets. Variables are generalised to *names*: only a restricted form of substitution is allowed. In the present paper, the well-known categorical semantics of the lambda-calculus is generalised to the action calculus. A suitable functional completeness theorem for symmetric monoidal categories is proved: we determine the conditions under which the abstraction is definable. Algebraically, the distinction between the variables and the names boils down to the distinction between the transcendental and the algebraic elements. The former lead to polynomial extensions, like e.g. the ring Z[x], the latter to algebraic extensions like Z[\sqrt{2}] or Z[i]. Building upon the work of P.~Gardner, we introduce *action categories*, and show that they are related to the static action calculus exacly as cartesian closed categories are related to the lambda-calculus. Natural examples of this structure arise from allegories and cartesian bicategories. On the other hand, the free algebras for any commutative Moggi monad form an action category. The general correspondence of action calculi and Moggi monads will be worked out in a sequel to this work. Date: Wed, 24 Jul 1996 10:44:48 -0300 (ADT) Subject: Re: lifting of sm(c)-structure Date: Fri, 19 Jul 1996 10:22:31 +1000 From: Ross Street <street(a)mpce.mq.edu.au> Answer to the following edited question: >Date: Wed, 17 Jul 1996 18:18:22 MESZ >From: Thomas Streicher <streicher(a)mathematik.th-darmstadt.de> >To: categories(a)mta.ca >Subject: lifting of sm(c)-structure >could someone provide me with a reference of a paper of B. Day where he >described how to lift a symmetric monoidal (closed) structure on a small >category C to the category of presheaves C^ = Set^C^op in a way that the >Yoneda functor preserves the symmetric monoidal structure ?? >Thomas Streicher This was done in Brian Day's thesis [D1]. It is accessible in [D2], [D3]. Starting with any monoidal category C with tensor product #, we obtain a promonoidal category C with P(a,b,c) = C(a#b,c). Then the presheaf category C^ becomes a (left and right) closed cocomplete monoidal category under the convolution tensor product; the Yoneda embedding y : C --> C^ is strong monoidal (preserves tensor). In fact, this is the universal monoidal cocompletion (see [IK]). If C is symmetric, so is C^ and y preserves the symmetry. [D1] B.J. Day, Construction of Biclosed Categories, PhD Thesis, University of New South Wales, Australia (1970). [D2] B.J. Day, On closed categories of functors, Midwest Category Seminar Reports IV, Lecture Notes in Math. 137 (Springer, 1970) 1-38. [D3] B.J. Day, An embedding theorem for closed categories, Category Seminar Sydney 1972-73, Lecture Notes in Math. 420 (Springer, 1970) 55-64. [D4] B.J. Day, An embedding of bicategories, (Dept of Pure Math Report, The University of Sydney, 1976) [D5] B.J. Day, Note on monoidal monads, Journal of the Australian Math Society 23 (1977) 292-311. [D6] B.J. Day, Promonoidal functor categories, Journal of the Australian Math Society 23 (1977) 312-328. [D7] B.J. Day, Biclosed bicategories: localisation of convolution, Macquarie Math Reports #81-0030 (April 1981). [IK] G.B. Im and G.M. Kelly, A universal property of the convolution monoidal structure, Journal of Pure & Applied Algebra 43 (1986) 75-88. Best regards, Ross (Street) Date: Wed, 24 Jul 1996 10:45:46 -0300 (ADT) Subject: websites, ftp, and copyright Date: Fri, 19 Jul 1996 09:24:49 -0400 From: Phil Scott <phil(a)csi.UOttawa.CA> Dear Colleagues: As many of you know, with the increasing use of web- and ftp-sites for depositing papers, there is a problem about copyright and legal issues about who owns the rights to your papers and if you can distribute electronic copies (particularly after they have been published). I am thinking mainly of Journals but certainly the same question exists for other types of published material. This came to note recently at McGill when a statistician was ordered by Academic Press to remove something from his website, for copyright violation (see the web-site of Keith Worsley, http://www.math.mcgill.ca/~keith (see his article 1995 by Worsley,Marrett, Neelin, Evans--when you click on it the letter from AP will appear) ). Independently of this particular case, the issue is obviously of increasing importance, given universal use of electronic sites at universities as well as shrinking library budgets. There are many issues, from questions of how to keep in business traditional, high-quality journals (indeed, if they will--or should-- continue to exist in these days of web-publishing and electronic journals), to practical questions of what kind of publications will count towards tenure, promotion, research grants, etc. Viewpoints of academics vary considerably, from those who wish to continue the stability of traditional journals to those who wish to have non-commercial electronic publishing. I suspect economics will ultimately rule, but rational discussion with publishers has begun. On a practical note,during recent e-mail discussions with some colleagues (M. Barr, P. Freyd, A. Meyer, M. Mislove, J. Mitchell, A. Nerode, A. Scedrov), it was pointed out repeatedly that authors should keep their electronic rights, either by explicitly writing such on the copyright form mailed to them by publishers, or use some kind of general form. Andre Scedrov and John Mitchell kindly supplied the Stanford form, which I enclose below. I should also point out that many professional academic organizations (American and Canadian Math. Soc, Association of Symbolic Logic, etc.) and several commercial publishers do allow authors to keep electronic copies of their articles on public e-mail sites. Your comments much appreciated. Cheers, Philip Scott (phil(a)csi.uottawa.ca) ========================================================== Date: Tue, 16 Jul 1996 11:28:22 -0400 From: scedrov(a)saul.cis.upenn.edu (Andre Scedrov) Posted-Date: Tue, 16 Jul 1996 11:28:22 -0400 Subject: Re: copyright, academics, and websites I have been using the following form, which comes from Stanford, without any problems with hardcopy journals. I have not tried it yet with electronic journals. Some hardcopy journals, like the Bulletin of Symbolic Logic, maintain freely available electronic files of their published papers in their websites. Best, Andre ******************************************************* ATTACHMENT FOR PUBLISHER AGREEMENTS Note: this form should be attached to the publisher copyright form when the material you are submitting for publication is in whole, or in substantial part, available through the _____________ University Electronic Library. I, , have granted ____________ University nonexclusive rights to perform, display, and distribute all/ a substantial part/ of an earlier version of (name of article)__________________________________________________ to be published in (name ofpublication)_______________________________________________ _____________ University has the right to make this information available through electronic distribution and through its printed technical reports series. Date: Wed, 24 Jul 1996 10:48:04 -0300 (ADT) Subject: Grothendieck Date: Mon, 22 Jul 1996 13:08:39 +0100 From: Prof R. Brown <r.brown(a)bangor.ac.uk> I think the essence of this should be distributed on the category theory bulletin. Ronnie Brown >Return-Path: <pradines(a)picard.ups-tlse.fr> >Received: from sun2.nsfnet-relay.ac.uk by pragmatix.bangor.ac.uk (SMI-8.6/SMI-SVR4) > id PAA00657; Tue, 16 Jul 1996 15:05:44 +0100 >From: <pradines(a)picard.ups-tlse.fr> >Received: from oceane.cict.fr by sun2.nsfnet-relay.ac.uk with Internet SMTP (PP); Tue, 16 Jul 1996 14:56:25 +0100 >Received: from picard.ups-tlse.fr (picard.ups-tlse.fr [130.120.82.70]) by oceane.cict.fr (8.7.5/8.7.4) with SMTP id PAA11610 for <r.brown(a)bangor.ac.uk>; Tue, 16 Jul 1996 15:55:23 +0200 (MET DST) >Received: from [130.120.52.40] by picard.ups-tlse.fr; (5.65v3.2/1.1.8.2/18Jan96-0535PM) > id AA02510; Tue, 16 Jul 1996 16:01:04 GMT >Date: Tue, 16 Jul 1996 16:01:04 GMT >Message-Id: <9607161601.AA02510(a)picard.ups-tlse.fr> >To: r.brown(a)bangor.ac.uk (Prof R. Brown) >Subject: Grothendieck > >Dear Ronnie, >I send you a copy of a message which will be of interest for you (if you did not get it from another source). > Jean > > > > >Date: Wed, 10 Jul 1996 11:14:37 +0200 (MET DST) >To: mathmeca(a)oceane.cict.fr >From: Nicolas Saby <saby(a)darboux.math.univ-montp2.fr> (par les soins de reversat(a)cict.fr) >Subject: Grothendieck diffusion > > >Le departement de mathematiques de l'UMII vient de publier le >premier tome de "La longue marche..." d'Alexandre Grothendieck >et souhaiterait utiliser la liste de discussion biblos pour >faire connaitre cette publication. >Ci-joint un extrait de l'introduction : > >" Il y a bientot six ans Alexandre Grothendieck me sollicitait pour me >confier de nombreux documents (parmi lesquels plusieurs manuscrits >inedits) >en me donnant tout pouvoir dessus (en particulier un pouvoir d'edition >et de publication qu'il m'a confirme par ecrit >en juillet 95). Pris un peu au depourvu j'acceptai >cependant, considerant que mon role se limiterait probablement >a une fonction de conservation >provisoire en attendant une demande de restitution. >Les annees passant et A.Grothendieck ayant decide de >couper completement les >quelques fils qui le raccrochaient encore a la communaute >mathematique >(par exemple une adresse postale) je decidai il y a trois ans > de rendre accessible un manuscrit inedit redige en 80-81 >et intitule: > La longue marche a travers la theorie de Galois. >Pour etre utilisable le >manuscrit (de 1600 pages environ) devait etre prealablement >"dechiffre" >et tape (TEX) ce qui n'est que partiellement >realise a ce jour et fait l'objet de ce premier volume >(de 260 pages correspondant a 500 pages de manuscrit)." > > >Ce premier tome est maintenant edite et diffuse par >le departement de mathematiques de l'UMII au prix de >100FF + frais d'expedition (30FF pour la CEE). La commande >peut etre faite aupres de Jean Malgoire, le paiement peut se faire >par virement postal ou >cheque bancaire >a l'ordre de > L'AGENT COMPTABLE DE L'UM2 >adresse a >Jean Malgoire >dpt de maths cc051 >Universite de Montpellier II >34095 Montpellier cedex05 >FRANCE > >ou par virement CCP MONTPELLIER : 20041 01009 0523466F03030 >(Si vous utilisez le virement CCP veuillez m'informer directement >de votre paiement par e-mail (malgoire(a)math.univ-montp2.fr)ou par >courrier.) > > > > > Prof R. Brown School of Mathematics Dean St University of Wales Bangor Gwynedd LL57 1UT UK Tel: (direct) +44 1248 382474 (office) +44 1248 382475 Fax: +44 1248 355881 email: mas010(a)bangor.ac.uk wwweb: http://www.bangor.ac.uk/~mas010/home.html wwweb for maths: http: //www.bangor.ac.uk/ma Date: Wed, 24 Jul 1996 14:16:26 -0300 (ADT) Subject: Answer book for CTCS, 2nd Ed. Date: Wed, 24 Jul 1996 10:57:36 -0400 From: Michael Barr <barr(a)triples.math.mcgill.ca> In the second edition, the answer book was omitted (trying, not with a great deal of success, to hold the price down). We thought it was going to be published separately, but instead the publisher was simply sending a photocopy to all who requested it. All who knew to request it, in fact. So with their permission, we have posted it. On triples, it will be in usual place (~ftp/pub/barr) as ctcs.ansbook.[dvi,ps]. [ ,zip,gz]. Michael Date: Thu, 25 Jul 1996 09:15:32 -0300 (ADT) Subject: CFP Date: Thu, 25 Jul 1996 20:45:13 +0900 From: AKAMA Youji <akama(a)is.s.u-tokyo.ac.jp> PRELIMINARY CALL FOR PAPERS July 15, 1996 International Symposium on Theoretical Aspects of Computer Software (TACS'97) September 24 - 26, 1997 Tohoku University Sendai, Japan The TACS Symposium will focus on the theoretical foundations of programming and their applications. The topics of interest include: theoretical aspects of the design, semantics, analysis, and implementation of programming languages and systems; calculi and models of concurrency and parallel computation; categories and types in computer science; formalisms, methods, and systems for program specification, verification, synthesis, and optimization; constructive, linear, and modal logics in computer science; logics of programs. The scientific program will consist of invited lectures, contributed talks, demo sessions, and informal evening sessions. Proceedings containing the full papers of the invited and contributed talks will be published by Springer-Verlag as a volume of Lecture Notes in Computer Science. Invited Speakers: Robert Harper Carnegie Mellon University Jean-Jacques Levy INRIA Rocquencourt Robin Milner University of Cambridge Atsushi Ohori Kyoto University Carolyn Talcott Stanford University Conference Chair: Takayasu Ito Tohoku University Advisory Board: Rodney Burstall University of Edinburgh Robert L. Constable Cornell University Albert R. Meyer MIT (chair) John C. Mitchell Stanford University Gordon Plotkin University of Edinburgh Masahiko Sato Kyoto University Akinori Yonezawa University of Tokyo Program Chairs: Martin Abadi Systems Research Center Digital Equipment Corporation Palo Alto, CA 94301, USA email: ma(a)pa.dec.com Takayasu Ito Dept. of Computer and Mathematical Sciences Graduate School of Information Sciences Tohoku University [Aobayama Campus] Sendai, 980, Japan email: ito(a)ito.ecei.tohoku.ac.jp Program Committee: Martin Abadi Digital SRC Mariangiola Dezani University of Torino Masami Hagiya University of Tokyo Susumu Hayashi Kobe University Thomas A. Henzinger University of California at Berkeley Takayasu Ito Tohoku University Neil Jones University of Copenhagen Naoki Kobayashi University of Tokyo Jean-Jacques Levy INRIA Rocquencourt Peter O'Hearn Queen Mary and Westfield College Atsushi Ohori Kyoto University Luke Ong University of Oxford Frank Pfenning Carnegie Mellon University Benjamin Pierce Indiana University Natarajan Shankar SRI International Val Tannen University of Pennsylvania Frits Vaandrager University of Nijmegen TACS'97 will be sponsored by Tohoku University with the pending cooperation of Information Processing Society of Japan, Japan Society of Software Science and Technology, ACM SIGACT, and the Association for Symbolic Logic. Submission Information: All interested authors are invited to submit their full papers by email to: TACS97-submission(a)ito.ecei.tohoku.ac.jp Papers must be unpublished and not submitted for publication elsewhere, including proceedings of other symposia or workshops. Submissions should be in Postscript format. Authors are asked to use 8.5x11 pages (that is, U.S. letter paper size) and to make sure that their papers are easy to print on a variety of printers (e.g., by using standard fonts). The first page of each submission should include an email address and fax number of the corresponding author, if available. The length limit for submissions is 6000 words. Important Dates: Submission of full paper: January 10, 1997 Notification of acceptance: April 10, 1997 Deadline for final text: May 20, 1997 Any inquiry on TACS'97 should be sent to: TACS97(a)ito.ecei.tohoku.ac.jp Further information about TACS'97 can be obtained on the Web, at: http://tacs97.ito.ecei.tohoku.ac.jp/tacs97.html Date: Thu, 25 Jul 1996 15:44:28 -0300 (ADT) Subject: Change of Address Date: Thu, 25 Jul 1996 11:27:00 -0700 (PDT) From: Joseph Goguen <goguen(a)cs.ucsd.edu> Dear Colleagues, I am now at UCSD in sunny southernmost California, instead of damp old Oxford. Precise coordinates are given below. With regards, Joseph %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% Prof. Joseph A. Goguen, Dept. Computer Science & Engineering, University of California at San Diego, 9500 Gilman Drive, La Jolla CA 92093-0114, USA email: goguen(a)cs.ucsd.edu jgoguen(a)ucsd.edu www: http://www.comlab.ox.ac.uk/oucl/people/joseph.goguen.html http://www-cse.ucsd.edu/users/goguen [nothing here yet!] phone: (619) 534-4197 [my office]; -1246 [dept office]; -7029 [dept fax]; (619) 822-0702 [secy: Lisa Bodecker] office: 3131 Applied Math & Physics Bldg. Date: Wed, 31 Jul 1996 14:56:33 -0300 (ADT) Subject: Answers to "Category Theory for Computing Science" Date: Tue, 30 Jul 1996 12:22:37 -0400 From: Charles Wells <cfw2(a)po.cwru.edu> We have made the answers to the second edition of "Category Theory for Computing Science" available on the web, in two ways. 1) As Mike Barr already announced, you can get them by anonymous FTP, at triples.math.mcgill.ca in /pub/barr, files ctcs.ansbook.*. These are available in TeX DVI and Postscript formats. 2) You can also get them by webserver, at http://www.cwru.edu/CWRU/Dept/Artsci/math/wells/pub/papers.html#ansbook These are available in DVI, Postscript and Acrobat Reader formats. Charles Wells, Department of Mathematics, Case Western Reserve University 10900 Euclid Avenue, Cleveland, OH 44016-7058. Office phone: 216 368 2893. Math dept phone: 216 368 2880. Fax: 216 368 5163. Home phone: 216 774 1926. Home Page URL: http://www.cwru.edu/CWRU/Dept/Artsci/math/wells/home.html. "Some have said that I cannot sing; but no one will say that I didn't sing." --Florence Foster Jenkins

1 0