From MAILER-DAEMON Mon Nov 24 09:05:18 2008 Date: 24 Nov 2008 09:05:18 -0400 From: Mail System Internal Data Subject: DON'T DELETE THIS MESSAGE -- FOLDER INTERNAL DATA Message-ID: <1227531918@mta.ca> X-IMAP: 1222882043 0000000031 Status: RO This text is part of the internal format of your mail folder, and is not a real message. It is created automatically by the mail system software. If deleted, important folder data will be lost, and it will be re-created with the data reset to initial values. From rrosebru@mta.ca Wed Oct 1 13:29:48 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 01 Oct 2008 13:29:48 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1Kl4U0-0005E4-3y for categories-list@mta.ca; Wed, 01 Oct 2008 13:23:24 -0300 Date: Wed, 01 Oct 2008 13:48:36 +0100 From: Tim Porter To: categories@mta.ca Subject: categories: new webpage address MIME-Version: 1.0 Content-Type: text/plain;charset=ISO-8859-1;DelSp="Yes";format="flowed" Content-Disposition: inline Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 1 Dear All, The address of my home page has changed. it is now: http://www.bangor.ac.uk/~mas013/ Please tell me if any of the links fail. Thanks, Tim From rrosebru@mta.ca Wed Oct 1 13:29:48 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 01 Oct 2008 13:29:48 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1Kl4T8-00058S-Do for categories-list@mta.ca; Wed, 01 Oct 2008 13:22:30 -0300 Date: Wed, 01 Oct 2008 04:33:22 -0700 From: Vaughan Pratt MIME-Version: 1.0 To: Categories List Subject: categories: Re: mathematical objects Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 2 Charles Wells wrote: > Readers of this list may be interested in my new blog post, Mathematical > objects in Wikipedia > . Agreed. Per http://en.wikipedia.org/wiki/Wikipedia:BOLD I replaced the offending article with something aiming for a middle ground and shamelessly stealing some of your references (thanks!). See http://en.wikipedia.org/w/index.php?title=Mathematical_object&diff=242209011&oldid=242199687 for the previous version. It might also be worth mentioning coalgebras, and perhaps more importantly dually defined structures such as locales which are understood better in terms of the morphisms from them to a cogenerator rather than those to them from a generator, i.e. dual elements rather than elements. Also toposes as a more general codomain of the forgetful functor than the particular topos Set. Thanks for pointing out this article---Wikipedia is full of problem articles like this and finding them and getting them into shape is an ongoing project. Vaughan From rrosebru@mta.ca Thu Oct 2 22:45:18 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Thu, 02 Oct 2008 22:45:18 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1KlZcg-0002iS-LB for categories-list@mta.ca; Thu, 02 Oct 2008 22:38:26 -0300 Date: Thu, 2 Oct 2008 18:49:12 -0400 (EDT) From: Robert Seely To: Categories List Subject: categories: Octoberfest 08 Montreal MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII; format=flowed Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: RO X-Status: X-Keywords: X-UID: 4 Just a last minute note for those planning to attend Octoberfest this weekend (4,5 Oct): There will be a $20 registration fee - please bring exact change if possible (we'll take US$ if you haven't managed to convert to the proper currency). Students won't be charged registration. The talks are to be held in room FGB040 of the Faubourg building of Concordia University, near the corner of Pierce and Ste-Catherine. (See the maps on the website.) The first talk is at 9:14, but coffee will be available before. (We'll have coffee at the site of the talks, but the area in and around the Faubourg building is crawling with coffee shops, should you develop cravings.) Please check the website for all further details (schedule and abstracts of talks, maps of the area, weather, anticipated participants, accomodation(!), etc). http://www.math.mcgill.ca/triples/octoberfest08.html If you plan to attend and haven't already emailed me your intentions, please let me know asap (thanks). I am assuming most participants are planning to attend the lunch at a local Indian buffet - let me know your plans if that is not true in your case, please asap. See you Saturday, -= rags =- -- From rrosebru@mta.ca Fri Oct 3 09:41:29 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 03 Oct 2008 09:41:29 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1Kljsw-0002Vx-Kf for categories-list@mta.ca; Fri, 03 Oct 2008 09:35:54 -0300 Date: Thu, 2 Oct 2008 20:35:59 +0100 (BST) Subject: categories: PhD position at University of Strathclyde, Glasgow From: Patricia.Johann@cis.strath.ac.uk To: categories@mta.ca MIME-Version: 1.0 Content-Type: text/plain;charset=iso-8859-15 Content-Transfer-Encoding: quoted-printable Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 5 PhD Position in Operational and Categorical Approaches to Parametricity Department of Computer and Information Sciences University of Strathclyde, Glasgow, Scotland Applications are invited for one PhD position within the newly-formed Mathematically Structured Programming group at the University of Strathclyde. The group comprises Prof. Neil Ghani, Dr. Patricia Johann, and Dr. Conor McBride. The funded PhD project centers around operational and categorical approaches to relational parametricity, which serves as the basis for deriving both structured tools for programming with, and effective techniques for reasoning about, functional programs, solely fro= m their (polymorphic) types. The project aims to develop the theoretical foundations of parametricity for languages supporting advanced datatypes --- such as nested types, GADTs, and their mixed-variance versions --- as well as to apply these foundations to program transformations and other applications. The project is under the direction of Patricia Johann. The successful applicant will have a first-class BSc or an MSc with distinction in Mathematics or Computing Science or a related subject with a strong Mathematics or Computing Science component. Ideally, they will also have a strong, documented interest in doing research. Strong mathematical background and problem-solving skills are essential; good programming skills are a plus. Prior knowledge in the areas of operational semantics, category theory, and/or parametricity is an advantage, but is not required. The PhD position is for 3 years; the start date is negotiable. The position is a fully-funded post for a home (i.e., UK) or EU student, and includes both coverage of fees and an EPSRC-level stipend for each of the three years. More information about the department is available at http://www.strath.ac.uk/cis The University of Strathclyde (http://www.strath.ac.uk) is located in the heart of Glasgow, which Lonely Planet Travel Guides hail as "one of Britain's largest, liveliest and most interesting cities" (see http://www.lonelyplanet.com/worldguide/scotland/glasgow/). Southern Scotland provides a particularly stimulating environment for researchers in theoretical computer science, with active groups in this area at Heriot-Watt University, the University of Edinburgh, the University of Glasgow, the University of St. Andrews, and the University of Strathclyde= . Requests for further information and other informal enquiries can be sent to: Patricia Johann patricia@cis.strath.ac.uk Students interested in joining the group to work on other topics should contact Prof. Ghani at Neil.Ghani at ng@cis.strath.ac.uk, since further positions are expected soon. Those interested in the position are asked to send e-mail to the address given above. Full Details of the application process are available upon request, but an application will include: 1. A cover letter stating the applicant's specific interest in the project. 2. A full curriculum vitae, including an abstract of the applicant's graduate thesis and the name of their supervisor. 3. Letters of recommendation or references from at least two scientific staff members. (Letters of recommendation should either be included along with the application, or should arrive separately promptly.) 4. A completed application for postgraduate study at the University of Strathclyde. Applications, forms for letters of recommendation, and instructions are available at http://www.strath.ac.uk/prospectus/postgraduateapplications/ Applications will be considered until the position is filled, but those received earlier rather than later will have priority. From rrosebru@mta.ca Fri Oct 3 09:41:29 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 03 Oct 2008 09:41:29 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1KljsJ-0002Q0-7e for categories-list@mta.ca; Fri, 03 Oct 2008 09:35:15 -0300 From: Ana.Cavalcanti@cs.york.ac.uk Subject: categories: FM2009: First CFP To: categories@mta.ca Date: Thu, 2 Oct 2008 10:04:51 +0100 Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 6 ********************************************************* * * * FM2009: 16th FM Symposium and 2nd World Congress * * Theory meets practice * * * * October 30 - November 7, 2009 * * Eindhoven, the Netherlands * * http://www.win.tue.nl/fm2009 * * * ********************************************************* FM2009 is the sixteenth in a series of symposia of the Formal Methods Europe association, and the second one that is organized as a world congress. Ten years after FM'99, the 1st World Congress, the formal methods communities from all over the world will once again have an opportunity to meet. FM 2009 will be both an opportunity to celebrate, and an opportunity to join in when enthusiastic researchers and practitioners from a diversity of backgrounds and schools come together to discuss their ideas and experiences. The Programme Committee of FM2009 comprises 83 members representing 46 countries. For the technical symposium, papers on every aspect of the *development and application of formal methods for the improvement of the current practice on system developments* are invited for submission. Of particular interest are papers on tools and *industrial applications* : there will be a special track devoted to this topic. Many have already joined the celebrations. Springer has offered a prize for The Best Paper; this Award will include free electronic access to the Formal Aspects of Computing journal for one year, and a choice of Springer books up to a value of EUR 250.00. The authors of a selection of the accepted papers will be invited to submit extended versions of their papers to anniversary special issues of reputable journals. And there will be more: watch this space. It will be possible to participate in other ways: there will be opportunities to propose tutorials and workshops, a Doctoral Symposium, a tools exhibition, and more. Complete and up to date information can be found at http://www.win.tue.nl/fm2009/. FM2009 is also part of the 1st FMweek (Formal Methods week), which will bring together a variety of events in the area, including TESTCOM/FATES (Conference on Testing of Communicating Systems and Workshop on Formal Approaches to Testing of Software), FMICS (Formal Methods for Industrial Critical Systems), and the REFINE Workshop. There will be something for everybody. So, put the dates in your diary: Submission deadline 4 May, 2009 Notification of acceptance 6 July, 2009 Final version 10 August, 2009 Some of the people already committed and involved are listed below. INVITED SPEAKERS Wan Fokkink, The Netherlands Carroll Morgan, Australia Colin O'Halloran, UK Sriram Rajamani, India Jeannette Wing, USA GENERAL CHAIR: Jos Baeten, The Netherlands PROGRAMME COMMITTEE Ralph-Johan Back, Finland Jos Baeten, The Netherlands Sergey Baranov, Russia Gilles Barthe, Spain Rahma Ben-Ayed, Tunisia Mohamed Bettaz, Algeria Dines Bjorner, Denmark Michael Butler, UK Rodrigo Cardoso, Colombia Ana Cavalcanti, UK (Chair) Flavio Corradini, Italy Jorge Cuellar, Germany Dang Van Hung, Vietnam Dennis Dams, USA (Chair) Jim Davies, UK Susanna Donatelli, Italy Jin Song Dong, Singapore Cindy Eisner, Israel Lars-Henrik Eriksson, Sweden Juhan-P. Ernits, Estonia Jasmin Fisher, UK John Fitzgerald, UK Limor Fix, Israel Marc Frappier, Canada Marcelo Frias, Argentina Masahiro Fujita, Japan Marie-Claude Gaudel, France Stefania Gnesi, Italy Lindsay Groves, New Zealand Anthony Hall, UK Anne Haxthausen, Denmark Ian Hayes, Australia Matthew Hennessy, Republic of Ireland Leszek Holenderski, The Netherlands Ralf Huuck, Australia Predrag Janicic, Serbia Cliff Jones, UK Rajeev Joshi, USA Shmuel Katz, Israel Moonzoo Kim, Republic of Korea Nils Klarlund, USA Jens Knoop, Austria Bob Kurshan, USA Peter Gorm Larsen, Denmark Yves Ledru, France Insup Lee, USA Huimin Lin, China Zhiming Liu, Macao Nancy Lynch, USA Tom Maibaum, Canada Dino Mandrioli, Italy Sjouke Mauw, Luxembourg Annabelle McIver, Australia Dominique Mery, France Marius Minea, Romenia Peter Mueller, Switzerland Tobias Nipkow, Germany Manuel Nunez, Spain Jose Nuno Oliveira, Portugal Gordon Pace, Malta Paritosh Pandya, India Alberto Pardo, Uruguay Frantisek Plasil, Czech Republic Jaco van de Pol, The Netherlands Ingrid Rewitzky, South Africa Leila Ribeiro, Brazil Augusto Sampaio, Brazil Steve Schneider, UK Christel Seguin, France Emil Sekerinski, Canada Kaisa Sere, Finland Natalia Sidorova, The Netherlands Marjan Sirjani, Iran Ketil Stolen, Norway Andrzej Tarlecki, Poland Axel van Lamsweerde, Belgium Daniel Varro, Hungary Marcel Verhoef, The Netherlands Jurgen Vinju, The Netherlands Willem Visser, USA Farn Wang, Taiwan Jim Woodcock, UK Husnu Yenigun, Turkey FM 2009 is part of: ********************************************************* * * * +============================================+ * * | | * * | ** FMweek ** | * * | | * * +============================================+ * * | FMICS | FM2009 | REFINE | * * +--------------------------------------------+ * * | PDMC | TESTCOM/FATES | * * +--------------------------------------------+ * * | WATCH THIS SPACE | * * +--------------------------------------------+ * * | http://www.win.tue.nl/fmweek | * * +============================================+ * * * ********************************************************* From rrosebru@mta.ca Fri Oct 3 10:32:18 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 03 Oct 2008 10:32:18 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1Klkf3-0001C4-OJ for categories-list@mta.ca; Fri, 03 Oct 2008 10:25:37 -0300 Date: Thu, 02 Oct 2008 18:35:32 +0200 From: Andrej Bauer MIME-Version: 1.0 To: Tim Porter , categories@mta.ca Subject: categories: Re: new webpage address Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 8 [Note from moderator: this is clearly off-topic, so any discussion of it must be off-line, but for anyone who maintains a web page conscientiously and doesn't know about this tool, the information is certainly useful.] Tim Porter wrote: > Dear All, > > The address of my home page has changed. it is now: > http://www.bangor.ac.uk/~mas013/ This is somewhat offtopic [moderator, feel free to delete the message], but things best done by machines should be done by machines. At http://validator.w3.org/checklink you enter a URL and it tells you about broken links. There's more stuff like that at http://validator.w3.org/ such as making sure your HTML has all its tags slashed. Andrej From rrosebru@mta.ca Mon Oct 6 11:43:59 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 06 Oct 2008 11:43:59 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1KmrCB-00023p-6i for categories-list@mta.ca; Mon, 06 Oct 2008 11:36:23 -0300 Mime-Version: 1.0 (Apple Message framework v753.1) To: categories Subject: categories: k-spaces From: Ross Street Date: Mon, 6 Oct 2008 12:59:22 +1100 Content-Transfer-Encoding: 7bit Content-Type: text/plain;charset=US-ASCII;format=flowed Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 9 There were some interesting postings a little while back on k-spaces. In connection to that I have been meaning to publicize the fact that I scanned Brian Day's Masters thesis awhile back. I put a link on his publication page: it is http://www.math.mq.edu.au/~street/DayMasters.pdf I hope to scan his PhD thesis and other hard-to-get items soon. Ross From rrosebru@mta.ca Mon Oct 6 18:57:03 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 06 Oct 2008 18:57:03 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1Kmxwd-0000fO-Cu for categories-list@mta.ca; Mon, 06 Oct 2008 18:48:47 -0300 From: "George Janelidze" To: "\"Categories\"" Subject: categories: First Announcement of CT2009 Date: Mon, 6 Oct 2008 23:14:06 +0200 MIME-Version: 1.0 Content-Type: text/plain;charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: RO X-Status: X-Keywords: X-UID: 10 FIRST ANNOUNCEMENT OF CT2009 AT CAPE TOWN Dear Colleagues, As many of you know from several preliminary announcements, The International Conference in Category Theory CT2009 will be held at the University of Cape Town (South Africa) during the week June 29-July 4 of 2009, which is approved by International Steering Committee in Category Theory. The conference will be dedicated to Saunders Mac Lane, who would turn 100 years old on 4 August 2009. INVITED SPEAKERS: Dominique Bourn Marino Gran Peter T. Johnstone F. William Lawvere Ross H. Street Walter Tholen SCIENTIFIC COMMITTEE: Jiri Adamek Dominique Bourn Marino Gran Marco Grandis George Janelidze Peter T. Johnstone Stephen Lack A. John Power Manuela Sobral Ross H. Street Walter Tholen Richard J. Wood Each member of this committee will choose 30 min and 15 min talks for a particular section (although for the first two sections it will be teams of four and three respectively) as follows : GENERAL CATEGORY THEORY: D. Bourn, M. Gran, G. Janelidze, M. Sobral TWO-DIMENSIONAL CATEGORICAL ALGEBRA: S. Lack, A. J. Power, R. J. Wood MONOIDAL AND HIGHER DIMENSIONAL CATEGORIES: R. H. Street TOPOS THEORY AND POINTFREE TOPOLOGY: P. T. Johnstone CATEGORICAL TOPOLOGY - Section dedicated to G. C. L. Brummer's 75th Birthday: W. Tholen HOMOTOPICAL ALGEBRA - Section dedicated to K. A. Hardie's 80th Birthday: M. Grandis APPLICATION OF CATEGORIES IN PHYSICS AND COMPUTER SCIENCE: J. Ad=E1mek ORGANIZING COMMITTEE: Dharmanand Baboolal Bruce Bartlett Guillaume C. L. Brummer Themba Dube John L. Frith Partha Pratim Ghosh Christopher R. A. Gilmour James R. A. Gray Keith A. Hardie David Holgate George Janelidze Tamar Janelidze Zurab Janelidze Hans-Peter A. Kunzi Zechariah Mushaandja Inderasan Naidoo Peter Ouwehand Ingrid Rewitzky Anneliese Schauerte Peter J. Witbooi This large committee includes almost everyone from the Universities of Cape Town, Stellenbosch, KwaZulu-Natal, Western Cape, South Africa (UNISA), and Witwatersrand, working or interested in category theory, from senior professors to PhD students. The website of the conference with all relevant information will be made before December 2008. George Janelidze From rrosebru@mta.ca Tue Oct 14 08:56:29 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 14 Oct 2008 08:56:29 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1KpiQ4-0000Em-1r for categories-list@mta.ca; Tue, 14 Oct 2008 08:50:32 -0300 Date: Mon, 13 Oct 2008 17:34:04 +0100 From: "Hugo Macedo" To: categories@mta.ca Subject: categories: Matrices Category MIME-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 7bit Content-Disposition: inline Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 11 Hello I'm trying to study the Category of Matrices but I found almost nothing. Do you know where I can find information about them? More specifically can we consider the tensor product as the product bi-functor? -- Hugo From rrosebru@mta.ca Tue Oct 14 08:57:29 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 14 Oct 2008 08:57:29 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1KpiR3-0000JV-8u for categories-list@mta.ca; Tue, 14 Oct 2008 08:51:33 -0300 Subject: categories: TLCA'09 - Preliminary Call for Papers From: Luca Paolini To: Undisclosed-Recipient:; Content-Type: text/plain; charset=ISO-8859-1 Date: Mon, 13 Oct 2008 19:35:58 +0200 Mime-Version: 1.0 Content-Transfer-Encoding: quoted-printable Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: RO X-Status: X-Keywords: X-UID: 12 Preliminary Call For Papers Ninth International Conference on Typed Lambda Calculi and Applications (TLCA '09) =09 Brasilia, July 01-03, 2009 Part of Federated Conference on Rewriting, Deduction, and Programming (RDP'09) http://rdp09.cic.unb.br/ ** Title and abstract due 19 December 2009 ** ** Deadline for submission 6 January 2009 ** The TLCA series of conferences serves as a forum for presenting original research results that are broadly relevant to the theory and applications of typed calculi. The following list of topics is non-exhaustive: * Proof-theory: Natural deduction and sequent calculi, cut elimination and normalisation, linear logic and proof nets, type-theoretic aspects of computational complexity * Semantics: Denotational semantics, game semantics, realisability, categorical models * Implementation: Abstract machines, parallel execution, optimal reduction, type systems for program optimisation * Types: Subtypes, dependent types, type inference, polymorphism, types in theorem proving * Programming: Foundational aspects of functional and object-oriented programming, proof search and logic programming, connections between and combinations of functional and logic programming, type checking The programme of TLCA'09 will consist of three invited talks (one common with the Conference Rewriting Techniques and Applications) and about 25 papers selected from original contributions. Accepted papers will be published as a volume of Springer Lecture Notes in Computer Science series (http://www.springer.de/comp/lncs/index.html). Invited Speakers ------------------------------------ There will be invited talks by: *=20 *=20 *=20 Submissions: ------------ The submitted papers should describe original work and should allow the Programme Committee to assess the merits of the contribution. In particular references and comparisons with related work should be included. Submission of material already published or submitted to other conferences with published proceedings is not allowed. Papers should not exceed 15 pages in Springer LNCS format (http://www.springer.de/comp/lncs/authors.html). Instructions for online submissions are found at the conference webpage http://rdp09.cic.unb.br/ Important Dates: ---------------- Title and abstract due Monday January 5 Deadline for submission Monday January 12 Referee reports due, PC discussion starts Sat February 28 Notification acceptance/rejection Fri March 20 Final Versions sent in by authors Fri April 10 TLCA'09 Program Committee: -------------------------- Zena Ariola, University of Oregon Patrick Baillot, CNRS and ENS Lyon Thierry Coquand, Goteborg University, Pierre-Louis Curien, CNRS and University Paris 7 (PC Chair) Ren=E9 David, Universit=E9 de Savoie Dan Ghica, University of Birmingham Ryu Hasegawa, Tokyo University Barry Jay, University of Technology, Sydney Soren Lassen, Google, Sydney Luca Paolini, University of Torino Frank Pfenning, Carnegie Mellon University Thomas Streicher, Technical University of Darmstad TLCA Steering Committe: ----------------------- Samson Abramsky, Oxford, chair Henk Barendregt, Nijmegen Mariangiola Dezani-Ciancaglini, Turin Roger Hindley, Swansea Martin Hofmann, Munich Pawel Urzyczyn, Warsaw Simona Ronchi Della Rocca, Torino Publicity Chair Luca Paolini From rrosebru@mta.ca Wed Oct 15 08:45:46 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 15 Oct 2008 08:45:46 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1Kq4i7-0004yv-Hu for categories-list@mta.ca; Wed, 15 Oct 2008 08:38:39 -0300 Date: Tue, 14 Oct 2008 10:43:30 -0700 From: "Mike Stay" Subject: categories: Re: Matrices Category To: categories@mta.ca MIME-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 7bit Content-Disposition: inline Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 13 On Mon, Oct 13, 2008 at 9:34 AM, Hugo Macedo wrote: > Hello > > I'm trying to study the Category of Matrices but I found almost nothing. Do > you know where > I can find information about them? I think you may have more success searching for information about the category Vect_K of vector spaces and K-linear transformations between them, where K is the field of interest (usually the reals K=R or the complex numbers K=C). > More specifically can we consider the tensor product as the product > bi-functor? In Set, the cartesian product is different from the coproduct, and the product satisfies hom(A x B, C) is isomorphic to hom(A, C^B) making Set into a cartesian closed category, a special kind of symmetric monoidal closed category; but this is not true in Vect. The product and coproduct are the same in Vect, namely the "direct sum", while the tensor product is what makes Vect into a symmetric monoidal closed category: hom(A tensor B, C) = hom(A, B -o C) where -o is linear implication. Vect also happens to be a compact closed category, which means that B -o C is isomorphic to B* tensor C. -- Mike Stay - metaweta@gmail.com http://math.ucr.edu/~mike http://reperiendi.wordpress.com From rrosebru@mta.ca Wed Oct 15 08:46:25 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 15 Oct 2008 08:46:25 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1Kq4jg-0005AN-0h for categories-list@mta.ca; Wed, 15 Oct 2008 08:40:16 -0300 Date: Tue, 14 Oct 2008 23:38:14 -0400 From: "Fred E.J. Linton" Subject: categories: Re: Matrices Category To: Mime-Version: 1.0 Message-ID: <378mJoDlo7316S14.1224041894@cmsweb14.cms.usa.net> Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 14 "Hugo Macedo" wrote: > I'm trying to study the Category of Matrices but I found almost nothing= =2E Do > you know where > I can find information about them? = > --- [snip] --- Do you mean matrices as the objects of this category? or as its morphisms (in which case, what objects do you see?)? Might make a difference in the references you get pointed to. From rrosebru@mta.ca Wed Oct 15 08:46:25 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 15 Oct 2008 08:46:25 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1Kq4iy-000535-4m for categories-list@mta.ca; Wed, 15 Oct 2008 08:39:32 -0300 Message-ID: <7f854b310810141044x3c5045f6see7eb50a777e4ab2@mail.gmail.com> Date: Tue, 14 Oct 2008 10:44:25 -0700 From: "Mike Stay" Subject: categories: Re: Matrices Category To: categories@mta.ca MIME-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 7bit Content-Disposition: inline Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 15 On Tue, Oct 14, 2008 at 10:43 AM, Mike Stay wrote: > The product and coproduct are the same in Vect, namely the "direct > sum", while the tensor product is what makes Vect into a symmetric > monoidal closed category: > hom(A tensor B, C) = hom(A, B -o C) Sorry, that should read "is isomorphic to", not strict equality. -- Mike Stay - metaweta@gmail.com http://math.ucr.edu/~mike http://reperiendi.wordpress.com From rrosebru@mta.ca Wed Oct 15 08:47:08 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 15 Oct 2008 08:47:08 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1Kq4kY-0005L5-Ub for categories-list@mta.ca; Wed, 15 Oct 2008 08:41:11 -0300 From: Gaucher Philippe Date: Wed, 15 Oct 2008 12:03:23 +0200 MIME-Version: 1.0 To: categories@mta.ca Subject: categories: right adjoint by forgetting relational symbols Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 16 Dear all, I need some references for this problem. Suppose we have a locally presentable category C axiomatized by a limits theory T, so C=Mod(T). Let us forget some relational symbols in T and all axioms containing these relational symbols. One obtains a theory T'. There is a forgetful functor Mod(T) --> Mod(T'). Does this functor have always a right adjoint ? If not, what conditions must we add ? Thanks in advance. pg. From rrosebru@mta.ca Thu Oct 16 08:49:53 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Thu, 16 Oct 2008 08:49:53 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1KqRGh-0003sJ-AY for categories-list@mta.ca; Thu, 16 Oct 2008 08:43:51 -0300 From: "R Brown" To: Subject: categories: Re: Matrices Category Date: Wed, 15 Oct 2008 17:15:27 +0100 MIME-Version: 1.0 Content-Type: text/plain;format=flowed; charset="iso-8859-1"; reply-type=original Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 17 On any additive category A you can define a category of matrices Mat(A). The objects of Mat(A) are n-tuples A_*= (A_1, ...,A_n) for all n >= 1, of objects of A. A morphism a_**: A_* \to B_* consists of arrays of morphisms a_{ij}: A_i \to B_j (or is it the other way round? I leave you to look for the conventions). If you get the conventions right, then composition in Mat(A) is just matrix composition. The nice point about this is that Mat(A) is again an additive category, so the process can be iterated. Actually only semi-additive is needed (matrix composition does not use negatives.) The above idea essentially yields partitioned matrices (see old books on matrices). This passage A \mapsto Mat(A) ought to be available on computer software! I expect the above is in a reference somewhere! Ronnie Brown www.bangor.ac.uk/r.brown ----- Original Message ----- From: "Hugo Macedo" To: Sent: Monday, October 13, 2008 5:34 PM Subject: categories: Matrices Category > Hello > > I'm trying to study the Category of Matrices but I found almost nothing. > Do > you know where > I can find information about them? > > More specifically can we consider the tensor product as the product > bi-functor? > > -- > Hugo > > -------------------------------------------------------------------------------- No virus found in this incoming message. Checked by AVG - http://www.avg.com Version: 8.0.173 / Virus Database: 270.8.0/1724 - Release Date: 14/10/2008 02:02 From rrosebru@mta.ca Thu Oct 16 08:49:54 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Thu, 16 Oct 2008 08:49:54 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1KqRHO-0003vG-1U for categories-list@mta.ca; Thu, 16 Oct 2008 08:44:34 -0300 Mime-Version: 1.0 (Apple Message framework v753.1) Content-Transfer-Encoding: 7bit From: Ross Street Subject: categories: Re: Matrices Category Date: Thu, 16 Oct 2008 16:05:32 +1100 To: Categories Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: RO X-Status: X-Keywords: X-UID: 18 "Hugo Macedo" wrote: > I'm trying to study the Category of Matrices but I found almost > nothing. Do > you know where I can find information about them? Once upon a time I handwrote some incomplete notes on "skeletal" representation theory which started out looking at Mat (a skeleton of Vect) as a monoidal category with direct sums (the tensor product is Kronecker product of matrices). I tried to strictify as much as possible all the associativity, distributivity, . . constraints. I typed it at some point. The pdf file has some funny things (notably copyright signs!) in it but it has been on the web (linked from my Publications page) for quite awhile. Maybe it is the kind of thing Hugo has in mind. But remember, it is sort of "in progress"; no jokes please about "droup" which is meant as short for "dual group"! Ross From rrosebru@mta.ca Thu Oct 16 08:50:00 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Thu, 16 Oct 2008 08:50:00 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1KqRHo-0003ze-1I for categories-list@mta.ca; Thu, 16 Oct 2008 08:45:00 -0300 Date: Thu, 16 Oct 2008 16:21:14 +0900 From: Hitoshi Ohsaki To: categories@mta.ca Subject: categories: RTA'09 1st CFP Mime-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 19 ******************************************************** * * * RTA 2009 * * Rewriting Techniques and Applications * * 20th International Conference * * * * June 29 - July 1, 2009, Bras_lia, Brazil * * http://rdp09.cic.unb.br/rta.html * * * * First Call for Papers * * * ******************************************************** The 20th International Conference on Rewriting Techniques and Applications (RTA 2009) is organized as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2009), together with the International Conference on Typed Lambda Calculi and Applications (TLCA 2009), and several workshops. The conference will be preceded by the 4th International School on Rewriting (ISR). Bras_lia, the federal capital of Brazil, is listed as a World Heritage Site by UNESCO. RDP 2009 will be held at Universidade de Bras_lia, one of the largest and one of the most prestigious universities in Brazil, on a campus built by highly acclaimed architect Oscar Niemeyer. Bras_lia is easily reached by plane; air fares are moderate at that time of the year. IMPORTANT DATES: Abstract Submission: January 19, 2009 Paper Submission: January 26, 2009 Notification: March 20, 2009 Final version: April 10, 2009 RTA is the major forum for the presentation of research on all aspects of rewriting. Typical areas of interest include (but are not limited to): * Applications: case studies; analysis of cryptographic protocols; rule-based (functional and logic) programming; symbolic and algebraic computation; theorem proving; system synthesis and verification; proof checking; reasoning about programming languages and logics; program transformation; * Foundations: matching and unification; narrowing; completion techniques; strategies; rewriting calculi, constraint solving; tree automata; termination; combination; * Frameworks: string, term, and graph rewriting; lambda-calculus and higher-order rewriting; constrained rewriting/deduction; categorical and infinitary rewriting; integration of decision procedures; * Implementation: implementation techniques; parallel execution; rewrite tools; termination checking; * Semantics: equational logic; rewriting logic; rewriting models of programs. BEST PAPER AWARD: A prize of 500 Euro will be given to the best paper as judged by the program committee. The program committee may decline to make the award or may split it among several papers. GENERAL CHAIR: * Mauricio Ayala Rinc_n (Bras_lia, Brazil) PROGRAM COMMITTEE: * Takahito Aoto (Sendai, Japan) * Franz Baader (Dresden, Germany) * Eduardo Bonelli (Buenos Aires, Argentina) * Dan Dougherty (Worcester, USA) * Rachid Echahed (Grenoble, France) * Santiago Escobar (Valencia, Spain) * Neil Ghani (Glasgow, GB) * J_rgen Giesl (Aachen, Germany) * Jean Goubault-Larrecq (Cachan, France) * Aart Middeldorp (Innsbruck, Austria) * Hitoshi Ohsaki (Osaka, Japan) * Vincent van Oostrom (Utrecht, The Netherlands) * Elaine Pimentel (Belo Horizonte, Brazil) * Femke van Raamsdonk (Amsterdam, The Netherlands) * Manfred Schmidt-Schau_ (Frankfurt, Germany) * Sophie Tison (Lille, France) * Ashish Tiwari (Stanford, USA) * Ralf Treinen, chair (Paris, France) PUBLICATION: RTA'09 proceedings will be published by Springer-Verlag in the Lecture Notes in Computer Science series. SUBMISSIONS: Submissions must be original and not submitted for publication elsewhere. Submissions must fall into one of the following categories (to be indicated at submission): 1. Regular Research Papers: describing new results; they will be judged on correctness and significance. 2. Papers describing the experience of applying rewriting techniques in other areas; they will be judged on relevance and comparison with other approaches. 3. Problem sets that provide realistic and interesting challenges in the field of rewriting. 4. System descriptions; they should contain a link to a working system and will be judged on usefulness and design. All submissions will be judged on originality and quality of presentation. Submissions in the first three categories can be up to 15 proceedings pages long, system descriptions up to 10 proceedings pages. Additional material, for instance proof details, may be given in an appendix which is not subject to the limitation of pages. However, submissions must be self-contained within the respective page limit; reading the appendix should not be necessary to access the merits of a submission. Submissions are accepted in either Postscript or PDF format. Authors are strongly encouraged to use LaTeX2e and the Springer llncs class file, available at http://www.springer.de/comp/lncs/authors.html. Abstracts and papers must be submitted electronically through the EasyChair system at (the site will be opened later): http://www.easychair.org/conferences/?conf=rta2009 Questions concerning submissions may be addressed to the PC chair, Ralf Treinen, treinen AT pps.jussieu.fr. From rrosebru@mta.ca Thu Oct 16 08:51:39 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Thu, 16 Oct 2008 08:51:39 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1KqRId-00043g-Hm for categories-list@mta.ca; Thu, 16 Oct 2008 08:45:51 -0300 From: Gaucher Philippe To: categories@mta.ca Subject: categories: Re: right adjoint by forgetting relational symbols Date: Thu, 16 Oct 2008 12:19:39 +0200 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Content-Disposition: inline Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 20 Le Wednesday 15 October 2008 12:03:23, vous avez =E9crit=A0: > Dear all, > > I need some references for this problem. Suppose we have a locally > presentable category C axiomatized by a limits theory T, so C=3DMod(T). > Let us forget some relational symbols in T and all axioms containing these > relational symbols. One obtains a theory T'. There is a forgetful functor > Mod(T) --> Mod(T'). Does this functor have always a right adjoint ? If no= t, > what conditions must we add ? > > Thanks in advance. pg. Dear all,=20 Thank you for all answers. But they do not give what I want. I am looking f= or=20 a -R-I-G-H-T- adjoint, and by comparing the example I have and the limit=20 theory axiomatizing the category of small categories (for which the forgetf= ul=20 functor Mod(T)-->Set does not have any right adjoint since it is not=20 colimit-preserving), i found (maybe) the following sufficient condition:=20 If T is a limit theory without equality symbol before the implication signs= ,=20 then any forgetful functor Mod(T) --> Mod(T') has a right adjoint. Indeed, all sentences of T are of the form (Ax)(F(x)=3D>((E!y)G(x,y)) where= F(x)=20 and G(x,y) are conjunctions of atomic formulas. By hypothesis, F does not=20 contain the symbol =3D. So the forgetful functor Mod(T) --> Mod(T') is coli= mit=20 preserving. Since Mod(T) is locally presentable, it is cocomplete,=20 cowellpowered and has a strong generator. So by SAFT, the forgetful functor= =20 Mod(T) --> Mod(T') has a right adjoint. Does it sound good ? Thanks in advance. pg. From rrosebru@mta.ca Fri Oct 17 11:41:23 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 17 Oct 2008 11:41:23 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1KqqNr-0006FC-Qw for categories-list@mta.ca; Fri, 17 Oct 2008 11:32:55 -0300 From: vs27@mcs.le.ac.uk To: categories@mta.ca Subject: categories: Re: Matrices Category Date: 16 Oct 2008 15:12:21 +0100 Mime-Version: 1.0 Content-Type: text/plain; format=flowed; charset=ISO-8859-1 Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 21 I am surprised that nobody suggested to Hugo to have a look at modules/profunctors. ?? On Oct 16 2008, R Brown wrote: >On any additive category A you can define a category of matrices Mat(A). > The objects of Mat(A) are n-tuples A_*= (A_1, ...,A_n) for all n >= 1, of >objects of A. A morphism a_**: A_* \to B_* consists of arrays of morphisms >a_{ij}: A_i \to B_j (or is it the other way round? I leave you to look for >the conventions). If you get the conventions right, then composition in >Mat(A) is just matrix composition. > >The nice point about this is that Mat(A) is again an additive category, so >the process can be iterated. Actually only semi-additive is needed (matrix >composition does not use negatives.) > >The above idea essentially yields partitioned matrices (see old books on >matrices). > >This passage A \mapsto Mat(A) ought to be available on computer software! > >I expect the above is in a reference somewhere! > >Ronnie Brown >www.bangor.ac.uk/r.brown > >----- Original Message ----- >From: "Hugo Macedo" >To: >Sent: Monday, October 13, 2008 5:34 PM >Subject: categories: Matrices Category > > >> Hello >> >> I'm trying to study the Category of Matrices but I found almost nothing. >> Do >> you know where >> I can find information about them? >> >> More specifically can we consider the tensor product as the product >> bi-functor? >> >> -- >> Hugo >> >> > > > > -------------------------------------------------------------------------------- > > > >No virus found in this incoming message. >Checked by AVG - http://www.avg.com >Version: 8.0.173 / Virus Database: 270.8.0/1724 - Release Date: 14/10/2008 >02:02 > > > > From rrosebru@mta.ca Fri Oct 17 11:42:02 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 17 Oct 2008 11:42:02 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1KqqP1-0006PJ-7D for categories-list@mta.ca; Fri, 17 Oct 2008 11:34:07 -0300 Content-Type: text/plain; charset=ISO-8859-1; delsp=yes; format=flowed To: categories@mta.ca Content-Transfer-Encoding: quoted-printable From: Ross Street Subject: categories: Re: right adjoint by forgetting relational symbols Date: Fri, 17 Oct 2008 09:05:06 +1100 Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 22 Right adjoints to algebraic functors are very interesting. Witt vectors and lambda-rings are key words. See MR0265348 (42 #258) Tall, D. O.; Wraith, G. C. Representable functors and operations on rings. Proc. London Math. =20 Soc. (3) 20 1970 619--643. MR0789309 (86j:13023) Joyal, Andr=E9(3-PQ) $\delta$-anneaux et vecteurs de Witt. (French) [$\delta$-rings and =20 Witt vectors] C. R. Math. Rep. Acad. Sci. Canada 7 (1985), no. 3, 177--182. May not be relevant to your examples! Regards, Ross On 16/10/2008, at 9:19 PM, Gaucher Philippe wrote: > Thank you for all answers. But they do not give what I want. I am =20 > looking for > a -R-I-G-H-T- adjoint, and by comparing the example I have and the =20 > limit > theory axiomatizing the category of small categories (for which the =20= > forgetful > functor Mod(T)-->Set does not have any right adjoint since it is not > colimit-preserving), From rrosebru@mta.ca Fri Oct 17 11:43:33 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 17 Oct 2008 11:43:33 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1KqqQ6-0006bk-2D for categories-list@mta.ca; Fri, 17 Oct 2008 11:35:14 -0300 Date: Thu, 16 Oct 2008 19:52:39 -0400 From: "Fred E.J. Linton" Subject: categories: Re: Matrices Category To: Mime-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 23 Hi, Hugo, Given the spec "as its morphisms," there are at least three perspectives.= 1) (narrowest) you're focussed on some field F and on the very = particular vector spaces over F that are of form F^n for natural = numbers n, along with the matrices that "are" the F-linear transformations among them. Any linear algebra text should help. 2) (intermediate) you're focussed on some semiring R (equipped with a multiplication and an addition, each associative and unital, = and together satisfying a distributive law) and are after the category with objects the natural numbers and maps from k to n the n by k matrices with coefficients from R. This can be construed also as the full subcategory of R-semimodules whose objects are the finitely generated free ones, which is the Lawvere-style "algebraic theory" of R-semimodules. "Functorial semantics" (google it?) can offer broad general insights. Perspective 1) arises from the special case of 2) with R =3D F. 3) (broadest) what Ronnie Brown pointed out -- from almost any = category A one can form a new category whose objects are the finite sequences of objects of A and whose maps, from say A1 ... An to B1 ... Bk are the n by k matrices whose various ij'th entries are A-morphisms from Ai to Bj [or, if you prefer, the exact opposite]. Some Russians in the '60s or '70s in the Kurosh school (i.e. [students = of ...]* students of Kurosh) exploited that construction to explain = how to embed a less-than-additive category in an additive one. The names = Kurosh, Lifshutz and Shulgeifer come to mind (perhaps inappropriately?), but the publications I'd like to cite for you, or my copies of them, anyway, are in storage, and inaccessible to me at the moment, sorry. Perspective 2) arises from the special case of 3) with = A =3D the one-object pre-additive category R. May these pointers help get you started. Cheers, -- Fred ------ Original Message ------ Received: Thu, 16 Oct 2008 09:41:42 AM EDT From: "Hugo Macedo" To: "Fred E.J. Linton" Subject: Re: categories: Matrices Category > Hello Fred E.J. Linton > = > Thanks for the answer, I meant Matrices as its morphisms. > = > Best regards, > Hugo > = > On Wed, Oct 15, 2008 at 4:38 AM, Fred E.J. Linton wrote: > = > > "Hugo Macedo" wrote: > > > > > I'm trying to study the Category of Matrices but I found almost nothing. > > Do > > > you know where > > > I can find information about them? > > > --- [snip] --- > > > > Do you mean matrices as the objects of this category? > > or as its morphisms (in which case, what objects do you see?)? > > Might make a difference in the references you get pointed to. > > > > > > > = From rrosebru@mta.ca Mon Oct 20 19:04:45 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 20 Oct 2008 19:04:45 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1Ks2kN-0001yY-AP for categories-list@mta.ca; Mon, 20 Oct 2008 18:57:07 -0300 To: categories@mta.ca Subject: categories: ALICS workshop at LPAR Date: Mon, 20 Oct 2008 01:16:16 -0400 (EDT) From: geoff@cs.miami.edu (Geoff Sutcliffe) Sender: categories@mta.ca Precedence: bulk Reply-To: geoff@cs.miami.edu (Geoff Sutcliffe) Message-Id: Status: O X-Status: X-Keywords: X-UID: 24 ----------------------------------------------------- *ALICS* - Applications of Logic in Computer Security LPAR 2008 workshop, November 22, Doha, Qatar ----------------------------------------------------- EXTENDED SUBMISSION DEADLINE - 24th October ----------------------------------------------------- Organizer: Catherine Meadows, NRL Submission deadline: October 24, 2008 Submission: 1-5 pages abstract Web: http://chacs.nrl.navy.mil/projects/ALICS08 Scope: ALICS is intended to be an informal workshop devoted to the applications of logic in computer security. This workshop is intended for presentation and discussion of work in progress and the discussion of emerging and foundational ideas. We are interested in all aspects of the application of logic to computer security. Applications of interest include security policy, access control, security protocols, information flow, but we are also interested in new and as yet untried applications of logic to different areas of computer security. We are also interested in discussion papers that raise fundamental questions and/or suggest new lines of research in this area. Work that has already appeared or is under consideration by other venues is welcome. No formal proceedings is planned, but accepted abstracts will be posted online. Program Committe and Organizers: Catherine Meadows, Naval Research Laboratory, USA (Workshop Organizer) Andreas Bauer, Australian National University, Australia Heiko Mantel, TU Darmstadt, Germany Mike Mislove, Tulane University, USA Dusko Pavlovic, Kestrel Institute (USA) and Oxford University(UK) Luca Vigano, University of Verona, Italy From rrosebru@mta.ca Mon Oct 20 19:07:16 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 20 Oct 2008 19:07:16 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1Ks2mo-0002AK-Bl for categories-list@mta.ca; Mon, 20 Oct 2008 18:59:38 -0300 Content-class: urn:content-classes:message MIME-Version: 1.0 Subject: categories: A naive question Date: Mon, 20 Oct 2008 10:33:12 -0400 From: Andre Joyal To: Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Sender: categories@mta.ca Precedence: bulk Reply-To: Andre Joyal Message-Id: Status: O X-Status: X-Keywords: X-UID: 25 The forgetful functor from groups to monoids has a right adjoint=20 which associates to a monoid its group of invertible elements.=20 I am looking for a general explanation of this observation. It should a consequence of a general result on forgetful functors of a certain kind. Best,=20 andr=E9 From rrosebru@mta.ca Thu Oct 23 14:05:31 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Thu, 23 Oct 2008 14:05:31 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1Kt3Ua-0004B8-Gg for categories-list@mta.ca; Thu, 23 Oct 2008 13:57:00 -0300 Date: Thu, 23 Oct 2008 12:05:39 -0400 (EDT) From: Ricardo Andrade To: categories@mta.ca Subject: categories: collaborative mathematics exposition MIME-Version: 1.0 Content-Type: TEXT/PLAIN; format=flowed; charset=US-ASCII Sender: categories@mta.ca Precedence: bulk Reply-To: Ricardo Andrade Message-Id: Status: O X-Status: X-Keywords: X-UID: 26 Greetings, Sorry to spam everyone in the list but I was curious whether the ideas for a wiki-style project on exposition of mathematics (which were previously discussed on this mailing list) were going somewhere or being implemented. The reason I am asking is that I am curious/interested in such a project and I was left not understanding what came out of the previous discussion on this list since it just seemed to stop rather abruptly. Thank you, Ricardo From rrosebru@mta.ca Fri Oct 24 16:24:00 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 24 Oct 2008 16:24:00 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1KtSAH-0000vd-Ut for categories-list@mta.ca; Fri, 24 Oct 2008 16:17:42 -0300 MIME-Version: 1.0 Subject: categories: RE: collaborative_mathematics_exposition? Date: Fri, 24 Oct 2008 13:48:15 -0400 From: Andre Joyal To: Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Sender: categories@mta.ca Precedence: bulk Reply-To: Andre Joyal Message-Id: Status: O X-Status: X-Keywords: X-UID: 27 Dear Ricardo, The iBourbaki project is alive and moving. You will hear about it soon. Andr=E9 -------- Message d'origine-------- De: categories@mta.ca de la part de Ricardo Andrade Date: jeu. 23/10/2008 12:05 =C0: categories@mta.ca Objet : categories: collaborative mathematics exposition =20 Greetings, Sorry to spam everyone in the list but I was curious whether the ideas for a wiki-style project on exposition of mathematics (which were previously discussed on this mailing list) were going somewhere or being implemented. The reason I am asking is that I am curious/interested in such a project and I was left not understanding what came out of the previous = discussion on this list since it just seemed to stop rather abruptly. Thank you, Ricardo k From rrosebru@mta.ca Mon Oct 27 20:21:32 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 27 Oct 2008 20:21:32 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1KubHS-0001W0-BC for categories-list@mta.ca; Mon, 27 Oct 2008 20:13:50 -0300 Mime-Version: 1.0 Date: Mon, 27 Oct 2008 10:38:49 +0100 To: categories@mta.ca From: Ugo Montanari Subject: categories: A Young Research Fellow Position at IMT, Lucca Content-Type: text/plain; charset="us-ascii" ; format="flowed" Sender: categories@mta.ca Precedence: bulk Reply-To: Ugo Montanari Message-Id: Status: O X-Status: X-Keywords: X-UID: 28 A Young Research Fellow Position at IMT, Lucca, Italy Computer Science and Engineering Deadline December 1st, 2008 IMT Institute for Advanced Studies invites strong candidates active on networking and software systems for global computing, including web data mining and mobile systems, with applications e.g. to service oriented computing, economics and embedded systems, to apply for a Faculty Position at the Assistant Professor or Post-Doctoral Fellow level. Preference will be given to candidates combining in their research fundamental and application oriented aspects. Preference will be given to candidates with a Ph.D. degree (or close to completion), or candidates with experience in formal instruction at the graduate-level. The selected candidate will be appointed for a term of up to three years. The contract may be renewed once for additional 3 years (i.e. six year in total). The remuneration package is competitive at the international level and include generous research funds. Additional benefits may be negotiated with selected applicants. Assistant Professors are senior positions and differ from Post-doctoral Fellows on the basis of experience, scientific curriculum and remuneration. Successful candidates for either type of position will work closely with other young researchers, senior researchers and graduate students, and will have a limited teaching load in the school's graduate program (e.g. one class per year). Application Procedure Applicants are required to fill out the online application form and upload a complete curriculum vitae and one research paper (published or working paper) as PDF files. Please note that you are also required to upload a signed copy of your Identity Document. Online applications only at: http://www.imtlucca.it/faculty/positions/young-research-fellows_positions/call_for_applications_in_computer_sciences_and_engineering.php Candidates are required to indicate if they intend to apply only for one of the two positions offered (Assistant Professor and Post-doctoral Fellow) or for both. Please note that if you apply for both positions you do not need to submit two applications. In addition, at least two letters of reference must be sent as e-mail attachments (preferably in PDF format) to: yrf.opening@imtlucca.it or by mail to the following address: Job Openings 2009 - YRF-CSE. IMT Lucca Institute for Advanced Studies Piazza San Ponziano, 6 55100 Lucca - Italy IMT Distinctive Features -IMT is an international graduate school that promotes cutting-edge research in areas with clear practical relevance, contributing to form international professional elites for business and institutions. -Research and teaching programs at IMT focus on institutional and technological change, the role of organizations and markets in economic systems, the analysis of complex systems in social sciences, computer science and engineering. -IMT aims to recruit students with high potential in a fast-moving global environment where research institutes and universities compete to attract resources and human capital. To do so, IMT uses international selection standards and seeks candidates from all around the globe. -The IMT community is the result of a lively interaction of students and scholars, building upon the campus system and residential services provided by the Lucca Foundation for Higher Education and Research. -PhD Courses are held in English and student curricula and performance is continually assessed through rigorous evaluation processes. CSE PhD Program Board Paolo Ciancarini - Bologna Rocco De Nicola - Firenze Carlo Ghezzi - Milano Luciano Lenzini - Pisa Ugo Montanari - Pisa, Coordinator Antonio Prete - Pisa IMT http://www.imtlucca.it/http://www.imtlucca.it/ is an International Graduate School Founded by: LUISS Guido Carli, Rome Politecnico di Milano Sant'Anna School of Advanced Studies University of Pisa Lucca Foundation for Higher Education and Research -- @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ Prof. Ugo Montanari Phone: +39 050 2212721 Dipartimento di Informatica Fax: +39 050 2212726 Universita' di Pisa Email: ugo@di.unipi.it Largo Bruno Pontecorvo, 3 Address changed recently I-56127 Pisa, Italy http://www.di.unipi.it/~ugo/ugo.html @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ -- From rrosebru@mta.ca Mon Oct 27 20:21:32 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 27 Oct 2008 20:21:32 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1KubIT-0001b3-2L for categories-list@mta.ca; Mon, 27 Oct 2008 20:14:53 -0300 Date: Mon, 27 Oct 2008 17:32:13 +0000 (GMT) From: Jocelyn Paine To: categories@mta.ca Subject: categories: Web-based category theory demonstrations MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: categories@mta.ca Precedence: bulk Reply-To: Jocelyn Paine Message-Id: Status: O X-Status: X-Keywords: X-UID: 29 I'd like to announce a selection of Web-based category theory demonstrations that I've put up at http://www.j-paine.org/cgi-bin/webcats/webcats.php . The page contains a number of buttons such as "generate and demonstrate an equaliser" and "generate and demonstrate a limit": clicking on one will generate an example of the construct in the category of finite sets, and display it as a listing of its objects and arrows, and as a diagram. For limits and colimits, the demos generate a small random graph, convert it to a diagram, then compute and display its limit or colimit. Comments would be very welcome. The demos are a bit of an experiment: I had some categorical algorithms lying around from other work, and thought it would be interesting to connect them to the Web. Jocelyn Paine http://www.j-paine.org/ From rrosebru@mta.ca Tue Oct 28 10:42:13 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 28 Oct 2008 10:42:13 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1KuoiA-0003rn-Gf for categories-list@mta.ca; Tue, 28 Oct 2008 10:34:18 -0300 Date: Tue, 28 Oct 2008 11:41:58 +0000 (GMT) From: Jocelyn Paine To: categories@mta.ca Subject: categories: Re: Web-based category theory demonstrations MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: categories@mta.ca Precedence: bulk Reply-To: Jocelyn Paine Message-Id: Status: O X-Status: X-Keywords: X-UID: 30 Thanks to the people who commented on my demonstrations. Unfortunately, I've had to disable these for the moment, because something is hammering the site and overwhelming my file quota with the number of image files created. (I'm on a commercial ISP, so resources are a bit tight.) I suspect that since I released the links, they've been grabbed by robots, so I need to look into that, and also be quicker at deleting old files. I'll post when that's sorted out. Jocelyn Paine http://www.j-paine.org http://www.spreadsheet-parts.org http://www.spreadsheet-factory.com +44 (0)7768 534 091 From rrosebru@mta.ca Wed Oct 29 09:37:16 2008 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 29 Oct 2008 09:37:16 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1KvACp-0003WE-0M for categories-list@mta.ca; Wed, 29 Oct 2008 09:31:23 -0300 Date: Wed, 29 Oct 2008 08:34:47 -0300 (ADT) From: Toby Kenney To: categories@mta.ca Subject: categories: Sketches and lattices MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: categories@mta.ca Precedence: bulk Reply-To: Toby Kenney Message-Id: Status: O X-Status: X-Keywords: X-UID: 31 Dear Category Theorists, Does anyone know whether any work has been done on sketches where all diagrams are required to commute - i.e. the models are functors from a poset to the given category. I'm particularly interested in the case where the sketch is in fact a lattice, and where we require every avb--------------a | | | | | | b--------------a^b should be sent to a pullback. Thanks for any pointers you can give. Toby