July 2001 - Categories - categories.org.au

paperback announcement: Categorical Logic and Type Theory
by Bart Jacobs 16 Mar '02

16 Mar '02

Dear Colleague, I am happy to announce that Elsevier has now published a paperback version of my book B. Jacobs, Categorical Logic and Type Theory Studies in Logic and the Foundations of Mathematics 141, North Holland, Elsevier, 1999. 780 pages. The regular price of the paperback is NLG 150 / Euro 68.07 / US$ 74 Elsevier now offers a discount of 25% for this paperback if you order before 31 july 2001, using the attached form. In that case the price is: NLG 112.50 / Euro 51 / US$ 55.50. If you wish to use this special offer, please fill in the form, and send it in time to Andy Deelen at Elsevier (precise address at bottom of the form). Do not send it to me. The book gives a survey of categorical logic and type theory starting from the unifying concept of a fibration. Its intended audience consists of logicians, type theorists, category theorists and (theoretical) computer scientists. It contains the following chapters. Prospectus Introduction to fibred category theory Simple type theory Equational Logic First order predicate logic Higher order predicate logic The effective topos Internal category theory Polymorphic type theory Advanced fibred category theory First order dependent type theory Higher order dependent type theory References Notation index Subject index More information can be obtained from the authors webpage: http://www.cs.kun.nl/~bart/CLT/bookinfo.html Bart Jacobs, Dep. Comp. Sci., Univ. Nijmegen, P.O. Box 9010, 6500 GL Nijmegen, The Netherlands. Email: bart(a)cs.kun.nl PS. Please pass this information on to your institute's librarian.

2 1

Union College Conference
by Brenda Johnson 28 Jul '01

28 Jul '01

This is the second announcement regarding the Union College Conference on Algebraic Topology and Category Theory. The conference will take place September 29-30, 2001 at Union College in Schenectady, NY. There will be plenary talks and parallel sessions for contributed talks in algebraic topology and category theory. For more information about the conference, including registration, submission of abstracts, housing and transportation, please visit our website at: http://www.math.union.edu/~niefiels/01Conference/ The deadline for submission of abstracts is September 7th, and for registration is September 14th. We hope to see you in September! Brenda Johnson Kathryn Lesh Susan Niefield Kimmo Rosenthal

1 0

preprint: survey of definitions of n-category
by Tom Leinster 27 Jul '01

27 Jul '01

