September 2002 - Categories - categories.org.au

mysterious passage
by Peter Freyd 17 Sep '02

17 Sep '02

Bill Halchin asks about some lines that refer to category theory in the document below, to wit: "What is this trying to say?" Beats me. I thought the original document might help. Well, here it is. Anyone know who the author is? http://www.asrios.ge/maincentreprojectsoverview_800.htm [last modified on August 11, 2002] FORMATION AND MANAGEMENT OF THE INFORMATIONAL LEGISLATIVE SPACE OF GEORGIA The program goal is the formation of integrated self-organizing, stable system of State Administration based on the informative- telecommunicative space, that ensure transparency, completeness and actualization of information and creation of favorable conditions for modeling certain cases, decision making, implementation and control. The principle objects of State Administration Structures are: . to promote more transparent standardized forms; to promote the efficient implementation of the basic and additional Government functions; to ensure the transparency of the activities of governmental and self-governmental institutions; to promote transformation of different forms from quantitative state into the qualitative one; to promote anti-corruption activities and protection of human rights and freedom; to reflect principles of evolution trends and state development The program goals are: to work out the modern model of State Administration Structures formation; to introduce the necessities and prospects of forming modern State Administration System; to work out basic criteria defining State Administration Structures; to introduce tasks and principles concerning formalization of State Administration Structures; to work out basic demands addressing perspective State Administration System; to show the influence of new informational technologies on formation of modern State Administration Structures. to work out basic principles of evolutionary transition to modern State Administration Structure. THEORETICAL APPROACH TO THE FORMATION OF PROGRESSIVE STATE ADMINISTRATION STRUCTURES State Administration System is a sole mechanism of raising problems, making decisions, implementing and controlling activities, that is decomposed in a hierarchical order and is reflected on the executive structures. Global economic, communicative and other correlation determine the integration process. State Administration Structure is one of the main components of this process. State Administration Structures, with their broad variety and conservatism have a negative impact on the integration process. Conceptual integration processes can not progress without united administration norms. Creation of perspective State Administration Structures is especially substantial for the countries building up a democratic society, where an intensive transformation process is in the initial stage and transition from one structure to another is possible. Modern world should be involved in unification and standardization processes of State Administration Structures, based on new scientific and technological approach. RESEARCH ON THE FORMATION OF UNIFIED DYNAMIC DATABASE STRUCTURE BASED ON MATHEMATICAL MODELS The program goal is development of methodology of construction of information complexes on the basis of their unification. Creation of dynamic information systems mechanisms of the account of functions, planning, management and performance of actions are the aspects of the methodology. Research works are carried out in the fields of unification of the elaboration of the structures of databases. Research topics include application of 'categorial' structure of database based on various mathematical models and theories, that gives possibility to conduct development of dynamic database structure based on Categorial Analysis, Petri Nets, Mathematical Lattice etc. One of the key tasks is to formulate and present the different applied fields, and more precisely the inter-correlation between them. General overview on research activities in carrying out mathematical structures in computer science: The category theory may become the core part of the mathematical instrument for the conceptual systems development. The system can be presented as a category in which the relative correlation exists among the objects (morphisms). Each system must be presented both on generalized and concrete reflection levels. The generalized level (upper level) and each of the concrete reflection levels are categories. Hence, it should be considered the process of reflection between general and concrete levels (functors). Each objects of the category system can be a system by itself (category). Consequently we have to consider lattice dependence of categories both on the generalized level and as well as on the decomposition of the objects. Each system changes in time. So it should be considered problems related to the dynamics of categories. Complex consideration and decisions of the above-stated and other related problems should ensure the formation of the mathematical base. This will enable to consider the creation of dynamic, unified distributed databases that can be used in various applied fields. TRAINING SYSTEM "INCREASING EFFICIENCY OF ORGANIZATIONS" The civil world went through the hard way of the formation of governmental, social and commercial organizations, and examined and worked out effective methodologies for functions of various organizational structures. Organization is a system consisting of interrelated components, which have definite properties, conditions of existence and functioning, integrity of management and the rules of activities. Simplicity, convenience, clearness, efficiency, controllability, guarantee and other quantitative indices should characterize the functioning of modern organizations. The system analysis of an organization with all its elements and interrelations, and all its spheres of competence, will allow to describe the organization, reveal its weak functional elements, formulate rational directions for its transformation, and demonstrate efficiency of the future organization. To achieve higher indices of organization activity it is necessary to carry out appropriate training of the stuff, first of all the management elite of organizations. The "Increasing Efficiency of Organizations" is a system of interdependent training courses which are technologically independent and short-termed, and which are oriented on a free choice of components, forms and cleanness of the teaching terms of the implementation of the training: 1 System analysis and transformation of organizations; 2 Strategic decisions in the development of organization; 3 Result-oriented strategy of the organization development; 4 Activities and orientations on the interests of consumers; 5 Organizational distribution of powers; 6 Diagnosing and changing organizational culture; 7 Rational and structural components of organization; 8 Institutional documents; 9 Decision-making methods; 10 Conceptual informatization of organizations; 11 The environment of new informational technologies; 12 Human resources management. The program conceptual goals are: giving the inter-depended system of knowledge and practical skills to the listeners in the field of modern methodologies and technologies of management in the organization activities; permanent expansion of the listeners' groups, who are receiving necessary and enough knowledge in the field of managing organization activities; the development of the system of knowledge and practical skills, which mainly corresponds to the listeners9 problems; form self-government and local administration ethics and develop the background for the institute9s effective functioning; to fill the information vacuum concerning this sphere; to increase the effectiveness of self-government and interaction of local administrations. The following thesis demonstrates that it is rather easier to fight against corruption during the reform than afterwards, when corruption becomes part of the system; creation of an intellectual basis for evolutional transition of the new forms and technologies of the organization activities. The entire program is oriented on: the leadership and stuff of the state bodies and the local administration, which should know new methods and technologies of governing for carrying out their office responsibilities, forming the aims and principles of the development of activities in proper organizations; the governing elite and the managers of commercial organizations, who within their responsibility should strive to increase the profits of enterprises, the effectiveness of functioning and correspondingly should carry out the necessary changes in proper organizations; the specialists in the field of organization and management of enterprise, creation of the information-computer system, who in their professional activity should use the most progressive methods and technologies of carrying out the analysis, introductions of effectively functioning organizational systems. the students and young specialists, who want to understand the idea of the system, organization, their components and peculiarities, to learn the principles and technologies of increasing the effectiveness and functioning of organization, and methods of transformation. * Projects both theoretical and practical are at various stages of study. 16-Sep-2002 17:26:55 -0300,2020;000000000000-00000000

