June 2001 - Categories - categories.org.au

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

16 Mar '02

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

2 1

Chu spaces vs Topoi (and maybe Stone Spaces)
by Galchin Vasili 02 Jul '01

02 Jul '01

Hello Cat Community, I have been reading some of Prof. Pratt's papers on Chu spaces. I am just trying to understand Topos. Both seem to generalize the notion of topological spaces. Is there any relationship beteween Chu spaces and Topoi? Regards, Bill Halchin

3 2

Sad news
by jim stasheff 30 Jun '01

30 Jun '01

I regret to inform you that Bob Gordon died last weekend. He had been diagonosed with cancer, a tumor on the aortic arch which pressed on the lungs and trachea. He was in an excellent cancer hospital near Philadelphia. The chemo and radiation had been producing some improvement. Up to last Saturday he was stable though very weak. Saturday morning his blood pressure went up and his heart weakened. Intensive care was able to stabilize him then suddenly his heart quit. There is a memorial service Sunday July 1 at the Gordon home. If you would like me to convey sympathy or relevant anecdotes to his wife and daughters, just let me know. jim stasheff

2 1

TACS2001 PRELIMINARY PROGRAM AND REGISTRATION INFORMATION
by Shinya MIYAKAWA 29 Jun '01

29 Jun '01

