From cat-dist Tue Nov 2 22:08:29 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id UAA12015 for categories-list; Tue, 2 Nov 1999 20:41:00 -0400 (AST) X-Authentication-Warning: triples.math.mcgill.ca: barr owned process doing -bs Date: Tue, 2 Nov 1999 11:01:06 -0500 (EST) From: Michael Barr X-Sender: barr@triples.math.mcgill.ca To: Categories list Subject: categories: My ftp site Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: X-Keywords: X-UID: 1 I have finally reorganized my ftp site. It is at ftp.math.mcgill.ca/pub/barr. There is an Index (The "I" is capitalized so it is listed first) and it gives the full title and the name of the file. All files are given as zipped dvi and zipped ps files. I will endeavor to maintain this in this fashion. In fact, I have attached the Index. Michael %%%%%%%%%%%%%%%%%%%%%%%%%%%% Index %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% This is an index of the files. With the exception of the corrections and updates to ctcs and ttt, and the electronic parts of ctcs, these files are available as dvi or ps files with the names xxxxxxdv.zip and xxxxxxps.zip. The possible xxxxxx appear below with full names and bibliographic references, if relevant. acmod M. Barr, Accessible categories and models of linear logic. J. Pure Applied Algebra, vol. 69 (1990), 219-232. algcmp M. Barr, Algebraically compact functors. J. Pure Applied Algebra, vol. 82 (1992), 211--232. asymm M. Barr, Non-symmetric $*$-autonomous categories. Theoretical Computer Science, vol. 139 (1995), 115-130. balls M. Barr, (with Heinrich Kleisli), Topological balls. To appear in Cahiers Topologie Geometrie Differentielle Categorique, vol. 40, (1999). careil M. Barr, Cartan-Eilenberg cohomology and triples. J. Pure Applied Algebra, vol. 112 (1996), 219--238. chucon M. Barr, The Chu construction. Theory and Applications of Categories, vol. 2 (1996), 17--35. chuse M. Barr, {The separated extensional Chu category}. Theory and Applications of Categories, vol. 4 (1998), 127--137. ctcs.ansbook.ps.gz ctcs.ansbook. ctcs.elec.supp.ps.gz ctcs.elec.supp. ctcsud Updates, corrections and electronic parts of ctcs. fpoccc M. Barr, Fixed point operators in cartesian closed categories. Theoretical Comp. Sci. vol. 70 (1990), 65--72. fzymod M. Barr, Fuzzy models of linear logic. Mathematical Structures Computer Science, vol. 6 (1996), 301--312. hsppos M. Barr, Functorial semantics and HSP type theorems. Algebra Universalis, vol. 31 (1994), 223-241. hsp M. Barr, HSP type theorems in the category of posets. Proc. 7th International Conf. Mathematical Foundation of Programming Language Semantics, Lecture Notes in Computer Science, vol. 598 (1992) 221--234. omatt M. Barr, *-Autonomous categories: once more around the track}. To apear in Theory and Applications of Categories. orisng M. Barr, Oriented singular homology. Theory and Applications of Categories, vol. 1 (1995), 1--9. scatll M. Barr, $*$-Autonomous categories and linear logic. Mathematical Structures Computer Science, vol. 1 (1991), 159--178. sepvec M. Barr, Separability of tensor in Chu categories of vector spaces. Mathematical Structures Computer Science, vol. 6 (1996), 213--217. sketch M. Barr, Notes on sketches, notes of lectures presented at the Electro-technical laboratory in Tsukuba, Japan. Parts are taken verbatim from TTT. ETL in Tsukuba. Parts of it are adapted from [Barr \& Wells, 1995]. strev M. Barr, $*$-Autonomous categories, revisited. J. Pure Applied Algebra, vol. 111 (1996), 1--20. topop M. Barr, (with M.C. Pedicchio), Top$^{op}$ is a quasi-variety. Cahiers Topologie Geometrie Differentielle Categorique, vol. 36 (1995), 3-11. trmclg M. Barr, Terminal coalgebras in well-founded set theory. Theoretical Comp. Sci., vol. 114 (1993), 299--315. tttcor Corrections to TTT. varset A paper written to order for Mathematical Intelligencer after the editor Chandler Davis twisted my arm and proctically begged me to do it. He has been sitting on it for ten years, any memory of the article it was a response to having long since escaped any reader's mind. Nor has he ever explained himself or apologized. xctrep M. Barr, Representations of categories. J. Pure Applied Algebra, vol. 41 (1986), 113--137. unzip.exe DOS unzip program. I believe all Unix installations come with unzip. From cat-dist Wed Nov 3 12:56:14 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id KAA12472 for categories-list; Wed, 3 Nov 1999 10:55:07 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-Id: Date: Tue, 2 Nov 1999 17:55:22 +0000 (GMT) From: "Roy L. Crole" To: categories@mta.ca Subject: categories: Research Associate Position at Leicester Mime-Version: 1.0 (generated by tm-edit 7.106) Content-Type: text/plain; charset=US-ASCII Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 2 Dear Colleagues, I would be grateful if you could bring the Research Associate position detailed below to the attention of anyone who might be interested. The following areas are relevant to the project: automated reasoning, category theory, formal methods, logic, types, and programming languages. Regards, Roy Crole. ----------------------------------------------------------------- UNIVERSITY OF LEICESTER Department of Mathematics and Computer Science Post-Doctoral Research Associate (Ref: R9112/GD) Applications are invited for the post of Research Associate to work on a project funded by the EPSRC to develop Mechanized Operational Semantics. Applicants should have (or expect soon to have) a Ph.D. which includes experience in either programming language semantics or machine assisted proof. Knowledge of both areas would be an advantage. The project will involve the coding of operational semantics within a theorem prover such as Isabelle or HOL, and will lead to verifications of compiler optimizations. The position is available from January 2000 for up to three years. Salary will be on the R&A1A scale 16,286 to 24,479 GBP pa. Further details can be found at http://www.mcs.le.ac.uk/jobs Application forms and further particulars are available from the Personnel Office (Appointments), University of Leicester, University Road, Leicester LE1 7RH, tel: +44 (0)116 223 1341, fax: +44 (0)116 252 5140, email: personnel@le.ac.uk Closing date: 26 November 1999. From cat-dist Wed Nov 3 12:58:20 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id KAA12719 for categories-list; Wed, 3 Nov 1999 10:54:30 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-ID: <381EECA9.1E0A65A6@dcs.qmw.ac.uk> Date: Tue, 02 Nov 1999 13:52:45 +0000 From: David Pym Reply-To: pym@dcs.qmw.ac.uk Organization: Queen Mary and Westfield College, University of London X-Mailer: Mozilla 4.5 (Macintosh; I; PPC) X-Accept-Language: en MIME-Version: 1.0 To: categories@mta.ca Subject: categories: Faculty Positions at Queen Mary College. Content-Type: text/plain; charset=us-ascii; x-mac-type="54455854"; x-mac-creator="4D4F5353" Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 3 The Department of Computer Science at Queen Mary College, University of London, has faculty positions available at all levels. See http://www.dcs.qmw.ac.uk for details. David Pym From cat-dist Wed Nov 3 13:25:02 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id LAA21372 for categories-list; Wed, 3 Nov 1999 11:34:52 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Wed, 03 Nov 1999 10:23:40 -0500 From: "Steven R. Costenoble" Subject: categories: Cat as a model category To: categories@mta.ca Message-id: MIME-version: 1.0 X-Mailer: Novell GroupWise 5.5 Content-type: text/plain; charset=US-ASCII Content-disposition: inline Content-transfer-encoding: 7BIT Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 4 Here's a question I've already asked on the algebraic topology mailing list. I received several very interesting replies, but there seems to be little published and I'm curious what else is out there: I have Thomason's 1980 paper "Cat as a closed model category." Are there any other references for model category structures on Cat, the category of small categories? --Steve Costenoble matsrc@hofstra.edu Dept. of Mathematics Hofstra University Hempstead, NY 11549 From cat-dist Wed Nov 3 13:56:01 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id LAA21803 for categories-list; Wed, 3 Nov 1999 11:36:19 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Wed, 03 Nov 1999 15:57:47 +0100 From: POWELL Olivier Subject: categories: ICALP'00:call for papers To: "Rolim Jose D. P." Message-id: <38204D6A.915697D8@cui.unige.ch> MIME-version: 1.0 X-Mailer: Mozilla 4.5 [en] (X11; I; SunOS 5.6 sun4u) Content-type: text/plain; charset=iso-8859-1 X-Accept-Language: en Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from QUOTED-PRINTABLE to 8bit by mailserv.mta.ca id KAA13284 Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 5 Call for Papers ICALP'00 27-th International Colloquium on Automata, Languages and Programming July 9-15, 2000, Geneva, Switzerland The 27-th annual meeting of the European Association of Theoretical Computer Science will be held in Geneva, Switzerland. As is the case of the two tracks of the journal Theoretical Computer Science, the scientific program of the Colloquium is split into two parts: Track A of the meeting will correspond to Algorithms, Automata, Complexity, and Games, while Track B to Logic, Semantics, and Theory of Programming. Original contributions to theory of computer science, to be presented either in Track A or in Track B, are being sought. Authors are invited to submit extended abstracts of their papers, not exceeding 12 pages in the standard Springer Verlag LNCS style. Instructions for paper submissions can be found at the conference webpage. Authors from countries where access to Internet is difficult may mail a single copy of their paper directly to the address of the conference chairman. Submissions should consist of: a cover page, with the author's full name, address, fax number, e-mail address, a 100-word abstract, keywords and to which track (A or B) the paper is being submitted and an extended abstract describing original research in no more than 12 pages. It is expected that accepted papers will be presented at the conference. Simultaneous submission to other conferences with published proceedings is not allowed. In addition, one page proposals for workshops, to be sent to the conference chair until November 10, 1999, are welcomed. Conference Chair: Jose D. P. Rolim Centre Universitaire d'Informatique University of Geneva 24 rue du General Dufour 1211 Geneva 4 Switzerland e-mail: icalp@cui.unige.ch ICALP'00 Program Committee Track A: Emo Welzl, Chair, ETH Zuerich Harry Buhrman, CWI Amsterdam Peter Bro Miltersen, Univ. Aarhus Martin Dietzfelbinger, Techn Univ Ilmenau Afonso Ferreira, CNRS-I3S-INRIA Sophia Antipolis Marcos Kiwi, Univ. de Chile Jens Lagergren, KTH Stockholm Gheorghe Paun, Romanian Acad. Guenter Rote, Techn. Univ. Graz Ronitt Rubinfeld, Cornell Univ. Amin Shokrollahi, Bell Labs Luca Trevisan, Columbia Univ. Serge Vaudenay, ENS Paris Uri Zwick, Tel Aviv Univ. Track B: Ugo Montanari, Chair, Univ. of Pisa Rajeev Alur, Univ. Pennsylvania, Philadelphia Rance Cleaveland, SUNY at Stony Brook Pierpaolo Degano, Univ. of Pisa Jose Fiadeiro, Univ. of Lisbon Andy Gordon, Microsoft Research, Cambridge, Orna Grumberg, Technion, Haifa Claude Kirchner, Inria, Nancy Mogens Nielsen, Univ. of Aarhus Catuscia Palamidessi, Penn. State Univ, Univ. Park Joachim Parrow, KTH, Stockholm Edmund Robinson, QMW, London Jan Rutten, CWI, Amsterdam Jan Vitek, Univ. of Geneva Martin Wirsing, Ludwig-Maximilians-University, Munich Pierre Wolper, Univ. of Liege. Invited Speakers Track A: Andrei Broder, Altavista and Compaq Oded Goldreich, MIT and Weizman Inst. Johan Hĺstad, KTH Stockholm Kurt Mehlhorn, Max Plank Institute Track B: Samsom Abramsky, Edinburgh U. Gregor Engels, Paderborn U. Roberto Gorrieri, U. Bologna Zohar Manna, Stanford U. General Information Geneva is situated along the banks of Lac Leman and Le Rhone. The lake showcases the plumed fountain Jet d'Eau, and various districts of Geneva are connected by bridges across the waterways. The University of Geneva where ICALP '00 will convene is located on the `Left Bank' off Place Neuve and along the Promenade des Bastions near the Old Town section of Geneva. Geneva is a city of water parks and gardens and welcoming walkways which encourage exploration of the historical sites, museums, and international business and shopping districts. The University of Geneva is located near `Old Town' an area dotted with sidewalk cafes, student life, and building antiquities dating back to the 5th century. Geneva is a crossroads situated in the heart of Europe and linked to the world by a vast network of motorways, airlines and railways. For those planning to attend ICALP '00 in Geneva, it is an excellent opportunity to organize short trips into the countryside of charming villages and vineyards. Tours to please all ages and interests are available including afternoon train excursions, shopping cruises on Lake Geneva and The Rhone, and bus and cablecar trips in the Alps. For some, the most inviting attraction will be mouintain climbing. Mont Blanc, one of the highest points in Europe and the city of Chamonix are less than an hour away. Accomodations at a very special ICALP rate have been reserved in a couple of hotels and very inexpensive rooms will be available at the Student Housing. Lunch will be served daily on campus and there will be morning and afternoon refreshment breaks. Note that the specially priced hotel accommodations reserved for ICALP participants are located only a 5-10 minute walk to the campus. Important Dates Workshop Proposals: November 10,1999 Submissions: January 17, 2000 Notification: March 21, 2000 Final Copies: April 18, 2000 Further Information Further information related to ICALP'00, with instructions for paper submissions and conference registration, as well as with details on conference site, registration fee, accommodation, social program, and payments, will appear at the conference webpage at http://cuiwww.unige.ch/~icalp and in forthcoming issues of EATCS Bulletin. The conference is organized by the Centre Universitaire d'Informatique of the University of Geneva. From cat-dist Wed Nov 3 18:55:11 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id RAA06709 for categories-list; Wed, 3 Nov 1999 17:49:16 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-ID: <19991103214312.74479.qmail@hotmail.com> X-Originating-IP: [198.168.191.111] From: "Marta Bunge" To: categories@mta.ca Subject: categories: Re: Cat as a model category Date: Wed, 03 Nov 1999 16:43:12 EST Mime-Version: 1.0 Content-Type: text/plain; format=flowed Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 6 The McGill Ph.D. thesis of my student, Murray Heggie, deals with closed model structures in Cat and in presheaf toposes. Its contents have been published in three papers in the Cahiers. • M. Heggie, "The left derived tensor product of CAT-valued diagrams", Cahiers de Top. et Geo. Diff. Cat. XXXIII-1 (1992) 33-53. • M. Heggie, "Homotopy Cofibrations in CAT", Cahiers de Top. et Geo. Diff. Cat., Vol.XXXIII-4, (1992), 291-314. • M. Heggie, "Homotopy Colimits in presheaf categories", Cahiers de Top. et Geo. Diff. Cat., Vol.XXXIV-1, (1993), 13-36. Sincerely, Marta Bunge From cat-dist Fri Nov 5 18:39:23 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id RAA10952 for categories-list; Fri, 5 Nov 1999 17:28:03 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f From: rbf@dai.ed.ac.uk Date: Thu, 4 Nov 1999 17:10:22 GMT Message-Id: <21982.199911041710@magpie> To: categories@mta.ca, fsdm@it.uq.edu.au Subject: categories: MSc in Informatics (AI, CS, CogSci) at Edinburgh Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 7 Master of Science (MSc) degrees in the Division of Informatics at the University of Edinburgh The Division of Informatics offers three 1 year courses in different topics in Informatics: 1. MSc in Artificial Intelligence, whose primary focus is on development and understanding of intelligent computational processes for the benefit of both creating useful artifacts and helping better understand intelligence (human or otherwise). The course contains five themes: Foundations of AI, Intelligent Robotics, Knowledge-based Systems, Natural Language Processing, and Non-Symbolic AI. 2. MSc in Cognitive Science and Natural Language. This MSc is concerned with computational, formal and experimental approaches to understanding cognition and natural language. In Cognitive Science, the disciplines of formal linguistics, psychology, neuroscience and philosophy are brought together in different kinds of computational frameworks. This MSc is particularly concerned with how language is represented and processed. 3. The MSc in Computer Science contains three themes. The Advanced Computer Systems theme embraces the theory and practice of designing programmable systems. The Systems Level Integration theme teaches the principles underlying the design of integrated software and hardware systems in silicon. The Theoretical Computer Science theme introduces students to core areas of theoretical Computer Science and to the technologies through which theory-based tools are implemented. Applicants should specify which course(s) they are applying for and which themes are of interest in order of priority. From October to April students attend taught modules. During the period May - September inclusive, each student undertakes a major practical project, theoretical dissertation or piece of experimental research under the supervision of a member of academic staff. The projects can involve industrial collaboration and may be proposed by the student. Together, the three courses receive over 40 studentships from the UK government, which support about 1/2 of the students on the courses. In general, students should have a good BS/BSc degree (or equivalent) in an appropriate topic, plus other skills appropriate to the particular MSc course. More information can be found on the Division's MSc WWW page at: http://www.informatics.ed.ac.uk/prospectus/graduate/ For further information, contact: MSc Admissions Secretary Division of Informatics University of Edinburgh 5 Forrest Hill Edinburgh, EH1 2QL Scotland, UK Fax: +44-(131)-650-6899 Telephone: +44-(131)-650-3904 Email: msc-admissions@inf.ed.ac.uk **************** ALSO: PhD Positions Available **************** We also have a thriving PhD program. For more information, see: http://www.informatics.ed.ac.uk/prospectus/graduate/ From cat-dist Fri Nov 5 18:39:33 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id RAA13540 for categories-list; Fri, 5 Nov 1999 17:28:16 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f From: rbf@dai.ed.ac.uk Date: Thu, 4 Nov 1999 17:19:03 GMT Message-Id: <25227.199911041719@magpie> To: categories@mta.ca, fsdm@it.uq.edu.au Subject: categories: PhD in Informatics (AI, CS, CogSci) at Edinburgh Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 8 PhD degrees in the Division of Informatics at the University of Edinburgh In 1998, the University of Edinburgh established a Division of Informatics, to study the structure, behaviour and interactions of both natural and artificial computational systems. The Division reflects the University's vision of Informatics as a fundamental area of study, critical for the future developments in science, engineering, and society. The Division was formed from the former Departments of Artificial Intelligence, Cognitive Science and Computer Science. The Division has positions for new research degree students pursing either an MSc(Research) (one year), an MPhil (two years) or a PhD (three years) through investigation of open problems in Informatics. The Division now contains about 70 academic staff, 60 contract researchers and 150 research students, grouped primarily into these research institutes: Artificial Intelligence Applications Institute Institute for Adaptive and Neural Computation Institute for Communicating and Collaborative Systems Institute for Computing Systems Architecture Institute of Perception, Action and Behaviour Institute for Representation and Reasoning Laboratory for Foundations of Computer Science which reflect the main research themes in the Division: adaptive computing artificial intelligence automated and mathematical reasoning cognitive science computational complexity computational learning theory computational linguistics computational musicology computational neuroscience computer-assisted formal reasoning computer architectures and networking computer communication and protocols computer graphics and virtual reality computer science computer vision database systems design and analysis of dependable systems diagramatic understanding formal program specification functional, logic and object-oriented programming genetic/evolutionary algorithms human-computer interaction intelligent tutoring systems knowledge representation and reasoning knowledge-based systems machine learning medical informatics mobile and assembly robotics modular and component-based systems natural language processing neural modelling neural networks neuroinformatics parallel, distributed and concurrent systems planning and activity management probabilistic graphical models program logics programming languages qualitative and fuzzy reasoning semantics of programming languages software engineering speech understanding and generation system level design and integration theory of computation type theory The UK Engineering and Physical Science Research Council has awarded the Division about 8 full studentships that can be used by UK and EC students. Overseas students may be eligible for ORS awards, that pay approximately half of the total costs. In general, students should have a good BS/BSc degree (or equivalent) in an appropriate topic, plus other skills appropriate to the particular research area. More information can be found on the Division's PhD WWW page at: http://www.informatics.ed.ac.uk/prospectus/graduate/ For application forms and further information, contact: PhD Admissions Secretary Division of Informatics University of Edinburgh James Clerk Maxwell Building King's Buildings Mayfield Road Edinburgh EH9 3JZ Email: phd-admissions@inf.ed.ac.uk Fax: +44 131 667 7209 Telephone: +44 131 650 5156 Please contact us if you'd like to come for a visit. **************** ALSO: MSc Positions Available **************** We also have three thriving taught MSc courses in Artificial Intelligence, Cognitive Science and Computer Science. For more information, see: http://www.informatics.ed.ac.uk/prospectus/graduate/ From cat-dist Sat Nov 6 11:25:26 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id KAA12303 for categories-list; Sat, 6 Nov 1999 10:25:18 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-Id: <3.0.6.16.19991106024124.5c7f9908@pop.cwru.edu> X-Sender: cxm7@pop.cwru.edu X-Mailer: QUALCOMM Windows Eudora Light Version 3.0.6 (16) Date: Sat, 06 Nov 1999 02:41:24 To: categories@mta.ca From: Colin McLarty Subject: categories: Arithmetic in CC cats, query Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: X-Keywords: X-UID: 9 Take cartesian closed categories in the sense: having products, and internal homs. If there is a natural number object you can define addition NxN-->N with the usual recursion 0+n = n sm+n = s(n+m) But can you prove it is commutative? You can prove 0+n=n+0 because you can prove both = n. And you can prove each case of commutativity for "standard natural numbers" in the sense of global elements sss..ss0 gotten from 0 by (externally) finitely many applications of successor. But even if I also assume equalizers, I do not see how to prove commutativity for arbitrary global elements, let alone all generalized elements. I suspect there are counterexamples but I cannot give one. I wonder if this is in Lambek and Scott, but my copy is at the office and I will not be there until Monday so I am writing in to ask. best, Colin From cat-dist Sun Nov 7 11:01:10 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id JAA12374 for categories-list; Sun, 7 Nov 1999 09:52:14 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Sun, 7 Nov 1999 07:49:11 -0500 (EST) From: Peter Freyd Message-Id: <199911071249.HAA24402@saul.cis.upenn.edu> To: categories@mta.ca Subject: categories: commutativity of addition Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: X-Keywords: X-UID: 10 Colin's question is a good one. Associativity tells us that \x.1+x and \x.x+1 commute and that's enough -- using the defining universal property of the NNO -- to make them equal: each is a solution to the equations f(0) = 1 and f(s(x)) = s(f(x)). The most conceptual way I can think of to finish the argument is to use that fact that the NNO (in a locos) is the free monoid on a single generator. The opposite-monoid functor is an involution on the category of monoids, hence the opposite monoid, ONN, of NNO is also free. (ONN has the same underlying object as NNO, but with the twisted binary operation.) We need only verify that the unique monoid map g:NNO -> ONN is the identity. Whatever it is, it is satisfies the equations g(0) = 0 and g(x+1) = 1+g(x). And that's enough to force it to be identity. From cat-dist Sun Nov 7 11:01:20 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id JAA12985 for categories-list; Sun, 7 Nov 1999 09:54:59 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-Id: <3.0.6.16.19991107004928.4a675146@pop.cwru.edu> X-Sender: cxm7@pop.cwru.edu X-Mailer: QUALCOMM Windows Eudora Light Version 3.0.6 (16) Date: Sun, 07 Nov 1999 00:49:28 To: categories@mta.ca From: Colin McLarty Subject: categories: Arithmetic query answer Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: X-Keywords: X-UID: 11 Todd Wilson answered my query by politely pointing out the obvious-- that the function g:N-->N^N with g(m) = (lambda n)(sn+m) is defined by the same induction on NxN as the function g':N-->NxN with g'(m) = (lambda m)(m+sn). Namely, g(0) = successor, and gs = sg. And so the function h:N-->N^N with h(m) = (lambda n)(m+n) is defined by the same induction as h'(m)=(lambda n)(n+m), namely h(0)= 1_N and hs=sh. I'm afraid I manufactured a difficulty by focussing on Cartesian Closed categories as "less than toposes" rather than thinking of them in their own terms--so the "Peano axiom" kind of proof I was looking for is unavailable, but no problem. Colin From cat-dist Sun Nov 7 11:01:33 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id KAA13934 for categories-list; Sun, 7 Nov 1999 10:01:18 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f X-Received: from zent.mta.ca (zent.mta.ca [138.73.101.4]) by mailserv.mta.ca (8.9.3/8.9.3) with SMTP id PAA24029 for ; Sat, 6 Nov 1999 15:21:49 -0400 (AST) X-Received: FROM dinats.mathstat.uottawa.ca BY zent.mta.ca ; Sat Nov 06 15:38:13 1999 X-Received: from localhost (phil@localhost) by dinats.mathstat.uottawa.ca (8.9.3/8.9.3) with SMTP id OAA27635; Sat, 6 Nov 1999 14:15:58 -0500 (EST) Date: Sat, 6 Nov 1999 14:15:57 -0500 (EST) From: Phil Scott X-Sender: phil@dinats To: categories@mta.ca Subject: categories: CMS Applied Logic, Announcement 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 PAA24029 Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 12 Dear Colleagues: The Canadian Mathematical Society Annual Winter meeting in Montreal this December has a special session in Applied Logic and theoretical computer science, December 11-13, 1999. I enclose below the program. The URL's on the web are the following: General Meeting: http://www.cms.math.ca/CMS/Events/winter99/ Applied Logic Special Session: http://www.dms.umontreal.ca/Montreal-99/resume/logique_an.html Canadian Mathematical Society Winter Meeting December 11-13th, 1999 Conference Center, Renaissance Hotel du Parc Special Session: APPLIED LOGIC Organizers: Wendy MacCaull(St. Francis Xavier) , Prakash Panangaden(McGill), Phil Scott (Ottawa) Schedule Saturday, December 11 15:30-16:30 Alisdair Urquhart, urquhart@urquhart.theory.toronto.edu, (University of Toronto) "Complexity problems for substructural logic" 16:30-17:00 Amy Felty, felty@research.bell-labs.com, (Bell Lab, Murray Hill) "A semantic model of types for proof-carrying code" 17:00-17:30 Franck van Breugel, franck@cs.yorku.ca, (York University) "Towards quantitative verification of systems: a coalgebraic approach" Sunday, December 12 9:00-10:00 Fahiem Bacchus (University of Toronto) A search engine based on model checking" 11:30-12:00 Robin Cockett, robin@cpsc.ucalgary.ca, (University of Calgary) "Double glueing" 12:00-12:30 Peter Caines, peterc@cim.mcgill.ca, (McGill University) "COCOLOG: A logic for systems and control theory" 17:30-18:00 Marta Bunge, bunge@math.mcgill.ca, (McGill University) "Relative stone duality" 18:00-1830 Robert Seely (John Abott College) "Semantics for various noncommutative linear logics" Monday, December 13 11:30-12:30 Joachim Lambek (McGill University) "Bilinear logic in linguistics" 15:30-16:00 Francois Lamarche, Francois.Lamarche@loria.fr, (INRIA-Lorraine, Villers-les-Nancy, FRANCE) "Spaces for linguistic representation and semantics of linear logic" 16:00-16:30 Douglas Howe, howe@research.bell-labs.com, (Bell Labs, Murray Hill, USA) "Combining functionnal programming languages and set theory in support of software verification" 16:30-17:00 Richard Blute, rblute@mathstat.uottawa.ca, (U. Ottawa) "Nuclear ideals" 17:00-17:30 Esfandiar Haghverdi, ehaghver@mathstat.uottawa.ca, (U. Ottawa) "Linear logic, geometry of proofs and full completeness" 17:30-18:00 JosŽe Desharnais, desharna@DMS.UMontreal.CA, (McGill University) "Logical characterization of bisimulation for labelled Markov processes" 18:00-18:30 Gonzalo Reyes, reyes@MATHCN.UMontreal.CA, (UniversiteŽ de MontrŽal) "Topics in synthetic differential geometry" From cat-dist Mon Nov 8 13:01:25 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id LAA02166 for categories-list; Mon, 8 Nov 1999 11:40:21 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f From: Koslowski Message-Id: <199911081525.QAA22668@lisa.iti.cs.tu-bs.de> Subject: categories: PSSL in Braunschweig To: categories@mta.ca (categories list) Date: Mon, 8 Nov 1999 16:25:32 +0100 (MET) X-Mailer: ELM [version 2.4ME+ PL28 (25)] 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: A X-Keywords: X-UID: 13 Preliminary Announcement: Dear Colleagues, We are planning another PSSL in Braunschweig, Germany, on April 29/30 2000. Details will become available early next year, but we hope that an early announcement will enable you to keep that particular weekend free for a trip to Braunschweig. Please note that Monday, May 1 2000, is a holiday in Germany. We are looking forward to seeing you in Braunschweig, Jiri Adamek and J"urgen Koslowski -- J"urgen Koslowski % If I don't see you no more in this world ITI % I meet you in the next world TU Braunschweig % and don't be late! koslowj@iti.cs.tu-bs.de % Jimi Hendrix (Voodoo Child) From cat-dist Mon Nov 8 13:02:30 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id LAA30632 for categories-list; Mon, 8 Nov 1999 11:29:05 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Fri, 5 Nov 1999 14:56:29 -0600 (CST) From: Dave Schmidt Message-Id: <199911052056.OAA07383@merak.cis.ksu.edu> To: categories@mta.ca Subject: categories: SAS 2000: First Call for Papers Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: X-Keywords: X-UID: 14 ***************************************************************** * * * First Call For Papers * * * * INTERNATIONAL STATIC ANALYSIS SYMPOSIUM (SAS2000) * * * * Co-located with and immediately following LICS2000 * * * * University of California, Santa Barbara * * 29 June-1 July, 2000 * * * * http://www.cis.ksu.edu/santos/sas/ * * * ***************************************************************** Static Analysis is increasingly recognized as a fundamental technique for high performance implementations and verification systems of high-level programming languages. The series of Static Analysis Symposia has served as the primary venue for presentation of advances in the area. Previous symposia were held in Venice, Pisa, Paris, Aachen, Glasgow, and Namur. The Seventh International Static Analysis Symposium (SAS2000) will be at the same location as and immediately following the IEEE Logic in Computer Science Conference (LICS2000; see http://www.cs.bell-labs.com/who/libkin/lics/). Both LICS and SAS will be held at the Conference Center of the University of California, Santa Barbara, which is situated on the beaches of the Pacific Ocean (see http://www.ucsb.edu/). The technical program for SAS2000 will consist of invited lectures, presentations of refereed papers, and software demonstrations. Contributions are welcome on all aspects of Static Analysis, including, but not limited to: abstract interpretation data flow analysis complexity analysis theoretical frameworks optimizing compilers verification Systems program specialization type inference model checking abstract domains. Submissions can address any programming paradigm, including concurrent, constraint, functional, imperative, logic and object-oriented programming. Survey papers that present some aspect of the above topics with a new coherence are also welcome. Submitted papers must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with a refereed proceedings. Submitted papers must be written in English and print on USA 8.5x11-inch paper. Papers should be at most 15 pages excluding the bibliography and well-marked appendices, and at most 25 pages total. Papers should use at least an 11-point font, single column format, and reasonable margins on 8.5x11-inch paper. Program committee members are not required to read any appendices, and so a paper should be intelligible without them. Submitted papers must on the first page contain an abstract, and postal and electronic mailing addresses for at least one of the authors. Submissions should arrive by January 15, 2000. All submissions must be done electronically; details of how to submit a paper will be announced later. Authors will be notified of the acceptance or rejection of their papers by March 13, 2000. Final versions of the accepted papers must be received in camera-ready form by April 10, 2000. The proceedings are expected to be published by Springer-Verlag in the LNCS series. Regularly updated information about SAS2000 can be found at this URL: http://www.cis.ksu.edu/santos/sas/. Important Dates: Submission: January 15, 2000. Notification: March 13, 2000. Final Version: April 10, 2000. General Chair: David Schmidt Computing and Information Sciences Dept. Kansas State University Manhattan, KS 66506, USA +1-785-532-6350 schmidt@cis.ksu.edu Program Chair: Jens Palsberg Purdue University Dept of Computer Science W Lafayette, IN 47907, USA +1-765-494-6012 palsberg@cs.purdue.edu Program Committee: Patrick Cousot (Ecole Normale Superieure, Paris) Gilberto File (Padova University, Italy) Roberto Giacobazzi (Universita di Verona, Italy) C. Barry Jay (University of Technology, Sydney) Thomas Jensen (IRISA/CNRS, France) Neil D. Jones (DIKU, Denmark) Jens Palsberg (Purdue University, USA) David Sands (Chalmers University of Technology and Goteborg University) David Schmidt (Kansas State University, USA) Scott Smith (The Johns Hopkins University, USA) Bernhard Steffen (University of Dortmund, Germany) Pascal Van Hentenryck (Brown University, USA and Univ. Catholique de Louvain) Joe Wells (Heriot-Watt University, Scotland) From cat-dist Mon Nov 8 13:36:54 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id LAA03729 for categories-list; Mon, 8 Nov 1999 11:48:07 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f From: "T.Porter" To: categories@mta.ca Date: Mon, 8 Nov 1999 15:02:12 +0000 Subject: categories: categories and K-theory X-Mailer: KMail [version 1.0.28] Content-Type: text/plain MIME-Version: 1.0 Message-Id: <99110815173901.00778@porter.bangor.ac.uk> Content-Transfer-Encoding: 8bit Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 15 Dear All, Some time ago I discussed with Tony Bak, who is managing editor of the journal K-theory, those parts of the category theoretic panoply that might fit best within that journal. Those of you who know the journal will have noted that it published Tamsamani's work on weak multiple categories and that the links between K-theory and, for instance, categorical treatments of abstract homotopy theory, the homotopy theory of small categories, stacks of groupoids, Topological Quantum Field Theories etc, tensor categories and results on the representation theory of objects such as quantum groups, Hopf algebras and so on, are all within the range of topics previously handled by the journal. I have become a member of the editorial board and have been asked to solicit submissions of good quality papers within these areas. I would ask that not withstanding the great relevance of parts of these areas to the readership of the journal, that any papers submitted to me should be in accordance with the published publication policy of the journal as printed in any copy of the journal. I look forward to seeing some excellent article coming this way, Tim Porter. Mathematics Division, School of Informatics, University of Wales, Bangor, Bangor, Gwynedd, LL57 1UT. Wales, U.K. e-mail: t.porter@bangor.ac.uk From cat-dist Wed Nov 10 12:52:27 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id KAA03952 for categories-list; Wed, 10 Nov 1999 10:35:00 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f X-Received: from zent.mta.ca (zent.mta.ca [138.73.101.4]) by mailserv.mta.ca (8.9.3/8.9.3) with SMTP id PAA28574 for ; Tue, 9 Nov 1999 15:30:45 -0400 (AST) X-Received: FROM hercules.acsu.buffalo.edu BY zent.mta.ca ; Tue Nov 09 15:47:17 1999 X-Received: (qmail 1974 invoked by uid 39883); 9 Nov 1999 19:30:32 -0000 Date: Tue, 9 Nov 1999 14:30:32 -0500 (EST) From: F W Lawvere Reply-To: wlawvere@ACSU.Buffalo.EDU To: categories@mta.ca Subject: categories: Ugo Berni Canani Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 16 It is with great regret that we have to inform you that our friend and colleague Ugo Berni Canani died recently in Rome, just after his sixtieth birthday. Those of you who met Ugo will remember his warmth and intelligence and breadth of learning. He was a justice of the Italian supreme court in the section charged with judging lower courts with respect to their uniformity of legal procedure (in Italy this section of the supreme court provides an additional avenue of appeal in that if a lower court decision is quashed by it, the case is tried again with regard to the facts by another lower court.) Ugo not only strove to compose the decisions of this court with the structure of mathematical theorems, but successfully took on the enormous task of designing and directing Italy's legal electronic database, which provides access to precedents from all the courts (this electronic system is considered by international experts to be the most advanced in the world). The classifying and organizing required by this database raised new practical and theoretical issues of linguistics and philosophy to which he applied his studies of mathematics. That work, as well as his lifelong interest in philosophy, inspired Ugo over the last twenty years to pursue research in category theory, in which he was co-author of several papers. He had dreamed of a future in which he could devote his time to categorical research. It is a great loss that his work has been cut short, but his inspiration to young Italian philosophers and mathematicians, and to his friends worldwide, lives on beside his polished legal documents and his legal database as part of his legacy. Ugo leaves us with the memory of a man gifted with lucid and penetrating intelligence, with many interests pursued with creativity, youthful curiosity, and simplicity. We will miss his enthusiasm, his tireless encouragement, and his warm friendship. Bill Lawvere and Steve Schanuel ***************************************************************** F. William Lawvere Mathematics Dept. SUNY wlawvere@acsu.buffalo.edu 106 Diefendorf Hall 716-829-2144 ext. 117 Buffalo, N.Y. 14214, USA ***************************************************************** From cat-dist Wed Nov 10 13:39:16 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id LAA28241 for categories-list; Wed, 10 Nov 1999 11:38:59 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-Id: <4.2.0.58.19991108190601.01202780@math.tulane.edu> X-Sender: mwm@math.tulane.edu X-Mailer: QUALCOMM Windows Eudora Pro Version 4.2.0.58 Date: Mon, 08 Nov 1999 19:27:22 -0600 To: categories@mta.ca From: Michael Mislove Subject: categories: Position available Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii"; format=flowed Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 17 Dear Colleagues, Below is an announcement of an Assistant Professor position in Theoretical Computer Science that is open in the Mathematics Department at Tulane. The position will start in Fall 2000. I apologize if you receive this announcement more than once. Best regards, Mike Mislove Assistant Professor Position Mathematics Department Tulane University Applications are invited for a tenure track, Assistant Professor position in Theoretical Computer Science beginning in Fall 2000. The areas of research interest include the semantics of computation, domain theory, logic, programming languages, lambda calculus, concurrency and process algebra, and verification. Candidates must have a PhD in mathematics or computer science, and must demonstrate research excellence as well as having a documented history of excellence in teaching. More information about the department can be found on its home page http://www.math.tulane.edu Tulane University is an Affirmative Action/Equal Opportunity Employer that is committed to increasing the diversity of its faculty. We therefore especially encourage applications from underrepresented groups. Applications should be sent c/o Hiring Committee Mathematics Department Tulane University New Orleans, LA 70118 Electronic applications are accepted at math@math.tulane.edu and the use of the AMS cover sheet is encouraged. A complete application should include Curriculum Vitae, statements on research and on teaching, as well as three letters of recommendation commenting on both research and teaching. Contact person: Professor Michael Mislove mwm@math.tulane.edu Application deadline: February 1, 2000 ========================================================== Michael W. Mislove Professor and Chairman Phone: +1 504 862-3441 Department of Mathematics FAX: +1 504 865-5063 Tulane University Email: mwm@math.tulane.edu New Orleans, LA 70118 URL: http://www.math.tulane.edu/mislove.html USA ========================================================== From cat-dist Wed Nov 10 13:46:02 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id LAA29240 for categories-list; Wed, 10 Nov 1999 11:44:23 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f To: categories@mta.ca Subject: categories: TCS2000 X-Mailer: Mew version 1.92.4 on XEmacs 20.4 (Emerald) Mime-Version: 1.0 Content-Type: Text/Plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-Id: <19991110112523T.miyakawa@ito.ecei.tohoku.ac.jp> Date: Wed, 10 Nov 1999 11:25:23 +0900 From: Shinya MIYAKAWA X-Dispatcher: imput version 971024 Lines: 150 Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: X-Keywords: X-UID: 18 Apologies if you receive multiple copies. -------- call for papers IFIP International Conference on Theoretical Computer Science IFIP TCS2000 --- Exploring New Frontiers of Theoretical Informatics --- August 17 - 19, 2000 Tohoku University, Sendai, Japan IFIP TCS2000 is the first International Conference on Theoretical Computer Science organized by the IFIP TC1 on Foundations of Computer Science. Major topics of the conference are follows: Track (1): Algorithms, Complexity and Models of Computation analysis and design of algorithms --- algorithm experimentation --- 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 --- probabilistic and randomized algorithms --- molecular computing and algorithmic aspects of bioinformatics --- quantum computing --- neural network computing --- evolutionary and genetic algorithms --- computational geometry --- computational and 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. Submissions on the above topics and related topics are invited. Submitted papers should preferably be typeset in LaTeX2e using the Springer document class llncs for the LNCS format, see http://www.springer.de/comp/lncs/authors.html (the command \pagestyle{plain} turns on page numbering), and no longer than 14 pages. They should be sent in Postscript by email to one of the following addresses by January 28 (Friday), 2000: for Track (1), tcs2000-track1@is.s.u-tokyo.ac.jp; for Track (2), tcs2000-track2@is.s.u-tokyo.ac.jp. A submission should include the track name for the submission, the title of the paper, names and affiliations of authors, an abstract up to 300 words, and the contact author's name, address, phone number, fax number, and email address. The submission must be in English, and it should provide a summary of the main results and their details to allow the program committee to assess their merits and significance, including references and comparisons. The result of the paper must be unpublished and not submitted for publication elsewhere, including journals and the proceedings of other symposia or workshops. One author of each accepted paper should be able to present it at the conference. Important Dates: January 28, 2000: Deadline for submission of papers April 7, 2000: Notification of acceptance May 5, 2000: Final camera-ready text due See http://hagi.is.s.u-tokyo.ac.jp/tcs2000/ for further information about the submission procedure. The program will consist of: Plenary Invited Talks Mart\'in Abadi (Bell Labs, Lucent Technologies) Masami Hagiya (U. Tokyo) Madhu Sudan (MIT) Track (1) Invited Talks Ernst Mayr (TU Muenchen) Shu Tezuka (IBM Tokyo Research Lab) Mihalis Yannakakis (AT\&T Research) Track (2) Invited Talks Thomas Henzinger (UC Berkeley & MPI-Saarbrucken) Naoki Kobayashi (U. Tokyo) Gordon Plotkin (U. Edinburgh) Banquet Speech Michael O. Rabin (Harvard U.) as well as the selected contributed talks and a panel discussion. The Proceedings, published as a volume of Lecture Notes in Computer Science, Springer-Verlag, will be available at the conference. See http://tcs2000.ito.ecei.tohoku.ac.jp/tcs2000/ for general information about the IFIP TCS2000 Conference. Program Committee Co-Chairs Track (1): Algorithms, Complexity and Models of Computation Jan van Leeuwen (U. Utrecht) Osamu Watanabe (Tokyo Inst. of Technology) Track (2): Logic, Semantics, Specification, and Verification Masami Hagiya (U. Tokyo) Peter D. Mosses (U. Aarhus) Program Committee Track (1): Ricardo Baeza-Yates (U. Chile), Siu-Wing Cheng (Hong Kong UST), Felipe Cucker (City U. Hong Kong), Rosario Gennaro (IBM T.J. Watson Research), Alan Gibbons (U. Liverpool), Andrew V. Goldberg (InterTrust STAR Lab, USA), Ernst Mayr (TU Muenchen), Hiroshi Nagamochi (Kyoto U.), Kouichi Sakurai (Kyushu U.), Paul Vitanyi (CWI, Amsterdam), Jiri Wiedermann (Academy of Sciences, Prague), Takashi Yokomori (Waseda U.) Track (2): Samson Abramsky (U. Edinburgh), Egidio Astesiano (U. Genova), Luca Cardelli (Microsoft, Cambridge), Robert Constable (Cornell U.), Javier Esparza (TU Muenchen), Naoki Kobayashi (U. Tokyo), Jos\'e Meseguer (SRI, Menlo Park), Benjamin Pierce (U. Pennsylvania), Davide Sangiorgi (INRIA, Sophia Antipolis), John Staples (U. Queensland), Andrzej Tarlecki (Warsaw U.), P. S. Thiagarajan (Chennai Math. Inst., India), Kazunori Ueda (Waseda U.), Naoki Yonezaki (Tokyo Inst. Tech.) Conference Co-Chairs Giorgio Ausiello (IFIP TC1 Chair and U. Roma "La Sapienza") Takayasu Ito (Tohoku U.) Steering Committee Giorgio Ausiello (U. Roma) , Wilfried Brauer (TU Muenchen), Takayasu Ito (Tohoku U.), Michael O. Rabin (Harvard U.), John Staples (U. Queensland), Joseph Traub (Columbia U.) Organizing Committee Co-Chairs Setsuo Arikawa (Kyushu U.), Yasuyoshi Inagaki (Nagoya U.), Takayasu Ito (Tohoku U.) The IFIP TCS2000 conference is organized by the IFIP 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 in Japan*, European Association of Theoretical Computer Science, Association of Symbolic Logic, and Association for Computing Machinery-SIGACT. (* indicates "to be verified".) E-mail address for any inquiry: TCS2000@ito.ecei.tohoku.ac.jp From cat-dist Wed Nov 10 17:58:11 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id RAA32444 for categories-list; Wed, 10 Nov 1999 17:01:34 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-ID: <38299B55.D4565499@loria.fr> Date: Wed, 10 Nov 1999 17:20:37 +0100 From: Francois Lamarche Organization: LORIA X-Mailer: Mozilla 4.51 [en] (X11; I; SunOS 5.5 sun4m) X-Accept-Language: fr, en MIME-Version: 1.0 To: categories@mta.ca Subject: categories: Re: Ugo Berni Canani References: Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: X-Keywords: X-UID: 19 > Ugo leaves us with the memory of a man gifted with lucid and > penetrating intelligence, with many interests pursued with creativity, > youthful curiosity, and simplicity. We will miss his enthusiasm, his > tireless encouragement, and his warm friendship. > > Bill Lawvere and Steve Schanuel I met him for the first and only time one year ago. I had the pleasure of sitting next to him at a conference dinner, and it did not take long to realize I had met a most remarkable man. Francois Lamarche From cat-dist Thu Nov 11 17:17:53 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id QAA04195 for categories-list; Thu, 11 Nov 1999 16:01:34 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Thu, 11 Nov 1999 08:52:18 +0100 From: vogler@orchid.inf.tu-dresden.de (Prof. Dr. Vogler) Message-Id: <199911110752.IAA18392@cactus.inf.tu-dresden.de> To: categories@mta.ca Subject: categories: doctoral/postdoctoral grants X-Sun-Charset: US-ASCII 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: X-Keywords: X-UID: 20 We apologize if you have received this e-mail more than once. _________________________________________________________________________ The Faculty of Computer Science at the Dresden University of Technology, Germany, offers in the framework of its research programme (DFG-Graduiertenkolleg) Specification of discrete processes and systems of processes by operational models and logics several A. doctoral grants and B. postdoctoral grants with a duration of three years and two years, respectively, starting from February 1st, 2000. In this research programme we consider various formal concepts for studying processes, in particular, algebraic and category-theoretic models, logic-specification, semi-automatic verification of properties, and formal concept analysis. Applicants who have finished their master degree or Ph.D. can apply for grant A or grant B, respectively, by sending their curriculum vitae, photo, list of publications, and two recommendations by professors not later than December 2nd, 1999 to Dresden University of Technology Faculty of Computer Science Prof. Dr.-Ing.habil. Heiko Vogler Mommsenstr. 13 D-01062 Dresden Germany Further information can be found on the page: http://orchid.inf.tu-dresden.de/gk-spezifikation/index.html From cat-dist Thu Nov 11 17:22:10 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id QAA08119 for categories-list; Thu, 11 Nov 1999 16:04:57 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-Id: From: femke@cs.vu.nl (Raamsdonk van F) Subject: categories: CL2000: call for workshop proposals To: categories@mta.ca Date: Thu, 11 Nov 1999 15:53:07 +0100 (MET) X-Mailer: ELM [version 2.4 PL24alpha3] 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: X-Keywords: X-UID: 21 *** apologies for multiple copies *** CL2000 First International Conference on Computational Logic Imperial College, London, UK, 24th to 29th July, 2000 http://www.doc.ic.ac.uk/cl2000/ CALL FOR WORKSHOP PROPOSALS CL2000 is the first conference in a major new series of annual international conferences bringing together the various communities of researchers who have a common interest in Computational Logic. CL2000 includes seven streams covering various subfields of computational logic. DOOD2000 (6th International Conference on Rules and Objects in Databases) and LOPSTR2000 (10th International Workshop on Logic-based Program Synthesis and Transformation) will be streams within CL2000. Moreover, the International Conference on Logic Programming (ICLP) is now integrated into CL2000. ILP2000 (10th International Conference on Inductive Logic Programming) is also collocated with CL2000. The organisation of CL2000 will provide facilities for half-day and one-day workshops, to be held on Saturday July 29th. Researchers and practitioners are invited to submit proposals for workshops on topics in computational logic. Anyone wishing to organise a workshop should send (possibly by email, in text or html format) a proposal no longer than two pages to the workshop coordinator by December 20, 1999 The proposal should describe the topic of the proposed workshop and its relevance to computational logic. Besides the contact information and the list of the organisers, the proposal should contain - when applicable - the following information: - proposed duration of the workshop (half day/one day), - description of previously organised similar workshops, - expected number of participants, - character of the workshop (formal/informal, via submission/invitation), - plans for publication of the proceedings. The workshop organisers will be responsible for maintaining a homepage, and for producing one hard copy of the proceedings in A4 or US-letter format. Organisers who whish to use a format different than A4 or US-letter are expected to produce the needed copies of proceedings as well. Proposals will be evaluated by the program committee and decisions will be made by January 10, 2000. Further information about the arrangements for workshops can be obtained from the workshop coordinator. Workshop Coordinator: Sandro Etalle Dept. of Computer Science, University of Maastricht, P.O. Box 616, 6200 MD Maastricht email: etalle@cs.unimaas.nl Fax: ++31 (0)43 3884897 From cat-dist Fri Nov 12 12:03:44 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id KAA25477 for categories-list; Fri, 12 Nov 1999 10:46:50 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f X-Mailer: exmh version 2.0.2+CL 2/24/98 To: categories@mta.ca Subject: categories: Paper announcement Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Date: Fri, 12 Nov 1999 14:05:07 +0000 From: Luca Cattani Message-Id: Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 22 The following paper is available at http://www.cl.cam.ac.uk/~glc25/premcl.html . It will also be available soon as BRICS Report, RS-99-36 (see www.brics.dk/Publications), and as Cambridge University Computer Laboratory Technical Report n. 477 (contact tech-reports@cl.cam.ac.uk to obtain a hard copy) : Presheaf Models for CCS-like Languages Gian Luca Cattani Glynn Winskel Computer Laboratory BRICS University of Cambridge University of Aarhus England Denmark Abstract ========= The aim of this paper is to harness the mathematical machinery around presheaves for the purposes of process calculi. Joyal, Nielsen and Winskel proposed a general definition of bisimulation from open maps. Here we show that open-map bisimulations within a range of presheaf models are congruences for a general process language, in which CCS and related languages are easily encoded. The results are then transferred to traditional models for processes. By first establishing the congruence results for presheaf models, abstract, general proofs of congruence properties can be provided and the awkwardness caused through traditional models not always possessing the cartesian liftings, used in the break-down of process operations, are side-stepped. The abstract results are applied to show that hereditary history-preserving bisimulation is a congruence for CCS-like languages to which is added a refinement operator on event structures as proposed by van Glabbeek and Goltz. From cat-dist Mon Nov 15 09:57:17 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id IAA12937 for categories-list; Mon, 15 Nov 1999 08:20:43 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-ID: <382F2E75.15FB@maths.usyd.edu.au> Date: Mon, 15 Nov 1999 08:49:41 +1100 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: coherence => universality (preprint) Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 23 The preprint "From coherent structures to universal properties" is available from http://www.maths.usyd.edu.au:8000/u/hermida under coh-univ.ps Abstract: Given a 2-category K admitting a calculus of bimodules, and a 2-monad T on it compatible with such calculus, we construct a 2-category L with a 2-monad S on it such that: i) S has the adjoint-pseudo-algebra property. ii) The 2-categories of pseudo-algebras of S and T are equivalent. Thus, coherent structures (pseudo-T-algebras) are transformed into universally characterised ones (adjoint-pseudo-S-algebras). The 2-category L consists of lax algebras for the pseudo-monad induced by T on the bicategory of bimodules of K. We give an intrinsic characterisation of pseudo-S-algebras in terms of {\em representability\/}. Two major consequences of the above transformation are the classifications of lax and strong morphisms, with the attendant coherence result for pseudo-algebras. We apply the theory in the context of internal categories and examine monoidal and monoidal globular categories (including their {\em monoid classifiers\/}) as well as pseudo-functors into Cat. -- Claudio Hermida School of Mathematics and Statistics F07, University of Sydney, Sydney, NSW 2006, Australia From cat-dist Wed Nov 17 13:32:03 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id MAA11906 for categories-list; Wed, 17 Nov 1999 12:07:38 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Tue, 16 Nov 1999 18:50:18 -0500 (EST) Message-Id: <3.0.16.19991116185142.33572526@wesleyan.edu> X-Sender: flinton@wesleyan.edu X-Mailer: Windows Eudora Pro Version 3.0 (16) To: categories@mta.ca From: "Fred E.J. Linton" Subject: categories: Yet another new book (shameless commerce division, again) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 24 Participants in this past summer's Coimbra meetings may be interested to learn that the photographs my wife snapped there have now (like those of April in Buffalo) been incorporated into another "This is Us" volume: "Symposium -- Celebrating [with] Saunders." Same format as "This is Us, Vol. 1: Doing Math -- Category Theorists at Buffalo," and same price, yet with even more pictures (170 pp. vs. 108 pp.). Using less costly paper and a more economical printing technique helped keep expenses -- and hence price -- about the same; fortunately, with no appreciable degradation of image quality. Pre-publication mock-ups got shown around last month, at the University of Chicago's own Saunders' Birthday Party, and at the McGill OktoberFest; thanks to all whom these tempted into placing early orders, publication was completed on November 1, in the very constructive sense that on that date we mailed out all copies ordered in October, and that all orders arriving since then have seen same-day fulfillment. Further copies of both books can now be produced upon demand, as can also custom enlargements of individual photos. For details, please use the address in the .sig below. Cheers (and thanks for forgiving this commercial intrusion upon your time), -- Fred [E.J. Linton, aka , for The Lintons' Video Press] From cat-dist Wed Nov 17 19:03:08 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id RAA08178 for categories-list; Wed, 17 Nov 1999 17:44:46 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Tue, 16 Nov 1999 09:49:08 -0800 (PST) Message-Id: <199911161749.JAA17701@Steam.Stanford.EDU> From: Carolyn Talcott To: categories@mta.ca Subject: categories: FMOODS'2000 cfp Reply-to: clt@cs.stanford.edu Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 25 ============================================================================== !! Apologies for multiple copies !! ============================================================================== Call for Papers FMOODS'2000 IFIP TC6/WG6.1 Third International Conference on Formal Methods for Open Object-Based Distributed Systems Stanford University , Stanford, California, USA September 6-8, 2000 ------------------------------------------------------------------------ Electronic Information * The conference home page is found at http://www.ics.uci.edu/~fmds2000 * Conference-related email should be addressed to fmoods2000@cs.stanford.edu * Information on the FMOODS series of conferences can be found at http://www.cs.ukc.ac.uk/research/netdist/fmoods ------------------------------------------------------------------------ Important Dates 1st March 2000 Submission deadline 30th April 2000Notification of acceptance 23rd May 2000 Camera ready copy for participants proceedings due ------------------------------------------------------------------------ Objectives Object-based Distributed Computing is being established as the most pertinent basis for the support of large, heterogeneous computing and telecommunications systems. Indeed, several important international organisations, such as ITU, ISO, OMG, TINA-C, etc. are defining similar distributed object-based frameworks as a foundation for open distributed computing. The advent of Open Object-based Distributed Systems - OODS - brings new challenges and opportunities for the use and development of formal methods. New architectures and system models are emerging (e.g., the enterprise, information, computational and engineering viewpoints of the ITU-T/ISO/IEC ODP Reference Model) which require formal notational support. Usual design issues such as specification, verification, refinement, and testing need to take into account new dimensions introduced by distribution and openness, such as quality of service and dependability constraints, dynamic binding and reconfiguration, consistency between multiple models and viewpoints, etc. OODS is a challenging research context and a source of motivation for semantical models of object-based systems and notations, for the evolution of standardised formal description techniques, for the application and assessment of logic based approaches, for better understanding and information modeling of business requirements, and for the further development and use of Object Oriented methodologies and tools. The objective of FMOODS is to provide an integrated forum for the presentation of research in several related fields, and the exchange of ideas and experiences in the topics concerned with the formal methods support for Open Object-based Distributed Systems. Topics of interest include but are not limited to: * formal models for object-based distributed computing * semantics of object-based distributed systems and programming languages * formal techniques in object-based and object-oriented specification, analysis and design * refinement and transformation of specifications * types, service types and subtyping * interoperability and composability of distributed services * object-based coordination languages * object-based mobile languages * efficient analysis techniques of specifications * multiple viewpoint modelling and consistency between different models * formal techniques in distributed systems verification and testing * specification, verification and testing of quality of service constraints * formal methods and object life cycle * beyond IDL: semantics based specification patterns * formal models for measuring the quality of object-oriented requirement or design specifications * formal aspects of distributed real-time multimedia systems * applications to telecommunications and related areas ------------------------------------------------------------------------ Conference Organizers Carolyn Talcott(Chair) Scott Smith(PC Chair) Tel: + 650 723-0936 Tel: + 410 516-5299 Fax: + 650 725-7411 Fax: + 410 516-6134 Stanford University The Johns Hopkins University Stanford, CA, USA Balimore, MD, USA clt@cs.stanford.edu scott@cs.jhu.edu Nalini Venkatasubramanian Sriram Sankar Tel: + 949 824-5898 Tel: + 510 796-0915 Fax: + 949 824-4056 Fax:+ 510 796-0916 University of California at Irvine Metamata Inc. Irvine, CA, USA Fremont, CA, USA nalini@ics.uci.edu sriram.sankar@metamata.com Program Committee * Gul Agha (U. of Illinois, USA) * Patrick Bellot (ENST, Paris, France) * Lynne Blair (U. Lancaster, UK) * Howard Bowman (UKC, Kent, UK) * Paolo Ciancarini (U. Bologna, Italy) * John Derrick (UKC, Kent, UK) * Michel Diaz (LAAS-CNRS, Toulouse, France) * Alessandro Fantechi (U. Firenze, Italy) * Kathleen Fisher (ATT Research Labs, USA) * Kokichi Futatsugi (Jaist, Ishikawa, Japan) * Joseph Goguen (UC San Diego, USA) * Roberto Gorrieri (U. Bologna, Italy) * Reinhard Gotzhein (U. Kaiserslautern, Germany) * Guy Leduc (U. of Liege, Belgium) * Luigi Logrippo (U of Ottawa, Canada) * David Luckham (Stanford University, USA) * Jan de Meer (GMD Fokus, Berlin, Germany) * Elie Najm (ENST, Paris, France) * Dusko Pavlovic (Kestrel Institute, USA) * Omar Rafiq (U. of Pau, France) * Arend Rensink (U. Twente, Netherlands) * Sriram Sankar (Metamata Inc., USA) * Gerd Schuermann (GMD Fokus, Berlin, Germany) * Scott Smith (Johns Hopkins University, USA) * Jean-Bernard Stefani (FT/CNET, Issy-les-Moulineaux, France) * Carolyn Talcott (Stanford University, USA) * Nalini Venkatasubramanian (UC Irvine, USA) Sponsors - IFIP ------------------------------------------------------------------------ Evaluation and Publication of Submitted Papers Submitted manuscripts will be evaluated and selected for presentation in the conference. The proceedings of FMOODS '00 will be published by Kluwer, the publishers of IFIP events. The proceedings will be made available at the conference. Instructions to the Authors Authors are invited to submit full original research papers, up to 16 pages (including bibliography), 12 point, single spaced, including an informative abstract, names and affiliations of all authors, and a list of keywords facilitating the assignment of papers to referees. Submission Paper submissions will be electronic via the web. Papers must be submitted as postscript documents that are interpretable by Ghostscript. Details on the submission process are to be found at http://www.ics.uci.edu/~fmds2000. The package for electronic submission of papers will be available approximately one month before the submission deadline. ------------------------------------------------------------------------ From cat-dist Wed Nov 17 19:13:18 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id RAA07379 for categories-list; Wed, 17 Nov 1999 17:39:22 -0400 (AST) X-Authentication-Warning: harald.daimi.au.dk: engberg set sender to engberg@brics.dk using -f From: Uffe Henrik Engberg Message-ID: <14383.62212.31107.134746@harald.daimi.au.dk> Date: Mon, 15 Nov 1999 12:48:20 +0100 (MET) MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit To: categories@mta.ca (Categories Reader) Subject: categories: BRICS Int. PhD School: Call for Admission and Grant Applications X-Mailer: VM 6.75 under Emacs 20.4.1 Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 26 [Please accept our apologies if you receive this more than once] B R I C S International PhD School in Computer Science University of Aarhus Denmark Call for Admission and Grant Applications This is a call for admission and grant applications from students to BRICS International PhD School in Computer Science at University of Aarhus, Denmark. The call is aimed at students starting August 2000, with application deadline January 31st, 2000. BRICS International PhD School is an integrated part of the BRICS (Basic Research in Computer Science) Research Centre, and both are funded by the Danish National Research Foundation. The school admits 10-15 students (Danish and foreign) annually, and it provides a substantial number of student grants. The core areas of the PhD School are: Semantics of Computation; Logic in Computer Science; Computational Complexity; Design and Analysis of Algorithms; Programming Languages; Distributed Computing; Verification; and Data Security and Cryptology. The PhD school will provide its students with a solid background in the theoretical foundation of computer science, and centred around BRICS activities. From this foundation, the students may either continue in one of the core areas or venture into areas of a more applied or experimental nature as possible areas of thesis specialisation. The PhD School wishes to recruit PhD students of the highest international standards. It provides an excellent research environment and scientific training facilities, and aims at making its PhD graduates attractive for a wide spectrum of employers - in private and public research and development institutions, both in Denmark and abroad. So, if you are a student with at least four years of full-time study by the summer of 2000, highly motivated and well prepared for a PhD study in computer science within a truly international environment, please send us an application following the instructions below. For more details, please visit http://www.brics.dk, or contact us by e-mail at phdschool@brics.dk. Also, we would appreciate your passing on this information to interested students and colleagues at your university or research institute. BRICS The Research Centre BRICS (Basic Research In Computer Science) was founded in 1994 by the Danish National Research Foundation at the Universities of Aarhus and Aalborg. BRICS is a centre of basic research in Algorithmics, Logic and Semantics, and has a scientific staff of 30 (permanent and long term visitors), and around 100 short term visitors annually. Admission Prerequisites and Study Structure Admission is based on knowledge corresponding to four years of full-time studies, including basic courses in programming and programming languages, computer systems, algorithms and data structures, computability and mathematics (this list will be interpreted in a flexible way). The time allocated for the PhD studies is a further four years, where the first two years include some mandatory course work and introductory research, concluded by a qualifying examination, whereas the last two years are dedicated to the writing of the thesis, finishing with a defence. All students admitted to the school will enter this study structure. We may, however, take into account merits from previous study. Students are normally admitted for the semester start September 1st. --- but admission may take place throughout the year. PhD Student Grants The school offers student grants of different types: 1. tuition waiver and full studentship 2. tuition waiver and partial studentship 3. tuition waiver Only a limited amount of type 1. grants are available. How to apply 1. First, fill in the application form on http://www.brics.dk/PhDSchool/Application.html Alternatively, send an e-mail to phdschool@brics.dk with subject "PhD Application" including: - your full name, personal address and phone number, college / university, URL of home page (if applicable), and e-mail address, - in case you apply for grants from the PhD School, the type of your application (see above - for details see http://www.brics.dk). 2. Second, send by ordinary mail to the address below - a covering letter, including the information from your application form/e-mail, - a short curriculum vitae, - complete official transcripts from colleges or universities, documenting minimally four years of full time study, - names of three people whom we may ask for letters of recommendation, - an indication of your motivation for a PhD study, and particular research area of initial interest (max two pages). Applications for admission August 1st, 2000 should be sent as soon as possible and before January 31st, 2000. Decisions will be announced in March, 2000. Postal Address BRICS International PhD School Department of Computer Science University of Aarhus Ny Munkegade, Bldg. 540 DK-8000 Aarhus C Denmark Phone: +45 8942 3264 Fax: +45 8942 3255 From cat-dist Thu Nov 18 12:48:59 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id LAA05990 for categories-list; Thu, 18 Nov 1999 11:25:19 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f From: Martin Escardo MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <14387.50120.760991.167873@mosstowie.dcs.st-and.ac.uk> Date: Thu, 18 Nov 1999 09:15:52 +0000 (GMT) To: categories@mta.ca Subject: categories: Re: function spaces X-Mailer: VM 6.72 under 21.1 (patch 6) "Big Bend" XEmacs Lucid Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 27 I wrote: > It is the purpose of this expository note to provide a > self-contained, elementary and brief development of the fact that > the exponentiable topological spaces are precisely the > core-compact spaces. The only prerequisite is a basic knowledge of > topology (continuous functions, product topology and compactness). > We hope that teachers and students of topology will find this > useful. As far as we know, there is no such development available > in the literature. Although there are one or two embellishments, > our methods are certainly not original. > >------------------------------------------------------------------- > http://www.dcs.st-and.ac.uk/~mhe/papers/exponentiablespaces.ps It turns out, as Fred Linton kindly let me know just after I posted this, that Eilenberg developed such an account to general function spaces in topology. Yesterday I got a copy of Eilenberg's manuscript (in the literal sense of manuscript) that Fred Linton sent me, which I read with pleasure. Apparently this will be eventually published. It was written around 1985. So, after all, there is (going to be) such a development available in the literature. The methods that both papers use are the same, and are due to Fox, Arens, Dugundji, Day and Kelly, Scott, and Isbell (although we combine them in different ways). These references and most of these methods are discussed in a paper on function spaces published by Isbell in 1985. Martin From cat-dist Thu Nov 18 12:56:38 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id LAA09718 for categories-list; Thu, 18 Nov 1999 11:26:02 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Thu, 18 Nov 1999 09:33:16 -0200 (EDT) From: Ruy de Queiroz X-Sender: ruy@limoeiro To: categories@mta.ca Subject: categories: WoLLIC'2000 Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 28 [apologies for multiple copies.] First Call for Contributions 7th Workshop on Logic, Language, Information and Computation (WoLLIC'2000) August 15-18, 2000 ! TUTORIALS >> (Tutorial Day: August 15th) << TUTORIALS ! Natal, Brazil The "7th Workshop on Logic, Language, Information and Computation" (WoLLIC'2000), the seventh version of a series of workshops which started in 1994 with the aim of fostering interdisciplinary research in pure and applied logic, will be held in Natal, Brazil, from August 15th to 18th 2000. Contributions are invited in the form of short papers (10 A4 10pt pages) in all areas related to logic, language, information and computation, including: pure logical systems, proof theory, model theory, algebraic logic, type theory, category theory, constructive mathematics, lambda and combinatorial calculi, program logic and program semantics, logics and models of concurrency, logic and complexity theory, nonclassical logics, nonmonotonic logic, logic and language, discourse representation, logic and artificial intelligence, automated deduction, foundations of logic programming, logic and computation, and logic engineering. The 7th WoLLIC'2000 has the scientific sponsorship of the Association for Symbolic Logic (ASL), the Interest Group in Pure and Applied Logics (IGPL), the European Association for Logic, Language and Information (FoLLI), the Sociedade Brasileira de Computacao (SBC), and the Sociedade Brasileira de Logica (SBL). THE LOCATION Natal is the capital and largest city of Rio Grande do Norte, a sun shiny land of beaches, dunes, coconut trees, located in north-east coast of Brazil. There, the summer takes all year long (sun shines more than 300 days per year), and the heat is softened by a constant breeze. Along the 400-kilometer (250-mile) coast line, calm beaches with reefs forming natural pools altern with good surfing spots, almost untouched places full of sand dunes and coconut trees. GUEST SPEAKERS There will be a number of guest speakers, including: Andrea Asperti (Univ Bologna, Italy) Maria Luisa Bonet (Univ Politecnica Catalunya, Spain) (*) Martin Hyland (Cambridge Univ, UK) (*) Angus Macintyre (Edinburgh Univ, Scotland) Luiz Carlos Pereira (Pontificial Catholic Univ of Rio, Brazil) Bruno Poizat (Univ Lyon I, France) (*) Glynn Winskel (BRICS, Denmark) (*) TO BE CONFIRMED SUBMISSION: Papers (sent preferably in postscript format by e-mail to wollic@di.ufpe.br, or in 5(five) copies to postal address) must be RECEIVED by MAY 7th, 2000 by the Chair of the Organising Committee. Papers must be ANONYMOUS (a separate identification page must be included), written in English and give enough detail to allow the programme committee to assess the merits of the work. Papers should start with a brief statement of the issues, a summary of the main results, and a statement of their significance and relevance to the workshop. References and comparisons with related work is also expected. Technical development directed to the specialist should follow. Results must be unpublished and not submitted for publication elsewhere, including the proceedings of other symposia or workshops. One author of each accepted paper will be expected to attend the conference in order to present it. Authors will be notified of acceptance by JUNE 9th, 2000, and final versions will have to be delivered (in LaTeX format) by JUNE 16th, 2000. The abstracts of the papers will be published in a "Conference Report" section of the Logic Journal of the IGPL (ISSN 1367-0751) (Oxford Univ Press) as part of the meeting report. Papers presented at the meeting will be invited for submission (in full version) to the Logic Journal of the IGPL (http://www.oup.co.uk/igpl/). IMPORTANT DATES: Submission: May 7th, 2000 Notification of acceptance/rejection: June 9th, 2000 Delivery of final (in LaTeX): June 16th, 2000 PROGRAMME COMMITTEE: Sergei Artemov (Moscow Univ, Russia, and Cornell Univ, USA), Ricardo Bianconi (Univ Sao Paulo, Brazil), Sam Buss (UC San Diego, USA), Edmund Clarke (Carnegie-Mellon Univ, USA), Itala D'Ottaviano (Univ Campinas, Brazil), Heinz-Dieter Ebbinghaus (Univ Freiburg, Germany), Peter Johnstone (Cambridge Univ, UK), Hans Kamp (Univ Stuttgart, Germany), Pat Lincoln (SRI International, USA), Maarten de Rijke (Amsterdam Univ, The Netherlands), Colin Stirling (Edinburgh Univ, Scotland). ORGANISING COMMITTEE: B. C. Bedregal (UFRN), M. E. Coniglio (UNICAMP), A. M. P. Cruz (UFRN), D. Deharbe (UFRN), A. T. C. Martins (UFC), A. Moreira (UFRN), A. G. de Oliveira (UFPE/UFBA), R. de Queiroz (UFPE), R. H. N. Santiago (UFRN). For further information, contact the Chair of the Organising Committee: Ruy de Queiroz, Departamento de Informatica, Univ. Federal de Pernambuco, CP 7851, 50732-970 Recife, PE, Brazil. E-mail: ruy@di.ufpe.br, tel.: (+55 81) 271-8430, fax: (+55 81) 271-8438. WEB PAGE: http://www.di.ufpe.br/~wollic/wollic2000/ From cat-dist Thu Nov 18 15:30:16 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id NAA15424 for categories-list; Thu, 18 Nov 1999 13:58:34 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f X-Received: from zent.mta.ca (zent.mta.ca [138.73.101.4]) by mailserv.mta.ca (8.9.3/8.9.3) with SMTP id TAA25167 for ; Wed, 17 Nov 1999 19:14:30 -0400 (AST) X-Received: FROM mail.wesleyan.edu BY zent.mta.ca ; Wed Nov 17 19:31:17 1999 X-Received: from wesleyan.edu (flinton.math.wesleyan.edu [129.133.30.58]) by mail.wesleyan.edu (8.9.3/8.9.1) with SMTP id SAA29516 for ; Wed, 17 Nov 1999 18:14:16 -0500 (EST) Date: Wed, 17 Nov 1999 18:14:16 -0500 (EST) Message-Id: <3.0.16.19991117181604.3a97e9d6@wesleyan.edu> X-Sender: flinton@wesleyan.edu X-Mailer: Windows Eudora Pro Version 3.0 (16) To: categories@mta.ca From: "Fred E.J. Linton" Subject: categories: Re: Yet another new book (shameless commerce division, again) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 29 PS: The current pricing of the two "This is Us" volumes, the new "Symposium -- Celebrating [with] Saunders," as well as the older "Doing Math -- Category Theorists at Buffalo," still remains at $25 per copy, postpaid (but the state of CT requires residents thereof to pay an additional $1.50 per copy, as 6% CT sales tax). Alas, once amazon.com and BarnesandNoble.com undertake distribution, these books' new official list prices will rise, to $34.95. [On the bright side, both .com operations take credit card payments, which The Lintons' Video Press cannot. Anyway, caveat emptor.] -- Fred [E.J. Linton, aka ] , for: The Lintons' Video Press, 36 Everit St., New Haven, CT 06511-2208-36 (USA) From cat-dist Thu Nov 25 16:35:23 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id PAA27179 for categories-list; Thu, 25 Nov 1999 15:08:43 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-Id: <199911250954.JAA19716@nijinsky.dcs.shef.ac.uk> Date: Thu, 25 Nov 1999 09:54:11 +0000 (GMT) From: Michael Mendler Reply-To: Michael Mendler Subject: categories: New Lectureship and Readership Positions at Sheffield To: categories@mta.ca MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: V67po4FO4+VujW9VwXfJhw== X-Mailer: dtmail 1.3.0 CDE Version 1.3 SunOS 5.7 sun4u sparc Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 30 Dear Colleagues, Three lectureships (Ref:R1868A) and one readership position (Ref:R1868C) are available at the Department of Computer Science of Sheffield University. I would be grateful if you could bring these positions to the attention of anyone who might be interested. One of the lectureships is available for candidates from any area, another one as well as the readership would be suitable for research-strong applicants in distributed systems theory, specifically mobile agents. More information about the posts can be found on the Department's web-page Informal enquiries may be made to Professors Yorick Wilks or Mahesan Niranjan {yorick,niranjan}@dcs.shef.ac.uk. Further details of how to apply are available from the Personnel Department Jobs Page at The closing date for all applications will be Monday 20 December 1999. Thanks a lot, Michael Mendler From cat-dist Mon Nov 29 13:37:14 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id LAA30722 for categories-list; Mon, 29 Nov 1999 11:41:31 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f From: Jiri Adamek Message-Id: <199911291513.QAA16532@lisa.iti.cs.tu-bs.de> Subject: categories: change of address To: categories@mta.ca Date: Mon, 29 Nov 1999 16:13:22 +0100 (MET) X-Mailer: ELM [version 2.4ME+ PL28 (25)] 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: X-Keywords: X-UID: 31 Please use the following address in case of difficulties with my usual one: J.Adamek@tu-bs.de From cat-dist Tue Nov 30 21:21:39 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id UAA19268 for categories-list; Tue, 30 Nov 1999 20:11:22 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-Id: Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Mon, 29 Nov 1999 19:41:43 +0100 To: categories@mta.ca From: "Prof. Apolloni Bruno" Subject: categories: Job Position at Milano University Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: X-Keywords: X-UID: 32 RESEARCH POST IN THE DEPT. OF COMPUTER SCIENCE, UNIVERSITY OF MILAN Applications are invited for a research post within the framework of the "Principled Hybrid Systems: Theory and Applications" (PHYSTA) research network. The network is funded by the Training and Mobility of Researchers programme (TMR) of the EC and has started in December 1997. It involves research groups from five universities: i) King's College London, United Kingdom (Dept. of Mathematics, Prof. J.Taylor) ii) Katholic University of Nijmegen, Netherlands (Centre for Neural Networks, Prof. Stan Gielen) iii) National Technical University of Athens, Greece (Dept. of Electrical and Computer Engineering, Prof. Stefanos Kollias) iv) University of Milan, Italy (Department of Computer Science, Prof. Bruno Apolloni) v) Queen's University Belfast, United Kingdom (Dept. of Psychology/English, Prof. Rodie Cowie) The aim of the research network is the development of a theory and a methodology for combining symbolic and sub-symbolic techniques. The problem domain which is used comes from HCI and refers to emotion understanding based on static/moving image and speech signals. The research post is available in the Neural Networks Laboratory of the Computer Science Department of the University of Milan. The post is available immediately for a period of 18 months. The successful applicant will work for the continuation of the development of a hybrid system prototype which has been implemented. This is a system combining a neural processing part which performs a mapping from the feature to the propositional variables space and a symbolic processing part. The latter is a series of meditation jumps to higher levels of abstraction following a PAC learning framework for boolean formulas. Candidates must have (or be close to obtaining) a PhD in a field such as Computer Science, Mathematics or Electrical Engineering. C programming skills are necessary while experience using SNNS and Scheme/Lisp programming skills are welcome. As the funding is provided by the EC TMR programme there are some restrictions on who may benefit from it: * Candidates must be 35 years old or younger. * Candidates must be nationals of a EU country, Norway, Switzerland or Iceland * Candidates must not be Italian nationals or have worked in Italy 18 out of the last 24 months. The salary for this post is approximately 2,100 Euros. To apply for this post please (e)mail your CV to the address below: Professor Bruno Apolloni, Neural Networks Laboratory Computer Science Department University of Milan, Via Comelico 39, Milano 20135, ITALY phone: 0039 02 55006284 fax: 0039 02 55006276 email: apolloni@dsi.unimi.it More information: apolloni@dsi.unimi.it http://www.image.ece.ntua.gr/physta From cat-dist Tue Nov 30 21:21:39 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id UAA17743 for categories-list; Tue, 30 Nov 1999 20:09:20 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-ID: <001101bf3b4e$9ab982c0$95b4fea9@bob> From: "RFC Walters" To: Subject: categories: CFP CT 2000 Date: Tue, 30 Nov 1999 17:18:55 +0100 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" X-Priority: 3 X-MSMail-Priority: Normal Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 33 CALL FOR PAPERS CATEGORY THEORY 2000 (CT 2000) July 16-22, 2000 Centro di Cultura Scientifica "Alessandro Volta" di Villa Olmo Como, Italy The next international summer conference in category theory will be held at Villa Olmo from Sunday 16th July to Saturday 22nd July 2000. We invite submissions in all areas of category theory and its applications, but particularly in the following areas: * algebraic topology and homological algebra, * categorical logic, * categories and computer science, * enriched category theory and 2-dimensional universal algebra, * galois theory and descent, * general category theory. * higher dimensional category theory and quantum algebra, * topos theory and synthetic differential geometry, The web page for the conference is http://www.disi.unige.it/conferences/ct2000/ Electronic submissions are preferred but authors may instead mail 4 copies of an extended abstract, in either case to arrive by 15th March, 2000. Email address for electronic submissions ct2000@disi.unige.it Mail address for hardcopy submissions RFC Walters (CT 2000) Dipartimento di Scienze CC., FF., MM., Universitŕ degli studi dell'Insubria 22100 Como, Italy Important Dates 15 March, 2000: Papers due 15 May, 2000: Notification of acceptance or rejection of papers 16-22 July, 2000: Conference Papers should be submitted in the form of an extended abstract. Papers should begin with the title of the paper, each author's name, affiliation, and e-mail address, followed by a statement as to which of the areas of category theory mentioned above the paper belongs, a succinct statement of the problems and goals that are considered in the paper, the main results achieved, the significance of the work in the context of previous research, and a comparison to past research. The abstract should provide sufficient detail to allow the program committee to evaluate the validity, quality, and relevance of the contribution. The entire extended abstract should not exceed 10 pages. Authors will be notified of acceptance or rejection by 15 May, 2000. Program Committee S.L. Bloom (Stevens Institute, USA) J.M.E. Hyland (Cambridge, U.K.) G. Janelidze (Georgian Academy of Sciences, Tbilisi) G.M. Kelly (Sydney, Australia) A. Kock (Aarhus, Denmark) R. Pare (Dalhousie, Canada) R.H. Street (Macquarie, Australia) Organizing Committee A. Carboni (Insubria) G. Rosolini (Genova) R.F.C. Walters (Insubria and Sydney)