1 0

ACSD 2003 Call for Papers
by Johan Lilius IB 16 Sep '02

16 Sep '02

************************************************************************ CALL FOR PAPERS ACSD 2003 International Conference on Application of Concurrency to System Design 18-20th of June 2003 Guimaraes, Portugal http://get.dsi.uminho.pt/acsd03 ************************************************************************ Co-sponsored by * IFIP WG10.5 and SIG-ES * OE/CEI - Col=E9gio de Engenharia Inform=E1tica da Ordem dos Engenheiros Portuguesa In cooperation with * FME - Formal Methods Europe Proceedings published by * IEEE Computer Society Press PURPOSE The International Conference on Application of Concurrency to System Design (ACSD) is being organized for the third time (see also ACSD 2001) to serve as a forum for disseminating advanced research results on theory and practice of design of concurrent systems. While there are a few success stories in this field, there is a real need to provide practitioners with adequately sound and expressive tools, and researchers with real motivations and examples. The aim of this conference is to contribute towards this goal by bringing together experts in a wide variety of fields related to complex concurrent system design and analysis. The scientific program will also include invited lectures covering the areas of current interest, tool presentations and demonstration. PROGRAM COMMITTEE CO-CHAIRS Felice Balarin - Cadence Berkeley Labs, USA Johan Lilius - Turku Centre for Computer Science and Abo Akademi University, Finland TOPICS OF INTEREST * Formal and semi-formal models: Petri nets, Process Algebras, Temporal Logics, Data Flow nets, Statecharts (both Harel's and UML), Synchronous Languages, HDLs, etc. * Formal methods for CAD and verification of concurrent systems: model checking, asynchronous design, high-level synthesis, hardware/software co-design, etc. * Real-time and hybrid systems * Discrete-event systems, communication protocols and interfaces * Concurrency issues in designing Systems-on-Chip * Case studies of concurrent systems design and verification * Presentation of software tools supporting the above topics PAPERS Submitted papers should be no more than 15 pages in 11-point font with a 60-word abstract, and should include a cover page with authors' physical and e-mail addresses, phone and FAX numbers by 1st December 2002. Paper submission will be handled electronically. More information will be available on the Conference web-pages. Accepted papers will be published by the IEEE Computer Society Press. TOOL DEMOS Submissions for tool demonstration should be no more than 2 pages and sent to Felice Balarin (felice(a)cadence.com) by 1st of February 2003. The accepted tool descriptions will appear as an appendix in the conference proceedings. IMPORTANT DATES Deadline for paper submission: 1st December 2002 Deadline for tool demonstration submission: 1st February 2003 Notification of acceptance: 1st March 2003 Deadline for final version: 28th March 2003 PROGRAM COMMITTEE F. Balarin (Cadence, USA) - felice(a)cadence.com J. Beister (Univ. of Keiserslautern, Germany) - beister(a)rhrk.uni-kl.de M. Bednarczyk (IPI PAN, Poland) - m.bednarczyk(a)ipipan.gda.pl M. Broy (Munich, Germany) - broy(a)informatik.tu-muenchen.de J. Billington (Univ. of South Australia, Australia) - j.billington(a)unisa.ed= u.au P. Caspi (VERIMAG, France) - paul.caspi(a)imag.fr J. Cortadella (UPC, Spain) - jordic(a)lsi.upc.es J. Desel (Katlische Univ. Eichstatt, Germany) - joerg.desel(a)ku-eichstaett.d= e H. Hsieh (Univ. of California - Riverside, USA) - harry(a)cs.ucr.edu R. Janicki (McMaster University, Canada) - janicki(a)mail.CAS.McMaster.CA M. Josephs (SBU, UK) - mark.josephs(a)sbu.ac.uk M. Kishinevsky (Intel, USA) - mkishine(a)ichips.intel.com B. Kleinjohann (C-Lab, Germany) - Bernd.Kleinjohann(a)c-lab.de A. Kondratyev (Cadence, USA) - kalex(a)cadence.com R. Kurshan (Cadence, USA) - rkurshan(a)cadence.com L. Lavagno (Politecnico di Torino, Italy) - lavagno(a)polito.it J. Lilius (TUCS and Ebo Akademi Univ., Finland) - Johan.Lilius(a)abo.fi R. Machado (Univ. do Minho, Portugal) - rmac(a)dsi.uminho.pt N. Maranghello (USP, Brazil) - norian(a)dcce.ibilce.unesp.br A. Moreira (Univ. Nova de Lisboa, Portugal) - amm(a)di.fct.unl.pt E. Pastor (Univ. de Catalunya, Spain) - enric(a)ac.upc.es G. Rozenberg (Leiden Univ, Netherlands) - rozenber(a)cs.leidenuniv.nl S. Tripakis (VERIMAG, France) - stavros.tripakis(a)verimag.fr A. Valmari (Tampere Univ. of Technology, Finland) - ava(a)cs.tut.fi A. Yakovlev (Univ. of Newcastle upon Tyne, UK) - alex.yakovlev(a)ncl.ac.uk W. Yi (Uppsala, Sweden) - yi(a)docs.uu.se T. Yoneda (Tokyo IT, Japan) - yoneda(a)cs.titech.ac.jp ORGANIZING COMMITTEE (Universidade do Minho, Portugal) R. Machado (chair) J. Fernandes (co-chair & finance) M. Santos (local arrangements) L. Santos (sponsors) R. Jose (web & internet services) I. Saraiva (publicity & media) A. Esteves (travel & tourism) INSTITUTIONAL LINKS IFIP Link: B. Kleinjohann, C-LAB, Germany FME Link: J. N. Oliveira, Universidade do Minho, Portugal OE/CEI Link: J. M. Tribolet, INESC/IST, Portugal