<<Apologies if you receive multiple copies.>> PRELIMINARY PROGRAM AND REGISTRATION INFORMATION International Symposium on Theoretical Aspects of Computer Software (TACS2001) Tohoku University, Sendai, Japan October 28-31, 2001 Further information about TACS2001 can be obtained on the Web, at: http://tacs2001.ito.ecei.tohoku.ac.jp/tacs2001/ Any inquiry on TACS2001 Program and Registration may be directed to TACS2001(a)ito.ecei.tohoku.ac.jp ====================================================================== TACS2001 PRELIMINARY PROGRAM OCTOBER 28 SUNDAY 16:00 REGISTRATION at Sendai Tokyu Hotel till 21:00 19:30 WELCOME RECEPTION at Sendai Tokyu Hotel till 21:00 OCTOBER 29 MONDAY at Aoba Memorial Building, Tohoku University 9:10 INVITED TALK 1 Luca Cardelli A Spatial Logic for Concurrency 10:10 Break SESSION 1, 10:30 - 12:00 10:30 Michele Bugliesi, Giuseppe Castagna, Silvia Crafa Boxed Ambients 11:00 Daisuke Hoshina and Akinori Yonezawa A Typed Process Calculus for Fine-grained Resource Access Control in Distributed Computation 11:30 Martin Abadi and Jan Jurjens Formal Eavesdropping and its Computational Interpretation 12:00 Lunch Break 13:15 INVITED TALK 2 Kazunori Ueda Resource-Passing Concurrent Programming 14:15 Break SESSION 2, 14:35 - 15:35 14:35 Cosimo Laneve, Joachim Parrow, Bjorn Victor Solo Diagrams 15:05 Barbara Koenig and Ugo Montanari Observational Equivalence for Synchronized Graph Rewriting with Mobility 15:35 Break SESSION 3, 15:55 - 17:25 15:55 Hiroshi Nakano Fixed-point Logic with the Approximation Modality and its Kripke Completeness 16:25 Daniel Leivant Termination Proofs and Complexity Certification 16:55 Keye Martin A Uniform Approach to Searching 17:25 Break OCTOBER 30 TUESDAY at Aoba Memorial Building, Tohoku University 9:10 INVITED TALK 3 Andrew M. Pitts Nominal Logic: A First Order Theory of Names and Binding 10:10 Break SESSION 4, 10:30 - 12:00 10:30 Makoto Hamana A Logic Programming Language based on Binding Algebras 11:00 Didier Galmiche and Daniel Mery Proof-search and Countermodel Generation in Propositional BI Logic 11:30 Mizuhito Ogawa Generation of a Linear Time Query Processing Algorithm based on Well-Quasi-Orders 12:00 Lunch Break 13:15 INVITED TALK 4 Christine Paulin-Mohring Modelisation of Timed Automata in Coq 14:15 Break SESSION 5, 14:35 - 16:05 14:35 Javier Esparza, Antonin Kucera, Stefan Schwoon Model-Checking LTL with Regular Valuations for Pushdown Systems 15:05 Martin Franzle What Will be Eventually True of Polynomial Hybrid Automata? 15:35 Joachim Niehren and Tim Priesnitz Non-structural Subtype Entailment in Automata Theory 16:05 Break SESSION 6, 16:25 - 17:25 16:25 Ph. Schnoebelen Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems 16:55 Antti Puhakka Weakest Congruence Results Concerning "Any-Lock" 17:25 Break 18:30 BANQUET at Sendai Tokyu Hotel till 20:30 OCTOBER 31st WEDNESDAY at Aoba Memorial Building, Tohoku University 9:10 INVITED TALK 5 Jon G. Riecke Design and Correctness of Program Transformations based on Control-Flow Analysis 10:10 Break SESSION 7, 10:30 - 12:00 10:30 Marcello M. Bonsangue and Joost N. Kok Infinite Intersection and Union Types for the Lazy Lambda Calculus 11:00 Yoriyuki Yamagata Strong Normalization of Second Order Symmetric Lambda-mu Calculus 11:30 Philip Wadler The Girard-Reynolds Isomorphism 12:00 Lunch Break 13:15 INVITED TALK 6 Daniel Jackson Lightweight Formalism for Software Design 14:15 Break SESSION 8, 14:30 - 15:30 14:30 Lennart Beringer Typing Assembly Programs with Explicit Forwarding 15:00 Andrei Serjantov, Peter Sewell, Keith Wansbrough The UDP Calculus: Rigorous Semantics for Real Networking 15:30 Break 15:45 OPEN LECTURE Benjamin C. Pierce Theory and Practice of Synchronization 17:00 CLOSING SESSION till 17:10 -------------------------- 18:30 Japanese Dinner Party for Participants from Abroad ============================================================================== TACS2001 is sponsored by Tohoku University, Sendai, Japan in cooperation with Information Processing Society of Japan Japan Society for Software Science and Technology Association for Symbolic Logic Association for Computing Machinery--SIGACT Symposium Chair: Takayasu Ito Tohoku University Program Chairs: Naoki Kobayashi Tokyo Institute of Technology Benjamin Pierce University of Pennsylvania Program Committee Zena Ariola University of Oregon Cedric Fournet Microsoft Research Jacques Garrigue Kyoto University Masami Hagiya University of Tokyo Robert Harper Carnegie Mellon University Masahito Hasegawa Kyoto University Nevin Heintze Lucent Technologies Martin Hofmann University of Edinburgh Zhenjiang Hu University of Tokyo Naoki Kobayashi Tokyo Institute of Technology Martin Odersky Ecole Polytechnique Federale de Lausanne Catuscia Palamidessi Pennsylvania State University Benjamin Pierce University of Pennsylvania Francois Pottier INRIA Andre Scedrov University of Pennsylvania Natarajan Shankar SRI International Ian Stark University of Edinburgh Makoto Tatuta National Institute of Informatics, Tokyo ========================================================================= GENERAL INFORMATION TACS2001 will be held on the campus of Tohoku University, Sendai, Japan. The invited talks and contributed talks will be presented at the Aoba Memorial Building, Faculty of Engineering located on the Aoba Hill about 3 km west of downtown Sendai. The welcome reception and banquet will be held at Sendai Tokyu Hotel, located in downtown Sendai. The TACS2001 proceedings will be available as a volume of Lecture Notes in Computer Science, Springer-Verlag, at the time of the conference. Sendai is the largest city in the northern part of Honshu Island of Japan, with a population of about a million. The city is known in Japan as the "City of Trees". It is 350 km north of Tokyo and about 2 hours away by the Tohoku Bullet Train (Tohoku Shinkansen). Sendai is a modern, safe city with a moderate climate blessed by four distinct seansons. At the end of October the weather would be mostly sunny with temperature ranging from 5 C (41 F) to 15 C (59 F), and it will be the time of beautiful autumnal tints. Conference registration is open to the public. Reservations for the Japanese dinner party (October 31st) will be limited. Register and make reservations by returning the completed form by email and fax. The registration form is attached below, and it is also available from the TACS2001 web site. There will also be on-site registration at: * Sendai Tokyu Hotel, 16:00 - 21:00, October 28, * Aoba Memorial Bldg, Tohoku Univ, 9:00 - 17:00 on October 29-31. Some information on transportation and hotels is described below. More information on TACS2001, including travel information, is available at the TACS2001 web page: http://tacs2001.ito.ecei.tohoku.ac.jp/tacs2001/ Transportation ^^^^^^^^^^^^^^ Conference participants arriving at the new Tokyo International (Narita) Airport are advised to take the JR Narita Express train from Narita Airport to Tokyo Station. Then take the Yamabiko super express train of Tohoku Shinkansen (Tohoku Bullet Train) from Tokyo to Sendai. Making reservation at Narita Station for the Yamabiko is strongly recommended. Those arriving at the new Osaka International (Kansai) Airport can fly to Sendai Airport, and take Limousine Bus service to Sendai Station. Alternatively, you can take a local train from the Kansai Airport to JR Shin Osaka Station, then take the Tokaido Shinkansen from JR Shin Osaka Station to JR Tokyo Station and change at Tokyo Station to Tohoku Shinkansen. Some details on transportation will be available at the TACS2001 web page. Note: (1) No flight service is available from Narita to Sendai Airport, since the train service is superior. There is another train service from Narita Airport to downtown Tokyo (Ueno) by Skyliner of the Keisei-Narita Line. At Ueno you can take the Yamabiko superexpress of Tohoku Shinkansen to Sendai, but you have to walk about 10 min from Keisei Ueno Station to JR Ueno Station to take Tohoku Shinkansen. (2) If you are going to travel in Japan by JR lines before/after the TACS2001 symposium, it will be convenient and economical to get a JR PASS before your departure. Contact your travel agent for more information on JR PASS (Japan Rail Pass). Hotels ^^^^^^ Two hotels offer discount rates to TACS2001 participants: the Sendai Tokyu Hotel, and the Sendai Washington Hotel. They are 1.2 km west of Sendai Station and about 800 Yen by taxi from the station. Two hotels are located within 5 min walk of each other. More information on TACS2001 is available at the TACS2001 web page. =========================================================================== REGISTRATION AND RESERVATION Registration Fees ^^^^^^^^^^^^^^^^^ Registration fees cover attendance in all sessions, a copy of proceedings, refreshments and snack, the welcome reception and banquet, but not the Japanese dinner party on October 31st. The reduced author rate applies to all authors of the accepted papers, and the reduced committee member rate applies to all members of the Program Committee and the Organizing Committee. The student rate applies to full time students. Registrants paying reduced rates have full privileges at the conference. The companion rate covers the welcome reception and banquet only. Through September 17 From September 18 Regular 40,000 Yen 50,000 Yen Author 30,000 Yen 40,000 Yen Committee Member 30,000 Yen 40,000 Yen Student 20,000 Yen 30,000 Yen Companion 4,000 Yen 6,000 Yen Hotels ^^^^^^ Two convenient Western style hotels offer TACS2001 discount rates. Rates are per person, per night, and include service charge and tax (not including breakfast). Single Room Twin Room Sendai Tokyu Hotel 10,185 Yen 7,560 Yen Sendai Washington Hotel II 8,000 Yen 7,000 Yen Sendai Washington Hotel I 7,000 Yen --------- Note: Twin room reservations are available for two persons. No roommate matching service is available, so twin room reservations remain registrant's responsibility. Japanese dinner party for participants from abroad ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ A Japanese dinner party for participants from abroad will be held at TOYOKAN in the evening of October 31st. The invited speakers, PC members, and some others will attend. A limited number of reservations will be available for this dinner party. The rates are as follows. Conference registrant: 10,000 Yen Companion: 6,000 Yen =================================================================================== Cut here to send your registration and reservation form after filling in the items. =================================================================================== TACS2001 REGISTRATION AND RESERVATION FORM Please register and make reservations by completing the form below and returning it by email to tcs02(a)thk.jtb.co.jp Registrants are advised to email a copy of their completed form to TACS2001(a)ito.ecei.tohoku.ac.jp They are also encouraged to send a signed, printed copy of their completed form by FAX to 022-296-3327 (domestic) +81-22-296-3327 (from abroad) which is the fax number of the following agent to take care of the conference registration and reservation. Japan Travel Bureau Group Tours Office Tohoku Tobu Sendai Daiichi Bldg, 6th Floor 4-6-1 Tsutsujigaoka, Miyagino-ku, Sendai 983-0852, Japan FAX: 022-296-3327 (domestic) +81-22-296-3327 (from abroad) PHONE: 022-296-3361 (domestic) +81-22-296-3361 (from abroad) Email: tcs02(a)thk.jtb.co.jp Registration and reservations will be completed by your payment, whose method is described below. "IMPORTANT NOTE" As described below, from the standpoint of the safety, registrants are advised to pay fees by Bank Transfer. When the payment is made by a credit card, they are advised to send the required information, including Credit Card numbers by FAX; that is, do NOT send Credit Card numbers by email. REGISTRATION FOR TACS2001 ^^^^^^^^^^^^^^^^^^^^^^^^^ Last (Family) Name: First (Given) Name: Middle: Affiliation: Postal Address: City/State/Zip: Country: Phone: Fax: Email: Registration Status <Regular, Author, Committee Member, Student>: Number of Companions: Companions' names (if applicable): (A) Total Registration Fee(s) in Yen: HOTEL RESERVATION ^^^^^^^^^^^^^^^^^ Hotel First Choice: Hotel Second Choice: Number of Single Room(s): Number of Twin Room(s): Roommate's Name(s) for Twin Room(s): Check-in Date: Check-out Date: Number of Nights: Special Room or other Request: JAPANESE DINNER PARTY ^^^^^^^^^^^^^^^^^^^^^ A limited number of reservations are available for the Japanese dinner party to be held at TOYOKAN in the evening of October 31st, for participants from abroad. (B) 10,000 Yen x [ ] conference registrant(s): (C) 6,000 Yen x [ ] companion(s): TOTAL FEE IN YEN ^^^^^^^^^^^^^^^^ (A) + (B) + (C): Signature (not needed for email): METHOD OF PAYMENT FOR TACS2001 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ From the standpoint of the safety and security, participants are encouraged to pay via Bank Transfer. When they pay via credit card, they are advised to send the required information (in particular, Credit Card numbers) by FAX; that is, do NOT send your Credit Card numbers by email. In credit card payment Visa card, MasterCard, and Diners card will be accepted. Personal checks cannot be accepted. All payments must be made in Japanese Yen. Indicate method of payment below: [ ] Bank Transfer to Bank: Tokyo Mitsubishi Bank, Sendai Branch Account Name: TACS2001 Chair Takayasu Ito Account No. 1180724 From <bank name>: Date of transfer: Payer's name: Note: In Japan the bank number of Tokyo Mitsubishi Bank is 0005, and the number of its Sendai Branch is 320. [ ] Payment by Credit Card Credit Card Type <Visa, MasterCard, or Diners>: Card Number: Expiration Date: Signature (not needed for email): <Note>: When your payment is via Credit Card, send the above information by FAX to +81-22-296-3327, the fax no. of Japan Travel Bureau Group Tours Office Tohoku. Even when you send the above form by fax, send it by EMAIL without filling in Credit Card number for safety. ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Registration and reservations will be confirmed upon receipt of payment. Refunds will be made upon written request received through October 15, 2001 by Japan Travel Bureau Group Tours Office Tohoku. -----*****-----*****-----*****-----