The following paper is now available: "A Survey of Definitions of n-Category" Abstract: Many people have proposed definitions of `weak n-category'. Ten of them are presented here. Each definition is given in two pages, with a further two pages on what happens when n = 0, 1, or 2. The definitions can be read independently. Chatty bibliography follows. It's on the archive as math.CT/0107188, i.e. is at http://arXiv.org/abs/math.CT/0107188 . (Also of interest might be some notes from informal talks, "Topology and higher-dimensional category theory: the rough idea", http://arXiv.org/abs/math.CT/0106240 .) Thanks, Tom 29-Jul-2001 12:11:53 -0300,1360;000000000001-00000021

1 0

ICALP 2002 Call for Papers
by trivino＠lcc.uma.es 25 Jul '01

25 Jul '01

We apologize for possible multiple postings. In http://www.lcc.uma.es/icalp2002/c4p-jul01.pdf you can find a pdf version of this call for paper. +++++++++++++++++++++++++++++++++++++ Call for Papers ICALP 2002 29th International Colloquium on Automata, Languages and Programming July 8-13, 2002, MÃ¡laga, Spain Camera Ready: April 16, 2002 The 29th annual meeting of the European Association of Theoretical Computer Science will be held in MÃ¡laga, Spain, July 8-13, 2002 (at the E.T.S. IngenierÃa InformÃ¡tica). As with the Journal Theoretical Computer Science (TCS), the scientific program of the Colloquium will be split into two parts: Track A of the meeting will correspond to Algorithms, Automata, Complexity and Games, while Track B to Logic, Semantics and Theory of Programming. SUBMISIONS: Authors are invited to submit extended abstract of their papers, presenting original contributions to the theory of computer science. Detailed instructions for paper submissions will be found on the conference webpage (http://www.lcc.uma.es/icalp2002) and in future calls for papers. Submissions should consist of: a cover page, with the author's full name, address, fax number, e-mail address, a 100-word abstract, keywords and to which track (A or B) the paper is being submitted and an extended abstract describing original research. At least one author of an accepted paper should be available to present it at the conference. Simultaneous submission to other conferences with published proceedings is not allowed. Further information (dates and instructions for submissions, workshops, registration, location and travel) will be provided in future announcements. ORGANIZING COMMITEE: Buenaventura Clares (University of Granada), Ricardo Conejo (University of MÃ¡laga), Inmaculada Fortes (University of MÃ¡laga), Llanos Mora (University of MÃ¡laga), Rafael Morales (co-Chair, University of MÃ¡laga), Marlon NuÃ±ez (University of MÃ¡laga), JosÃ© Luis PÃ©rez de la Cruz (University of MÃ¡laga), Gonzalo Ramos (University of MÃ¡laga), Francisco Triguero (co-Chair, University of MÃ¡laga), JosÃ© Luis TriviÃ±o (University of MÃ¡laga). IMPORTANT DATES: Workshops proposal: November 8, 2001 Submissions: January 14, 2002 Notification: March 20, 2002 CONFERENCE CO-CHAIRS Prof. Francisco Triguero Prof. Rafael Morales Universidad de MÃ¡laga E.T.S. IngenierÃa InformÃ¡tica Dept. Lenguajes y Ciencias de la ComputaciÃ³n Bulevar Louis Pasteur, 35 29071 - MÃ¡laga (SPAIN) e-mail: icalp2002(a)informatica.uma.es PROGRAM COMMITEE Track A Ricardo Baeza-Yates (U. Chile) Volker Diekert (U. Stuttgart) Paolo Ferragina (U. Pisa) Catherine Greenhill (U. Melbourne) Torben Hagerup (U. Frankfurt) Johan HÃ¥stad (KTH, Stockholm) Gabriel Istrate (Los Alamos) Claire Kenyon (U. Paris XI) Der-Tsai Lee (Acad. Sinica, Taipei) Heikki Mannila (Nokia, Helsinki) Elvira Mayordomo (U. Zaragoza) Helmut Prodinger (U. Witwatersrand, South Africa) Jan van Leeuwen(U. Utrecht) Paul VitÃ¡nyi (CWI, Amsterdam) Peter Widmayer (ETH ZÃ¼rich) (Chair) Gerhard Woeginger (T.U. Graz) Christos Zaroliagis (U. Patras) Track B MartÃn Abadi (Bell Labs Research, Lucent) Roberto Amadio (U. Provence) Gilles Barthe (INRIA-SophiaAntipolis) Manfred Droste (University of Technology Dresden) CÃ©dric Fournet (Microsoft Cambridge) Matthew Hennessy (U. Sussex) (Chair) Furio Honsell (U. Udine) Peter O'Hearn (Queen Mary & W. C. London) Fernando Orejas (U.P.Catalunya) Ernesto Pimentel (U. MÃ¡laga) David Sands (Chalmers University of Technology and GÃ¶teborg University) Dave Schmidt (U. Kansas) Gheorghe Stefanescu (U. Bucharest) Vasco Vasconcelos (U. Lisbon) Thomas Wilke (U. Kiel) 27-Jul-2001 09:50:14 -0300,1445;000000000000-00000020

1 0

Alternative characterisation of 'flat sublocale' wanted
by Christopher Townsend 25 Jul '01

25 Jul '01

If C is an ordered symmetric monoidal closed category (i.e. has a tensor such that X \tensor (_) has a right adjoint) then the category ICMon(C) of idempotent commutative monoids over C (such that the monoidal operation preserves the order in a sensible way) forms a category that can behave like the category of frames. Take for example C= Sup lattices, or C = Preframes and ICMon(C) is, in both cases, equivalent to the category of frames. I was therefore trying to look at ICMon(C)^op for any symmetric monoidal C, and see how well Locale theory can be done in this category. Does anyone have any suggestions about how a flat sublocale may be axiomatised in this setting? Thanks Christopher [i: X_0 >-> X (a regular monic in the category of locales, i.e. a sublocale) is flat iff the corresponding nucleus preserves finite joins] _________________________________________________________________ Get your FREE download of MSN Explorer at http://explorer.msn.com/intl.asp 26-Jul-2001 17:56:25 -0300,4460;000000000000-0000001f

1 0

job: PhD Studentship available
by Andrea Schalk 20 Jul '01

20 Jul '01

Dear colleagues, I would appreciate it if you could pass the following on to potential candidates. Thank you very much Andrea -- Dr A. Schalk, Dept of Computer Science, email: A.Schalk(a)cs.man.ac.uk University of Manchester, Oxford Rd, phone: +44 (0)161 275 6174 Manchester, M13 9PL, UK fax: +44 (0)161 275 6204 http://www.cs.man.ac.uk/~schalk/ PhD Studentship =============== A studentship is available as part of the three year EPSRC project `Developing a categorical semantics for the mu-calculus' at the Department of Computer Science at the University of Manchester for the entire period. The general area of the project might be described as `logic in computer science'. This is one of the fields where mathematics and computer science overlap. Prospective candidates should have a good degree (2.(i) and up or equivalent) in mathematics or computer science. Some background in logic and/or category theory would be useful but is not essential, whereas familiarity with mathematical notions and methods is expected. Training in areas underlying the project will be provided as appropriate. The project has been designed such that genuine research can begin almost immediately, without too much initial acquisition of background knowledge. The studentship will cover all fees for a three year period as well as paying a yearly maintenance grant at the standard rate (currently GBP 6800). It comes with sufficient funds to cover travel to summer schools and conferences, and possibly brief visits to other institutions. The department offers the opportunity to take postgraduate courses free of charge. It also offers a number of teaching assistantships which can supplement maintenance grants. A machine will be provided. PhD students in the department typically share an office with three or four people. Possible starting dates are 1st October 2001 or 1st January 2002. The project student will be a member of the `computational models' subgroup of the Foundations group. Also known as the `theory group' it currently consists of five members of staff, one post-doctoral RA and five PhD students. There are members from both the mathematics and the computer science departments. Research interests include type theory, semantics, graph rewriting, mathematical models of computation and all aspects of logic in computer science. There are weekly group meetings where all members, including research students, regularly talk about their work. There also are frequent mini-courses in relevant areas which are designed to help postgraduate students to develop solid foundations in semantics and logic. The project itself is concerned with the mu-calculus, a system that has both greatest and least fixed point constructs. The modal mu-calculus is typically used as a logic to describe processes. It is the aim of the project to develop categorical semantics for this system based on games. The principal investigator is Andrea Schalk; her webpage can be found at http://www.cs.man.ac.uk/~schalk/ For enquiries and further details please contact her at A.Schalk(a)cs.man.ac.uk 26-Jul-2001 10:29:33 -0300,1773;000000000000-0000001e

