August 1999 - Categories - categories.org.au

PhD and Postdoc Positions in Software Technology (Utrecht University)
by Erik Meijer 31 Aug '99

31 Aug '99

[Apologies if you receive multiple copies of this message] PhD and POST-DOC POSITIONS AVAILABLE Department of Computer Science Utrecht University The Netherlands http://www.cs.uu.nl The Software Technology research group at Utrecht University has several doctoral and post-doctoral positions available. The positions are funded by the department, Microsoft Research, and the Dutch Science Foundation (NWO). The main research interests of the group are tool support for the development of computer assisted teaching material, components and scripting, program generation and transformation, tree displaying and manipulation, generic programming, and provably correct systems. We seek candidates in any of the following topics: * Software architecture: component-based software, (D)COM, Corba, JINI, distributed systems. * Security: formalisation and verification of security properties, transaction processing. * Language design: advanced type systems, generic programming, intermediate languages. * Language implementation: interoperability, platform independent run-time systems, program transformation. * Scripting: domain specific languages, e-commerce. Applications will be evaluated from now on until the positions are filled. To apply (or for further details) please send email to Erik Meijer (mailto:erik@cs.uu.nl) Your email application should include a CV (ascii or postscript) and pointers to any on-line articles that you wish us to consider. Please can you also include names and email addresses of potential referees.

1 0

looking for references
by Gaunce Lewis 28 Aug '99

28 Aug '99

A colleague in geometric topology has encountered a categorical construction for which he would like some literature references. He has asked me to pass this request on to this mailing list. Roughly speaking, the construction takes a category carrying an action by a monoid and forms an associated "orbit" category. However, rather than identifying objects in the same orbit, it inserts a canonical isomorphism between them. Here are the details: Let M be a monoid which is also a poset. Assume that the multiplication on M preserves the order and that the unit u for the multiplication on M is an initial element for the poset. Think of M as a category with morphisms derived from the poset structure. Let C be any category and let F : M x C -> C be a functor which gives an action of M on C. For each m in M and each c in C, there is a map t(m,c) from c to F(m,c) obtained by applying F to the poset relation u \leq m and the identity map on c. Form the category of fractions of C in which all the maps t(m,c) have been inverted. Note that it looks somewhat like the orbit category C/M, but with the objects in the same orbit linked by canonical isomorphisms (derived from the t(m,c)) rather than identified. Has anyone seen this construction before? Is there literature on it? Thanks for any help on this, Gaunce Lewis

2 1

HTML at McGill Maths Dept
by R.A.G. Seely 25 Aug '99

25 Aug '99

Some of you may have experienced difficulties getting to web pages on triples lately. There have been security problems at McGill of late, and all "access" from the outside is being severely limited. For the time being (and perhaps permanently), all urls of the form http://triples.math.mcgill.ca/<whatever> can be accessed using the form http://www.math.mcgill.ca/triples/<whatever> In particular, the Category center page is now http://www.math.mcgill.ca/triples The "www.math.mcgill.ca/triples" format will probably become permanent, but we hope to have the older "triples.math.mcgill.ca" format operational again soon (so old bookmarks and links will function again). We shall see... - all the best, Robert PS: We are trying to find a method that will make the above translation automatically, without user intervention, and (here is the hard bit) without any actual access to an http server on triples. If you have any technical comments on how to do this (or if it is indeed impossible), let us know please. ================================= <rags(a)math.mcgill.ca> <http://www.math.mcgill.ca/~rags>

1 0

Reminder notice: Category meeting, Montreal October 16th
by Robert A.G. Seely 21 Aug '99

21 Aug '99