1 0

Invitation to SSGRR conferences in ITALY!
by ssgrr2003w＠rti7020.etf.bg.ac.yu 15 Sep '02

15 Sep '02

CALL FOR PAPERS AND PARTICIPATION AT SSGRR CONFERENCES IN YEAR 2003 The SSGRR (Scuola Superiore G Reiss Romoli) Congress Center, Telecom Italia Learning Services, L'Aquila (near Rome), ITALY (www.ssgrr.it) Respected Dr. We are honored to invite you to submit and present your paper(s) at the two SSGRR conferences specified below: INTERNATIONAL CONFERENCES ON ADVANCES IN INFRASTRUCTURE FOR ELECTRONIC BUSINESS, EDUCATION, SCIENCE, MEDICINE, AND MOBILE TECHNOLOGIES ON THE INTERNET WINTER Conference 2003: >>From Monday January 6 at 5pm till Sunday January 12 at 10am To submit paper or ask questions: ssgrr2003w(a)rti7020.etf.bg.ac.yu Keynotes: Lyman (Berkeley), Neuhold (Fraunhofer), Neal (Tufts Medical School), ... SUMMER Conference 2003: >>From Monday July 28 at 5pm till Sunday August 3 at 10am To submit paper or ask questions: ssgrr2003s(a)rti7020.etf.bg.ac.yu Keynotes: Kroto (Nobel Laureate), Patt (IEEE Eckert-Mauchly Laureate), Carlton (US Air Force Surgeon General), ... For details, see IEEE COMPUTER, Aug 2002 (page 33) and the WWW site www.ssgrr.it (written carefully+precisely, with answers to all FAQ). Check with past participants (their names/emails are on the WWW). Most of them believe this is the most interesting, rewarding, and definitely the most hospitable conference they ever attended! Fast professional and peer review in 15 days. Capacity of the SSGRR congress center is 200 participants. The list of participants will be closed after 200 papers accepted. Consequently, SUBMIT YOUR PAPER(S) AS EARLY AS POSSIBLE! ______________________________________________________________________ Location (see WWW for details): SSGRR is the DE-LUX congress and education center of the Telecom Italia Learning Services, located about 60 miles from Rome, near Gran Sasso (the highest Appenini peak), with fast access to the major Appenini ski resorts (in winters, 15 minutes by car), and Adriatic sea beaches (in summers, 45 minutes by car). Keynotes (see WWW for details): A Nobel Laureate was the keynote speaker each year in the past (Jerome Friedman of MIT, Robert Richardson of Cornell, etc...), and the major 2003 keynote is also reserved for a Nobel Laureate (Harry Kroto from United Kingdom). Other 2003 keynote speakers are Yale Patt from UofTexas@Austin (an IEEE Eckert-Mauchly Laureate), Paul Carlton (US Air Force Surgeon General), etc. Schedule (see WWW for details): Monday = Arrival day, registration, and cocktail Tuesday = Gran Sasso Nat'l Lab tour, tutorials, and opening ceremony Wednesday/Thursday/Friday = Presentation of research papers Saturday = Tutorials and peripathetic discussions Sunday = Departure day Deadlines (see WWW for details): For title and abstract (about 100 words): October 15, 2002 (for Winter 2003) April 30, 2003 (for Summer 2003) For papers (IEEE Transactions format, min 4 pages, max 1MB): November 15, 2002 (for Winter 2003) May 30, 2003 (for Summer 2003) For payment (stay, and fee if applicable): December 10, 2002 (for Winter 2003) June 30, 2003 (for Summer 2003) Payment (see WWW for details): No conference fee for those with papers to present (others: euro600). No fee for tutorials. All participants must stay inside SSGRR (no outside stays allowed). Full 6-day stay (from Monday evening till Sunday breakfast): euro1200. A 5-day stay (without one tutorial day): euro1000. Minimal 4-day stay (for research papers only): euro 800. Favourable conditions for accompanying persons (see the WWW). For late payment rules see the WWW. Important (see WWW for details): When submitting your paper, insert the 3-letter field code (exact codes on WWW), so the placement of papers per sessions is more efficient. Insert your WWW site URL (if you have one). If you submit a paper, you will get 2 other papers for a fast review (in up to 10 days). Your presentation time is 25 minutes, plus 5 minutes for discussions. Chairman of the session is the presenter of the last paper in that session. Moving of presentation slots is not permitted (in cases of non-show-up). If you like to be reinvited for a future SSGRR conference, let us know. If you like to be removed from the list, please let us know, too. WE HOPE TO SEE YOU AT SSGRR! Professor Veljko Milutinovic, General Chairman