1 0

STACS 2002 -- 2nd Call for papers
by Jerome Durand-Lose 29 Jun '01

29 Jun '01

============================================================== We apologize for multiple copies of this call for papers ============================================================== +--------------------+ | | | STACS 2002 | | | +--------------------+ 19th International Symposium on Theoretical Aspects of Computer Science Antibes Juan-les-Pins, France March 14-16 2002 http://www.inria.fr/stacs2002 SCOPE: Authors are invited to submit papers presenting original and unpublished research on theoretical aspects of computer science. Typical areas include (but are not limited to): * Algorithms and data structures, including: parallel and distributed algorithms, computational geometry, cryptography, algorithmic learning theory; * Automata and formal languages; * Computational and structural complexity; * Logic in computer science, including: semantics, specification, and verification of programs, rewriting and deduction; * Current challenges, for example: theory, models, and algorithms for biological computing, quantum computing, mobile and net computing. SUBMISSIONS: Authors are invited to submit a draft of a full paper (5-12 pages, the title page must contain a classification of the topic covered, preferably using the list of topics above). The paper should contain a succinct statement of the issues and of their motivation, a summary of the main results, and a brief explanation of their significance, accessible to non-specialist readers. Proofs omitted due to space constraints must be put into an appendix to be read by the program committee members at their discretion. Electronic submission is highly recommended. In case of problems with access to internet, it is possible to submit 6 copies of the draft (plus 1 copy of the appendix) and 15 copies of a one page abstract to the chairperson of the program committee. Detailed information is available on the web site. IMPORTANT DATES: Deadline for submission: September 14, 2001 Notification to authors: November 21, 2001 Final version: December 14, 2001 Symposium: March 14-16, 2002 PROCEEDINGS: Accepted papers will be published in the proceedings of the Symposium (Lecture Notes in Computer Science, Springer-Verlag). Simultaneous submission to other conferences with published proceedings is not allowed. PROGRAM COMMITTEE: H. Alt (Berlin) Co-Chair H. Buhrman (Amsterdam) B. Chlebus (Warsaw) T. Erlebach (Zuerich) A. Ferreira (Sophia-Antipolis) Chair H. Ganzinger (Saarbruecken) D. Lugiez (Marseille) Y. Metivier (Bordeaux) C. Moore (Albuquerque / Santa Fe) A. Muscholl (Paris) G. Pucci (Padova) G. Schnitger (Frankfurt) T. Schwentick (Jena) D. Trystram (Grenoble) B. Voecking (Saarbruecken) KEYNOTE SPEAKER: M.O. Rabin (Harvard) INVITED SPEAKERS: G. Dowek (Rocquencourt) C. Scheideler (Baltimore) CONFERENCE CHAIR: Afonso Ferreira CNRS et I3S INRIA Sophia-Antipolis 2004, route des Lucioles BP 93 F-06902 Sophia-Antipolis France ORGANIZING COMMITTEE CHAIR: J. Durand-Lose (Nice) E-ADDRESS: stacs(a)sophia.inria.fr WEB SITE: http://www.inria.fr/stacs2002 ==== please post and distribute ====

