- Haskell - Haskell.org

ANN: Blobs diagram editor
by Malcolm Wallace 17 Nov '05

17 Nov '05

Blobs diagram editor -------------------- We are pleased to announce the official launch of the 'Blobs' diagram editor project. http://haskell.org/Blobs Many people will already have seen the 'Dazzle' application presented in a paper at the Haskell Workshop in Tallinn in October 2005. Lots of you wanted the source code to play with, but unfortunately the Bayesian analysis algorithms in Dazzle are proprietary, so Dazzle is available only as a precompiled binary. However, the authors of Dazzle, Arjan van IJzendoorn and Martijn Schrage, have separated out the diagram editor front-end of their application, and made it freely available to the community. The basic editing functionality has since been extended and improved, and now we are throwing open the project to all potential contributors. A diagram editor is a basic part of many different applications, and we would like to see Blobs become a standard shared component that allows different applications to share improvements to the GUI, whilst retaining separate back-end algorithms that operate on the underlying graph data structures. The design of Blobs is therefore open to any change which would improve its generality and suitability for multiple re-targeting. The code is made available in a darcs repository, and is licensed like the wxWidgets toolkit on which it is based (i.e. LGPL, with a special exemption permitting binary-only redistribution.) There is a new mailing list for contributors and users of Blobs: http://haskell.org/mailman/listinfo/blobs Regards, Malcolm

1 0

Making Haskell more open
by Simon Peyton-Jones 16 Nov '05

16 Nov '05

Dear Haskell folk One thing that hit me forcibly during ICFP in Tallinn, and the associated workshops, is that the Haskell community may not be as good as (say) the Perl community at engaging and involving the people "in the trenches" [PRL]. Haskell.org is centrally maintained by a couple of (excellent) people; GHC is still over-dependent on Simon and me; we don't yet have a good central site for offering libraries; and so on. Things are changing. For example: - The bi-annual Haskell Communities and Activities Report is well established [HCAR] - The Haskell Wiki [WIKI] and the Haskell IRC channel [IRC] are thriving - The MonadReader [MR], the Haskell Sequence [HS], and Haskell Weekly News [HWN] are acting as great community glue - [This isn't new, but people often remark how friendly the Haskell mailings lists are.] On the implementation front: - Lots of people are working on libraries (though much remains to be done) - Work on libraries should become much easier once Cabal and Hackage [CAB] become well established - Work is afoot to move GHC's source-code repository to Darcs, to make it easier for people to contribute patches However, I still wonder if there are things we could do that would make it easier for people to contribute. Here are two concrete suggestions: - Make it possible for people to add comments, explanations, or questions to * The GHC user manual [currently generated using DocBook] * The Haskell 98 Report The idea would be that anyone could help improve these documents, and that, at least in the case of the GHC user manual, we could use the comments to help clarify the text. Some other systems do this e.g. MySql [MySQL] and PostgreSQL [PSQL] do this (the links are to random pages showing comments). One possibility: create a tree of wiki pages mirroring structure of the manual, with links from latter to the former. Issues include: propagating comments forward to following changes to the manual. But basically we have no clue about the best way to do this. - Make the entire haskell.org site into a Wiki, so that everyone can contribute news items, instructional material (Wikibooks?), comments, discussion groups, tools, etc. John and Olaf do a great job of updating haskell.org, but there is a real limit on what a couple of individuals can do in their spare time. Does anyone have experience of a larger-scale Wiki like this? (A few people have mentioned MediaWiki to me [MW], but I know nothing about it.) How would we make sure it stayed organised? And avoid getting screwed up by malicious folk? The important thing is that these mechanisms should work without any central intervention. These are just two suggestions. Perhaps there are other such mechanisms that we could put in place. Ideas? Many of you will know much more about this kind of thing than I do. Share your wisdom with the mailing list. Lastly, when it comes down to it, none of these things will happen unless some people volunteer to push them forward. Would any of you like to contribute your time and expertise? Simon [PRL] http://perl.com, http://www.perlmonks.org [HCAR] http://www.haskell.org/communities/ [WIKI] http://haskell.org/hawiki [IRC] http://haskell.org/hawiki/HaskellIrcChannel [MR] http://haskell.org/hawiki/TheMonadReader [HS] http://sequence.complete.org/ [HWN] http://sequence.complete.org/hwn [CAB] http://www.haskell.org/cabal/ [MW] http://www.mediawiki.org/wiki/MediaWiki [MSQL] http://dev.mysql.com/doc/refman/5.0/en/upgrading-from-4-1.html (see bottom of page) [PSQL] http://www.postgresql.org/docs/7.4/interactive/installation.html

