December 2004 - Categories - categories.org.au

A question for topos theorists.
by jean benabou 20 Jan '05

20 Jan '05

I have recently come across a question, which seems to me natural, and before trying to solve it, I wanted to know if an answer was already known. If E is a category with pullbacks so is the category Cat(E) having as objects the internal categories of E and and as maps the internal functors F: A ---> B. I shall say that such an F is a "Pi-functor" if the pullback functor: Cat(E)/B --->Cat(E)/A has a right adjoint Pi/F: Cat(E)/A---->Cat(E)/B When E=Set there is a well known Conduché-Giraud condition characterizing such functors. Is there such a characterization when E is an (elementary) topos? If there is, what is the condition and where can it be found? Best wishes to all, Jean

2 1

Trustworthy Global Computing
by tgc＠rap.dsi.unifi.it 31 Dec '04

31 Dec '04

Dear Collegue, within ETAPS 2005, we are organizing a symposium on "Trustworthy Global Computing", http://www.cs.unibo.it/~sangio/TGC05/ The format is not that of a classical conference but one structured to leave room for discussions stimulated by a conspicuous number of invited talks (the above mentioned web page contains the full list of the 11 invited speakers) and by the papers selected after standard refereeing. Please consider submitting and distribute the CFP to members of your groups and departments. The important dates are - Deadline for papers submission: January 14, 2005 - Symposium: April 7-9, 2005 Best Wishes for the New Year. Rocco De Nicola, Davide Sangiorgi, Lorenzo Bettini ----------- you received this e-mail via the individual or collective address categories(a)mta.ca to unsubscribe from ETAPS list: contact etaps05(a)inf.ed.ac.uk -----------

1 0

preprint on groupoids and quantales
by Pedro Resende 24 Dec '04

24 Dec '04

I have placed in the arXiv a preprint on (mostly etale) groupoids and quantales (59 pages) that contains material about which I talked last Spring in Coimbra, at CT04 in Vancouver, and recently in Cambridge. http://arXiv.org/abs/math/0412478 Best wishes, Pedro. 28-Dec-2004 23:30:26 -0400,1509;000000000000-00000000

1 0

Duality of linear programming
by Agnes Boskovitz 22 Dec '04

22 Dec '04

Can anyone tell me where I might read about linear programming duality from the point of view of category theory? Agnes Boskovitz 26-Dec-2004 12:18:15 -0400,1012;000000000000-00000000

1 0

CFP CALCO
by Markus Roggenbach 14 Dec '04

14 Dec '04