1 0

Call-By-Push-Value thesis available
by Paul Levy 27 Jun '01

27 Jun '01

Dear colleagues, My PhD thesis "Call-By-Push-Value" is available at http://cs-people.bu.edu/pbl/papers/thesisqmwphd.ps.gz The call-by-push-value paradigm is based to a large extent on the theory of adjunctions. Part 3 of the thesis explains this connection, so I hope it will be of especial interest to category theorists. Regards Paul Blain Levy, Boston University http://cs-people.bu.edu/pbl/ ------------------------------------------------------------------------ Call-By-Push-Value PhD thesis, Queen Mary, University of London, March 2001 Abstract Call-by-push-value (CBPV) is a new programming language paradigm, based on the slogan ``a value is, a computation does''. We claim that CBPV provides the semantic primitives from which the call-by-value and call-by-name paradigms are built. The primary goal of the thesis is to present the evidence for this claim, which is found in a remarkably wide range of semantics: from operational semantics, in big-step form and in machine form, to denotational models using domains, possible worlds, continuations and games. In the first part of the thesis, we come to CBPV and its equational theory by looking critically at the call-by-value and call-by-name paradigms in the presence of general computational effects. We give a Felleisen/Friedman-style CK-machine semantics, which explains how CBPV can be understood in terms of push/pop instructions. In the second part we give simple CBPV models for printing, divergence, global store, errors, erratic choice and control effects, as well as for various combinations of these effects. We develop the store model into a possible world model for cell generation, and (following Steele) we develop the control model into a ``jumping implementation'' using a continuation language called Jump-With-Argument (JWA). We present a pointer game model for CBPV, in the style of Hyland and Ong. We see that the game concepts of questioning and answering correspond to the CBPV concepts of forcing and producing respectively. We observe that this game semantics is closely related to the jumping implementation. In the third part of the thesis, we study the categorical semantics for the CBPV equational theory. We present and compare 3 approaches: \begin{itemize} \item models using \emph{strong monads}, in the style of Moggi; \item models using \emph{value/producer structures}, in the style of Power and Robinson; \item models using (strong) adjunctions. \end{itemize} All the concrete models in the thesis are seen to be adjunction models.

