From MAILER-DAEMON Tue Jan 15 09:13:37 2008 Date: 15 Jan 2008 09:13:37 -0400 From: Mail System Internal Data Subject: DON'T DELETE THIS MESSAGE -- FOLDER INTERNAL DATA Message-ID: <1200402817@mta.ca> X-IMAP: 1196520387 0000000032 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 Sat Dec 1 10:45:39 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sat, 01 Dec 2007 10:45:39 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1IyTPm-0004M9-UZ for categories-list@mta.ca; Sat, 01 Dec 2007 10:33:55 -0400 Mime-Version: 1.0 (Apple Message framework v752.2) From: Ross Street Subject: categories: CFP: Theme Issue on Interactions of Algebraic & Coalgebraic Structures Date: Sat, 1 Dec 2007 14:35:53 +1100 To: categories Content-Transfer-Encoding: quoted-printable Content-Type: text/plain;charset=WINDOWS-1252;delsp=yes;format=flowed Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 1 Dear Colleagues The Arabian Journal for Science and Engineering is publishing a =20 special issue on subjects related to bialgebras. I am a guest editor =20 handling such papers with a categorical emphasis. If you are planning =20= to write a paper in the area in the next half year, or have one ready =20= for submission, please consider answering the call for papers below. Best wishes, Ross THE ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING Call for Papers: Theme Issue on Interactions of Algebraic & =20 Coalgebraic Structures (Theory and Applications) The editorial board of the =93Arabian Journal for Science and =20 Engineering (AJSE)=94 plans to publish in December 2008, an issue which =20= contains the latest developments in the theory and applications of =20 =93Algebraic & Coalgebraic Structures=94 and their interactions. The aim = =20 is to produce a collection of papers on the subject from diverse =20 disciplines and areas of interest, including: =95 Algebras and Coalgebras =95 Hopf Algebras =95 Corings and Comodules =95 Bialgebroids & Hopf = Algebroids =95 Quantum and Lie Groups =95 Non-commutative = Geometry =95 Categorical Aspects =95 Applications = in Physics =95 Applications in Logic, Universal Algebra & Computer Science LEAD TECHNICAL EDITOR Jawad Abuhlail Department of Mathematics and Statistics, KFUPM, Dhahran, KSA TECHNICAL EDITOR Salah-Eddine Kabbaj Department of Mathematics and Statistics, KFUPM, Dhahran, KSA GUEST EDITORS Gabriella B=F6hm Research Institute for Particle and Nuclear Physics, Budapest, Hungary Tomasz Brzezinski Department of Mathematics, University of Wales, Swansea, UK Peter Gumm Department of Mathematics and Computer Science, Phillips Universit=E4t, Marburg, Germany Ross Street Mathematics Department, Macquarie University, New South Wales, Australia Robert Wisbauer Mathematisches Institut, Heinrich-Heine Universit=E4t, D=FCsseldorf, Germany PUBLICATION SCHEDULE Deadline for Submission: June 1st, 2008 Publication of Theme Issue: December 31st, 2008 SUBMISSION OF MANUSCRIPTS: Submissions are accepted for review with the understanding that they =20 have not been published or submitted elsewhere. All manuscripts will =20 undergo a strict refereeing process; acceptance for publication is based on two =20= positive reviews. Manuscripts prepared using LaTeX (2e) are strongly preferred. Authors =20= are encouraged to submit their papers electronically - in PDF format =20 as an email attachment - to: Dr. Bassam M. El Ali, Managing Editor The Arabian Journal of Science and Engineering King Fahd University of Petroleum & Minerals KFUPM P. O. Box 5033, Dhahran 31261 Saudi Arabia Phone: (+966) 3 860 5418 Fax: (+966) 3 860 5458 E-mail: ajse@kfupm.edu.sa Webpage: http://www.kfupm.edu.sa/publications/ajse/ From rrosebru@mta.ca Fri Aug 31 17:02:14 2007 -0300 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 31 Aug 2007 17:02:14 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1IRCZL-0000CP-A2 for categories-list@mta.ca; Fri, 31 Aug 2007 16:54:15 -0300 Mime-Version: 1.0 (Apple Message framework v752.3) Content-Transfer-Encoding: 7bit Message-Id: <91F61AA1-C252-4B41-9FE4-BAF9540C4AC3@pps.jussieu.fr> Content-Type: text/plain; charset=US-ASCII; delsp=yes; format=flowed To: categories@mta.ca From: Pierre-Louis Curien Subject: categories: Journees Jean-Yves Girard Date: Fri, 31 Aug 2007 16:27:45 +0200 Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 2 This is the last announcement for the **** Journees Jean-Yves Girard **** http://www-lipn.univ-paris13.fr/jyg60/index-fr.php 10-12 September, IHP, Paris The final programme is now available on the site. On-line (free but obligaotry) registration is open (on the site) until Tuesday, September 5. Best regards, Pierre-Louis Curien From rrosebru@mta.ca Wed Dec 5 19:51:54 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 05 Dec 2007 19:51:54 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J03nV-0007Ja-JV for categories-list@mta.ca; Wed, 05 Dec 2007 19:36:59 -0400 To: LICS List From: Kreutzer + Schweikardt Subject: categories: LICS Newsletter 112 Date: Wed, 5 Dec 2007 16:40:08 +0100 (CET) Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 3 Newsletter 112 December 1, 2007 ******************************************************************* * Past issues of the newsletter are available at http://www.informatik.hu-berlin.de/lics/newsletters/ * Instructions for submitting an announcement to the newsletter can be found at http://www.informatik.hu-berlin.de/lics/newsletters/inst.html * To unsubscribe, send an email with "unsubscribe" in the subject line to lics@informatik.hu-berlin.de ******************************************************************* TABLE OF CONTENTS * ANNOUNCEMENTS Bulletin of the EATCS now Open Access * AWARDS CAV Award - Call for Nominations Ackermann Award 2007 Ackermann Award 2008 - Call for Nominations * BOOK ANNOUNCEMENTS The Calculus of Computation - Aaron R. Bradley and Zohar Manna * JOURNALS AND SPECIAL ISSUES JEAN-YVES GIRARD'S FESTSCHRIFT - TCS HYBRID LOGIC - Journal of Logic, Language and Information VISUAL LANGUAGES AND LOGIC - Journal of Logic, Language and Information * CONFERENCES AND WORKSHOPS AUTOMATA AND LOGIC - Call for Participation TIME 2008 - Call for Papers EWSCS 2008 - Call for Participation CiE 2008 - Call for Papers ROGICS 2008 - Call for Papers ICALP 2008 - Call for Papers DEON 2008 - Call for Papers ESSLLI 2008 - Call for Papers TCS 2008 - Call for Papers SEC 2008 - Call for Papers ABZ 2008 - Call for Papers * POSITIONS Fully funded PhD Studentships - Oxford Postdoctoral Research Fellow (3 posts) - Warwick Research positions at CNRS, France BULLETIN OF THE EATCS * Since 2003 all issues of the Bulletin of the EATCS, the European Association for Theoretical Computer Science, have been produced entirely electronically and made available on the web for members only. * The EATCS is now piloting the idea of Open Access for the Bulletin, in the spirit of best serving its research community. So, until further notice the volumes from no 79 onwards of the Bulletin of the EATCS will be available from http://www.eatcs.org/publications/bulletin.html CAV 2008 -- CAV Award http://www.princeton.edu/cav2008 * An annual award, called the CAV Award, has been established "For a specific fundamental contribution or a series of outstanding contributions to the field of Computer-Aided Verification." * The cited contribution(s) must have been made not more recently than five years ago and not over twenty years ago. In addition, the contribution(s) should not yet have received recognition via a major award, such as the ACM Turing or Kanellakis Awards. * The award of $10,000 will be granted to an individual or a group of individuals chosen by the Award Committee from a list of nominations. * The Award Committee may choose to make no award in a given year. * The CAV Award will be presented in an award ceremony at the Computer-Aided Verification Conference and a citation will be published in a journal of record (currently, Formal Methods in System Design). * Anyone, with the exception of members of the Award Committee, is eligible to receive the Award. * Call for Nominations for the CAV Award Anyone can submit a nomination except a member of the Steering Committee of the Computer-Aided Verification Conference, or someone whose term of service on the Award Committee ended within the last two years. The Award Committee can originate a nomination. * A nomination must state clearly the contribution(s), explain why the contribution is fundamental or the series of contributions is outstanding, and be accompanied by supporting letters and other evidence of worthiness. Nominations should include a proposed citation (up to 25 words), a succinct (100-250 words) description of the contribution(s), and a detailed statement to justify the nomination. * For the CAV Award in 2008, please send nominations to one of the following two Steering Committee members of the Computer-Aided Verification Conference, who will forward the nominations to the Chair of the Award Committee: - Edmund M. Clarke, CMU, emc (at) cs.cmu.edu - Robert P. Kurshan, Cadence, rkurshan (at) cadence.com * Nominations must be received by January 28, 2008. 2007 ACKERMANN AWARD OF THE EACSL * The Jury of the Ackermann Award has decided to give the 2007 Ackermann Awards to - Dietmar Berwanger RWTH Aachen (Advisor: Erich Graedel) http://mtc.epfl.ch/~dwb/ Thesis: Games and Logical Expressiveness - Stephane Lengrand Universite de Paris VII and University of St. Andrews (Advisors: Delia Kesner and Roy Dyckhoff) http://www.pps.jussieu.fr/~lengrand/ Thesis: Normalization and Equivalence in Proof Theory and Type Theory - Ting Zhang Stanford University (Advisor: Zohar Manna) http://theory.stanford.edu/~tingz/ Thesis: Arithmetic Integration of Decision Procedures * I would like to congratulate the recipients and their supervisors for their excellent theses. * The Jury consisted of S. Abramsky, J. van Benthem, B. Courcelle, M. Grohe, M. Hyland, J. Makowsky, D. Niwinski, A. Razborov. * The Award Ceremony took place during the CSL'07 Conference. http://www.inf.u-szeged.hu/~csl06/ * A detailed report is published in the CSL'07 Proceedings. I would like to thank all the Jury members for their work. ACKERMANN AWARD 2008 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR LOGIC IN COMPUTER SCIENCE Call for Nominations * Eligible for the 2008 Ackermann Award are PhD dissertations in topics specified by the EACSL and LICS conferences, which were formally accepted as PhD theses at a university or equivalent institution between 1.1.2006 and 31.12. 2007. * The deadline for submission is 15.3.2008. * Submission details are available at www.dimi.uniud.it/~eacsl/award.html www.cs.technion.ac.il/eacsl * The award consists of - a diploma, - an invitation to present the thesis at the CSL conference, - the publication of the abstract of the thesis and the laudation in the CSL proceedings, - travel support to attend the conference. * The 2008 Ackermann Award will be presented to the recipients at the annual conference of the EACSL (CSL'08). * The jury consists of seven members: - The president of EACSL, J. Makowsky (Haifa); - The vice-president of EACSL, D. Niwinski (Warsaw); - One member of the LICS organizing committee, G. Plotkin (Edinburgh); - J. van Benthem (Amsterdam) - B. Courcelle (Bordeaux); - M. Grohe (Berlin); - M. Hyland (Cambridge); - A. Razborov (Moscow and Princeton). - possibly one more member to be appointed by the EACSL Board * The jury is entitled to give more than one award per year. * The previous Ackermann Award recipients were: 2005: Mikolaj Bojanczyk, Konstantin Korovin, Nathan Segerlind; 2006: Stefan Milius and Balder ten Cate; 2007: Dietmar Berwanger, Stephane Lengrand and Ting Zhang. * For the three years 2007-2009, the Award is sponsored by Logitech, S.A., Romanel, Switzerland, the worlds leading provider of personal peripherals. BOOK ANNOUNCEMENT: The Calculus of Computation: Decision Procedures with Applications to Verification by Aaron R. Bradley and Zohar Manna Springer 2007, 366 Pages ISBN: 978-3-540-74112-1 * Written for graduate and advanced undergraduate students, this textbook introduces computational logic from the foundations of first-order logic to state-of-the-art decision procedures for arithmetic, data structures, and combination theories. It also presents a logical approach to engineering correct software. Verification exercises, supported by free software, develop the reader's facility in specifying and verifying software using logic. The treatment of verification concludes with an introduction to the static analysis of software. * Part I: Foundations 1. Propositional Logic 2. First-Order Logic 3. First-Order Theories 4. Induction 5. Program Correctness: Mechanics 6. Program Correctness: Strategies Part II: Algorithmic Reasoning 7. Quantified Linear Arithmetic 8. Quantifier-Free Linear Arithmetic 9. Quantifier-Free Equality and Data Structures 10. Combining Decision Procedures 11. Arrays 12. Invariant Generation 13. Further Reading * Further information can be found at http://www.springer.com/978-3-540-74112-1 http://theory.stanford.edu/~arbrad/pivc JEAN-YVES GIRARD'S FESTSCHRIFT Theoretical Computer Science Call for papers http://www.pps.jussieu.fr/~laurent/girard60/ * In honour of Jean-Yves Girard on the occasion of his 60th birthday year, a Festschrift will be published as a special issue of Theoretical Computer Science, where the "Linear Logic" paper was published twenty years ago. * The Festschrift follows the two events organized in Siena (http://www.unisi.it/eventi/LOGIC/) and in Paris (http://www-lipn.univ-paris13.fr/jyg60/) this year. * Submissions for this special issue are welcome from all the participants to the workshops as well as from other contributors. * Title and short abstract submission: 20 October 2007 Deadline for submissions: 31 December 2007 * Guest editors: Thomas Ehrhard (thomas.ehrhard@pps.jussieu.fr) Claudia Faggian (claudia.faggian@pps.jussieu.fr) Olivier Laurent (olivier.laurent@pps.jussieu.fr) * More details at: http://www.pps.jussieu.fr/~laurent/girard60/ SPECIAL ISSUE ON HYBRID LOGIC Journal of Logic, Language and Information Call for papers http://akira.ruc.dk/~torben/HyLo1.TXT * Scope. Hybrid logic is a branch of modal logic allowing direct reference to worlds/times/states. It is easy to justify interest in hybrid logic on applied grounds, because of the usefulness of the additional expressive power. In addition, hybrid-logical machinery improves the behaviour of the underlying modal formalism. For example, it becomes far simpler to formulate modal tableau, resolution, and natural deduction in hybrid logic, and completeness and interpolation results can be proved of a generality that is not available in orthodox modal logic. Topics of interest include not only standard hybrid-logical machinery like nominals, satisfaction operators, and the downarrow binder, but generally extensions of modal logic that increase its expressive power. * Submission deadlines: March 1, 2008. * Guest editors: Torben Bra=C3=BCner and Thomas Bolander * For further information see the URL above. JOURNAL OF LOGIC, LANGUAGE AND INFORMATION (JOLLI) SPECIAL ISSUE ON VISUAL LANGUAGES AND LOGIC Guest Editors: Philip Cox, Dalhousie University; Andrew Fish and John Howse, University of Brighton. CALL FOR PAPERS * Diagrams of one sort or another have always been used as aids to abstract reasoning. Although many are informal mnemonics, reminding their authors about structures and relationships they have observed or deduced, considerable research effort has been expended on formalising graphical notations so that they may play a more central role in the application of logic to problems. While early work concentrated on diagrammatic representations of logic as a more intuitive or revealing paper-based replacement for textually represented logic, research in this area now mostly involves notations specifically designed for computer implementation either as computational models or interface languages. Examples include relational and existential graphs (C.S. Peirce), conceptual graphs (J.F. Sowa), various flavours of semantic networks such as conceptual dependency graphs (R. Schank), graphical deduction systems such as clause interconnectivity graphs (S. Sickel), Venn diagrams, Euler diagrams, constraint diagrams, and visual logic programming languages. * Following the success of the 2007 Workshop on Visual Languages and Logic (VLL 2007) (http://vivid.cs.dal.ca/VLL), we are soliciting, for a Special Issue of JOLLI, papers in which the primary focus is research at the intersection of logic and visual languages. In particular, we invite VLL 2007 authors to submit updated and expanded versions of their papers. * Topics of interest include, but are not limited to: Graphical notations for logics (either classical or non-classical, such as first or higher order logic, temporal logic, description logic, independence friendly logic, spatial logic); Diagrammatic reasoning; Theorem proving; Formalisation (syntax, semantics, reasoning rules); Expressiveness of visual logics; Visual logic programming languages; Visual specification languages; Applications; Tool support for visual logics. * If you intend to submit a paper, please email a title, abstract and keywords to VLL@cs.dal.ca by November 30, 2007. This information will be used to assign referees in advance of the paper deadline. Your paper may be up to 30 pages, must conform to the JOLLI style (see following URL), and be emailed as a PDF to VLL@cs.dal.ca by January 31, 2008. Note that although PDF is not the required format for the final copies of accepted papers, it is the most convenient for reviewing. * Important dates: - title, abstract and keywords by November 3 - paper submission by January 31, 2008. * If you have any questions about this Special Issue, please email VLL@cs.dal.ca. WORKSHOP ON AUTOMATA AND LOGIC - HISTORY AND PERSPECTIVES ON THE OCCASION OF THE 60TH BIRTHDAY OF WOLFGANG THOMAS Final Call for Participation December 14 - 15, 2007, Aachen, Germany http://www-i2.informatik.rwth-aachen.de/Events/WAL07/ * The workshop, which is held on the occasion of Wolfgang Thomas's 60th birthday, is devoted to the theory of automata and its connection to mathematical logic, verification, and games. The list of speakers is: - Bruno Courcelle (Bordeaux, France) - Erich Gr=C3=A4del (Aachen, Germany) - Martin Grohe (Berlin, Germany) - Joost-Pieter Katoen (Aachen, Germany) - Jean-Eric Pin (Paris, France) - Denis Th=C3=A9rien (Montreal, Canada) - Moshe Vardi (Houston, USA) - Igor Walukiewicz (Bordeaux, France) - Thomas Wilke (Kiel, Germany) * The workshop will take place in Aachen, December 14 - 15, 2007, at the premises of the Computer Science Department of RWTH Aachen. It will start on Friday, December 14, in the early afternoon, and will finish on Saturday, December 15, around noon. There is no registration fee, but registration is mandatory via the workshop homepage. * The workshop is sponsored by Deutsche Forschungsgemeinschaft, Gesellschaft f=C3=BCr Informatik (Fachgruppen Automaten und formale Sprachen sowie Logik in der Informatik), IPA (Instituut voor Programmatuurkunde en Algoritmiek), and RWTH Aachen. * Local organizers: Joost-Pieter Katoen, Thomas Noll (Aachen). TIME 2008 - 15TH INTERNATIONAL SYMPOSIUM ON TEMPORAL REPRESENTATION AND REASONING Call for papers Montreal, Canada, June 16-18, 2008 http://www.time2008.org * TIME 2008 aims to bring together researchers from distinct research areas involving the management of temporal data as well as the reasoning about temporal aspects of information. This unique and well-established event further has as its objectives to bridge theoretical and applied research, as well as to serve as an interdisciplinary forum for exchange among researchers from the areas of artificial intelligence, database management, logic and verification, and beyond. TIME 2008 encompasses three tracks, but has a single program committee. The conference will span three days, and will be organized as a combination of technical paper presentations, poster sessions, and keynote talks. * Topics that fit the interests of the symposium include those of the following tracks (see details in http://www.time2008.org) Track 1: Temporal Representation and Reasoning in AI Track 2: Temporal Database Management Track 3: Temporal Logic and Verification in Computer Science * Submitted papers will be refereed by at least three reviewers for quality, correctness, originality, and relevance. Accepted papers will be presented at the symposium and included in the proceedings, which will be published by the IEEE Computer Society Press. * Important dates: paper submission: January 11 2008; Notification: February 26 2008. 13th ESTONIAN WINTER SCHOOL IN COMPUTER SCIENCE (EWSCS '08) Call for Participation Palmse, Estonia, 2-7 March 2008 http://cs.ioc.ee/ewscs/2008/ * EWSCS is a series of regional-scope international winter schools held annually in Estonia. The main objective of EWSCS is to expose Estonian, Baltic, and Nordic graduate students in computer science (but also interested students from elsewhere) to frontline research topics usually not covered within the regular curricula. The subject of the schools is general computer science, with a bias towards theory, this comprising both algorithms, complexity and models of computation, and semantics, logic and programming theory. The working language of the schools is English. * The schools' scientific programme consists of short courses by renowned specialists and a student session. The course list for EWSCS'08 is the following: - Nick Benton (Microsoft Research, Cambridge, UK): Modelling and Reasoning about State - David Harel (Weizmann Institute, Rehovot, Israel): Biological Systems as Reactive Systems - Eyal Kushilevitz (Technion, Haifa, Israel): Randomization Techniques for Secure Computation and Parallel Cryptography - Jos=C3=A9 Meseguer (Univ. of Illinois at Urbana-Champaign, USA): Specification, Verification and Programming in Rewriting Logic - Giuseppe Persiano (Universit=C3=A0 di Salerno, Italy): Zero Knowledge and the Construction of Secure Encryption Schemes The purpose of the student session is to give students an opportunity to present their own ongoing work (typically, thesis work) and get feedback. Registrants to EWSCS '08 are invited to propose short talks (20 min) or posters. The selection will be based on abstracts of 150-400 words. * Deadline for applications and submission of abstracts of student talks/posters: 18 Jan 2008. Notification of acceptance: 1 Feb 2008 CIE 2008 - COMPUTABILITY IN EUROPE 2008: LOGIC AND THEORY OF ALGORITHMS Call for Papers June 15-20, 2008, Athens, Greece http://www.cs.swan.ac.uk/cie08/ * The CiE Conference series is a network of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability in a broad sense. The 4th edition of CiE, CiE 2008, will bridge the gap from the logical methods of mathematical and meta-mathematical flavour to the applied and industrial questions that are involved in devising and choosing the right algorithms and analysing their effectiveness and efficiency. This will cover all areas of mathematical computability theory and theoretical computer science, but in particular decidability and complexity, the theory of programming languages, the notion of recursion as one of the central notions of computability theory, interaction and concurrency, and applications of logic to computer science. * Important dates: - Submission of papers: January 4, 2008 * Invited TUTORIAL speakers: John V Tucker (Swansea), Moshe Y Vardi (Houston, TX) * Invited PLENARY speakers: Keith Devlin (Stanford, CA), Rosalie Iemhoff (Utrecht), Antonina Kolokolova (Vancouver, BC), Janos Makowsky (Haifa), Dag Normann (Oslo), Prakash Panangaden (Montreal, QC), Christos Papadimitriou (Berkeley, CA), Jan van Leeuwen (Utrecht) & Jiri Wiedermann (Prague) * SPECIAL SESSIONS: - Algorithms in the history of mathematics (organised by Jens H=C3=B8yrup, Roskilde, and Karine Chemla, Paris) - Formalising mathematics and extracting algorithms from proofs (organised by Henk Barendregt, Nijmegen, and Monika Seisenberger, Swansea) - Higher-type recursion and applications (organised by Ulrich Berger, Swansea, and Dag Normann, Oslo) - Algorithmic game theory (organised by Elias Koutsoupias, Athens, and Bernhard von Stengel, London) - Quantum Algorithms and Complexity (organised by Viv Kendon, Leeds) - Biology and Computation (organised by Natasha Jonoska, Tampa FL, and Giancarlo Mauri, Milano) ROGICS 2008: INTERNATIONAL CONFERENCE ON RELATIONS, ORDERS AND GRAPHS=C2= =A0: INTERACTION WITH COMPUTER SCIENCE Call for Papers May 12-15, 2008 Mahdia, Tunisia http://www.rogics.com * Objectives Relational structures and particularly Ordered sets and Graphs are at the root of several branches in Mathematics and offer a wide range of challenging research problems. There are also the fundamental models in several applied sciences such as Computer science, Operation Research and Social Sciences. This creates a strong and dynamic interaction between theory and application.=C2=A0 The purpose of this conference is to highlight some of the major theoretical advances in the fields of Relations theory, Ordered sets and Graphs and to stress their role in Computer Science. ROGICS=E2=80=9908 also seeks to bring together researchers and scientists covering topics from both the Mathematics and Computer Sciences area. The wide scope of the conference should provide an excellent opportunity for sharing ideas and problems amongst specialists. * ROGICS=E2=80=9908 will also be the opportunity to honor Gerard Lopez and Maurice Pouzet: two mathematicians, with great scientific achievements and who dedicated part of their professional life to numerous students and had an influence on several mathematicians and research groups across North Africa. It is an opportunity to thank both of them. * Topics to be covered include, but are not limited to: Relation Theory Graph Theory Graph Algorithms Graph Drawing Ordered Sets Reconstruction and Morphology of Relations Decomposability Formal Concept Analysis Complexity Theory Computational Geometry Combinatorial algorithms Theoretical Computer Science Algorithms and Data Structures Distributed systems Real-time systems Communication protocols Software verification, validation and testing Coding Theory and Cryptography: Geometry and Arithmetic over Finite Fields * Call for Papers Authors are invited to submit original contributions by=C2=A0January 15th= , 2008. A volume and a CD made of the accepted papers will be distributed at the beginning of the conference. We are planning to publish the proceeding of the conference in a regular journal. A special issue of =E2=80=9CEuropean Journal of Combinatorics=E2=80=9D wi= ll be devoted to the theme of the conference. * Important Dates Submission January 15, 2008 Notification March 1, 2008 Final version April 1, 2008 Conference May 12-15, 2008 * Conference Chairmen Youssef Boudabbous (Sfax, Tunisia) and Nejib Zaguia (Ottawa, Canada) * Program Committee: R. Fraisse (Honorary chair), M. Aider (Algeria), A. Achour (Tunisia), H. Amara (Tunisia), S. Ben Yahia (Tunisia), G. Bochmann (Canada), A. Bondy (France), Y. Boudabbous (Tunisia), H. Chebli (Tunisia), B. Courcelle (France), F. De Montgolfier (France), C. Delhomm=C3=A9 (France), J. Diatta (France), R. Diestel (Germany), D. Duffus (USA), P. Flocchini (Canada), M. Habib (France), G. Hahn (Canada), P.=C2=A0Ille (France), A. Jaoua (Tunisia), C. Jard (France), G-V Jourdan (Canada), W. Kocay (Canada), C. Laflamme (Canada), D. Misane (Morocco), J-X. Rampon (France), I. Rosenberg (Canada), E. Salhi (Tunisia), E. San Juan (France), H. Si Kaddour (France), N. Santoro (Canada), N. Sauer (Canada), A. Smail (Algeria), P. Sol=C3=A9 (France), I. Stojmenovic (Canada), S. Thomasse (France), K. Trim=C3=A8che (Tunisia)= , N. Zaguia (Canada) * Confirmed Speakers=C2=A0: M. Aider (Algeria), S. Ben Yahia (Tunisia), A. Boussairi (Maroc), A. Bondy (France), B. Courcelle (France), F. De Montgolfier (France), C. Delhomm=C3=A9 (France), J. Diatta (France), R. Diestel (Germany), P. Flocchini (Canada), M. Habib (France), G. Hahn (Canada), P.=C2=A0Ille (France), A. Jaoua (Tunisia), C. Jard (France), G-V Jourdan (Canada), W. Kocay (Canada), C. Laflamme (Canada), D. Misane (Morocco), J-X. Rampon (France), I. Rosenberg (Canada), E. San Juan (France), N. Santoro (Canada), N. Sauer (Canada), A. Smail (Algeria), P. Sol=C3=A9 (France), I. Stojmenovic (Canada), S. Thomasse (France), R. Woodrow (Canada) * For more info: www.rogics.com=09Email: info@rogics.com ICALP 2008 - 35th INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING Call for Papers July 6-13, 2008, Reykjavik, Iceland http://www.ru.is/icalp08 * Following the successful experience of the last three editions, ICALP 2008 will complement the established structure of the scientific program based on Track A on Algorithms, Automata, Complexity and Games, and Track B on Logic, Semantics, and Theory of Programming, corresponding to the two main streams of the journal Theoretical Computer Science, with a special Track C on Security and Cryptography Foundations. Papers presenting original research on all aspects of theoretical computer science are sought. * Typical but not exclusive topics of interest are: Track A - Algorithms, Automata, Complexity and Games: - Algorithmic Aspects of Networks - Algorithmic Game Theory - Approximation Algorithms - Automata Theory - Combinatorics in Computer Science - Computational Biology - Computational Complexity - Computational Geometry - Data Structures - Design and Analysis of Algorithms - Internet Algorithmics - Machine Learning - Parallel, Distributed and External Memory Computing - Randomness in Computation - Quantum Computing Track B - Logic, Semantics, and Theory of Programming: - Algebraic and Categorical Models - Automata and Formal Languages - Emerging and Non-standard Models of Computation - Databases, Semi-Structured Data and Finite Model Theory - Principles of Programming Languages - Logics, Formal Methods and Model Checking - Models of Concurrent, Distributed, and Mobile Systems - Models of Reactive, Hybrid and Stochastic Systems - Program Analysis and Transformation - Specification, Refinement and Verification - Type Systems and Theory, Typed Calculi Track C - Security and Cryptography Foundations: - Cryptographic Notions, Mechanisms, Systems and Protocols - Cryptographic Proof Techniques, Lower bounds, Impossibilities - Foundations of Secure Systems and Architectures - Logic and Semantics of Security Protocols - Number Theory and Algebraic Algorithms (Primarily in - Cryptography) - Pseudorandomness, Randomness, and Complexity Issues - Secure Data Structures, Storage, Databases and Content - Security Modeling: Combinatorics, Graphs, Games, Economics - Specifications, Verifications and Secure Programming - Theory of Privacy and Anonymity - Theory of Security in Networks and Distributed Computing * Important dates (provisional): Paper submission: 10 February 2008; Notification: 9 April 2008 9th INTERNATIONAL CONFERENCE ON DEONTIC LOGIC IN COMPUTER SCIENCE (DEON'08) Call for Papers Luxembourg, 15-18 July, 2008 http://deon2008.uni.lu * The biennial DEON conferences are designed to promote interdisciplinary cooperation amongst scholars interested in linking the formal-logical study of normative concepts and normative systems with computer science, artificial intelligence, philosophy, organisation theory and law. In addition to these general themes, DEON2008 will encourage a special focus on the topic *Security and Trust*, encompassing applications in e-commerce as well as traditional areas of computer security. * General themes - the logical study of normative reasoning, including formal systems of deontic logic, defeasible normative reasoning, the logic of action, and other related areas of logic - the formal analysis of normative concepts and normative systems - the formal representation of legal knowledge - the formal specification of aspects of norm-governed multi-agent systems and autonomous agents, including (but not limited to) the representation of rights, authorisation, delegation, power, responsibility and liability - the formal specification of normative systems for the management of bureaucratic processes in public or private administration - applications of normative logic to the specification of database integrity constraints - normative aspects of protocols for communication, negotiation and multi-agent decision making * Specific Security and Trust themes: digital rights management, electronic contracts, including service level agreements and digital media licenses, authorization, access control, security policies, privacy policies, business processes, regulatory compliance * Important Dates - 11 January 2008: submission deadline - 22 February 2008: notification of acceptance 20TH EUROPEAN SUMMER SCHOOL IN LOGIC, LANGUAGE AND INFORMATION ESSLLI 2008 Monday August 4 - Friday August 15, 2008 Hamburg, Germany http://www.illc.uva.nl/ESSLLI2008/ Call for Papers * We are pleased to announce the Student Session of the 20th European Summer School in Logic, Language and Information to be held in Hamburg, Germany on August 4-15, 2008. * The aim of the Student Session is to give an opportunity to students at all levels (Bachelor-, Master- and PhD-students) to present and discuss their work in progress with a possibility to get feedback from senior researchers. Each year, 18 papers are selected for oral presentation and a number of others for poster presentation. * The programme committee invites submissions of papers for oral and poster presentation and for appearance in the proceedings. We welcome submissions with topics within the areas of Logic, Language and Computation. *** Submission deadline: 15 February 2008 *** * The ESSLLI Student Session encourages submissions from students at any level, undergraduates as well as postgraduates. Papers co-authored by non-students will not be accepted. The Student Session papers should describe original, unpublished work, completed or in progress, that demonstrates insight, creativity, and promise. No previously published papers should be submitted. * SUBMISSION Student authors are invited to submit a full paper up to 7 pages inclusive of references. Note that the length of the final version of the accepted papers will not be allowed to exceed 10 pages. The preferred formats of submissions are PostScript or PDF, although other formats will also be accepted. More submission details and all relevant information at: http://staff.science.uva.nl/~kbalogh/StuS13 * CONTACT Kata Balogh ESSLLI 2008 Student Session chair 5TH IFIP INTERNATIONAL CONFERENCE ON THEORETICAL COMPUTER SCIENCE (TCS-2008= ) First Announcement and Call for Papers http://www.aicanet.it/wcc2008/TCS2008cfp1.pdf * Held in conjunction with the 20th IFIP World Computer Congress September 7-10, 2008, Milano, Italy Conference Co-Chairs: Giorgio Ausiello, IT Giancarlo Mauri, IT Programme Co-Chairs: Track A: Juhani Karhum=C3=A4ki, FI Track B: Luke Ong, GB * Programme Committee: Track A: Algorithms, Complexity & Models of Computation Ricardo Baeza-Yates (Santiago), Marie-Pierre Beal (Paris),Harry Buhrman (Amsterdam), Xiaotie Deng (Hong Kong), Josep Diaz (Barcelona), Volker Diekert (Stuttgard), Manfred Droste (Leipzig), Ding-zhu Du (Dallas), Juraj Hromkovic (Zurich), Oscar Ibarra (Santa Barbara), Pino Italiano (Rome), Kazuo Iwama (Kyoto), Juhani Karhum=C3=A4ki (Turku, chair), Pekka Orponen (Helsinki), George Paun (Bucharest), Jiri Sgall (Prague), Alexander Shen (Moscow), Vijai Vazirani (Atlanta), Mikhail Volkov (Ekaterinburg) Track B: Logic, Semantics, Specification and Verification Rajeev Alur (Pennsylvania), Ulrich Berger (Swansea), Andreas Blass (Ann Arbor), Anuj Dawar (Cambridge), Mariangiola Dezani-Ciancaglini (Turin), Gilles Dowek (Paris), Peter Dybjer (Stockholm), Masami Hagiya (Tokyo), Martin Hofmann (Munich), Leonid Libkin (Edinburgh), Huimin Lin (Beijing), Stephan Merz (Nancy), Dale Miller (Paris), Eugenio Moggi (Genova), Anca Muscholl (Bordeaux), Luke Ong (Oxford, chair), Davide Sangiorgi (Bologna), Thomas Schwentick (Dortmund), Thomas Streicher (Darmstadt), P. S. Thiagarajan (Singapore), Wolfgang Thomas (Aachen) * Submission will be in two stages: a short abstract due on 8 February and the 12-page paper due on 15 February 2008. The results of the paper must be unpublished and not submitted for publication elsewhere, including journals and the proceedings of other symposia or workshops. Authors will be notified of acceptance or rejection via e-mail by 31 March. Full versions of accepted papers (camera-ready) must be written in English, and will be due by 22 April 2008. One author of each accepted paper should present it at the conference. * Scope and Topics TCS2008 will be composed of two distinct, but interrelated tracks: Track A on Algorithms, Complexity and Models of Computation, and Track B on Logic, Semantics, Specification and Verification. * Paper submission Papers presenting original research in conference topics are being sought. The proceedings will be published by SSBM (Springer Science and Business Media). Submissions, as well as final versions, are limited to 12 pages, in the final SSBM format. The instructions for preparing the papers can be downloaded from http://www.springeronline.com/sgw/cda/frontpage/0,11855,4-40492-0-0- or ftp://ftp.springer.de/pub/tex/latex/ifip/ . * Only electronic submissions will be accepted, via Track A: http://www.easychair.org/TCS2008-TrackA Track B: http://www.easychair.org/TCS2008-TrackB * The submission deadline, length limitations and formatting instructions are firm: any submissions that deviate from these may be rejected without further considerations. * IMPORTANT DATES: 8 February 2008: Abstract submission deadline 15 February 2008: 12-page paper submission deadline 31 March 2008: Notification of acceptance 7 April 2008: Copyright release submission deadline 22 April 2008: Camera-ready copy submission deadline * Organized by IFIP Technical Committee 1 (Foundations of Computer Science) and IFIP WG 2.2 (Formal Descriptions of Programming Concepts) in association with SIGACT and EATCS 23rd INTERNATIONAL INFORMATION SECURITY CONFERENCE (SEC 2008) Call for Papers http://sec2008.dti.unimi.it * The Twenty-third Conference on International Information Security Conference (SEC 2008) will take place on Milano Convention Centre, Milano, Italy from Monday, September 8 through Wednesday, September 10, 2008. * The conference seeks submissions from academia and industry presenting novel research on all theoretical and practical aspects of computer security, as well as case studies and implementation experiences. Papers should have practical relevance to the construction, evaluation, application, or operation of secure systems. Theoretical papers must make convincing argument for the practical significance of the results. * TOPICS of interest include, but are not limited to: - access control - accounting and audit - anonymity - applied cryptography - authentication - computer forensics - cryptographic protocols - database security - data protection - data/system integrity - digital rights management - electronic frauds - identity management - information warfare - intrusion detection - key management - law and ethics - peer-to-peer security - privacy-enhancing technology - secure location services - secure networking - security education - security management - smartcards - commercial and industry security - data and application security - inference/controlled disclosure - risk analysis and risk management - intellectual property protection - security in IT outsourcing - security for mobile code - trust management - trust models * PAPER SUBMISSIONS Submitted papers must not substantially overlap papers that have been published or that are simultaneously submitted to a journal or a conference with proceedings. Papers should be at most 15 pages including the bibliography and well-marked appendices (using 11-point font and reasonable margins on letter-size paper), and should be in single-column format. Committee members are not required to read the appendices, and so the paper should be intelligible without them. Submissions are to be made to the submission web site at http://sec2008.dti.unimi.it. Only pdf or postscript files will be accepted. Submissions not meeting these guidelines risk rejection without consideration of their merits. Papers must be received by the deadline of January 10, 2008. Authors of accepted papers must guarantee that their papers will be presented at the conference. * GENERAL CHAIRS Sabrina De Capitani di Vimercati, Universita' degli Studi di Milano, Italy Giulio Occhini, AICA, Italy * PROGRAM CHAIRS Sushil Jajodia, George Mason University, USA Pierangela Samarati, Universita' degli Studi di Milano, Italy * IMPORTANT DATES Paper Submission due: January 10, 2008 Acceptance notification: March 23, 2008 Final papers due: April 18, 2008 ABZ 2008 CONFERENCE September 16-18, 2008 BCS London Offices, Covent Garden, London, UK Call for Papers * Abstract State Machines (ASM), B and Z stand for three rigorous methods that share a common conceptual foundation and are widely used in both academia and industry for the design and analysis of hardware and software systems. This conference is dedicated to the cross-fertilization of these three related state-based and machine-based formal methods. The program spans from theoretical and methodological foundations to practical applications, emphasizing system engineering methods and tools that are distinguished by mathematical rigor and have proved to be industrially viable. A main goal of the conference is to contribute to the integration of accurate state- and machine-based system development methods, clarifying their commonalities and differences to better understand how to combine related approaches for accomplishing the various tasks in modelling, experimental validation, and mathematical verification of reliable high-quality hardware/software systems. * The conference will be articulated into a one-day common program of invited lectures and two days of contributed papers. * Although organized logistically as an integral event, editorial control of the joint conference remains vested in three separate programme committees, which will respectively determine its ASM, B and Z content, to be presented in parallel conference tracks with a schedule to allow the participants to switch between the sessions. The conference simultaneously incorporates the 15th International ASM Workshop, the 17th International Conference of Z Users and the 8th International Conference on the B Method. It will be preceded by a tutorial day and Verified Software Repository Network (VSR-net) workshop on Monday, September 15. * A case study for design and verification of a flash-based file system is suggested to the participants. Leo Freitas and Jim Woodcock will organize a series of intermediate workshops where those who decide to work on the problem can meet to enhance the collaborative aspect of the work. For details see: http://www.abz2008.org/ * The papers are planned to be published in a volume of Springer's LNCS series. Contributions are solicited on all aspects of the theory and applications of ASMs, B, Z and related approaches in software/hardware engineering, including the development of tools and industrial applications. * Two kinds of contributions are invited: 1. Research papers: full papers (not extended abstracts) of not more than 12 pages (in LNCS format), which have to be original, unpublished and not submitted elsewhere. Papers dealing with the case study are particularly welcome. 2. Short presentations of work in progress, industrial experience reports and tool demonstrations. An extended abstract of not more than 3 pages is expected and will be reviewed. The volume of accepted extended abstracts will be made available at the time of the conference on the website of the conference, a 1-page abstract of each presentation will be published in the Proceedings. * Conference Chair: Egon Boerger, University of Pisa, Italy * Program Chairs: Egon Boerger, University of Pisa, Italy (ASM) Michael Butler, University of Southampton, UK (B) Jonathan Bowen, London South Bank University, UK (Z) * Local Chair and Financial Chair: Paul Boca, London South Bank University, UK * Chair of the VSR day: Jim Woodcock, The University of York, UK * Venue: The conference will take place at the BCS London Offices, Davidson Building, 5 Southampton Street, Covent Garden, London, UK. The support of the British Computer Society, through the BCS Formal Aspects of Computing Science Specialist Group, in providing the venue and refreshments, is gratefully acknowledged. * Important dates: March 3, 2008: Submission of full papers. March 31,2008: Submission of extended abstracts for short presentations. April 14,2008: Communication about acceptance/rejection of submitted papers and extended abstracts. May 5, 2008: Camera-ready version of the accepted full papers and 1-page abstract for the short presentations. September 15, 2008: Tutorials and VSR-net workshop. September 16-18, 2008: Main ABZ 2008 conference. * Information on the procedure how to submit papers, to register, to reach London, weather conditions, etc., will be available in due time at the conference website under http://www.abz2008.org/ FULLY FUNDED PhD STUDENTSHIPS IN LOGICAL METHODS IN COMPUTER SCIENCE AT OXFORD * The Information Systems Research Group is offering fully-funded PhD positions in Oxford University's Computing Laboratory in Logical Methods in Computer Science. The students will work in finite model theory and connections to automata and databases. Further details of the Information Systems Research Group's work can be found at: http://db.zivny.cz/members.html * The studentships are fully funded *at EU fee levels* for three years from October 2008. Each includes a stipend of =C2=A312,600 per year as well as provision for travel to conferences. Students who are *not* from EU countries will need supplementary funding. Candidates must satisfy the usual requirements f= or doing a doctorate at Oxford. The positions require a student skilled in theoretical computer science. * For further information, contact Michael Benedikt http://web.comlab.ox.ac.uk/oucl/people/Michael.Benedikt.html * The deadline for applications is December 31, 2007. Interviews for qualified candidates will take place in January 2008. To apply you need to download the University's application form from http://www.admin.ox.ac.uk/postgraduate/apply/forms/. You will need to submit references, transcript, and a statement of research interests (in the slot marked ``research proposal') with your application. Submit the form to: Mrs Julie Sheppard Secretary for Graduate Studies, Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford, OX1 3QD, UK for e-mail queries:Julie.Sheppard@comlab.ox.ac.uk POSTDOCTORAL RESEARCH FELLOW (3 POSTS) Computer Science/Mathematics/Warwick Business School (Centre for Discrete Mathematics and its Applications) =C2=A325,134 - =C2=A332,796 pa Fixed-term contract for up to 2 years * The Centre for Discrete Mathematics and its Applications (DIMAP), partly funded in the first five years by a major EPSRC initiative to strengthen discrete mathematics in the UK, has currently three postdoctoral research fellowships and a number of PhD studentships. * We seek applications from individuals who wish to develop their research interests within the multidisciplinary environment of the Centre in the general areas of Discrete Mathematics, Theoretical Computer Science, and Mathematics of Operational Research. A separate postdoctoral research fellowship is available within ORMS of Warwick Business School, which has a more application orientation (reference number 59625 - 117 - see separate advertisement). * Candidates who wish to discuss aspects of these posts should contact one of the following people: - Prof Mike Paterson FRS (Computer Science, Director of the Centre): M.S.Paterson@warwick.ac.uk - Prof Artur Czumaj (Computer Science): A.Czumaj@warwick.ac.uk - Prof Colin Sparrow (Mathematics): G.C.Copeland@warwick.ac.uk - Prof Bo Chen (Warwick Business School): B.Chen@warwick.ac.uk * Applications should include a CV and a summary of research plans (2 pp max). * Click here for an application form. https://secure.admin.warwick.ac.uk/webjobs/jobs/research/job15644.html To receive a hard copy application pack, please contact Personnel Services, on +44(0)24 7652 3685 (24 hour answerphone), or by e-mail to Recruit@warwick.ac.uk. * An application form must be completed if you wish to be considered for this post. Please note that the hard copy application pack and the on-line application pack are the same. * Please quote job vacancy reference number 59407-117. * The closing date/time for applications is 17:30 (British time) on Friday 11 January 2008. * For further details on how to apply for a post at Warwick, the employee benefits that we offer, information on Warwick people, what it is like working at Warwick, and more, please see our jobs introduction page. * The university values diversity. RESEARCH POSITIONS AT CNRS CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE, FRANCE National Scientific Research Center * Positions are not reserved to French citizens. (And they will not concern only Logic in Computer Science) * Since they are research positions without teaching duties, speaking French is not required, but it is assumed that researchers hired will learn French. * See the CNRS relevant web page in English. http://www2.cnrs.fr/en/352.htm * Those people interested should contact the French Laboratory (CNRS is NOT a Laboratory) to which they intend to apply and NOT the author of this note (B. Courcelle, Bordeaux, courcell@labri.fr) unless they plan to apply for a position at LaBRI. From rrosebru@mta.ca Wed Dec 5 19:51:54 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 05 Dec 2007 19:51:54 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J03ld-000735-H3 for categories-list@mta.ca; Wed, 05 Dec 2007 19:35:01 -0400 MIME-Version: 1.0 Content-Type: text/plain;charset=iso-8859-1 Content-Transfer-Encoding: quoted-printable Subject: categories: ICALP 2008: Second Call for Papers Date: Wed, 5 Dec 2007 10:18:10 -0000 From: "Icalp08" To: , Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 4 *** We apologize for multiple postings **** HTML version of the CFP: http://www.ru.is/icalp08/cfp.html ___________________________________________________________________ CALL FOR PAPERS - ICALP'08 35th International Colloquium on Automata, Languages and Programming July 6-13, 2008, Reykjavik, Iceland http://www.ru.is/icalp08 =20 ___________________________________________________________________ The 35th International Colloquium on Automata, Languages and Programming, the main conference and annual meeting of the European Association for Theoretical Computer Science EATCS will take place from the 6th to the 13th of July 2008 in Reykjavik, Iceland. The main conference will take place from the 7th till the 11th of July, and will be preceded and followed by 13 co-located events. (See http://www.ru.is/icalp08/workshops.html for the list of events affiliated with ICALP 2008.) In addition, the ETACS award 2008 and the Goedel prize 2008 will be awarded at the conference. Following the successful experience of the last three editions, ICALP 2008 will complement the established structure of the scientific program based on Track A on Algorithms, Automata, Complexity and Games, and Track B on Logic, Semantics, and Theory of Programming, corresponding to the two main streams of the journal Theoretical Computer Science, with a special Track C on Security and Cryptography Foundations The aim of Track C is to allow a deeper coverage of a particular topic, to be specifically selected for each year's edition of ICALP on the basis of its timeliness and relevance for the theoretical computer science community. Papers presenting original research on all aspects of theoretical computer science are sought. Typical but not exclusive topics of interest are: Track A - Algorithms, Automata, Complexity and Games: * Algorithmic Aspects of Networks * Algorithmic Game Theory * Approximation Algorithms * Automata Theory * Combinatorics in Computer Science * Computational Biology * Computational Complexity * Computational Geometry * Data Structures * Design and Analysis of Algorithms * Internet Algorithmics * Machine Learning * Parallel, Distributed and External Memory Computing * Randomness in Computation * Quantum Computing Track B - Logic, Semantics, and Theory of Programming: * Algebraic and Categorical Models * Automata and Formal Languages * Emerging and Non-standard Models of Computation * Databases, Semi-Structured Data and Finite Model Theory * Principles of Programming Languages * Logics, Formal Methods and Model Checking * Models of Concurrent, Distributed, and Mobile Systems * Models of Reactive, Hybrid and Stochastic Systems * Program Analysis and Transformation * Specification, Refinement and Verification * Type Systems and Theory, Typed Calculi Track C - Security and Cryptography Foundations: * Cryptographic Notions, Mechanisms, Systems and Protocols * Cryptographic Proof Techniques, Lower bounds, Impossibilities * Foundations of Secure Systems and Architectures * Logic and Semantics of Security Protocols * Number Theory and Algebraic Algorithms (Primarily in Cryptography) * Pseudorandomness, Randomness, and Complexity Issues * Secure Data Structures, Storage, Databases and Content * Security Modeling: Combinatorics, Graphs, Games, Economics * Specifications, Verifications and Secure Programming * Theory of Privacy and Anonymity * Theory of Security in Networks and Distributed Computing * Quantum Cryptography and Information Theory SUBMISSION GUIDELINES Authors are invited to submit an extended abstract of no more than 12 pages in LNCS style presenting original research on the theory of Computer Science. Submissions should indicate to which track (A, B, or C) the paper is submitted. No simultaneous submission to other publication outlets (either a conference or a journal) is allowed. The proceedings will be published in the Lecture Notes in Computer Science Series by Springer-Verlag. It is recommended that submissions adhere to the specified format and length. Submissions that are clearly too long may be rejected immediately. Additional material intended for the referee but not for publication in the final version - for example details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. Submissions to ICALP 2008 are now open. To submit a paper to the conference, please visit the URL http://www.ru.is/icalp08/submissions.html. INVITED SPEAKERS (Preliminary list) * Ran Canetti (IBM T.J. Watson Research Center and MIT, USA) * Bruno Courcelle (Labri, Universite Bordeaux, France) * Javier Esparza (Technische Universitaet Muenchen, Germany) * Muthu Muthukrishnan (Google, USA) * Peter Winkler (Dartmouth, USA) IMPORTANT DATES * Submission: 23:59 GMT, February 10, 2008. * Notification: April 9, 2008 * Final version due: April 30, 2008 PROGRAM COMMITTEE Track A * Michael Bender (State Univ of New York at Stony Brook, USA) * Magnus Bordewich (Durham University, UK) * Peter Bro Miltersen (Aarhus University, Denmark) * Lenore Cowen (Tufts University, USA) * Pierluigi Crescenzi (Universita' di Firenze, Italy) * Artur Czumaj (University of Warwick, UK) * Edith Elkind (University of Southampton, UK) * David Eppstein (University of California at Irvine, USA) * Leslie Ann Goldberg (University of Liverpool, UK) (chair) * Martin Grohe (Humboldt-Universitaet zu Berlin, Germany) * Giuseppe Italiano (Universita' di Roma "Tor Vergata", Italy) * Christos Kaklamanis (University of Patras, Greece) * Michael Mitzenmacher (Harvard University, USA) * Ian Munro (University of Waterloo, Canada) * Ryan O'Donnell (Carnegie Mellon University, USA) * Dana Ron (Tel-Aviv University, Israel) * Tim Roughgarden (Stanford University, US) * Christian Scheideler (Technische Universitaet Muenchen, Germany) * Christian Sohler (University of Paderborn, Germany) * Luca Trevisan (University of California at Berkeley, USA) * Berthold Vocking (RWTH Aachen University, Germany) * Gerhard Woeginger (Eindhoven University of Technology, the = Netherlands) Track B * Parosh Abdulla (Uppsala University, Sweden) * Luca de Alfaro (University of California, Santa Cruz, USA * Christel Baier (Technische Universitaet Dresden, Germany) * Giuseppe Castagna (Universite Paris 7, France) * Rocco de Nicola (Universita' di Firenze, Italy) * Javier Esparza (Technische Universitaet Muenchen, Germany) * Marcelo Fiore (University of Cambridge, UK) * Erich Graedel (RWTH Aachen, Germany) * Jason Hickey (California Institute of Technology, USA) * Martin Hofmann (Ludwig-Maximilians-Universitdt M|nchen, Germany) * Hendrik Jan Hoogeboom (Leiden University, NL) * Radha Jagadeesen (DePaul University, USA) * Madhavan Mukund (Chennai Mathematical Institute, India) * Luke Ong (Oxford University, UK) * Dave Schmidt (Kansas State University, USA) * Philippe Schnoebelen (ENS Cachan, France) * Igor Walukiewicz (Labri, Universite Bordeaux, France) (chair) * Mihalis Yannakakis (Columbia University, USA) * Wieslaw Zielonka (Universite Paris 7, France) Track C * Christian Cachin (IBM Research Zurich, CH) * Jan Camenisch (IBM Research Zurich, CH) * Ivan Damgaard, (Aarhus University, Denmark) (chair) * Stefan Dziembowski ((Universita' di Roma "La Sapienza", Italy) * Dennis Hofheinz (CWI Amsterdam, the Netherlands) * Susan Hohenberger (Johns Hopkins University, USA) * Yuval Ishai (Technion Haifa, Israel) * Lars Knudsen (DTU Copenhagen, Denmark) * Arjen Lenstra (EPFL Lausanne, CH) * Anna Lysyanskaya (Brown University, USA) * Rafael Pass (Cornell University, USA) * David Pointcheval (ENS Paris, France) * Dominique Unruh (Saarland University, Germany) * Serge Vaudenay (EPFL Lausanne, CH) * Bogdan Warinschi (Bristol University, UK) * Douglas Wikstroem (KTH Stockholm, Sweden) * Stefan Wolf (ETH Zurich, CH) ORGANIZING COMMITTEE: ********************* Luca Aceto Magnus M. Halldorsson Anna Ingolfsdottir CONTACT ADDRESSES: ****************** For further information see: http://www.ru.is/icalp08/ From rrosebru@mta.ca Thu Dec 6 10:52:56 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Thu, 06 Dec 2007 10:52:56 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J0I0R-0000Su-I2 for categories-list@mta.ca; Thu, 06 Dec 2007 10:47:15 -0400 Date: Thu, 6 Dec 2007 13:02:11 +0100 From: Jiri Rosicky To: categories@mta.ca Subject: categories: research positions MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-2 Content-Disposition: inline Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 5 Eduard Cech center had been established in 2005 as the national research center focusing its attention to interactions between algebra, geometry, and logic (and their applications in cryptology, computer science, etc.). It is jointly operated by mathematicians from Masaryk University in Brno, Charles University in Prague and Academy of Sciences of the Czech Republic, with offices both in Brno and Prague. The Center invites applications for several research positions commencing during the year 2008 at the date depending on mutual agreement. The positions are initially for one year with a possibility of extension at most until the end of the year 2009. The candidates must be recent PhD's that obtained their degree not earlier than 2 years before the beginning of their contract with the Eduard Cech Center. Candidates should submit a letter of application accompanied by a CV, list of publications and an outline of their research project to Professor Jan Slovak (slovak@muni.cz) not later than January 20, 2008. They should also arrange for at least 2 letters of recommendation (one can be from a Czech mathematician) to be mailed directly to slovak@muni.cz before January 20, 2008. The successful applicants will be notified as soon as possible but not later than March 15, 2008. Further information about the Eduard Cech Center can be found at http://ecc.sci.muni.cz From rrosebru@mta.ca Thu Dec 6 10:52:56 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Thu, 06 Dec 2007 10:52:56 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J0Hzf-0000KQ-M3 for categories-list@mta.ca; Thu, 06 Dec 2007 10:46:27 -0400 Date: Thu, 6 Dec 2007 11:10:21 -0000 (UTC) Subject: categories: For information: From: tporter@informatics.bangor.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: 6 Dear All, This press release from the Max Planck institute from some weeks ago, may be of general interest given past discussions. http://www.mpg.de/english/illustrationsDocumentation/documentation/pressR= eleases/2007/pressRelease20071022/index.html Happy Christmas Tim --=20 Gall y neges e-bost hon, ac unrhyw atodiadau a anfonwyd gyda hi, gynnwys deunydd cyfrinachol ac wedi eu bwriadu i'w defnyddio'n unig gan y sawl y cawsant eu cyfeirio ato (atynt). Os ydych wedi derbyn y neges e-bost hon trwy gamgymeriad, rhowch wybod i'r anfonwr ar unwaith a dil=EBwch y neges. Os na fwriadwyd anfon y neges atoch chi, rhaid i chi beidio =E2 defnyddio, cadw neu ddatgelu unrhyw wybodaeth a gynhwysir ynddi. Mae unrhyw farn neu safbwynt yn eiddo i'r sawl a'i hanfonodd yn unig ac nid yw o anghenraid yn cynrychioli barn Prifysgol Bangor. Nid yw Prifysgol Bangor yn gwarantu bod y neges e-bost hon neu unrhyw atodiadau yn rhydd rhag firysau neu 100% yn ddiogel. Oni bai fod hyn wedi ei ddatgan yn uniongyrchol yn nhestun yr e-bost, nid bwriad y neges e-bost hon yw ffurfio contract rhwymol - mae rhestr o lofnodwyr awdurdodedig ar gael o Swyddfa Cyllid Prifysgol Bangor. www.bangor.ac.uk (YCYG) This email and any attachments may contain confidential material and is solely for the use of the intended recipient(s). If you have received this email in error, please notify the sender immediately and delete this email. If you are not the intended recipient(s), you must not use, retain or disclose any information contained in this email. Any views or opinions are solely those of the sender and do not necessarily represent those of Bangor University. Bangor University does not guarantee that this email or any attachments are free from viruses or 100% secure. Unless expressly stated in the body of the text of the email, this email is not intended to form a binding contract - a list of authorised signatories is available from the Bangor University Finance Office. www.bangor.ac.uk (SEECS) From rrosebru@mta.ca Thu Dec 6 10:52:56 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Thu, 06 Dec 2007 10:52:56 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J0Hyu-0000E7-EZ for categories-list@mta.ca; Thu, 06 Dec 2007 10:45:40 -0400 Mime-Version: 1.0 (Apple Message framework v752.3) Content-Type: text/plain; charset=US-ASCII; delsp=yes; format=flowed Content-Transfer-Encoding: 7bit From: Pierre-Louis Curien Subject: categories: Postodoc program in Paris (Foundation SMP) Date: Thu, 6 Dec 2007 09:30:36 +0100 To: categories@mta.ca Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 7 Dear colleagues, The Foundation Sciences Mathematiques de Paris www.sciencesmaths-paris.fr that covers all fields of mathematics as well as (theoretical) computer science, launches its 2008 programs, including an attractive research chair and a postdoc programme. Applications that are particularly suited for one of the two research labs of the Foundation (LIAFA and PPS: www.liafa.jussieu.fr and www.pps.jussieu.fr) and possibly for one of the research teams at INRIA Rocquencourt (which has an agreement with the foundation) are welcome. The deadline for application is **** January 7, 2008 **** The application procedure is as indicated on the website. But I can only highly recommend that potential candidates take prior contacts with a member of the hosting laboratory. Only candidates with a clear research fit, and a high research profile may have a chance to win this tough competition, given its broad scope! Dion't hesitate to contact me or one of my colleages in Paris 7 University for further details or advice. Best regards, Pierre-Louis From rrosebru@mta.ca Thu Dec 6 16:05:26 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Thu, 06 Dec 2007 16:05:26 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J0Msc-0001DI-SV for categories-list@mta.ca; Thu, 06 Dec 2007 15:59:31 -0400 Date: Thu, 06 Dec 2007 20:34:34 +0100 From: Luigi Santocanale MIME-Version: 1.0 To: categories@mta.ca Subject: categories: Modal Fixpoint Logics, Amsterdam March 25-27, 2008 Content-Type: text/plain; charset=ISO-8859-1; format=flowed Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 8 [Apologies for multiple copies] Call for contributions. Workshop on MODAL FIXPOINT LOGICS http://staff.science.uva.nl/~yde/mfl to be held at the Institute of Logic, Language, and Computation, Amsterdam, March 25-27 2008. Modal fixpoint logics constitute a research field of considerable interest, not only because of their many applications, but also because of their rich logical/mathematical theory. Systems such as LTL, PDL, CTL, and the modal mu-calculus, originate from computer science, and are for instance applied in the theory of program specification and verification. The richness of their theory stems from the deep connections with various fields in logic, mathematics, and theoretical computer science, such as lattices and universal (co-)algebra, modal logic, automata, and game theory. Large areas of the theory of modal fixpoint logics, in particular the connection with the theory of automata and games, have been intensively investigated and are by now are well understood. Nevertheless, there are still many aspects that are less explored. This applies in particular to the model theory, intended as the study of a logic as a function of classes of models, the proof theory, the algebraic logic, duality theory in the spirit of Stone/Priestly duality, and the relation to the theory of ordered sets as grounding the concept of "least fixpoint". The aim of the workshop is to bring together researchers from various backgrounds, in particular, computer scientists and pure logicians, who share an interest in the area. The invited talks together will represent an overview of the richness of the theory of modal fixpoint logics. While most of the available time will be devoted to the invited talks, there will be some opportunity for contributed talks as well. We invite contributed talks on all aspects of fixpoint logics, including their proof theory, model theory, algebraic aspects, connections with automata and games, and algorithmic issues. However, talks that focus on the logical theory of modal fixpoint logics will be given preference. Researchers interested in giving a contributed talk should send by February 1, 2008 a short abstract (one page at most, in pdf format) describing the content of their contribution to Luigi Santocanale (luigi.santocanale@lif.univ-mrs.fr). Acceptance of presentations will be notified by February 11, 2008. Important dates: 1/02/2008 Submission of abstracts 11/02/2008 Notification of acceptance 25-27/03/2008 Workshop Invited speakers: Marcello Bonsangue, Leiden Johan van Benthem, Amsterdam Dietmar Berwanger, Aachen Giovanna D'Agostino, Udine Erich Graedel (to be confirmed), Aachen Dexter Kozen (to be confirmed), Cornell Giacomo Lenzi, Pisa Damian Niwinski, Warszawa Colin Stirling, Edinburgh Thomas Studer, Bern Albert Visser, Amsterdam Igor Walukiewicz, Bordeaux Thomas Wilke (to be confirmed), Kiel --=20 Luigi Santocanale LIF/CMI Marseille T=E9l: 04 91 11 35 74 http://www.cmi.univ-mrs.fr/~lsantoca/ Fax: 04 91 11 36 02 =09 From rrosebru@mta.ca Mon Dec 10 21:38:10 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 10 Dec 2007 21:38:10 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J1ts4-0003SX-GW for categories-list@mta.ca; Mon, 10 Dec 2007 21:25:16 -0400 Date: Mon, 10 Dec 2007 16:52:44 +0100 From: Lutz Schroeder MIME-Version: 1.0 To: categories Subject: categories: Internal iteration 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: 9 Here's another one of these internal/external questions: the fact that an object N with structure map a: N + 1 -> N in a topos is an NNO can be expressed by axioms ALL d: B + 1 -> B. EX! f: N -> B. f a =3D d (f + 1) for every object B, where the quantifiers are external, i.e. range over all morphisms. Does it follow that these formulas hold also internally, i.e. in the internal logic of the topos? (The universal quantifier implicit in the EX! can, of course, be internalised, as a is an isomorphism by Lambek's lemma. I mean the outer universal quantifier for = d.) Thanks, Lutz Schr=F6der --=20 ------------------------------------------------------------------ PD Dr. Lutz Schr=F6der office @ Universit=E4t Bremen: Senior Researcher Cartesium 2.051 Safe and Secure Cognitive Systems Enrique-Schmidt-Str. 5 DFKI-Lab Bremen FB3 Mathematik - Informatik Robert-Hooke-Str. 5 Universit=E4t Bremen D-28359 Bremen P.O. Box 330 440 D-28334 Bremen phone: (+49) 421-218-64216 Fax: (+49) 421-218-9864216 mail: Lutz.Schroeder@dfki,de www.dfki.de/sks/staff/lschrode ------------------------------------------------------------------ ------------------------------------------------------------- Deutsches Forschungszentrum f=FCr K=FCnstliche Intelligenz GmbH Firmensitz: Trippstadter Strasse 122, D-67663 Kaiserslautern Gesch=E4ftsf=FChrung: Prof. Dr. Dr. h.c. mult. Wolfgang Wahlster (Vorsitzender) Dr. Walter Olthoff Vorsitzender des Aufsichtsrats: Prof. Dr. h.c. Hans A. Aukes Amtsgericht Kaiserslautern, HRB 2313 ------------------------------------------------------------- From rrosebru@mta.ca Mon Dec 10 21:38:10 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 10 Dec 2007 21:38:10 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J1tqX-0003KF-3E for categories-list@mta.ca; Mon, 10 Dec 2007 21:23:41 -0400 Date: Mon, 10 Dec 2007 02:35:29 -0800 From: "Zhaohua Luo" Subject: categories: new website: clones and genoids To: 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: 10 A genoid is a category of only two objects (A, G) such that G is the product of A with itself (thus G is also the product of any finite power of A with itself). It is a remarkable fact that such a simple concept can be used to define all of the fundamental algebraic theories, including lambda calculus and first order logic. Progress made in this direction is presented at a newly created website entitled "Clones and Genoids" (http://www.algebraic.net/cag). Zhaohua Luo From rrosebru@mta.ca Tue Dec 11 09:08:00 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 11 Dec 2007 09:08:00 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J24j8-0006NX-Pa for categories-list@mta.ca; Tue, 11 Dec 2007 09:00:47 -0400 Date: Tue, 11 Dec 2007 11:13:39 -0000 (UTC) Subject: categories: Journal of K-Theory From: tporter@informatics.bangor.ac.uk To: categories@mta.ca MIME-Version: 1.0 Content-Type: text/plain;charset=iso-8859-1 Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 11 Journal of K-Theory The Editorial Board of the "Journal of K-Theory" has the pleasure of informing you that forthcoming articles are now available online at http://www.journals.cambridge.org/jkt .The online and print issues of the journal will start in January/February 2008. The board apologizes, especially to the authors of manuscripts submitted in the recent past, for the confusion, delays, and inadequate communication arising during the transition of the board from the journal "K-Theory" The profits to be realized by the journal will serve as a basis for an international conference in K-theory during the academic year 2010- 2011 in conjunction with Andrei Suslin's 60th birthday. Chances are that additional funds can be found to augment JKT funding. The long term commitment of the journal is to use profits derived from publishing to support educational and scientific activities concerning K-theory. --=20 From rrosebru@mta.ca Tue Dec 11 12:03:35 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 11 Dec 2007 12:03:35 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J27VV-0000Gx-C4 for categories-list@mta.ca; Tue, 11 Dec 2007 11:58:53 -0400 Date: Tue, 11 Dec 2007 15:56:05 +0000 (GMT) From: "Prof. Peter Johnstone" To: Lutz Schroeder cc: categories Subject: categories: Re: Internal iteration MIME-Version: 1.0 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: 12 On Mon, 10 Dec 2007, Lutz Schroeder wrote: > Here's another one of these internal/external questions: the fact that > an object N with structure map a: N + 1 -> N in a topos is an NNO can be > expressed by axioms > > ALL d: B + 1 -> B. EX! f: N -> B. f a = d (f + 1) > > for every object B, where the quantifiers are external, i.e. range over > all morphisms. Does it follow that these formulas hold also internally, > i.e. in the internal logic of the topos? (The universal quantifier > implicit in the EX! can, of course, be internalised, as a is an > isomorphism by Lambek's lemma. I mean the outer universal quantifier for d.) > The answer is yes; and it follows from the fact that if N is a NNO in E then B^*N is a NNO in E/B, for any B. (This depends on the fact that E is cartesian closed; cf. Remark A2.5.3 in the Elephant.) What is perhaps more remarkable is that an object in a topos satisfies "Peano's induction postulate" internally iff it does so externally (cf. Elephant, D5.5.1): that is, one can replace an internal quantification over PN by an external quantification over Sub(N). Peter Johnstone From rrosebru@mta.ca Fri Dec 14 09:23:31 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 14 Dec 2007 09:23:31 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J3AI6-0002yu-LD for categories-list@mta.ca; Fri, 14 Dec 2007 09:09:22 -0400 Date: Thu, 13 Dec 2007 12:45:43 -0000 (GMT) Subject: categories: Jobs in Glasgow From: "Tom Leinster" To: categories@mta.ca 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: 13 We're hiring: http://www.jobs.ac.uk/jobs/TN992/Lectureship_Senior_Lectureship_Readershi= p/ There are three posts available, one in analysis and the other two in any pure area (including category theory). All are tenured. For those unfamiliar with UK terminology, here's a brief explanation of the job titles. Someone with tenure is called a lecturer, senior lecturer, reader or professor. A lectureship is the most junior post (bu= t not like an American lectureship). Senior lecturer and reader are intermediate posts; SL is more oriented towards teaching, and reader towards research. There are rather few professors (maybe 20% of the faculty), and it's perfectly normal to end one's career without ever becoming one. Feel free to get in touch if you have questions. (I'll be away from my mail for a few days.) Tom From rrosebru@mta.ca Fri Dec 14 09:23:31 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 14 Dec 2007 09:23:31 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J3AJS-00039e-4n for categories-list@mta.ca; Fri, 14 Dec 2007 09:10:46 -0400 Date: Thu, 13 Dec 2007 15:20:27 +0000 From: Michael Fisher MIME-Version: 1.0 To: Michael Fisher Subject: categories: Job: Lectureship in Computer Science at Liverpool [Logic and Computation] 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: 14 [Please forward this advertisement to anyone you think may be interested. Thanks ] -- --------------------------------------------------------------- | Michael Fisher http://www.csc.liv.ac.uk/~michael | | Dept. of Computer Science MFisher@liverpool.ac.uk | | University of Liverpool tel: (+44) 151 795 4262 | | Liverpool L69 3BX, U.K. fax: (+44) 151 795 4235 | --------------------------------------------------------------- Lectureship in LOGIC AND COMPUTATION DEPARTMENT OF COMPUTER SCIENCE, UNIVERSITY OF LIVERPOOL, UK Deadline: ** 9th January 2008 ** The Logic and Computation (LoCo) group in the Computer Science Department at the University of Liverpool invites applications for a lectureship in the group. The LoCo group is internationally recognised for its excellence in a range of research areas, see=20 http://www.csc.liv.ac.uk/research/logics We invite applications, particularly from those whose research strengthens or complements the group's activities. For more information on this position, see http://www.liv.ac.uk/working/job_vacancies/academic/A-566808.htm or, for informal feedback, contact Michael Fisher or Frank Wolter, [ MFisher@liverpool.ac.uk , Wolter@liverpool.ac.uk ] Please note: applications *must* be received via the University of Liverpool's normal application procedure: http://www.liv.ac.uk/working/job_application_process/index.htm This post is one of two funded in the department through a cooperation with the Xi'an Jiaotong University in China; the second lectureship will be attached to the Agent ART group. Quote reference: A-566808/WWW Salary in range =A328289 - =A342791 per annum An equal opportunity employer. Please note: the post attracts a special HEFCE-funded "Golden Hello" to the value of =A39K, subject to individuals satisfying the eligibility criteria. From rrosebru@mta.ca Sat Dec 15 10:49:29 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sat, 15 Dec 2007 10:49:29 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J3Y8y-0003ql-K2 for categories-list@mta.ca; Sat, 15 Dec 2007 10:37:32 -0400 Date: Sat, 15 Dec 2007 00:51:26 -0800 From: "Zhaohua Luo" Subject: categories: print Clones and Genoids in Lambda Calculus and First Order Logic To: 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: 15 Clones and Genoids in Lambda Calculus and First Order Logic Zhaohua Luo Abstract: A genoid is a system (A, G, x, +) consists of a monoid (G, e), a right act A of G, x in A, + in G, such that for any a in A and u in G there is a unique element [a, u] in G such that x[a, u] = a and +[a, u] = u. A genoid represents a category with two objects such that one is the product of itself with the other. For any right act P of G, we define a new right act P^A = (P, *) by a*u = a[x, u], which is the exponent in the cartesian closed category of right acts of G. We define a lambda calculus to be a genoid (A, G) together with homomorphisms L: A^A -> A and A X A -> A such that (La)+x = a and L(a+x) = a for any a in A. This means that A^A and A are isomorphic as right acts of G. A quantifier algebra for a genoid (A, G) is a right act P of G, together with homomorphisms E: P^A -> P, F: P^0 -> P, and =>: P X P -> P, such that p for any p, q in P: (i) {F, =>} defines a Boolean algebra P. (ii) E (p V q) = (E p) V (E q). (iii) p < E p. http://www.algebraic.net/cag/cag.pdf Clones and Genoids Homepage: http://www.algebraic.net/cag/ From rrosebru@mta.ca Sat Dec 15 10:49:30 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sat, 15 Dec 2007 10:49:30 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J3Y7v-0003n1-W2 for categories-list@mta.ca; Sat, 15 Dec 2007 10:36:28 -0400 Date: Fri, 14 Dec 2007 15:19:09 +0100 (CET) From: Peter Schuster To: Formale Topologie Subject: categories: 2nd CfP: 3WFTop proceedings MIME-Version: 1.0 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: 16 ------------------------------------------------------------------------- Second Call for Papers: Third Workshop on Formal Topology ------------------------------------------------------------------------- Special Issue of Annals of Pure and Applied Logic ------------------------------------------------------------------------- Deadline Sunday 13 January 2008 ------------------------------------------------------------------------- Submissions by email to: Andrej.Bauer@andrej.com ------------------------------------------------------------------------ The Third Workshop on Formal Topology was held in Padua in May 2007: www.3wftop.math.unipd.it The proceedings of this workshop will be published as a special issue of the Annals of Pure and Applied Logic, with the following guest editors: Andrej Bauer, Thierry Coquand, Giovanni Sambin, Peter Schuster. These proceedings are open for high-level research papers on topics from or closely related to formal topology: that is, from constructive and/or point-free topology including applications. ------------------------------------------------------------------------- From rrosebru@mta.ca Mon Dec 17 12:16:15 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 17 Dec 2007 12:16:15 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J4IS7-00041o-21 for categories-list@mta.ca; Mon, 17 Dec 2007 12:04:23 -0400 Date: Sun, 16 Dec 2007 21:45:53 -0500 (EST) From: Michael Barr To: Categories list Subject: categories: On defining *-autonomous categories MIME-Version: 1.0 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: 17 I got a note from a student named Benjamin Jackson saying that someone had told him that to define a *-autonomous category, you need only a symmetric monoidal category and a contravariant involution * such that Hom(A @ B,C*) = Hom(A,(B @ C)*). Here "=" means natural equivalence and @ is the tensor product. Not only is this apparently true but that equivalence is needed only for A = I, the tensor unit. Of course, what is going on is that all the coherence is built-in to the structure of a symmetric monoidal category. First define A --o B = (A @ B*)*. Then the isomorphism above implies that Hom(A,B) = Hom(I @ A,B) = Hom(I,(A @ B*)*) = Hom(I,A --o B) Next we see that (A @ B) --o C = (A @ B @ C*)* = A --o (B @ C*)* = A --o (B --o C) and, applying Hom(I,-), that Hom(A @ B,C) = Hom(A,B --o C) Also we have that A --o I* = (A @ I)* = A* and A --o B = (A @ B*)* = (B* @ A)* = B* --o A* which gives the structure of a *-autonomous category with dualizing object I*. The trouble with this is that generally speaking it is the --o which is obvious and the tensor is derived from it. The coherences involving internal hom alone are much less well-known, although they are included in the original Eilenberg-Kelly paper in the La Jolla Proceedings. Still I am surprised that I never noticed this before. From rrosebru@mta.ca Mon Dec 17 12:16:15 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 17 Dec 2007 12:16:15 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J4ITL-0004BP-No for categories-list@mta.ca; Mon, 17 Dec 2007 12:05:40 -0400 Subject: categories: FMCS 2008: May 30 - June 1, Halifax To: categories@mta.ca (Categories List) Date: Mon, 17 Dec 2007 00:31:22 -0400 (AST) MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit From: selinger@mathstat.dal.ca (Peter Selinger) Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 18 FMCS 2008 16th Workshop on Foundational Methods in Computer Science Dalhousie University, Halifax, Canada May 30 - June 1, 2008 http://www.mathstat.dal.ca/~selinger/fmcs2008/ FIRST ANNOUNCEMENT * * * Foundational Methods in Computer Science is an annual workshop bringing together researchers in mathematics and computer science with a focus on the application of category theory in computer science. This year's meeting will be hosted in the Department of Mathematics and Statistics at Dalhousie University in Halifax, Canada. There will be an informal welcome reception in the evening of May 29. The scientific program starts on May 30, and consists of a day of tutorials aimed at students and newcomers to category theory, as well as a day and a half of research talks. The meeting ends at mid-day on June 1. FMCS 2008 takes place one week after MFPS 2008 (which will be held at the University of Pennsylvania). We hope that this will enable and encourage participants from overseas to attend both conferences! Research talks There will be some invited presentations, but the majority of the talks are solicited from the participants. If you wish to give a talk please send a title and abstract to fmcs2008@mathstat.dal.ca. Time slots are limited, so please register early if you would like to be considered for a talk. Student support Graduate student participation is particularly encouraged at FMCS. Students will pay a reduced registration fee. We will also be able to provide limited financial support; if you are interested in this, please email us at fmcs2008@mathstat.dal.ca. Special session There will be a special session in honor of Ernie Manes' 65th birthday. The special session organizer is Phil Mulry. Accommodations We have reserved a block of rooms at the King's College residences. The rate, including taxes, are $37.37 per night for a single room, and $56.04 for a double room. Reservations can be made by sending an e-mail to conferences@admin.ukings.ns.ca and mentioning "FMCS 2008". Please make your reservations early to ensure availability. Registration Please register for the meeting by emailing fmcs2008@mathstat.dal.ca. There will be a reasonable on-site registration fee to cover meeting costs. Previous meetings Previous FMCS meetings were held in Pullman (1992), Portland (1993), Vancouver (1994), Kananaskis (1995), Pullman (1996), Portland (1998), Kananaskis (1999), Vancouver (2000), Spokane (2001), Hamilton (2002), Ottawa (2003), Kananaskis (2004), Vancouver (2005), Kananaskis (2006), and Hamilton (2007). Organizing committee: Robin Cockett (Calgary) John MacDonald (UBC) Phil Mulry (Colgate) Dorette Pronk (Dalhousie) Robert Seely (McGill) Peter Selinger (Dalhousie) Local Organizers: Dorette Pronk (Dalhousie) Peter Selinger (Dalhousie) * From rrosebru@mta.ca Mon Dec 17 21:17:18 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 17 Dec 2007 21:17:18 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J4QxK-0006kQ-5C for categories-list@mta.ca; Mon, 17 Dec 2007 21:09:10 -0400 Subject: categories: Re: On defining *-autonomous categories Date: Mon, 17 Dec 2007 14:29:17 -0400 (AST) To: categories@mta.ca (Categories list) MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit From: selinger@mathstat.dal.ca (Peter Selinger) Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 19 Dear Mike, first, the definition that you "never noticed before" appears as Definition C in your paper "Non-symmetric *-autonomous categories" (Theoretical Computer Science, 139 (1995), 115-130). Okay, there are minor differences, e.g., in that paper you considered the non-symmetric case and you didn't require * to be an involution. The definition precisely as stated in your email (and not in your paper) is problematic: one obtains two canonical isomorphisms A -> A**, and they do not in general coincide. Namely, the first such morphisms is the isomorphism invol : A -> A** that comes from the requirement "contravariant involution". The second one is lift : A -> A** and comes from the monoidal closed structure. It is given explicitly by the following string of equivalences: = Hom(X, A) = Hom(A*, X*) = Hom(I, (A* @ X)*) ax = Hom(I, (X @ A*)*) sym = Hom(X, A**) ax To see that they do not, in general, coincide, consider a *-autonomous category C in which there exists a non-trivial natural isomorphism eta_A : A -> A from the identity functor to itself (for example, finite dimensional vector spaces where eta is multiplication by -1). Consider the usual functor (-)* and the usual isomophism Hom(A @ B,C*) = Hom(A,(B @ C)*). Let invol : A -> A** be the usual involution, and let invol' = invol o eta: A -> A -> A**. Then invol' defines another structure of "contravariant involution" on the functor (-)*, different from lift. Therefore, in general, for this definition to be useable, one needs another coherence condition stating that invol = lift. Or else, one can just drop the a priori requirement that * is involutive, and just let it follow from the other structure (as you did in the above-cited paper). This seems a good moment to mention that another definition of *-autonomous category, which occasionally appears in the literature, suffers from a similar affliction. Some authors define a *-autonomous category to be a symmetric monoidal category C together with a functor (-)* : C^op -> C and a natural isomorphism Hom(A @ B, C) = Hom(A, (B @ C*)*). Although this definition does not a priori assume * to be involutive, it still yields two canonical maps C -> C** that do not in general coincide, and therefore, it is missing a coherence condition. The two competing maps f_1 and f_2 are given as follows: (A, A) == (A x I, A) == (A, (I x A*)*) (ax) == (A, A**). (A*, A*) == (A*, (A x I**)*) (##) == (A* x A, I*) (ax) == (A x A*, I*) == (A, (A* x I**)*) (ax) == (A, A**) (##) Here, (ax) is the axiom, and (##) denotes an application of the isomorphism I = I**, which can be obtained by letting A=B=C in (ax). To see that they don't in general coincide, consider the same counterexample as above, and modify the isomorphism (ax) by multiplication with the scalar -1. Since it is used an odd number of times in the definition of f_1, but an even number of times in the definition of f_2, it follows that f_1 != f_2. On the other hand, none of the above matters in some sense, due to a theorem proved last year by Robin Houston (it was previously unknown at least to me): Theorem. Let C be a symmetric monoidal category, and let D be an object. If there *exists* a natural isomorphism f : A -> (A -o D) -o D, then the *canonical* natural transformation g : A -> (A -o D) -o D (coming from the symmetric monoidal structure) is an isomorphism (although it may in general be different from f). Therefore, in the definition of *-autonomous category, the mere existence of an isomorphism (not necessarily satisfying coherence conditions) already implies the existence of a (possibly different) isomorphism satisfying all the coherence conditions. In this sense, both the Hom(A @ B,C*) = Hom(A,(B @ C)*) definition and the Hom(A @ B,C*) = Hom(A,(B @ C)*) definition are correct: they certainly imply that the underlying category is *-autonomous - although not necessarily with the given structure! -- Peter Michael Barr wrote: > > I got a note from a student named Benjamin Jackson saying that someone had > told him that to define a *-autonomous category, you need only a symmetric > monoidal category and a contravariant involution * such that Hom(A @ B,C*) > = Hom(A,(B @ C)*). Here "=" means natural equivalence and @ is the tensor > product. Not only is this apparently true but that equivalence is needed > only for A = I, the tensor unit. Of course, what is going on is that all > the coherence is built-in to the structure of a symmetric monoidal > category. > > First define A --o B = (A @ B*)*. Then the isomorphism above implies that > Hom(A,B) = Hom(I @ A,B) = Hom(I,(A @ B*)*) = Hom(I,A --o B) > Next we see that > (A @ B) --o C = (A @ B @ C*)* = A --o (B @ C*)* = A --o (B --o C) > and, applying Hom(I,-), that > Hom(A @ B,C) = Hom(A,B --o C) > Also we have that > A --o I* = (A @ I)* = A* and A --o B = (A @ B*)* = (B* @ A)* = B* --o A* > which gives the structure of a *-autonomous category with dualizing > object I*. > > The trouble with this is that generally speaking it is the --o which is > obvious and the tensor is derived from it. The coherences involving > internal hom alone are much less well-known, although they are included > in the original Eilenberg-Kelly paper in the La Jolla Proceedings. > Still I am surprised that I never noticed this before. From rrosebru@mta.ca Tue Dec 18 21:56:10 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 18 Dec 2007 21:56:10 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J4nz3-0002Tw-5e for categories-list@mta.ca; Tue, 18 Dec 2007 21:44:29 -0400 Content-Type: text/plain; charset=ISO-8859-1; delsp=yes; format=flowed Content-Transfer-Encoding: quoted-printable From: Dan Ghica Subject: categories: GALOP III @ ETAPS 2008 : Call For Papers/Abstracts Date: Tue, 18 Dec 2007 11:40:05 +0000 To: categories@mta.ca Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 20 =3D=3D=3D=3D Call for Papers =3D=3D=3D=3D =3D=3D=3D=3D 3rd Workshop on Games for Logic and Programming Languages = =3D=3D=3D=3D =3D=3D=3D=3D (GaLoP 2008) =3D=3D=3D=3D =3D=3D=3D=3D April 5-6 =3D=3D=3D=3D =3D=3D=3D=3D Budapest, Hungary =3D=3D=3D=3D =3D=3D=3D=3D An ETAPS 2008 Workshop =3D=3D=3D=3D GaLoP is an annual international workshop on game-semantic models for logics and programming languages and their applications. This is an =20 informal workshop that welcomes work in progress, overviews of more extensive work, programmatic or position papers and tutorials as well as =20 contributed papers and invited talks. The Third GaLoP will be held in Hungary, Budapest between April 5 and 6. It will be part of the European Joint Conferences on Theory and =20 Practice of Software (ETAPS 2008). Contributions are invited on all pertinent subjects, with particular =20 interest in compositional game-semantic models in the style of Hyland-Ong or Abramsky-Jagadeesan-Malacaria. Typical but not exclusive areas of =20 interest are: categorical aspects; algorithmic aspects; programming languages and full abstraction; semantics of logics and proof systems; proof search; higher-order automata; program verification and model checking; program analysis; security; theories of concurrency; probabilistic models. Instructions for submission will be posted on the workshop's web page: =09 http://www.cs.bham.ac.uk/galop There will be no formal proceedings but the possibility of a special =20 issue in a journal will be discussed (selected papers from Galop 2005 will =20 appear in Annals of Pure and Applied Logic). Invited Speakers # Gabriel Sandu, Helsinki # Paul-Andr=E9 Melli=E8s, PPS Important Dates Submission: February 1 Notification: March 1 Workshop: April 5-6 Program Committee # Dan Ghica (co-chair), Birmingham # Russ Harmer (co-chair), PPS # Martin Hyland, Cambridge # Pierre Hyvernat, Savoie # Jim Laird, Sussex # John Longley, Edinburgh # Andrzej Murawski, Oxford # Andrea Schalk, Manchester --- Dr. Dan Ghica, Lecturer School of Computer Science University of Birmingham Birmingham B15 2TT tel: +44 121 414 8819 mailto:D.R.Ghica@cs.bham.ac.uk http://www.cs.bham.ac.uk/~drg From rrosebru@mta.ca Tue Dec 18 21:56:10 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 18 Dec 2007 21:56:10 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J4o0B-0002YI-Rt for categories-list@mta.ca; Tue, 18 Dec 2007 21:45:39 -0400 Date: Tue, 18 Dec 2007 13:08:07 +0000 From: Robin Houston To: Categories list , Subject: categories: Re: On defining *-autonomous categories Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 21 On Mon, Dec 17, 2007 at 02:29:17PM -0400, Peter Selinger wrote: > On the other hand, none of the above matters in some sense, due to a > theorem proved last year by Robin Houston (it was previously unknown > at least to me): > > Theorem. Let C be a symmetric monoidal category, and let D be an object. > If there *exists* a natural isomorphism f : A -> (A -o D) -o D, > then the *canonical* natural transformation g : A -> (A -o D) -o D > (coming from the symmetric monoidal structure) is an isomorphism > (although it may in general be different from f). I suspect I may not have been the first to notice this, since it's fairly easy, though I'm not aware that it's ever been mentioned in print. (If anyone knows otherwise, I'd be interested to hear.) Claim: Let C be a symmetric monoidal closed category, and let D be an object of C. Then the following are equivalent: 1. There exists a natural isomorphism A = (A -o D) -o D, 2. The functor (- -o D) is full and faithful, 3. The canonical natural transformation A -> (A -o D) -o D is invertible. Lemma 1. Let G: X -> Y and H: Y -> Z be functors. If HG is faithful then G is faithful; if HG is full and G is essentially surjective, then H is full. Proof: easy. Lemma 2. Let C be a category, and F: C -> C an endofunctor. If FF is naturally isomorphic to 1_C, then F is an equivalence. Proof: Certainly F is essentially surjective, since every object X in C is naturally isomorphic to FFX. It then follows by Lemma 1 that F is full and faithful. For the implication 1 => 2, take F = (- -o D) in Lemma 2. For the implication 2 => 3, consider the following sequence of isomorphisms natural in A \in C: C(A, A) -> C(A -o D, A -o D) ;apply the functor (- -o D) = C((A -o D) @ A, D) ;closure = C(A @ (A -o D), D) ;symmetry of tensor = C(A, (A -o D) -o D) ;closure again By definition, this natural transformation corresponds under Yoneda to the canonical A -> (A -o D) -o D. Since (- -o D) is full and faithful, the first step is invertible; the others are necessarily so. Therefore, by the Yoneda correspondence, the canonical natural transformation with components A -> (A -o D) -o D is invertible. [ Robin Cockett pointed out to me that this can be decomposed into two steps, one easy and one well-known: a) The functor (- -o D) is self-adjoint on the right. b) For any adjunction, the left adjoint is full and faithful if and only if the unit of the adjunction is invertible. ] Finally, the implication 3 => 1 is immediate. Robin From rrosebru@mta.ca Tue Dec 18 21:56:11 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 18 Dec 2007 21:56:11 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J4nxm-0002OZ-1e for categories-list@mta.ca; Tue, 18 Dec 2007 21:43:10 -0400 Date: Mon, 17 Dec 2007 09:00:28 -0600 (CST) From: Gabor Lukacs To: Categories list Subject: categories: Exam practices MIME-Version: 1.0 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: 22 [Note from moderator: This item is off topic. It is sent with the understanding, and agreement of the poster, that any response be sent directly to him, not to the list.] Dear Colleagues, As a member of the Executive Committee of my department, I was given the task of gathering information on exam practices/policies in preparation for estalishing our own policy. I would like to ask for your help by sharing with me your own experience/practices/policies: A. Grade vs. mark 1. At the end of the term, do you assign a mark (like 87) or a letter grade (like A or A+) -- or both? 2. How do you convert numeric marks to letter grades? (Is there a departmental/faculty/university standard for this?) 3. Is the conversion scheme from numeric marks to letter grades public (i.e., known to students) or kept in secret? 4. Do you have to tell your students the conversion scheme at the beginning of the term? 5. Do you tell students their mark on the final exam, or only their letter grade? B. Appeals 1. How appeals are handled? Is there an appeal fee? How much? 2. Can students have (supervised) access to their final exams before or during the appeal period/process? 3. Can students request a photocopy of their exam (examination notebook)? What is the fee? I would like to thank in advance everyone who responds to this. Happy holidays! Gabi From rrosebru@mta.ca Tue Dec 18 21:56:11 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 18 Dec 2007 21:56:11 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J4o2Q-0002gn-So for categories-list@mta.ca; Tue, 18 Dec 2007 21:47:58 -0400 From: "Ronnie" To: categories@mta.ca Subject: categories: Question for catbul on practical use of the language of monoidal categories Date: Tue, 18 Dec 2007 22:58:50 -0000 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 I would like help on an expository point when using structures such as a = tensor product in a practical situation, and where one does not want to = overload the reader, and make things seem more complicated than = necessary.=20 I accept the excellent example in CFTWM p.164 2nd edition that even for = the cartesian product one cannot get a strict associativity isomorphism. = However when dealing say with tensor product of modules over a = commutative ring, one feels that the tensor product associativity is no = less strict than the usual product of sets, because of the definition by = the universal bilinear property, which extends to 3-fold tensor products = and trilinearity. Has this feeling been clearly expressed in the = literature?=20 Again, is there an exposition of say the tensor algebra of a vector = space which adequately (in your view) takes account of coherence?=20 I am trying to finalise an account of tensor products of crossed = complexes, a much more complicated situation, but where the same ideas = arise.=20 Ronnie From rrosebru@mta.ca Tue Dec 18 21:56:11 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 18 Dec 2007 21:56:11 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J4o1H-0002cz-P2 for categories-list@mta.ca; Tue, 18 Dec 2007 21:46:47 -0400 Date: Tue, 18 Dec 2007 14:27:37 +0000 From: Robin Houston To: Categories list Subject: categories: Re: On defining *-autonomous categories Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 24 On Tue, Dec 18, 2007 at 01:08:07PM +0000, Robin Houston wrote: > Lemma 2. Let C be a category, and F: C -> C an endofunctor. If FF > is naturally isomorphic to 1_C, then F is an equivalence. > > Proof: Certainly F is essentially surjective, since every object > X in C is naturally isomorphic to FFX. It then follows by Lemma 1 > that F is full and faithful. > > > For the implication 1 => 2, take F = (- -o D) in Lemma 2. There is a silly mistake here, caused by the fact that the functor (- -o D) is contravariant. The error is really in the statement of Lemma 2; of course the proof still works for contravariant F. Robin From rrosebru@mta.ca Tue Dec 18 22:06:09 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 18 Dec 2007 22:06:09 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J4oIo-0003uy-MD for categories-list@mta.ca; Tue, 18 Dec 2007 22:04:54 -0400 From: Bob Rosebrugh To: categories Subject: categories: list interruption MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Date: Tue, 18 Dec 2007 22:02:47 -0400 (AST) Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 25 The categories moderator will be mostly out of email contact for the period December 20-28, 2007. Postings submitted to categories during that period will be distributed by December 29. Best wishes, Bob Rosebrugh From rrosebru@mta.ca Wed Dec 19 08:10:02 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 19 Dec 2007 08:10:02 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J4xes-0005kz-NY for categories-list@mta.ca; Wed, 19 Dec 2007 08:04:18 -0400 Date: Wed, 19 Dec 2007 10:52:16 +0000 From: Reiko Heckel User-Agent: Thunderbird 2.0.0.9 (Windows/20071031) MIME-Version: 1.0 To: categories@mta.ca Subject: categories: CFP ICGT'08: The 4th Intl. Conference on Graph Transformation, 7 - 13 Sept 2008, Leicester (UK) Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: quoted-printable Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 26 Call for Papers ----------------------------------------------------------------- 4th International Conference on Graph Transformation (ICGT 2008) Leicester, United Kingdom, September 7 - 13, 2008, http://www.cs.le.ac.uk/events/icgt2008/ ----------------------------------------------------------------- The 4th International Conference on Graph Transformation (ICGT 2008)=20 will be held in Leicester (United Kingdom) in the second week of=20 September 2008, along with several satellite events. It continues the=20 line of conferences previously held in Barcelona (Spain) in 2002, Rome=20 (Italy) in 2004, and Natal (Brazil) in 2006 as well as a series of six=20 International Workshops on Graph Transformation with Applications in=20 Computer Science between 1978 and 1998, and alternates with the workshop=20 series on Application of Graph Transformation with Industrial Relevance.=20 The conference takes place under the auspices of EATCS, EASST, and IFIP=20 WG 1.3. Awards will be given by EATCS and EASST for the best theoretical=20 and application-oriented papers. Proceedings are planned with Springer's=20 Lecture Notes in Computer Science series. ----------------------------------------------------------------- Scope of the Conference: Graphs are among the simplest and most universal models for a variety of=20 systems, not just in computer science, but throughout engineering and=20 the life sciences. When systems evolve we are interested in the way they=20 change, to predict, support, or react to their evolution. Graph=20 transformation combines the idea of graphs as a universal modelling=20 paradigm with a rule-based approach to specify evolution. The area is=20 concerned with both the theory of graph transformation and their=20 application to a variety of domains. The conference aims at bringing together researchers and practitioners=20 interested in the foundations and application of graph transformation to=20 a variety of areas. Topics of interest include, but are not limited to * foundations and theory of o General models of graph transformatio o High-level and adhesive replacement systems o Node-, edge-, and hyperedge replacement grammars o Parallel, concurrent, and distributed graph transformations o Term graph rewriting o Hierarchical graphs and decompositions of graphs o Logic expression of graph transformation properties o Graph theoretical properties of graph languages o Geometrical and topological aspects of graph transformation o Automata on graphs and parsing of graph languages o Analysis and verification of graph transformation systems o Structuring and modularization concepts for transformation system= s o Graph transformation and Petri nets * application to, languages and tool support for o Software architecture o Workflows and business processes o Software quality and testing o Software evolution o Access control and security models o Aspect-oriented development o Model-driven development, especially model transformations o Domain-specific languages o Implementation of programming languages o Bioinformatics and system biology o Natural computing o Image generation and pattern recognition techniques o Massively parallel computing o Self-adaptive systems and ubiquitous computing o Service-oriented applications and semantic web o Rule- and knowledge-based systems ------------------------------------------------------------------ Keynote speakers: Wil van der Aalst, Eindhoven University of Technology Heiko D=F6rr, Carmeq GmbH, Berlin Perdita Stevens, University of Edinburgh ------------------------------------------------------------------ Satellite Events: Doctoral Symposium Contact: Andrea Corradini GCM: Workshop on Graph Computation Models Contact: Mohamed Mosbah GraBaTs: Graph Transformation Tools Contest Contact: Arend Rensink Tutorial: Introduction to Graph Transformation Contact: Reiko Heckel PNGT: Petri Nets and Graph Transformations Contact: Paolo Baldan NCTG: Natural Computing and Graph Transformation Contact: Grzegorz Rozenberg , Ian Petre ------------------------------------------------------------------ Submissions: Submitted papers should not exceed fifteen (15) pages using Springer's=20 LNCS format, and should contain original research. Simultaneous=20 submission to other conferences with proceedings or submission of=20 material that has already been published elsewhere is not allowed. ------------------------------------------------------------------ Important Dates: Submission of title and abstract: April 10, 2008 Submission of complete paper: April 17, 2008 Notification of acceptance: May 15, 2008 Final version due: June 15, 2008 Main conference: September 10-12, 2008 Conference (with satellite events): September 7-13, 2008 ------------------------------------------------------------------ Venue: Located in the heart of England, Leicester is a truly multi-cultural=20 city. The city is a historic meeting place, where for centuries people=20 of different races and cultures have gathered, creating a rich and=20 unique heritage. This diversity continues today with a thriving ethnic=20 minority community accounting for more than a third of Leicester's=20 population. ICGT 2008 will be held at the University of Leicester's=20 conference facility next to the Universiy's botanic gardens. ------------------------------------------------------------------ Organisation Program Chairs Reiko Heckel , University of Leicester, United=20 Kingdom Gabriele Taentzer ,=20 Philipps-Universit=E4t Marburg, Germany Local Organisation Reiko Heckel , University of Leicester, United=20 Kingdom Publicity Chair: Karsten Ehrig , University of Leicester,=20 United Kingdom Workshop Chair: D=E9nes Bisztray , University of Leicester, Unite= d=20 Kingdom ------------------------------------------------------------------ PC members: # Paolo Baldan, Padova (Italy) # Luciano Baresi, Milano (Italy) # Michel Bauderon, Bordeaux (France) # Andrea Corradini, Pisa (Italy) # Hartmut Ehrig, Berlin (Germany) # Gregor Engels, Paderborn (Germany) # Annegret Habel, Oldenburg (Germany) # Reiko Heckel (co-chair), Leicester (UK) # Dirk Janssens, Antwerp (Belgium) # Garbor Karsai, Nashville (USA) # Barbara Koenig, Stuttgart (Germany) # Hans-J=F6rg Kreowski, Bremen (Germany) # Juan de Lara, Madrid (Spain) # Tom Mens, Mons (Belgium) # Mark Minas, M=FCnchen (Germany) # Ugo Montanari, Pisa (Italy) # Mohamed Mosbah, Bordeau (France) # Manfred Nagl, Aachen (Germany) # Fernando Orejas, Barcelona (Spain) # Francesco Parisi-Presicce, Rome (Italy) # Mauro Pezz=E8, Milano (Italy) # John Pfaltz, Charlottesville (Virginia, USA) # Rinus Plasmeijer, Nijmegen (The Netherlands) # Detlef Plump, York (UK) # Arend Rensink, Twente (The Netherlands) # Leila Ribeiro, Porto Alegre (Brasil) # Grzegorz Rozenberg, Leiden (The Netherlands) # Andy Sch=FCrr, Darmstadt (Germany) # Gabriele Taentzer (co-chair), Marburg (Germany) # Hans Vangheluwe, Montreal (Canada) # D=E1niel Varr=F3, Budapest (Hungary) # Albert Z=FCndorf, Kassel (Germany) --=20 Prof Dr Reiko Heckel Chair of Software Engineering Department of Computer Science University of Leicester Leicester LE1 7RH United Kingdom Tel +44 (0)116 252 3406 Fax +44 (0)116 252 3915 http://www.cs.le.ac.uk/people/rh122 From rrosebru@mta.ca Wed Dec 19 08:10:03 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 19 Dec 2007 08:10:03 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J4xfy-0005oX-Dc for categories-list@mta.ca; Wed, 19 Dec 2007 08:05:26 -0400 Date: Wed, 19 Dec 2007 07:32:25 +0100 To: Subject: categories: A meeting in honour of Bill Lawvere, Como, 10 January 2008 - for the categories list From: "RFC Walters" Content-Type: text/plain; format=flowed; delsp=yes; charset=iso-8859-15 MIME-Version: 1.0 Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: RO X-Status: X-Keywords: X-UID: 27 -------------------------------------- A meeting in honour of Bill Lawvere -------------------------------------- Como (Italy), January 10, 2008 An informal meeting will be held at the University of Insubria in Como to celebrate the 70th birthday of Bill Lawvere. The meeting will consist in a series of three lectures entitled "Cohesive toposes: combinatorial and infinitesimal cases" given by Bill Lawvere, a round table and a social dinner. If you would like to attend the dinner please contact me at robert.walters@uninsubria.it Further details of the meeting will be made available at http://dscpi.uninsubria.it/staff/Walters/Como_Category_Seminar Bob Walters 19th December 2007 From rrosebru@mta.ca Wed Dec 19 15:16:03 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 19 Dec 2007 15:16:03 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J54IV-000315-LZ for categories-list@mta.ca; Wed, 19 Dec 2007 15:09:39 -0400 Date: Wed, 19 Dec 2007 12:04:56 +0000 (GMT) From: "Prof. Peter Johnstone" To: Categories list Subject: categories: Re: On defining *-autonomous categories MIME-Version: 1.0 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: 28 This result is a special case of a general fact about adjunctions, which appears (yes, really!) as Lemma A1.1.1 in the Elephant. I don't claim any originality for it, but I did comment in the text that it "seems not to be widely known". Lemma: Let F: C --> D be a functor having a right adjoint G. If there is any natural isomorphism between the composite FG and the identity functor on D, then the counit of the adjunction is an isomorphism. Proof: One can transport the comonad structure on FG across the isomorphism, to obtain a comonad structure on 1_D. But the monoid of natural endomorphisms of the identity functor on any category is commutative, so the counit and comultiplication of this comonad must be inverse isomorphisms. Transporting back again, the counit of (F -| G) is an isomorphism. Peter Johnstone On Tue, 18 Dec 2007, Robin Houston wrote: > On Mon, Dec 17, 2007 at 02:29:17PM -0400, Peter Selinger wrote: >> On the other hand, none of the above matters in some sense, due to a >> theorem proved last year by Robin Houston (it was previously unknown >> at least to me): >> >> Theorem. Let C be a symmetric monoidal category, and let D be an object. >> If there *exists* a natural isomorphism f : A -> (A -o D) -o D, >> then the *canonical* natural transformation g : A -> (A -o D) -o D >> (coming from the symmetric monoidal structure) is an isomorphism >> (although it may in general be different from f). > > I suspect I may not have been the first to notice this, since it's > fairly easy, though I'm not aware that it's ever been mentioned > in print. (If anyone knows otherwise, I'd be interested to hear.) > > > Claim: Let C be a symmetric monoidal closed category, and > let D be an object of C. Then the following are equivalent: > > 1. There exists a natural isomorphism A = (A -o D) -o D, > 2. The functor (- -o D) is full and faithful, > 3. The canonical natural transformation A -> (A -o D) -o D is > invertible. > > > Lemma 1. Let G: X -> Y and H: Y -> Z be functors. If HG is faithful > then G is faithful; if HG is full and G is essentially surjective, > then H is full. > > Proof: easy. > > Lemma 2. Let C be a category, and F: C -> C an endofunctor. If FF > is naturally isomorphic to 1_C, then F is an equivalence. > > Proof: Certainly F is essentially surjective, since every object > X in C is naturally isomorphic to FFX. It then follows by Lemma 1 > that F is full and faithful. > > > For the implication 1 => 2, take F = (- -o D) in Lemma 2. > > > For the implication 2 => 3, consider the following sequence of > isomorphisms natural in A \in C: > > C(A, A) > -> C(A -o D, A -o D) ;apply the functor (- -o D) > = C((A -o D) @ A, D) ;closure > = C(A @ (A -o D), D) ;symmetry of tensor > = C(A, (A -o D) -o D) ;closure again > > By definition, this natural transformation corresponds under Yoneda > to the canonical A -> (A -o D) -o D. Since (- -o D) is full and faithful, > the first step is invertible; the others are necessarily so. Therefore, > by the Yoneda correspondence, the canonical natural transformation with > components A -> (A -o D) -o D is invertible. > > [ Robin Cockett pointed out to me that this can be decomposed into > two steps, one easy and one well-known: > a) The functor (- -o D) is self-adjoint on the right. > b) For any adjunction, the left adjoint is full and faithful > if and only if the unit of the adjunction is invertible. ] > > > Finally, the implication 3 => 1 is immediate. > > Robin > > > From rrosebru@mta.ca Sat Dec 29 10:38:46 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sat, 29 Dec 2007 10:38:46 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J8ca3-0007Jj-RB for categories-list@mta.ca; Sat, 29 Dec 2007 10:22:27 -0400 Date: Fri, 21 Dec 2007 11:13:28 +0000 To: categories@mta.ca Subject: categories: CiE08 - Final Call for Papers MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Message-Id: From: cat-dist@mta.ca Status: RO X-Status: X-Keywords: X-UID: 29 Computability in Europe 2008: Logic and Theory of Algorithms University of Athens, June 15-20 2008 http://www.cs.swan.ac.uk/cie08/ PAPER SUBMISSION is now OPEN: http://www.cs.swan.ac.uk/cie08/submission.php SUBMISSION DEADLINE: January 4th, 2008 CiE 2008 is the fourth in a series of conferences organised by CiE (Computability in Europe), a European network of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability and their underlying significance for the real world. Previous meetings took place in Amsterdam (2005), Swansea (2006) and Siena (2007). CiE 2008 aims at bridging the gap from the logical methods of mathematical and meta-mathematical flavour to the applied and industrial questions that are involved in devising and choosing the right algorithms and analysing their effectiveness and efficiency. TUTORIALS will be given by: John V. Tucker (Swansea) Moshe Y. Vardi (Houston, TX) PLENARY SPEAKERS will include: Keith Devlin (Stanford, CA) Rosalie Iemhoff (Utrecht) Antonina Kolokolova (Vancouver, BC) Janos Makowsky (Haifa) Dag Normann (Oslo) Prakash Panangaden (Montreal, QC) Christos Papadimitriou (Berkeley, CA) Jan van Leeuwen (Utrecht) & Jiri Wiedermann (Prague) See http://www.cs.swan.ac.uk/cie08/invited.php for more informations on Plenary Speakers. SPECIAL SESSIONS Algorithms in the history of mathematics (organized by J. Hoyrup, Roskilde, and K. Chemla, Paris) Formalising mathematics and extracting algorithms from proofs (organized by H. Barendregt, Nijmegen, and M. Seisenberger, Swansea) Higher type recursion theory and applications (organized by U. Berger, Swansea, and D. Normann, Oslo) Algorithmic game theory (organized by E. Koutsoupias, Athens, and B. von Stengel, London) Quantum algorithms and complexity (organized by V. Kendon, Leeds, and B. Coecke, Oxford) Biology and computation (organized by N. Jonoska, Tampa FL, and G. Mauri, Milano) See http://www.cs.swan.ac.uk/cie08/special.php for more informations on special sessions. CiE 2008 conference topics include, but not exclusively * Admissible sets * Analog computation * Artificial intelligence * Automata theory * Classical computability and degree structures * Complexity classes * Computability theoretic aspects of programs * Computable analysis and real computation * Computable structures and models * Computational and proof complexity * Computational learning and complexity * Concurrency and distributed computation * Constructive mathematics * Cryptographic complexity * Decidability of theories * Derandomization * DNA computing * Domain theory and computability * Dynamical systems and computational models * Effective descriptive set theory * Finite model theory * Formal aspects of program analysis * Formal methods * Foundations of computer science * Games * Generalized recursion theory * History of computation * Hybrid systems * Higher type computability * Hypercomputational models * Infinite time Turing machines * Kolmogorov complexity * Lambda and combinatory calculi * L-systems and membrane computation * Mathematical models of emergence * Molecular computation * Neural nets and connectionist models * Philosophy of science and computation * Physics and computability * Probabilistic systems * Process algebra * Programming language semantics * Proof mining * Proof theory and computability * Quantum computing and complexity * Randomness * Reducibilities and relative computation * Relativistic computation * Reverse mathematics * Swarm intelligence * Type systems and type theory * Uncertain reasoning * Weak systems of arithmetic and applications Contributed papers will be selected from submissions received by the PROGRAMME COMMITTEE consisting of: L. Aiello (Roma) T. Altenkirch (Nottingham) K. Ambos-Spies (Heidelberg) G. Ausiello (Roma) A. Beckmann (Swansea, co-chair) L. Beklemishev (Moscow) P. Bonizzoni (Milano) S. A. Cook (Toronto ON) B. Cooper (Leeds) C. Dimitracopoulos (Athens, co-chair) R. Downey (Wellington) E. Koutsoupias (Athens) O. Kupferman (Jerusalem) S. Laplante (Orsay) H. Leitgeb (Bristol) B. Loewe (Amsterdam) E. Mayordomo Camara (Zaragoza) F. Montagna (Siena) M. Mytilinaios (Athens) (+) M. Nielsen (Aarhus) I. Oitavem (Lisboa) C. Palamidessi (Palaiseau) T. Pheidas (Heraklion) Ramanujam (Chennai) A. Schalk (Manchester) U. Schoening (Ulm) H. Schwichtenberg (Muenchen) A. Selman (Buffalo NY) A. Sorbi (Siena) I. Soskov (Sofia) C. Timpson (Leeds) S. Zachos (New York NY) We cordially invite all researchers (European and non-European) in computability related areas to submit their papers (in PDF- format, max 10 pages) for presentation at CiE 2008. We particularly invite papers that build bridges between different parts of the research community. The CONFERENCE PROCEEDINGS will be published by LNCS, Springer-Verlag. There will also be journal special issues, collecting invited contributions related to the conference. Special issues will be published in the journals "Theory of Computing Systems", the "Archive for Mathematical Logic", and the "Journal of Algorithms". See http://www.cs.swan.ac.uk/cie08/publications.php for more informations on publications. From rrosebru@mta.ca Sun Dec 30 10:01:42 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sun, 30 Dec 2007 10:01:42 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J8yfI-0004b4-P6 for categories-list@mta.ca; Sun, 30 Dec 2007 09:57:20 -0400 Date: Sun, 30 Dec 2007 11:02:14 +0000 From: mas013@bangor.ac.uk To: categories@mta.ca Subject: categories: heroprichten 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: 30 Dear All, or at least all who know Flemish or Dutch. I have been trying to understand / translate part of a thesis in Flemish and have come upon a word (in the context of fibred categories) that my online dictionaries cannot handle at all. It seems to be a current word in the languages as Google turns up lots of hits but none gives me enough of an idea of a more or less equivalent English or French word. The word is heroprichten Can any one help? To all and sundry categorical, Happy New Year Tim Porter From rrosebru@mta.ca Sun Dec 30 10:01:42 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sun, 30 Dec 2007 10:01:42 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J8yds-0004XK-98 for categories-list@mta.ca; Sun, 30 Dec 2007 09:55:52 -0400 To: LICS List From: Kreutzer + Schweikardt Subject: categories: LICS 2008 - Revised Submission Deadlines Date: Sun, 30 Dec 2007 11:22:53 +0100 (CET) Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 31 LOGIC in COMPUTER SCIENCE (LICS) 2008 The LICS 2008 submission site is now open. Submission instructions along with a link to the LICS 2008 submission site can be found at http://www.cs.cmu.edu/~fp/lics08. Revised submission deadlines: - Paper registration deadline (with short abstracts): 14 January 2008 - Paper submission deadline: 21 January 2008 LICS 2008 will be held in Pittsburgh, Pennsylvania, June 24 - 27, 2008. From rrosebru@mta.ca Mon Dec 31 09:52:01 2007 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 31 Dec 2007 09:52:01 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1J9KqV-0001pj-R1 for categories-list@mta.ca; Mon, 31 Dec 2007 09:38:24 -0400 Date: Mon, 31 Dec 2007 08:13:18 +0000 From: mas013@bangor.ac.uk To: categories@mta.ca Subject: categories: re: heroprichten 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: 32 Dear all, I would like to thank all those who have replied to my e-mail about the Dutch term heroprichten. It was used in a thesis of 1976 on non-Abelian cohomology, referring to the obstruction to lifting a section of a stack or gerbe back along a morphism of such and means `re-establish' or similar depending on context. Lifting would seem to be a possible translation in some contexts and `re-construct' in others -where it is a verblike situation. So thanks. Once again `Happy New Year to everyone for 2008'. Tim