1 0

cfp: FLOPS 2002, First Call for Papers
by Zhenjiang Hu 15 Jul '01

15 Jul '01

We apologize, if you receive this message more than once. ********************************************************************* * * * CALL FOR PAPERS * * * * Sixth International Symposium on Functional and Logic Programming * * (FLOPS 2002) * * (Co-located with ACM SIGPLAN Aisa-PEPM 2002) * * * * University of Aizu, Aizu, Japan * * September 15--17, 2002 * * * * http://www.ipl.t.u-tokyo.ac.jp/FLOPS2002/ * * * ********************************************************************* Background ========== The symposium is a forum for research on all issues concerning functional programming and logic programming. In particular, it wants to stimulate the cross-fertilization as well as integration of the two paradigms. The symposium takes place about every 1.5 years in Japan. Previous FLOPS meetings were held in Fuji Susuno (1995), Shonan Village (1996), Kyoto(1998), Tsukuba (1999), and Tokyo (2001). Topics ====== The Sixth International Symposium on Functional and Logic Programming (FLOPS 2002) solicits original papers in all areas of functional and logic programming, including (but not limited to): * Language issues: language design and constructs, programming methodology, integration of paradigms, interfacing with other languages, type systems, constraints, concurrency and distributed computing * Foundations: semantics, rewrite systems and narrowing, type theory, proof systems * Implementation: compilation techniques, memory management, program analysis and transformation, partial evaluation, parallelism * Applications: case studies, real-world applications, graphical user interfaces, internet applications, database connection, formal methods and model checking Submissions =========== Submissions must be unpublished and not submitted for publication elsewhere. Submissions should fall into one of the following two categories: 1. Regular research papers: they should describe new results and will be judged on originality, correctness and significance. 2. System descriptions: they should contain a link to a working system and will be judged on originality, usefulness and design. All submissions must be written in English. Regular research papers can be up to 15 proceedings pages long, system descriptions will be up to 4 pages long. Authors are strongly encouraged to use LaTeX2e and the Springer llncs class file, available at http://www.springer.de/comp/lncs/authors.html The title page should indicate the submission category. Regular research papers should be supported by proofs and/or experimental results. In case of lack of space, this supporting information should be made accesible otherwise (e.g. a link to a web page, or an appendix). Submission is Web-based. In order to submit a paper, authors should fill in the submission form available at http://www.ucm.es/info/flops2002/www/submit.html where more detailed instructions are given. If submission through the Web is not possible, five hard copies may be sent to Mario Rodriguez-Artalejo Universidad Complutense de Madrid Departamento de Sistemas Informaticos y Programacion Edificio Fac. Matematicas Av. Complutense s/n 28040 Madrid, Spain Publication and presentation of accepted contributions ====================================================== The Proceedings of FLOPS 2002 will be published by Springer Verlag in the LNCS series. They will be available at the conference. One author of each accepted contribution is expected to attend the Symposium in order to present it. Presentations of regular research papers will be scheduled for 30 minutes, including questions from the audience. System presentations will be scheduled for 15 minutes. Important Dates =============== Submission Deadline: March 1, 2002 Notification: May 21, 2002 Final Version: June 25, 2002 Symposium: September 15--17, 2002 Program Co-Chairs ================= Zhenjiang Hu University of Tokyo, Japan Mario Rodriguez-Artalejo Universidad Complutense, Madrid, Spain E-Mail: flops2002(a)ucm.es Program Committee ================= Maria Alpuente Technical University of Valencia, Spain Wei-Ngan Chin National University of Singapore, Singapore Pierre Deransart INRIA-Rocquencourt, France Moreno Falaschi University of Udine, Italy Michael Hanus University of Kiel, Germany Zhenjiang Hu (Co-Chair) University of Tokyo, Japan Jan Maluszynski Linkoeping University, Sweden Aart Middeldorp University of Tsukuba, Japan Gopalan Nadathur University of Minnesota, USA Susumu Nishimura Kyoto University, Japan Catuscia Palamidessi The Pennsylvania State University, USA Mario Rodriguez-Artalejo (Co-Chair) Universidad Complutense, Madrid, Spain Francesca Rossi University of Padova, Italy Harald Sondergaard The University of Melbourne, Australia Kazunori Ueda Waseda University, Japan Kwangkeun Yi KAIST, Korea Local Arrangements Chair ======================== Taro Suzuki University of Aizu, Japan Sponsors ======== Sponsored by: Japan Society of Software Science and Technology (JSSST), Special Interest Group on Principles of Programming. In cooperation with: Association for Logic Programming (ALP). 21-Jul-2001 16:00:37 -0300,3783;000000000000-0000001d