1 0

Take that, Martin Hyland!
by Peter Freyd 19 Jun '01

19 Jun '01

Copyright 2001 Gale Group, Inc. Business and Management Practices Mondaq Business Briefing - The Henley Business Partnership Ltd, United Kingdom May 18, 2001 HEADLINE: United Kingdom: Where Has All The Profit Gone? LENGTH: 1416 words BYLINE: Quinton, John ... Understanding these Cost Accounting and Management Reporting techniques requires intelligent effort, rather than a degree in mathematical logic from Cambridge. This is much more applied common sense than accounting wizardry. ...

2 2

Working Conference on Generic Programming: first call for papers
by Johan Jeuring 18 Jun '01

18 Jun '01

WCGP '02 IFIP TC2 Working Conference on GENERIC PROGRAMMING http://www.generic-programming.nl/wcgp/cfp.html Organised in conjunction with MPC'02 July 8 - July 13, 2002 Dagstuhl, Germany CALL FOR PAPERS Generic programming is about making programs more adaptable by making them more general. Generic programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by suitably instantiating their parameters. In contrast with normal programs, the parameters of a generic programs are often quite rich in structure. For example they may be other programs, types or type constructors, class hierarchies, or even programming paradigms. Generic programming techniques have always been of interest, both to practitioners and to theoreticians, but only recently have generic programming techniques become a specific focus of research in the functional and object-oriented programming language communities. This working conference will bring together leading researchers in generic programming from around the world, and feature papers capturing the state of the art in this important emerging area. We welcome contributions on all aspects, theoretical as well as practical, of generic programming, aspect-oriented programming, polytypic programming, adaptive object-oriented programming, generic components, and so on. SUBMISSION Full papers should be submitted in Postscript or pdf format by e-mail to reach Jeremy.Gibbons(a)comlab.ox.ac.uk by February 16, 2002. The details of the submission procedure can be found at http://www.generic-programming.nl/wcgp/submit.html Although there is no page limit, submissions should strive for brevity and clarity. IMPORTANT DATES Submission February 16, 2002 Notification April 12, 2002 Final version due May 24, 2002 PROGRAMME COMMITTEE Matt Austern Eerke Boiten Ulrich Eisenecker Jeremy Gibbons (co-chair) Ralf Hinze Johan Jeuring (co-chair) Gary Leavens Karl Lieberherr Lambert Meertens Eugenio Moggi Bernhard Moeller Oege de Moor David Musser Martin Odersky Ross Paterson Simon Peyton Jones Colin Runciman Doaitse Swierstra Stephanie Weirich LOCAL ORGANISATION Jeremy Gibbons Johan Jeuring Bernhard Moeller CORRESPONDENCE Jeremy Gibbons (Jeremy.Gibbons(a)comlab.ox.ac.uk) Johan Jeuring (johan(a)jeuring.net)