We apologise if you receive multiple copies. *--------------------------------------------------------------------* * 3nd Call for Papers * * * * CALCO 2005 * * * * =091st Conference on Algebra and Coalgebra in Computer Science * * * * September 3-6, 2005, Swansea, Wales, UK * * * *--------------------------------------------------------------------* * Abstract submission : January 21, 2005 * * Technical paper submission: January 31, 2005 * * Author notification: April 11, 2005 * *--------------------------------------------------------------------* * http://www.cs.swan.ac.uk/calco/ * *--------------------------------------------------------------------* With the support of IFIP WG1.3 on Foundations of System Specification CMCS - the International Workshop on Coalgebraic Methods in Computer Science, and WADT - the Workshop on Algebraic Development Techniques, are joining their forces and reputations into a new high level bi-annual conference. Starting in 2005, CALCO will bring together researchers and practitioners to exchange new results related to foundational aspects and both traditional and emerging uses of algebras and coalgebras in computer science. CALCO 2005 will be preceded by a CALCO Young Researchers Workshop, CALCO-jnr, dedicated to presentations by PhD students and by those who completed their doctoral studies within the past few years (see www.cs.swan.ac.uk/calco-jnr/ for details). Topics of Interest ------------------ We invite submission of technical papers that report results of theoretical work on the mathematics of algebras and coalgebras, the way these results can support methods and techniques for software development, as well as experience with the transition of resulting technologies into industrial practise. We encourage submissions in topics included or related to those in the lists below. Algebras and coalgebras as mathematical objects: Automata and languages Categorical semantics Hybrid, probabilistic, and timed systems Inductive and coinductive methods Modal logics Relational systems and term rewriting Algebras and coalgebras in computer science: Abstract data types Algebraic and coalgebraic specification Calculi and models of concurrent, distributed, mobile, and context-aware computing Formal testing and quality assurance General systems theory and computational models (chemical, biological, etc) Generative programming and model-driven development Models, correctness and (re)configuration of hardware/middleware/architectures Re-engineering techniques (program transformation) Semantics of conceptual modelling methods and techniques Semantics of programming languages Validation and verification Submission Guidelines --------------------- Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Experience papers are welcome, but they must clearly present general lessons learned that would be of interest and benefit to a broad audience of both researchers and practitioners. Proceedings will be published in the Springer LNCS series. Final papers will be no more than 15 pages long in the format specified by Springer. It is recommended that submissions adhere to that format and length (see at http://www.springer.de/comp/lncs/authors.html) Submissions that are clearly too long may be rejected immediately. Proofs omitted due to space limitations may be included in a clearly marked appendix. Paper submissions will be made electronically at he conference web site. Both an abstract and the full paper must be submitted by their respective submission deadlines. A special issue of Theoretical Computer Science consisting of extended versions of selected papers will be produced after the conference if there are enough good papers that can be extended and revised to the standards of this journal. Invited Speakers ---------------- The so-far confirmed invited speakers for CALCO 05 are: * Samson Abramsky, Christopher Strachey Professor of Computer Science, University of Oxford, UK. * Vladimiro Sassone, Professor of Informatics, University of Sussex, UK. Important Dates (all in 2005) ----------------------------- Jan 21 Abstract submission due Jan 31 Technical paper submissions due April 11 Author notification May 30 Camera ready due Sept 3-6 CALCO technical programme Programme Committee ------------------- Jose Fiadeiro, University of Leicester, UK (co-chair) Jan Rutten, CWI & Free University Amsterdam, NL (co-chair) Luca Aceto, Aalborg University, DK, and Reykjav=EDk University, IS Jiri Adamek, University of Braunschweig, D Christel Baier, University of Bonn, D Michel Bidoit, CNRS, Cachan, F Jules Desharnais, Laval University, CAN Marie-Claude Gaudel, LRI-CNRS, Paris, F Reiko Heckel, University of Leicester, UK H.Peter Gumm, Philipps University, Marburg, D Ugo Montanari, University of Pisa, I Larry Moss, Indiana University, Bloomington, USA Peter Mosses, BRICS and University of Aarhus, DK, from 1.1.2005: University of Wales Swansea, UK Fernando Orejas, Politechnical University Catalunia, Barcelona, E Francesco Parisi-Presicce, George Mason University, Fairfax, USA John Power, University of Edinburgh, UK Horst Reichel, Technical University Dresden, D Eugene Stark, Stony Brook University, New York, USA Andrzej Tarlecki, Warsaw University, PL John Tucker, University of Wales Swansea, UK Martin Wirsing, Ludwig-Maximilian University, Muenchen, D Steering Committee ------------------ Jiri Adamek, Nakagawa Ataru, Michel Bidoit, Jose Fiadeiro (co-chair), H.Peter Gumm, Bart Jacobs Hans- Jorg Kreowski, Ugo Montanari, Larry Moss, Peter Mosses, Fernando Orejas, Francesco Parisi-Presicce, John Power, Horst Reichel, Markus Roggenbach, Jan Rutten (co-chair), Andrzej Tarlecki Organising Committee -------------------- Neal Harman and Markus Roggenbach, University of Wales Swansea, UK Location and Organisation ------------------------- The City of Swansea dates from the 10th Century AD and is currently an expanding centre for high tech. industry. Swansea is located at the centre of the South Wales coastline, next to the Gower peninsula, renowned for its dramatic coastal scenery and beaches. The conference will be held on the Swansea University campus overlooking the sea. Accommodation will be available in newly built halls of residence and also in a small selection of good quality hotels. A full social programme drawing on the culture of the area will complement the scientific event. This CFP version dated: 14th December 2004. --=20 ------------------------------------------------------------------- Markus Roggenbach Phone +44-1792-51-3578 Dept. of Computer Science Fax +44-1792-295708 University of Wales Swansea M.Roggenbach(a)Swan.ac.uk Singleton Park http://www.cs.swan.ac.uk/~csmarkus Swansea SA2 8PP, United Kingdom -------------------------------------------------------------------- 14-Dec-2004 10:07:36 -0400,5844;000000000001-00000000