15 29

The Haskell mailing list
by Simon Peyton-Jones 16 Nov '05

16 Nov '05

Folks Can anyone remember when the Haskell mailing list first opened? Does anyone have an archive that goes right back to the beginning? Simon

4 3

MPC 2006 First Call for Papers
by Tarmo Uustalu 16 Nov '05

16 Nov '05

FIRST CALL FOR PAPERS 8th International Conference on Mathematics of Program Construction MPC '06 colocated with AMAST '06 Kuressaare, Estonia, 3-5 July 2006 http://cs.ioc.ee/mpc-amast06/mpc/ Background The biennial MPC conferences aim to promote the development of mathematical principles and techniques that are demonstrably useful and usable in the process of constructing computer programs. Topics of interest range from algorithmics to support for program construction in programming languages and systems. The previous conferences were held in Twente, The Netherlands (1989), Oxford, UK (1992), Kloster Irsee, Germany (1995), Marstrand, Sweden (1998), Ponte de Lima, Portugal (2000), Dagstuhl, Germany (2002) and Stirling, UK (2004, colocated with AMAST '04). The 2006 conference will be held at Kuressaare, Estonia, colocated with AMAST '06. Invited speakers To be announced. Important dates * Submission of abstracts: 27 January 2006 * Submission of full papers: 3 February 2006 * Notification of authors: 17 March 2006 * Camera-ready version: 14 April 2006 Submission Submission is in two stages. Abstracts (plain text) must be submitted by 27 January 2006. Full papers (pdf) adhering to the llncs style must be submitted by 3 February 2006. The web-based submission system will open in early December 2005. Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Accepted papers must be presented at the conference by one of the authors. The proceedings of MPC '06 will be published in the Lecture Notes in Computer Science series of Springer-Verlag. After the conference, the authors of the best papers will be invited to submit revised versions to a special issue of the Science of Computer Programming journal of Elsevier. Programme committee Tarmo Uustalu, Inst. of Cybernetics, Tallinn (chair) Roland Backhouse, Univ. of Nottingham Eerke Boiten, Univ. of Kent Venanzio Capretta, Univ. of Ottawa Sharon Curtis, Oxford Brookes Univ. Jules Desharnais, Univ. de Laval Jeremy Gibbons, Univ. of Oxford Lindsay Groves, Victoria Univ. of Wellington Ian Hayes, Univ. of Queensland William Harrison, Univ. of Missouri Johan Jeuring, Universiteit Utrecht Dexter Kozen, Cornell Univ. Christian Lengauer, Univ. Passau Lambert Meertens, Kestrel Inst. Bernhard Möller, Univ. Augsburg Shin-Cheng Mu, Univ. of Tokyo José Oliveira, Univ. do Minho Alberto Pardo, Univ. de la República Ross Paterson, City Univ. London Ingrid Rewitzky, Univ. of of Stellenbosch Varmo Vene, Univ. of Tartu Venue Kuressaare (pop. 16000) is the main town on Saaremaa, the second-largest island of the Baltic Sea. Kuressaare is a charming seaside resort on the shores of the Gulf of Riga highly popular with Estonians as well as visitors to Estonia. The scientific sessions of MPC/AMAST 2006 will take place at Saaremaa Spa Hotel Meri, one among the several new spa hotels in the town. The social events will involve a number of sites, including the 14th-century episcopal castle. Accommodation will be at Saaremaa Spa Hotels Meri and Rüütli. To get to Kuressaare and away, one must pass through Tallinn (pop. 402000), Estonia's capital city. Tallinn is famous for its picturesque medieval Old Town, inscribed on UNESCO's World Heritage List. Local organizers MPC/AMAST 2006 is organized by Institute of Cybernetics, a research institute of Tallinn Univ. of Technology. The local organizers are Tarmo Uustalu (chair), Monika Perkmann, Juhan Ernits, Ando Saabas, Olha Shkaravska, Kristi Uustalu. Contact email address: mpc06(at)cs.ioc.ee.