1 0

Union College Conference
by Susan Niefield 16 Jun '01

16 Jun '01

UNION COLLEGE MATHEMATICS CONFERENCE Saturday and Sunday Schenectady September 29-30, 2001 New York This is a preliminary announcement for the tenth Union College Mathematics Conference. This year the conference topics are category theory and algebraic topology. In addition to plenary lectures, of interest to the entire Conference audience, there will also be shorter contributed talks in parallel sessions. Anyone interested in giving such a talk should contact one of the organizers. The meeting will begin with an evening reception on Friday, September 28, and end on Sunday afternoon. A more detailed notice will be mailed later this summer. Information will also be available at the Union College Mathematics Department website (www.math.union.edu) in July. We have included information about hotels at the end of this message in case you wish to make reservations early. Union College is centrally located in New York's capital district about 10 miles from the Albany International Airport, easily accessible by train from NYC, and just 3 to 4 hours by car from NYC, Boston, and Montreal. We hope to see you in September! ORGANIZERS Category Theory Susan Niefield niefiels(a)union.edu Kimmo Rosenthal rosenthk(a)union.edu Algebraic Topology Brenda Johnson johnsonb(a)union.edu Kathryn Lesh klesh(a)member.ams.org ACCOMMODATIONS The following hotels are within easy walking distance of campus and have agreed to set aside rooms for the conference. Although last minute accommodations may be possible, please try to book your room before 9/14/01. To obtain the rates listed below, mention the UNION COLLEGE MATHEMATICS CONFERENCE when you call to make reservation. Holiday Inn 100 Nott Terrace (518) 393-4141 Union College Rate: $78 Amenities: Dining Room, Pool, Fitness Room, Wheelchair Accessible Ramada Inn 450 Nott Street (518) 370-7151 Union College Rate: $73 Amenities: Dining Room, Pool, Fitness Room, Wheelchair Accessible Days Inn 167 Nott Terrace (518) 370-3297 Union College Rate: $64 Amenities: Wheelchair Accessible

