From MAILER-DAEMON Sat Feb 2 14:05:00 2008 Date: 02 Feb 2008 14:05:00 -0400 From: Mail System Internal Data Subject: DON'T DELETE THIS MESSAGE -- FOLDER INTERNAL DATA Message-ID: <1201975500@mta.ca> X-IMAP: 1199284511 0000000039 Status: RO This text is part of the internal format of your mail folder, and is not a real message. It is created automatically by the mail system software. If deleted, important folder data will be lost, and it will be re-created with the data reset to initial values. From rrosebru@mta.ca Wed Jan 2 10:23:31 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 02 Jan 2008 10:23:31 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JA4IU-0004ng-7Z for categories-list@mta.ca; Wed, 02 Jan 2008 10:10:18 -0400 Date: Wed, 02 Jan 2008 13:49:20 +0000 From: Dirk Pattinson MIME-Version: 1.0 To: categories@mta.ca Subject: categories: Postdoc: Coalgebraic Logics at Imperial 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: 1 36 Months Postdoctoral Position in Colagebraic Logics Department of Computing, Imperial College London A three year postdoctoral position is available from March 1, 2008 (or as soon as possible thereafter) to work on an EPSRC-funded project in the area of coalgebras and modal logic. Coalgebraic semantics allows the representation of a large class of structurally different modal logics in a uniform semantic framework where the particular type of observations that determines a specific model class is parameterized by an endofunctor. The aim of the project is to study fixpoint logics and logics axiomatized with nested modalities in this setting. More information on the project and the position advert can be found at http://www.doc.ic.ac.uk/~dirk/CML/ or email me (dirk@doc.ic.ac.uk) regarding further queries. With best wishes for 2008, Dirk Pattinson. From rrosebru@mta.ca Thu Jan 3 12:42:45 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Thu, 03 Jan 2008 12:42:45 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JASwp-0001fj-7k for categories-list@mta.ca; Thu, 03 Jan 2008 12:29:35 -0400 Date: Wed, 2 Jan 2008 15:00:31 -0700 From: ICLP 08 Subject: categories: ICLP'08 CALL FOR PAPERS To: undisclosed-recipients:; Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 2 FIRST CALL FOR PAPERS ICLP'08 24th International Conference on Logic Programming Udine, Italy, December 9th-13th, 2008 http://iclp08.dimi.uniud.it CONFERENCE SCOPE ---------------- Since the first conference held in Marseilles in 1982, ICLP has been the premier international conference for presenting research in logic programming. Contributions (papers, position papers, and posters) are sought in all areas of logic programming including but not restricted to: * Theory: Semantic Foundations, Formalisms, Nonmonotonic Reasoning, Knowledge Representation. * Implementation: Compilation, Memory Management, Virtual Machines, Parallelism. * Environments: Program Analysis, Program Transformation, Validation and Verification, Debugging, Profiling, Integration. * Language Issues: Extensions, Integration with Other Paradigms, Concurrency, Modularity, Objects, Coordination, Mobility, Higher Order, Types, Modes, Programming Techniques. * Related Paradigms: Abductive Logic Programming, Inductive Logic Programming, Constraint Logic Programming, Answer-Set Programming. * Applications: Databases, Data Integration and Federation, Software Engineering, Natural Language Processing, Web and Semantic Web, Agents, Artificial Intelligence, Bioinformatics The three broad categories for submissions are: (1) Technical papers, providing novel research contributions, innovative perspectives on the field, and/or novel integrations across different areas; (2) Application papers, describing innovative uses of logic programming technology in real-world application domains; (3) Posters, ideal for presenting and discussing current work, not yet ready for publication, for PhD thesis summaries and research project overviews. A separate session dedicated to the celebration of the 20th anniversary of stable model semantics will also be part of the program. Accepted papers and posters will be allocated time for presentation during the conference. At least one author of each accepted submission is expected to register and participate in the event. In addition to papers and posters, the technical program will include invited talks, advanced tutorials, specialized sessions, workshops, and a Doctoral Student Consortium. Details, as they become available will be posted at: http://iclp08.dimi.uniud.it PAPERS AND POSTERS ------------------ Papers and posters must describe original, previously unpublished research, and must not be simultaneously submitted for publication elsewhere. Emphasis will be placed on the novelty and innovative nature of the results (even if not completely polished and refined). All submissions will be peer-reviewed by an international panel. Submissions MUST contain substantial original, unpublished material. All submissions must be written in English. Technical papers and application papers must not exceed 15 pages in the Springer LNCS format (see http://www.springeronline.com/lncs/) The limit for posters is 5 pages in the same format. The primary means of submission will be electronic, through the Easychair submission system. The submission page is available at http://www.easychair.org/conferences/?conf=ICLP08 PUBLICATION ----------- The proceedings of the conference will be published by Springer-Verlag in the LNCS series. All accepted papers and posters will be included in the proceedings. WORKSHOPS --------- The ICLP'08 program will include several workshops. They are perhaps the best place for the presentation of preliminary work, novel ideas, and new open problems to a more focused and specialized audience. Workshops also provide a venue for presenting specialised topics and opportunities for intensive discussions and project collaboration in any areas related to logic programming, including cross-disciplinary areas. DOCTORAL CONSORTIUM ------------------- The Doctoral Consortium (DC) on Logic Programming is the 4th Doctoral consortium to provide doctoral students with the opportunity to present and discuss their research directions, and to obtain feedback from both peers and word-renown experts in the field. The DC will also offer invited speakers and panel discussions. Accepted participants will receive partial financial support to attend the event and the main conference. The best paper and presentation from the DC will be given the opportunity to present in special session of the main ICLP conference. CELEBRATING 20th YEARS OF STABLE MODEL SEMANTICS ------------------------------------------------ The year 2008 marks the 20th anniversary of the publication that introduced the stable model semantics for logic programs with negation. The paper titled "The stable semantics for logic programs" by Michael Gelfond and Vladimir Lifschitz was presented at ICLP-1988. It was a momentous event that gave rise to a vibrant subfield of logic programming known now as the answer-set programming. Its distinguishing aspects are close connections to the fields of knowledge representation, satisfiability and constraint satisfaction, ever faster computational tools, and a growing list of successful applications. To celebrate the stable-model semantics, there will be a special session at ICLP 2008 dedicated to answer-set programming. The session will feature talks by Michael Gelfond and Vladimir Lifschitz. as well as by other major contributions to the field, presenting personal perspectives on the stable-model semantics, its impact and its future. There will be a panel discussion, and regular accepted ICLP papers falling into the answer-set programming area will complete the program. CONFERENCE VENUE ---------------- The conference will be held in the city of Udine, the capital of the historical region of Friuli, Italy. Located between the Adriatic sea and the Alps, close to Venice, Austria and Slovenia, Udine is a city of Roman origins, funded by Emperor Otto in 983. Rich of historical sites, Udine is also famous for its commercial and shopping opportunities and its outstanding wine and culinary traditions. SUPPORT SPONSORING AND AWARDS ----------------------------- The conference is sponsored by the Association for Logic Programming (ALP). The ALP has funds to assist financially disadvantaged participants. The ALP is planning to sponsor two awards for ICLP 2008: for the best technical paper and for the best student paper. IMPORTANT DATES --------------- Papers Posters Abstract submission deadline June 2nd n/a Submission deadline June 9th August 15th Notification of authors August 1st September 1st Camera-ready copy due September 15th September 15th 20 Years of Stable Models TBA Doctoral Consortium TBA Workshop Proposals June 2nd Early-bird Registration TBA Conference December 9-13, 2008 ICLP'2008 ORGANIZATION ---------------------- General Chair: Agostino Dovier (University of Udine) Program Co-Chairs: Maria Garcia de la Banda (Monash University) Enrico Pontelli (New Mexico State University) Workshop Chair: Tran Cao Son (New Mexico State University) Doctoral Student Consortium: David Warren (SUNY Stony Brook) Tom Schrijvers (K.U.Leuven) Publicity Co-Chairs: Marcello Balduccini (Kodak Research Labs) Alessandro Dal Palu' (University of Parma) Programming Competition Chair: Bart Demoen (K.U.Leuven) 20 Years of Stable Models: Mirek Truszczynski (University of Kentucky) Andrea Formisano (University of Perugia) Program Committee: Salvador Abreu Sergio Antoy Pedro Barahona Chitta Baral Gerhard Brewka Manuel Carro Michael Codish Alessandro Dal Palu' Bart Demoen Agostino Dovier John Gallagher Michael Gelfond Carmen Gervet Gopal Gupta Manuel Hermenegildo Andy King Michael Maher Juan Moreno Navarro Alberto Pettorossi Brigitte Pientka Gianfranco Rossi Fariba Sadri Vitor Santos Costa Tran Cao Son Paolo Torroni Frank Valencia Mark Wallace Web Master: Raffaele Cipriano Local Arrangements Committee: Alberto Casagrande Elisabetta De Maria Luca Di Gaspero Carla Piazza ---------------------------------------------------- For further information: iclp08@cs.nmsu.edu http://iclp08.dimi.uniud.it From rrosebru@mta.ca Sat Jan 5 10:19:24 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sat, 05 Jan 2008 10:19:24 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JB9bf-0000GJ-MD for categories-list@mta.ca; Sat, 05 Jan 2008 10:02:35 -0400 Date: Fri, 04 Jan 2008 13:29:51 +0100 From: "Dr.Jawad Abuihlail" Subject: categories: Invitation to- "Interactions of Algebraic & Coalgebraic Structures" To: categories@mta.ca Message-id: <001301c84ecd$8165be10$84313a30$@edu.sa> MIME-version: 1.0 Content-type: text/plain; charset=us-ascii Content-transfer-encoding: 7BIT Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 3 Dear Colleague, Your are cordially invited you to submit a paper to the special theme issue "Interactions of Algebraic & Coalgebraic Structures (Theory and Applications)" of the AJSE (The Arabian Journal of Science and Engineering). The special theme issue is planned to be published in December 2008 (deadline for submitting papers is June 1st, 2008.). The main topics of the theme issue are . Algebras and Coalgebras . Hopf Algebras . Corings and Comodules . Bialgebroids & Hopf Algebroids . Quantum and Lie Groups . Non-commutative Geometry . Categorical Aspects . Applications in Physics . Applications in Logic, Universal Algebra & Computer Science More details are in the attached call for papers (in PDF-format). I appreciate it much, if you would inform me if you are likely to submit a contribution (so that we can have an approximation of the number of papers we expect to handle). Your contribution is highly appreciated. With best regards, Jawad ------------------------------------- Dr. Jawad Abuhlail Associate Professor of Algebra Department of Mathematics and Statistics Box # 5046 King Fahd University of Petroleum & Minerals 31261 Dhahran, Saudi Arabia Office: +966-3-860-4737 Home: +966-3-860-5994 Mobile: +966-55-760-9357 http://faculty.kfupm.edu.sa/math/abuhlail From rrosebru@mta.ca Sat Jan 5 10:19:24 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sat, 05 Jan 2008 10:19:24 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JB9aS-0000C9-Ig for categories-list@mta.ca; Sat, 05 Jan 2008 10:01:20 -0400 Subject: categories: preprint: 2-filteredness and the point of every Galois topos From: Eduardo Dubuc To: categories@mta.ca Date: Thu, 3 Jan 2008 15:31:42 -0200 (ARST) 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: 4 Title: 2-filteredness and the point of every Galois topos Authors: Eduardo J. Dubuc Categories: math.CT math.AG Comments: 5 pages, result presented at CT2007, Cavoeiro MSC-class: 18B25 \\ A locally connected topos is a Galois topos if the Galois objects generate the topos. We show that the full subcategory of Galois objects in any connected locally connected topos is an inversely 2-filtered 2-category, and as an application of the construction of 2-filtered bi-limits of topoi, we show that every Galois topos has a point. \\ ( http://arxiv.org/abs/0801.0010 , 6kb) NOTE: in definition 1.2 iii) "Z" is supposed to be locally constant. From rrosebru@mta.ca Mon Jan 7 15:19:26 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 07 Jan 2008 15:19:26 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JBxHC-0001Af-B7 for categories-list@mta.ca; Mon, 07 Jan 2008 15:04:46 -0400 Subject: categories: WADT 2008 - Call for Papers From: Andrea Corradini To: Andrea Corradini Content-Type: text/plain Date: Sun, 06 Jan 2008 18:41:00 +0100 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: 5 [Please apologize if you receive multiple copies of this message.] CALL FOR PAPERS WADT 2008 19th International Workshop on Algebraic Development Techniques Pisa, Italy, June 13-16, 2008 Home page: http://www.di.unipi.it/wadt2008 -------------------------------------------------------------------------- After having joined forces with CMCS for CALCO'07 in Bergen, WADT takes place in 2008 as an individual workshop and in its traditional format. Aims and Scope The algebraic approach to system specification encompasses many aspects of the formal design of software systems. Originally born as formal method for reasoning about abstract data types, it now covers new specification frameworks and programming paradigms (such as object-oriented, aspect-oriented, agent-oriented, logic and higher-order functional programming) as well as a wide range of application areas (including information systems, concurrent, distributed and mobile systems). The workshop will provide an opportunity to present recent and ongoing work, to meet colleagues, and to discuss new ideas and future trends. -------------------------------------------------------------------------- Topics of interest Typical, but not exclusive topics of interest are: - foundations of algebraic specification - other approaches to formal specification, including process calculi and models of concurrent, distributed and mobile computing - specification languages, methods, and environments - semantics of conceptual modelling methods and techniques - model-driven development - graph transformations, term rewriting and proof systems - integration of formal specification techniques - formal testing and quality assurance - validation and verification -------------------------------------------------------------------------- Workshop Format and Location The workshop will take place over four days (Friday to Monday) at Hotel Santa Croce in Fossabanda, a former monastery in the center of Pisa. It will include presentations selected on the basis of submitted abstracts as well as three invited talks. -------------------------------------------------------------------------- Submissions The scientific programme of the workshop will include presentations of recent results and ongoing research. The presentations will be selected by the Steering Committee on the basis of submitted abstracts according to originality, significance, and general interest. The abstracts must be up to two pages long including references, and should be formatted preferably using the standard Springer-Verlag LNCS style. If a longer version of the contribution is available, it can be made accessible on the web and referenced in the abstract. The abstracts have to be submitted electronically via the EasyChair system, at URL http://www.easychair.org/conferences/?conf=WADT2008. The final versions of the selected abstracts will be included in a hand-out for the workshop participants. After the workshop, selected authors will be invited to submit full papers for the refereed proceedings, which is expected to be published as a volume of Lecture Notes in Computer Science (Springer Verlag). -------------------------------------------------------------------------- Important Dates April 11, 2008 Submission deadline for abstracts April 21, 2008 Notification of acceptance May 16, 2008 Final abstract due June 13-16, 2008 Workshop in Pisa June 30, 2008 Invitation of full papers (for selected authors only) September 30, 2008 Submission deadline for full papers -------------------------------------------------------------------------- Invited Speakers Egon Boerger (Dipartimento di Informatica, Pisa) Luca Cardelli (Microsoft Research, Cambridge) Stephen Gilmore (Laboratory for Foundations of Computer Science, Edinburgh) -------------------------------------------------------------------------- Sponsorship The workshop takes place under the auspices of IFIP WG 1.3, and is sponsored by IFIP TC1. Support by other organizations is also being sought. The event is organized by the Computer Science Department of Pisa University. -------------------------------------------------------------------------- WADT Steering Committee Michel Bidoit (France) Jose' Fiadeiro (UK) [chair] Hans-Joerg Kreowski (Germany) Till Mossakowski (Germany) Peter Mosses (UK) Fernando Orejas (Spain) Francesco Parisi-Presicce (Italy) Andrzej Tarlecki (Poland) Local organizers (Pisa) Filippo Bonchi Roberto Bruni Vincenzo Ciancia Andrea Corradini (chair) Fabio Gadducci -------------------------------------------------------------------------- Accommodation Several rooms have been pre-booked for the WADT2008 participants at a convenient rate at Hotel Santa Croce in Fossabanda. Detailed instructions for booking will be published on the WADT2008 web page. ---------------------------------------------------------------------------- Information For any information about the workshop, feel free to contact Andrea Corradini Dipartimento di Informatica Largo Bruno Pontecorvo, 3 I-56127 Pisa, Italy Phone: +39 050 2212786 Fax: +39 050 2212726 Email: andrea@di.unipi.it ---------------------------------------------------------------------------- From rrosebru@mta.ca Mon Jan 7 15:19:26 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 07 Jan 2008 15:19:26 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JBxNq-0002Nt-DO for categories-list@mta.ca; Mon, 07 Jan 2008 15:11:38 -0400 Subject: categories: MSc Opportunities Date: Mon, 7 Jan 2008 14:11:26 -0400 From: "Wendy MacCaull" To: Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: quoted-printable Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: RO X-Status: X-Keywords: X-UID: 6 [apologies for multiple postings] =20 MSc Opportunities in Verification, Knowledge Representation, and Logic Programming =20 Applications are invited from students interested in pursuing an MSc in Computer Science at St. Francis Xavier University. Students will be pursuing thesis research in an area related to one of the following: verification, logic programming, automated theorem proving, temporal, modal, paraconsistent and other nonclassical logics, knowledge representation, ontology building and merging, scheduling, and requirements and software engineering. The students will join a growing research group at the StFX Centre for Logic and Information, in Antigonish, NS, that is collaborating on a prestigious international research and development project with a health informatics company and a regional Health Authority. The project goal is verifiable and innovative workflow and decision support products for complex and distributed systems. Opportunities exist within the project to work on applications in parallel and high performance computing using ACENet, Atlantic Canada's high performance computing consortium ( www.ace-net.ca ). =20 Project Lead: Dr.Wendy MacCaull, Professor of Mathematics, Statistics and Computer Science and Director of the StFX Centre for Logic and Information. ( http://logic.stfx.ca ) =20 Qualifications: A BSc. Honours degree in Computer Science (or closely related subject). =20 Funding: Students without external funding will be awarded funding for 2 years at the rate of $16,000 per year. Once accepted, students are encouraged to apply for graduate student assistantships which typically cover the cost of tuition; duties average 4 to 6 hours per week. Students with external funding will receive a suitable supplement. Canadian citizens and permanent residents of Canada will have the opportunity of applying for an NSERC Industrial Postgraduate Scholarship (IPS) and working on site with the health informatics company for 20% of each year. =20 To Apply: Interested students should forward a university transcript and a covering letter which outlines their interests and their experience, especially with respect to the thesis research areas, and includes the names and addresses of 3 references to Dr. W. MacCaull (wmaccaul@stfx.ca). Simultaneously they should submit their application for graduate studies to StFX, see: http://www.stfx.ca/academic/mathcs/MASTERS/index.html . Applicants will be reviewed, initially, on Feb. 15, 2008, but the file will remain open until filled. =20 =20 All accepted applicants will be expected to adhere to the Centre's Intellectual Property commitments and contractual obligations and sign a confidentiality agreement. =20 =20 Wendy MacCaull, PhD, Professor, Department of Math/Stats/Comp Sci Director, Centre for Logic and Information, St. Francis Xavier University, PO Box 5000, Antigonish, NS, CANADA, B2G 2W5, email: wmaccaul@stfx.ca Phone: 902 867-3989 FAX: 902 867-1397 =20 Or=20 Project Manager, Janet Norgrove Phone: 902 867-2449 email: jnorgrove@stfx.ca =20 =20 From rrosebru@mta.ca Mon Jan 7 15:19:26 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 07 Jan 2008 15:19:26 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JBxJG-0001VE-Qa for categories-list@mta.ca; Mon, 07 Jan 2008 15:06:54 -0400 Date: Mon, 7 Jan 2008 11:08:55 +0000 (GMT) From: Richard Garner To: categories@mta.ca Subject: categories: Cartesian closed without products MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII; format=flowed Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: RO X-Status: X-Keywords: X-UID: 7 Dear categorists, A small category C has finite products just when the representables in [C^op, Set] are closed under finite products. It is cartesian closed just when the representables are closed under finite products and internal hom. It seems natural, therefore, to consider a notion of "cartesian closedness without finite products": categories in which the representables are closed in [C^op, Set] under internal hom but not necessarily under finite products. This amounts to giving, for each pair of objects X and Y, an object [X, Y] together with a universal natural transformation C(-, [X, Y]) x C(-, X) -> C(-, Y). Such categories will be closed in the sense of Eilenberg-Kelly without necessarily being monoidal: let us call them "universally closed" for now. Obviously, any cartesian closed category is universally closed; and categorical proof theory gives us a class of non-degenerate examples built from the syntax of (classical) sequent calculi with implication but no product. The question now arises as to whether there are any non-syntactic examples of universally closed categories which are not cartesian closed. The most likely place seems to me to be domain theory, but I have been unable to track anything down. Does anyone have any pointers? Thanks, Richard. From rrosebru@mta.ca Mon Jan 7 15:19:27 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 07 Jan 2008 15:19:27 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JBxKr-0001mR-Py for categories-list@mta.ca; Mon, 07 Jan 2008 15:08:33 -0400 Date: Mon, 7 Jan 2008 15:34:13 +0200 (EET) Subject: categories: pssl87 - second announcement From: "Panagis Karazeris" To: categories@mta.ca MIME-Version: 1.0 Content-Type: text/plain;charset=iso-8859-7 Content-Transfer-Encoding: quoted-printable Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: RO X-Status: X-Keywords: X-UID: 8 Peripatetic Seminar on Sheaves and Logic 87 Honouring the 70th birthday of Anders Kock Patras, 21-23 March 2008 The 87th Peripatetic Seminar on Sheaves and Logic will be held in Patras, Greece, on 22-23 March 2008. An extra session will be held in the afternoon of Friday 21 March, celebrating the 70th birthday of Anders Kock. A. Joyal, F. W. Lawvere and G. Reyes will participate honouring Anders. M. Bunge was kind enough to lead the registered participants list. A list of participants will appear soon in http://www.math.upatras.gr/~pssl87/ Accommodation Information: The University of Patras is located in the suburbs, 10 km NE of the downtown area. The participants have the options of either staying downtown or in one of the hotels along the coast near the University. In the first case they will have to use local transportation (bus or taxi= ). In the second case they may choose to walk (weather permitting) or get a ride by the people involved in the organization. With the second option in mind, a number of rooms has been reserved at Hotel Achaia Beach and will be available at the price of 69 Euros (single room) and 85 Euros (double room), provided that reservatio= n is confirmed before 15 January 2008. The hotel is 2,5 km away from the PSSL venue and has the extra advantage of being close to some fine restaurants and in walking distance from the cafes, bars and restaurants of the coast of Rion, which starts getting lively at that time of the year. If you wish to book a hotel room yourself you may consult http://www.tripadvisor.com/Hotels-g189488-Patras_Peloponnese-Hotels.html Registration: You may register for PSSL87 by filling out the following fo= rm REGISTRATION FORM Name: ....... Affiliation: ..... I wish to give a talk: YES/NO Title: ..... Arrival Date: .... Departure Date: .... I wish to book a hotel room in Achaia Beach Hotel: YES/NO - SINGLE/DOUBLE and submitting it to pssl87@math.upatras.gr Transportation Information: Patras is located 220km W of the Athens airport. The best way to approach it is to use the Athens Suburban Railway (Proastiakos) which stretches west up to the town of Kiato, on the northern coast of the Peloponnese, 110km away from Patras. The idea is to arrange some private car or coach rides from Kiato to Patras, according to the date and time of arrival of most of you. Otherwise there is the option of getting on the (slow, narro= w gauge) train to Patras. More details will follow in the meeting's webpage. From rrosebru@mta.ca Mon Jan 7 15:19:27 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 07 Jan 2008 15:19:27 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JBxLm-0001wG-Eq for categories-list@mta.ca; Mon, 07 Jan 2008 15:09:30 -0400 Date: Mon, 7 Jan 2008 14:09:54 +0000 (GMT) From: Richard Garner To: categories@mta.ca Subject: categories: Re: Cartesian closed without products MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII; format=flowed Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: RO X-Status: X-Keywords: X-UID: 9 A minor correction: > A small category C has finite products just when the > representables in [C^op, Set] are closed under finite > products. It is cartesian closed just when the > representables are closed under finite products and > internal hom. > > It seems natural, therefore, to consider a notion of > "cartesian closedness without finite products": categories > in which the representables are closed in [C^op, Set] under > internal hom but not necessarily under finite products. > This amounts to giving, for each pair of objects X and Y, > an object [X, Y] together with a universal natural > transformation C(-, [X, Y]) x C(-, X) -> C(-, Y). Such > categories will be closed in the sense of Eilenberg-Kelly > without necessarily being monoidal: On reflection, this bit isn't necessarily true, since EK-closed requires the unit object to be representable as well. Richard From rrosebru@mta.ca Mon Jan 7 15:19:27 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 07 Jan 2008 15:19:27 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JBxMh-0002Ac-QR for categories-list@mta.ca; Mon, 07 Jan 2008 15:10:31 -0400 Date: Mon, 07 Jan 2008 18:20:25 +0100 From: Clemens Kupke MIME-Version: 1.0 To: Clemens Kupke Subject: categories: CMCS 2008: Final call for papers 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: RO X-Status: X-Keywords: X-UID: 10 CMCS 2008 Final Announcement Please excuse multiple copies 9th International Workshop on Coalgebraic Methods in Computer Science http://www.cwi.nl/projects/cmcs08/ Budapest, Hungary April 4-6, 2008 Key Note Speaker: Dexter Kozen (to be confirmed) Invited Speakers: Stefan Milius and Dirk Pattinson The workshop will be held in conjunction with the 11th European Joint Conferences on Theory and Practice of Software ETAPS 2008 March 29 - April 6, 2008 Programme Committee Jiri Adamek (chair, Braunschweig), Corina Cirstea (Southampton), Neil Ghani (Nottingham), H. Peter Gumm (Marburg), Bart Jacobs (Nijmegen), Clemens Kupke (co-chair, Amsterdam), Alexander Kurz (Leicester), Ugo Montanari (Pisa), Larry Moss (Indiana), John Power (Bath), Jan Rutten (Amsterdam), Lutz Schr=F6der (Bremen), Tarmo Uustalu (Tallinn), Yde Venema (Amsterdam), Hiroshi Watanabe (Osaka). Submissions Two sorts of submissions will be possible this year: Papers to be evaluated by the programme committee for inclusion in the ENTCS proceedings: These papers must be written using ENTCS style files and be of length no greater than 20 pages. They must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. If a submission describes software, software tools, or their use, it should include all source code that is needed to reproduce the results but is not publicly available. If the additional material exceeds 5 MB, URL's of publicly available sites should be provided in the paper. Short contributions: These will not be published but will be compiled into a technical report of the Technical University of Braunschweig. They should be no more than two pages and may describe work in progress, summarise work submitted to a conference or workshop elsewhere, or in some other way appeal to the CMCS audience. Both sorts of submission should be submitted in postscript or pdf form as attachments to an email to cmcs08@cwi.nl. The email should include the title, corresponding author, and, for the first kind of submission, a text-only one-page abstract. After the workshop, we expect to produce a journal proceedings of extended versions of selected papers to appear in Theoretical Computer Science. Important Dates Deadline for submission of regular papers: January 13, 2008. Notification of acceptance of regular papers: February 11, 2008. Final version for the preliminary proceedings: February 18, 2008. Deadline for submission of short contributions: March 10, 2008. Notification of acceptance of short contributions: March 17, 2008. For more information, please write to cmcs08@cwi.nl From rrosebru@mta.ca Tue Jan 8 14:24:59 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 08 Jan 2008 14:24:59 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JCJ0o-0005w1-Sb for categories-list@mta.ca; Tue, 08 Jan 2008 14:17:19 -0400 Date: Mon, 7 Jan 2008 13:35:11 -0800 From: Toby Bartels To: categories@mta.ca Subject: categories: Re: Cartesian closed without products 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: 11 Richard Garner wrote: >On reflection, [...] >EK-closed requires the unit object to be representable as >well. This is a reasonable requirement anyway, since the unit is the 0fold iterated hom, just as it's the 0fold iterated product. So if you think should be accompanied by , then so should . OTOH, the version without unit probably has some use, just as non-monoid semigroups occasionally do. --Toby From rrosebru@mta.ca Wed Jan 9 19:34:05 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 09 Jan 2008 19:34:05 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JCkFk-0001S6-JD for categories-list@mta.ca; Wed, 09 Jan 2008 19:22:32 -0400 Date: Tue, 8 Jan 2008 18:29:09 -0800 From: Toby Bartels To: categories@mta.ca Subject: categories: Re: Cartesian closed without products 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: 12 Peter wrote: >Toby wrote: >>This is a reasonable requirement anyway, >>since the unit is the 0fold iterated hom, >>just as it's the 0fold iterated product. >What is the "0fold iterated" of a non-associative operation? OK, admittedly it's a bit ambiguous, and I should not have used the adverb "just". But given a finite list (X_i : i < n) of n sets (or other objects), the n-fold iterated hom may be defined by recursion on n as follows: * The 0fold iterated hom of the empty list is the unit object; and * the (n + 1)fold iterated hom of the list (X_i : i < n + 1) is hom[Y,X_n], where Y is the n-fold iterated hom of (X_i : i < n). Of course, you might use hom[X_n,Y] instead, but (even if you change the base case) this will not work. It would work if you make the 1fold version the base case, so there are (at least) two notions of iterated hom, but only one of these has a 0fold case. If you use exponential notation for the hom, then the n-fold iterated hom has a well-known notation $ X_{n-1} ^ {X_{n-2} ^ {X_{n-3} ^ {\rddots ^ {X_2 ^ {X_1 ^ {X_0}}}}}} $ (in TeX, where |rddots| is the reverse of the standard |ddots|). The version using hom[X_n,Y], although written in a more pleasant order, required parentheses (or can be rewritten using multiplication). On the other hand, logicians (using implication for the hom) require parentheses for my iterated hom. Note that the 0fold case relies on the property hom[1,X] = X, so a ~general~ nonassociative operation doesn't have a 0fold iteration. A nonassociative operation both distinct left and right units would have two (a priori) equally justified 0fold iterations. --Toby From rrosebru@mta.ca Wed Jan 9 19:34:05 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 09 Jan 2008 19:34:05 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JCkF5-0001O9-TU for categories-list@mta.ca; Wed, 09 Jan 2008 19:21:51 -0400 Subject: categories: Re: Cartesian closed without products Date: Tue, 8 Jan 2008 21:36:39 -0400 (AST) To: categories@mta.ca 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: 13 Toby Bartels wrote: > > Richard Garner wrote: > > >On reflection, [...] > >EK-closed requires the unit object to be representable as > >well. > > This is a reasonable requirement anyway, > since the unit is the 0fold iterated hom, > just as it's the 0fold iterated product. > So if you think > should be accompanied by , > then so should . > > OTOH, the version without unit probably has some use, > just as non-monoid semigroups occasionally do. What is the "0fold iterated" of a non-associative operation? -- Peter From rrosebru@mta.ca Wed Jan 9 19:34:05 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 09 Jan 2008 19:34:05 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JCkEB-0001IS-Hi for categories-list@mta.ca; Wed, 09 Jan 2008 19:20:55 -0400 From: "Ronnie" To: Subject: categories: Re: Cartesian closed without products Date: Tue, 8 Jan 2008 21:29:50 -0000 MIME-Version: 1.0 Content-Type: text/plain;format=flowed; charset="iso-8859-1";reply-type=original Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 14 Toby Bartels wrote: > > OTOH, the version without unit probably has some use, > just as non-monoid semigroups occasionally do. Just a thought that this interest may be more than occasional: inverse semigroups are closely related to pseudogroups and so are part of Charles Ehresmann local-to-global view and interests, with a deep relation to ordered groupoids (see further work by Mark Lawson). So all these partial units express something on the *local* structure, even if there is a global unit. My paper with Aof (based on ideas of Pradines) uses an inverse semigroup generated by continuous local admissible sections. (with M. E.-S. A.-F. AOF), ``The holonomy groupoid of a locally topological groupoid'', {\em Top. and its Appl.}, 47 (1992) 97-113. Is this a rash view that one should look more at inverse categories? Ronnie Brown From rrosebru@mta.ca Sat Jan 12 12:25:50 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sat, 12 Jan 2008 12:25:50 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JDiwc-0005p8-IF for categories-list@mta.ca; Sat, 12 Jan 2008 12:10:50 -0400 Date: Fri, 11 Jan 2008 12:13:38 +0100 From: Venanzio Capretta MIME-Version: 1.0 To: categories@mta.ca Subject: categories: MSFP call for papers 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: 15 CALL FOR PAPERS Second Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING 6 July 2008, Reykjavik - Iceland A satellite workshop of ICALP 2008 PRESENTATION The workshop on Mathematically Structured Functional Programming is=20 devoted to the derivation of functionality from structure. It is a=20 celebration of the direct impact of Theoretical Computer Science on=20 programs as we write them today. Modern programming languages, and in=20 particular functional languages, support the direct expression of=20 mathematical structures, equipping programmers with tools of remarkable=20 power and abstraction. Monadic programming in Haskell is the=20 paradigmatic example, but there are many more mathematical insights=20 manifest in programs and in programming language design:=20 Freyd-categories in reactive programming, symbolic differentiation=20 yielding context structures, and comonadic presentations of dataflow, to=20 name but three. This workshop is a forum for researchers who seek to=20 reflect mathematical phenomena in data and control. The first MSFP workshop was held in Kuressaare, Estonia, in July 2006.=20 An associated special issue of the Journal of Functional Programming is=20 in preparation. SUBMISSIONS Electronic Notes in Theoretical Computer Science have provisionally=20 agreed to publish the proceedings of MSFP 2008. ENTCS require=20 submissions in LaTeX, formatted according to their guidelines=20 (http://www.entcs.org/prelim.html). Papers must report previously unpublished work and not be submitted=20 concurrently to another conference with refereed proceedings. Programme=20 Committee members, barring the co-chairs, may (and indeed are encouraged=20 to) contribute. Accepted papers must be presented at the workshop by one=20 of the authors. There is no specific page limit, but authors should strive for brevity. We are using the EasyChair software to manage submissions. To submit a paper, please log in at: http://www.easychair.org/conferences/?conf=3Dmsfp2008. TIMELINE: Submission of abstracts: 4 April Submission of papers: 11 April Notification: 16 May Final versions due: 13 June Workshop: 6 July For more information about the workshop, go to: http://msfp.org.uk/ Programme Committee * Yves Bertot, INRIA, Sophia-Antipolis, France * Venanzio Capretta (co-chair), Radboud University, Nijmegen, The=20 Netherlands * Jacques Carette, McMaster University, Hamilton, Ontario, Canada * Thierry Coquand, Chalmers University, G=F6teborg, Sweden * Andrzej Filinski, DIKU, University of Copenhagen, Denmark * Jean-Christophe Filli=E2tre, LRI, Universit=E9 Paris Sud, France * Jeremy Gibbons, Oxford University, England * Andy Gill, Galois Inc., Portland, Oregon, USA * Peter Hancock, University of Nottingham, England * Oleg Kiselyov, FNMOC, Monterey, California, USA * Paul Blain Levy, University of Birmingham, England * Andres L=F6h, Utrecht University, The Netherlands * Marino Miculan, Universit=E0 di Udine, Italy * Conor McBride (co-chair), Alta Systems, Northern Ireland * James McKinna, Radboud University, Nijmegen, The Netherlands * Alex Simpson, University of Edinburgh, Scotland * Tarmo Uustalu, Institute of Cybernetics, Tallinn, Estonia From rrosebru@mta.ca Sat Jan 12 12:25:51 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sat, 12 Jan 2008 12:25:51 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JDivy-0005ke-E9 for categories-list@mta.ca; Sat, 12 Jan 2008 12:10:10 -0400 Content-Type: text/plain; charset=US-ASCII; delsp=yes; format=flowed Content-Transfer-Encoding: 7bit From: Marco Grandis Subject: categories: Inverse and orthodox categories Date: Fri, 11 Jan 2008 09:46:55 +0100 To: categories@mta.ca Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 16 Dear Ronnie, This is about your remarks: > inverse semigroups are closely related to pseudogroups and so are part of Charles Ehresmann local-to-global view > Is this a rash view that one should look more at inverse categories? I worked on two subjects where inverse categories are important, homological algebra and a categorical approach to manifolds - this second point, of course, agrees with the first citation above, from your posting. 1. While studying universal models of spectral sequences, in the 70's-80s, I studied inverse categories, as well as a more general notion, orthodox categories (the analogue of orthodox semigroups, ie regular semigroups where idempotents are closed under multiplication). The link comes from the fact that the main theories which produce spectral sequences (the filtered complex, the double complex, Massey's exact couple) are 'distributive', in the sense that their classifying Puppe-exact category E has distributive lattices of subobjects (notice that this aspect would be lost if one uses the classifying *abelian* category, since the existence of products clashes with distributivity). Now, the distributivity of E is equivalent to the fact that the (involutive) category of relations of E is orthodox (i.e., idempotent endorelations are closed under composition), and also to the fact that canonical isomorphisms between subquotients in E are closed under composition (a crucial fact when working in homological algebra). Moreover, as an orthodox category, RelE has a canonical quotient which is an inverse category; in the latter, the study of subquotients of E is easier. (Notice that subquotients in E amount to subobjects in RelE, as well as in its inverse quotient. The first fact was already used in Mac Lane's 'Homology' to define induced homomorphisms; in an abelian context, of course.) All this is developed in various papers, but a synopsis can be found in [1]. Paper [2] shows that every small inverse category can be embedded in the standard example of inverse categories: sets and partial bijections (ie, bijections between subsets of domain and codomain, composed as relations). 2. Inverse categories are of interest when viewing manifolds as enriched categories, in the line of the well-known Lawvere's paper on metric spaces. More generally, the procedure works for 'glueing structures', defined by glueing elementary ones: manifolds, fibre bundles, foliations... Here, the basic inverse category for manifolds is the category C of open subspaces of all euclidean spaces, with partial homeomorphisms (or diffeomorphisms) between open subsets of domain and codomain. A manifold is then defined replacing the usual atlas of charts U_i --> R^n with the 'glueing atlas' of such partial bijections U_i --> U_j. This atlas is, in a sense to be made precise, a category enriched over C - as an involutive ordered category endowed with further structure. The underlying topological space is recovered as a lax colimit. See [3, 4]. References [1] M. Grandis, Sous-quotients et relations induites dans les categories exactes, Cahiers Topologie Geom. Differentielle 22 (1981), 231-238. [2] --, Concrete representations for inverse and distributive exact categories, Rend. Accad. Naz. Sci. XL, Mem. Mat. 8 (1984), 99-120. [3] --, Manifolds as enriched categories, in: Categorical Topology, Prague 1988, pp.358-368, World Scientific 1989. [4] --, Cohesive categories and manifolds, Ann. Mat. Pura Appl. 157 (1990), 199-244. With best regards Marco From rrosebru@mta.ca Sat Jan 12 12:25:51 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sat, 12 Jan 2008 12:25:51 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JDiv4-0005gR-Oi for categories-list@mta.ca; Sat, 12 Jan 2008 12:09:14 -0400 Date: Thu, 10 Jan 2008 11:27:09 +0000 From: Maria Manuel Clementino MIME-Version: 1.0 To: categories@mta.ca Subject: categories: PhD Program in Mathematics - U Coimbra / U Porto 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: 17 A joint PhD Program in Mathematics has recently been launched by the Universities of Coimbra and Porto. Applications for the second year of the program are open and will be accepted until January 31, 2008. The Program offers up to 12 scholarships (covering tuition and living expenses) to selected candidates. All relevant information can be found at http://www.mat.uc.pt/phd_prog I appreciate your help in bringing this program to the attention of qualified students. Thank you in advance. Maria Manuel Clementino From rrosebru@mta.ca Sat Jan 12 12:25:51 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sat, 12 Jan 2008 12:25:51 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JDix2-0005qs-2m for categories-list@mta.ca; Sat, 12 Jan 2008 12:11:16 -0400 To: categories@mta.ca Subject: categories: Postdoc Opening, Nancy (France) Date: Fri, 11 Jan 2008 10:29:40 -0500 (EST) From: gardent@loria.fr (Claire Gardent) Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 18 Postdoctoral Position at INRIA Nancy (France) Field: Computational Linguistics Topic: Surface realisation and large scale over-generation detection Deadline for application: February 15, 2008. Starting Date: 01 November 2008 Employer: INRIA (French National Institute for Research in Computer Science) Nancy Grand Est (France) Job Description: The Lorraine Laboratory of IT Research and its Applications (Nancy, France) has a position for a Postdoctoral fellow to work on the development of a surface realiser for French. Applicants must have a ** recent doctoral degree ** (PhD viva held in may 2007 or later) or defend their PhD before the end of 2008. They must have expertise in an area relevant to the project (linguistics, computational linguistics, computer science), strong hands-on experience in Natural Language Processing and a particular interest in NL generation. A good knowledge of Haskell is a necessity. Further particulars and details of how to apply are available at: http://www.loria.fr/~gardent The official closing date is February 15, 2007, but applications will be processed until the position is filled. Contact: Claire Gardent From rrosebru@mta.ca Mon Jan 14 14:47:04 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 14 Jan 2008 14:47:04 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JEU6E-0002jH-1f for categories-list@mta.ca; Mon, 14 Jan 2008 14:31:54 -0400 Date: Mon, 14 Jan 2008 15:08:01 +0100 From: GLOBAN 2008 Summer School To: categories@mta.ca Subject: categories: GLOBAN 2008 Summer School Announcement 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: RO X-Status: X-Keywords: X-UID: 19 =========================================================================== We apologise if you have received multiple copies of this call for participation. Please circulate to colleagues who might be interested. =========================================================================== FIRST ANNOUNCEMENT GLOBAN 2008 "The Global Computing Approach to Analysis of Systems" Warsaw, September 22-26, 2008 http://globan08.mimuw.edu.pl/ The GLOBAN 2008 summer school will give PhD students and other young researchers a comprehensive overview of contemporary techniques for analysis and verification of models for global computing systems and the mobile software that realises them. The school is organised by Institute of Informatics, Warsaw University, in association with the MOBIUS and SENSORIA 6th Framework Programme projects. Lectures: --------- - Rocco De Nicola Session Centered Calculi for Service Oriented Computing - Andrew D. Gordon Declarative Data Centres - Reiko Heckel Foundations of Model Transformations: A Lambda Calculus for MDD? - Martin Hofmann Type-based Verification in Global Computing - Joost-Pieter Katoen Performance Analysis and Model Checking - A Perfect Match - Joe Kiniry Verification-centric Software Engineering - Flemming Nielson Static Analysis of Services - Andrei Sabelfeld Information-flow Security Project presentations by: ------------------------- - Gilles Barthe Mobility, Ubiquity and Security: Proof-carrying Code for Java on Mobile Devices - Martin Wirsing SENSORIA: Software Engineering for Service-Oriented Overlay Computers Steering Committee: ------------------- - Gilles Barthe - Flemming Nielson - Ian Stark - Andrzej Tarlecki - Martin Wirsing Important dates: ---------------- Early registration deadline: May 15, 2008 Grant application deadline: May 15, 2008 Notification of early qualifying decisions: May 26, 2008 Notification of grant decisions: May 26, 2008 Registration deadline: July 3, 2008 Notification of qualifying decisions: July 14, 2008 Summer school: September 22-26, 2008 From rrosebru@mta.ca Mon Jan 14 14:47:04 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 14 Jan 2008 14:47:04 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JEU5P-0002cB-Un for categories-list@mta.ca; Mon, 14 Jan 2008 14:31:04 -0400 To: LICS List From: Kreutzer + Schweikardt Subject: categories: LICS Newsletter 113 Date: Mon, 14 Jan 2008 13:00:04 +0100 (CET) Reply-To: lics@informatik.hu-berlin.de Date: Mon, 14 Jan 2008 13:00:04 +0100 (CET) Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: RO X-Status: X-Keywords: X-UID: 20 Newsletter 113 January 14, 2008 ******************************************************************* * 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 LICS 2008 - Abstract Deadline TODAY LICS 2008 - List of Workshops * AWARDS Ackermann Award 2008 - Call for Nominations * CONFERENCES AND WORKSHOPS RUSSELL 2008 - PROOF THEORY MEETS TYPE THEORY WORKSHOP ON MODAL FIXPOINT LOGICS CSL 2008 - Call for Papers/Panels/Workshops CAV 2008 - Call for Papers AMAST 2008 - Call for Papers CONCUR 2008 - Call for Papers * POSITIONS POSTDOCTORAL POSITION AT INRIA NANCY (FRANCE) LOGIC IN COMPUTER SCIENCE (LICS) 2008 * The deadline for submitting a title and short abstract to LICS 2008 is TODAY, Monday January 14 11:59pm EST. * The deadline for extended abstracts is 11:59pm EST, Monday, January 21, 2008. LOGIC IN COMPUTER SCIENCE (LICS) 2008 There will be five workshops co-located with LICS 2008. * June 21: (CoLocated with CSF) - FCS-ARSPA-WITS (L.Bauer, S.Etalle, J.den Hartog, L.Vigano) - Security and Rewriting, SecRet2008 (Dan Dougherty, Santiago Escobar) * June 22: - FCS-ARSPA-WITS (continued from the 21st) - Proof-Carrying Code PCC08 (Ian Stark, David Aspinall) * June 23: - Intuitionist Modal Logics and Applications IMLA08 (Valeria de Paiva, Aleks Nanevski) - International Workshop on Logical Frameworks and MetaLanguages (LFMTP) (Andreas Abel, Christian Urban) 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. RUSSELL'08 - PROOF THEORY MEETS TYPE THEORY A "Small Workshop" of the European TYPES Project Call for Participation and Contributed Talks Swansea, Wales, 15-16 March 2008 http://cs.swan.ac.uk/~csetzer/russell08/index.html * In 1908 the British Philosopher and Mathematician Bertrand Russell, who was born and died in Wales, published the article "Mathematical Logic as based on the Theory of Types" which contained a first matured exposition of Type Theory. In the same year, Ernst Zermelo's "Untersuchungen ueber die Grundlagen der Mengenlehre I" introduced the basis of current axiomatic set theory as an alternative approach to the foundations of Mathematics. A central theme of Proof Theory is to compare these different foundations. Proof Theory uses as its main tool ordinal notation systems, the basis of which was laid by Oswald Veblen in his paper "Continuous Increasing Functions of Finite and Transfinite Ordinals", again in 1908. A century later, Proof Theory and Type Theory are flourishing more than ever before, and their manifold interconnections are driving important developments in Mathematics and Computer Science. At this workshop we meet and discuss cutting edge research at the interface of Proof Theory and Type Theory. * Topics of interest include, but are not limited to: Proof Theory of Type Theory; Relationship between Type Theory and Set Theory; Program extraction from proofs; Normalisation and Cut-elimination; New approaches to ordinal analysis Universes and reflection principles; Equality in Type Theory; Philosophical and historical aspects of Proof Theory and Type Theory * Invited Speakers: To be confirmed. * Participation and Contributed Talks: Please send an email to Anton Setzer (a.g.setzer@swansea.ac.uk) as soon as possible, but no later than the 29th of February 2008. WORKSHOP ON MODAL FIXPOINT LOGICS Call for contributions March 25-27, Amsterdam, the Netherlands Organizers: Luigi Santocanale and Yde Venema. * The aim of the workshop is to bring together researchers from various backgrounds, in particular, computer scientists and pure logicians, in order to discuss modal fixpoint logics from various perspectives, including those of model theory, proof theory, algebra and duality, and automata theory. * Deadline for submission of contributed papers: February 1, 2008. * Invited speakers: Giovanna D'Agostino, Johan van Benthem, Marcello Bonsangue, Dietmar Berwanger, Erich Graedel (to be confirmed), Dexter Kozen (to be confirmed), Giacomo Lenzi, Damian Niwinski, Colin Stirling, Thomas Studer, Albert Visser, Igor Walukiewicz, and Thomas Wilke (to be confirmed). * Further information can be found at http://staff.science.uva.nl/~yde/mfl 21st IEEE Computer Security Foundations Symposium (CSF) Pittsburgh, PA, USA, June 23-25, 2008 Sponsored by the Technical Committee on Security and Privacy of the IEEE Computer Society * CSF 2008 website: http://www.cylab.cmu.edu/CSF2008/ CSF home page: http://www.ieee-security.org/CSFWweb/ CSF CFP: http://www.cs.chalmers.se/~andrei/CSF08/cfp.html * The IEEE Computer Security Foundations (CSF) series brings together researchers in computer science to examine foundational issues in computer security. Over the past two decades, many seminal papers and techniques have been presented first at CSF. The CiteSeer Impact page (http://citeseer.ist.psu.edu/impact.html ) lists CSF as 38th out of more than 1200 computer science venues, top 3.11% in impact based on citation frequency. * This year's CSF will be colocated with the 23rd IEEE Symposium on Logic in Computer Science (LICS). It will be held at Carnegie Mellon University in Pittsburgh, Pennsylvania, USA. * We are proud to announce a joint CSF/LICS invited speaker: David Basin. * New theoretical results in computer security are welcome. Also welcome are more exploratory presentations, which may examine open questions and raise fundamental concerns about existing theories. Panel proposals are sought as well as papers. Possible topics include, but are not limited to: - Access control - Anonymity and Privacy - Authentication - Data and system integrity - Database security - Decidability and complexity - Distributed systems security - Electronic voting - Executable content - Formal methods for security - Information flow - Intrusion detection - Language-based security - Network security - Resource usage control - Security for mobile computing - Security models - Security protocols - Trust and trust management * While CSF welcomes submissions beyond these topics, note that the main focus of CSF is foundational security: submissions that lack foundational aspects risk rejection. * Proceedings, published by the IEEE Computer Society Press, will be available at the symposium, and selected papers will be invited for submission to the Journal of Computer Security. * Important Dates Workshop proposals due: Tuesday, November 20, 2007 Papers due: Tuesday, January 29, 2008 Panel proposals due: Thursday, March 6, 2008 Notification: Monday, March 17, 2008 Camera-ready papers: Wednesday, April 9, 2008 Symposium: June 23-25, 2008 * There are PDF and HTML versions of this call for papers at http://www.cs.chalmers.se/~andrei/CSF08/cfp.html. CAV 2008 - 20TH INTERNATIONAL CONFERENCE ON COMPUTER AIDED VERIFICATION Call for Papers Call for Nominations for CAV Award July 7-14, 2008, Princeton, NJ, USA http://www.princeton.edu/cav2008 * CAV 2008 is the 20th in a series dedicated to the advancement of the theory and practice of computer-aided formal analysis methods for hardware and software systems. CAV considers it vital to continue its leadership in hardware verification, maintain its recent momentum in software verification, and consider new domains such as biological systems. * Events: - CAV Award (please see website for Call for Nominations) - Four pre-conference (July 7, 8), three post-conference (July 14) workshops * Important dates: - Jan 28, 2008: Paper submission deadline - Jan 28, 2008: Nominations for CAV Award deadline - March 26, 2008: Author notification for papers * Details available on conference website. AMAST 2008 - 12th INTERNATIONAL CONFERENCE ON ALGEBRAIC METHODOLOGY AND SOFTWARE TECHNOLOGY Call for Papers July 28-31, 2008, Urbana, Illinois, United States http://amast08.cs.uiuc.edu * The major goal of the AMAST conferences is to promote research towards setting software technology on a firm, mathematical basis. Work towards this goal is a collaborative, international effort with contributions from both academia and industry. The envisioned virtues of providing software technology developed on a mathematical basis include: correctness, which can be proved mathematically; safety, so that developed software can be used in the implementation of critical systems; portability, i.e., independence from computing platforms and language generations; and evolutionary change, i.e., the software is self-adaptable and evolves with the problem domain. * Topics of interest include: systems software technology; application software technology; concurrent and reactive systems; formal methods in industrial software development; formal techniques for software requirements, design; evolutionary software/adaptive systems; logic programming, functional programming, object paradigms; constraint programming and concurrency; program verification and transformation; programming calculi; specification languages and tools; formal specification and development case studies; logic, category theory, relation algebra, computational algebra; algebraic foundations for languages and systems, coinduction; theorem proving and logical frameworks for reasoning; logics of programs; algebra and coalgebra. For system demonstrations or ordinary papers: software development environments; support for correct software development; system support for reuse; tools for prototyping; component based software development tools; validation and verification; computer algebra systems; theorem proving systems. * Important dates: Abstract submission due: 1 March 2008; Paper submission due: 8 March 2008; Notification: 20 April 2008 19TH INTERNATIONAL CONFERENCE ON CONCURRENCY THEORY (CONCUR 08) Call for Papers Toronto, Canada, August 19-22, 2008 http://www.cse.yorku.ca/concur08 * Submission deadline: April 11, 2008 * CONCUR 08, the 19th International Conference on Concurrency Theory, will take place in Toronto, Canada, on August 19-22, 2008. The purpose of the CONCUR conferences is to bring together researchers, developers, and students in order to advance the theory of concurrency, and promote its applications (in a broad sense). * CONCUR 08 will be collocated with the 27th Annual ACM SIGACT-SIGOPS Symposium on the Principles of Distributed Computing (PODC 2008). Furthermore, there will be a symposium celebrating the contributions of Nancy Lynch and a number of workshops on topics related to CONCUR and PODC. The overall event will take place at the University of Toronto on August 17-24, 2008. * CONCUR 08 welcomes two categories of papers: - regular papers; - tool papers. * Submissions are solicited in all areas of semantics, logics, verification and analysis of concurrent systems. The principal topics include (but are not limited to): - basic models of concurrency (such as abstract machines, domain theoretic models, game theoretic models, process algebras, and Petri nets); - logics for concurrency (such as modal logics, temporal logics and resource logics); - models of specialized systems (such as biology-inspired systems, circuits, hybrid systems, mobile systems, multi-core processors, probabilistic systems, real time systems, synchronous systems, and web services); - verification and analysis techniques for concurrent systems (such as abstract interpretation, atomicity checking, model-checking, race detection, run-time verification, state-space exploration, static analysis, synthesis, testing, theorem proving and type systems); - related programming models (such as distributed or object-oriented). * The link for submissions is http://www.easychair.org/conferences/?conf=CONCUR08 * Important dates Abstract Submission: April 4, 2008 Paper Submission: April 11, 2008 (strict) Notification: May 27, 2008 Final version due: June 17, 2008 * Program committee Luca de Alfaro, University of California, Santa Cruz, USA Pedro R. D'Argenio, Universidad Nacional de Cordoba, Argentina Jos Baeten, Eindhoven University of Technology, the Netherlands Christel Baier, Technical University Dresden, Germany Eike Best, Carl von Ossietzky Universitaet Oldenburg, Germany Dirk Beyer, Simon Fraser University, Canada Patricia Bouyer, LSV, CNRS & ENS Cachan, France Mario Bravetti, University of Bologna, Italy Franck van Breugel (co-chair), York University, Canada Ilaria Castellani, INRIA Sophia Antipolis, France Marsha Chechik (co-chair), University of Toronto, Canada Wan Fokkink, Vrije Universiteit Amsterdam/CWI, the Netherlands Rob van Glabbeek, National ICT Australia Arie Gurfinkel, Carnegie Mellon University, USA Anna Ingolfsdottir, Reykjavik University, Iceland Radha Jagadeesan, DePaul University, USA Barbara Koenig, University of Duisburg-Essen, Germany Marta Kwiatkowska, University of Oxford, UK Orna Kupferman, Hebrew University, Israel Kim Larsen, Aalborg University, Denmark Nancy Lynch, MIT, USA P. Madhusudan, UIUC, USA Ugo Montanari, University of Pisa, Italy Anca Muscholl, Universite Bordeaux, France Catuscia Palamidessi, INRIA Futurs and LIX, France Corina Pasareanu, Perot Systems/NASA Ames Research Center, USA Scott Smolka, SUNY at Stony Brook, USA Nobuko Yoshida, Imperial College London, UK POSTDOCTORAL POSITION AT INRIA NANCY (FRANCE) Field: Computational Linguistics Topic: Surface realisation and large scale over-generation detection * Deadline for application: February 15, 2008. * Starting Date: 01 November 2008 * Employer: INRIA (French National Institute for Research in Computer Science) Nancy Grand Est (France) * Job Description: The Lorraine Laboratory of IT Research and its Applications (Nancy, France) has a position for a Postdoctoral fellow to work on the development of a surface realiser for French. * Applicants must have a ** recent doctoral degree ** (PhD viva held in may 2007 or later) or defend their PhD before the end of 2008. They must have expertise in an area relevant to the project (linguistics, computational linguistics, computer science), strong hands-on experience in Natural Language Processing and a particular interest in NL generation. A good knowledge of Haskell is a necessity. * Further particulars and details of how to apply are available at: http://www.loria.fr/~gardent * The official closing date is February 15, 2007, but applications will be processed until the position is filled. * Contact: Claire Gardent From rrosebru@mta.ca Tue Jan 15 09:08:37 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 15 Jan 2008 09:08:37 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JElOz-0007Kj-Fc for categories-list@mta.ca; Tue, 15 Jan 2008 09:00:25 -0400 Date: Mon, 14 Jan 2008 12:26:28 -0800 From: Ashish Tiwari To: tiwari@csl.sri.com Subject: categories: RTA'08: Call For Papers Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 21 ******************************************************** * * * RTA 2008 * * Rewriting Techniques and Applications * * 19th International Conference * * * * July 15-17, 2008, Castle of Hagenberg, Austria * * http://www.risc.uni-linz.ac.at/conferences/rta2008/ * * * ******************************************************** The 19th International Conference on Rewriting Techniques and Applications (RTA 2008) is organised as part of the RISC Summer 2008, which comprises five conferences, five workshops and the Training School in Symbolic Computation, and is followed by the 3rd International School on Rewriting in Obergurgl. IMPORTANT DATES: Abstract: February 4, 2008 Paper Submission: February 11, 2008 Notification: April 4, 2008 Final version: April 25, 2008 RTA is the major forum for the presentation of research on all aspects of rewriting. Typical areas of interest include (but are not limited to): * Applications: case studies; analysis of cryptographic protocols; rule-based (functional and logic) programming; symbolic and algebraic computation; theorem proving; system synthesis and verification; proof checking; reasoning about programming languages and logics; program transformation; * Foundations: matching and unification; narrowing; completion techniques; strategies; rewriting calculi, constraint solving; tree automata; termination; combination; * Frameworks: string, term, and graph rewriting; lambda-calculus and higher-order rewriting; constrained rewriting/deduction; categorical and infinitary rewriting; integration of decision procedures; * Implementation: implementation techniques; parallel execution; rewrite tools; termination checking; * Semantics: equational logic; rewriting logic; rewriting models of programs. BEST PAPER AWARD: An award is given to the best paper or papers as decided by the program committee. STUDENT SUPPORT: Limited student support will be available and announced in future versions of this call. PROGRAMME COMMITTEE CHAIR: * Andrei Voronkov University of Manchester http://www.voronkov.com/ PROGRAMME COMMITTEE: * Maribel Fern=E1ndez King's College London * Neil Ghani University of Leicester * J=FCrgen Giesl RWTH Aachen * Guillem Godoy Universidad Polit=E9cnica de Catalu=F1a * Jean Goubault-Larrecq ENS Cachan * Tetsuo Ida University of Tsukuba * Claude Kirchner INRIA * Konstantin Korovin University of Manchester * Temur Kutsia Johannes Kepler University Linz * Aart Middeldorp University of Innsbruck * Paliath Narendran SUNY at Albany * Robert Nieuwenhuis Universidad Polit=E9cnica de Catalu=F1a * Micha=EBl Rusinowitch INRIA * Aaron Stump Washington University in St. Louis * Jean-Marc Talbot Universit=E9 de Provence * Yoshihito Toyama Tohoku University * Ralf Treinen Universit=E9 Paris Diderot * Andrei Voronkov University of Manchester * Hans Zantema Technische Universiteit Eindhoven GENERAL CHAIR: * Bruno Buchberger Johannes Kepler University Linz ORGANISING COMMITTEE CHAIR: * Temur Kutsia Johannes Kepler University Linz SUBMISSIONS: Submissions must be original and not submitted for publication elsewhere. Submission categories include regular research papers and system descriptions. Problem sets and submissions describing interesting applications of rewriting techniques are also welcome. The page limit for submissions is 15 pages in Springer LNCS style (10 pages for system descriptions). Papers must be submitted electronically through the EasyChair system. The submission Web page is http://www.easychair.org/conferences/?conf=3DRTA2008 From rrosebru@mta.ca Wed Jan 16 19:35:21 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 16 Jan 2008 19:35:21 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JFHaW-0002xd-MX for categories-list@mta.ca; Wed, 16 Jan 2008 19:22:28 -0400 Date: Tue, 15 Jan 2008 11:26:54 -0500 (EST) Subject: categories: Postdoc At U. Ottawa From: rblute@uottawa.ca To: "Categories Mailing List" 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: 22 Research Fellow/Postdoc Position in Category Theory, Logic and Computation, University of Ottawa The Logic and Category Theory Group in the Department of Mathematics and Statistics at the University of Ottawa is looking to hire at least one research fellow/postdoc beginning in September, 2008. The positions are in any area of category theory, categorical logic, and theoretical computer science. Research fellows / postdocs will participate in the activities of the Logic and Category Theory Group. This group includes faculty and students from several different Ottawa-area universities. In the Math Department, the Group currently includes 4 faculty members (R. Blute, P. Hofstra, P.E. Parent and P. Scot= t), as well as a number of postdocs and graduate students. For more information about our team, see http://www.site.uottawa.ca/~phil/lfc/. The research fellowships/postdocs are initially for one year, with a possible renewal for a second year. Duties include research and the teaching of two one-semester courses per year. Potential applicants should contact one of the following people: Richard Blute (rblute at uottawa.ca) Pieter Hofstra (phofstra at uottawa.ca) Paul-Eugene Parent (pparent at uottawa.ca) Philip Scott (phil at site.uottawa.ca) right away by email to indicate their interest, including sending a cv. Note that these postdoctoral positions are in competition with other research groups in the department, and the number is limited. From rrosebru@mta.ca Wed Jan 16 19:35:21 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 16 Jan 2008 19:35:21 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JFHZF-0002om-Uo for categories-list@mta.ca; Wed, 16 Jan 2008 19:21:10 -0400 Date: Tue, 15 Jan 2008 17:45:40 +0100 From: Clemens Kupke MIME-Version: 1.0 To: Clemens Kupke Subject: categories: CMCS 2008: Extended deadline 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: 23 [- Apologies for multiple copies -] DEADLINE EXTENSION: New deadline for submissions of regular papers on **Monday, January 21** CMCS 2008 9th International Workshop on Coalgebraic Methods in Computer Science http://www.cwi.nl/projects/cmcs08/ Budapest, Hungary April 4-6, 2008 Key Note Speaker: Dexter Kozen (to be confirmed) Invited Speakers: Stefan Milius and Dirk Pattinson Important Dates Extended deadline for submission of regular papers: January 21, 2008 Notification of acceptance of regular papers: February 11, 2008. Final version for the preliminary proceedings: February 18, 2008. Deadline for submission of short contributions: March 10, 2008. Notification of acceptance of short contributions: March 17, 2008. The workshop will be held in conjunction with the 11th European Joint Conferences on Theory and Practice of Software ETAPS 2008 March 29 - April 6, 2008 Programme Committee Jiri Adamek (chair, Braunschweig), Corina Cirstea (Southampton), Neil Ghani (Nottingham), H. Peter Gumm (Marburg), Bart Jacobs (Nijmegen), Clemens Kupke (co-chair, Amsterdam), Alexander Kurz (Leicester), Ugo Montanari (Pisa), Larry Moss (Indiana), John Power (Bath), Jan Rutten (Amsterdam), Lutz Schr=F6der (Bremen), Tarmo Uustalu (Tallinn), Yde Venema (Amsterdam), Hiroshi Watanabe (Osaka). Submissions Two sorts of submissions will be possible this year: Papers to be evaluated by the programme committee for inclusion in the ENTCS proceedings: These papers must be written using ENTCS style files and be of length no greater than 20 pages. They must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. If a submission describes software, software tools, or their use, it should include all source code that is needed to reproduce the results but is not publicly available. If the additional material exceeds 5 MB, URL's of publicly available sites should be provided in the paper. Short contributions: These will not be published but will be compiled into a technical report of the Technical University of Braunschweig. They should be no more than two pages and may describe work in progress, summarise work submitted to a conference or workshop elsewhere, or in some other way appeal to the CMCS audience. Both sorts of submission should be submitted in postscript or pdf form as attachments to an email to cmcs08@cwi.nl. The email should include the title, corresponding author, and, for the first kind of submission, a text-only one-page abstract. After the workshop, we expect to produce a journal proceedings of extended versions of selected papers to appear in Theoretical Computer Science. For more information, please write to cmcs08@cwi.nl From rrosebru@mta.ca Fri Jan 18 10:47:40 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 18 Jan 2008 10:47:40 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JFsGT-0000Ip-6A for categories-list@mta.ca; Fri, 18 Jan 2008 10:32:13 -0400 Date: Thu, 17 Jan 2008 09:54:25 +0100 From: Bodil Biering MIME-Version: 1.0 To: categories@mta.ca Subject: categories: Lifting of connected geometric morphism from tripos to topos 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: 24 Any geometric morphism of triposes f: P -> Q can be lifted to a geometric morphism of toposes [f]: C[P] -> C[Q]. It can also be shown that if f is an inclusion then [f] is also an inclusion. My question is the following: Suppose f: P -> Q is connected (i.e., the inverse image f^* is fully faithful, or equivalently, the unit \eta: Id => f_*f^* is an iso), is [f]: C[P] -> C[Q] then also connected? - Bodil Biering From rrosebru@mta.ca Fri Jan 18 10:47:40 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 18 Jan 2008 10:47:40 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JFsJa-0000ka-3L for categories-list@mta.ca; Fri, 18 Jan 2008 10:35:26 -0400 Mime-Version: 1.0 (Apple Message framework v753) To: categories@mta.ca Subject: categories: Workshop DOMAINS IX Date: Fri, 18 Jan 2008 08:34:05 +0000 From: Bernhard Reus Content-Transfer-Encoding: 7bit Content-Type: text/plain;charset=US-ASCII;delsp=yes;format=flowed Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 25 W o r k s h o p A n n o u n c e m e n t D O M A I N S IX http://www.informatics.sussex.ac.uk/events/domains9/ University of Sussex, Brighton, 22-24 September 2008 INTRODUCTION The Workshop on Domains is aimed at computer scientists and mathematicians alike who share an interest in the mathematical foundations of computation. The workshop will focus on domains, their applications and related topics. Previous meetings were held in Darmstadt (94,99,04), Braunschweig (96), Munich (97), Siegen (98), Birmingham (02) and Novosibirsk (07). FORMAT The emphasis is on the exchange of ideas between participants similar in style to Dagstuhl seminars. In particular, talks on subjects presented at other conferences and workshops are acceptable. INVITED SPEAKERS (confirmed) Jean Goubault-Larrecq LSV/ENS Cachan & CNRS Martin Hyland Cambridge University John Longley University of Edinburgh Andrew Pitts Cambridge University More invited speakers to be announced soon! SCOPE Domain theory has had applications to programming language semantics and logics (lambda-calculus, PCF, LCF), recursion theory (Kleene-Kreisel countable functionals), general topology (injective spaces, function spaces, locally compact spaces, Stone duality), topological algebra (compact Hausdorff semilattices) and analysis (measure, integration, dynamical systems). Moreover, these applications are related - for example, Stone duality gives rise to a logic of observable properties of computational processes. As such, domain theory is highly interdisciplinary. Topics of interaction with domain theory for this workshop include, but are not limited to: program semantics program logics probabilistic computation exact computation over the real numbers lambda calculus games models of sequential computation constructive mathematics recursion theory realizability real analysis and computability topology, metric spaces and domains locale theory category theory topos theory type theory SUBMISSION OF ABSTRACTS One-page abstracts need to be submitted to domains9@sussex.ac.uk Shortly after an abstract is submitted (usually two or three weeks), the authors will be notified by the programme committee. The criterion for acceptance is relevance to the meeting. In particular, talks on subjects presented at other conferences and workshops are acceptable. DEADLINE Abstracts will be dealt with on a first-come/first-served basis. We expect potential speakers to express the intention to give a talk by the end of June. REGISTRATION Further details about the local arrangements will be provided soon. ACCOMMODATION The workshop will be held at the University of Sussex at Falmer, Brighton (UK). Newly built halls of residence will be available to workshop participants. Further information on travel, accommodation and places of local interest will be announced closer to the workshop. PROGRAMME COMMITTEE Martin Escardo University of Birmingham Achim Jung University of Birmingham (Co-Chair) Klaus Keimel TU Darmstadt (Co-Chair) Bernhard Reus University of Sussex (Co-Chair) Thomas Streicher TU Darmstadt ORGANIZATION COMMITTEE Bernhard Reus University of Sussex PUBLICATION We plan to publish proceedings of the workshop in a special volume of a journal. There will be a call for papers after the workshop. The papers will be refereed according to normal publication standards. URL http://www.informatics.sussex.ac.uk/events/domains9/ From rrosebru@mta.ca Fri Jan 18 10:47:41 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 18 Jan 2008 10:47:41 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JFsKI-0000qW-Ta for categories-list@mta.ca; Fri, 18 Jan 2008 10:36:10 -0400 Date: Fri, 18 Jan 2008 11:50:36 -0200 (BRST) Subject: categories: WoLLIC 2008 - Call for Papers From: ruy@cin.ufpe.br To: wollic@cin.ufpe.br 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: 26 [** sincere apologies for duplicates **] Call for Papers 15th Workshop on Logic, Language, Information and Computation (WoLLIC 2008) Edinburgh, Scotland July 1-4, 2008 (There will be a screening of George Csicsery's "Julia Robinson and Hilbert's Tenth Problem" http://zalafilms.com/films/juliarobinson.html with kind permission of the film director) WoLLIC is an annual international forum on inter-disciplinary resear= ch involving formal logic, computing and programming theory, and natura= l language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers. The Fifteenth WoLLIC will be held in Edinburgh, Scotland, from July 1 to July 4, 2008. It is sponsored by the Association for Symbolic Logic (ASL), the Interest Group in Pure and Applied Logics (IGPL), the European Association for Logic, Language and Information (FoLLI), the European Association for Theoretical Computer Science (EATCS), the Sociedade Brasileira de Computacao (SBC), and the Sociedade Brasileira de Logica (SBL). PAPER SUBMISSION Contributions are invited on all pertinent subjects, with particular interest in cross-disciplinary topics. Typical but not exclusive areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; formal methods in software and hardware development; logical approac= h to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, shar= ing, and protection. Proposed contributions should be in English, and consist of a schola= rly exposition accessible to the non-specialist, including motivation, background, and comparison with related works. They must not exceed 10 pages (in font 10 or higher), with up to 5 additional pages for references and technical appendices. The paper's main results must not be published or submitted for publication in refereed venues, including journals and other scientific meetings. It is expected that each accepted paper be presented at the meeting = by one of its authors. Papers must be submitted electronically at www.cin.ufpe.br/~wollic/wollic2008/instructions.html A title and single-paragraph abstract should be submitted by February 24, and the full paper by March 2 (firm date). Notifications are expected by April 13, and final papers for the proceedings will be due by April 27 (firm date). PROCEEDINGS The proceedings of WoLLIC 2008, including both invited and contribut= ed papers, will be published in advance of the meeting as a volume in Springer's Lecture Notes in Computer Science (tbc). In addition, abstracts will be published in the Conference Report section of the Logic Journal of the IGPL, and selected contributions will be published as a special post-conference WoLLIC 2008 issue of the Journal of Logic and Computation (tbc). INVITED SPEAKERS Olivier Danvy (BRICS) Anuj Dawar (Cambridge, UK) Makoto Kanazawa (Nat Inst of Informatics, Japan) Sam Lomonaco (U Maryland Baltimore) Mark Steedman (Edinburgh U) Henry Towsner (CMU) Nikolay Vereshchagin (Moscow) STUDENT GRANTS ASL sponsorship of WoLLIC 2008 will permit ASL student members to apply for a modest travel grant (deadline: April 1, 2008). See www.aslonline.org/studenttravelawards.html for details. IMPORTANT DATES February 24, 2008: Paper title and abstract deadline March 2, 2008: Full paper deadline (firm) April 13, 2008: Author notification April 27, 2008: Final version deadline (firm) PROGRAM COMMITTEE Lev Beklemishev (Utrecht) Eli Ben-Sasson (Technion) Xavier Caicedo (U Los Andes, Colombia) Mary Dalrymple (Oxford) Martin Escardo (Birmingham) Wilfrid Hodges (Queen Mary, U London) (Chair) Achim Jung (Birmingham) Louis Kauffman (Maths, U Ill at Chicago) Ulrich Kohlenbach (Darmstadt) Leonid Libkin (Edinburgh U) Giuseppe Longo (Ecole Normal Superieure, Paris) Michael Moortgat (Utrecht) Valeria de Paiva (PARC, USA) Andre Scedrov (Maths, U Penn) Valentin Shehtman (Inst for Information Transmission Problems, Mosco= w) Joe Wells (Heriot-Watt U, Scotland) ORGANISING COMMITTEE Mauricio Ayala-Rincon (U Brasilia, Brazil) Fairouz Kamareddine (Heriot-Watt U, Scotland, co-chair) Anjolina de Oliveira (U Fed Pernambuco, Brazil) Ruy de Queiroz (U Fed Pernambuco, Brazil, co-chair) STEERING COMMITTEE J. van Benthem, J. Halpern, W. Hodges, D. Leivant, A. Macintyre, G. Mints, R. de Queiroz WEB PAGE www.cin.ufpe.br/~wollic/wollic2008/ --- From rrosebru@mta.ca Fri Jan 18 10:47:41 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 18 Jan 2008 10:47:41 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JFsID-0000YR-0H for categories-list@mta.ca; Fri, 18 Jan 2008 10:34:01 -0400 From: "Lurdes Sousa" To: Subject: categories: Volume dedicated to J Adamek Date: Thu, 17 Jan 2008 18:22:47 -0000 Content-Type: text/plain;format=flowed; charset="iso-8859-1";reply-type=original Content-Transfer-Encoding: quoted-printable Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 27 =3D=3D=3D=3D=3D=3DSecond Announcement=3D=3D=3D=3D=3D=3D SPECIAL VOLUME IN HONOUR OF JIRI ADAMEK ON THE OCCASION OF HIS SIXTIETH BIRTHDAY Jiri Adamek celebrated his 60th birthday in October, and there will be a Special Issue of the journal Cahiers de Topologie et G=E9om=E9t= rie Diff=E9rentielle Cat=E9goriques dedicated to this occasion. Submission of papers on areas where Jiri Adamek has worked and published are encouraged. The deadline for submission is 15 March 2008. All papers will be carefully refereed following the standards of Cahiers de Topologie et G=E9om=E9trie Diff=E9rentielle Cat=E9goriques. For more information, please visit the web page http://www.mat.uc.pt/~cmatcs/JAdamek_volume.html The Guest Editors, Francis Borceux Achim Jung Jir=ED Rosicky Lurdes Sousa From rrosebru@mta.ca Fri Jan 18 10:47:41 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 18 Jan 2008 10:47:41 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JFsHY-0000T6-DE for categories-list@mta.ca; Fri, 18 Jan 2008 10:33:20 -0400 Date: Thu, 17 Jan 2008 15:13:12 +0100 From: Category Theory 2008 MIME-Version: 1.0 To: categories@mta.ca Subject: categories: CT08 - Second Announcement 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: RO X-Status: X-Keywords: X-UID: 28 International Category Theory Conference 2008 - Second Announcement June 22-28, 2008, at the Universit=E9 du Littoral C=F4te d'Opale, Calais,= =20 France. Registration and abstract submission is now open at the web page:=20 http://www-lmpa.univ-littoral.fr/CT08/ Information about accommodation, travel and deadlines is available at=20 the Conference web page. Fees (including conference documentation, a welcome reception, the=20 conference dinner, an excursion, coffee breaks and lunches at the=20 University Self-Service Restaurant) are: =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D Before April 15 Regular: 180 euros Students: 120 euros =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D From April 16 to June 1 Regular: 250 euros Students:170 euros =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D Confirmed Invited Speakers: Maria Manuel Clementino (Universidade de Coimbra, Portugal) Andreas D=F6ring (Imperial College, United Kingdom) Stephen Lack (University of Western Sydney, Australia) Ross Street (Macquarie University, Australia) Walter Tholen (York University, Canada) Scientific Committee: Clemens Berger (Universit=E9 de Nice, France) Dominique Bourn (Universit=E9 du Littoral C=F4te d'Opale, France) George Janelidze (University of Cape Town, South Africa) Peter Johnstone (University of Cambridge, United Kingdom) Manuela Sobral (Universidade de Coimbra, Portugal) Robert Walters (Universit=E0 dell'Insubria, Italy) We are looking forward to seeing you in Calais! The Organizing Committee, Dominique Bourn, Marino Gran and Shalom Eliahou From rrosebru@mta.ca Fri Jan 18 20:05:04 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 18 Jan 2008 20:05:04 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JG14c-0003tU-HX for categories-list@mta.ca; Fri, 18 Jan 2008 19:56:34 -0400 Date: Fri, 18 Jan 2008 16:42:46 +0000 (GMT) From: Bob Coecke To: categories@mta.ca Subject: categories: Call for contributions: QUANTUM PHYSICS AND LOGIC (QPL'08) & DEVELOPMENTS IN COMPUTATIONAL MODELS (DCM'08) 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: 29 ANNOUNCEMENT/CALL FOR CONTRIBUTIONS: --------------------------------------- Joint International Workshop on: QUANTUM PHYSICS AND LOGIC (QPL'08) DEVELOPMENTS IN COMPUTATIONAL MODELS (DCM'08) July 12-13, 2008, Reykjavik, Iceland. http://web.comlab.ox.ac.uk/oucl/work/bob.coecke/DCM_QPL_08.html --------------------------------------- This to ICALP 2008 affiliated joint event combines two (established) workshop series: QUANTUM PHYSICS AND LOGIC (QPL'08): This event has as its goal to bring together researchers working on mathematical foundations of quantum computing and the use of logical tools, new structures, formal languages, semantical methods and other computer science methods for the study quantum behaviour in general. Over the past couple of years there has been a growing activity in these foundational approaches together with a renewed interest in the foundations of quantum theory, which complement the more mainstream research in quantum computation. A predecessor of this event, with the same acronym, called Quantum Programming Languages, was held in Ottawa (2003), Turku (2004), Chicago (2005) and Oxford (2006); with the change of name and a new program committee we wish to emphasise the intended much broader scope of this event, aiming to nourish interaction between modern computer science logic, quantum computation and information, and structural foundations for quantum physics. DEVELOPMENTS IN COMPUTATIONAL MODELS (DCM'08): Besides quantum computing, several new models of computation have emerged in the last few years, and many developments of traditional computational models have been proposed with the aim of taking into account the new demands of computer systems users and the new capabilities of computation engines. A new computational model, or a new feature in a traditional one, usually is reflected in new structural paradigms. The aim of this workshop is to bring together researchers who are currently developing new computational models or new features for traditional computational models, in order to foster their interaction, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in this area. Previous editions in 2005, 2006 and 2007 were also affiliated to ICALP. Invited speakers: Terry Rudolph (Imperial College London) TBA Programme Committee: Howard Barnum (Los Alamos) Dan Browne (University College London) Bob Coecke (Oxford) Co-Chair Vincent Danos (Paris VII) Andreas Doering (Imperial College London) Annick Lesne (IHS Paris) Ian Mackie (Sussex) Prakash Panangaden (McGill) Co-Chair Jon Yard (Los Alamos) Dates: - Submission deadline: March 31 - Acceptance/rejection notification: April 21 - Pre-proceedings versions due: June 15 - Workshop: July 12-13 2007 Submission format: Prospective speakers are invited to submit a 2-5 pages abstract which provides sufficient evidence of results of genuine interest and provides sufficient detail to allows the program committee to assess the merits of the work. Submissions of works in progress are encouraged but must be more substantial than a research proposal. We both encourage submissions of original research as well as research submitted elsewhere. Authors of accepted original research contributions will be invited to submit a full paper to a special issue of a journal yet to be decided on. Submissions should be in Postscript or PDF format and should be sent to Bob Coecke by March 15. Receipt of all submissions will be acknowledged by return email. Accepted contributors will be able to publish extended versions of their abstracts in Electronic Notes in Theoretical Computer Science. Financial support. The workshop enjoys support from: EPSRC Network Semantics of Quantum Computation (EP/E006833/1) EPSRC ARF The Structure of Quantum Information and its Applications to IT (EP/D072786/1) From rrosebru@mta.ca Sat Jan 19 09:51:51 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sat, 19 Jan 2008 09:51:51 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JGE2d-00054z-C0 for categories-list@mta.ca; Sat, 19 Jan 2008 09:47:23 -0400 Date: Sat, 19 Jan 2008 10:42:53 +0000 From: Reiko Heckel MIME-Version: 1.0 To: categories@mta.ca Subject: categories: Post-Doc Position in Verifiable Model Transformations for SOA Engineering 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: 30 [Apologies for multiple copies - please forward to interested candidates] Applications are invited for a Research Associate to work on the FP6-IST project SENSORIA. The overall aim of the project is to develop a comprehensive approach to the engineering of software systems for the emerging Service-Oriented Computing paradigm, integrating foundational theories, techniques, and methods, as well as a pragmatic software engineering approach. The post is available within WP7 to support the development and verification of service-oriented systems by means of automated, verifiable transformations. Applicants should have completed or be nearing completion of a PhD in Computer Science or a related subject, and be in possession of a good background in graph transformations, their verification and implementation, and their application to model transformations. Some knowledge of logic and algebraic specification techniques is desirable. The post is for one year, but likely to be extended by a further six months. Closing Date for applications is 8 February 2008. Please find further details at http://www.le.ac.uk/personnel/jobs/r3602a.html I'm happy to answer any further questions. Reiko -- 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 Mon Jan 21 10:52:32 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 21 Jan 2008 10:52:32 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JGxne-0000zO-2C for categories-list@mta.ca; Mon, 21 Jan 2008 10:38:58 -0400 Date: Mon, 21 Jan 2008 10:08:26 +0000 From: Maria Manuel Clementino MIME-Version: 1.0 To: categories@mta.ca Subject: categories: Volume dedicated to Walter Tholen's 60th 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: 31 =3D=3D=3D=3D=3D=3DSecond Announcement=3D=3D=3D=3D=3D=3D SPECIAL VOLUME IN HONOUR OF WALTER THOLEN ON THE OCCASION OF HIS SIXTIETH BIRTHDAY Walter Tholen celebrated his 60th birthday last October, and there will be a special volume of Theory and Applications of Categories dedicated to this occasion. The deadline for submission is 15 March 2008. For more information, please visit the web page http://www.mat.uc.pt/~cmatcs/WTholen_volume.html The Guest Editors, Maria Manuel Clementino, George Janelidze, Robert Rosebrugh, Jir=ED Rosic= ky From rrosebru@mta.ca Tue Jan 22 10:38:10 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 22 Jan 2008 10:38:10 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JHK8n-0004aQ-79 for categories-list@mta.ca; Tue, 22 Jan 2008 10:30:17 -0400 Date: Tue, 22 Jan 2008 11:42:08 +0100 From: Ugo Dal Lago MIME-Version: 1.0 To: categories@mta.ca Subject: categories: CSL 2008 - first call for papers 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: 32 --------------------------------------------------------------------- CALL FOR PAPERS Computer Science Logic 2008 CSL 2008 17th Annual Conference of the European Association for Computer Science Logic Bertinoro (Bologna), Italy 15 - 20 September 2008 --------------------------------------------------------------------- Abstract submission: March 28, 2008 Paper submission: April 7, 2008 Author notification: May 19, 2008 --------------------------------------------------------------------- http://csl2008.cs.unibo.it --------------------------------------------------------------------- Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL). The conference is intended for computer scientists whose research activities involve logic, as well as for logicians working on issues significant for computer science. Topics of interest include: automated deduction and interactive theorem proving, constructive mathematics and type theory, equational logic and term rewriting, automata and games, modal and temporal logics, model checking, logical aspects of computational complexity, finite model theory, computational proof theory, logic programming and constraints, lambda calculus and combinatory logic, categorical logic and topological semantics, domain theory, database theory, specification, extraction and transformation of programs, logical foundations of programming paradigms, verification and program analysis, linear logic, higher-order logic, nonmonotonic reasoning. Proceedings will be published in the LNCS series. Each paper accepted by the Programme Committee must be presented at the conference by one of the authors, and final copy be prepared according to Springer's guidelines. Submitted papers must be in Springer's LNCS style and of no more than 15 pages, presenting work not previously published. They must not be submitted concurrently to another conference with refereed proceedings. Any closely related work submitted by the authors to a conference or journal before March 28, 2008 must be reported to the PC chairs. Papers authored or coauthored by members of the Programme Committee are not allowed. Submitted papers must be in English and provide sufficient detail to allow the Programme Committee to assess the merits of the paper. Full proofs may appear in a technical appendix which will be read at the reviewer's discretion. The title page must contain: title and author(s), physical and e-mail addresses, identification of the corresponding author, an abstract of no more than, 200 words, and a list of keywords. ACKERMANN AWARD: The Ackermann Award is the EACSL Outstanding Dissertation Award for Logic in Computer Science. The Ackermann Award 2008 will be presented to the recipients at CSL2008. Deadline for nominations is March 15, 2008. Details at: http://www.dimi.uniud.it/~eacsl/submissionsAck.html For the three years 2007-2009, the Award is sponsored by Logitech, S.A., Romanel, Switzerland, the world's leading provider of personal peripheral= s. INVITED SPEAKERS: Luca Cardelli, Microsoft Research, Cambridge Pierre Louis Curien, PPS, Paris Jean-Pierre Jouannaud, Ecole Polytechnique, Palaiseau Wolfgang Thomas, RWTH, Aachen PROGRAM COMMITTEE: Michael Kaminski (co-chair), Technion, Haifa Simone Martini (co-chair), Universit=E0 di Bologna Zena Ariola, University of Oregon, Eugene Patrick Baillot, CNRS and Universit=E9 Paris 13 Patrick Cegielski, Universit=E9 Paris 12 Gilles Dowek, =C9cole Polytechnique, Palaiseau Amy Felty, University of Ottawa Marcelo Fiore, University of Cambridge Alan Jeffrey, Bell Labs, Alcatel-Lucent Leonid Libkin, University of Edinburgh Zoran Majkic, University of Beograd Dale Miller, INRIA-Futurs, Palaiseau Luke Ong, University of Oxford David Pym, HP Labs, Bristol and University of Bath Alexander Rabinovich, Tel Aviv University Antonino Salibra, Universit=E0 Ca' Foscari, Venezia Thomas Schwentick, Universit=E4t Dortmund Valentin Shehtman, Moscow University and King's College London Alex Simpson, University of Edinburgh Gert Smolka, Universit=E4t des Saarlandes, Saarbr=FCcken Kazushige Terui, National Institute of Informatics, Tokyo Thomas Wilke, Universit=E4t Kiel ORGANIZATION: Ugo Dal Lago, Universit=E0 di Bologna Simone Martini, Universit=E0 di Bologna --------------------------------------------------------------------- From rrosebru@mta.ca Fri Jan 25 14:57:33 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 25 Jan 2008 14:57:33 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JITWr-0001f6-Qa for categories-list@mta.ca; Fri, 25 Jan 2008 14:43:53 -0400 Mime-Version: 1.0 (Apple Message framework v752.3) To: categories@mta.ca From: Rob Goldblatt Subject: categories: Lectureships available Date: Fri, 25 Jan 2008 10:47:43 +1300 Content-Transfer-Encoding: 7bit Content-Type: text/plain;charset=US-ASCII;delsp=yes;format=flowed Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 33 Please forward to interested parties. TWO LECTURESHIPS IN MATHEMATICS Victoria University of Wellington, New Zealand Applications are invited for two permanent positions of Lecturer in Mathematics available in the School of Mathematics, Statistics and Computer Science. (The position of Lecturer corresponds approximately to that of Assistant Professor in North America, but with tenure). Candidates with research interests in any area of mathematics are welcome to apply. For more information, and online application, see http://vacancies.vuw.ac.nz/positiondetail.asp?p=4091 Applications close 21 February 2008 From rrosebru@mta.ca Fri Jan 25 14:57:34 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 25 Jan 2008 14:57:34 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JITXQ-0001mH-Gc for categories-list@mta.ca; Fri, 25 Jan 2008 14:44:28 -0400 Message-ID: <47990AA0.6030403@nasa.gov> Date: Thu, 24 Jan 2008 17:01:04 -0500 From: Kristin Yvonne Rozier MIME-Version: 1.0 To: undisclosed-recipients:; Subject: categories: LFM 2008 Call for Abstracts and Invitation to Register Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 34 We apologize if you receive multiple copies of this email. See below on how to be removed from our mailing list. -------------------------------------------------- NASA Langley/NIA Formal Methods Team invites you to submit an abstract and/or register to attend: The Sixth NASA Langley Formal Methods Workshop LFM 2008 http://shemesh.larc.nasa.gov/LFM2008/LFM2008.html April 30 - May 2, 2008 Newport News, Virginia -------------------------------------------------- Important Deadlines: -------------------------------------------------- Abstract Submissions for Contributed Talks: March 1, 2008 Acceptance: March 15, 2008 Registration: April 15, 2008 -------------------------------------------------- Theme of Conference: -------------------------------------------------- Safety critical systems represent an ever-increasing problem domain, challenging verification techniques to catch up. Within the field of aeronautics alone, we find the need for verification of algorithms for separation assurance, air traffic control, auto-pilot, Unmanned Aerial Vehicles (UAVs), adaptive avionics, automated decision authority, and much more. Recent advances in formal methods have made verifying more of these problems realistic. Thus we need to continually re-assess what we can solve now and identify the next barriers to overcome. Only through an exchange of ideas between theoreticians and practitioners from academia to industry can we extend formal methods for the verification of ever more challenging problem domains. The goal of this workshop on formal methods for verification is to examine formal verification techniques, their theory, application areas, current capabilities, and limitations. This format is designed to introduce researchers, graduate students, and partners in industry to those topics that are of fundamental interest and importance, to survey current research, and to discuss major unsolved problems and directions for future research. The meeting will be comprised of invited talks covering the major research areas, and more specialized contributed talks, including student talks. Contributed talks will consist of 30-minute research expositions providing state-of-the-art information on recent developments related to formal methods, and a number of 15-minute talks on current research given by undergraduate and graduate students. -------------------------------------------------- Topics of Interest: -------------------------------------------------- Topics of interest include but are not limited to the following: * advances in formal verification techniques * formal models of distributed computing * planning and scheduling * automated air traffic management * fault tolerance * hybrid systems/hybrid automata * embedded systems * safety critical applications * safety cases * accident/safety analysis -------------------------------------------------- Invited Tutorials: -------------------------------------------------- * Gerard J. Holzmann (NASA JPL) - On Limits * John Rushby (SRI) - Formal Methods and Certification * Moshe Y. Vardi (Rice University) - From Philosophical to Industrial Logics -------------------------------------------------- Submissions: -------------------------------------------------- There are two categories of submissions: * Regular Talks. These talks will be 30 minutes in length, including questions. * Student Talks. These talks will be 15 minutes in length, including questions. Both categories of talks will be selected from the abstracts submitted to the LFM 2008 web site. -------------------------------------------------- Location and Cost: -------------------------------------------------- The workshop will take place at the Marriott Hotel, City Center at Oyster Point, Newport News, Virginia, USA. Information on hotel block reservations and travel are located on the LFM 2008 web site. Note that hotel reservations at the special block rate must be made on or before 30 March 2008. There will be no registration fee charged to participants. All interested individuals, including non-US citizens, are welcome to attend, to listen to the talks, and to participate in discussions. However, all attendees must register. We especially encourage students and other researchers possibly interested in specializing in formal methods to attend as this will be a good opportunity to become more knowledgeable about this area of research. Please visit the official LFM 2008 web site for further information: http://shemesh.larc.nasa.gov/LFM2008/LFM2008.html. Cheers, Kristin Yvonne Rozier LFM 2008 General Chair -------------------------------------------------- We apologize if you receive multiple copies of this email. If you do not want any further announcements regarding LFM 2008, please send a message to Kristin.Y.Rozier@nasa.gov with 'UNSUBSCRIBE' as the subject. -- ____________________________________________________________ __ /\ \ \_____ / \ ###[==_____> / \ /_/ __ / __ \ \ \_____ | ( ) | ###[==_____> /| /\/\ |\ /_/ / | | | | \ / |=|==|=| \ Kristin Yvonne Rozier / | | | | \ Kristin.Y.Rozier@nasa.gov / USA | ~||~ |NASA \ Formal Methods Group, |______| ~~ |______| Safety Critical Avionics Systems Branch, (__||__) NASA Langley Research Center /_\ /_\ Phone: (757) 864-2169 !!! !!! Fax: (757) 864-4234 http://shemesh.larc.nasa.gov/people/kyr From rrosebru@mta.ca Mon Jan 28 11:21:38 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 28 Jan 2008 11:21:38 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JJVdG-00058X-Ru for categories-list@mta.ca; Mon, 28 Jan 2008 11:10:46 -0400 From: To: carlos.martin@urv.cat Date: Sat, 26 Jan 2008 19:30:46 GMT MIME-Version: 1.0 Content-Language: ca Subject: categories: 6th International Summer School in Formal Languages andApplications Content-Type: text/plain;charset=us-ascii Content-Disposition: inline Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: RO X-Status: X-Keywords: X-UID: 35 Apologies for multiple posting! Please, forward the announcement to whoever may be interested in it. Thanks. ------------------ 6th INTERNATIONAL SUMMER SCHOOL IN FORMAL LANGUAGES AND APPLICATIONS (formerly International PhD School in Formal Languages and Applications) Tarragona, Spain, July 21 - August 2, 2008 Organized by: Research Group on Mathematical Linguistics Rovira i Virgili University http://www.grlmc.com ADDRESSED TO: Graduate students from around the world. Most appropriate degrees include: Computer Science and Mathematics. Other graduate students (for instance, from Linguistics, Electrical Engineering, Molecular Biology or Logic) as well undergraduate students can attend too provided they have a good background in discrete mathematics. All courses will be compatible in terms of the schedule. (There will be no courses in parallel.) COURSES AND PROFESSORS JULY 21-26: Martyn Amos (Manchester), Synthetic Biology: Biological Engineering [6 hours] Erzsebet Csuhaj-Varju (Budapest), Language Theoretic Models of Multi-Agent Systems [14 hours] Zoltan Esik (Tarragona), An Axiomatic Theory of Automata [6 hours] Rusins Freivalds (Riga), Elliptic Curves [6 hours] Max Garzon (Memphis), Biomolecular Nanotechnology [6 hours] Masami Ito (Kyoto), Regular Grammars [6 hours] Martin Kutrib (Giessen), Cellular Automata [6 hours] Claudio Moraga (Mieres), Fuzzy Formal Languages [6 hours] Kenichi Morita (Hiroshima), Two-Dimensional Languages [6 hours] Mitsunori Ogihara (Rochester), Computational Complexity and Molecular Computation Models [6 hours] Friedrich Otto (Kassel), Restarting Automata [6 hours] COURSES AND PROFESSORS JULY 28 - AUGUST 2: Francine Blanchet-Sadri (Greensboro), Partial Words [6 hours] Henning Bordihn (Potsdam), Mildly Context-Sensitive Grammars [8 hours] Wojciech Buszkowski (Poznan), Type Logics and Grammars [8 hours] Manfred Droste (Leipzig), Weighted Automata [8 hours] Joerg Flum (Freiburg, Germany), Parameterized Complexity [6 hours] Tom Head (Binghamton), Computing with Light Using Transparency and Opacity [6 hours] Satoshi Kobayashi (Tokyo), Grammatical Models and Algorithms for Biological Sequence Analysis [6 hours] Mark-Jan Nederhof (St.-Andrews), Probabilistic Parsing [6 hours] Alexander Okhotin (Turku), Language Equations [6 hours] Detlef Wotschke (Frankfurt), Descriptional Complexity of Automata and Grammars [12 hours] Sheng Yu (London, Canada), Finite Automata [16 hours] REGISTRATION: It has to be done on line at: http://www.grlmc.com FEES: They are variable for each student, depending on the number of courses each one takes. The rule is: 1 hour = - 10 euros (for payments until March 24, 2008), - 12 euros (for payments after March 24, 2008). The fees must be paid to the School's bank account: IBAN code: ES13 0073 0100 5104 0350 6598 Please mention SSFLA'08 and your full name in the subject. An invoice will be provided on site. To check the eligibility for early registration, what counts is the date of the bank order for payment (not the date when the registration form was filled in). People registering on site at the beginning of the School must pay in cash. ACCOMMODATION: Information about accommodation will be provided through the website of the School in due time. IMPORTANT DATES: Announcement of the programme: January 26, 2008 Starting of the registration: February 4, 2008 Early registration deadline: March 24, 2008 Starting of the School: July 21, 2008 End of the School: August 2, 2008 QUESTIONS AND FURTHER INFORMATION: Carlos Martin-Vide: carlos.martin@urv.cat WEBSITE: http://www.grlmc.com POSTAL ADDRESS: SSFLA'08 Research Group on Mathematical Linguistics Rovira i Virgili University Plaza Imperial Tarraco, 1 43005 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-559597 From rrosebru@mta.ca Tue Jan 29 14:15:14 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 29 Jan 2008 14:15:14 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JJup4-0003IF-N9 for categories-list@mta.ca; Tue, 29 Jan 2008 14:04:38 -0400 From: Gaucher Philippe To: categories@mta.ca Subject: categories: reference needed please Date: Tue, 29 Jan 2008 16:25:32 +0100 MIME-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Content-Disposition: inline Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 36 Dear all, By exploring the Math Reviews, I found by chance a paper constructing for any reasonable (semi)topological category a closed monoidal structure. Unfortunately, I cannot refind this paper and I cannot remember the keywords I used. Could you help me please ?? Thanks in advance. pg. From rrosebru@mta.ca Tue Jan 29 19:30:04 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 29 Jan 2008 19:30:04 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JJzlC-0002fM-C8 for categories-list@mta.ca; Tue, 29 Jan 2008 19:20:58 -0400 Date: Tue, 29 Jan 2008 13:36:26 -0500 From: Walter Tholen MIME-Version: 1.0 To: categories@mta.ca Subject: categories: Re: reference needed please Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 37 Two names come to my mind in this context: Juraj Cincura and Georg Greve, but I have no time to check the details. Regards, Walter. Gaucher Philippe wrote: >Dear all, > >By exploring the Math Reviews, I found by chance a paper constructing for any >reasonable (semi)topological category a closed monoidal structure. >Unfortunately, I cannot refind this paper and I cannot remember the keywords >I used. Could you help me please ?? > >Thanks in advance. pg. > > > From rrosebru@mta.ca Wed Jan 30 10:50:47 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 30 Jan 2008 10:50:47 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JKEAv-0006fV-Qz for categories-list@mta.ca; Wed, 30 Jan 2008 10:44:29 -0400 From: Gaucher Philippe To: categories@mta.ca Subject: categories: closed monoidal structure in topological categories MIME-Version: 1.0 Content-Disposition: inline Date: Wed, 30 Jan 2008 09:18:05 +0100 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 38 Dear all, I thank you very much for all the answers. I am going to read all these papers. But maybe it is simpler to explain my problem: Consider Theorem 27.22 of the book "The joy of cats" : a well-fibered topological construct is cartesian closed iff for any object A, Ax- preserves colimits. Does this theorem have a generalization for other symmetric monoidal structures than the binary product ? Thanks in advance. pg. From rrosebru@mta.ca Wed Jan 30 16:07:04 2008 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 30 Jan 2008 16:07:04 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1JKIzv-0004L0-Ac for categories-list@mta.ca; Wed, 30 Jan 2008 15:53:27 -0400 Date: Wed, 30 Jan 2008 14:06:40 -0500 From: Walter Tholen MIME-Version: 1.0 To: categories@mta.ca Subject: categories: Re: closed monoidal structure in topological categories 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: 39 Street and Walters (1973) called a category A total when its Yoneda embedding has a left adjoint and proved that such a category is compact in the sense of Isbell, that is: every functor F: A --> B preserving all colimits has a right adjoint (some provisions on the size of hom sets need to be made). There are many papers on the fairly rich supply of total categories, by Wood (1982) and myself with B"orger (1990) and Adamek (1990), and by others. There is also paper dealing specifically with compact categories, by B"orger, Tholen, Wischnewsky and Wolff (JPAA 21 (1981) 129-144). Theorem 4.1 of that paper says explicitly: Let P: A --> X be a semitopological functor over a compact category X. Then a monoidal structure on A is closed if and only if A \ten (-) preserves all colimits. The reason of course is that semitopological functors "lift" compactness (and so do monadic functors - Rattray 1975). The theorem below gives extra conditions to make sure that preservation of small colimits suffices. There is a lot more literature on that latter aspect, particularly by Kelly. Walter Tholen. Gaucher Philippe wrote: >Dear all, > >I thank you very much for all the answers. I am going to read all these >papers. But maybe it is simpler to explain my problem: > >Consider Theorem 27.22 of the book "The joy of cats" > : a >well-fibered topological construct is cartesian closed iff for any object A, >Ax- preserves colimits. Does this theorem have a generalization for other >symmetric monoidal structures than the binary product ? > >Thanks in advance. pg. > > >