1 0

CFP -- EACL'03, Budapest
by Claire Gardent 13 Sep '02

13 Sep '02

* CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** EACL 2003 11th Conference of the European Chapter of the Association for Computational Linguistics April 12-17, 2003 Budapest, Hungary EACL03 invites submissions as follows: Main conference papers Registration deadline: 10 November Submission deadline: 15 November Research notes and Demos Registration deadline: 01 December Submission deadline: 06 December Student workshop Deadline: 15 November Tutorials Deadline: 15 November Workshops Deadline: 01 October *** FURTHER INFORMATION **** EACL03: http://www.conferences.hu/EACL03/ EACL: http://www.eacl.org EACL03 Student Workshop http://www.coli.uni-sb.de/conf/eacl03-student/ *** ORGANISATION **** Programme Co-Chairs Ann Copestake (United Kingdom) Jan Hajic (Czech Republic) Research notes and Demos Chair Alberto Lavelli (Italy) Tutorial Chair Dan Cristea (Romania) Publication Chair Patrick Paroubek (France) Workshop Chair Steven Krauwer (The Netherlands) Student workshop Chair EACL Student Board (M. Gabsdil, J. Hockenmaier, J. Herring) Local Organisation Chair: Ferenc Kiefer (Hungary) * CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** 16-Sep-2002 17:03:11 -0300,785;000000000001-00000000