1 0

CFP: M4M-4 Program and Call for Participation
by Holger Schlingloff 16 Nov '05

16 Nov '05

Apologies if you recieve this call for participation more than once. Methods for Modalities - CALL FOR PARTICIPATION The workshop "Methods for Modalities" (M4M) aims to bring together researchers interested in developing algorithms, verification methods and tools based on modal logic. Here the term "modal logics" is conceived broadly, including description logic, guarded fragments, conditional logic, temporal and hybrid logic, etc. This year's M4M will take place in Berlin - Adlershof, Germany. It is hosted by FIRST, the Fraunhofer Institute of Computer Architecture and Software Technology, in collaboration with the computer science institute of Humboldt University. The workshop dates are December 1st and 2nd, 2005. THIS IS IN TWO WEEKS! The conference fee of 160 Euros includes the excursion with conference dinner, which will take us at Dec 1st onto a beautiful boat cruising the illuminated nightly waterways of Germany's capital. Registration is now open at http://m4m.loria.fr/M4M4/workshop.html To encourage broad participation of young researchers, posters and system demos are still accepted for presentation. For more information, see the conference web site. See you in Berlin! The Methods For Modalities Organization Team. __________________________________________________________________ The following people have agreed to give invited lectures: François Laroussinie, ENS Cachan and CNRS. Title: Timed Modal Logics for the Verification of Real-Time Systems. Martin Lange, Ludwig-Maximilians-Universität. Title: Temporal Logics for Non-Regular Properties Wim Martens, Hasselt University. Title: The Typechecking Problem for XML Transformations. Boris Motik, Universität Karlsruhe. Title: Description Logics and Disjunctive Datalog - More Than just a Fleeting Resemblance?. Boris Konev, University of Liverpool. Title: Theory and Practice of Theorem Proving for Monodic First-Order Temporal Logic. Uwe Scheffler, Humboldt Universität. Title: Vague is Modal and Predicate Modifying. __________________________________________________________________ The following is the list of accepted papers: Franz Baader, Carsten Lutz and Boontawee Suntisrivaraporn: Is Tractable Reasoning in Extensions of the Description Logic EL Useful in Practice? Thomas Bolander and Torben Braüner: Two Tableau-Based Decision Procedures for Hybrid Logic Davide Bresolin and Angelo Montanari: A tableau-based decision procedure for a branching-time interval temporal logic Yegor Bryukhov: Automatic proof search in logic of justified common knowledge Mika Cohen and Mads Dam: A Completeness Result for BAN Logic Massimo Franceschet and Enrico Zimuel: Modal logic and navigational XPath: an experimental comparison Regis Gascon: Verifying qualitative and quantitative properties with LTL over concrete domains Laura Giordano, Valentina Gliozzi, Nicola Olivetti and Camilla Schwind: Extensions of Tableau calculi for preference-based conditional logics Johan W. Klüwer and Arild Waaler: Natural deduction for belief "at most" Mathis Kretz, Gerhard Jäger and Thomas Studer: Cut-free axiomatizations for stratified modal fixed point logic Martin Mundhenk, Thomas Schneider, Thomas Schwentick and Volker Weber: Complexity of Hybrid Logics over Transitive Frames Nicola Olivetti and Gian Luca Pozzato: KLMLean 1.0, a Theorem Prover for Logics of Default Reasoning Evangelos Tzanis: Hybrid Logic with operations on nominals Wouter van Atteveldt and Stefan Schlobach: A Modal View on Polder Politics Dirk Walther: ATEL with Common and Distributed Knowledge is ExpTime-Complete Evgeny Zolin: Query answering based on modal correspondence theory __________________________________________________________________

1 0

RE: [Haskell] [ANNOUNCE] yhc - York Haskell Compiler
by Simon Marlow 16 Nov '05