1 0

CFP: SPIN 2005 - Workshop on Model Checking of Software
by Susanne Graf 13 Dec '04

13 Dec '04

SPIN 2005 Call for Papers 12th International SPIN Workshop on Model Checking of Software August 22-24, 2005, San Francisco, USA (Co-located with CONCUR 2005) http://cm.bell-labs.com/cm/cs/what/spin2005/index.html SPIN 2005 solicits previously unpublished, currently unsubmitted, original contributions addressing theoretical, experimental and applied problems in model checking of software artifacts. Particular topics include: * model-checking based tools, tool extensions and comparative studies * theoretical and algorithmic foundations of model-checking based analysis * combination of model-checking techniques with other analysis techniques * model checking of programming languages and code analysis * techniques for analyzing and testing large and infinite state systems * model checking in the system life-cycle * innovative applications of model checking, including o model checking of object-oriented and component based systems o model checking of security systems o model checking of real-time systems * engineering of model-checking tools and platforms * convincing case studies which apply model-checking to real software systems Submissions will be judged on originality, significance, correctness, and clarity. A submitted paper should clearly express the contribution of the work, both in general and in technical terms. It is essential to identify what was accomplished, describe the significance of the work, and explain how the paper compares with, and improves upon, previous work. Although authors are encouraged to compare their work with existing model checkers such as SPIN, the scope of the workshop is not limited to topics directly related to the SPIN system. We solicit submissions of two categories of papers: Full papers: submissions are limited to 15 pages, and should adhere to Springer Verlag's LNCS format, preferably using LaTeX. The format of the submissions should be either pdf or postscript. Authors who feel it is absolutely necessary to include additional material may place it in a well-marked appendix after page 15, but committee members are under no obligation to review this material. Tool presentations: SPIN 2005 solicits proposals for the demonstration of tools pertinent to the technical objective of this workshop. Proposals should be submitted as a summary of up to 5 pages (using Springer Verlag's LNCS format) which will be included in the workshop proceedings. The title of the summary should clearly indicate that this is a tool demonstration summary. Longer tool-related contributions should be submitted as full papers. Accepted contributions will be included in the workshop proceedings which will be published by Springer Verlag in the Lecture Notes in Computer Science series. Important Dates =============== April 1, 2005 Submission deadline for Abstracts April 8, 2005 Submission deadline for Papers May 16, 2005 Notification of acceptance June 13, 2005 Final version of papers due August 22-24, 2005 SPIN 2005 in San Francisco Invited Speakers: Rajeev Alur (University of Pennsylvania) Dawson Engler (Stanford University) David Wagner (UC Berkeley) Invited Tutorials: Modex/Feaver by Gerard Holzmann and Theo Ruys BLAST by Tom Henzinger, Ranjit Jhala and Rupak Majumdar Java PathFinder by Willem Visser SPIN 2005 web-site: http://cm.bell-labs.com/cm/cs/what/spin2005/index.html Program Chair: Patrice Godefroid (Bell Laboratories, Lucent Technologies) Program Committee: George Avrunin (U. Mass. Amherst, USA) Dennis Dams (Bell Labs, USA) Stefan Edelkamp (U. Dortmund, Germany) Cormac Flanagan (UC Santa Cruz, USA) Jaco Geldenhuys (Tampere U., Finland) Patrice Godefroid (Bell Labs, USA; chair) Susanne Graf (Verimag, France) Gerard Holzmann (NASA JPL, USA) Sarfraz Khurshid (UT Austin, USA) Stefan Leue (U. Konstanz, Germany) Rupak Majumdar (UCLA, USA) Laurent Mounier (Verimag, France) Shaz Qadeer (Microsoft, USA) Theo Ruys (U. Twente, the Netherlands) Willem Visser (NASA Ames, USA) Pierre Wolper (U. Liege, Belgium) Advisory Committee: Gerard Holzmann (NASA JPL, USA; chair) Amir Pnueli (Weizmann Inst., Israel) Steering Committee: Thomas Ball (Microsoft, USA) Susanne Graf (Verimag, France) Stefan Leue (U. Konstanz, Germany) Moshe Vardi (Rice U., USA) Pierre Wolper (U. Liege, Belgium; chair) -- ------------------------------------------------------------------------ Susanne Graf | tel : (+33) (0)4 56 52 03 52 VERIMAG | fax : (+33) (0)4 56 52 03 44 2, avenue de Vignate | http://www-verimag.imag.fr/~graf/ F - 38610 Gieres | e-mail: Susanne.Graf(a)imag.fr ------------------------------------------------------------------------ 26-Dec-2004 12:18:15 -0400,919;000000000000-00000000