1 0

LACL 2001: Last Call for Participation - Program
by Catherine Piliere 15 Jun '01

15 Jun '01

*********************************************************************** *** Last Call for Participation - Program *** LACL 2001 4th International Conference on LOGICAL ASPECTS OF COMPUTATIONAL LINGUISTICS June 27 -- 29, 2001 Le Croisic (on the ocean coast, nearby Nantes), France http://www.irisa.fr/LACL2001 --- Please accept our apologies for multiple copies --- --- Thank you in advance to circulate among interested people --- ************************************************************************** *** Practical information, schedule, on-line registration: http://www.irisa.fr/LACL2001 http://www.irisa.fr/manifestations/2001/LACL2001 *** Contact: Christele Soulas csoulas(a)irisa.fr Elisabeth Lebret lebret(a)irisa.fr *************************************************************************** -- LACL 2001 PROGRAM -- *************************************************************************** --- Invited speakers ----------------------------- Geoffrey K. PULLUM, Barbara C. SCHOLZ : On the distinction between Model-theoretic and Generative-enumerative syntactic frameworks Michael MOORTGAT : Structural Reasoning in Categorial Learning Mark STEEDMAN : Reconciling Type-Logical and Combinatory Extensions of Categorial Grammar --- Contributed papers ------------------------- M. A. ALONSO, E. DE LA CLERGERIE, M. VILARES : A formal definition of Bottom-up Embedded Push-Down Automata and their tabulation technique D. BARGELLI, J. LAMBEK : An algebraic Approach to French Sentence Structure P. BOTTONI, B. MEYER, K. MARRIOTT, F. PARISI PRESICCE : Deductive Parsing of Visual Languages W. BUSZKOWSKI : Lambek Grammars based on Pregroups C. CASADIO, J. LAMBEK : An Algebraic Analysis of Clitic Pronouns in Italian C. COSTA FLORENCIO : Consistent Identification in the Limit of any of the Classes k-Valued is NP-hard A.DIKOVSKY : Polarized Non-projective Dependency Grammars A. FORET : Mixing Deduction and Substitution in Lambek Categorial Grammars, some investigations C. FOX, S. LAPPIN : Framework for the Hyperintensional Semantics of Natural Language with Two Implementations H. HARKEMA : A Characterization of Minimalist Languages T. LAGER, J. NIVRE : Part of Speech Tagging from a Logical Point of View J. MICHAELIS : Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars E. STABLER : Recognizing Head Movement J. VILLADSEN : Combinators for Paraconsistent Attitudes J. VILLANEAU, J.-Y. ANTOINE, O. RIDOUX : Combining Syntax and Semantical Knowledge for Semantic Analysis of Spoken Language R. ZUBER : Atomicity of Some Categorially Polyvalent Modifiers --- Panel discussion : Logic in Contemporary Linguistics and Computational Linguistics ************************************************************************ *** Organizers: IRISA (INRIA, CNRS, Universit� de Rennes 1, INSA) IRIN (Universit� de Nantes) *** Sponsors: France Telecom R&D Xerox Loire Atlantique Pays de la Loire Ville de Nantes Universit� de Rennes 1 Universit� de Nantes *** Book and journal exhibition: Elsevier Hermes Kluwer Lincom Europa MIT Press Springer-Verlag World Scientific Publishing Company *** Other events in computational linguistics in France, early July: 2-5 july, Tours, TALN & RECITAL 2001: http://www.li.univ-tours.fr/taln-recital-2001/ 6-11 july, Toulouse, ACL 2001: http://www.irit.fr/ACTIVITES/EQ_ILPL/aclWeb/acl2001.html ***************************************************************************

1 0