- Haskell - Haskell.org

The POPLmark Challenge
by Peter Sewell 17 Mar '05

17 Mar '05

[Our apologies for multiple copies.] The POPLmark Challenge How close are we to a world where programming language papers are routinely supported by machine-checked metatheory proofs, where full-scale language definitions are expressed in machine-processed mathematics, and where language implementations are directly tested against those definitions? To clarify the current state of the art, and to motivate further research, we propose some concrete benchmarks for measuring progress. Based on System Fsub, a typed lambda-calculus with second-order polymorphism, subtyping, and records, the benchmarks embody many aspects of programming languages that are challenging to formalize: variable binding at both the term and type levels, syntactic forms with variable numbers of components (including binders), proofs demanding complex induction principles, and algorithmic questions. To keep the challenge manageable, it is intermediate in scale between `toy' calculi and full programming languages. The challenge problems are available from the web page <http://www.cis.upenn.edu/group/proj/plclub/mmm/>, with informal definitions of syntax and semantics, hand proofs of the metatheoretic results, and a prototype implementation. We encourage users and developers of automated reasoning tools to attempt the challenges and send the results to the POPLmark mailing list (from that same web page), which will provide a forum for debate. Queries and clarifications should also be discussed there. The POPLmark team can also be mailed directly at provers(a)lists.seas.upenn.edu. We are not ourselves automated reasoning experts but rather potential users; our impression is that current tools are _almost_ at the point where they can be used routinely. It's time to bring mechanized metatheory to the masses - go to it! Peter, for the POPLmark team: Brian Aydemir, Aaron Bohannon, Matthew Fairbairn, Nathan Foster, Benjamin Pierce, Peter Sewell, Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie Weirich, and Steve Zdancewic

1 0

WRS05: Program and Call For Participation
by Roberto Di Cosmo 16 Mar '05

16 Mar '05

********************************************************************** 5th International Workshop on Reduction Strategies in Rewriting and Programming WRS'05 Nara, Japan April 22nd, 2005 CALL FOR PARTICIPATION *** Early Registration Deadline: 31 March 2005 *** http://www.pps.jussieu.fr/~dicosmo/WRS05/ ********************************************************************** Invited Speakers: ******************* Kokichi Futatsugi (JAIST, Japan), Proof Score Method in CafeOBJ Hongwei Xi (Boston University, USA), Implmenting an evaluator for mini-ML in ATS: a case study of combining programming with theorem proving Accepted Papers: ******************* Vincent van Oostrom, Delimiting diagrams Toshiyasu Arai and Georg Moser, Tired Recursion and Strategies Salvador Lucas, A Note on Completeness of Conditional Context-Sensitive Rewriting Jeroen Ketema, Jan Willem Klop, Vincent van Oostrom, Vicious Circles in Rewriting Systems Pierre Valarcher, Call by name vs call by value in primitive recursion: storage operator Co-Chairs: ******************* Roberto Di Cosmo Laboratoire PPS - Universite Paris 7, France Yoshihito Toyama Tohoku University, Japan ====================================================================== RDP 2005 Federated Conference on Rewriting, Deduction and Programming RTA'05 - TLCA'05 - RULE'05 - UNIF'05 - WRS'05 - IFIP WG1.6 18-23 April 2005, Nara, Japan http://www.kurims.kyoto-u.ac.jp/rdp05/ CALL FOR PARTICIPATION *** Early Registration Deadline: 31 March 2005 *** ====================================================================== We are happy to announce that the registration and hotel reservation procedures for attending RDP 2005 are open now. Please follow the link to the registration page from the RDP'05 top page (http://www.kurims.kyoto-u.ac.jp/rdp05/) to complete your registration. There also are links to web pages providing some travel and local information. Please remember that the number of hotel rooms is limited. Requests will be processed on a first come first served basis and will be subject to availability. RDP'05 will take place at the Nara-Ken New Public Hall which is located in the centre of the beautiful Nara National Park, within 20 minutes walk from the Kintestu Nara Station. EVENTS RTA'05 19-21 April http://www-i2.informatik.rwth-aachen.de/RTA05/ TLCA'05 21-23 April http://www.kurims.kyoto-u.ac.jp/rdp05/tlca/ RULE'05 23 April http://rule2005.loria.fr/ UNIF'05 22 April http://rewriting.loria.fr/UNIF-2005/ WRS'05 22 April http://www.pps.jussieu.fr/%7Edicosmo/WRS05/ IFIP WG1.6 18 April http://rewriting.loria.fr/IFIP-WG1.6/ Conference Dinner is scheduled on 21 April. ORGANIZERS Masahito Hasegawa (RDP organizing co-chair, TLCA organizing committee chair) Hitoshi Ohsaki (RDP organizing co-chair, RTA conference chair) CONTACT Enquiries should be sent to the organizers <rdp05(a)m.aist.go.jp>. FURTHER INFORMATION RDP website: http://www.kurims.kyoto-u.ac.jp/rdp05/ ======================================================================

1 0

announce: wxhaskell 0.9
by Daan Leijen 16 Mar '05

16 Mar '05

Announcement: wxHaskell version 0.9 ---------------------------------------------------------------------- <http://wxhaskell.sourceforge.net> I am pleased to announce a new release of wxHaskell. This new release has support for the printing and much improved support for processes and the grid control. Binary installers are provided for MacOS X, Linux (RPM), and Windows, for use with ghc 6.2.2. Have fun, Daan Leijen. ---------------------------------------------------------------------- wxHaskell is a portable GUI library for Haskell. The goal of the project is to provide an industrial strength portable GUI library, but without the burden of developing (and maintaining) one ourselves. wxHaskell is therefore build on top of wxWidgets -- a comprehensive C++ library that is portable across all major GUI platforms; including GTK, Windows, X11, and MacOS X. Furthermore, it is a mature library (in development since 1992) that supports a wide range of widgets with native look-and-feel, and it has a very active community (ranked among the top 25 most active projects on sourceforge). Since most of the interface is automatically generated from the wxEiffel binding, the current release of wxHaskell already supports about 75% of the wxWindows functionality -- about 2900 methods in 500 classes with 1400 constant definitions. wxHaskell has been build with GHC 6.x on Windows, MacOS X and Unix systems with GTK. A binary distribution is available for Windows, Linux (RPM) and MacOS X. And even if you don't intend to write GUI's yourself, it will be fun to check out the screenshots at <http://wxhaskell.sourceforge.net>. ---------------------------------------------------------------------- Version 0.9 ------------- Non backward compatible changes: - Changed "image" attribute to "picture" Backward compatible additions: - Added Multiple OpenGL Canvas example and fixed old example. - Much improved process support in WXCore.Process. Use "processExecAsyncTimed" instead of "processExecASync". - Full printing support in WXCore.Print - Added SpintControl events. - Fixed bug in MultiListBoxes where selections would only be added. - Added "pixelBufferGetPixels" and "pixelBufferSetPixels" and according functions for images. - Added "image" and made it an instance of the "Sized" class exported "imageCreateFromPixels" and "imageCreateFromPixelArray" - Added "drawImage" - Removed dependency on "readline" package in ghc 6.2.2 - Added "--cache" argument to configure script Bug fixes: - fixed "on command" event handlers in submenus.

3 5

Structures and Deduction Workshop 2nd cfp - ICALP'05 Satellite
by Paola Bruscoli 15 Mar '05

15 Mar '05

(ICALP Workshop-Lisbon July 16-17, 2005) STRUCTURES AND DEDUCTION The quest for the essence of proofs http://www.prooftheory.org/sd05 Submissions page is now open! http://www.easychair.org/SD05/submit/ This meeting is about new algebraic and geometric methods in proof theory, with the aim of expanding our ability to manipulate proofs, eliminate bureaucracy from deductive systems, and ultimately provide: 1) a satisfying answer to the problem of identity of proofs and 2) tools for improving our ability to implement logics. Stimulated by computer science, proof theory is progressing at fast pace. However, it is becoming very technical, and runs the risk of splitting into esoteric specialties. The history of science tells us that this has happened several times before, and that these centrifugal tendencies are very often countered by conceptual reunifications, which occur when one is looking at a field after having taken a few steps back. Some emerging ideas are showing their unifying potential. Deep inference's atomization of deductions simplifies and unifies the design of deduction systems; it provides unprecedented plasticity to proofs and has injected new impetus into the theory of proof nets. New proof nets, and new associated semantics, are giving surprising insight about the very subtle relationship between categories and proofs, for example in the formerly intractable case of classical logic. The field of deduction modulo, which turns out to be very much in the spirit of deep inference, decreases our dependency on the syntactic presentation of functional objects, and brings us closer to their intrinsic nature, even from the computational point of view. After studying all those trees for years we at last have the impression of looking at the forest. The core topics are organised along the axis: algebraic semantics deduction of proofs deep inference modulo game semantics operads and specification <--> structads <--> proof nets proof search calculus of deductive structures implementations proof nets This workshop aims at being a meeting point for all those who are interested in decreasing the dependency of logic from low-level syntax. The list of topics above is not exhaustive: if you feel you can contribute to the discussion along the broad lines outlined above, please submit your contribution. SUBMISSION, IMPORTANT DATES AND PUBLICATION Contributions such as work in progress, programmatic/position papers, tutorials, as well as regular papers are more than welcome. We will favor the former over regular papers that seem to us to be minor contributions, although we will definitely not reject major contributions! Submissions should be formatted with the LNCS LaTeX style, and should take between two and fifteen pages, to allow the committee to assess their merits with reasonable effort. This limit can be relaxed for the versions that will be presented at the workshop, depending on the total bulk of the accepted contributions. We want to make clear that contributions from members of the PC are allowed. Contributions should be submitted electronically at the following site (powered by EasyChair, thanks to Andrei Voronkov): http://www.easychair.org/SD05/submit/ submission: 15.4.2005 notification: 22.5.2005 final version: 10.6.2005 The volume of proceedings will be made available elctronically, allowing authors to keep their copyrights. The issue of printed proceedings is still under discussion. INVITED SPEAKERS Martin Hyland (Cambridge) Claude or Helene Kirchner (LORIA & INRIA Lorraine, Nancy) Dale Miller (INRIA Futurs and LIX, Paris) David Pym (Bath and HP Labs) PROGRAM COMMITTEE Paola Bruscoli (Dresden) Pietro Di Gianantonio (Udine) Gilles Dowek (LIX & Ecole Polytechnique, Paris) Roy Dyckhoff (St Andrews) Rajeev Gore' (NICTA and ANU, Canberra) Francois Lamarche (LORIA & INRIA Lorraine, Nancy) -- Chair Luke Ong (Oxford) Prakash Panangaden (McGill) Michel Parigot (CNRS, Paris) Charles Stewart (Dresden) Thomas Streicher (Darmstadt) LOCATION Lisbon, July 16-17, 2005; the workshop is a satellite of the ICALP 2005 conference. HOW TO REGISTER A registration fee for attending the workshop will be paid to the ICALP Workshop general chair; no fee for participating in the main conference should be necessary, while participation in both conference and workshop should entitle to special discounts. Please visit the ICALP web site for up-to-date, precise information: <http://icalp05.di.fct.unl.pt> ORGANISERS Paola Bruscoli (Dresden) Francois Lamarche (LORIA & INRIA Lorraine, Nancy) -- Chair Charles Stewart (Dresden)

1 0

LPNMR'05: Submission Deadline Approaching
by lpnmr05.publicity＠mat.unical.it 15 Mar '05

15 Mar '05

[Apologies if you receive this more than once] Call for Papers 8th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'05) Diamante, Cosenza, Italy September 5-8, 2005 http://www.mat.unical.it/lpnmr05/ LPNMR'05 is the eighth in the series of international meetings on logic programming and nonmonotonic reasoning. Seven previous meetings were held in Washington, D.C., (1991), in Lisbon, Portugal (1993), in Lexington, Kentucky (1995), in Dagstuhl, Germany (1997), in El Paso, Texas (1999), in Vienna, Austria (2001), and in Fort Lauderdale, Florida (2004). LPNMR'05 will be organized by the Department of Mathematics of University of Calabria (Italy), and will be co-located with the INFOMIX Workshop on Data Integration. The proceedings of the conference will be published by Springer - Lecture Notes in Artificial Intelligence series (to be verified). AIMS AND SCOPE -------------- LPNMR is a forum for exchanging ideas on declarative logic programming, nonmonotonic reasoning and knowledge representation. The aim of the conference is to facilitate interactions between researchers interested in the design and implementation of logic based programming languages and database systems, and researchers who work in the areas of knowledge representation and nonmonotonic reasoning. LPNMR strives to encompass these theoretical and exprimental studies that lead to the construction of practical systems for declarative programming and knowledge representation. Authors are invited to submit papers presenting original and unpublished research on nonmonotonic aspects of logic programming and knowledge representation. We particularly encourage papers on application of LPNMR techniques to build significant applications. A non-exhaustive list of topics of interest includes: 1. Development and mathematical studies of logical systems with nonmonotonic entailment relations: - Semantics of new and existing languages; - Relationships between formalisms; - Complexity and expressive power; - Development of inference algorithms and search heuristics for LPNMR systems; - Extensions of ''classical'' LPNMR languages by new logical connectives and new inference capabilities such as abduction, reasoning by cases, etc; - Updates and other operations on LPNMR systems; - Uncertainty in LPNMR systems. 2. Implementation of LPNMR systems: - system descriptions, comparisons, evaluations; - LPNMR benchmarks. 3. Applications of LPNMR systems: - LPNMR languages and algorithms in planning, diagnosis, software engineering, decision making, and other domains; - Applications of LPNMR languages in Data Integration and Exchange systems; - Methodology of representing knowledge in LPNMR languages: theory and practice; - Integration of LPNMR systems with other computational paradigms; - Embedded LPNMR systems: Systems using LPNMR subsystems. SYSTEM AND APPLICATION DEMONSTRATION TRACKS ------------------------------------------- As part of the technical program, we also plan a special session devoted to presentations and demonstrations of implemented nonmonotonic reasoning systems. Systems and application demonstration tracks will be announced in a distinct call. IMPORTANT DATES --------------- Abstract Submission Deadline March 22, 2005, 23:59:59 GMT Paper Submission Deadline March 25, 2005, 23:59:59 GMT Notification (Accept/Reject) May 16, 2005 Conference Schedule June 6, 2005 Final Conference Papers June 10, 2005 Early Registration Deadline July 4, 2005 Conference September 5-8, 2005 SUBMISSION OF PAPERS -------------------- Papers must not exceed thirteen (13) pages including title page, references and figures, and must be formatted according to the Springer LNCS/LNAI authors' instructions (see <URL:http://www.springer.de/comp/lncs/authors.html>). Papers must be written in English and present original research. Paper submission is electronic via the conference home page http://www.mat.unical.it/lpnmr05/. Papers must be registered (title, abstract, keywords, authors, contact information) by March 22, 2005, 23:59:59 GMT; the full paper must be uploaded by March 25, 2005, 23:59:59 GMT. PROGRAM CO-CHAIRS ----------------- Chitta Baral (Arizona State University, USA) Nicola Leone (University of Calabria, Italy) PROGRAM COMMITTEE ----------------- Jose Alferes (New University of Lisbon, Portugal) Leopoldo Bertossi (Carleton University, Canada) Pedro Cabalar (Corunna University, Spain) Gerhard Brewka (Leipzig University, Germany) Juergen Dix (Technical University of Clausthal, Germany) Wolfgang Faber (University of Calabria, Italy) Norman Foo (National ICT Australia and University of New South Wales, Australia) Michael Gelfond (Texas Tech University, USA) Antonis Kakas (University of Cyprus, Cyprus) Katsumi Inoue (National Institute of Informatics, Japan) Vladimir Lifschitz (University of Texas at Austin, USA) Fangzhen Lin (Hong Kong University of Science and Technology, China) Ilkka Niemelä (Helsinki University of Technology, Finland) David Pearce (Rey Juan Carlos University, Spain) Alessandro Provetti (University of Messina, Italy) Francesco Scarcello (University of Calabria, Italy) Torsten Schaub (University of Potsdam, Germany) Hans Tompits (Vienna University of Technology, Austria) Francesca Toni (Imperial College, London, UK) Mirek Truszczynski (University of Kentucky, USA) Marina de Vos (University of Bath, United Kingdom) PUBLICITY CHAIR --------------- Gianluigi Greco (University of Calabria, Italy) LOCAL ORGANIZATION CO-CHAIRS ---------------------------- Giovambattista Ianni (University of Calabria, Italy) Giorgio Terracina (University of Calabria, Italy)

1 0

[ICAPS 2005] Workshop "Plan Execution: A Reality Check" - Extended Deadline
by icaps05＠mac.com 15 Mar '05

15 Mar '05

Plan Execution: A Reality Check Bridging the gap between plans and their execution. A workshop held in conjunction with The 15th International Conference on Planning and Scheduling ICAPS 2005 Monterey, California, USA. Planning for realistic domains presents a varied set of challenges. Key among those challenges is understanding and representing the execution time behavior of the generated plans. Recent experiences in designing and deploying planning systems provide significant insight into the execution of plans generated by automated planners. This experience strongly suggests the presence of a gap between how plan execution is treated in the plan generation process, and what happens when the resulting plan is actually executed. For automated planning systems to be successful in the real world, it is essential that the nature of this gap be understood and some techniques for bridging it be developed. Some of the relevant issues include the following questions: 1. Is there a fundamental problem in our understanding of what planning is versus what execution is? 2. What is the range of possible semantics for execution? Are current domain modeling languages adequate to the task of representing execution? 3. How do planning systems fit architecturally with executives and hardware controllers? What are the strengths and weaknesses of current implementations,and where is more work needed? 4. How do planners cope with the mismatch between their representation of the domain and reality? (in terms of time latency, inaccuracies in modeling etc..) Is there a fundamental difference between how this prediction uncertainty is handled in control, and how it should be handled for planning? 5. What tools and practices may be adopted to bridge the gap? What can we learn from case studies, deployment experiences and other associated areas (such as hybrid controller design, real-time controls etc). This workshop will bring together researchers who are working on answering these questions to discuss these issues as well as real systems that are under development. Those wishing to attend are encouraged to submit either a long paper of up to 8 pages in AAAI format, or a short position paper of up to 3 pages. Please email pdf or ps versions of the papers to "sailesh at email.arc.nasa.gov" Important Dates: Submissions due: March 21, 2005. Notifications of acceptance: April 11, 2005 Camera-ready copy due: April 18, 2005. Organizing Committee: Michael Beetz, Technical University Munich. Gautam Biswas, Vanderbilt University. Mark Boddy, Adventium Labs. Felix Ingrand, LAAS. Nicola Muscettola, NASA Ames. Issa A. D. Nesnas, JPL. Sailesh Ramakrishnan, QSS Group Inc, NASA Ames.

1 0

[ICAPS 2005] Workshop "The Role of Ontologies in AI Planning and Scheduling" - Extended Deadline
by Bernd Schattenberg 15 Mar '05

15 Mar '05

ICAPS 2005 Workshop Call for Papers -------------------------------------- E X T E N D E D D E A D L I N E S New date for subissions: MARCH 21ST ---------------------------------------- Workshop on "The Role of Ontologies in AI Planning and Scheduling" http://decsai.ugr.es/~faro/workshop/Workshop.htm ICAPS 2005 - The International Conference on Automated Planning & Scheduling June 5-10, 2005, Monterey, California, U.S.A. http://icaps05.icaps-conference.org/ ========== Overview ========== Ontologies are becoming increasingly important in several AI fields (such as knowledge management and integration, cooperative problem solving, knowledge acquisition and knowledge-based systems, e-commerce and the Semantic Web) and, at present, there is also an increasing interest about their use in Planning and Scheduling (P&S) systems. In the field of P&S ontologies allow , on the one hand, knowledge exchange between intelligent processes (performed both by humans and other intelligent systems) in real world applications. On the other hand they allow to describe more complex domains and problems, since they are based on very rich representation languages (for example, semantic web languages as RDF, OWL,OWL-S). These languages are more expressive than those presently used in P&S, since they use the Open World Assumption rather than the planner-friendly Closer World Assumption. However, they are really ``static'' languages and do not include (generally) knowledge about states and state change, what prevents their ``direct'' application in current P&S systems. In any case, the way the use of ontologies and such languages impact the field of AI P&S needs to be investigated. In summary, the integration between ontologies and P&S techniques is demanding more attention both from theorists and practitioners, and there are many different approaches in the literature on this issue. Therefore, one of the main topics of this workshop will be the study of the benefits that an ontology-based knowledge representation could bring into current P&S technologies. ============= Scope ============ The goal of the workshop consists in trying to understand and discuss different ways of integration between ontologies techniques and intelligent planning. This can be seen as a different, general approach to bridge the gap that currently exists between the very efficient P&S technology and its application to real world. Papers submitted should either present theoretical / practical work or report experiences with applications (describing projects or applications, the difficulties they had to overcome, some lessons learned, etc.) on the following topics: * Definition of planning ontologies that overcome drawbacks detected on the real application of standard planning languages (such as PDDL) * Use of ontologies as the basis for knowledge exchange between different components of intelligent systems, where planning is a core technology * Planning applications that use ontology concepts for their development * Integration of ontology editing tools with planning systems * Deriving planning domain models from existing ontological knowledge * Planning and Scheduling ontologies for the Semantic Web - Ontologies for web services discovery and composition - Ontologies for the definition of ubiquitous services ================= Workshop format ================= The workshop will be structured to allow ample time for discussion and interactions, with the following format: * An invited talk will be given by a person with recognized experience in the interdisciplinary field of ``Ontologies applied to Planning and Scheduling''. * In order to foster interaction, selected papers accepted by the program committee will be coupled with commentaries aimed at raising different, complementary or possibly opposing viewpoints. ================= Important dates ================= * Deadline for submission of papers: Mars 21st, 2005 * Notification of acceptance/rejection: April 11th, 2005 * Deadline for receipt of camera-ready copy: Mars 18th, 2005 * Whorkshop date: June 6 or 7, 2005 ====================== Organizing committee ===================== Workshop Chairs --------------- Eva Onaindía, Technical University of Valencia, onaindia(a)dsic.upv.es Juan Fdez-Olivares, University of Granada, faro(a)decsai.ugr.es Program Committee ----------------- * Jose Luis Ambite, University of Southern California (USA) * Jim Blythe, University of Southern California (USA) * Luis Castillo, University of Granada (Spain) * Lee McCluskey, University of Huddersfield (U.K.) * Christoph Lenzen, German Space Operation Center (Germany) * Falk Mrowka, German Space Operation Center (Germany) * Angelo Oddi, ISTC-CNR (Italy) * Bernd Schattenberg, University of Ulm (Germany) * Evren Sirin, University of Maryland (USA) * Laura Sebastia, Technical University of Valencia (Spain) * Paolo Traverso, ITC/IRST (Italy) * Ioannis Vlahavas, Aristotle University of Thessaloniki (Greece)

1 0

RE: [Haskell] RE: ANNOUNCE: GHC version 6.4
by Simon Marlow 15 Mar '05

15 Mar '05

On 14 March 2005 18:08, Cale Gibbard wrote: >>> 4. It looks like Data.FiniteMap has been renamed Data.Map, or >>> something. There's no Data.Map at >>> <http://haskell.org/haddock/libraries/>, do these need to be >>> updated? >> >> The right place for library documentation is >> >> http://haskell.org/ghc/docs/latest/html/libraries >> >> I should probably make the version you're looking at into a link to >> avoid confusion. >> > > Data.Map appears to be broken from there too. I get some sort of page > with a menu as if the html file is a directory containing only the > items "HTML" and "using" both of which are broken links, and then "[an > internal server error occured]". Fixed; it turns out that Apache was trying to interpret a file with a .map extension differently. Cheers, Simon

1 0

RE: ANNOUNCE: GHC version 6.4
by Simon Marlow 15 Mar '05

15 Mar '05

On 14 March 2005 10:45, Ashley Yakeley wrote: > 1. "ghc -M" complains about multiply-defined "Main" modules. > entered as > <http://sourceforge.net/tracker/index.php?func=detail&aid=1162736&group_ i > d=8032&atid=108032> We'll look into this. A first approximation answer is "you can't do that" with the 6.4 implementation of -M. Sorry. > 4. It looks like Data.FiniteMap has been renamed Data.Map, or > something. > There's no Data.Map at <http://haskell.org/haddock/libraries/>, do > these need to be updated? The right place for library documentation is http://haskell.org/ghc/docs/latest/html/libraries I should probably make the version you're looking at into a link to avoid confusion. > 5. Apparently a bunch of stuff is in different pacakges, such as mtl. > Is > there documentation about what's in what package? Perhaps Haddock > should > show packages or something? I'm not yet familiar enough with Cabal to > know what the best way of doing this is. The contents page for the libraries lists the package name for each module. It's not ideal - it would be nice to be able to filter the contents page by package, but I haven't got around to implementing that. Cheers, Simon

4 3

Cfp : ICSM 2005 submission deadline extension
by Software Maintenance 15 Mar '05

15 Mar '05

We would like to inform you that the submission deadline for research papers for ICSM 2005, the 21st IEEE International Conference on Software Maintenance has been extended from March 21, 2005 to Sunday, April 3, 2005 - 12.00 PM. This new date will be the final deadline, so submissions after this date cannot be accepted for the reviewing process. Research papers should describe original and significant work in the research and practice of software maintenance and evolution. Case studies, empirical research, and well-designed experiments are particularly welcome. Research papers must not exceed 10 pages in final printed form. Submit to http://www.rcost.unisannio.it/~icsm2005papers by 3 April 2005. The 21st IEEE International Conference on Software Maintenance (ICSM 2005), with associated SCAM, STEP, VISSOFT, WSE and Evolvability will be held 25-30 September 2005 in Budapest, Hungary. It is the world's major international conference for software and systems maintenance, evolution, and management. We invite Research Papers, Industrial Applications, Panels, Tool Demonstrations, Dissertation Forum, and Tutorials. There will be special sections of "IEEE Transactions on Software Engineering" and "Journal of Software Maintenance and Evolution" featuring selected papers of the conference. The submission deadline for Research Papers is 3 April 2005 and for all other presentations 30 April 2005. More information including the Call for Papers is available at the conference website: http://www.inf.u-szeged.hu/icsm2005 Sincerely, Tibor Gyimothy and Vaclav Rajlich Program Co-Chairs

1 0