16 Nov '05

On 15 November 2005 10:37, Lennart Augustsson wrote: > Simon Peyton-Jones wrote: >>> I am aware of some experiments with alternative back-ends for ghc, >>> but I don't know of any work on a ghc back-end generating portable >>> bytecode. A few years ago some work was done towards a ghc-hugs >>> fusion, but in the end hugs remained separate and the ghc people >>> developed ghci. Perhaps ghc and/or hugs developers can comment >>> further? >> >> GHCi does indeed generate byte code, but we have never gotten around >> to trying to dump it into files and reload it. That might be an >> interesting project -- but it only gives a constant performance >> factor over loading the source files in the first place, so it's not >> clear that it's a major win. > > The major win with having the byte code in a file is that you could > have a stand alone byte code interpreter (and runtime system). > That would make bootstrapping GHC a much less daunting task. This would be nice, but for a couple of reasons it isn't entirely straightforward to do. - our byte code doesn't include primitives, because we rely on the base package always being compiled. If we were to interpret the base package, then we have to implement 200+ primitives in the byte code. Maybe we could cleverly map them to FFI calls and auto-generate the C implementations, or something. - to get portable byte code, the original Haskell code has to be platform-independent. Lots of Haskell code in GHC and the base package has #ifdefs. There was a thread a few months back on glasgow-haskell-users in which we counted the #ifdefs with a view to improving portability, you might want to look it up. The upshot was that the vast majority of #ifdefs were Windows-vs-Unix, so restricting portability to just Unix would be much easier than complete platform-independence. Cheers, Simon

1 0

Making Haskell more open
by Victor Blomqvist 15 Nov '05

15 Nov '05

"Tomasz Zielonka" <tomasz.zielonka at gmail.com> writes: > On Fri, Nov 11, 2005 at 03:12:40PM +0000, Duncan Coutts wrote: >> I would tend to disagree. I think the combination of the mailing lists, >> a wiki and the IRC channel cover most of our communication needs. > > Personally I prefer to use mailing lists, but they have one disadvantage > - if you don't set up filters to split incoming mail into multiple > folders, you can be flooded with messages. > >> I don't think that yet another variant would help us much. Web boards >> tend to be harder to use than email since it requires a web browser. >> Having too many differnt types of communication channel would reduce the >> readership of any one of them. "...most of our communication needs" Yes, I can agree on that, everyone here are obviosly happy (more or less) with the mailinglists, and also I agree that a forum would not be of any use if it was only me there. :) But I think that especially outside the *nix/academic world, most people like web forums better than mailing lists. Actually, I heard the same arguments when disucssing webforum vs news at my institution, most old *nix-hackers prefered the news, and newer (non *nix-hacker) students liked web forum better. Just recently a forum was opened, but I wasn't active in the news at the time so I don't know what tipped it over. But I definatly think it will be more used than the news system once everything is moved there. My suggestion was aimed outside the haskell community of today, even if I now see that some of the other points in Simons message was more about how to get the users already here contribute more and better. For example, a very large part of the users that answered Johns survey had connections to the academic world (37% Students and 29% Working in a university) and from my experience, those intrested in programming languages are also more used to mailing lists than the rest of the group (at least at my university). But maybe the rest (such Algorithm or Human Interaction students) is not intrested in Haskell anyway, so theres no point with a forum.. > > How about a forum integrated with mailing lists? An integrated forum is not a bad idea. As we all agree, it is not a good idea to split the readers in 2 and I don't think its possible to get you all to switch over at once ;) Or just a link to gmane/google/whatever where its possible to read the mailinglist in a good way from your web browser if such a thing already exists. But as it is now, at least I have trouble browsing the archive compared to forums I visit. /vb

3 2

RE: [Haskell] [ANNOUNCE] yhc - York Haskell Compiler
by Simon Peyton-Jones 15 Nov '05

15 Nov '05