1 0

question about fibrations
by Alexey Cherchago 13 Dec '04

13 Dec '04

Dear Cat Community, I have the following question about preservation of properties of fiber categories in the total category: Given a contravariant indexed category F : B^Op -> Cat, and the Grothendieck translation from the indexed category to fibrations Flat(F). Then, the first projection P : Flat(F) -> B forms a (split) fibration, called the flattening of F. Now assume that the fiber categories are complete/cocomplete/adhesive. Would it be the case that the total category Flat(F) of the described (split) fibration is also complete/cocomplete/adhesive? Any references would be appreciated. Thank you kindly. Best regards, Alexey Cherchago 25-Nov-2004 14:18:16 -0400,2139;000000000000-00000000

5 5

Tenure track position
by James Lipton 13 Dec '04

13 Dec '04

The Department of Mathematics and Computer Science at Wesleyan University is seeking to fill a tenure-track computer science position at the level of Assistant Professor or Associate Professor without tenure starting in the fall term of 2005. Candidates for the position should have a PhD or be near completion of a PhD in Computer Science or a related area. The Department ( http://www.math-cs.wesleyan.edu) currently has four full-time computer scientists with research interests in algorithms, bioinformatics, programming languages, and computational logic. There is excellent interaction with faculty in the department in the fields of combinatorics and logic and with faculty in the sciences through an inter-disciplinary initiative in integrative genomic sciences. The Department has undergraduate degree programs in both mathematics and computer science as well as active MA and PhD programs. The teaching load in Computer Science is three courses per academic year. Outstanding candidates in any area of computer science are encouraged to apply. We are looking for candidates with excellent research records and a strong commitment to undergraduate and graduate instruction, who are prepared to contribute to the standard undergraduate curriculum in computer science and to play an active role in the graduate program. Wesleyan is a highly selective university that offers a unique combination of liberal-arts college spirit in the classroom with an unusually strong commitment to research for a school of its size. The student body is made up of approximately 2900 full-time undergraduates and graduate students in 41 departments and programs. Wesleyan University is an equal opportunity/affirmative action employer. Women and minorities are encouraged to apply. Inquiries about the position may be sent to csjob(a)wesleyan.edu. Consideration of applications will begin January 3, 2005 and will continue until the position is filled. Applicants should arrange to have at least three letters of recommendation, including one letter that evaluates teaching qualifications, sent directly to the following address: Computer Science Search Committee Department of Mathematics & Computer Science Wesleyan University Middletown, CT 06459-0128 14-Dec-2004 10:07:36 -0400,8224;000000000001-00000000

1 0

CFP: Games for Logic and Programming Languages
by Dan Ghica 10 Dec '04

10 Dec '04

CALL FOR PAPERS: Games for Logic and Programming Languages An Etaps 2005 Workshop Edinburgh, 2-3 April 2005 [http://users.ox.ac.uk/%7Ecoml0074/galop.html] In the past decade game semantics has emerged as a new and successful paradigm in the field of semantics of logics and programming languages. Game semantics made its breakthrough in computer science in the early 90s, providing an innovative set of methods and techniques for the analysis of logical systems. Subsequently, game-semantic techniques led to the development of the first syntax-independent fully-abstract models for a variety of programming languages, ranging from the purely functional to languages with non-functional features such as control, references or concurrency. There are also emerging connections between game semantics and other semantic theories, notably theories of concurrency such as the pi-calculus, and traditional tree-based semantics of lambda calculi. In addition to semantic analysis, an algorithmic approach to game semantics has recently been developed, with a view to applications in computer assisted verification and program analysis. The aim of the workshop is to provide opportunity for interaction with other Etaps'05 events and to become a major meeting point in the research area of Game Semantics and its applications. Invited speakers * Luke Ong, Oxford University * Luca de Alfaro, University of California, Santa Cruz Publication This is intended to be an informal workshop. Participants are encouraged to present work in progress, overviews of more extensive work, and programmatic/position papers, as well as completed projects. We therefore ask for submission both of short abstracts outlining what will be presented at the workshop and of longer papers describing completed work, either published or unpublished, in the following areas: * Game theory and interaction models in semantics * Games-based design and verification * Logics for games and games for logics * Algorithmic aspects of games In order to make a submission: * Format your file using the LNCS guidelines. We suggest a 15 page limit. * Email a PostScript or PDF version to dan.ghica(a)comlab.ox.ac.uk. A participants' proceedings will be distributed at the workshop and made available as a Oxford University technical report. A special journal issue associated with the workshop is being considered; this will be discussed at the workshop. Important dates * Submission due: January 15th * Notification of acceptance: February 15th * Final version due: March 1st * Workshop dates: April 2-3, 2005. Program committee: Samson Abramsky, Oxford University Pierre-Louis Curien, Universite Paris 7 Russ Harmer, Universite Paris 7 Kohei Honda, Queen Mary University of London Furio Honsell, University of Udine Martin Hyland, Cambridge University Radha Jagadeesan, DePaul University Jim Laird, University of Sussex Thomas Streicher, Universitaet Darmstadt Chairs: Dan Ghica, Oxford University Guy McCusker, University of Sussex 13-Dec-2004 13:27:38 -0400,3468;000000000000-00000000

1 0

None
by David J. Pym 08 Dec '04

08 Dec '04

20031205 Thunderbird/0.4 X-Accept-Language: en-us, en MIME-Version: 1.0 To: categories(a)mta.ca Subject: categories: 3-year Lectureship, Logic/TCS, Bath, England Content-Type: text/plain; charset=3DISO-8859-1; format=3Dflowed Content-Transfer-Encoding: 8bit X-Spam-Score: 0.0 (/) Sender: cat-dist(a)mta.ca Precedence: bulk Lectureship (3 years) Computer Science Department of Computer Science This post arises as a direct result of a Royal Society Industry Fellowship awarded to Professor David Pym. The Department is multi-disciplinary and has internationally renowned research. Three main research areas are: Human Computer Interaction, Mathematical Logic and Symbolic Computation, and Media Technology. Additional research interests lie in the broad area of agents and artificial intelligence. The person appointed will be required to contribute to undergraduate and postgraduate teaching in the areas of logic and theoretical computer science. Applicants should normally hold a suitable PhD or have equivalent research experience and show evidence of the ability to publish in international journals or conferences and to obtain research funding. Salary in the range =A327,989 to =A335,883 (Lecturer Grade B) Informal enquiries to Professor Peter Johnson, Head of Department (P.Johnson(a)bath.ac.uk; Tel +44(0)1225 383214, Fax +44(0)1225 383493). More information about the Department can be found at: http://www.bath.ac.uk/comp-sci/ Application forms and further particulars may be obtained from the Dept of Human Resources, University of Bath, Claverton Down, Bath, BA2 7AY, (tel. 01225 386873; fax 01225 386559; e-mail H.M.Keogh(a)bath.ac.uk) or e-mail jobs(a)bath.ac.uk or phone the 24 hour answer-phone service on Bath (01225) 386924, or textphone (01225) 386039 quoting the reference number: 04/396 Closing date for applications: Wednesday 22nd December 2004 An Equal Opportunities Employer Further Details: http://www.bath.ac.uk/jobs --=20 Prof. David J. Pym Telephone: +44 (0)1 225 38 3246 Professor of Logic & Computation Facsimile: +44 (0)1 225 38 3493 University of Bath Email: d.j.pym(a)bath.ac.uk Bath BA2 7AY, England, U.K. Web: http://www.bath.ac.uk/~cssdjp Royal Society Industry Fellow, HP Labs, Bristol: david.pym(a)hp.com

1 0