From cat-dist Fri Oct 1 19:01:38 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id RAA24105 for categories-list; Fri, 1 Oct 1999 17:34:31 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-ID: <37F4FDAE.228E804D@dcs.ed.ac.uk> Date: Fri, 01 Oct 1999 18:30:06 +0000 From: Fabio Gadducci Organization: Division of Informatics, The University of Edinburgh X-Mailer: Mozilla 4.61 [en] (X11; I; Linux 2.0.35 i686) X-Accept-Language: en MIME-Version: 1.0 To: Categories List Subject: categories: paper announcement Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: Dear members of the mailing list, I'm pleased to annouce that the paper ``Rewriting on Cyclic Structures'', by myself and Andrea Corradini, is available at http://www.di.unipi.it/~gadducci/papers/RAIRO.ps. The abstract follows, but shortly, it uses traced monoidal 2-categories --where, in addition, each object ha`s a comonoidal structure-- in order to simulate various kinds of (eventually cyclic) term (graph) rewriting. Its interest for a broader audience may lie, besides in showing a practical application of the trace structure in the rewriting field, in its appendix, where we tried to sketch a very SHORT history of the notion of feedback in theoretical computer science, with a particular attention to the algebraic specification field. We found it interesting to review previous approaches to the topic, after the results of Joyal-Street-Verity have newly sparkled the interest in the algebraic description of fixed points (see e.g. the recent paper by Selinger advertised a few weeks ago on this mailing list). Best regards, Fabio Gadducci xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx \begin{abstract} We present a categorical formulation of the rewriting of possibly cyclic term graphs, based on a variation of algebraic 2-theories. We show that this presentation is equivalent to the well-accepted operational definition proposed by Barendregt et alii---but for the case of ``circular redexes'', for which we propose (and justify formally) a different treatment. The categorical framework allows us to model in a concise way also automatic garbage collection and rules for sharing/unsharing and folding/unfolding of structures, and to relate term graph rewriting to other rewriting formalisms. \end{abstract} From cat-dist Mon Oct 4 18:44:05 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id QAA02506 for categories-list; Mon, 4 Oct 1999 16:01:35 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f To: categories@mta.ca From: Lars Birkedal Subject: categories: Cfp: Realizability Semantics and Applications (MSCS special issue) Date: Mon, 04 Oct 1999 13:04:13 -0400 Message-ID: <3639.939056653@unbox.fox.cs.cmu.edu> Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: Call for Papers Special Issue of Mathematical Structures in Computer Science (MSCS) on Realizability Semantics and Applications Editors: L. Birkedal, J. van Oosten, G. Rosolini, D.S. Scott There has been recently a reawaking of interest in many aspects of realizability interpretations -- especially as regards semantics of type theories for constructive reasoning and semantics of programming languages. But, the details of realizability can be quite technical, and therefore a tutorial workshop on realizability and appliations was held in June/July 1999 in Trento, Italy. The workshop contained both tutorial lectures and also contributed research talks, see http://www.cs.cmu.edu/afs/cs/user/birkedal/www/realizability-workshop/ for an overview. A special issue of the journal Mathematical Structures in Computer Science (MSCS) will be devoted to papers on realizability semantics and applications. The volume will contain the tutorial presentations given by invited speakers at the realizability workshop in Trento. We now also solicit contributions of research papers on realizability and applications for the special MSCS volume. Everyone is invited to contribute a paper (i.e., not only researchers who contributed a paper to the realizability workshop). Papers will be refereed to the usual high standards of MSCS. Instruction to Authors Authors are invited to submit full original research papers. Papers should be submitted via email to wr99@athena.disi.unige.it as a postscript file, or by mailing a hard copy to Lars Birkedal School of Computer Science Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213, USA before January 1, 2000. Important Dates Submission Deadline: January 1, 2000. From cat-dist Wed Oct 6 13:05:43 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id LAA17319 for categories-list; Wed, 6 Oct 1999 11:29:49 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-Id: Date: Wed, 6 Oct 1999 14:57:53 +0100 (BST) From: "Roy L. Crole" To: categories@mta.ca Subject: categories: Chair in Computer Science 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: Dear Colleagues, Please find below an advertisement for a UK Chair in Computer Science. Three lectureships will follow immediately after the appoinment is made, allowing for a new group to be formed. I am sending this message to categories and types, whose members may be interested in applying: the Department is joint with Mathematics, and the areas of category theory, type theory, logic and theorem proving are all represented at Leicester. Thanks for your help, Roy Crole. ********** UNIVERSITY OF LEICESTER DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE CHAIR IN COMPUTER SCIENCE Applications are invited for a Chair in Computer Science in the Department of Mathematics and Computer Science. The appointment will commence on a date to be agreed. This is a new Chair and the aim is to strengthen research in Computer Science in an area complementary to existing ones. Nevertheless, applications are welcomed from individuals with an outstanding research record in any area of Computer Science. Subsequent to this appointment, three new Lectureships in Computer Science will be advertised and the appointee should expect to play a major role in filling these positions. This is a superb opportunity for a person of drive and enthusiasm to create a significant research group in a leading university. Candidates who are interested in the Chair are invited to contact the Head of Department, Professor Iain Stewart (telephone 0116 2523885, e-mail ias4@mcs.le.ac.uk) or the Deputy Head of Department, Professor Rick Thomas (telephone 0116 2523411, e-mail rmt@mcs.le.ac.uk), either of whom would be pleased to discuss the position further. Candidates are invited to consult the Department's web pages at http://www.mcs.le.ac.uk where they will also find the Further Particulars (within which are details of how applicants should apply). From cat-dist Wed Oct 6 13:07:06 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id LAA12957 for categories-list; Wed, 6 Oct 1999 11:23:57 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f From: S.J.Vickers@open.ac.uk Message-ID: To: categories@mta.ca Subject: categories: Steve Vickers has moved Date: Tue, 5 Oct 1999 12:20:01 +0100 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2448.0) Content-Type: text/plain; charset="iso-8859-1" Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: I have now moved from Imperial College to the Pure Maths Department at the Open University, England. email: s.j.vickers@open.ac.uk web: http://mcs.open.ac.uk/sjv22/ All visitors welcome! The Open University is at Milton Keynes, half way between London and Birmingham and well served by trains. Steve Vickers. From cat-dist Wed Oct 6 16:00:56 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id OAA28266 for categories-list; Wed, 6 Oct 1999 14:17:28 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-Id: To: categories@mta.ca Subject: categories: PhD position Mime-Version: 1.0 (generated by tm-edit 7.108) Content-Type: text/plain; charset=US-ASCII Date: Wed, 06 Oct 1999 16:08:58 +0200 From: N Ghani Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: University of Leicester, Great Britain Announcement of PhD Studentship in Categorical Rewriting A PhD student is sought for three years from January 2000 to work under the supervision of Dr Neil Ghani on a UK EPSRC-funded project ``Categorical Rewriting'' A brief description of the project is included below. Further details can be obtained by emailing Dr Ghani at ng13@mcs.le.ac.uk Project Description ------------------- Term Rewriting Systems (TRSs) are widely used throughout computer science as they form an abstract model of computation while retaining a relatively simple and concrete syntax. However, this concreteness has led to a tendency to concentrate on the technical details of specific problems to the detriment of a wider understanding of the subject. This project aims to address this problem by developing a categorical semantics for rewriting. The project builds on recent work by Dr Ghani which showed that TRSs can be regarded as generalised algebraic theories and consequently that TRSs can be modelled as enriched monads. We want to extend this reasearch in a number of directions, eg the development of the semantics to cover more complex notions of rewriting and the application of our research to open problems in rewriting. From cat-dist Thu Oct 7 23:26:44 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id WAA32070 for categories-list; Thu, 7 Oct 1999 22:19:37 -0300 (ADT) X-Authentication-Warning: triples.math.mcgill.ca: rags owned process doing -bs Date: Thu, 7 Oct 1999 20:35:59 -0400 (EDT) From: "R.A.G. Seely" To: Categories List Subject: categories: Octoberfest - Categories in Montreal (2nd notice) Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: ----------------------------------------------------------------------------- Category Theory OctoberFest McGill University, Montreal Saturday - Sunday, October 16 - 17, 1999 ----------------------------------------------------------------------------- This is the second notice for the Category Theory weekend meeting in Montreal October 16 - 17 (next weekend). At this time, we would like some firm estimate of numbers, so we can plan the Saturday evening party - if you have not already sent me a message to indicate your participation, please let me know, preferably before Tuesday October 12th, if you are planning to attend. (Email rags@math.mcgill.ca) We have a provisional list of talks, (appended below) and a provisional schedule will appear soon on the Octoberfest99 web page: www.math.mcgill.ca/triples/octoberfest99.html Hotel and weather information, as well as a local map, may also be found on that web page. There will be a registration charge of $CAN 40 ($CAN 20 for students) ($US 30, 15 respectively). Canadian cash will be most convenient! Registration will take place during the pauses before and between lectures, Saturday morning. All mathematical activities will take place in the Bronfman Building, 1001 Sherbrooke West. We start with coffee and registration at 8:30 am Saturday, with the first talk at 9:00 am. For further information, try the web page above, or email me (rags@math.mcgill.ca). See you Saturday, Oct 16th. ================================== Provisional list of speakers ---------------------------- *Marta Bunge On a question of Johnstone about cartesian monads *Carsten Butz The filter construction and saturated models of Heyting arithmetic. *Robin Cockett Full completeness in commutative monoid enriched categories *Sjoerd Crans Teisi in _Ab_ *Jack Duskin On the equivalence of bigroupoids and 2-dimensional hypergroupoids *Esfandiar Haghverdi Geometry of Proofs and Full Completeness *Hongde Hu Total graphs coloring *Yoshiki Kinoshita Lax logical relations for computational lambda calculus *Jim Lambek Polycategories revisited *Mihaly Makkai The multitopic omega-category of all multitopic omega-categories *Paddy McCrudden Opmonoidal monads *Susan Niefield TBA *Jim Otto Resolution rewritings as cospans of cospans *Dusko Pavlovic Minimal (Dedekind-MacChu) bicompletion of a category *Bob Rosebrugh (Sunday "demo") A graphical database for category theory *Luigi Santocanale Free $\mu$-lattices *Josef Slapal Convergence structures for categories *Noson Yanofsky The Syntax of Coherence ================================= R.A.G. Seely Category Group Home Page: From cat-dist Tue Oct 12 13:50:53 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id LAA29644 for categories-list; Tue, 12 Oct 1999 11:36:31 -0300 (ADT) 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: Tue, 12 Oct 1999 14:18:48 +0100 To: categories@mta.ca From: kock Subject: categories: preprint available Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: The preprint Algebra of Principal Fibre Bundles, and Connections is available at ftp://ftp.imf.au.dk/pub/kock/princ4.ps (102 kb). The classical relationship between the curvature of a connection, and the coboundary of its connection form, here comes about from a pure groupoid calculation. The preprint updates and expands my 1983/1986 paper, "Combinatorial notions relating to principal fibre bundles". Anders Kock http://www.imf.au.dk/~kock/ From cat-dist Wed Oct 13 12:58:37 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id LAA25282 for categories-list; Wed, 13 Oct 1999 11:19:43 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Wed, 13 Oct 1999 00:33:42 -0400 From: "Robert A.G. Seely" Message-Id: <199910130433.AAA06839@triples.math.mcgill.ca> To: categories@triples.math.mcgill.ca Subject: categories: LambekFestSchrift table of contents Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: The LambekFestschrift: Special issues of MSCS and TAC in honour of Joachim Lambek's 75th birthday The following papers will appear in the Lambekfest issue of Mathematical Structures in Computer Science * Borisavljevic, Dosen, & Petric: "On permuting cut with contraction" * Bunge & Fiore : "Unique Factorisation Lifting Functors and Categories of Processes" * Cockett, Koslowski, & Seely: "Introduction to Linear Bicategories" * Haghverdi: "Unique Decomposition Categories, Geometry of Interaction and Combinatory Logic" * Hamano: "Pontrjagin Duality and a Full Completeness of Multiplicative Linear Logic Without the Mix Rule" * Ruet: "Non-commutative logic II: sequent calculus and phase semantics" * Seldin: "On Lists in the Calculus of Constructions" The following papers will appear in the Lambekfest issue of Theory and Applications of Categories (Vol 6) * Barr: "*-autonomous categories: once more around the track" * Betti: "Bicategory approach to static modules" * Hines: "The categorical theory of self-similarity" * Okada & Scott: "A note on rewriting theory for uniqueness of iteration" * Pare: "Contravariant functors on finite sets and Stirling numbers" * Pedicchio & Rosicky: "Comparing coequalizer and exact completions" * Power: "Enriched Lawvere theories" * Raphael: "Some Regular Epimorphic Contexts" * Schneck: "Natural deduction and coherence for non-symmetric linearly distributive categories" >From the Introduction: As friends, colleagues, and students of Jim's for many years, we are pleased to be able to present to him this collection of papers, whose span covers much (unfortunately not all) of the territory Jim's own work has influenced so profoundly. We join the authors of these papers in wishing him well, and hoping to derive further inspiration from his research for many years to come. The Editors: M. Barr, P.J. Scott, R.A.G. Seely From cat-dist Wed Oct 13 13:36:53 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id LAA05533 for categories-list; Wed, 13 Oct 1999 11:56:11 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-ID: <19991012221042.A6704@seide.di.uminho.pt> Date: Tue, 12 Oct 1999 22:10:42 +0100 From: "Jose N. Oliveira" To: categories@mta.ca Subject: categories: MPC2000: 5th Int. Conf. on Mathematics of Program Construction - CFP Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Mailer: Mutt 0.93.2 Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: [ Apologies if you receive this more than once ] CALL FOR PAPERS MPC 2000 5th International Conference on MATHEMATICS OF PROGRAM CONSTRUCTION ----------------------------------- http://www.di.uminho.pt/mpc2000 3--5 July, 2000 Ponte de Lima, Portugal This conference aims to promote the development of mathematical principles and techniques that are demonstrably useful and usable in the process of constructing computer programs (whether implemented in hardware or software). The focus of the conference is on techniques that combine precision with concision, enabling programs to be constructed by formal calculation. Within this theme, the scope of the conference is very diverse. We welcome contributions to programming methodology (for example, formal methods for program specification and transformation), to programming paradigms (for example, generic programming techniques and type systems) and to language design (for example, programming calculi and programming language semantics). Theoretical contributions are welcome provided their relevance to program construction is evident; discussion of applications is welcome provided the mathematical basis is evident. A number of workshops will be organised in conjunction with the conference. IMPORTANT DATES Deadline for submission of papers: 3rd January, 2000 Notification of acceptance/rejection: 29th February, 2000 Final papers due: 17th April, 2000 Full papers should be submitted in Postscript format by e-mail to reach Jose Oliveira by 3rd January, 2000. PROCEEDINGS The conference proceedings will be published by Springer Verlag. Authors of selected papers will be invited to submit a suitably revised and/or extended paper for inclusion in a special issue of Science of Computer Programming. INVITED SPEAKERS Cliff Jones (Newcastle, UK) Jan Rutten (CWI, The Netherlands) Mark Jones (Oregon, USA) PROGRAMME COMMITTEE Roland Backhouse (cochair, UK) Richard Bird (UK) Eerke Boiten (UK) Dave Carrington (Australia) Jules Desharnais (Canada) Jose Fiadeiro (Portugal) Jeremy Gibbons (UK) Lindsay Groves (New Zealand) Zhenjiang Hu (Japan) John Hughes (Sweden) Johan Jeuring (The Netherlands) Burghard von Karger (Germany) Dick Kieburtz (USA) Carlos Kloos (Spain) K. Rustan M. Leino (USA) Christian Lengauer (Germany) Lambert Meertens (The Netherlands) Sigurd Meldal (Norway) Eugenio Moggi (Italy) Bernhard Moeller (Germany) Oege de Moor (UK) Dave Naumann (USA) Jose Oliveira (cochair, Portugal) Kaisa Sere (Finland) Mark Utting (New Zealand) Phil Wadler (USA) FURTHER INFORMATION Please refer to the web page for further details. http://www.di.uminho.pt/mpc2000 Alternatively, email: mpc2000@di.uminho.pt or contact a member of the programme committee. From cat-dist Thu Oct 14 16:04:35 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id NAA28543 for categories-list; Thu, 14 Oct 1999 13:54:37 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Thu, 14 Oct 1999 13:16:38 +0200 (MET DST) X-Sender: gran@mail.math.ucl.ac.be Message-Id: Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" X-Mailer: Eudora F1.5.3 To: categories@mta.ca From: gran@agel.ucl.ac.be (Marino Gran) Subject: categories: 71st PSSL Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: PERIPATETIC SEMINAR ON SHEAVES AND LOGIC 71st meeting -- 16/17 October -- Louvain-la-Neuve Programme Saturday 09.30 Jean Benabou (Paris) TBA 10.15 Rene Lavendhomme (Louvain-la-Neuve) "Deformation of algebraic structures" 11.00 Break 11.30 Tom Leinster (Cambridge) "Homotopy algebras for operads" 12.15 Juergen Koslowski (Braunschweig) "A game-like construction on certain Chu-bicategories" 13.00 Lunch 14.30 Jiri Rosicky (Brno) "Uncountable orthogonality is a closure property" 15.15 Thomas Streicher (Darmstadt) "Impredicative implies untyped" 16.00 Break 16.30 Dominique Bourn (Dunkerque) "Malcev groupoids and realization of cohomology groups" 17.15 Anders Kock (Aarhus) "Anafunctors and fibrations" 19h Dinner Sunday 09.30 Ronnie Brown (Bangor) "The equivalence of cubical and globular infinity categories" 10.15 Anthony Bak (Bielefeld) "Global actions: the algebraic counterpart of a topological space" 11.00 Break 11.15 George Janelidze (Tbilisi) "Internal crossed modules" ----------------------------------------------------------------------- The organizers: Francis Borceux Marino Gran Mamuka Jibladze Enrico Vitale From cat-dist Thu Oct 14 17:16:49 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id PAA25395 for categories-list; Thu, 14 Oct 1999 15:54:58 -0300 (ADT) X-Authentication-Warning: triples.math.mcgill.ca: rags owned process doing -bs Date: Thu, 14 Oct 1999 12:44:04 -0400 (EDT) From: "R.A.G. Seely" To: Categories List Subject: categories: Schedule for Octoberfest (16-17 October) Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: To all interested in attending the Category Theory meeting at McGill this weekend: I have put the (provisional) schedule on the web page http://www.math.mcgill.ca/triples/octoberfest99.html (or directly as http://www.math.mcgill.ca/triples/Ofest.ps) Information (weather, hotels, room and location of talks, etc) may also be found at that web site. See you Saturday = rags = ================================= From cat-dist Thu Oct 14 17:19:01 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id QAA17608 for categories-list; Thu, 14 Oct 1999 16:08:35 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-Id: <3.0.5.32.19991014115538.007ed100@mail.btinternet.com> X-Sender: dov.gabbay@mail.btinternet.com X-Mailer: QUALCOMM Windows Eudora Light Version 3.0.5 (32) Date: Thu, 14 Oct 1999 11:55:38 +0100 To: Colibri editors , d.w.miller@warwick.ac.uk From: Dov Gabbay Subject: categories: De Morgan Workshop nov 16 Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: CALL FOR PARTICIPATION Tuesday 16th November in the Great Hall, King's College, Strand The First Augustus De Morgan Workshop on The Frontiers of Logic 1.00 - 9.30 Registration 9.30-10-30 Johan van Benthem Games: Actions that make Information flow 10.30-11.00 Coffee 11.00-12.00 David Makinson Reasoning with Rules 12.00-13.30 Lunch 13.30-14.30 John Woods Frontiers of Practical Logic 14.30-15.30 Ruth Kempson and Wilfried Meyer-Viol Dynamic Syntax: the Flow of Language Understanding 15.30-16.00 Tea 16.00-17.00 Wilfrid Hodges Truth Definitions, 1900 versus 2000 17.00-18.00 Dov Gabbay, Chair Frontiers of Logic: Discussion and questions. 18.00 Conclusion There is no charge for the Workshop, but participants should register their intention to attend with Jane Spurr, jane@dcs.kcl.ac.uk - Our apologies if you receive multiple copies of this message - -- Professor D M Gabbay Augustus De Morgan Professor of Logic Dept of computer Science King's College Strand London WC2R 2LS Telephone + 44 171 848 2930 Fax + 44 171 240 1071 http://www.dcs.kcl.ac.uk/staff/dg/ http://www.kcl.ac.uk/kis/schools/hums/philosophy/staff/dovg.html Latex or postscript files send to Jane Spurr jane@dcs.kcl.ac.uk From cat-dist Fri Oct 15 11:54:12 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id KAA22358 for categories-list; Fri, 15 Oct 1999 10:12:24 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Thu, 14 Oct 1999 18:57:00 -0400 (EDT) Message-Id: <3.0.16.19991014185832.40471b7e@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: Flogging picture books again Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: To those planning to participate in the McGill OktoberFest: At the McGill OktoberFest this weekend, Barbara & I will be bringing along another half-dozen or so color copies of the Buffalo AMS Special Session picture book (for those who didn't get to see it at Coimbra), as well as one preliminary mock-up of its Coimbra CT'99 sequel (likely to be ready for distribution within a month). These won't be on steady display, but I'll always have them with me, and anyone hoping to steal a peek at one volume or the other can just ask me during a break. -- Fred [Linton] From cat-dist Mon Oct 18 15:43:23 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id NAA22182 for categories-list; Mon, 18 Oct 1999 13:44:06 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Thu, 14 Oct 1999 09:58:32 +0900 (JST) From: HAGIYA Masami Message-Id: <199910140058.JAA06264@lyon.is.s.u-tokyo.ac.jp> To: categories@mta.ca Subject: categories: Workshop on Refinement and Abstraction Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: CALL FOR PARTICIPATION Workshop on Refinement and Abstraction Nov 15-17, 1999 ETL Osaka Japan http://www.etl.go.jp/~yoshiki/RAW.html Refinement has become an important research field in computer science. It was first proposed in the engineering context of verification of large scale programs, or "verification in the large." The idea was to put together a proof that a program behaves correctly assuming the correctness of the library modules in use and a correctness proof of those modules, obtaining a full proof of program correctness. There have been scientific attempts to analyse refinement using universal algebra, relational algebra and lattice theory. In the late 90's, those mathematical tools have extended to category theory, and a deeper connection with traditional programming semantics is now being sought. On the other hand, the programming technique called "abstract interpretation" has turned out to be useful for software verification. It has led to a hybrid method called abstract model checking, which is an amalgamation of the deductive formal proof method and model checking. In particular, abstraction is useful in reducing the number of states of a transition system, making model checking more tractable in many cases. The words "refinement" and "abstraction" sound as though they have opposite directions. The two approaches, however, seem to have much in common. For instance, transformations between two models (an "abstract" model and "concrete" model) play an essential role in both methods. The aim of this workshop is to provide an opportunity for people working in refinement and abstraction to get together and to learn how the two fields are related. To that end, we shall limit the number of attendants (to about 30 people) for economy of communication. We plan to publish an after-meeting-booklet containing articles related to the talks given in the workshop. Invited speakers: Ralph-Johan Back (Abo Akademi University, Turku) Patrick Cousot (ENS, Paris) He Jifeng (United Nations University, Macau) David Schmidt (Kansas State University) Bernhard Steffen (University of Dortmund) Akira Mori (JAIST, Japan) Accommodation. For participants of this workshop, Hotel New Archaic, where the workshop will be held, offers the following special rate. Single room : 7,000 Yen(+SVC,TAX) Twin room : 12,000 Yen(+SVC,TAX) Breakfast : 1,400 Yen(+SVC,TAX) extra To get this rate, you need to book BY E-MAIL, BEFORE Friday 29 October, 1999, with the explicit statement that you are to participate the Workshop on Refienemnt and Abstraction sponsored by ETL. E-mail address for booking: archaic@mxq.mesh.ne.jp There are some non-smoking rooms but the numberis limited. So, quick reservation would be recommended if you need it. Organisers: Yoshiki Kinoshita (ETL Osaka) Masami Hagiya (University of Tokyo) A. John Power (University of Edinburgh) Place: Hotel New Archaic 2-7-1 shouwadouri, Amagasaki-shi, Hyogo 660-0881 Tel:+81-6-6488-7777, Fax:+81-6-6488-0700 Hotel New Archaic is situated to the northeast of Hanshin Amagasaki Station along Route 2. It takes ca. 6-minutes on foot from Hanshin Amagasaki Station. Sponsor: ETL (Centre Of Excellence Project---Global Information Processing Technology) Tentative Program: See http://www.etl.go.jp/~yoshiki/RAW.html for the abstracts of the talks. Monday, Nov 15 2:00 -- 3:00 He JiFeng Refinement Induces the Enriched Semantics of Programming Languages (invited) 3:00 -- 3:30 break 3:30 -- 4:15 Koichi Takahashi Valid Abstract Model Checking of Safety Property 4:15 -- 5:00 Yoshiki Kinoshita Refinement and Free Extension of Simulations Tuesday, Nov 16 9:30 -- 10:30 Bernhard Steffen Dataflow Analysis as Model Checking of Abstract Interpretations (invited) 10:30 -- 11:00 break 11:00 -- 12:00 Akira Mori A Behavioral Model Checker for CafeOBJ (invited) 12:00 -- 13:30 lunch 1:30 -- 2:15 Mitsuharu Yamamoto On Formal Verification of Graph Search Algorithms and Its Application to Model Checking 2:15 -- 3:00 Akihiko Takano Nested Datatypes and Program Fusion 3:00 -- 3:30 break 3:30 -- 4:30 Patrick Cousot Abstraction in abstract interpretation (invited) 4:30 -- 5:00 break 5:00 -- 5:30 business meeting 6:00 -- workshop dinner Wednesday, Nov 17 9:30 -- 10:30 Ralph-Johan Back Refinement of interactive and concurrent systems (invited) 10:30 -- 11:00 break 11:00 -- 11:45 Furusawa Hitoshi On Soundness and Compuleteness of Simulations with respect to Refinement 11:45 -- 12:30 Mizuhito Ogawa Automatic Verification Based on Abstract Interpretation 12:30 -- 2:00 lunch 2:00 -- 3:00 David Schmidt Properties of Binary Relations for Abstraction and Refinement (invited) 3:00 -- 3:30 break 3:30 -- 5:00 discussions Registration: For registration to the workshop, send the following data to Ms. Midoriko Yokoyama by e-mail. E-mail : midoriko@etl.go.jp - Names in full : - Address : - Phone/Fax : - Oranization : - Date of transfer to our bank : Registration fee is 10,000yen that includes: - admission to the workshop - lunches during the workshop - workshop dinner on Nov 16 - materials distributed during the workshop Payments should be made in Yen currency by bank transfer. Notice: Registration fee 10,000yen does not include the bank charge. (Payments by cash at the registration counter on the first day of the workshop are also possible.) Bank name : Sakura Bank Branch bank name : Sonoda Beneficiciary's name : ETL YOSHIKI KINOSHITA ID number : 357-4561405 (Ordinary bank account) For further information, contact: Ms. Midoriko Yokoyama Osaka LERC ETL Nakouji 3-11-46 Amagasaki, Hyogo 661-0974 Japan E-mail: midoriko@etl.go.jp Fax: +81-6-6491-5028 Phone: +81-6-6494-7825 From cat-dist Mon Oct 18 16:41:57 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id PAA19559 for categories-list; Mon, 18 Oct 1999 15:23:32 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-ID: <380AEA7F.61EF@math.uni-bremen.de> Date: Mon, 18 Oct 1999 11:38:09 +0200 From: "Hans-E. Porst" Reply-To: porst@math.uni-bremen.de Organization: Uni-Bremen-FB3 X-Mailer: Mozilla 3.01 [de]-C-AICK1-2 (Macintosh; I; PPC) MIME-Version: 1.0 To: categories@mta.ca Subject: categories: CatMAT2000 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: A conference Categorical Methods in Algebra and Topology will take place at the University of Bremen from August 21-26, 2000. This conference will commemorate 25 years of categorical research and teaching at the University of Bremen and is to be seen in a long line of similar ones (e.g. Mannheim 1975, Berlin 1978, Ottawa 1980, Cape Town 1981, Toledo, Ohio 1983, L'Aquila 1986, Prague 1988, Antwerp 1998). People interested to participate are invited to preregister at our website (which will be updated regularly from now on) http://katmat.math.uni-bremen.de/catmat2000/ or via e-mail. Hans-E. Porst ----------------------------------------------------------------- Hans-E. Porst e-mail: porst@math.uni-bremen.de FB 3: Mathematik Phone: +49 421 2182276 University of Bremen Secr.: +49 421 2184971 D-28334 Bremen Fax: +49 421 2184856 http://www.informatik.uni-bremen.de/~porst/ From cat-dist Mon Oct 18 16:44:53 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id PAA16341 for categories-list; Mon, 18 Oct 1999 15:24:45 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Mime-Version: 1.0 X-Sender: audersec@f-user.unifr.ch Message-Id: Date: Mon, 18 Oct 1999 11:55:28 +0100 To: categories@mta.ca From: Claude Auderset Subject: categories: CATOP2000 Content-Type: text/plain; charset="us-ascii" Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: Conference C A T O P 2 0 0 0 (Second announcement) to be held at the University of Fribourg (Switzerland), 4-6 July, 2000 (a satellite conference of 3ECM, Barcelona). TOPIC: It is the aim of this conference to discuss categorical topological methods that are likely to be mathematically important in the next century. Furthermore, on Thursday afternoon resp. evening, we shall celebrate the seventieth birthday of Professor Heinrich Kleisli (Fribourg). Tentative titles of the eight invited two hour lectures: A. ARHANGEL'SKII (Moscow, Russia): Topological semigroups. M. BARR (Montreal, Canada): The *-autonomous category of Mackey spaces. MARIA M. CLEMENTINO (Coimbra, Portugal): Closure operators. KATHRYN P. HESS (Lausanne, Switzerland): Model categories in algebraic topology. R. LOWEN (Antwerp, Belgium): Approach spaces. HILARY A. PRIESTLEY (Oxford, England): Duality theory. D. PUMPLUEN (Hagen, Germany): Convex sets and Saks spaces (A paradigmatic case of applied category theory). S. WATSON (York, Canada): How to construct counterexamples in general and set-theoretic topology usefully with pullbacks. SHORT COMMUNICATIONS: Persons interested in giving a short communication are kindly asked to send a one page abstract of their talk by ordinary (air)mail to Prof. Heinrich Kleisli, Department of Mathematics, University of Fribourg, 1700 Fribourg, Switzerland, before April 1, 2000. Please note however that the programme of the congress mainly consists of the afore-mentioned 8 invited lectures (of 2 times 50 minutes each) and allows only a restricted number of (about 8-10) short communications (of 20 minutes each); if necessary, the scientific committee of the conference will have to select among the suggested short communications the most suitable ones. Each participant who wishes to give a short communication will be informed by May 1, 2000, whether his or her talk is part of the final programme of the congress. ACCOMMODATION: The hotels (and student residences) are located near the railway station. The prices are as follows (breakfast included): Single room: 90 sFr. up, Double room: 140 sFr. up. Student residence: Single room (~45 sFr.) Double room (~35 sFr./pers.) TRAVELLING TO FRIBOURG: Intercity trains connect Fribourg with the international airports of Geneva and Zurich. Talks will take place in the Chemistry Building, Perolles-site of the University of Fribourg, close to the centre of the town. Further information about the congress (e.g. maps) can be obtained via its homepage: www.unifr.ch/math/catop2000 REGISTRATION: A participation fee of 100 sFr. (Swiss francs) will be paid by each participant. The ticket for the banquet on Thursday night costs additional 80 sFr. Please indicate in the registration form below how many tickets for the banquet you need. The deadline for paying the registration fee and tickets is April 10, 2000. Please make money orders payable to Banque Cantonale, CATOP2000, Inst.Math., CH-1700 Fribourg, (CCP 17-49-3), account-no 25'01'016.390-09, b.cl. 768. The registration desk will open on Tuesday morning at 8.00. Email facilities will be available to participants during the conference. The organizers strongly recommend electronic preregistration via our homepage mentioned above. Persons who have no access to Internet also may fill in the preregistration form given below and send it to one of the following addresses of the congress: Email: catop2000@unifr.ch (Air)mail: Catop2000, Department of Mathematics, University of Fribourg, 1700 Fribourg, Switzerland We are looking forward to meeting you in Fribourg. The organizing committee of CATOP 2000: Ernst Ruh (Fribourg), Hans-Peter Kuenzi (Bern), Claude Auderset (Fribourg). ========================================================================= Preregistration Form (before 10th April, 2000) ------------------------------------------------------------------------- Registration Details: Family name (please print): First name: Affiliation: Mailing address (if different): Email: Fax: Arrival date: Departure date: I shall arrive with accompanying persons. I need tickets for the banquet. Visa support: I need an official invitation: yes/no accommodation needed: yes/no accommodation in student residence: single/ double room in hotel: single / double room Additional remarks: -------------------------------- From cat-dist Tue Oct 19 13:48:55 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id MAA17349 for categories-list; Tue, 19 Oct 1999 12:06:21 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-Id: Date: Tue, 19 Oct 1999 12:15:38 +0100 (BST) From: "Roy L. Crole" To: categories@mta.ca Subject: categories: SUMMER SCHOOL ON MATHEMATICS OF PROGRAM CONSTRUCTION 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: RO X-Status: =================================================================== FIRST ANNOUNCEMENT =================================================================== SUMMER SCHOOL AND WORKSHOP ON ******************************************* * ALGEBRAIC AND CO-ALGEBRAIC METHODS IN * * THE MATHEMATICS OF PROGRAM CONSTRUCTION * ******************************************* Lincoln College, Oxford, UK, 10th to 14th April 2000 This school specifically aims to equip mathematicians embarking on a PhD degree with the knowledge and expertise to contribute to current research in computing science. It is also of interest to other PhD students and lecturers with an active interest in the mathematics of program construction. The school will consist of the following intensive courses together with a one-day workshop at which participants will be given the opportunity to present their own research. LECTURERS Peter Aczel (University of Manchester): Initial Algebras and Final Coalgebras: The Categorical Perspective Roland Backhouse (University of Nottingham): Fixpoint Calculus and Galois Connections Richard Bird (Oxford University): The Algebra of Programming Jeremy Gibbons (Oxford University): Calculational Properties of Folds and Unfolds Bart Jacobs (Nijmegen Catholic University): Coalgebras and Coinduction Burghard von Karger (University of Kiel): Temporal Algebra Hilary Priestley (Oxford University): Lattices and Order DEADLINES For financial support: 31st January 2000 For registration: 11th February 2000 ORGANIZERS Roland Backhouse (University of Nottingham) Roy Crole (University of Leicester) Jeremy Gibbons (Oxford University) Preliminary information can be found at the School home page http://www.comlab.ox.ac.uk/oucl/research/areas/ap/acmmpc/ REGISTRATION To register, complete the form below, and deliver it by one of the following methods: * By email, to acmmpc-reg@comlab.ox.ac.uk * By fax, to +44 1865 273839 (mark "for the attention of Jeremy Gibbons") * By post, to ACMMPC, c/o Jeremy Gibbons, Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford OX1 3QD, UK. If you have any further questions, please email acmmpc-info@comlab.ox.ac.uk, or contact the organizers by fax or post. Please note that places on the School are limited, and early registration is advisable. ------------- cut here -------------------------------------------- ******************************************* * ALGEBRAIC AND CO-ALGEBRAIC METHODS IN * * THE MATHEMATICS OF PROGRAM CONSTRUCTION * * REGISTRATION FORM * ******************************************* Lincoln College, Oxford, UK, 10th to 14th April 2000 FIRST NAME ..... LAST NAME(S) ..... ADDRESS ..... EMAIL ..... TELEPHONE ..... STATUS (please select: edit email or tick hard-copy) * EPSRC PhD student ..... * Other PhD student ..... * non PhD student ..... ROOM (please select: edit email or tick hard-copy) * single ensuite room, full board: 80.41 ..... * single standard room, full board: 75.18 ..... * shared twin standard room, full board: 72.87 ..... * single standard room, half board: 53.57 ..... * single standard room, bed-and-breakfast only: 39.82 ..... * special dietary requirements ..... (Y/N) (please specify) All prices are per night, and are subject to VAT. "Half board" includes bed, breakfast and evening meal; "full board" also includes morning coffee, lunch, and afternoon tea. EDUCATIONAL BACKGROUND (please provide a short description of your mathematical and computing background; a few sentences will do) ADDITIONAL INFORMATION (please give details of any other information you wish to supply) From cat-dist Thu Oct 21 10:46:33 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id JAA18265 for categories-list; Thu, 21 Oct 1999 09:07:20 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-ID: <380EC254.7AB9FDDB@brookes.ac.uk> Date: Thu, 21 Oct 1999 08:35:48 +0100 From: Clare Martin X-Mailer: Mozilla 4.04 [en] (Win95; I) MIME-Version: 1.0 To: categories@mta.ca Subject: categories: exponentials in Set^Set Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: Please could somebody tell me whether exponentials exist in the functor category Set^Set, and if so, how to define them? From cat-dist Sun Oct 24 13:59:09 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id MAA31522 for categories-list; Sun, 24 Oct 1999 12:40:23 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Mime-Version: 1.0 X-Sender: duskin@mail.buffnet.net Message-Id: Date: Fri, 22 Oct 1999 18:31:50 -0400 To: categories@mta.ca From: John Duskin Subject: categories: John Isbell's Progress Content-Type: text/plain; charset="us-ascii" ; format="flowed" Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: I thought many on the list might like to know about John Isbell's remarkable progress even over the last weekend. He is regaining bodily strength rapidly. More importantly, he is beginning to read again with some pleasure, and to converse and write (!) with his usual intelligence and precision. And wit: Yesterday, I tried to help him move to a more comfortable position but did not succeed and remarked, "Close but no cigar!". He immediately asked if I had heard about a reporter's interview with Clinton's other tell- all friend, Gennifer Flowers. I hadn't. Seems she was asked if her relationship with the president had been like that of Miss Lewinski. The reply was, "Close, but no cigar". Best regards, Jack P.S. If any one wants to contact John by e-mail, for the moment, just sent it to me and note that it is for him. I will make sure that he gets it. From cat-dist Mon Oct 25 16:57:21 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id PAA11345 for categories-list; Mon, 25 Oct 1999 15:39:07 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f From: Horst Reichel Date: Mon, 25 Oct 1999 13:51:12 +0200 (MET DST) Message-Id: <199910251151.NAA07606@ithif31.inf.tu-dresden.de> To: categories@mta.ca Subject: categories: CP for CMCS'2000 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: C A L L F O R P A P E R S for the WORKSHOP ON COALGEBRAIC METHODS IN COMPUTER SCIENCE (CMCS'2000) Scope State-based dynamical systems as found throughout computing science are traditionally described as transition systems or certain kinds of automata. During the last decade, it has become increasingly clear that such systems can be captured uniformly as so-called ``coalgebras'' (which are the formal dual of algebras). Coalgebra is beginning to develop into a field of its own, with its own proof-methods (involving bisimulations and invariants). This workshop will be devoted to both an introduction to basic coalgebraic notions and techniques, and also to some recent advances in the theory of coalgebras. We are looking for participants and contributed talks to this informal workshop on both the theory and the use of coalgebras in computer science. The workshop will consist of two days, preceding the ETAPS conference (25-26 March, 2000) at the Technical University of Berlin. More information regarding submissions is given below. The scope of the meeting includes the following themes: - the theory of coalgebras (including set theoretic and categorical approaches); - coalgebras as computational and semantical models (for programming languages, dynamic systems, etc.); - coalgebras in (functional, object-oriented, concurrent) programming; - coalgebras and data types; - (coinductive) definition and proof principles for coalgebras (with bisimulations or invariants); - coalgebras and (hidden-sorted) algebras; - coalgebraic specification and verification; - coalgebras and (modal) logic Organization: Bart Jacobs (Nijmegen), Horst Reichel(Dresden), Jan Rutten (CWI, Amsterdam) and Larry Moss (Bloomington, IN). Program Committee: H. Peter Gumm (Marburg), Bart Jacobs (Nijmegen), Ugo Montanari (Pisa), Larry Moss (Bloomington, IN), Ataru T. Nakagawa (Tokyo), John Power (Edinburgh), Horst Reichel (Dresden), Jan Rutten (CWI, Amsterdam). Submissions The following dates are important for submission to the ENTCS volume. - 3 January 2000: deadline for submissions. - 11 February 2000: notification of acceptance. - 3 March 2000: final version. - 25-26 March 2000: workshop, where a printed version of the ENTCS issue will be available for participants. - (25 March - 2 April, 2000: ETAPS conference). The ideal submission is not longer than 20 pages, and gives a clear exposition of the relevant ideas. It can be sent by email to: Horst Reichel, or by ordinary mail to: From cat-dist Mon Oct 25 17:04:39 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id PAA13718 for categories-list; Mon, 25 Oct 1999 15:38:15 -0300 (ADT) 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: 2nd call for papers To: categories@mta.ca Date: Fri, 22 Oct 1999 16:25:19 +0200 (MET DST) 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: RO X-Status: *** apologies for multiple copies *** First International Conference on Computational Logic, CL2000 Imperial College, London, UK 24th to 28th July, 2000 2nd call for papers 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 is collocating with the following conferences: DOOD2000: 6th Int'l Conference on Rules and Objects in Databases ILP2000: 10th Int'l Workshop on Inductive Logic Programming LOPSTR2000: 10th Int'l Workshop on Logic-based Program Synthesis and Transformation CL2000 will include seven streams covering various subfields of computational logic, each with its own separate Program Committee: - Database Systems (DOOD2000) - Program Development (LOPSTR2000) - Knowledge Representation and Non-monotonic Reasoning - Automated Deduction: Putting Theory into Practice - Constraints - Logic Programming: Theory and Extensions - Logic Programming: Implementations and Applications The last three streams effectively constitute the former ICLP conference series that will be now integrated into CL2000. ILP2000 will be collocating as a separate conference. Papers on all aspects of the theory, implementation, and application of Computational Logic are invited, where Computational Logic is to be understood broadly as the use of logic in Computer Science. Provisional deadlines: Papers must be submitted by 1 February, 2000 Authors will be notified of acceptance/rejection by 1 May, 2000 Camera-ready versions must be received by 1 June, 2000 Further information is available at the conference web site: http://www.doc.ic.ac.uk/cl2000 From cat-dist Tue Oct 26 17:10:18 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id PAA20690 for categories-list; Tue, 26 Oct 1999 15:19:08 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Mon, 25 Oct 1999 22:11:28 +1000 (EST) From: Vladimir Estivill-Castro Message-Id: <199910251211.WAA20796@olive.newcastle.edu.au> To: categories@mta.ca Subject: categories: COCOON 2000 Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: Apologies if you receive multiple copies of this message. COCOON'2OOO --- Preliminary Call for Papers --- Sixth Annual International Computing and Combinatorics Conference July 26-28, 2000, Bondi Beach , Sydney , Australia The Sixth Annual International Computing and Combinatorics Conference, COCOON'2000, will be held in Bondi Beach , Sydney , Australia July 26--28, 2000 (a few weeks before the XXVII Olympics, September 15 -- October 1 ). The conference aims to provide a forum for researchers in theoretical computer science. Original research papers in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing are solicited. In additional to theoretical results, submissions that report substantial results in experimental and applied research are encouraged. Typical, but not exclusive, topics of interest include: -- algorithms and data structures -- automata, languages and logic -- combinatorics related to algorithms and complexity -- complexity theory -- computational algebra, biology, geometry, and number theory -- computational learning theory and knowledge discovery -- cryptography and database theory -- graph drawing and information visualization -- graph theory, communication networks, and optimization -- parallel and distributed computing Submissions to the conference this year will again be conducted electronically. Authors should send a PostScript file of a paper (in English) to cocoon2000@cse.unsw.edu.au by February 8, 2000. A submission guideline will be given on our home page: http://www.cs.newcastle.edu.au/~cocoon2000 Alternatively, authors unable to access e-mail may send 6(six) hard copies of their papers to: Xuemin Lin - COCOON'2000 School of Computer Science and Engineering University of New South Wales Sydney, NSW 2052, Australia. e-mail: lxue@cse.unsw.edu.au A paper should start with the title of the paper, each author's name, affiliation, e-mail address, and a short summary of the main results. The paper should provide sufficient detail to allow the Program Committee to evaluate its validity, quality, and relevance to the conference. The length of the paper should not exceed 10 pages (using 11 point or larger font, with ample margins all around). If necessary, authors may include a clearly marked appendix that will be read at the discretion of the Program Committee. An abstract of the paper must be submitted electronically by February 1, 2000. Authors will be notified of acceptance or rejection by March 30, 2000. A camera-ready copy of each accepted paper will be required by April 26, 2000. The proceedings of the conference will be published by Springer-Verlag in the Lecture Notes in Computer Science series, and will be available for distribution at the conference. The Hao Wang award will be given to the best paper (details will be given on our home page). We also introduce an award for the best paper from a young researcher (at most 3 years since PhD). Program Committee Co-Chairs =========================== Ding-Zhu Du (U. of Minnesota, USA) Peter Eades (Newcastle, Australia) Xuemin Lin (New South Wales, Australia) Conference Co-Chairs ==================== Vladimir Estivill-Castro (Newcastle, Australia) Arun Sharma (New South Wales, Australia) Program Committee ================= David Avis (McGill, Canada), Jianer Chen (Texas A&M, USA), Francis Chin (Hong Kong U, Hong Kong), Vladimir Estivill-Castro (Newcastle, Australia), George Havas (UQ, Australia), Hiroshi Imai (Tokyo, Japan), Tao Jiang (UC Riverside, USA), Richard Karp (UC Berkeley, USA), Michael Juenger (Cologne, Germany), D. T. Lee (Academia Sinica, Taiwan), Bernard Mans (Macquarie U., Australia), Brendan McKay (ANU, Australia), Maurice Nivat (Universitie de Paris VII, France), Takeshi Tokuyama (Tohoku, Japan), Roberto Tamassia (Brown, USA), Jie Wang (UNC Greensboro, USA), Shmuel Zaks (Technion, Israel), Louxin Zhang (NUS, Singapore), Shuzhong Zhang (CUHK, Hong Kong), Binhai Zhu (City U Hong Kong, Hong Kong) Invited Speakers ================ - Christos H. Papadimitriou (University of California, Berkeley) - Richard Brent (Oxford University Computing Laboratory) Important Dates ============== -- Submission of Abstracts: February 1, 2000 -- Submission of Papers: February 8, 2000. -- Notification of Acceptance: March 30, 2000. -- Final Version: April 26, 2000. -- Conference: July 26-28, 2000 . Location ======== The conference will be held at the Swiss-Grand Hotel in Bondi Beach, Sydney, Australia. Further Information =================== Please contact cocoon2000@cse.unsw.edu.au for further information. Sponsors ======== - University of New South Wales - University of Newcastle - Computer Science Association of Australasia From cat-dist Wed Oct 27 15:36:36 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id NAA01561 for categories-list; Wed, 27 Oct 1999 13:52:18 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-ID: <38171A91.7CCEF897@cs.keele.ac.uk> Date: Wed, 27 Oct 1999 16:30:25 +0100 From: John Stell Organization: Keele University X-Mailer: Mozilla 4.08 [en] (WinNT; I) MIME-Version: 1.0 To: categories@mta.ca Subject: categories: graph classifiers Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: The classifier, \Omega, for subgraphs has two nodes and five edges. The bi-Heyting algebra of subgraphs of a graph has two complement like operators, $\neg$ and $\suppl$. These satisfy $G \meet \neg G = \bot$ and $G \join \suppl G = \top$. One of these ($\neg$) arises from an endomorphism of $\Omega$ but the other does not. The operations $\neg$ and $\suppl$ are nicely dual in some ways but only one can be described in terms of $\Omega$. Is there some kind of explanation for this? It is possible to find a graph $\Delta$ and to describe a given subgraph as a morphism to $\Delta$ and to obtain $\suppl$ as an endomorphism of $\Delta$. But although there is a morphism from $\Delta$ to $\Omega$, we don't get $\neg$ via any endomorphism of $\Delta$. $\Delta$ has four nodes corresponding to a classification of nodes as (1) out (2) in and with all incident edges in (3) in and with all incident edges out (4) in and with some incident edges in and some out. Of course this is analogous to the edges in $\Omega$. There are four kinds of edge identified by $\Omega$ (working with a version of $\Omega$ for undirected graphs) (1) in (2) out and with all incident nodes out (3) out and with all incident nodes in (4) out and with some incident nodes out and some in. Is there a formal sense in which $\Delta$ and $\Omega$ are dual to each other? Is there a better way to view $\suppl$ as coming from some kind of classifier of graphs? Does anyone have any comments or suggestions for relevant literature? John Stell -------------------------------------------------------------------- Dr John Stell Department of Computer Science email john@cs.keele.ac.uk Keele University Keele, Staffordshire, telephone +44 1782 584083 ST5 5BG U. K. fax +44 1782 713082 http://www.keele.ac.uk/depts/cs/Staff/Homes/John/homepage.html -------------------------------------------------------------------- From cat-dist Thu Oct 28 17:50:29 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id QAA26678 for categories-list; Thu, 28 Oct 1999 16:23:07 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Date: Wed, 27 Oct 1999 15:59:41 -0400 (EDT) From: F W Lawvere Reply-To: wlawvere@ACSU.Buffalo.EDU To: categories@mta.ca Subject: categories: Re: graph classifiers In-Reply-To: <38171A91.7CCEF897@cs.keele.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: The coHeyting complement (i.e. the "least supplement") is not a natural endomorphism of the subobject functor, hence is not implemented by an endomap of the (unique) representing object for that functor.This productive contradiction was apparently known already to medieval logicians in the sense that certain logical operators are not preserved by substitution (here one substitutes along any map in the topos). That there is still information to be found about this was hinted at by my 1990 result presented at Como (see Springer Lecture Notes in Math 1488) where a nontrivial class of presheaf toposes was shown to satisfy the Leibniz product rule for the coHeyting boundary ("A and not A" where not means the least supplement); this rule is equivalent to substitutivity along projection maps but not all maps ! Unfortunately I don't fully grasp which is the graph Delta that Dr. Stell is working with but it doesn't seem to be the following. Some relevant concepts richer than a single subobject may also be representable,for example, the concept of a subobject together with another subobject whose union with it is the whole. The union map from omega cross omega to omega classifies a subobject which does that representing job and which has an obvious endomap which switches.This general construction gives in the case of graphs a 9-edge graph with 3 nodes, I believe. There seems to be no way to make these pseudo-supplements any smaller for the general graphs since the top element is isolated in the lattice of truth values) Bill Lawvere *************************************************************** 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 Fri Oct 29 15:06:56 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id NAA06062 for categories-list; Fri, 29 Oct 1999 13:39:45 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f X-Received: from pittyvaich.dcs.st-and.ac.uk (pittyvaich.dcs.st-and.ac.uk [138.251.206.55]) by mailserv.mta.ca (8.9.3/8.9.3) with ESMTP id LAA11541 for ; Fri, 29 Oct 1999 11:26:36 -0300 (ADT) X-Received: from dcs.st-and.ac.uk (mosstowie [138.251.206.146]) by pittyvaich.dcs.st-and.ac.uk (8.9.1b+Sun/8.9.1) with ESMTP id PAA15471; Fri, 29 Oct 1999 15:26:34 +0100 (BST) X-Received: (from mhe@localhost) by dcs.st-and.ac.uk (8.9.3/8.8.7) id QAA25659; Fri, 29 Oct 1999 16:25:57 +0100 From: Martin Escardo MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <14361.48261.243635.465347@mosstowie.dcs.st-and.ac.uk> Date: Fri, 29 Oct 1999 16:25:57 +0100 (BST) To: categories@mta.ca Subject: categories: 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: Dear Comprox and Categories members, Here is a short note that Reinhold Heckmann and I have written. Your comments are welcome, as always. On function spaces in topology ------------------------------ 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. We briefly discuss more advanced treatments in the introduction. ------------------------------------------------------------------- http://www.dcs.st-and.ac.uk/~mhe/papers/exponentiablespaces.ps.gz http://www.dcs.st-and.ac.uk/~mhe/papers/exponentiablespaces.dvi.gz http://www.dcs.st-and.ac.uk/~mhe/papers/exponentiablespaces.ps http://www.dcs.st-and.ac.uk/~mhe/papers/exponentiablespaces.dvi ------------------------------------------------------------------- Best regards, Martin & Reinhold From cat-dist Fri Oct 29 13:51:46 1999 Received: (from Majordom@localhost) by mailserv.mta.ca (8.9.3/8.9.3) id MAA21507 for categories-list; Fri, 29 Oct 1999 12:07:49 -0300 (ADT) X-Authentication-Warning: mailserv.mta.ca: Majordom set sender to cat-dist@mta.ca using -f Message-ID: <38198ABE.4CBE434C@cs.keele.ac.uk> Date: Fri, 29 Oct 1999 12:53:34 +0100 From: John Stell Organization: Keele University X-Mailer: Mozilla 4.08 [en] (WinNT; I) MIME-Version: 1.0 To: categories@mta.ca Subject: categories: Re: graph classifiers References: Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Status: RO X-Status: To clarify what I meant by the graph Delta in my earlier message, we can proceed via hypergraphs. In what follows all graphs are undirected, so Omega has two nodes and four edges. Define a hypergraph to be a function h : E -> PN, where E and N are sets of edges and nodes and PN is the powerset of N. Each hypergraph has dual h* : N -> PE where h* n = {e \in E | n \in h e}. A morphism of hypergraphs is a pair of functions phi_N : N_1 -> N_2 and phi_E : E_1 -> E_2 such that P phi_N h_1 subseteq h_2 phi_E. If H and K are graphs a hypergraph morphism from H to K may not be a graph morphism since a loop can be mapped to an edge which is not a loop. However, given any hypergraph h we can define a graph having the same nodes as h but with an edge joining node x to y for every edge in h incident with both x and y. If this graph is denoted by G(h), hypergraph morphisms from a graph K to a hypergraph h correspond to graph morphisms from K to G(h). The graph I called Delta before is G(Omega*) it has four nodes and nine edges. To explain the interpretation of Omega*, let's denote the nodes of Omega by 0 and 1 and the four edges by {1}1, {1}0, {0,1}0, {0}0. Given a subgraph gamma : H -> Omega, the nodes and edges have the following interpretations. 0 nodes not in the subgraph 1 nodes in the subgraph {1}1 edges in the subgraph {1}0 edges not in the subgraph but with both end nodes in {0,1}0 edges not in the subgraph but with one end in and one out {0}0 edges not in the subgraph with both end nodes out. Now give Omega* the following interpretation 0 edges in the subgraph 1 edges not in the subgraph {1}1 nodes not in the subgraph {1}0 nodes in the subgraph which are ends of a non-empty set of edges all of which are out of the subgraph. {0,1}0 nodes in the subgraph which are ends of some edges in the subgraph and ends of some edges which are out of the subgraph. {0}0 nodes in the subgraph having all their incident edges in the subgraph, or having no incident edges. Given any subgraph gamma : H -> Omega, we get neg gamma from the endomorphism of Omega switching 0 and 1 and taking {0}0 to {1}1. Using the above interpretation of Omega* we can construct a hypergraph morphism gamma! : H -> Omega*. I don't have a neat construction for gamma! except via the above interpretation of Omega*. Now the endomorphism neg : Omega -> Omega dualizes to neg* : Omega* -> Omega* and we compose this with gamma! to get a hypergraph morphism from H to Omega* which represents suppl gamma. John Stell