This is a copy of a notice sent out early in the summer - I gather some folks missed it then and so here is a duplicate. (Technically, this is still the "first" announcement, though ;-)) Centre de Recherche en Theorie des Categories -- Montreal -- Category Theory Research Center ----------------------------------------------------------------------------- Category Theory OctoberFest McGill University, Montreal Saturday - Sunday, October 16 - 17, 1999 ----------------------------------------------------------------------------- We invite you to join us in Montreal next October for a weekend meeting in Category Theory, the "not-quite-annual" OctoberFest. As has been the tradition with these meetings, we invite talks from all participants. If you wish to give a talk, send your request along with a short abstract (before the end of September please) to Robert Seely at the address below. Early in October the program committee will announce a preliminary schedule on the Categories email list, and on the CTRC/CRTC web site. (The URL for which is http://www.math.mcgill.ca/triples) The final schedule will be announced at the meeting. We will meet in the Bronfman Building, 1001 Sherbrooke West, on Saturday morning, October 16th. Coffee will be available from 8:30 am. The first talk will be at 9:00. Registration will take place during the morning, before the first talk and during the first coffee break. There will be a registration fee of about $CAN45 (approximately $US30), with luck, less: all possible attempts will be made to keep this as low as we can. There will be a student discount. The precise amount will be announced in early October, along with the proposed schedule. There will be a dinner/party to be held Saturday evening, hosted by Marta Bunge. (Instructions for getting to the Bunge home will be announced at the meeting.) Please let us know if you intend to join us by sending a short email (before the end of September if possible) to Robert Seely, also indicating whether or not you will bring a guest to the party. (We need to have a good estimate of how many people will attend the party about a week before the meeting.) Below you will find a list of hotels and tourist rooms close to McGill. Please note that October is a popular month for visiting Montreal, and early booking is recommended. If you have any further questions, please contact one of us. -------------------------------------------------------------------------------- Michael Barr [barr(a)barrs.org] Robert Seely [rags(a)math.mcgill.ca] Dept of Mathematics and Statistics McGill University 805 Sherbrooke West Montreal, Quebec CANADA H3A 2K6 -------------------------------------------------------------------------------- Hotels: (Montreal area code = 514) * L'Appartement, 455 Sherbrooke W, 284-3634, $85 * Howard Johnson Plaza, 475 Sherbrooke W, 842-3961, $94 (1-800-842-3961). (Mention McGill Maths Dept.) * Mariott Courtyard , 410 Sherbrooke W, 844-8851, $140 * Holiday Inn, 420 Sherbrooke W, 842-6111, $99 (Mention McGill Maths Dept.) * Hotel du Parc, 3625 Park Ave, 288-6666, $109 * Versailles*, 1659 Sherbrooke W, 933-3611, $91 (B&B) Tourist Rooms: (Prices vary depending on choice of single/double room, private/shared bathroom.) * Ambrose, 3422 Stanley, 288-6922, $50-80 (excellent) * Armor*, 157 Sherbrooke E, 285-0140, $55-109 * Bienvenue B&B** 3950 Laval, 844-5897, $65-95 (1-800-227-5897) * Casa Bella, 258 Sherbrooke W, 849-2777, $45-98 (Mention McGill Maths Dept for an additional discount, approx 10%) * Centre Ville B&B*, 3458 Laval, 289-9749, $55-65-85 * Pierre*, 169 Sherbrooke E, 288-8519, $60 *15 minute walk from McGill **30 minute walk from McGill

1 0

Research Positions in Computer Science
by KINOSHITA Yoshiki 17 Aug '99

17 Aug '99

There are two research positions in computer science available at ETL Semantics Group in Osaka, Japan. One position, for a postdoctoral fellow, starts in November 1999 and runs until the end of March 2001. We seek for an excellent researcher who works in the field of refinement, semantics of reactive programs, or program verification. Another short-term visiting position, which is not only for postdoctoroal fellows but open to any level, is also available for a visit for one or two months anytime during term time from October until the end of March 2000. ETL (Electrotechnical Laboratory) is one of Japan's governmental research institutes. The current positions are supported by a COE (Centre Of Excellence) project funded by STA (Science and Technology Agency) under the theme "Global Information Processing Technology." It is a big project with an annual budget of 350,000,000 yen (ca. 3,500,000 dollars,) but our small subgroup is working on semantics of refinement and program verification. For more info, see our home page "http://www.etl.go.jp/etl/etlclu/~sem/" or send an e-mail to Dr. Kinoshita. An applicant should send his/her CV to the address below by Friday 10 September 1999; sending a postscript or PDF file via e-mail would be preferred, but a paper copy would also do. The applicant may receive a request for one or two referee reports later on. Contact address: Dr. Yoshiki Kinoshita Semantics Group ETL Nakouji 3-11-46 Amagasaki-shi, Hyogo 661-0974 e-mail: yoshiki(a)etl.go.jp fax: +81-6-6491-5028 phone: +81-6-6494-7824

1 0

Remember: CSL'99
by csl99org＠eucmos.sim.ucm.es 16 Aug '99

16 Aug '99

------------------------------------------------------------- PROGRAMME AND CALL FOR PARTICIPATION CSL'99 Annual Conference of the European Association for Computer Science Logic (EACSL) Madrid, Spain, September 20-25, 1999 ------------------------------------------------------------- http://mozart.sip.ucm.es:1580/csl99/ _______________________________________________________ WARNING: * After July 15 accommodation is not guaranteed * The programme has been modified _______________________________________________________ The 1999 Annual Conference of the European Association for Computer Science Logic follows previous CSL Conferences: CSL'98 (Brno, Czech Republic), CSL'97 (Aarhus, Denmark), CSL'96 (Utrecht, The Netherlands), CSL'95 (Paderborn, Germany), CSL'94 (Kazimierz, Poland), CSL'93 (Swansea, United Kingdom), CSL'92(San Miniato, Italy), CSL'91 (Berne, Switzerland), CSL'90 (Heidelberg, Germany), CSL'89 (Kaiserslautern, Germany), CSL'88 (Duisburg, Germany), and CSL'87 (Karlsruhe, Germany). CSL'99 will be held in Madrid (Spain). The event is organized jointly by the Computer Science Departments (DSIP and DACYA) of Universidad Complutense de Madrid (UCM). The scientific program includes 34 selected papers from among 91 submissions, five invited lectures, and two tutorials on theorem proving and rewriting techniques, scheduled on September 24 afternoon (Friday) and September 25 morning (Saturday), immediately after the main conference. In addition to the scientific program, the social program includes an excursion to Segovia (a nearby historic city), and a conference dinner. Madrid offers the opportunity to enjoy both Spain and one of the most attractive capitals in Europe. In this document you can find the Invited Lecturers, Tutorials, Scientific Programme, General Information, Registration and Accommodation Information. The CSL'99 Web page http://mozart.sip.ucm.es:1580/csl99/ contains additional information. -*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*- INVITED LECTURERS: Jose Luis Balcazar - Universidad Politecnica Cataluna The consistency dimension, compactness, and query learning Javier Esparza - Technische Universitat Munchen Broadcast protocols - a case study in automatic verification of infinite state systems Martin Grohe - Albert-Ludwig-Universitat Freiburg Descriptive and Parametrized Complexity Peter D. Mosses - University of Aarhus Logical specification of operational semantics Victor Vianu - University California San Diego Topological Queries in Spatial Databases TUTORIALS: Douglas J. Howe - Bell Labs Interactive Theorem Proving using Type Theory Aart Middeldorp - University of Tsukuba Term Rewriting PRELIMINARY SCIENTIFIC PROGRAMME: Monday 20th, September 9:00 Registration 9:45 Conference Opening 10:00 Invited Talk: V. Vianu Topological Queries in Spatial Databases 11:00 Coffee Break Session 1: Descriptive Complexity 11:20 E. Gradel and S. Kreutzer Descriptive Complexity Theory for Constraint Databases 11:50 D. Leivant Applicative control and computational complexity 12:30 Lunch Session 2: Verification 14:00 T. Arts and J. Giesl Applying Rewriting Techniques to the Verification of Erlang Processes 14:30 J. Moller, J. Lichtenberg, H.R. Andersen and H. Hulgaard Difference Decision Diagrams 15:00 M. Fraenzle Analysis of Hybrid Systems: An ounce of realism can save an infinity of states 15:30 Y. Kesten and A. Pnueli Verifying Liveness by Augmented Abstraction 16:00 Coffee break 16:30 EACSL Assembly Tuesday 21st, September 9:00 Invited Talk: J.L. Balcazar The consistency dimension, compactness, and query learning Session 3: Temporal Logic 10:30 T.M. Rasmussen Signed Interval Logic 11:00 Coffe break 11:20 Y. Hirshfeld and A. Rabinovich Quantitative Temporal Logic 11:50 V. Diekert and P. Gastin An expressively complete temporal logic without past tense operators for Mazurkiewicz traces 12:30 Lunch Session 4: Lambda Calculus, Linear Logic 14:00 E. Bonelli Using fields and explicit substitutions to implement objects and functions in a de Bruijn setting 14:30 M. Fernandez and I. Mackie Closed Reductions in the lambda-calculus 15:00 S. Ishtiaq and D.J. Pym Kripke resource models of a dependently-typed, bunched lambda-calculus 15:30 R. Di Cosmo and V. Balat A linear logic view of linear type isomorphisms 16:00 Coffee break Session 5: Logic Programming, Modal Logic, Description Logic 16:30 M. De Vos and D. Vermeir Choice Logic Programs and Nash Equilibria in Strategic games 17:00 S. Hagihara and N. Yonezaki Resolution Method for Modal Logic with Well-founded Frames 17:30 S. Tobies A NExpTime-complete Description Logic Strictly Contained in C^2 18:00 C. Areces, P. Blackburn and M. Marx A Road-map on Complexity for Hybrid Logics Wednesday 22th, September 9:30 Invited talk: M. Grohe Descriptive and Parametrized Complexity Session 6: Descriptive Complexity 10:30 C. Lautemann and B. Weinzinger Monadic NLIN and quantifier-free reductions 11:00 Coffe break 11:20 J. Marcinkowski Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraise games 11:50 J.C. Bradfield Fixpoint Alternation and the Game Quantifier 12:30 Lunch 13:30 Excursion to Segovia Thursday 23rd, September 9:30 Invited talk: P. Mosses Logical specification of operational semantics Session 7: Logic and Complexity 10:30 J. Toran Lower Bounds for Space in Resolution 11:00 Coffe break 11:20 I.A. Stewart Program Schemes, Arrays, Lindstrom Quantifiers and Zero-one Laws 11:50 L.D. Beklemishev Open least element principle and bounded query computation 12:30 Lunch Session 8: Lambda Calculus, Type Theory 14:00 A.D. Ker, H. Nickau and C.H.L. Ong A Universal Innocent Game Model for the Bohm Tree Lambda Theory 14:30 A. Compagnoni and H. Goguen Anti-Symmetry of Higher-Order Subtyping 15:00 H. Geuvers, E. Poll and J. Zwanenburg Safe Proof Checking in Type Theory with Y 15:30 T. Altenkirch and B. Reus Monadic presentations of lambda terms using generalized inductive types 16:00 Coffee break Session 9: Linear Logic, Mu Calculus, Concurrency 16:30 L. Roversi A P-Time Completeness Proof for Light Logics 17:00 H. Seidl and A. Neumann On Guarding Nested Fixpoints 17:30 A. Kucera and J. Esparza A Logical Viewpoint on Process-Algebraic Quotients 18:00 P. Gastin and M. Mislove A Truly Concurrent Semantics for a Simple Parallel Programming Language Friday 24th, September 9:30 Invited talk: J. Esparza Broadcast protocols -- a case study in automatic verification of infinite state systems Session 10: Specification, Data Refinement 10:30 J.E. Hannay Specification Refinement with System F 11:00 Coffe break 11:20 F. Honsell and D. Sannella Pre-logical Relations 11:50 Y. Kinoshita and J. Power Data-refinement for Call-By-Value Programming Languages 12:20 Conference Closure 12:30 Lunch 14:30 A. Middeldorp Tutorial on Term Rewriting, 1st part 16:00 Coffee break 16:30 Tutorial on Term Rewriting, 2nd part Saturday 25th, September 9:30 D. Howe Tutorial on Interactive Theorem Proving using Type Theory, 1st part 11:00 Coffee break Tutorial on Interactive Theorem Proving using Type Theory, 2nd part -*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*- * PROGRAMME COMMITTEE Samson Abramsky (Edinburgh, UK) Marc Bezem (Utrecht, The Netherlands) Peter Clote (Munich, Germany) Hubert Comon (Cachan, France) Jorg Flum (Freiburg i.Br., Germany) (co-chair) Harald Ganzinger (Saarbrucken, Germany) Neil Immerman (Amherst, USA) Neil Jones (Copenhagen, Denmark) Jan Maluszynski (Linkoping, Sweden) Michael Maher (Brisbane, Australia) Catuscia Palamidessi (Pennsylvania, USA) Mario Rodriguez-Artalejo (Madrid, Spain) (co-chair) Wolfgang Thomas (Aachen, Germany) Jerzy Tiuryn (Warsaw, Poland) Martin Wirsing (Munich, Germany) * EACSL BOARD Marc Bezem (Utrecht, President) Ian Stewart (Leicester, Vice-President) Clemens Lautemann (Mainz, Treasurer) Peter Hajek (Prague) Simone Martini (Udine) Christine Paulin (Paris) Moshe Vardi (Houston) Johann Makowsky (Haifa) Alexander Razborov (Moscow) * LOCAL ORGANIZING COMMITTEE J. Carlos Gonzalez-Moreno Teresa Hortala-Gonzalez Javier Leach-Albert (chair) Paco Lopez-Fraguas Fernando Saenz-Perez Eva Ullan-Hernandez * SPONSORED BY Comision Interministerial de Ciencia y Tecnologia (CICYT) European Research Consortium for Informatics and Mathematics (ERCIM) Esprit Working Group EP 22457 (CCL II) UCM Department 'Arquitectura de Computadores y Automatica' (DACYA) UCM Department 'Sistemas Informaticos y Programacion' (DSIP) UCM Faculty of Mathematics UCM Technical Highschool of Informatics UCM Vicerrectorado de Investigacion UCM Vicerrectorado de Relaciones Internacionales * Organized by SIP-UCM and DACYA-UCM -*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*- GENERAL INFORMATION Place and travel The Conference will be held in Madrid (Spain), at the Faculty of Mathematics of Universidad Complutense de Madrid (UCM), >from the 20th to the 25th of September, 1999. Madrid has direct flights from most major cities and generally good connections from elsewhere. Barajas, the international Madrid airport, is only about 10 km from the city. There are frequent regular buses and taxis to the city, as well as the new metropolitan line. The Faculty of Mathematics can be reached by metro (metropolitan station Ciudad Universitaria or Metropolitano) or by bus (bus lines 132, F, or 82). The CSL'99 Web page (http://mozart.sip.ucm.es:1580/csl99/) contains additional information such as the metropolitan network map, and the surroundings to CSL host site map. Social Events A guided excursion to Segovia will be held on Wednesday, 22th. The departure will be after lunch, at 14:00. Registered participants have this excursion included, and accompanying persons can buy an excursion ticket (60 euros) during the Registration and Opening Session to CSL'99. The excursion includes dinner. Languages English is the Conference official language. -*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*- REGISTRATION INFO CSL'99 Registration to the Conference and/or Tutorial must be made sending the Conference Registration Form and/or the Tutorial Registration Form and a copy of your corresponding bank transfer (via fax) directly to: CSL'99 attention of ms. Eva Ullan fax +34/91/394 46 02 Electronic mail registration will not be accepted The conference registration fee includes: - admission to the conference - morning and afternoon coffee breaks during the conference - lunches during the conference - excursion and social event - a copy of the proceedings volume - one year subscription to EACSL The tutorial registration fee includes: - admission to the tutorials - afternoon and morning coffee breaks during the tutorials - working material EARLY CONFERENCE REGISTRATION FEE: 270 EUROS. Before July 15, 1999 LATE CONFERENCE REGISTRATION FEE: 300 EUROS. For late registration, send the registration form together with a copy of your bank remittance TUTORIAL REGISTRATION FEE: 60 EUROS Before July 15, 1999 LATE TUTORIAL REGISTRATION FEE: 80 EUROS. For late tutorial registration, send the tutorial registration form with a copy of your bank remittance Payments should be made in EURO currency by bank transfer WITHOUT CHARGES FOR THE BENEFICIARY payable to: CAJA DE MADRID Donoso Cortes 80 28015 MADRID FUNDACION GENERAL UCM (CSL'99) Account: 2038/1735/09/2000001375 Do not forget the specification CSL'99 !!! -*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*- ACCOMMODATION INFO CSL'99 A) For those who would like a simple accommodation lodging in a student room, we have made arrangements with "Colegio Mayor Loyola", Paseo Juan XXIII 17, 28040 MADRID, SPAIN, Fax +34/91/535 22 05 In "Colegio Mayor Loyola" the price for single rooms, full board, is 4,600 pts + 7% VAT per day (27.646 EUROS + 7% VAT) If you want a "Colegio Mayor Loyola" accommodation you have to fill in the accommodation form and return in printed form via fax to "Colegio Mayor Loyola". After July 15, the accommodation is not guaranteed. B) For those who would like a three/four star hotel accommodation, we have made arrangements with "Grandes Rutas Travel", fax +34/91/543 35 50 Hotel "Tirol" (***) Room for 1 person, breakfast included, 8,800 pts + 7% VAT Room for 2 persons, breakfast for 2 persons included, 11,500 pts + 7% VAT Hotel "Conde Duque" (****) Room for 1 person, breakfast included, 11,600 pts + 7% VAT Room for 2 persons, breakfast for 2 persons included, 14,800 pts + 7% VAT If you want a hotel accommodation you have to fill in the hotel accommodation form and return in printed form via fax to "Grandes Rutas Travel". After July 15, the accommodation is not guaranteed. If you have any problem in relation with your hotel accommodation please get in contact via telephone with Mauro Martin or Ana Garcia (+34/91/543 33 62). <><><><><><><><><><><><> Cut here <><><><><><><><><><><><> CONFERENCE REGISTRATION FORM Please type out and return via fax with a copy of your bank remittance to CSL'99 attention of ms. Eva Ullan FAX +34/91/394 46 02 Surname ____________________________________________________ First Name(s) ______________________________________________ Mr/Ms + Title ______________________________________________ Affiliation ________________________________________________ Home or Work Address: Street _____________________________________________________ Code, City _________________________________________________ Country ____________________________________________________ e-mail _____________________________________________________ Hereby please receive a copy of my bank transfer. Signature: <><><><><><><><><><><><> Cut here <><><><><><><><><><><><> TUTORIAL REGISTRATION FORM Please type out and return via fax with a copy of your bank remittance to CSL'99 attention of ms. Eva Ullan FAX +34/91/394 46 02 Surname ____________________________________________________ First Name(s) ______________________________________________ Mr/Ms + Title ______________________________________________ Affiliation ________________________________________________ Home or Work Address: Street _____________________________________________________ Code, City _________________________________________________ Country ____________________________________________________ e-mail _____________________________________________________ Hereby please receive a copy of my bank transfer. Signature: <><><><><><><><><><><><> Cut here <><><><><><><><><><><><> ACCOMMODATION FORM FOR "COLEGIO MAYOR LOYOLA" Please fill in and return via fax to CSL'99 "Colegio Mayor Loyola" attention of ms. Aurora fax +34/91/535 22 05 Surname(s) ____________________________________________________ First Name(s) ______________________________________________ Mr/Ms + Title ______________________________________________ Affiliation ________________________________________________ Arrival day ________________________________________________ Departure day ______________________________________________ Home or Work Address: Street _____________________________________________________ Code, City _________________________________________________ Country ____________________________________________________ Signature: <><><><><><><><><><><><> Cut here <><><><><><><><><><><><> ACCOMMODATION FORM FOR "GRANDES RUTAS TRAVEL" Please fill in and return via fax to CSL'99 "Grandes Rutas Travel" attention of mr. Mauro Martin or Ana Garcia fax +34/91/543 35 50 Hotel _____________________________________________________ Surname(s) __________________________________________________ First Name(s) ______________________________________________ Mr/Ms + Title ______________________________________________ [ ] Single room [ ] Double room Arrival day ________________________________________________ Departure day ______________________________________________ Home or Work Address: Street _____________________________________________________ Code, City _________________________________________________ Country ____________________________________________________ Signature:

1 0

Generalized Subfunctors
by Robert W. McGrail 15 Aug '99

15 Aug '99

Dear Categorists, I wish to label the following notion of (for lack of a better term) "generalized subfunctor" of a functor H: J ---> C in a manner that is consistent with the categorical community. What I call a "generalized subfunctor" of F is a category D, a pair of functors F: C --->D and G: J ---> D, and a monic natural transformation m: G ---> FoH. My motivation is to formulate the notion of "generically creating a generalized subfunctor" to such a functor H. Is there some standard alternative to the overloaded term "generalized"? By the way, I am somewhat interested in the case where H sends certain J-spans to product diagrams in C, so sketch-theoretic ideas are certainly welcome. -- Best Regards, Bob McGrail **************************************************** By virtue knowledge **************************************************** Bard College Division of Natural Science and Mathematics P.O. Box 5000 Annandale-on-Hudson, NY 12504 (914)758-7265 mcgrail(a)bard.edu http://inside.bard.edu/~mcgrail

1 0

CADE-17 Preliminary Call For Papers
by David McAllester 13 Aug '99

13 Aug '99

The 17th International Conference on Automated Deduction June 17-20, 2000, Pittsburgh, Pennsylvania, USA PRELIMINARY CALL FOR PAPERS (further details at http://www.research.att.com/conf/cade) For the last 25 years CADE has been the major forum for the presentation of research in automated deduction. Original research papers in all aspects of automated theorem proving, automated reasoning, computer aided verification, formal methods and static analysis are solicited for CADE-17. PROGRAM CHAIR: David McAllester, AT&T Labs-Research CONFERENCE CHAIR: Frank Pfenning, Carnegie Mellon University PROGRAM COMMITTEE: Hubert Comon, David Dill, Ulrich Furbach, Harald Ganzinger, Mike Gordon, Didier Galmiche, Tom Henzinger, Deepak Kapur, Ursula Martin, Ken McMillan, Paliath Narendran, David Plaisted, Robert Nieuwenhuis, Tobias Nipkow, Hans de Nivelle, Larry Paulson, Amir Pnueli, Mark Stickel, Moshe Y. Vardi, Andrei Voronkov. SUBMISSIONS DEADLINE: January 15, 2000 NOTIFICATION OF ACCEPTANCE: March 1 CAMERA-READY COPY: March 21 SUBMISSIONS: Papers must be original and not submitted for publication elsewhere. Research papers can be up to 15 proceedings pages, and system descriptions can be up to 5 pages. System description submissions must include a URL for a web page from which the system can either be run or obtained by reviewers. The proceedings of CADE-17 will be published by Springer-Verlag in the LNAI series. Electronic submission of postscript generated from LaTeX2e and the Springer llncs class files is strongly encouraged (details and alternatives at the web site above).

1 0

TCS2000, call for papers
by HAGIYA Masami 12 Aug '99

12 Aug '99

(Aplogies if you receive multiple copies) call for papers IFIP International Conference on Theoretical Computer Science IFIP TCS2000 --- Exploring New Frontiers of Theoretical Informatics --- August 17 - 19, 2000 Tohoku University, Sendai, Japan IFIP TCS2000 is the first International Conference on Theoretical Computer Science organized by the IFIP TC1 on Foundations of Computer Science. Major topics of the conference are follows: Track (1): Algorithms, Complexity and Models of Computation analysis and design of algorithms --- algorithm experimentation --- continuous algorithms and complexity --- computational complexity --- descriptional complexity --- cellular automata and machines, automata and formal languages --- hardware algorithms and parallel algorithms --- computational learning theory --- algorithmic aspects in discovery science --- cryptography --- combinatorics --- probabilistic and randomized algorithms --- molecular computing and algorithmic aspects of bioinformatics --- quantum computing --- neural network computing --- evolutionary and genetic algorithms --- computational geometry --- computational and mathematical finance --- bridging complexity and semantics. Track (2): Logic, Semantics, Specification and Verification logic and semantics for programs and languages --- foundations of system specification --- term rewriting systems --- proofs and specifications in computer science --- types and category theory in computer science --- theoretical aspects of specification and verification of hardware and software --- theoretical aspects of software concepts --- concurrency theory --- theory of parallel and distributed systems --- theory of internet languages and systems --- constructive and non-standard logics in computer science --- foundations of security --- theoretical foundations of data bases --- logic, specification and verification of hybrid and real-time systems --- theoretical foundations of open systems --- bridging semantics and complexity. Submissions on the above topics and related topics are invited. Submitted papers should preferably be typeset in LaTeX2e using the Springer document class llncs for the LNCS format, see http://www.springer.de/comp/lncs/authors.html (the command \pagestyle{plain} turns on page numbering), and no longer than 14 pages. They should be sent in Postscript by email to one of the following addresses by January 28 (Friday), 2000: for Track (1), tcs2000-track1(a)is.s.u-tokyo.ac.jp; for Track (2), tcs2000-track2(a)is.s.u-tokyo.ac.jp. A submission should include the track name for the submission, the title of the paper, names and affiliations of authors, an abstract up to 300 words, and the contact author's name, address, phone number, fax number, and email address. The submission must be in English, and it should provide a summary of the main results and their details to allow the program committee to assess their merits and significance, including references and comparisons. The result of the paper must be unpublished and not submitted for publication elsewhere, including journals and the proceedings of other symposia or workshops. One author of each accepted paper should be able to present it at the conference. Important Dates: January 28, 2000: Deadline for submission of papers April 7, 2000: Notification of acceptance May 5, 2000: Final camera-ready text due See http://hagi.is.s.u-tokyo.ac.jp/tcs2000/ for further information about the submission procedure. The program will consist of: Plenary Invited Talks Mart\'in Abadi (Bell Labs, Lucent Technologies) Masami Hagiya (U. Tokyo) Track (1) Invited Talks Ernst Mayr (TU Muenchen) Mihalis Yannakakis (AT\&T Research) Track (2) Invited Talks Thomas Henzinger (UC Berkeley & MPI-Saarbrucken) Naoki Kobayashi (U. Tokyo) Gordon Plotkin (U. Edinburgh) Banquet Speech Michael O. Rabin (Harvard U.) (and some further invited talks, to be announced) as well as the selected contributed talks and a panel discussion. The Proceedings, published as a volume of Lecture Notes in Computer Science, Springer-Verlag, will be available at the conference. See http://tcs2000.ito.ecei.tohoku.ac.jp/tcs2000/ for general information about the IFIP TCS2000 Conference. Program Committee Co-Chairs Track (1): Algorithms, Complexity and Models of Computation Jan van Leeuwen (U. Utrecht) Osamu Watanabe (Tokyo Inst. of Technology) Track (2): Logic, Semantics, Specification, and Verification Masami Hagiya (U. Tokyo) Peter D. Mosses (U. Aarhus) Program Committee Track (1): Ricardo Baeza-Yates (U. Chilie), Fellipe Cucker (City U. Hong Kong), Alan Gibbons (U. Liverpool), Ernst Mayr (TU Muenchen), Hiroshi Nagamochi (Kyoto U.), Kouichi Sakurai (Kyushu U.), Paul Vitanyi (CWI, Amsterdam), Jiri Wiedermann (Academy of Sciences, Prague), Takashi Yokomori (Waseda U.) Track (2): Egidio Astesiano (U. Genova), Luca Cardelli (Microsoft, Cambridge), Robert Constable (Cornell U.), Javier Esparza (TU Muenchen), Naoki Kobayashi (U. Tokyo), Jos\'e Meseguer (SRI, Menlo Park), Benjamin Pierce (U. Pennsylvania), Davide Sangiorgi (INRIA, Sophia Antipolis), John Staples (U. Queensland), P. S. Thiagarajan (Chennai Math. Inst., India) Conference Co-Chairs Giorgio Ausiello (IFIP TC1 Chair and U. Roma "La Sapienza") Takayasu Ito (Tohoku U.) Steering Committee Giorgio Ausiello (U. Roma) <chair>, Wilfried Brauer (TU Muenchen), Takayasu Ito (Tohoku U.), Michael O. Rabin (Harvard U.), John Staples (U. Queensland), Joseph Traub (Columbia U.) Organizing Committee Co-Chairs Setsuo Arikawa (Kyushu U.), Yasuyoshi Inagaki (Nagoya U.), Takayasu Ito (Tohoku U.) The IFIP TCS2000 conference is organized by the IFIP TC1 on Foundations of Computer Science in cooperation with Information Processing Society of Japan, Japan Society of Software Science and Technology*, Institute of Electronics, Information and Communication Engineers in Japan*, European Association of Theoretical Computer Science, Association of Symbolic Logic*, and Association for Computing Machinery-SIGACT. (* indicates "to be verified".) E-mail address for any inquiry: TCS2000(a)ito.ecei.tohoku.ac.jp [Last edited on August 11, 1999 by S. Miyakawa]

1 0

Re: WAIT99 (CFP - Preliminar)
by wait99 11 Aug '99

11 Aug '99

----------------------- CALL FOR PARTICIPATION ---------------------- 28 JAIIO - WAIT'99 Argentinian Workshop on Theoretical Computer Science Buenos Aires - Argentina September 6-7, 1999 The 3rd Argentinean Workshop on Theoretical Computer Science (WAIT'99) will be part on the 28th Argentinean Conference on Informatics and Operations Research (28 JAIIO), to be held in Buenos Aires from September 6th to September 10th, 1999. The goal of the workshop is bringing together researchers from academy (from Argentinean and other uNiversities) and industry professionals in order to discuss theoretical, empirical and experimental results on the field of theoretical computer science. This workshop will consist of two invited talks and seventeen technical presentations in the following areas of theoretical computer science: * Logical and algebraic foundations for computer science * Formal program construction * Algorithms and data structures * Computational complexity * Automata theory * Graph theory WORKSHOP CO-CHAIRS: Prof. Gabriel Baum LIFIA Dto. de Informatica Universidad Nacional de La Plata Calle 50 y 115 1er piso. (1900) La Plata - Argentina Tel/Fax : +54-21-22-8252 e-mail: gbaum(a)sol.info.unlp.edu.ar Prof. Marcelo Frias Dpto. De Computacion -FCEyN- Universidad de Buenos Aires Pabellon I - Ciudad Universitaria 1428- Buenos Aires - ARGENTINA Tel/Fax : +54-1-783-0729 e-mail: mfrias(a)sol.info.unlp.edu.ar PROGRAM COMMITTEE: Gabriel Baum (Universidad Nacional de La Plata, Argentina) Javier Blanco (Universidad Nacional de Cordoba, Argentina) Luis FariÃ±as del Cerro (Universite Paul Sabatier, France) Esteban Feuerstein (Universidad Nacional de Buenos Aires, Argentina) Marcelo Frias (Universidad Nacional de Buenos Aires, Argentina) Armando Haeberer (Pontificia Universidade Catolica de Rio de Janeiro, Brazil) Hermann Haeusler (Pontificia Universidade Catolica de Rio de Janeiro, Brazil) Joos Heintz (Universidad Nacional de Buenos Aires, Argentina) Roger Maddux (Iowa State University, USA) Tom Maibaum (Imperial College, UK) Bernhard Moeller (Universitaet Augsburg, Germany) Gonzalo Navarro (Universidad de Chile, Chile) Alfredo Olivero (Universidad Nacional de Buenos Aires, Argentina) Ruy de Queiroz (Universidade Federal de Pernambuco, Brazil) Alvaro Tasistro (Universidad de la Republica, Uruguay) Sergio Yovine (CNRS-VERIMAG, France) For more information send e-mail to: wait99(a)sadio.edu.ar, or write to: SADIO / WAIT'99 Uruguay 252 2D 1015 - Buenos Aires ARGENTINA TEL: +54-1-3715755/4763950 FAX: +54-1-3723950 PROGRAM ------- -------------------------------------------------------- -------------------------------------------------------- WAIT'99 Program, September 6th, 1999 Opening ...... 9:00 Gabriel Baum and Marcelo Frias Session 1 Chair: Tom Maibaum A Canonical Extension of Curry-Howard Isomorphism to Classical Logic ................................. 9:15 Andou Yuuki Update, the infinite case ........................9:50 Carlos Areces and Ver\'onica Becher Recovering from Inconsistency: A general Framework for Theory Recovery ..................................10:25 Cees Witteveen and Wiebe van der Hoek Coffee break......................................11:00 Goal Oriented Information Extraction in Uniformly Constructive Calculi .............................11:15 Mauro Ferrari, Camillo Fiorentini and Pierangelo Miglioli Comparing Refinements for Failure and Bisimulation Semantics ........................................11:50 Rik Eshuis and Maarten Fokkinga Lunch break.......................................12:25 Session 2 Chair: Bernhard Moeller Utlizando RELVIEW para la verificaci\'on de especificaciones en l\'ogica modal................14:00 Ricardo Medel A Logical Interpretation of Abstract Fork Specifications....................................14:35 Nazareno Aguirre Abstract Accumulation Data Types .................15:10 Javier Blanco and H\'ector Gramaglia Coffee break......................................15:45 Algebraic System Calculation .....................16:00 Bernhard Moeller ------------------------------------------------------ WAIT'99 Program, September 7th, 1999 Session 3 Chair: Javier Blanco Verificaci\'on de Programas Funcionales, Imperativos y Concurrentes .....................................9:15 Javier Blanco, Pablo Mocciola and Demetrio Vilela A Class of Programs for Update and Retrieve Operations over an Array ....................................9:50 Adriana Toni Coffee break.....................................10:25 Incorporando Traducci\'on a las Expresiones Regulares .......................................10:40 Jorge Aguirre, Gabriela Maidana and Marcelo Arroyo Incremental Deterministic Pattern-matching Automata ........................................11:15 Nadia Nedjah and Luiza de Macedo Mourelle Petri Net Extensions Based on Timed Graphs ......11:50 Gustavo Ariel Gonzalez, Gabriel Davis Vaisman and Daniel Riesco Lunch break......................................12:25 Session 4 Chair: Esteban Feuerstein On the Complexity of the Max Balance Problem....14:00 Paola Alimonti and Tiziana Calamoneri Los Grafos K--Geod\'esicos y su Aplicaci\'on al Dise\~no Topol\'ogico de las Redes ......................14:35 Carlos Enrique Frasser S\'anchez Parallel Generation of Large Subgraphs in Cubic Graphs .........................................15:10 Tiziana Calamoneri, I.Finocchi, Y.Manoussakis and R.Petreschi Coffee break....................................15:45 The MENSURAE Language: Specifying Business Processes! .....................................16:00 T.S.E. Maibaum ------------------------------------------------------- ------------------------------------------------------ ---------- REGISTRATION FORM 28 JAIIO 28 Argentine Conference on Informatics and Operations Research Last Name: First Name: Affiliation: Position: Address: City: Zip Code: Country: Telefhone Number: Fax: E-mail: Ammount to pay: ( ) Cash: ( ) Credit Card: ( )VISA ( )ARGENCARD\MASTERCARD Number: Expiration Date: Cardholder Signature: Date: Categorie: ( )Member ( )Student or Professor Member ( )Not Member ( )Student or Professor Not Member I want to register at: ( )ASAI - Symposium on Artificial Intelligence ( )ASOO - Symposium on Object Orientation ( )REDES - Symposium in Networks and Distributed Arch. and Systems ( )SIO - Symposium on Operations Research ( )SIS - Symposium on Informatics and Health ( )SOST - Syimposum on Software Technology ( )SyM - Symposium on Simulation and Modelling ( )WAIT - Argentinian Workshop on Theoretical Computer Science ( )WER - Workshop on Ingeneering Requeriments IFIP Tutorials: ( ) Network Control, Game Theory, and Learning Automata, Lorne Mason ( ) Performance Modelling of Computer Systems and Compueter Networks to ATM networks, Ramon Puigjaner ( ) From IP over ATM to MPLS (MultiProtocol Label Switching), Andre Danthine. REGISTRATION FEES (in US Dollars): Before 8/7 Before 30/8 Since 30/8 - 1 Symposium or 1 Tutorial Not Member 100 110 120 Member, Student or Prof. Not Member 60 67 75 Student or Professor Member 30 35 40 - 2 Symposium or 2 Tutorials Not Member 160 180 200 Member, Student or Prof. Not Member 100 110 120 Student or Professor Member 50 57 65 - 3 Tutorials + JAIIO Not Member 240 270 300 Member, Student or Prof. Not Member 120 140 160 Student or Professor Member 70 80 90 Student and Professor fees do not include proceedings. ( ) U$S 10 each one More information and registration at: SADIO Uruguay 252 2 "D" 1015 - Buenos Aires Tel: 54 11 4371-5755 Fax: 54 11 4372-3950 e-mail: jaiio(a)sadio.edu.ar http://www.sadio.org.ar/28jaiio ___________________________________________ Gabriel Baum LIFIA Facultad de Ciencias Exactas Universidad Nacional de La Plata Calle 50 y 115 - 1er piso (1900) La Plata e-mail: gbaum(a)sol.info.unlp.edu.ar Tel/Fax: +54 21 228252 ___________________________________________

1 0