1 0

jobs: Post-doc Positions Available at Stevens
by Adriana Compagnoni 14 Jul '01

14 Jul '01

We apologize if you have received multiple copies of this message. ---------------------------------------------------------------------- http://www.cs.stevens-tech.edu/Lab/SecureSystems_Lab/JoinUs.htm Post-Doctoral Positions Available Laboratory for Secure Systems Department of Computer Science Stevens Institute of Technology The Laboratory for Secure Systems at the Computer Science Department of Stevens Institute of Technology invites applications for Post-doctoral positions. The Lab has been recently created, and its mission is to pioneer new technologies for high-assurance and secure systems and prototype tools that can provide guarantees that a system will not exhibit unpredictable behavior in a hostile environment. Our objective is to consolidate and organize research already under way at Stevens. We are taking several approaches to language-based tools for high-assurance, secure systems. Language-based automated analysis can be used to check components during development and also at the point of deployment. Such analyses can complement trust-based approaches to security of mobile components and enhance performance by reducing overhead of run-time checking. Language-based tools fit the programming environments of professional practice, along side other tools like test-generators and performance profilers. Type-based analyses can prevent leakage of privileged data even with dynamic linking and replacement of libraries at run-time. New abstractions are being developed for fault-tolerant computation in wide area networks. Verification techniques can check correctness of implementations of security protocols. Much interest already exists in furthering the technologies, as demonstrated by collaborations of the faculty amongst themselves, with other academic institutions (e.g., with the Secure Internet Programming Laboratory at Princeton, with the FLINT project at Yale, with the University of Edinburgh), and with industrial partners (e.g., Lucent Technologies). Our work has current funding from industrial partners, through multiple grants from the National Science Foundation and the New Jersey Commission of Science and Technology. Successful applicants will be enthusiastic team players with a strong commitment to academic excellence. A PhD in Computer Science or Applied Mathematics or equivalent education is required. Preference will be given to applicants with experience in at least one of the following areas: *Type theory *Static program analysis *Formal verification *Semantics of programming languages *Higher-order programming languages *Implementation of programming languages Post-docs will participate in state of the art research in collaboration with other members of the Lab; they will produce technical reports to document their findings, and participate in building proof of concept software systems to experiment with research advances. The positions are initially for two years, renewable for a third year upon performance and availability of funds. Positions are expected to start with the new academic year in September 2001, but the starting date is flexible. Applicants should send a CV, a statement of research interests, and arrange for three letters of recommendation to be sent to: Adriana Compagnoni Department of Computer Science Stevens Institute of Technology Castle Point on Hudson Hoboken, NJ 07030 U. S. A. e-mail: abc(a)cs.stevens-tech.edu For more information contact Adriana Compagnoni (abc(a)cs.stevens-tech.edu) Dominic Duggan (dduggan(a)cs.stevens-tech.edu) or David Naumann (naumann(a)cs.stevens-tech.edu) Stevens Institute of Technology is an Equal Opportunity Employer. Laboratory for Secure Systems (http://www.cs.stevens-tech.edu/Lab/SecureSystems_Lab/) Computer Science Department (http://www.cs.stevens-tech.edu/) LocalWords: http www SecureSystems JoinUs htm docs initially CV dduggan LocalWords: Naumann 21-Jul-2001 15:30:59 -0300,7149;000000000000-0000001c

1 0

Yoneda preserves cartesian exponentiation
by F W Lawvere 12 Jul '01

12 Jul '01

Concerning publication of this remark see Diagonal Arguments and Cartesian Closed Categories Springer Lecture Notes in Mathematics 92, (1969) 134-145 21-Jul-2001 15:30:57 -0300,4874;000000000000-0000001b

1 0

Introductory books on category theory
by Richard Dybowski 11 Jul '01

11 Jul '01

I would be grateful if members of this list could give me their recommendations for introductory books on category theory. In particular, what is your opinion of "Conceptual Mathematics: A First Introduction to Categories" by Lawvere and Schanuel? Richard ------------------------------- Richard Dybowski, 143 Village Way, Pinner, Middlesex HA5 5AA, UK Tel (mobile): 079 76 25 00 92

7 6