May 2001 - Categories - categories.org.au

Pro C
by Bill Rowan 08 Jun '01

08 Jun '01

I have read that if C is a category, and the axiom of choice is assumed, then Pro C is equivalent to its full subcategory of diagrams where the diagram category is an inversely-directed set. Does anyone know where this is proved in the literature? Thanks, Bill Rowan

6 5

Journal boycott
by Peter Freyd 05 Jun '01

05 Jun '01

[Note from moderator: The article Peter forwards mentions the Public Library of Science whose web site is at http://www.publiclibraryofscience.org/ where support is being sought.] Science world in revolt at power of the journal owners James Meek, science correspondent Guardian Saturday May 26, 2001 Scientists around the world are in revolt against moves by a powerful group of private corporations to lock decades of publicly funded western scientific research into expensive, subscription-only electronic databases. At stake in the dispute is nothing less than control over the fruits of scientific discovery - millions of pages of scientific information which may hold the secrets of a cure for Aids, cheap space travel or the workings of the human mind. More than 800 British researchers have joined 22,000 others from 161 countries in a campaign to boycott publishers of scientific journals who refuse to make research papers freely available on the internet after six months. "Science depends on knowledge and technology being in the public domain," said Michael Ashburner, professor of biology at Cambridge University and one of the leading British signatories of the campaign, the Public Library of Science (PLS). "In that sense, science belongs to the people, and the fruits of science shouldn't be owned or even transferred by publishers for huge profits. The fruits of our research - which is, overwhelmingly, publicly paid for - should be made available as widely and as economically as possible." Anger has been simmering for more than a decade in the research libraries of Europe and the US at the massive increase in the cost of subscriptions to scientific journals, which collectively make up the sum of the world's scientific research. As the power of the internet to mine electronically archived journals for data grows, scientists have become increasingly frustrated at the journal publishers' plans to keep tight, lucrative control over decades of their work. Last year the most powerful journal publisher, the Anglo-Dutch firm Reed Elsevier, made a profit of #252m on a turnover of #693m in its science and medical business. Elsevier Science and other journal publishers effectively benefit from the public purse twice: once when taxpayer-funded scientists submit their work to the journals for free, and again when taxpayer-funded libraries buy the information back from them in the form of subscriptions. In Britain, the government is so concerned about the power of Reed Elsevier that it has blocked its #3.2bn takeover of another big journal publisher, Harcourt, while complaints about its market dominance are investigated. Derk Haank, the head of Elsevier Science, protested at the singling out of his company, and portrayed the boycott group as naive idealists. "Everybody would like to have everything available, all the time, and preferably for free," he said. "That's a general human trait, but I'm not sure the business model is realistic. I'm not ashamed to make a profit. I would only be ashamed if people were saying I was delivering a lousy service." He added: "Research is publicly funded, but the cost of publishing it isn't. If the funding authorities were to decide to pay for publication I would provide it for free." You won't find copies of most of Reed Elsevier's 1,100 journals on newsagents' shelves. With titles like Thin Walled Structures, Urban Water, Journal of Supercritical Fluids and Trends in Parasitology, their publications don't have the allure of Elle or FHM but the price of a year's subscription would make mass market publishers drool with envy. A year's subscription to Alcohol - nine issues - comes in at about #100 an issue. One Elsevier journal, Brain Research, costs more than #9,000 a year. Another, Preventative Veterinary Medicine, is now #713 a year, an increase of more than 300% over its 1991 price of #171. Elsevier justifies the increases on the grounds that the number of articles being submitted increases each year, adding to the firm's costs. Each article must be peer-reviewed by fellow scientists to see if it is worthy of publication. Mr Haank added that his firm's price increases forced libraries to cut subscriptions, which in turn cut Elsevier's income, forcing them to increase prices still more. Elsevier wanted to get out of this vicious circle, he said, and was trying to get universities to sign up for electronically archived versions of its journals. The firm has taken on 1,500 people to put its entire journal archive - going back to 19th century editions of The Lancet - on computer databases. But he said the price of subscription to the electronic database would still be tightly linked to the ever rising cost of the paper journals. "Our plan is to make everything available in the academic or professional environment, not just in six months, but on day one," he said. "Somebody has to pay for the cost of the system." Scientific research is not considered real unless it has been published in a recognised journal, and scientists' status and promotion is tied to publication. As a rule, neither the scientists who write the papers, nor their colleagues who peer review them, nor the editorial boards who vet them, are paid. The publishers' costs are printing, the tiny full-time staff on each journal - typically two people - marketing, and distribution. While the feud over the price of journals was between libraries and publishers, the scientists stood aside, but the advent of the internet has changed everything. Powerful search engines trawling computer databases make it possible for scientists to discover groundbreaking links between different research results which would previously have taken years of trawling through a jungle of indexes. The prospect of this incredible new tool being controlled by large private corporations has jerked scientists into action. "The major commercial publishers have every reason to feel threatened," Prof Ashburner said. "They charge very high prices, and they are very insistent on copyright transfer. We are not paid for publication, and we see no reason whatsoever why we should hand over copyright to a commercial publisher, having done the work, both the science and the writing. "The costs these publishers are charg ing are such that even in the wealthy countries we can't always afford to buy the information back, and it's off-limits totally for the developing world." In a letter to the competition commission in March, Clive Field, librarian at Birmingham University and head of the Consortium of University Research Libraries said that the Elsevier-Harcourt merger would give one company control over journals representing 42% of a typical university's spend in that area. He said Elsevier and Harcourt were already trying to drive too tough a deal with their electronic archive. "Neither publisher has yet offered a deal which is recognised to be fair and equitable," he wrote. "It is not unnaturally feared that a merged publisher, operating in a market where the buyer is weak, would be even less subject to the price checks and balances that a more open market would offer." A nice little earner Title Brain Research Publisher Elsevier Annual subscription 1991 #3,713 Annual subscription 2001 #9,148 Increase 146% Title Journal of Virological Methods Publisher Elsevier Subscription 1991 #527 Subscription 2001 #1,555 Increase 195% Title Neuroscience Letters Publisher Elsevier Subscription 1991 #1,125 Subscription 2001 #2,805 Increase 149% Title Preventative Veterinary Medicine Publisher Elsevier Subscription 1991 #171 Subscription 2001 #713 Increase 317% Title Biochemical Journal Publisher Biochemical Society (not-for-profit body) Subscription 1991 #793 Subscription 2001 #1,334 Increase 68% Source: Consortium of University Research Libraries

7 6

job: Postdoc Positions at the CLIP group
by A. German Puebla Sanchez 01 Jun '01

01 Jun '01

Announcing Postdoc Positions at the CLIP group ---------------------------------------------- School of Computer Science Technical University of Madrid The CLIP (Computational Logic, Implementation and Parallelism) group (http://clip.dia.fi.upm.es) at the School of Computer Science of Technical University of Madrid is searching for candidates for postdoctoral research positions in the research areas in which the group is involved. A PhD in Computer Science or related areas is required. These are research positions (no teaching is compulsory, although it is allowed) and renewable for up to 5 years. The initial salary is 28.548 Euros/year plus an initial budget of 5.707 Euros for travel and other expenses during the first year. Knowledge of Spanish is not a prerequisite for application and candidates can be of any nationality. The working language at the CLIP group for research is English. The number of positions available depends on the quality of the applicants. The positions are co-funded by the Spanish Ministry of Science and Technology and the Technical University of Madrid within the "Ramon y Cajal" program. Interested applicants should send their C.V. and a description of their research interests to the CLIP group (clip-staff(a)clip.dia.fi.upm.es) by ** June 15 ** Selection will follow a two step process which is described in more detail at http://clip.dia.fi.upm.es/Job_Openings/RyC.html More details on the CLIP group, publications, projects, and research areas of interest can be found at http://clip.dia.fi.upm.es (see e.g. the group description at http://www.clip.dia.fi.upm.es/clip_desc_bysys/clip_desc_bysys.html and the listing of research topics and publications at http://clip.dia.fi.upm.es/clippubsbytopic/clippubsbytopic.html) -- ============================================================= | German Puebla | Facultad de Informatica | | german(a)fi.upm.es | Universidad Politecnica de Madrid | | Phone +34-91-336-7449 | http://clip.dia.fi.upm.es/~german | =============================================================

1 0

Weighted Automata: Workshop Announcement
by Sandra Groszmann 31 May '01

31 May '01

[apologies if you receive multiple copies of this message] ----------------------------------------------------------------------------- Weighted Automata: Theory and Applications Dresden University of Technology, March 4 - 8, 2002 The workshop will cover all aspects of weighted automata, ranging from the theory of formal power series to max-plus-algebra and applications as e.g. in algebraic optimization of railway networks or natural language processing. The aim is to present tutorials and survey lectures by outstanding scientists in this area. Moreover, we encourage everybody to participate in this work- shop and present their own technical contribution in this area. We are happy to announce the following tutorials and survey lectures: Tutorials: Survey lectures: S. Gaubert (INRIA, Paris) S. Bloom (Hoboken, New Jersey) D. Kozen (Ithaca) Z. Esik (Szeged) W. Kuich (Wien) Z. F\"ul\"op (Szeged) M. Mohri (AT&T, New Jersey) P. Gastin (Paris), provisionally B. F. Heidergott (Eindhoven) B. Khoussainov (Auckland) G. J. Olsder (Delft) I. Petre (Turku) E. Stark (Stony Brook, New York) K. Zimmermann (Prague) All lecturers are asked to give a survey on their field of interest followed by recent research results. Interested participants are most welcome. If you wish to present a technical contribution, please send us an abstract (preferably of at most one page) before December 1, 2001. Authors will be informed about acceptance of their submission before December 15, 2001. Deadline for registration is February 1, 2001. There are no conference fees. Call for papers: There will be a special issue of the Journal of Automata, Languages, and Combinatorics (JALC) on the topic of this workshop. The deadline for submission of papers is April 20, 2002. All submissions will be refereed according to the usual journal standards. For further information see http://www.orchid.inf.tu-dresden.de/gk-spezifikation/wata.html ------------------------------------------------------------------------------ Manfred Droste Heiko Vogler Dresden University of Technology Dresden University of Technology Institute of Algebra Institute of Theor. Computer Science D-01062 Dresden, Germany D-01062 Dresden, Germany Tel.: +49-351-463-3908 Tel.: +49-351-463-8232 Fax: +49-351-463-4235 Fax: +49-351-463-8504 E-Mail: droste(a)math.tu-dresden.de E-Mail: vogler(a)inf.tu-dresden.de

1 0

ETAPS 2002, FIRST ANNOUNCEMENT & CALL FOR SUBMISSIONS
by etaps02＠ormelune.imag.fr 31 May '01

31 May '01

Please apologize if you receive multiple copies of this message. ********************************************************** *** ETAPS 2002 *** *** APRIL, 6-14, 2002 *** *** GRENOBLE, FRANCE *** ********************************************************** The European Joint Conferences on Theory and Practice of Software ETAPS is a loose and open confederation of conferences and other events that has become the primary European forum for academic and industrial researchers working on topics relating to Software Science. ****************************** * http://www-etaps.imag.fr/ * ****************************** FIRST ANNOUNCEMENT & CALL FOR SUBMISSIONS ----------------------------------------------------------------------- 5 Conferences - 13 Satellite Events - Tutorials - Tool Demonstrations ----------------------------------------------------------------------- Conferences ----------------------------------------------------------------------- CC 2001: International Conference on Compiler Construction Chair: Nigel Horspool ESOP 2001, European Symposium On Programming Chair: Daniel Le Metayer FASE 2001, Fundamental Approaches to Software Engineering Chairs: Ralf-Detlef Kutsche and Herbert Weber FOSSACS 2001 Foundations of Software Science and Computation Structures Chair: Mogens Nielsen TACAS 2001, Tools and Algorithms for the Construction and Analysis of Systems Chairs: Perdita Stevens and Joost-Pieter Katoen Satellite Events ----------------------------------------------------------------------- ACL2: Third Workshop on the ACL2 Theorem Prover and its Applications Contact: Matt Kaufmann, matt.kaufmann(a)amd.com http://www.cs.utexas.edu/users/moore/acl2/workshop-2002/ AGT: APPLIGRAPH Workshop on Applied Graph Transformation Contact: Hans-J�rg Kreowski, kreo(a)informatik.uni-bremen.de http://www.informatik.uni-bremen.de/theorie/AGT2002 CMCS: Coalgebraic Methods in Computer Science Contact: Larry Moss, University of Indiana, lsm(a)cs.indiana.edu http://www.cs.indiana.edu/cmcs COCV: Compiler Optimization Meets Compiler Verification Contact: Jens Knoop, knoop(a)ls5.cs.uni-dortmund.de http://sunshine.cs.uni-dortmund.de/~knoop/cocv02.html DCC: Designing Correct Circuits Contact: Mary Sheeran, ms(a)cs.chalmers.se http://www.cs.chalmers.se/~ms/DCC02/ INT: Second Workshop on Integration of Specification Techniques for Applications in Engineering Contact: Martin Gro�e-Rhode, mgr(a)cs.tu-berlin.de http://tfs.cs.tu-berlin.de/~mgr/int02/ LDTA: Second Workshop on Language Descriptions, Tools and Applications Contact: Marjan Mernik, marjan.mernik(a)uni-mb.si http://www.cwi.nl/conferences/LDTA2002/ SC: Software Composition Contact: Elke Pulverm�ller, pulvermueller(a)acm.org http://i44www.info.uni-karlsruhe.de/~pulvermu/workshops/SC2002 SFEDL: Semantic Foundations of Engineering Design Languages Contact: Gerald L�ttgen, g.luettgen(a)dcs.shef.ac.uk http://www.dcs.shef.ac.uk/~sfedl SLAP: Synchronous Languages, Applications, and Programming Contact: Florence Maraninchi, Florence.Maraninchi(a)imag.fr http://www.inrialpes.fr/bip/people/girault/Publications/Slap02 SPIN: 9th International SPIN Workshop on Model Checking of Software Contact: Stefan Leue, spin2002(a)informatik.uni-freiburg.de http://tele.informatik.uni-freiburg.de/spin2002 TPTS: Theory and Practice of Timed Systems Contact: Oded Maler, Oded.Maler(a)imag.fr http://www-verimag.imag.fr/~maler/TPTS.html VISS: Validation and Implementation of Scenario-based Specifications Contact: Anca Muscholl, muscholl(a)liafa.jussieu.fr Tutorials ----------------------------------------------------------------------- Proposals for half-day or full-day tutorials related to ETAPS 2001 are invited. Tutorial proposals will be evaluated on the basis of their assessed benefit for prospective participants to ETAPS 2001. Contact: Saddek Bensalem, Verimag, Saddek.Bensalem(a)imag.fr Tool Demonstrations ----------------------------------------------------------------------- Demonstrations of tools presenting advances on the state of the art are invited. Submissions in this category should present tools having a clear connection to one of the main ETAPS conferences, possibly complementing a paper submitted separately. Contact: Peter D. Mosses, etaps2002-demo(a)brics.dk ----------------------------------------------------------------------- INVITED SPEAKERS ----------------------------------------------------------------------- Bruno Courcelle, LaBRI, Bordeaux, France Patrick Cousot, ENS Paris, France John Daniels, Syntropy Limited, London, UK Daniel Jackson, Massachusetts Institute of Technology, USA Michael Lowry, NASA Ames Research Center, USA Greg Morrisett, Cornell University, USA Mary Shaw, Carnegy Mellon University, USA ----------------------------------------------------------------------- IMPORTANT DATES ----------------------------------------------------------------------- October 19, 2001: Submissions Deadline for the Main Conferences, Demos and Tutorials December 14, 2001: Notification of Acceptance/Rejection January 18 2002: Camera-ready Version Due April 8-12, 2002: ETAPS main Conferences in GRENOBLE April 6-14, 2001: Satellite Events ----------------------------------------------------------------------- ----------- you received this e-mail via the individual or collective address categories(a)mta.ca to unsubscribe from ETAPS list: contact etaps02(a)ormelune.imag.fr

1 0

correction
by Marta Bunge 31 May '01

31 May '01

To access the paper "Constructive Theory of Galois Toposes" go to http://www.math.mcgill.ca/~bunge/ctgt.ps (.pdf) as the one I gave earlier does not work. Sorry! Marta Bunge _________________________________________________________________________ Get Your Private, Free E-mail from MSN Hotmail at http://www.hotmail.com.

1 0

preprint: Constructive Galois Toposes /email address
by Marta Bunge 30 May '01

30 May '01

The paper Marta Bunge & Eduardo Dubuc, "Constructive Theory of Galois Toposes" has just been posted in my homepage http://www.math.mcgill.ca/~bunge/current_papers.html/ctgt.ps (dvi) I would also appreciate any communication with me to be through my hotmail address during the next seven months. I shall be visiting Ross Street in Sydney until the end of December 2001. Thank you. Best regards, Marta Bunge E-mail: martabunge(a)hotmail.com

1 0

Theory of computing text as categories
by Steve Stevenson 28 May '01

28 May '01

Good morning, Does anyone have a bibliography of typical "computer science" version of computability from the strict category view? I am thinking of texts that are along the lines Hopcroft and Ullman's "Automata, Languages, and Computation". MathRev lists about 80 entries satisfying "computability" and "category theory" but I don't see any textbooks in the mix. Any help appreciated. steve

1 0

Concoord 2001: Call for Participation
by Vladimiro Sassone 26 May '01

26 May '01

[[ -- Apologies for multiple copies of this message -- \vs ]] Final Call for Participation ConCoord International Workshop on Concurrency and Coordination ====================================================== Scientific Programme Fri July 6 09:00- 9:30 Registration and Opening 09:30-10:30 Invited Talk: `A Query Language Based on the Ambient Logic' Luca Cardelli 10:30-11:00 Coffee Break 11:00-11:45 `Coordination of Mobile Components', F. Arbab 11:45-12:30 `CoreLime: a Coordination Model for Mobile Agents', B. Carbunar, M.T. Valente, J. Vitek 12:30-14:30 Lunch 14:30-15:15 `Network Services and Modal Types', G. Ferrari, E. Moggi, R. Pugliese 15:15-16:00 `Boxed Ambients: Types and Security', M. Bugliesi, G. Castagna, S. Crafa 16:00-16:30 Coffee Break 16:30-18:00 PANEL: Concurrency, Coordination, and Global Computing Sat Jul 7th 09:00-10:00 Invited Talk: Jim Waldo (title TBA) 10:00-10:30 Coffee Break 10:30-11:15 `Security Issues in Component-based Design', A. Bracciali, A. Brogi, G. Ferrari, E. Tuosto 11:15-12:00 `Information Flow Security in Mobile Ambients', A. Cortesi, R. Focardi 12:00-12:45 `Static Analysis for Stack Inspection', M. Bartoletti, P. Degano, G. Ferrari Sun Jul 8th 09:00-10:00 Invited Talk: Paolo Ciancarini (title TBA) 10:00-10:30 Coffee Break 10:30-11:15 `Modelling Node Connectivity in Dynamically Evolving Networks', L. Bettini, M. Loreti, R. Pugliese 11:15-12:00 `On the Serializability of Transactions in JavaSpaces' N. Busi, G. Zavattaro 12:00-12:45 `Zero-safe net models for transactions in Linda', R. Bruni and U. Montanari --------------------------------------------------------------------------- Travel Lipari is the largest island of the Eolie Archipelago, located north of Sicily, well known for its volcanic activities. It has sceneries of incomparable beauty and contrasting character. It can be easily reached from Milazzo, Palermo, Naples, Messina and Reggio Calabria by ferry or hydrofoil (50 minutes from Milazzo). The suggested route is to fly to Catania (CTA), reach the port of Milazzo by bus, and from there reach Lipary by hydrofoil or ferry. Alternatively, fly to Reggio Calabria (REG) and the Lipari by hydrofoil. Detailed instructions and timetables will be emailed to the participants at registration. --------------------------------------------------------------------------- Costs The workshop registration fee is 220K ITL (around 110 euro), payable cash at the meeting. A social dinner will be organised on Fri Jul 6. Participants will be able to join the excursion to the volcano Stromboli planned for Sun 8 for the Lipari School. --------------------------------------------------------------------------- Registration and Hotel Reservation Due to the high season in Lipari, hotels may be expensive and booking may be difficult. The organisation has (a limited number of) rooms available for the workshop period at: Hotel Casajanca <http://www.netnet.it/casajanca> Tel. +39-090-9880222 Fax +39-090-9813003 (around 70 euros, half board) Hotel Filadelfia 2 <http://www.netnet.it/hotel/filadelfia/index> Tel. +39-090-9812795, Fax +39-090-9812486 (around 70 euros, half board) Hotel Carasco <http://www.carasco.it/> Tel: +39-090-9811605 Fax +39-090-9811828 (around 110 euros, half board) These will of course be allocated on a first-come-fist-served basis. Casajanca is a pretty, little hotel in a splendid location 3km away from the Hotel Filadelfia <http://www.netnet.it/hotel/filadelfia/index>, where the workshop takes place. The best way to travel from Casajanca is by scooter. For those who require it, renting a scooter will be organised by the hotel staff. If you wish to stay there, but do not intend to ride a scooter, the hotel will organise minibus rides to the workshop location. When booking, remember to mention Concoord/Lipari School. Other suggested five-star, centrally-located (and substantially more priced) hotels are: Hotel Villa Meligunis <http://www.netnet.it/villameligunis/> Hotel Giardino sul Mare <http://www.netnet.it/hotel/giardino/index> Hotel Rocce Azzurre <http://www.netnet.it/hotel/rocceazzurre/index> Finally, the travel agency Longo Travel Tel. +39-090-9880640, Fax. +39 090-9812793, e-mail: longotravel(a)netnet.it Contact person: Mr. Bartolo rents self catering flats on a weekly basis. Further information about hotels can be found at <http://www.netnet.it/english>. To register send an email to <concoord(a)tosca.dmi.unict.it> with your name, affiliation, dates of arrival and departure, and the hotel you have booked in. (Please, notice that you have to book yourself.) --------------------------------------------------------------------------- More information to appear on: <http://tosca.dmi.unict.it/concoord> =========================================================================== email: <mailto:concoord@tosca.dmi.unict.it>

1 0

CSL 2001 -- CALL FOR PARTICIPATION
by fribourg＠lsv.ens-cachan.fr 26 May '01

26 May '01

CSL 2001 September 10 - 13, 2001 Paris, France Annual Conference of the European Association for Computer Science Logic ------------------------------------------------------------ EARLY REGISTRATION IS NOW OPEN! DEADLINE: JUNE 25 ------------------------------------------------------------ The CSL Web page contained a detailed schedule and registration form http://www.lsv.ens-cachan.fr/csl01/ Invited talks: ************** Jean-Yves Girard (IML, Marseille) Peter O'Hearn (QMW College, London) Jan Van den Bussche (U. Limburg) Contributed papers: ****************** M. Galota and H. Vollmera: ``Generalization of the Buechi-Elgot-Trakhtenbrot Theorem''. T.M. Rasmussen: ``Labelled Natural Deduction for Interval Logics''. M. Schmidt-Schauss: ``Stratified Context Unification is in PSPACE''. O. Finkel: ``An effective extension of the Wagner hierarchy to blind counter automata''. P. Courtieu: ``Normalized types''. Y. Chen and E. Shen: ``Capture Complexity by Partition''. C. Lutz, U. Sattler and F. Wolter: ``Modal Logic and the two-variable fragment''. M. Grohe and S. WÃ¶hrle: ``An Existential Locality Theorem''. F. Koriche: ``A Logic for Approximate First-Order Reasoning''. M. Bezem: ``An improved extensionality criterion for higher-order logic programs''. Y. Akama: ``Limiting Partial Combinatory Algebras Towards Infinitary Lambda-calculi and Classical Logic''. S. Ronchi Della Rocca and L. Roversi: ``Intersection Logic''. A. Armando, S. Ranise and M. Rusinowitch: ``Uniform Derivation of Decision Procedures by Superposition''. F. Klaedtke: ``Decision Procedure for an Extension of WS1S''. P. Chrzastowski-Wachtel, P. Pokarowski and J. Tyszkiewicz: ``On the Existence of Asymptotic Conditional Probabilities in First Order Logic of Word Structures''. M. Keye: ``A principle of induction''. V. Mogbil: ``Quadratic correctness criterion for Non commutative Logic''. J. Power and K. Tourlas: ``An Algebraic Foundation for Higraphs''. R. Staerk and S. Nanchen: ``A Logic for Abstract State Machines''. A. Dawar, E. GrÃ¤del and S. Kreutzer: ``Inflationary Fixed Points in Modal Logic''. A. Guglielmi and L. Strassburger: ``Non-Commutativity and MELL in the Calculus of Structures''. M. Korovina and O. Kudinov. ``Semantic Characterisations of Second-order Computability Over the Real Numbers''. E. Robinson and G. Rosolini: ``An Abstract Look at Realizability''. N. Alechina, M. Mendler, V. de Paiva and E. Ritter: ``Categorical and Kripke Semantics for Constructive Modal Logics''. L. Schroeder: ``Life without the terminal type''. J. van Eijck: ``Constrained Hyper Tableaux'' F. S. de Boer and R. M. van Eijk: ``Decidable Navigation Logics for Object Structures''. W. Charatonik and J.-M. Talbot: ``The Decidability of Model Checking Mobile Ambients''. J.-Y. Marion: ``Actual arithmetic and feasibility''. N. Schweikardt: ``The natural order-generic collapse for omega-representable databases over the rational andthe real ordered group''. M. Baaz and G. Moser: ``On a generalisation of Herbrand's Theorem''. M. Kanovich. ``The Expressive Power of Horn Monadic Linear Logic''. V. Danos and R. Harmer: ``The Anatomy of Innocence''. A. Kopylov and A. Nogin. ``Markov's Principle for Propositional Type Theory''. C. Schuermann ``Recursion for Higher-Order Encodings''. R. Matthes: ``Monotone Inductive and Coinductive Constructors of Rank 2''. G. Rosu: ``Complete Categorical Equational Deduction''. S. Abramsky and M. Lenisa: ``A Fully Complete Minimal PER Model for the Simply Typed lambda-calculus''. J. Goubault-Larrecq: ``Well-Founded Recursive Relations''. H. Ohsaki: ``Beyond the Regularity: Equational Tree Automata for Associative and Commutative Theories''. -- Laurent Fribourg Tel. +33 1 47 40 28 66

1 0