1 0

Coproduct of distributive lattices
by S.J.Vickers＠open.ac.uk 13 Sep '02

13 Sep '02

I have a concrete construction of the coproduct of distributive lattices and wondered if it was already known. Let A and B be distributive lattices. It is reasonably clear that their coproduct can be constructed as a tensor product with respect to their join-semilattice structure, using the notion of join-bilinear map. Even if this is not already known, it is an obvious application of the methods commonly used in the infinitary case for frames and suplattices. My concrete construction amounts to a description of when \/_i (a_i tensor b_i) <= \/_j (a'_j tensor b'_j) (*) I have shown that a necessary and sufficient condition for (*) is as follows. Let the j's range from 1 to n (we can assume wlog that the finite indexing set is a finite cardinal) and let D_n be the free distributive lattice on n generators. Let ~: D_n -> D_n be the operation that interchanges meets and joins (i.e. the lattice homomorphism from D_n to (D_n)^op that is the identity on generators). Then (*) holds iff for each i there is some phi_i in D_n such that a_i <= phi_i(a') b_i <= ~phi_i(b') (The appearance of ~ reflects the kind of topological argument about product spaces where unions in one component are balanced by intersections in the other.) Hence the coproduct of A and B is the set of formal expressions \/_i (a_i tensor b_i) (essentially, lists of elements of AxB) modulo the preorder <= as just defined. Steve Vickers Department of Pure Maths Faculty of Maths and Computing The Open University ----------- Tel: 01908-653144 Fax: 01908-652140 Web: http://mcs.open.ac.uk/sjv22 15-Sep-2002 15:19:44 -0300,2063;000000000000-00000000

1 1

FOSSACS'03 call-for-papers; deadline Friday October 18
by Andy Gordon 12 Sep '02

12 Sep '02

Dear Category Theorists, I warmly encourage you to submit to FOSSACS 2003. I attach the call-for-papers. Apologies if you receive duplicates. The deadline is October 18. Time to get writing! Andy. ============================================================================= Foundations of Software Science and Computation Structures FOSSACS 2003 http://www.research.microsoft.com/~adg/Fossacs03/ A member conference of the European Joint Conferences on Theory and Practice of Software ETAPS 2003, Warsaw, April 5-13, 2003 http://www.mimuw.edu.pl/etaps/ ============================================================================= FOSSACS seeks original papers on foundational research with a clear significance for software science. The conference invites submissions on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems. Topics covered include, but are not limited to: algebraic models; automata and language theory; behavioural equivalences; categorical models; computation processes over discrete and continuous data; computation structures; logics of programs; modal, spatial, and temporal logics; models of concurrent, reactive, distributed, and mobile systems; process algebras and calculi; semantics of programming languages; software specification and refinement; transition systems; type systems and type theory. Prior meetings were in Lisbon (1998), Amsterdam (1999), Berlin (2000), Genova (2001), and Grenoble (2002). INVITED SPEAKER Samson Abramsky (UK) PROGRAMME CHAIR Andrew Gordon (UK) PROGRAMME COMMITTEE Witold Charatonik (Germany and Poland) Adriana Compagnoni (USA) Vincent Danos (France) Roberto Gorrieri (Italy) Marta Kwiatkowska (UK) Eugenio Moggi (Italy) Uwe Nestmann (Switzerland) Mogens Nielsen (Denmark) Flemming Nielson (Denmark) François Pottier (France) Francesco Parisi Presicce (Italy) Dusko Pavlovic (USA) P.S. Thiagarajan (Singapore) Igor Walukiewicz (France) Pierre Wolper (Belgium) SUBMISSION INSTRUCTIONS Submitted papers must be in English and must describe work unpublished in refereed venues, and not submitted for publication elsewhere. Papers should be no more than 15 pages in the Springer LNCS style (see http://www.springer.de/comp/lncs/authors.html for details). Submission must be carried out electronically via the web; see http://www.research.microsoft.com/~adg/Fossacs03/ for details. Papers must be submitted as PostScript documents that are interpretable by Ghostscript, or in PDF format, and they must be printable on both USLetter and A4 paper. (If this requirement is a hardship, please contact the Programme Chair.) IMPORTANT DATES October 18, 2002 Submission deadline December 13, 2002 Notification of acceptance/rejection January 17, 2003 Camera-ready version due April 7-11, 2003 FOSSACS 2003, as part of ETAPS 2003 FOSSACS 2003 call-for-papers, September 2002. 16-Sep-2002 11:47:47 -0300,4089;000000000001-00000000

1 0

LICS 2003 - Call for Workshop Proposals
by Alex Simpson 12 Sep '02

12 Sep '02

Apologies for multiple copies. -------------------------------------------------------------------------- IEEE Symposium On Logic In Computer Science 2003 Ottawa, Ontario, Canada, 22-25 June 2003 CALL FOR WORKSHOP PROPOSALS The Eighteenth IEEE Symposium On Logic In Computer Science will be held in Ottawa, Ontario from 22nd to the 25th of June 2003. The organizers have made arrangements for pre- and post-LICS workshops to be run in conjunction with the main conference. Possible dates are 21st June and 26-27th June. Researchers and practitioners are invited tofsubmit proposals for workshops on topics relating logic - broadly construed - to computer science or related fields. Funding is available to help defray the costs of a *limited number* of workshops. Proposals should include: * A short scientific summary and justification of the proposed topic. This should include a discussion of the particular benefits of the topic to the LICS community. * A discussion of the proposed format and agenda. * The proposed duration, which may vary from half a day to two days, and preferred dates. * Procedures for selecting participants and papers. * Expected number of participants. * Potential invited speakers. * Plans for proceedings or other publications. Proposals are due Nov 1st 2002 and should be submitted electronically to: Prakash Panangaden Workshops Chair LICS'03 prakash(a)cs.mcgill.ca The selections will be chosen by a committee consisting of Samson Abramsky (LICS General Chair), Phokion Kolaitis (LICS'03 Program Committee Chair), Prakash Panangaden (LICS Workshop Chair) and Phil Scott and Amy Felty (LICS'03 Conference Co-chairs). The results will be announced by Nov 15th 2002. LICS Website: http://www.lfcs.informatics.ed.ac.uk/lics 16-Sep-2002 11:47:47 -0300,5797;000000000001-00000000

1 0

workshop on isomorphism of types (last call)
by Sergei SOLOVIEV 10 Sep '02

10 Sep '02

*** WIT 2002 *** First International Workshop on Isomorphisms of Types IRIT, Toulouse (France) 8-9 November 2002 Web page: http://www.irit.fr/zeno/WIT2002 *** LAST CALL FOR PARTICIPATION *** The study of isomorphic types is connected to type theory, number theory, category theory and lambda calculus, and it has various applications to information retrieval systems, automatic adaptor code generation, subtyping, and the like. This workshop aims to bring together researchers working on these subjects, to assess the current state of the art and identify open problems and future research directions. There will be space for talks presenting original work, work in progress, survey of previous works, but we will also provide sufficient time for discussions. Details on paper submission will be given in a further announcement. Papers presented at the workshop will be published on the web site of the workshop and may be selected for submission, in complete and revised form, to a special issue of an international journal, in case their number and quality justify it. The workshop is supported by STIC/CNRS (project ISOT) and IRIT/Université Paul Sabatier. Limited funds for travel and/or accomodation are available. Submission (extended deadline): send either a full paper or an extended abstract by e-mail to soloviev(a)irit.fr by September 30th 2002 Important dates: September 30th: deadline for abstract submission October 15th: notification of acceptance October 28th: final/full version due Organising/program committee: R. Di Cosmo (Paris-VII and INRIA Rocquencourt, France) G. Longo (ENS, Paris, France) S. Soloviev (IRIT, Toulouse, France) Local organisation: D. Chemouil L. Méhats Contact: Sergei Soloviev IRIT Université Paul Sabatier 118, route de Narbonne, 31062 Toulouse France E-mail: soloviev(a)irit.fr Tel: (+33) 5 61 55 62 55 Fax: (+33) 5 61 55 62 58 -- David Chemouil mailto:chemouil@irit.fr Zeno group http://www.irit.fr/~David.Chemouil Institut de recherche en informatique de Toulouse 13-Sep-2002 12:52:07 -0300,978;000000000000-00000000

1 0

postdoc at Utrecht
by I. Moerdijk 09 Sep '02

09 Sep '02

subject: postdoc at Utrecht body: Postdoc position available Dear category theorists, At Utrecht we have a postdoctoral research position availabe in the domain of categorical logic. The position is for three years and should start January 1, 2003, or soon thereafter. The position is funded by NWO, and is tied to a specific research project, which concerns (a combination of some of) the key words topos theory, realisability, categorical semantics of predicative theories, Martin-Loef type theories, Constructive Set Theory. Candidates should have a PhD degree and some research experience in at least one of these topics. If you are interested, please send an e-mail to one of us before October 31, together with a CV (or better, an address where we download one). Ieke Moerdijk (moerdijk(a)math.uu.nl) Jaap van Oosten (jvoosten(a)maath.uu.nl) 10-Sep-2002 21:31:07 -0300,3114;000000000000-00000000

1 0

Journee math. A. Burroni
by Rene Guitart 09 Sep '02

09 Sep '02

Journee Mathematique en l'honneur d'Albert Burroni : Categories, theories algebriques et informatique Vendredi 20 septembre 2002 Universite Paris VII, Salle 0C02, 175, rue du Chevaleret, 75013 09h10. Accueil. 09h30-10h15. Pierre Ageron, Albert Burroni dans l'ecole d'Ehresmann : constructivisme et structuralisme. 10h15-11h. Yves Lafont, Theorie algebrique des circuits. 11h20-12h05. Jacques Penon, T-categories representables. 12h05-12h50. Elisabeth Burroni, Lois distributives. Application aux automates stochastiques. 14h15-15h. Martin Hyland, Generalized algebra : variations on ideas of Burroni. 15h-15h45. Vincent Danos, Rigueur et brutalite en mathematique : la part du calcul. 16h05-16h50. Georges Maltsiniotis, Homotopie et categories. 16h50-17h35. Rene Guitart, Toute theorie est algebrique. 18h. Pot, avec en entree : Rene Cori, " Stupeur sacree ! la preuve se fait par les abimes." Equipes de Topologie et geometrie Algebrique (UMR 7586), et de Preuves Programmes Systemes (UMR 7126) Renseignements aupres de Rene Guitart (guitart(a)math.jussieu.fr)

1 0