| I am aware of some experiments with alternative back-ends for ghc, but I | don't know of any work on a ghc back-end generating portable bytecode. | A few years ago some work was done towards a ghc-hugs fusion, but in the | end hugs remained separate and the ghc people developed ghci. Perhaps | ghc and/or hugs developers can comment further? GHCi does indeed generate byte code, but we have never gotten around to trying to dump it into files and reload it. That might be an interesting project -- but it only gives a constant performance factor over loading the source files in the first place, so it's not clear that it's a major win. GHC is available now as a Haskell library (just say "import GHC"). The idea is to make it possible for people to import GHC, use it to parse and typecheck the program, and then process the result in whatever way they want. The interface is still evolving, but that evolution will be strongly guided by what people want. It's in the HEAD only at the moment, not any released compiler, but I do encourage interested parties to give it a whirl. | So far as debugging back-ends for ghc are concerned, Robert Ennals and | Simon PJ did a stop-and-look style debugger using speculative evaluation | which perhaps is still distributed? It's still available in Rob's CVS branch, but definitely not supported. The entire speculative evaluation thing was tremendously interesting and provocative, but it was just a bit too complicated to fold into the main GHC head. As Simon mentioned, though, another thing we'd like to see done is to modify GHCi so that it always does cost-centre profiling. That way, every thunk would record who built it, and that would give quite a powerful jumping off point for building a quick-and-dirty debugger. There'd be a perf cost, but the effect would be muffled by the fact that GHCi is an interpreter anyway. Anyone? Simon

2 1

PSI 2006: 2nd CFP
by PSI06 Conference 15 Nov '05

15 Nov '05

