From cat-dist Wed Dec 2 14:12:59 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id LAA25948 for categories-list; Wed, 2 Dec 1998 11:41:16 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Mon, 30 Nov 1998 15:32:48 -0800 Message-Id: <199811302332.PAA11466@lannion.eiffel.com> From: "Karen Ouellette" To: categories@mta.ca Subject: categories: TOOLS EUROPE '99 - Call for Submissions Reply-To: tools-europe@eiffel.com Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: [apologies if you receive multiple copies of this announcement] **************************************************************** CALL FOR SUBMISSIONS TOOLS EUROPE '99 Technology of Object-Oriented Languages and Systems "OBJECTS, COMPONENTS, AGENTS" Nancy, France, June 7-10, 1999 http://www.tools.com/europe **************************************************************** TOOLS - Technology of Object-Oriented Languages and Systems - is the major series of international conferences and exhibition entirely devoted to the applications of object-oriented technology. Its emphasis is on the practice of object technology and its applications in industrial environments. TOOLS provides a balanced coverage of the wealth of approaches, trends and variants in the object-oriented community. For anyone interested in OT, the TOOLS Conferences are the best places to learn from the experts and compare experiences with other O-O practitioners. CONFERENCE COMMITTEE ~~~~~~~~~~~~~~~~~~~~~~~~ Program Chair: Richard Mitchell, University of Brighton, UK Tutorials Chair: Alan Cameron Wills, TriReme International Ltd., UK Workshops & Panels Chair: Jan Bosch, University of Karlskrona/Ronneby, Sweden Conference Chair: Jean-Pierre Finance, Henri Poincaré University, France Organising Chair: Martine Gautier, Henri Poincaré University, France Conference Series Chair: Bertrand Meyer, ISE, USA PROGRAMME COMMITTEE ~~~~~~~~~~~~~~~~~~~~~~~ Mehmet Aksit, University of Twente, Netherlands François Bançilhon, Ardent Software, USA Richard Bielak, CAL FP (US), Inc., USA Gilad Bracha, Sun Microsystems, USA Eduardo Casais, Nokia, Finland Alistair Cockburn, Humans and Technology, USA Dominique Colnet, LORIA - INRIA Lorraine, France Bernard Coulange, Verilog, France Paul Dubois, Lawrence Livermore National Laboratory, USA Jean-Marc Geib, University de Lille, France Yossi Gil, Technion, Israel & IBM Research, USA Petter Graff, InferData, USA Ian Graham, Chase Manhattan Bank, UK Brian Henderson-Sellers, Swinburne University of Technology, Australia Laura Hill, Sun Microsystems, USA René Jacquart, CERT, France Jean-Marc Jézéquel, IRISA/CNRS, France Rachid Guerraoui, Swiss Federal Institute of Technology, Switzerland Sven-Eric Lautemann, University of Frankfurt, Germany Michel Lemoine, ONERA-CERT, France Ian Maung, Platinum Technology, USA Jim McKim, Rensselaer Polytechnic, USA Mira Mezini, University of Siegen, Germany Christine Mingins, Monash University, Australia Frieder Monninger, Object Tools, Germany Meilir Page-Jones, Wayland Systems, USA Jean-Claude Royer, University of Nantes, France Ted Velkoff, Lockheed Martin, USA Kim Waldén, ENEA, Sweden Tony Wasserman, Software Methods and Tools, USA Wolf Zimmermann, University of Karlsruhe, Germany TECHNICAL PAPERS ~~~~~~~~~~~~~~~~~~ TOOLS EUROPE '99 is now soliciting papers on all aspects of object-oriented technology. All submitted papers will be refereed and judged by the International Programme Committee, not only according to standards of technical quality but also on their usefulness to practitioners and applied researchers. A non-exhaustive list of topics includes: * Production, distribution and revenue collection of industrial-quality reusable components * Extending objects to include, for example, rules * Specification, modeling, and patterns * Architectures and frameworks * Working with a mixture of technologies and languages * Managing software assets * Empirical and field studies * Experience reports: TOOLS Europe '99 is particularly keen on receiving experience reports describing lessons learned from the practical application of objects, components, agents, frameworks, and architectures Submitted papers should be around 12 pages, single or one-and-a-half spaced. Send six copies of your paper to the Programme Chair, to arrive no later than Friday, February 19, 1999. Each submission should be accompanied by a plain-text Notice of Submission, due a couple of days before the paper. Send this notice to (with subject line "TOOLS Europe '99 Notice of Submission"), to arrive no later than Friday, February 12, 1999. The proceedings of the 29th TOOLS Conference will be published by IEEE Computer Society Press. Final camera-ready versions of accepted papers will therefore be required to adhere to the IEEE publication format (guidelines available soon), and will contain no more than 12 pages. IMPORTANT DATES: Notice of submission: February 12, 1999 Manuscript submission: February 19, 1999 Notification of acceptance: March 29, 1999 Final copy due at IEEE: April 16, 1999 PROPOSALS SHOULD BE SUBMITTED TO: Richard Mitchell TOOLS EUROPE '99 Programme Chair Faculty of IT University of Brighton Brighton BN2 4GJ UK Phone: +44 1273 642458 Richard.Mitchell@brighton.ac.uk TUTORIALS ~~~~~~~~~~ Proposals are sought for high quality tutorials. A tutorial should address a single topic and have a clearly defined tar get audience. A tutorial will usually involve a variety of activities for those attending. Each tutorial is half a day in length. The presenter should have proven experience that qualifies him or her to give the tutorial. Proposals for tutorials should identify the topic, the audience and the relevant experience of the presenter. Please note that you must prepare tutorial notes for the participants. IMPORTANT DATES: Tutorial submission deadline: January 8, 1999 Notification of acceptance: March 29, 1999 PROPOSALS SHOULD BE SUBMITTED TO: Alan Cameron Wills TOOLS EUROPE '99 Tutorials Chair TriReme International Ltd., UK alan@trireme.com WORKSHOPS ~~~~~~~~~~~~ Workshops provide a forum for researchers and practitioners to meet and discuss focused issues in an atmosphere that encourages interaction, exchange, and problem solving. A workshop should have a well-defined theme, and a clearly-defined target audience. All topics related to object-oriented technology are potential candidates for workshops. In particular, workshop proposals fall into three categories: * Workshops focusing on a topic in depth. Examples include object-oriented analysis and design methods, object-oriented languages, e.g. Eiffel, etc. * Workshops crossing borders of sub-areas in computer science and/or software engineering. Examples are management and teaching issues. * Workshops addressing the industrial application of object-oriented technology in particular areas, e.g. telecommunications, mobile computing or real-time systems. IMPORTANT DATES: Workshop submission deadline: January 8, 1999 Notification of acceptance: March 29, 1999 PROPOSALS SHOULD BE SUBMITTED TO: Jan Bosch TOOLS EUROPE '99 Workshops & Panels Chair University of Karlskrona/Ronneby, Sweden Jan.Bosch@ide.hk-r.se PANELS ~~~~~~~~ The aim of panels is to stimulate discussion about ideas and issues of importance to the object-oriented technology community. They should present interesting and divergent views with solid practical and/or theoretical backing. Panels last about sixty minutes and can be organised in many formats. IMPORTANT DATES: Panel submission deadline: January 8, 1999 Notification of acceptance: March 29, 1999 PROPOSALS SHOULD BE SUBMITTED TO: Jan Bosch TOOLS EUROPE '99 Workshops & Panels Chair University of Karlskrona/Ronneby, Sweden Jan.Bosch@ide.hk-r.se ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ TOOLS EUROPE '99 IS ORGANISED IN COOPERATION WITH UNIVERSITÉ HENRI POINCARÉ, NANCY, FRANCE. FOR MORE INFORMATION ON TOOLS USA '99, VISIT OUR WEB SITE AT http://www.tools.com/europe OR CONTACT US AT tools-europe@tools.com ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ From cat-dist Wed Dec 2 13:48:07 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id LAA32327 for categories-list; Wed, 2 Dec 1998 11:45:51 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Tue, 1 Dec 1998 13:50:21 -0500 From: Michael Barr To: categories@mta.ca Subject: categories: triples down Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: The subject says it all. In general, you should ALWAYS use the address barr@math.mcgill.ca since I can adjust that for the viccissitudes of computerdom. What is happening is that someone is getting into it and sending out gobs of material, enough to generate official complaints from downstream computers and the CC here has turned it off. This happened last summer and we assumed it was ftp, but now we have turned that off, as most of you know. To make matters worse, our technician is a student. We moved the computer to the computer centre last summer because our offices had no air conditioning and the CC absolutely will not permit students to enter for any reason whatever. I guess we will have to take it out. From cat-dist Thu Dec 10 15:37:08 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id NAA26422 for categories-list; Thu, 10 Dec 1998 13:29:50 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Wed, 9 Dec 1998 22:22:03 -0800 (PST) From: Jonathon Funk To: categories@mta.ca Subject: categories: preprint (revised) available Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: The preprint: On Branched Covers in Topos Theory is available from my home page http://www.math.ubc.ca/~funk/ in postscript or .dvi format. This is a revision and extension of a preprint I had posted from Cyprus in June, 98. Abstract: We present some new findings concerning branched covers in topos theory. Our discussion involves a particular subtopos of a given topos that can be described as the smallest subtopos closed under small coproducts in the including topos. Our main result is a description of the covers of this subtopos as a category of fractions of branched covers, in the sense of R. Fox, of the including topos. We also have some new results concerning the general theory of KZ-doctrines, such as the closure under composition of discrete fibrations for a KZ-doctrine, in the sense of Bunge-Funk. From cat-dist Thu Dec 10 15:48:23 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id NAA00532 for categories-list; Thu, 10 Dec 1998 13:30:32 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Thu, 10 Dec 1998 23:23:38 +1100 (EST) From: maxk@maths.usyd.edu.au (Max Kelly) Message-Id: <199812101223.XAA30387@milan.maths.usyd.edu.au> To: categories@mta.ca, maxk@maths.usyd.edu.au Subject: categories: Question of Tom Leinster of 26 Nov: one-object closed categories Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: Tom observed that an abelian monoid is a symmetric monoidal closed category with one object, and asked whether anyone had studied categories enriched in such a closed category. Eilenberg and I, in our long article [Closed categories, in Proc. Conf. on Categorical Algebra (La Jolla, 1965), Springer-Verlag 1966, 421 - 562] remarked in our "Examples" section (Ch.4, Section3, page 553) that these are, to within isomorphism, the only one-object s.m.closed categories. The odd thing is that we don't seem to have looked at V-categories for such a V - perhaps we did not want to give trivial-looking examples, although we gave other little examples such as Heyting algebras. The use we made of such a V arising from an abelian monoid M was to give an interesting but unusual example of a monoidal functor. We observed that a monoidal functor f: V --> Ab was the same thing as an M-algebra, commutative precisely when the monoidal functor f is symmetric. Anyway, I had a brief look at V-categories for such a V tonight, but with too few details so far to say much about them before bedtime. Queer little creatures, aren't they? A V-category A has objects a, b. c. and so on, but each A(a,b) is the unique object * of V. All the action takes place at the level of j: I --> A(a,a) and M: A(b,c) o A(a,b) --> A(a,c). Sorry to use the traditional M for composition, when it was the monoid. Let the monoid be G. When G is an abelian group, the M and j seem to be determined by elements N_a,b depending on two objects of A. There is more meat in a V-functor. I look forward to working through this - as I suppose Tom has done - and looking especially at the cases where G is a two-element monoid. The underlying ordinary category A_o of the V-category A seems to be an odd beast. While I don't remember ever working through this, it still rings a bell. Somewhere I have seen arrows decorated with something like numbers (elements of G ?). Ross Street and his colleagues at Macquarie often use the word "suspension" for the process of seeing an abelian as a one-object monoidal category, a monoidal category as a one-object bicategory, and such things - I don't know the full definition of "suspension"; but they and numerous others are well aware of, for instance, the tricategory with one object, whose 1-cells are commutative rings, whose 2-cells are two-sided algebras, whose 3-cells are bimodules, and whose 4-cells are bimodule-homomorphisms. Clearly I got that wrong; I think the objects should have been the commutative rings. Anyway, people doing this work are very likely to have seen and used such one-object V. Still, it looks like fun; and I've never seen an exposition of V-Cat for the case where G is the two-element group. I'm taking it to bed. Max Kelly. From cat-dist Fri Dec 11 01:06:22 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id WAA26514 for categories-list; Thu, 10 Dec 1998 22:45:04 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Subject: categories: Re: one-object closed categories To: categories@mta.ca Date: Thu, 10 Dec 1998 19:20:03 +0000 (GMT) X-Mailer: ELM [version 2.4 PL25] MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Message-Id: From: Tom Leinster Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: > From: maxk@maths.usyd.edu.au (Max Kelly) > > Tom observed that an abelian monoid is a symmetric monoidal closed > category with one object, and asked whether anyone had studied categories > enriched in such a closed category. > [...] > > Anyway, I had a brief look at V-categories for such a V tonight, but with > too few details so far to say much about them before bedtime. Queer little > creatures, aren't they? A V-category A has objects a, b. c. and so on, but > each A(a,b) is the unique object * of V. All the action takes place at the > level of j: I --> A(a,a) and M: A(b,c) o A(a,b) --> A(a,c). [...] Since I asked the question I've found a few examples; they've all got the same flavour about them, so I'll just do my favourite. If V is the commutative monoid, then a V-enriched category is a set A plus two functions [-,-,-]: A x A x A ---> V [-]: A ---> V satisfying [a,c,d] + [a,b,c] = [a,b,d] + [b,c,d] [a,a,b] + [a] = 0 = [a,b,b] + [b] for all a, b, c, d. The example: let A be a subset of the plane. Choose a smooth path P(a,b) from a to b for each (a,b) in A x A, and define [a,b,c] to be the signed area bounded by the loop P(a,b) then P(b,c) then (P(a,c) run backwards); also define [a] to be -(area bounded by P(a,a)). (There's meant to be an orientation on the plane, so that areas can be negative.) Then the equations say obvious things about area - don't think I'm up to that kind of ASCII art, though. Tom From cat-dist Fri Dec 11 11:24:36 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id JAA07551 for categories-list; Fri, 11 Dec 1998 09:22:44 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-Id: To: categories@mta.ca Cc: ng13 Subject: categories: PhD position available Mime-Version: 1.0 (generated by tm-edit 7.108) Content-Type: text/plain; charset=US-ASCII Date: Fri, 11 Dec 1998 08:49:44 +0100 From: N Ghani Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: I am currently looking for someone who wants to do a PhD on categorical models of rewriting. If you are interested, or know someone who may be, then please get in touch. You can find bits and bobs about what I have in mind from my homepage http://www.mcs.le.ac.uk/~ng13/home.html Neil Ghani From cat-dist Sun Dec 13 16:10:50 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id PAA19965 for categories-list; Sun, 13 Dec 1998 15:09:52 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f From: Peter Selinger Message-Id: <199812120315.WAA01623@dirichlet.math.lsa.umich.edu> Subject: Re: categories: Re: one-object closed categories To: T.Leinster@dpmms.cam.ac.uk (Tom Leinster) Date: Fri, 11 Dec 1998 22:15:22 -0500 (EST) Cc: categories@mta.ca In-Reply-To: from "Tom Leinster" at Dec 10, 98 07:20:03 pm X-Mailer: ELM [version 2.4 PL25] MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: > From Tom Leinster: > > Since I asked the question I've found a few examples; they've all got > the same flavour about them, so I'll just do my favourite. > > If V is the commutative monoid, then a V-enriched category is a set A plus > two functions > [-,-,-]: A x A x A ---> V > [-]: A ---> V > satisfying > [a,c,d] + [a,b,c] = [a,b,d] + [b,c,d] > [a,a,b] + [a] = 0 = [a,b,b] + [b] > for all a, b, c, d. A few remarks: In the case where V is an abelian group, the first axiom already implies the other two if we define [a] = -[a,a,a]. Namely, by letting a=b in the first axiom, it follows that [a,a,c] is independent of c. If V is an abelian group, then one can get an example of the above structure from an arbitrary map {-,-} : A x A ---> V by letting [a,b,c] = {a,b}+{b,c}-{a,c} and [a] = -{a,a}. Tom's "area" example is of this form. In fact, if V is an abelian group, then *any* example of a V-enriched category is (non-uniquely) of the form described in the previous paragraph: Fix some x in A (if any), and define {a,b} = [a,b,x]. What about the non-group case? In general, [a,b,c] need not always be invertible in V. In fact, [a,b,a] need not be invertible. For a simple example of this, let V be the natural numbers and define [a] = 0, [a,b,c] = 0, if a=b or b=c, 1, if a,b,c pairwise distinct, 2, otherwise (i.e., if a=c but a,b distinct). This indeed works. Best wishes, -- Peter Selinger > The example: let A be a subset of the plane. Choose a smooth path P(a,b) from > a to b for each (a,b) in A x A, and define [a,b,c] to be the signed area > bounded by the loop > P(a,b) then P(b,c) then (P(a,c) run backwards); > also define [a] to be > -(area bounded by P(a,a)). > (There's meant to be an orientation on the plane, so that areas can be > negative.) Then the equations say obvious things about area - don't think > I'm up to that kind of ASCII art, though. From cat-dist Sun Dec 13 16:17:07 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id PAA09421 for categories-list; Sun, 13 Dec 1998 15:15:50 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Sat, 12 Dec 1998 23:31:20 +0200 (EET) From: Mamuka Jibladze To: categories@mta.ca Subject: categories: Re: one-object closed categories In-Reply-To: Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: Concerning categories enriched in monoidal categories with a single object: another example is given by cocycles. It can be presented in various ways. For example, a "\v Cech style" version: given an open cover of X by Ui and a (suitably normalized) \v Cech 3-cocycle c of this cover with values in M, this enrichs in the evident way the category whose objects are the i's, with hom(i,j) either a singleton or empty according to inhabitedness of the intersection of Ui and Uj. Other variations suggest things like morphisms of simplicial sets to the nerve of M considered as a 2-category with a single 1-cell. This is related to K(M,2)-torsors, etc. Quite probably there are several publications exploiting this. At least cocycles with values in monoids rather than groups certainly have been considered. What I certainly have not seen is a backwards generalization: has anybody considered analogs of K(M,2)-torsors for general enrichments? Would be very interested in a reference. Happy holidays to all! Mamuka From cat-dist Sun Dec 13 16:17:07 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id PAA08601 for categories-list; Sun, 13 Dec 1998 15:11:29 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Sat, 12 Dec 1998 19:31:36 +1100 (EST) From: maxk@maths.usyd.edu.au (Max Kelly) Message-Id: <199812120831.TAA05290@milan.maths.usyd.edu.au> To: categories@mta.ca Subject: categories: V-categories where V "is" an abelian monoid. Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: Since I wrote some first thoughts the other night about Tom Leinster's question on the above, I've had some second thoughts which are perhaps a little more sensible, and may remove some of the mystery from these strange critters (which may be quite beautiful - I've just seen Tom's example of 10 Dec.). To get the notation straight, let G be an abelian monoid (perhaps a group), and V_o the category with one object * and V_o(*,*) = G. Then V_o underlies a symmetric monoidal closed category V with one object *, with tensor product o given on objects by *o* = * and on maps by fog = fg, with unit object I = *, and with internal-hom given on objects by [*,*] = *, and on maps by [f,g] = fg. So we can speak of V-categories, V-functors, and V-natural transformations at the level of my old paper with Eilenberg, incloding the ordinary category A_o underlying a V-category A. However all the richer theory of V-categories etc., as in my book on the subject, needs completeness of V_o for the definition of functor-categories, and hence for limit- and colimit-notions, Kan extension, and so on; as well as cocompleteness too, for these to work well. So, to this extent, V is a lousy closed category, being neither complete nor cocomplete. However there is a cure for incompleteness, called "completion"; although "cocompletion" works more smoothly. So let us embed V_o by Yoneda in its free cocompletion, the ordinary functor-category [V_o^op, Set]. We don't need the "op" here, since G is abelian. This functor-category is nothing but the presheaf category of G-sets (sets with an action of G, with the usual axioms (fg)x = f(gx) and 1x = x). This has a cartesian-closed structure, but forget that; it also has a symmetric monoidal closed structure arising from that on V using Day's convolution process. This is nothing but the Linton- -type s.m.closed structure where the tensor-product A o B represents the bi-homomorphisms out of A x B, and the internal-hom [A,B] is the G-set of all homomorphisms of G-sets from A to B. Explicitly, A o B is the quotient of A x B by the relation (fx,y) = (x,fy). Let us call THIS s.m.closed category W. Then V is embedded in W by Yoneda, and the image in W of * is the G-set G itself, seen as a G-set using its own multiplication - the "regular representation". So we may see V as this "part" of W. Now a V-category is nothing but a W-category whose hom-objects all happen to lie in V (which is a sub-monoidal category of W). Such a category A, with objects a,b, c, and so on, no longer need be said to have each A(a,b) equal to *, but instead to have A(a,b) = G. So the V-categories are nothing but these very special W-categories, and W is a highly-respectable s.m.closed category, first cousin to R-Mod for a commurative ring R. In fact, there is a "free" W-category F(B) on any ordinary category B; it has the same objects as B, and (F(B))(a,b) is the free G-set on the set B(a,b). The V-categories are just those W-categories of the form F(B) where the ordinary category B is CHAOTIC; that is to say, each B(a,b) is a singleton. So at least these nice new objects have a kind of legitimate origin. Max Kelly. From cat-dist Tue Dec 15 00:25:16 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id WAA01623 for categories-list; Mon, 14 Dec 1998 22:16:07 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f X-Received: from xena.acsu.buffalo.edu (qmailr@xena.acsu.buffalo.edu [128.205.7.121]) by mailserv.mta.ca (8.8.8/8.8.8) with SMTP id SAA20041 for ; Mon, 14 Dec 1998 18:45:40 -0400 (AST) X-Received: (qmail 13552 invoked by uid 39883); 14 Dec 1998 22:45:39 -0000 Date: Mon, 14 Dec 1998 17:45:39 -0500 (EST) From: F W Lawvere Reply-To: wlawvere@ACSU.Buffalo.EDU To: categories@mta.ca Subject: categories: SECOND ANNOUNCEMENT: SMOOTH CATEGORIES IN GEOMETRY AND MECHANICS Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: O X-Status: SECOND ANNOUNCEMENT Sender: cat-dist@mta.ca Precedence: bulk SMOOTH CATEGORIES IN GEOMETRY AND MECHANICS Special session of AMS Meeting No. 943 in Buffalo, N.Y. April 24/25, 1999 Several active researchers have already agreed to participate. AMS Rules stipulate that those wishing to be considered as speakers on the program should contact me by January 6. Please send a title and a preliminary abstract to wlawvere@acsu.buffalo edu The intended subject of the session includes (a) the application of extensive categories, regular categories, cartesian-closed categories, toposes and the like to differential geometry, functional analysis of smooth functions and differential forms, distributions and currents, the motion and heating of extended bodies, electro-magnetism, ... as well as (b) the formulation and explanation of problems in those fields to which such application would possibly be useful. ******************************************************************************* 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 Tue Dec 15 01:06:06 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id WAA28809 for categories-list; Mon, 14 Dec 1998 22:17:34 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f X-Received: from xena.acsu.buffalo.edu (qmailr@xena.acsu.buffalo.edu [128.205.7.121]) by mailserv.mta.ca (8.8.8/8.8.8) with SMTP id SAA20133 for ; Mon, 14 Dec 1998 18:51:28 -0400 (AST) X-Received: (qmail 15815 invoked by uid 39883); 14 Dec 1998 22:51:27 -0000 Date: Mon, 14 Dec 1998 17:51:26 -0500 (EST) From: F W Lawvere Reply-To: wlawvere@ACSU.Buffalo.EDU To: categories Subject: categories: Preprint available Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: PREPRINT AVAILABLE A transcript of the video of my talk at the September 1997 AMS Meeting in Montreal is now available for downloading in pdf format. The title is TOPOSES OF LAWS OF MOTION I will be very grateful for comments and suggestions on this paper, as well as on the other two papers available: http://www.acsu.buffalo.edu/~wlawvere ******************************************************************************* 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 Tue Dec 15 20:47:45 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id TAA09122 for categories-list; Tue, 15 Dec 1998 19:47:47 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f From: "David B. Benson" Date: Tue, 15 Dec 1998 15:31:54 -0800 Message-Id: <9812152331.AA08574@decserv2> Subject: categories: Inferring colimits Apparently-To: categories@mta.ca Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: Dear category theorists, I have a question to which answers will be most appreciated. To set the stage for the question, consider a category A for which diagrams D':G'-->A and D'':G''-->A have colimits, colim D' and colim D'', respectively. Suppose the sum colim(D')+colim(D'') exists in A. Then the obvious diagram [D',D'']:G'+G''-->A has a colimit, the sum mentioned just above, and irrespective of whether any other sums may exist in A. So from the existence of some colimits, the existence of others may be inferred. Definition: Relative to a base category A, for each collection K of (small) diagrams on A with colimits, the collection of all inferable (small) diagrams with colimits is said to be a <> of K. Example: For every nonempty category C, and every (small) category G with terminal object, every diagram D:G-->C is in the repletion of the empty collection, hence in the repletion of every collection of diagrams on C with colimits. Now for the question. Has there been any systematic study of what I have just defined as repletions? If not, are there in any case some papers I should consider? Thank you very much! Season's Greetings, David Post Script (in the traditional sense): Writers of textbooks in category theory may wish to consider including the following as an exercise -- For all small categories C and all functors F:C-->Sets, the left Kan extension of F along Id:C-->C is (isomorphic to) F. From cat-dist Tue Dec 15 20:52:36 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id TAA31962 for categories-list; Tue, 15 Dec 1998 19:44:52 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f To: categories Subject: categories: Preprint available (Fiore, Plotkin, and Turi). Message-Id: From: Marcelo Fiore Date: Tue, 15 Dec 1998 21:12:32 +0000 Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: The following preprint Abstract Syntax and Variable Binding by M.Fiore, G.Plotkin., and D.Turi. is available as http://www.dcs.ed.ac.uk/~dt/abstractsyn.ps Synopsis: We show that categorical algebra in the object-classifier topos provides a suitable mathematical universe for modelling algebraic structures with binding operators. From cat-dist Wed Dec 16 11:39:27 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id IAA14785 for categories-list; Wed, 16 Dec 1998 08:58:51 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Wed, 16 Dec 1998 12:10:31 +0100 (MET) From: Jaap van Oosten Message-ID: <199812161110.MAA03934@kodder.math.uu.nl> To: categories@mta.ca Subject: categories: paper on SDT available X-Sun-Charset: US-ASCII Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: The following paper is available: Axioms and (Counter)examples in Synthetic Domain Theory by Jaap van Oosten and Alex K. Simpson the paper can be found at the URL: http://www.math.uu.nl/publications/preprints/1080.ps.gz ABSTRACT: Chapter 1 presents a development of basic Synthetic Domain Theory on the basis of 4 axioms (1:\Sigma is complete; 2:\Sigma is \neg\neg-separated; 3:\bot\in\Sigma; 4:the Phoa Principle). New results are, that 1 and 2 imply that the \Sigma-order on \Sigma , I and F (the initial lift algebra and the final lift coalgebra, respectively) is (pointwise) implication, that 1 and 2 imply that complete extensional objects (we call them complete regular \Sigma-posets) are stable under lifting, that under 1,2,3, axiom 4 is equivalent to \Sigma having binary joins, and that if \Sigma is closed under N-idexed joins in \Omega, then all complete objects are stable under lifting. We also present an analysis of when I is an internal colimit of a diagram 0->L(0)->L^2(0)->... Chapters 2,3,4 investigate models. We study models of the axioms in: the Modified realizability topos Mod, the Effective topos Eff, and a particular Grothendieck topos. In Mod, the Scott principle fails and L(2) is not complete. In Eff, we have that the internal colimit of 0->L(0)->L^2(0)->... is complete (whence it is not isomorphic to I), and a general theorem characterizing I for \neg\neg-separated dominances. Finally, in a sheaf topos we have an example where L(2) is complete but L(N) isn't. Jaap van Oosten From cat-dist Wed Dec 16 11:41:10 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id IAA32019 for categories-list; Wed, 16 Dec 1998 08:57:28 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Subject: categories: Re: Inferring colimits Date: Wed, 16 Dec 1998 10:55:59 +0000 (GMT) To: categories@mta.ca In-Reply-To: <9812152331.AA08574@decserv2> from "David B. Benson" at Dec 15, 98 03:31:54 pm X-Mailer: ELM [version 2.4 PL25] MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Message-Id: From: "Dr. P.T. Johnstone" Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: > Now for the question. Has there been any systematic study of what > I have just defined as repletions? If not, are there in any case some papers > I should consider? I think the question as posed by David (relative to a particular category, in which some but not all diagrams of a particular shape may have colimits) is a very hard one. A lot is known about inferring the existence of particular types of colimits, in arbitrary categories, from the existence of other types: see the paper by Albert and Kelly "The closure of a class of colimits" in JPAA 51 (1988), and subsequent references of which Max will no doubt remind us. But when you work in a particular category, there are so many ways of "mutilating" the category by omitting particular objects which are required as the vertices of colimit cones, that I suspect there is almost nothing you can say in general. Incidentally, a similar comment applies to David's paper "Multilinearity of sketches" in TAC 3 (1997): I tried to make this point in my review (MR 98j:18006). Peter Johnstone From cat-dist Thu Dec 17 17:06:45 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id PAA21904 for categories-list; Thu, 17 Dec 1998 15:41:30 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-Id: <2.2f.32.19981217081514.009cc144@dge.insa-tlse.fr> X-Sender: motet@dge.insa-tlse.fr X-Mailer: Windows Eudora Pro Version 2.2f (32) Mime-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Date: Thu, 17 Dec 1998 09:15:14 +0100 To: From: Gilles Motet Subject: categories: EuroPar 99 / Toulouse Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from Quoted-Printable to 8bit by mailserv.mta.ca id EAA23843 Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: Call for papers Euro-Par'99 Toulouse, France August 31 - September 3, 1999 =========== Topic 06: Fault Avoidance and Fault Removal in Real-Time Systems --------- Topic Committee : ----------------- Global chair : Tomasz Szmuc (Computer Science Lab., Inst. of Automatics, St. Staszic Techn. Univ., Krakow, Poland) Vice-chair : Wolfgang Halang (Faculty of Electrical Engineering, FernUniversitaet, Germany) Vice-chair : Janusz Zalewski (Dept. of Electrical and Computer Engineering, Univ. of Central Florida, USA) Local chair : Gilles Motet (Dept. de Genie Electrique et Informatique, INSA, Toulouse, France) Description : ------------- This topic is dedicated to Fault Avoidance and Fault Removal means in Real-Time Systems. Fault Avoidance is concerned with modelling means, development processes and methods, etc., whereas Fault Removal covers models, verification, testing and diagnosis techniques, etc. In the context of Real-Time Systems, temporal parameters are important features of both Fault Avoidance and Fault Removal. It also includes other issues of interest such as the capabilities of the programming languages to avoid faults and to make easier their detections in the real-time applications, their associated implementations (such as predictable scheduling), the impact of hardware, etc. We would like this topic to span from academia to applications and from scientific approaches to well-engineered real-time systems case studies. This topic is not concerned by fault tolerance and dependability evaluation which is covered by Topic 20. Topics of interest include : ---------------------------- development process for real-time applications guidelines to develop dependable real-time software quality management of real-time applications classification of real-time application faults models allowing real-time concepts to be expressed verification of real-time constraints synchronous real-time languages code speed evaluation predictable real-time static or dynamic scheduling Euro-Par conference series : ---------------------------- Euro-Par is the annual European conference on parallel computing. It is dedicated to the promotion and advancement of all aspects of parallel computing. Euro-Par'99 is organized as a day of tutorials, two half-day plenary sessions, and a number of parallel sessions. Paper submission : ------------------ Authors are requested to use the electronic form on the web site to submit their paper to the topic they judge most appropriate. Official Address and Organization: ----------------------------------- For any questions related to Euro-Par'99 please refer to our web site: http://www.enseeiht.fr/europar99/ or e-mail to: europar99@enseeiht.fr. The key dates are: ------------------ - January 31st 1999 : Final Date for Submissions - May 1st 1999 : Acceptances Notified - June 1st 1999 : Final Copy and Author Registration due - June 30th 1999 : Early Registration Deadline - August 1st 1999 : Late Registration Deadline ******************************************************************** * Gilles MOTET tel : +(33/0)5 61 55 98 18 * * DGEI / INSA fax : +(33/0)5 61 55 98 00 * * Complexe Scientifique de Rangueil sec : +(33/0)5 61 55 98 13 * * 31077 Toulouse cedex 4 * * France E-mail : motet@dge.insa-tlse.fr * * * * Pub : Vient de paraître : * * J.-C. Geffroy et G. Motet, "Sûreté de Fonctionnement des * * Systèmes Informatiques", InterEdition/Masson, 1998 * ******************************************************************** From cat-dist Fri Dec 18 15:34:24 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id NAA22242 for categories-list; Fri, 18 Dec 1998 13:38:49 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Fri, 18 Dec 1998 16:07:10 GMT Message-Id: <17322.199812181607@craro.dcs.ed.ac.uk> To: categories@mta.ca Subject: categories: CTCS '99 FIRST CALL FOR PAPERS From: "Martin Hofmann" Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: CATEGORY THEORY AND COMPUTER SCIENCE (CTCS'99) 10-12 SEPTEMBER 1999, EDINBURGH, SCOTLAND FIRST CALL FOR PAPERS CTCS '99 is the 8th conference on Category Theory and Computer Science. The purpose of the conference series is the advancement of the foundations of computing using the tools of category theory. While the emphasis is upon applications of category theory, it is recognized that the area is highly interdisciplinary. Typical topics of interest include but are not limited to category-theoretic aspects of the following: concurrent and distributed systems constructive mathematics declarative programming and term rewriting domain theory and topology linear logic models of computation program logics, data refinement, and specification programming language semantics type theory Previous meetings have been held in Guildford (Surrey), Edinburgh, Manchester, Paris, Amsterdam, Cambridge, and S. Margherita Ligure (Genova). PROGRAMME COMMITTEE J. Adamek TU Braunschweig (Germany) N. Benton Microsoft Research, Cambridge (UK) R. Blute U. Ottawa (Canada) T. Coquand Chalmers (Sweden) M. Escardo LFCS Edinburgh (UK) M. Hasegawa Kyoto Univ. (Japan) M. Hofmann (Chair) LFCS Edinburgh (UK) P. O'Hearn Queen Mary West (UK) D. Pavlovic Kestrel Institute (California) H. Reichel TU Dresden (Germany) G. Rosolini U. Genova (Italy) A. Scedrov U. Penn (Pennsylvania) ORGANISING COMMITTEE S. Abramsky LFCS Edinburgh (UK) P. Dybjer Chalmers U. (Sweden) E. Moggi U. Genova (Italy) A. Pitts U. Cambridge (UK) SUBMISSION PROCEDURE E-mail your contribution as a PostScript file to the programme chair (ctcs99@dcs.ed.ac.uk) to be received by 23 April 1999. Alternatively, you can send 5 hardcopies by air mail to the program chair. Authors with restricted copying facilities may also send a single hardcopy. Please make sure mail submissions arrive before the deadline (submissions postmarked 7 April 1999 will definitely be accepted). We would appreciate an informal notification of intention to submit 2 weeks prior to the deadline. It is anticipated to have at-conference proceedings in the form of a Springer LNCS volume or similar. Details about the publication forum will be given in the 2nd call for papers. IMPORTANT DATES 9 April 1999 Notification of intention to submit 23 April 1999 Submission deadline 4 June 1999 Notification of authors of accepted papers 2 July Deadline for camera ready copies of accepted papers ADDRESS FOR PAPER SUBMISSIONS Martin Hofmann (ctcs99@dcs.ed.ac.uk) Laboratory for Foundations of Computer Science Division of Informatics JCMB, King's Buildings Mayfield Road Edinburgh EH9 3JZ UK LOCAL ORGANISATION Monika Lekuse Laboratory for Foundations of Computer Science Division of Informatics JCMB, King's Buildings Mayfield Road Edinburgh EH9 3JZ UK CONFERENCE E-ADDRESS ctcs99@dcs.ed.ac.uk CONFERENCE HOMEPAGE http://www.dcs.ed.ac.uk/home/ctcs99/ Watch this URL for later versions of this CFP and further information. RELATED EVENT 2nd APPSEM workshop, 6-9 September 1999. From cat-dist Sat Dec 19 05:53:01 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id FAA22617 for categories-list; Sat, 19 Dec 1998 05:02:21 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-Id: <367B04E8.D494981@kestrel.edu> Date: Fri, 18 Dec 1998 17:44:08 -0800 From: Dusko Pavlovic X-Mailer: Mozilla 4.5 [en] (X11; U; SunOS 5.5.1 sun4u) X-Accept-Language: en Mime-Version: 1.0 To: CATEGORIES mailing list Subject: categories: preprint Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: Dear All, As many of you know, December is the season of two column logic/CS related preprints. The title of mine is: Towards semantics of guarded induction and it is at the bottom of the page http://www.kestrel.edu/HTML/people/pavlovic/ Comments **most** welcome, esp. as I am still a bit in the darkness as to how to present some parts. This is still an extended abstract, but a bit more extended and less abstract than the version some of you have seen before. (Thanks again for the questions that helped me improve it!) With the very best wishes, -- Dusko ============================================================================== Towards semantics of guarded induction by Dusko Pavlovic Abstract. We analyze guarded induction, a coalgebraic method for implementing abstract data types with infinite elements (e.g. various dynamic systems, continuous or discrete). It is widely used not just in computation, but also, tacitly, in many basic constructions of differential calculus. However, while syntactic characterisations abound, only the very first steps towards a formal semantics have been made. A language independent analysis was recently initiated, but just special cases were covered so far. In the present paper, we propose a new approach, based on a somewhat unusual combination of monads and polynomial categories. The first result is what appears to be a precise semantic characterisation of guarded operators on arbitrary final coalgebras. From cat-dist Sat Dec 19 21:25:16 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id UAA06422 for categories-list; Sat, 19 Dec 1998 20:32:06 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Subject: categories: PSSL 70: First announcement To: categories@mta.ca Date: Sat, 19 Dec 1998 12:31:52 +0000 (GMT) X-Mailer: ELM [version 2.4 PL25] MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Message-Id: From: "Dr. P.T. Johnstone" Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: PERIPATETIC SEMINAR ON SHEAVES AND LOGIC 70th meeting -- First Announcement The 70th meeting of the PSSL will be held in Cambridge on the weekend of 27-28 February 1999. As usual, we welcome contributed talks on any aspect of category theory, sheaf theory or related areas of logic and computer science. It is planned to make this meeting into a celebration of the 60th birthday of Gavin Wraith, which falls in March 1999. Gavin has been involved with the PSSL since its inception in 1976, and we hope that his many friends will wish to join us in celebrating this occasion. Further details of the arrangements for the meeting, and a registration form, will be sent out in January. Peter Johnstone Martin Hyland Chris Mulvey From cat-dist Thu Dec 24 15:38:43 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id OAA01021 for categories-list; Thu, 24 Dec 1998 14:31:30 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Tue, 22 Dec 1998 11:36:02 +0000 (GMT) From: Anne Heyworth X-Sender: map130@publix To: categories@mta.ca Subject: categories: thesis (involving rewriting and Kan extensions) In-Reply-To: <17322.199812181607@craro.dcs.ed.ac.uk> Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: New PhD thesis to be found at: http://xxx.lanl.gov/abs/math.CT/9812097 Summary of details: Title: Applications of Rewriting Systems and Groebner Bases to Computing Kan Extensions and Identities Among Relations. Authors: Anne Heyworth (University of Wales, Bangor). Comments: PhD thesis, 104 pages, LaTeX2e. Report-no: University of Wales, Bangor preprint number 98-23. Subj-class: Category Theory; Combinatorics. MSC-class: 18-04 (Primary) 05-02; 20F05; 68Q42; 68Q40; 16S15 (Secondary). \\ This thesis concentrates on the development and application of Groebner bases methods to a range of combinatorial problems (involving groups, semigroups, categories, category actions, algebras and K-categories). Chapter Two contains the generalisation of rewriting and Knuth-Bendix procedures to Kan extensions. Chapter Three shows that the standard Knuth-Bendix algorithm is step-for-step a special case of the Buchberger's algorithm for noncommutative Groebner bases. The one-sided cases and higher dimensions are considered, and the relations between these are made precise. Chapter Four relates rewrite systems, Groebner bases and automata. Reduction machines for rewrite systems are identified with standard output automata and the reduction machines devised for algebras are expressed as Petri-nets. Chapter Five introduces logged rewriting for group presentations. The completion of a logged rewriting system for a group determines a partial contracting homotopy which enables the computation of a set of generators for the module of identities among relations using the covering groupoid methods devised by Brown and Razak Sallah. Reducing the resulting set of submodule generators is identified as a Groebner basis problem. -- Anne Heyworth. From cat-dist Thu Dec 24 16:29:25 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id OAA32736 for categories-list; Thu, 24 Dec 1998 14:37:31 -0400 (AST) X-Authentication-Warning: triples.math.mcgill.ca: rags owned process doing -bs Date: Wed, 23 Dec 1998 19:09:25 -0500 (EST) From: "R.A.G. Seely" To: Categories List Subject: categories: Reminder: Call for Papers, Lambekfest Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: A reminder note, and best wishes for the holidays. LAMBEK FESTSCHRIFT - CALL FOR PAPERS The (electronic) journal "Theory and Applications of Categories" has agreed to publish a special volume in honour of the work of our colleague Joachim Lambek, in celebration of his 75th birthday, which was marked by a symposium at McGill on his actual birthday last December 5th, 1997. We welcome submissions to this volume from anyone interested. All papers submitted will undergo the usual TAC referee process, and we are hopeful that the final volume will be ready before summer 1999. (For the TAC home page, see ). Topics suitable for the volume include any of the subjects to which Jim Lambek has contributed which fall roughly within the scope of TAC. For example, categorical algebra, categorical logic and proof theory, mathematical linguistics, algebra and ring theory (preferably with some categorical application or methodology), categorical computer science, etc. We would like to note that a companion volume is also being prepared by the journal "Mathematical Structures in Computer Science" - there may still be room for a very small number of short-to-moderate-length papers to be included in that volume. If you wish your submission to be considered for that, please indicate this when you submit your paper to us. (Of course, MSCS's emphasis is more towards computer science). The submission deadline for the Lambek Fest volume is 30 January, 1999. Please send a postscript file (uuencoded and compressed, if possible) to rags@math.mcgill.ca, or 3 paper copies to R.A.G. Seely Department of Mathematics McGill University 805 Sherbrooke St W Montreal, Quebec Canada, H3A 2K6 (If possible) please send an email message to rags@math.mcgill.ca indicating the title (and authors, if other than the sender of the email) of the paper, as well as an abstract (in standard ascii format, maximum 1 page) of the paper. A technical point: TAC can only accept files prepared with some "flavour" of TeX or LaTeX - most authors ought to be able to arrange for such a file to be prepared from their paper, but if you have problems, let us know and we shall see if we can provide helpful advice. General advice for preparation of papers, including suitable macros, may be found at the TAC home page, . The Editors: Michael Barr (e-mail: barr@math.mcgill.ca) Philip Scott (e-mail: phil@csi.uottawa.ca) Robert Seely (e-mail: rags@math.mcgill.ca) A copy of this CFP may be found on the CTRC (Montreal category group) home page . ================================= From cat-dist Tue Dec 29 01:22:11 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id AAA11788 for categories-list; Tue, 29 Dec 1998 00:05:45 -0400 (AST) X-Authentication-Warning: triples.math.mcgill.ca: rags owned process doing -bs Date: Mon, 28 Dec 1998 11:32:17 -0500 (EST) From: "R.A.G. Seely" To: Categories List Subject: categories: Mail to McGill not functionning Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: It may be of relevance to some on this list to know that for the past week, the main machine in the maths dept at McGill has not been functionning, and so, as a consequence, mail sent to "user@math.mcgill.ca" will not have been received. Triples *is* functionning, so although usually the generic address as above is preferred, you might try cc'ing any mail you have sent to "user@triples.math.mcgill.ca" - for those of us that still use triples, this will get through. We'll let you know when things are back to normal - this has been delayed by the holidays, of course. = rags = PS - The categories home page is still functionning, which has information about the Lambekfest (call for papers), the Barrfest (table of contents), and current seminars. Links on that page to members' home pages may not function, if they are links to the main departmental machine, however. (You'll get the idea from my (revised) sig below...) ================================= (currently not functionnal) (still OK) (currently not functionnal) (still OK) From cat-dist Thu Dec 31 11:31:37 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id KAA19754 for categories-list; Thu, 31 Dec 1998 10:21:23 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Mon, 21 Dec 1998 09:52:30 +0100 (MET) From: sjouke@win.tue.nl (Sjouke Mauw) Message-Id: <199812210852.JAA23138@wsinfm12.win.tue.nl> To: categories@mta.ca Subject: categories: CONCUR'99 CFP Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: CALL FOR PAPERS CONCUR'99 10th International Conference on Concurrency Theory Eindhoven, The Netherlands, August 24--27, 1999. URL http://www.win.tue.nl/concur99/ E-mail concur99@win.tue.nl (apologies for multiple copies) A postscript version of this call for papers can be found on the above mentioned website. SCOPE The purpose of the CONCUR conferences is to bring together researchers, developers and students in order to advance the theory of concurrency, and promote its applications. Interest in this topic is continuously growing, as a consequence of the importance and ubiquity of concurrent systems and their applications, and of the scientific relevance of their foundations. Submissions are solicited in all areas of semantics, logics and verification techniques for concurrent systems. Topics include (but are not limited to) concurrency related aspects of: models of computation and semantic domains, process algebras, Petri nets, event structures, real-time systems, hybrid systems, decidability, model-checking, verification techniques, refinement techniques, term and graph rewriting, distributed programming, logic constraint programming, object-oriented programming, typing systems and algorithms, case studies, tools and environments for programming and verification. PROGRAMME COMMITTEE Ralph Back (SF), Jos Baeten (NL, co-chair), Jan Bergstra (NL), Manfred Broy (D), Rocco De Nicola (I), Andrew Gordon (UK), Roberto Gorrieri (I), Tom Henzinger (USA), Bengt Jonsson (S), Maciej Koutny (UK), Nancy Lynch (USA), Sjouke Mauw (NL, co-chair), Arend Rensink (NL), Philippe Schnoebelen (F), Robert de Simone (F), P.S. Thiagarajan (IN), David Walker (UK), Glynn Winskel (DK). ORGANISATION Jan Friso Groote (NL, chair) TUTORIALS Kees Middelburg (NL) TOOL DEMONSTRATIONS Dragan Bosnacki (NL) INVITED SPEAKERS Rance Cleaveland (USA), Javier Esparza (D), Rob van Glabbeek (USA), Catuscia Palamidessi (USA). SUBMISSIONS Submissions will be evaluated by the Programme Committee for inclusion in the proceedings, which will be published by Springer-Verlag. Papers must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. Papers (of at most 15 pages, accompanied by a one-page abstract) should preferably be submitted electronically as uuencoded PostScript files at the address given below. The mailing addresses (both postal and electronic), telephone number and fax number (if available) of the author to whom correspondence should be sent should be clearly indicated. In case of hardcopy submissions, send five copies to the address below. CALL FOR SATELLITES The CONCUR'99 conference will host several satellite workshops, which will take place on August 23 and August 28. Proposals for satellites are solicited, which should contain a brief description of the scope and organization of the workshop. CALL FOR TOOL DEMONSTRATIONS During the conference there is the possibility to demonstrate tools which are clearly connected to the topics of the conference. Proposals for such tool demonstrations should take the form of a tool description not exceeding 4 pages. The necessary hardware and software resources for installation and demonstration of the tool should be specified. IMPORTANT DATES Deadline for submission: 26 February 1999 Notification of acceptance: 16 April 1999 Final version due: 19 May 1999 Satellite proposals: 8 January 1999 Tool demo proposals: 4 June 1999 ADDRESSES S. Mauw, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands. URL http://www.win.tue.nl/concur99/ E-mail concur99@win.tue.nl From cat-dist Thu Dec 31 11:32:04 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id KAA24269 for categories-list; Thu, 31 Dec 1998 10:32:20 -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: Mon, 21 Dec 1998 17:52:50 GMT Message-Id: <20456.199812211752@magpie> To: categories@mta.ca Subject: categories: PhD in Informatics (AI, CS, CogSci) at Edinburgh Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: PhD degrees in the Division of Informatics at the University of Edinburgh In 1998, the University of Edinburgh established a Division of Informatics, to study the structure, behaviour and interactions of both natural and artificial computational systems. The Division reflects the University's vision of Informatics as a fundamental area of study, critical for the future developments in science, engineering, and society. The Division was formed from the former Departments of Artificial Intelligence, Cognitive Science and Computer Science. The Division has positions for new research degree students pursing either an MSc(Research) (one year), an MPhil (two years) or a PhD (three years) through investigation of open problems in Informatics. The Division now contains over 75 academic staff and about 100 research students, grouped primarily into these research institutes: Artificial Intelligence Applications Institute Institute of Computing System Architecture Institute for Adaptive and Neural Computation Institute for Communicating and Collaborative Systems Institute of Perception, Action and Behaviour Institute for Representation and Reasoning Laboratory for Foundations of Computer Science which reflect the main research themes in the Division: adaptive computing artificial intelligence automated and mathematical reasoning category and type theory cognitive science computational complexity computational learning theory computational linguistics and natural language processing computational musicology computer and network architectures computer communications and networks computer graphics and virtual reality computer science computer vision database systems design and analysis of dependable systems diagramatic understanding distributed systems formal program specification human-computer interaction intelligent tutoring systems knowledge representation and reasoning knowledge-based systems medical informatics mobile and assembly robotics neural modelling neural networks parallel, distributed and concurrent systems planning and activity management programming languages qualitative and fuzzy reasoning software engineering speech understanding and generation system level design and integration The UK Engineering and Physical Science Research Council has awarded the Division a number of full studentships that can be used by UK and EC students. Overseas students may be eligible for ORS awards, that pay approximately half of the total costs. In general, students should have a good BS/BSc degree (or equivalent) in an appropriate topic, plus other skills appropriate to the particular research area. More information can be found on the Division's PhD WWW page at: http://www.inf.ed.ac.uk/www/public/Courses/ For application forms and further information, write to: PhD Admissions Secretary Division of Informatics University of Edinburgh James Clerk Maxwell Building King's Buildings Mayfield Road Edinburgh EH9 3JZ Email: phd-admissions@inf.ed.ac.uk Fax: +44 131 667 7209 Telephone: +44 131 650 5156 **************** ALSO: MSc Positions Available **************** We also have three thriving taught MSc courses. For more information, see: http://www.inf.ed.ac.uk/www/public/Courses/ From cat-dist Thu Dec 31 11:32:12 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id KAA22979 for categories-list; Thu, 31 Dec 1998 10:31:45 -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: Mon, 21 Dec 1998 17:23:50 GMT Message-Id: <20216.199812211723@magpie> To: categories@mta.ca Subject: categories: MSc in Informatics (AI, CS, CgSci) at Edinburgh Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: Master of Science degrees in the Division of Informatics at the University of Edinburgh The Division of Informatics offers three 1 year courses in different topics in Informatics: 1. MSc in Artificial Intelligence, whose primary focus is on development and understanding of intelligent computational processes for the benefit of both creating useful artifacts and helping better understand intelligence (human or otherwise). The course contains five themes: Foundations of AI, Intelligent Robotics, Knowledge-based Systems, Natural Language Processing, and Non-Symbolic AI. 2. MSc in Cognitive Science and Natural Language. This MSc is concerned with computational, formal and experimental approaches to understanding cognition and natural language. In Cognitive Science, the disciplines of formal linguistics, psychology, neuroscience and philosophy are brought together in different kinds of computational frameworks. This MSc is particularly concerned with how language is represented and processed. 3. The MSc in Computer Science contains three themes. The Advanced Computer Systems theme embraces the theory and practice of designing programmable systems. The Systems Level Integration theme teaches the principles underlying the design of integrated software and hardware systems in silicon. The Theoretical Computer Science theme introduces students to core areas of theoretical Computer Science and to the technologies through which theory-based tools are implemented. From October to April students attend taught modules. During the period May - September inclusive, each student undertakes a major practical project under the supervision of a member of academic staff. The projects can involve industrial collaboration and may be proposed by the student. These courses have been approved by the UK Engineering and Physical Science Research Council for the tenure of Advanced Course Studentships. In general, students should have a good BS/BSc degree (or equivalent) in an appropriate topic, plus other skills approporate to the particular MSc course. More information can be found on the Division's MSc WWW page at: http://www.inf.ed.ac.uk/www/public/Courses/ For further information, write to: MSc Admissions Secretary Division of Informatics University of Edinburgh 5 Forrest Hill Edinburgh, EH1 2QL Scotland, UK Fax: +44-(131)-650-6899 Telephone: +44-(131)-650-3904 Email: msc-admissions@inf.ed.ac.uk **************** ALSO: PhD Positions Available **************** We also have a thriving PhD course. For more information, see: http://www.inf.ed.ac.uk/www/public/Courses/ From cat-dist Thu Dec 31 11:32:24 1998 Received: (from Majordom@localhost) by mailserv.mta.ca (8.8.8/8.8.8) id KAA09390 for categories-list; Thu, 31 Dec 1998 10:31:13 -0400 (AST) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-Id: <2.2.32.19981221170352.0087de84@163.10.5.24> X-Sender: gbaum@163.10.5.24 X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Date: Mon, 21 Dec 1998 14:03:52 -0300 To: categories@mta.ca From: Gabriel Baum Subject: categories: WAIT99 - Preliminary Call for Papers Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from quoted-printable to 8bit by mailserv.mta.ca id MAA30284 Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: Preliminary Call for Papers 28 JAIIO - WAIT'99 Argentinian Workshop on Theoretical Computer Science Buenos Aires - Argentina September 6-7, 1999 The 3rd Argentinian Workshop on Theoretical Computer Science (WAIT'99) will be part on the 28th Argentinean Conference on Informatics and Operations Research (28 JAIIO), to be held in Buenos Aires from September 6th to September 10th, 1999. The goal of the workshop is bringing together researchers from academy (from Argentinean and other universities) and industry professionals in order to discuss theoretical, empirical and experimental results on the field of theoretical computer science. This workshop will consist of invited talks and technical presentations. Contributions are expected in all the areas of theoretical computer science, including the following: * Logical and algebraic foundations for computer science (logics for computer science, category theory, relation algebras, type theory, etc.), * Formal program construction (formal specification of sequential and concurrent programs; analysis, verification and transformation of programs, etc.), * Algorithms and data structures (sequential, parallel, distributed, on-line, probabilistic, etc.), * Computational complexity, * Automata theory, * Graph theory, * Symbolic and algebraic computation. The expected contributions will describe original results as well as undergoing research and development projects on theoretical computer science coming from academy and industry. Papers will be refereed by the International Program Committee, based on the following: * Papers reporting research / experimental results: these papers must present previously unpublished results and will be judged based on their originality, significance, relevance and clarity of presentation. Authors must submit an extended abstract of up to 4 pages containing enough information to allow the referees to determine the merits of their work. It is also allowed to submit the full paper of up to 12 pages including figures and references. * Research projects: aiming to fostering the cooperation among national and foreign researchers, short papers describing ongoing research will be considered. Papers in this category may report already published results. In that case, the authors must include the corresponding references. * Industrial / Commercial applications: also relevant are papers describing applications of theoretical results to real-life situations. Short papers describing results that are both of significance for industry and that make novel or defying applications of theoretical results are sought. INSTRUCTIONS FOR AUTHORS: In order to facilitate the widest dissemination of the papers, authors are recommended the use of the English language. Nevertheless, papers in Spanish or Portuguese are also welcome. The deadline for submission of papers is May 3rd, 1999. Papers must be submitted electronically in PostScript format (ghostview-readable) to the e-mail address: wait99@sol.info.unlp.edu.ar Authors must send in a separate message in ASCII format the following: title of the paper, name and affiliation of all the authors, their e-mail addresses, phone and FAX numbers, an abstract of their contribution of at most ten lines, a list of keywords that best describe the paper, and also the category within which the paper is to be evaluated. Alternative ways for paper submission are possible and must be discussed with the workshop co-chairs. The format for camera-ready papers will be announced with the letter of acceptance. IMPORTANT DATES: Deadline for reception of papers....................May 3rd, 1999 Notification of acceptance..........................June 15th, 1999 Deadline for reception of camera-ready versions.....July 16th, 1999 WORKSHOP CO-CHAIRS: Prof. Gabriel Baum LIFIA Dto. de Informatica Universidad Nacional de La Plata Calle 50 y 115 1er piso. (1900) La Plata - Argentina Tel/Fax : +54-21-22-8252 e-mail: gbaum@sol.info.unlp.edu.ar Prof. Marcelo Frias Dpto. De Computacion -FCEyN- Universidad de Buenos Aires Pabellon I - Ciudad Universitaria 1428- Buenos Aires - ARGENTINA Tel/Fax : +54-1-783-0729 e-mail: mfrias@sol.info.unlp.edu.ar PRELIMINARY PROGRAM COMMITTEE: Gabriel Baum (Universidad Nacional de La Plata, Argentina) Javier Blanco (Universidad Nacional de Cordoba, Argentina) Luis Fariñas del Cerro (Universite Paul Sabatier, France) Esteban Feuerstein (Universidad Nacional de Buenos Aires and Universidad Nacional de General Sarmiento, Argentina) Marcelo Frias (Universidad Nacional de Buenos Aires, Argentina) Armando Haeberer (Pontificia Universidade Catolica de Rio de Janeiro, Brazil) Edward Hermann Haeusler (Pontificia Universidade Catolica de Rio de Janeiro, Brazil) Joos Heintz (Universidad Nacional de Buenos Aires, Argentina) Roger Maddux (Iowa State University, USA) Tom Maibaum (Imperial College, UK) Bernhard Moeller (Universitaet Augsburg, Germany) Gonzalo Navarro (Universidad de Chile, Chile) Alfredo Olivero (Universidad Nacional de Buenos Aires and Universidad Nacional de General Sarmiento, Argentina) Ruy de Queiroz (Universidade Federal de Pernambuco, Brazil) Alvaro Tasistro (Universidad de la Republica, Uruguay) Sergio Yovine (CNRS-VERIMAG, France) For more information send e-mail to: jaiio@sadio.edu.ar, write to: SADIO / WAIT'99 Uruguay 252 2D 1015 - Buenos Aires ARGENTINA TEL: +54-1-3715755/4763950 FAX: +54-1-3723950 or see http://www.uba.ar/wwws/sadio ___________________________________________ Gabriel Baum LIFIA Facultad de Ciencias Exactas Universidad Nacional de La Plata Calle 50 y 115 - 1er piso (1900) La Plata e-mail: gbaum@sol.info.unlp.edu.ar Tel/Fax: +54 21 228252 ___________________________________________