************************************************** <our apologies for cross-posting> ************************************************** SECOND CALL FOR PAPERS Sixth International Andrei Ershov Memorial Conference PERSPECTIVES OF SYSTEM INFORMATICS 27-30 June 2006, Novosibirsk, Akademgorodok, Russia http://www.iis.nsk.su/PSI06 [AIMS AND SCOPE] The conference is held to honor the 75th anniversary of academician Andrei Ershov (1931-1988) and his outstanding contributions towards advancing informatics. The first five conferences were held in 1991, 1996, 1999, 2001 and 2003, respectively, and proved to be significant international events. Andrei Ershov was one of the early Russian pioneers in the field of the theory of programming and systems programming, a founder of the Siberian Computer Science School. In 1974 he was nominated as a Distinguished Fellow of the British Computer Society. In 1981 he received the Silver Core Award for services rendered to IFIP. Andrei Ershov's brilliant speeches were always in the focus of public attention. Especially notable was his lecture on "Aesthetic and human factor in programming" presented at the AFIPS Spring Joint Computer Conference in 1972. Andrei Ershov was not only an extremely gifted scientist, teacher and fighter for his ideas, but also a bright and many-sided personality. He wrote poetry, translated the works of R. Kipling and other English poets, and enjoyed playing guitar and singing. Everyone who had the pleasure of knowing Andrei Ershov and working with him will always remember his great vision, eminent achievements, and generous friendship. The aim of the conference is to provide a forum for the presentation and in-depth discussion of advanced research directions in computer science. For a developing science, it is important to work out consolidating ideas, concepts and models. Movement in this direction is another aim of the conference. Improvement of the contacts and exchange of ideas between researchers from the East and West are further goals. [CONFERENCE CHAIR] Alexander Marchuk A. P. Ershov Institute of Informatics Systems Novosibirsk, Russia [STEERING COMMITTEE] Dines Bjorner Institute of Informatics and Mathematical Modelling Denmark Manfred Broy Institut fur Informatik Technische Universitat Munchen Germany Alexandre Zamulin A. P. Ershov Institute of Informatics Systems Novosibirsk, Russia [PROGRAM COMMITTEE CO-CHAIRS] Irina Virbitskaite A. P. Ershov Institute of Informatics Systems Novosibirsk, Russia Andrey Voronkov Microsoft Research Redmond, USA [CONFERENCE SECRETARY] Natalia Cheremnykh A. P. Ershov Institute of Informatics Systems 6, Acad. Lavrentjev pr. 630090 Novosibirsk, Russia tel.: +7-383-3307352 fax: +7-383-3323494 e-mail: psi06(a)iis.nsk.su [CONFERENCE TOPICS] Conference topics include: 1. Foundations of Program and System Development and Analysis - specification, validation, and verification techniques, - program analysis, transformation and synthesis, - semantics, logic and formal models of programs, - partial evaluation, mixed computation, abstract interpretation, compiler construction, - theorem proving and model checking, - concurrency theory, - modeling and analysis of real-time and hybrid systems, - computer models and algorithms for bioinformatics. 2. Programming Methodology and Software Engineering - object-oriented, aspect-oriented, component-based and generic programming, - programming by contract, - program and system construction for parallel and distributed computing, - constraint programming, - multi-agent technology, - system re-engineering and reuse, - integrated programming environments, - software architectures, - software development and testing, - model-driven system/software development, - agile software development, - tools for software engineering, - program understanding and visualization. 3. Information Technologies - data models, - database and information systems, - knowledge-based systems and knowledge engineering, - ontologies and semantic Web, - digital libraries, collections and archives, Web publishing, - peer-to-peer data management. In addition to papers in the above list of topics, papers both bridging the gap between different directions and promoting mutual understanding of researchers are welcome. Papers defining the general prospects in Computer Science are also encouraged. [PROGRAM COMMITTEE MEMBERS] Scott W. Ambler, Ambysoft Inc., Toronto, Canada Egidio Astesiano, Univ. Genova, Italy Janis Barzdins, Univ. Latvia, Riga, Latvia Frederic Benhamou, Univ. Nantes, France Stefan Brass, Univ. Halle, Germany Ed Brinksma, Univ. Twente, The Netherlands Kim Bruce, Pomona College, California, USA Mikhail Bulyonkov, IIS SB RAS, Novosibirsk, Russia Albertas Caplinskas, IMI, Vilnius, Lithuania Sung-Deok Cha, KAIST, Taejon, South Korea Gabriel Ciobanu, Inst. Comp. Sc. RA, Iasi, Romania Paul C. Clements, Carnegie-Mellon Univ., USA Miklos Csuroes, Univ. Montreal, Canada Serge Demeyer, Univ. of Antwerp, Belgium Alexander Dikovsky, Univ. Nantes, France Javier Esparza, Univ. Stuttgart, Germany Jean Claude Fernandez, Univ. J. Fourier, Grenoble, France Chris George, UNU/ IIST, Macau Ivan Golosov, Intel, Novosibirsk, Russia Jan Friso Groote, Eindhoven Univ. of Technology, The Netherlands Alan Hartman, IBM Haifa Research Lab., Israel Victor Ivannikov, IPS RAS, Moscow, Russia Victor Kasyanov, IIS SB RAS, Novosibirsk, Russia Joost-Pieter Katoen, RWTH Aachen Univ., Germany Alexander Kleschev, IACP RAS, Vladivostok, Russia Nikolay Kolchanov, ICiG, Novosibirsk,, Russia Gregory Kucherov, INRIA/LORIA, Nancy, France Johan Lilius, Abo Akademi Iniv. Turku, Finland Dominique Mery, Univ. Henri Poincare, Nancy, France Torben Mogensen, Univ. Copenhagen, Denmark Bernhard Moeller, Univ. Augsburg, Germany Hanspeter Moessenboeck, JK Univ. Linz, Austria Peter Mosses, Univ. Wales, Swansea, UK Ron Morrison, St Andrews Univ., UK Peter Mueller, ETH Zurich, Switzerland Fedor Murzin, IIS SB RAS, Novosibirsk, Russia Valery Nepomniaschy, IIS SB RAS, Russia Nikolaj Nikitchenko, Nat. Univ. Kiev, Ukraine Jose R. Parama, Univ. A Coruna, Spain Francesco Parisi-Presicce, GM Univ., Virginia, USA Wojciech Penczek, Inst. Comp. Sci., Warsaw, Poland Jaan Penjam, Tallinn Tech. Univ., Estonia Peter Pepper, Tech. Univ. Berlin, Germany Alexander Petrenko, IPS RAS, Moscow, Russia Jaroslav Pokorny, Charles U., Prague, Czech Republic Wolfgang Reisig, Tech. Univ. Berlin, Germany Viktor Sabelfeld, Univ. Karlsruhe, Germany Timos Sellis, Nation. Tech. Univ. Athens, Greece Alexander Semenov, Intel, Novosibirsk, Russia Klaus-Dieter Schewe, Massey Univ, PN, New Zealand David Schmidt, Kansas State Univ., Manhattan, USA Sibylle Schupp, Chalmers Univ. Tech., Sweden Nikolay Shilov, IIS SB RAS, Novosibirsk, Russia Alexander Tomilin, IPS RAS, Moscow, Russia Enn Tyugu, Inst. Cybernetics, Tallinn, Estonia Alexander L. Wolf, Univ. Colorado at Boulder, USA Tatyana Yakhno, Dokuz Eylul Univ., Izmir, Turkey Wang Yi, Uppsala Univ., Sweden [INVITED SPEAKERS] 1. Amir Pnueli (Weizmann Inst. Science, Rehovot, Israel) 2. Eike Best (Univ. Oldenburg, Germany) 3. Robert Harper (Carnegie Mellon Univ., Pittsburgh, USA) 4. Rustan Leino (Microsoft Research, Redmond, USA) 5. Alexander Letichevsky (Inst. Cybernetics, Kiev, Ukraine) 6. Gordon Plotkin (Univ. Edinburgh, UK (unconfirmed)) [LOCATION] The conference will be held in Akademgorodok (Academy town), 30 km South from Novosibirsk, the largest city of Siberia. Akademgorodok is located in a picturesque place near the Ob lake. It is surrounded with birch and pine forests and pleasant not only for work but for recreation as well. Silence, beautiful landscape, and pure air are the factors promoting scientific activity and creativity. [SUBMISSIONS] Submissions for extended abstracts must: - Contain original contributions that have not been published or submitted to other conferences/journals in parallel with this conference. - Clearly state the problem being addressed, the goal of the work, the results achieved, and the relation to other work. - Be in PS or PDF and formatted according to Springer LNCS Information for Authors: http://www.springeronline.com - Have a length that does not exceed 10 pages for a regular talk and 5 pages for a short talk. - Be in English and in a form that can be immediately included in the proceedings without major revision. - Be sent electronically (as a PostScript or PDF file) using website http://www.easychair.org/PSI2006/submit/ not later than January 23, 2006 [CONFERENCE PROCEEDINGS] A book of extended abstracts of invited and accepted talks will be available at the conference. The full versions of the papers presented at the conference (roughly, 14 pages long for a regular talk and 7 pages long for a short talk) will be published by Springer-Verlag in the Lecture Notes in Computer Science series after the conference. One can find the proceedings of the previous four conferences in LNCS, Vol. 1181, 1755, 2244 and 2890, respectively. A report on the previous conference can be found in EATCS Bulletin, No 81 (2003) 267-271, and also at the conference site: www.iis.nsk.su/PSI03/ [TRAVELLING] You can fly to Novosibirsk via Moscow by Aeroflot, Transaero or S7. Direct S7 flights will bring you from Frankfurt, Hannover, Tel-Aviv or Beijing to Novosibirsk and back. All participants will be met at the Novosibirsk airport and brought to Akademgorodok by a special transport. [WEATHER] The weather in Novosibirsk at the end of June is normally quite warm and sunny with the temperatures in the range of 25-30 C. Night swimming in the Ob lake is guaranteed. [SATELLITE WORKSHOPS] Additionally the following workshops will be satellite events of PSI06: - Educational Informatics (the workshop page is http://www.iis.nsk.su/psi06/education/index_e.shtml) - Program Understanding which will be held in Altai mountains (the workshop page is http://www.iis.nsk.su/psi06/p_understanding/index_e.shtml) [IMPORTANT DATES] January 23, 2006: submission deadline of extended abstracts April 7, 2006: notification of acceptance June 27-30, 2006: the conference dates September 1, 2006: final papers due

1 0

formal verification for functional programming languages
by Wolfgang Jeltsch 14 Nov '05

14 Nov '05

Hello, where can I find information about formal verification techniques and tools for functional programming languages? Both introductionary texts and current research papers etc. are welcome. Best wishes, Wolfgang

6 6