- Haskell - Haskell.org

ANNOUNCE: Darcs Hacking Sprint - 14-15 November Vienna
by Eric Kow 23 Sep '09

23 Sep '09

Dear Haskellers, The Darcs Team will soon be hosting its third hacking sprint. Details ------- When : 14-15 November 2009 Where: University of Technology, Vienna, Austria Who : Anybody who wants to hack on Darcs (or Camp, Focal, SO6, etc) Beginners especially welcome! Why : Darcs aims to have bi-annual hacking sprints so that we can get together on a regular basis, hold design discussions, hack up a storm and have a lot fun. What : We plan to put some finishing touches on Darcs-2.4. Darcs 2.4 is a pretty exciting release because we expect it to offer nice performance enhancements from Petr's Google Summer of Code Project, and also a nice new 'hunk splitting' feature. We also intend to set aside at least one Darcs hacker for mentoring beginners, so if you're new to Haskell or to Darcs hacking, here's a good chance to plunge in and start working on a real world project. How: Add yourself to http://wiki.darcs.net/Sprints/2009-11 or email me to let me know you're interested! Thanks ------ Thanks to our local team David Markvica and Benedikt Huber for generously offering to host this event! Thanks also to donors from the last fundraising drive. We'll be using that money to help Darcs hackers get to Vienna. Supporting Darcs ---------------- Darcs is a very happy member of the Software Freedom Conservancy. Among other things, the Software Freedom Conservancy makes it easy for open source projects to raise funds and hold assets (as part of a legal entity). For more information on supporting Darcs, see http://darcs.net/donations.html See you there! -- Eric Kow <http://www.nltg.brighton.ac.uk/home/Eric.Kow> PGP Key ID: 08AC04F9

1 0

An error using hs-plugins
by carlos gomez 22 Sep '09

22 Sep '09

Hello haskell programmers I was trying to use hs-plugins [looks interesting!!], but when I tried to execute my first example [the first of the documentation or the first of the hs-plugins paper], I got this error: Main: /tmp/MjpXp11632.o: unknown symbol `base_GHCziList_reverse_closure' Main: user error (resolvedObjs failed.) I don't know how can I fix it, can someone help me? This error happened when I tried to execute and nothing happened when i compiled. I also compiled that with the makefile provided by the library and her examples, and I got the same error. I'm using ubuntu 9.04, ghc6.10.4 and hs-plugins1.4.1 Thanks, -- Carlos Gomez

2 1

2nd CFP: TLDI 2010
by Andrew Kennedy 21 Sep '09

21 Sep '09

TLDI 2010 *** Second Call for Papers *** The Fifth ACM SIGPLAN Workshop on Types in Language Design and Implementation Madrid, Spain, January 23, 2010 (Co-located with POPL 2010) http://research.microsoft.com/~akenn/tldi2010/ Submission Deadline: 5 October 2009 The role of types and proofs in all aspects of language design, compiler construction, and software development has expanded greatly in recent years. Type systems, type-based analyses and type-theoretic deductive systems have been central to advances in compilation techniques for modern programming languages, verification of safety and security properties of programs, program transformation and optimization, and many other areas. The ACM SIGPLAN Workshop on Types in Language Design and Implementation brings researchers together to share new ideas and results concerning all aspects of types and programming, and is now an annual event. TLDI 2010 is the fifth workshop in the series and will be co-located with POPL in Madrid, Spain in January 2010. Submissions for TLDI 2010 are invited on all interactions of types with language design, implementation, and programming methodology. This includes both practical applications and theoretical aspects. TLDI 2010 specifically encourages papers from a broad field of programming language and compiler researchers, including those working on object-oriented, dynamically-typed or late-bound languages, systems programming, mobile-code or security, as well as traditional fully-static type systems. Topics of interest include: * Typed intermediate languages and type-directed compilation * Type-based language support for safety and security * Types for interoperability * Type systems for system programming languages * Type-based program analysis, transformation, and optimization * Dependent types and type-based proof assistants * Types for security protocols, concurrency, and distributed computing * Type inference and type reconstruction * Type-based specifications of data structures and program invariants * Type-based memory management * Proof-carrying code and certifying compilation * Types and objects This is not meant to be an exhaustive list; papers on novel utilizations of type information are welcome. Authors concerned about the suitability of a topic are encouraged to inquire via electronic mail to the program chair prior to submission. Submission Guidelines: Authors should submit a full paper of no more than 12 pages (including bibliography and appendices) by Monday 5th October, 2009. The submission deadline and length limitations are firm. Submissions that do not meet these guidelines will not be considered. All submissions should be in standard ACM SIGPLAN conference format: two columns, nine-point font on a ten-point baseline. Detailed formatting guidelines are available on the SIGPLAN Author Information page, along with a LaTeX class file and template. Papers must be submitted electronically via the conference website in Adobe Portable Document Format (PDF) and must be formatted for US Letter size (8.5"x11") paper. Authors for whom this is a hardship should contact the program chair before the deadline. Submitted papers must adhere to the SIGPLAN Republication Policy. Submissions should contain original research not published or submitted for publication elsewhere. Important Dates: - Submission of papers: 5 October 2009 (Monday) - Notification: 6 November 2009 (Friday) - Final versions due: 15 November 2009 (Sunday) - Workshop: 23 January 2010 (Saturday) General Chair: Andrew Kennedy, Microsoft Research, UK Program Chair: Nick Benton, Microsoft Research, UK Program Committee: Gilles Barthe, IMDEA Software, Spain Viviana Bono, University of Torino, Italy Giorgio Ghelli, University of Pisa, Italy Dan Grossman, University of Washington, USA Atsushi Igarashi, Kyoto University, Japan Conor McBride, University of Strathclyde, UK Jeremy Siek, University of Colorado at Boulder, USA Zhong Shao, Yale University, USA Matthieu Sozeau, Harvard University, USA Chris Stone, Harvey Mudd College, USA Kristian Støvring, ITU Copenhagen, Denmark Steering Committee: Amal Ahmed, Indiana University, USA Craig Chambers, University of Washington, USA Robert Harper, Carnegie Mellon University, USA (Chair) Xavier Leroy, INRIA Paris-Rocquencourt, France Greg Morrisett, Harvard University, USA George Necula, Rinera Networks and UC Berkeley, USA Atsushi Ohori, Tohoku University, Japan Francois Pottier, INRIA Paris-Rocquencourt, France Zhong Shao, Yale University, USA

1 0

ANN: darcs 2.3.1: better docs, fewer bugs
by Reinier Lamers 20 Sep '09

20 Sep '09

Dear Darcs users, The darcs team would like to announce the immediate availability of a new stable version of darcs, 2.3.1. This is a bugfix release. The user-visible changes are: * Fix bugs in optimizations in 2.3.0 * Documentation improvements * Remove autoconf build system A more complete list of changes in this and older versions of darcs can be found at http://www.darcs.net/NEWS . Installing ---------- You can obtain the source tarball at the following address: * http://darcs.net/releases/darcs-2.3.1.tar.gz The build instructions are available in the enclosed README file in those tarballs. Moreover, if you have cabal-install available, you can install latest stable release of darcs by issuing the following commands (no tarballs needed): $ cabal update $ cabal install darcs This should give you a darcs binary in `~/.cabal/bin` -- you should probably add this to your PATH. More detailed instructions for installing on Windows are available near the end of this announcement. Installing on Windows --------------------- To install darcs on Windows systems from scratch, please download the Haskell Platform and MSYS: * http://hackage.haskell.org/platform/2009.2.0.1/HaskellPlatform-2009.2.0.1- setup.exe * http://sourceforge.net/projects/mingw/files/MSYS+Base+System/MSYS-1.0.11- rc-1.exe/download After installing both, you should have an "MSYS" icon: run MSYS and in the terminal window type (the `$` character denotes the prompt, do not repeat it): $ cabal update $ cabal install darcs -f-curl This should download, compile and install all required dependencies and also darcs itself. The resulting darcs executable will be placed into the Haskell Platform executables folder, and should be accessible from the MSYS shell (just type "darcs --version" to check). Yours, Reinier.

1 0

TFM09: Call for Participation (FMWeek, Eindhoven, November 2009)
by J.N. Oliveira 20 Sep '09

20 Sep '09

TFM2009 2nd Int. FME Conference on Teaching Formal Methods Friday, November 6th 2009, co-located with FM2009 : 16th Int. Symposium on Formal Methods Eindhoven, the Netherlands, November 2 - November 6, 2009 CALL FOR PARTICIPATION (URL: http://www.di.uminho.pt/tfm09) 1. About the conference ----------------------- Ten years after the First World Formal Methods Congress (FM'99) in Toulouse, formal methods communities from all over the world will once again have an opportunity to come together. As part of the First Formal Methods Week event surrounding the FM2009 conference in Eindhoven, Formal Methods Europe will be organizing TFM2009, the Second International Conference on Teaching Formal Methods. The conference will serve as a forum to explore the successes and failures of Formal Methods (FM) education, and to promote cooperative projects to further education and training in FMs. TFM2009 will include a panel discussion on the idea of building a 'Guide to the Formal Methods Body of Knowledge' (FMBoK), inspired by similar efforts for software engineering (SWEBoK) and for project management (PMBoK); such a resource would provide guidance to teachers, managers, and developers on what should be expected from a comprehensive, balanced programme of education in FMs. 2. Invited speaker ------------------ Jeff Kramer (Imperial College London, UK) 3. Accepted papers ------------------ * Teaching Concurrency: Theory in Practice (Luca Aceto, Anna Ingolfsdottir, Kim Guldstrand Larsen, Jiri Srba) * Integrated and Tool-Supported Teaching of Testing, Debugging, and Verification (Wolfgang Ahrendt, Richard Bubel, Reiner Haehnle) * What Top-Level Software Engineers Tackle after Learning Formal Methods - Experiences from the Top SE Project (Fuyuki Ishikawa, Kenji Taguchi, Nobukazu Yoshioka, Shinichi Honiden) * Teaching program specification and verification using JML and ESC/Java2 (Erik Poll) * Chief Chefs of Z to Alloy: Using A Kitchen Example to Teach Alloy with Z (Sureyya Tarkan, Vibha Sazawal) * Teaching Formal Methods based on Rewriting Logic and Maude (Peter Olveczky) * Which Mathematics for the Information Society? (Joao Ferreira, Alexandra Mendes, Roland Backhouse, Luis Barbosa) * How to explain mistakes (Stefan Hallerstede, Michael Leuschel) * On Teaching Formal Methods: Behavior Models and Code Analysis (Jan Kofron, Ondrej Sery, Pavel Parizek) * Teaching Formal Methods for the Unconquered Territory (Nestor Catano, Camilo Rueda) 4. Sponsors -------------- * Formal Methods Europe Association (FME) * Software Improvement Group (SIG) , Amsterdam, Netherlands 5. Programme Committee ---------------------- Izzat Alsmadi (North Dakota State University, USA) Dines Bjorner (IIMM Institute, Denmark) Eerke Boiten (University of Kent, UK) Raymond Boute (Universiteit Gent, Belgium) Andrew Butterfield (Trinity College, Dublin) Jim Davies (University of Oxford, UK) David Duce (Oxford Brookes University, UK) John Fitzgerald (University of Newcastle upon Tyne, UK) Jeremy Gibbons (University of Oxford, UK) Randolph Johnson (National Security Agency, USA) Michael Mac an Airchinnigh (Trinity College, Dublin) Dino Mandrioli (Politecnico di Milano, Italy) Jose Oliveira (Universidade do Minho, Portugal) Kees Pronk (Technische Universiteit Delft, NL) Bernhard Schaetz (Tecnical University of Munique, Germany) Wolfgang Schreiner (Johannes Kepler University Linz, Austria) Simao Melo de Sousa (Universidade da Beira Interior, Portugal) Kenji Taguchi (National Institute of Informatics, Japan) Jeannette Wing (Carnegie-Mellon University, USA)

1 0

Haskell Weekly News: Issue 131 - September 19, 2009
by Joe Fredette 19 Sep '09

19 Sep '09

Hopefully the line endings come out okay this week, I did a test before sending it to the list, please let me know if you notice anything awry. Just put a [HWN] in the subject line so my filter's will catch it. </metaeditorial> --------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20090918 Issue 131 - September 18, 2009 --------------------------------------------------------------------------- Welcome to issue 131 of HWN, a newsletter covering developments in the [1]Haskell community. Last week, I received an email from Mark Wotton about his project [2]Hubris. I totally forgot to put it in the HWN last week, too busy trying to figure out all the tools. So, I thought I'd make it up and give him some special editorial status this week. Hubris is a bridge between Ruby and Haskell, allowing you to call Haskell from Ruby. It's very cool, I highly suggest playing with it. Also, I've been posting a bit about the new HWN tools (dubbed "HWN2") on my [3]blog, there is also a repo up at [4]patch-tag which will have all the code. If there is some interest in helping me, I'll try to come up with a TODO list/Trac. Announcements hssqlppp, sql parser and type checker, pre-alpha. Jake Wheat [5]announced his parser/type checker for SQL. It currently parses a subset of PostGreSQL and PL/pgSQL, and can type check some statements. LambdaINet-0.1.0, Graphical Interaction Net Evaluator for Optimal Evaluation. Paul L [6]announced a LambdaINet 0.1.0, available on [7]Hackage. LambdaINet implements an interaction net based optimal evaluator. With an interactive graphical interface allowing the user to view and directly manipulate the interaction net. arbtt-0.1. Joachim Breitner [8]announced the Automatic Rule-Based Time Tracking tool on hackage. he has an introduction available [9]here. A statistics library. Bryan O'Sullivan [10]announced the imaginatively named [11]statistics library. Which supports common discrete and continuous probability distributions, Kernel density estimation, Auto-correlation analysis, Functions over sample data, Quantile estimation, and Re-sampling techniques. CFP: JSC Special Issue on Automated Verification and Specification of Web Systems. [12]A Special Issue of the Journal of symbolic computation was announced. This issue is related to the topics of the Automated Specification and Verification of Web Systems Workshop (WWV'09). Read the announcement for more details. Haskeline 0.6.2. Judah Jacobson [13]announced the release of Haskeline 0.6.2, available [14]here. Improvements over the last version include, new emacs and vi bindings, a new preference to remove repeated history entries, recognition of page-up and page-down keys, and more. PEPM'10 - Last CFP (Submission: 6 Oct 09, Notification: 29 Oct 09). Janis Voigtlaender [15]announced the Last Call for Papers for PEPM'10, see the announcement for more details. Videos of HIW 2009. Malcolm Wallace [16]announced videos of all the presentations/discussions at the recent Haskell Implementers Workshop 2009, in Edinburgh, are now [17]online. The program of talks is available [18]here. Unification in a Commutative Monoid (cmu 1.1) and a new release of Abelian group unification and matching (agum 2.2). John D. Ramsdell [19]announced cmu 1.1, which provides unification in a commutative monoid, also know as ACU-unification. The core computation finds the minimal non-zero solutions to homogeneous linear Diophantine equations. The linear equation solver has been place in a separate module so it can be used for other applications. He also announced agum 2.2, which provides unification and matching in an Abelian group, also know as AG-unification and matching. graphviz-2999.5.1.0. Ivan Lazar Miljenovic [20]announced a bug-fix release of the GraphViz package, no major API changes occurred. levmar-0.2, bindings-levmar-0.1.1. Bas van Dijk and Roel van Dijk announced [21]new [22]versions of the levmar and bindings-levmar packages. New features include automatic calculation of the Jacobian via Conal Elliot's automatic differentiation from his vector-space library. CmdArgs - easy command line argument processing. Neil Mitchell [23]announced CmdArgs 0.1. CmdArgs is a library for parsing command-line arguments. It offers several improvements over GetOpts, namely that the Command Line Argument Processors are shorter and CmdArgs can support multiple-mode command lines such as those found in darcs, cabal, hpc, etc. OpenGL 2.4.0.1. Sven Panne [24]announced a new version of the OpenGL package, this version fixes a bug that didn't make it into the previous release. OpenGLRaw 1.1.0.0. Sven Panne [25]announced a new version of the OpenGLRaw package has been uploaded to Hackage. Discussion Thank you guys. Cristiano Paris took some time to thank us all from -Cafe for helping him learn Haskell. You're welcome, Cristiano! Unicode lexing in GHC and GHCi. Sean McLaughlin [26]asked about why certain unicode characters parsed in GHCi without error, but not in compiled code. Help with FFI. Jose Prous [27]asked for some help with the foreign function interface. Ambiguous type variable with subclass instance. Andy Gimblett [28]asked about a particular ambiguous type error Haskell -> .NET. Peter Verswyvelen [29]asked about the possibilities for a .NET version of Haskell. A thought about liberating Haskell's syntax. George Pollard [30]suggested a new way to do templates, so that brace-like syntax could be added without having to seriously hack GHC. Blog noise [31]Haskell news from the [32]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Neil Brown: [33]Concurrent Pearl: The Sort Pump. * Roman Cheplyaka: [34]CCC #6: HWN. A comic revealing the _real_ reason Brent left the HWN to me. * Don Stewart (dons): [35]Data.Binary: performance improvements for Haskell binary parsing. * Thomas M. DuBuisson: [36]Kernel Modules in Haskell. * Neil Brown: [37]Boids Simulation: Part 4. * Edward Kmett: [38]Iteratees, Parsec, and Monoids, Oh My!. * Edward Kmett: [39]Remodeling Precision. * Alex McLean: [40]Hackpact documentation (week 3). The continuation of Alex's series on Hackpact * Luke Palmer: [41]IO-free splittable supply. * Thomas M. DuBuisson: [42]Kernel Modules in Haskell. * Bryan O'Sullivan: [43]A video demo of my Haskell benchmarking framework. * Don Stewart (dons): [44]Haskell for Everyone: Hackage and the Haskell Platform : Haskell Implementers Workshop 2009. * David Sankel: [45]Applied Functional Programming: Part 1. * Neil Brown: [46]Boids Simulation: Part 4. * Darcs: [47]darcs weekly news #40. * Chris Smith: [48]On Inverses of Haskell Functions. * David Amos: [49]Finite geometries, part 1: AG(n,Fq). A multipart series from David, part of his Haskell For Maths project. Quotes of the Week * quicksilver: no, you mispelt >> as ; * dons: Cale's my alter-ego. I talk about applications and benchmarking, he talks about theory and math. We've been doing this for years :) * gwern: #haskell: because none of us are as offtopic as all of us * some-crazy-hwn-editor: A monster! HAH! It will not be a monster, but a god! ALL SHALL BOW BEFORE MY SPAWN AND DESPAIR! ALL HAIL THE PROGRAMMER CHILD! ALL HAIL THE HYPNOTOAD! * AlanJPerlis: Purely applicative languages are poorly applicable. About the Haskell Weekly News New editions are posted to [50]the Haskell mailing list as well as to [51]the Haskell Sequence and [52]Planet Haskell. [53]RSS is also available, and headlines appear on [54]haskell.org. To help create new editions of this newsletter, please see the information on [55]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [56]http://patch-tag.com/r/HWN2/home . References 1. http://haskell.org/ 2. http://github.com/mwotton/Hubris 3. http://lowlymath.net/?p=45 4. http://patch-tag.com/r/HWN2/snapshot/current/content/pretty 5. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63413 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63390 7. http://hackage.haskell.org/package/LambdaINet 8. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63369 9. https://www.joachim-breitner.de/blog/archives/336-The-Automatic-Rule-Based-… 10. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63362 11. http://hackage.haskell.org/package/statistics 12. http://article.gmane.org/gmane.comp.lang.haskell.general/17502 13. http://article.gmane.org/gmane.comp.lang.haskell.general/17497 14. http://hackage.haskell.org/package/haskeline 15. http://article.gmane.org/gmane.comp.lang.haskell.general/17496 16. http://article.gmane.org/gmane.comp.lang.haskell.general/17494 17. http://www.vimeo.com/album/126462 18. http://haskell.org/haskellwiki/HaskellImplementorsWorkshop 19. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63572 20. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63542 21. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63499 22. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63498 23. http://article.gmane.org/gmane.comp.lang.haskell.general/17493 24. http://article.gmane.org/gmane.comp.lang.haskell.general/17492 25. http://article.gmane.org/gmane.comp.lang.haskell.general/17490 26. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63580 27. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63574 28. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63545 29. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63512 30. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63492 31. http://planet.haskell.org/ 32. http://haskell.org/haskellwiki/Blog_articles 33. http://chplib.wordpress.com/2009/09/18/the-sort-pump/ 34. http://ro-che.blogspot.com/2009/09/ccc-6-hwn.html 35. http://donsbot.wordpress.com/2009/09/16/data-binary-performance-improvments… 36. http://tommd.wordpress.com/2009/09/13/kernel-modules-in-haskell/ 37. http://chplib.wordpress.com/2009/09/16/boids-simulation-part-4/ 38. http://comonad.com/reader/2009/iteratees-take-2/ 39. http://comonad.com/reader/2009/remodeling-precision/ 40. http://yaxu.org/hackpact-documentation-week-3/ 41. http://lukepalmer.wordpress.com/2009/09/14/io-free-splittable-supply/ 42. http://tommd.wordpress.com/2009/09/13/kernel-modules-in-haskell/ 43. http://www.serpentine.com/blog/2009/09/14/a-video-demo-of-my-haskell-benchm… 44. http://donsbot.wordpress.com/2009/09/14/haskell-for-everyone-hackage-and-th… 45. http://netsuperbrain.com/blog/posts/applied-functional-programming-part-1/ 46. http://chplib.wordpress.com/2009/09/14/boids-simulation-part-4/ 47. http://blog.darcs.net/2009/09/darcs-weekly-news-40.html 48. http://cdsmith.wordpress.com/2009/09/14/on-inverses-of-haskell-functions/ 49. http://haskellformaths.blogspot.com/2009/09/finite-geometries-part-1-agnfq.… 50. http://www.haskell.org/mailman/listinfo/haskell 51. http://sequence.complete.org/ 52. http://planet.haskell.org/ 53. http://sequence.complete.org/node/feed 54. http://haskell.org/ 55. http://haskell.org/haskellwiki/HWN 56. http://patch-tag.com/r/HWN2/home

1 0

Call for Papers: PLPV 2010
by Jean-Christophe Filliâtre 18 Sep '09

18 Sep '09

Call For Papers Programming Languages meets Program Verification (PLPV) 2010 http://slang.soe.ucsc.edu/plpv10/ Tuesday, January 19, 2010 Madrid, Spain Affiliated with POPL 2010 Overview: The goal of PLPV is to foster and stimulate research at the intersection of programming languages and program verification. Work in this area typically attempts to reduce the burden of program verification by taking advantage of particular semantic and/or structural properties of the programming language. One example is dependently typed programming languages, which leverage a language's type system to specify and check richer than usual specifications, possibly with programmer-provided proof terms. Another example is extended static checking systems like Spec#, which extends C# with pre- and postconditions along with a static verifier for these contracts. We invite submissions on all aspects, both theoretical and practical, of the integration of programming language and program verification technology. To encourage cross-pollination between different communities, we seek a broad the scope for PLPV. In particular, submissions may have diverse foundations for verification (type-based, Hoare-logic-based, etc), target diverse kinds of programming languages (functional, imperative, object-oriented, etc), and apply to diverse kinds of program properties (data structure invariants, security properties, temporal protocols, etc). Submissions: Submissions should fall into one of the following three categories: 1. Regular research papers that describe new work on the above or related topics. Submissions in this category have an upper limit of 12 pages, but shorter submissions are also encouraged. 2. Work-in-progress reports should describe new work that is ongoing and may not be fully completed or evaluated. Submissions in this category should be at most 6 pages in total length. 3. Proposals for challenge problems which the author believes is are useful benchmarks or important domains for language-based program verification techniques. Submissions in this category should be at most 6 pages in total length. Submissions should be prepared with SIGPLAN two-column conference format. Submitted papers must adhere to the SIGPLAN republication policy. Concurrent submissions to other workshops, conferences, journals, or similar forums of publication are not allowed. Papers should be submitted through Easychair, at http://www.easychair.org/conferences/?conf=plpv2010 Publication: Accepted papers will be published by the ACM and appear in the ACM digital library. Student Attendees: Students with accepted papers or posters are encouraged to apply for a SIGPLAN PAC grant that will help to cover travel expenses to PLPV. Details on the PAC program and the application can be found on the workshop web page. PAC also offers support for companion travel. Important Dates: * Electronic submission: October 8, 2009, 11:59pm Samoa time (UTC-11) * Notification: November 8, 2009 * Final version: November 17, 2009 * Workshop: January 19, 2010 Organizers: * Cormac Flanagan (University of California, Santa Cruz) * Jean-Christophe Filliâtre (CNRS) Program Committee: * Adam Chlipala (Harvard University) * Ranjit Jhala (University of California, San Diego) * Joseph Kiniry (University College Dublin) * Rustan Leino (Microsoft Research) * Xavier Leroy (INRIA Paris-Rocquencourt) * Conor McBride (University of Strathclyde) * Andrey Rybalchenko (Max Planck Institute for Software Systems) * Tim Sheard (Portland State University) * Stephanie Weirich (University of Pennsylvania)

1 0

ANNOUNCE: graphviz-2999.5.1.0
by Ivan Lazar Miljenovic 17 Sep '09

17 Sep '09

I'm pleased to announce version 2999.5.1.0 [1] of the graphviz library, which provides bindings to the GraphViz [2] suite of tools for drawing graphs. [1] http://hackage.haskell.org/package/graphviz-2999.5.1.0 [2] http://www.graphviz.org/ This is mainly a bug-fix release; as such, there is no API change (though if you use the graphvizWithHandle function in Data.GraphViz.Commands, you should ensure that your Handle -> IO a function closes the Handle when done). Changes in this release are: * Potentially fixed the graphvizWithHandle bug where warnings would be emitted about Handles not being closed correctly or too early; correct approach spotted by Nikolas Mayr. * Fixed up Parsing of various Attribute sub-values, especially Point and Spline (and hence Pos, which uses them). * Pre-process out comments and join together multi-line strings before parsing. * Properly parse Doubles like ".2". -- Ivan Lazar Miljenovic Ivan.Miljenovic(a)gmail.com IvanMiljenovic.wordpress.com

1 0

CFP: JSC Special Issue on Automated Verification and Specification of Web Systems
by demis＠dimi.uniud.it 16 Sep '09

16 Sep '09

[Apologies for multiple copies] ====================================================================== JOURNAL OF SYMBOLIC COMPUTATION Special Issue on Automated Specification and Verification of Web Systems http://www.risc.uni-linz.ac.at/people/tkutsia/jsc-wwv.html ====================================================================== SCOPE ----- This special issue is related to the topics of the workshop WWV'09: Automated Specification and Verification of Web Systems, which took place in Hagenberg, Austria, on July 17, 2009. Both participants of the workshop and other authors are invited to submit contributions. The increased complexity of Web sites and the explosive growth of Web-based applications has turned their design and construction into a challenging problem. Nowadays, many companies have diverted their Web sites into interactive, completely-automated, Web-based applications (such as Amazon, on-line banking, or travel agencies) with a high complexity that requires appropriate specification and verification techniques and tools. Systematic, formal approaches to the analysis and verification can address the problems of this particular domain with automated and reliable tools that also incorporate semantic aspects. We solicit original papers on symbolic methods and techniques applied to Web sites, Web services or Web-based applications, such as: * Rule-based approaches to Web systems analysis, certification, specification, verification, and optimization * Algebraic methods for verification and certification of Web systems * Formal models for describing and reasoning about Web systems * Model-checking, synthesis and debugging of Web systems * Abstract interpretation and program transformation applied to the semantic Web * Intelligent tutoring and advisory systems for Web specifications authoring * Web quality and Web metrics * Web usability and accessibility * Testing and evaluation of Web systems and applications * ... Submissions describing applications of algebraic methods and techniques are especially encouraged. SUBMISSION ---------- Submission details and requirements are available from the Web page: http://www.risc.uni-linz.ac.at/people/tkutsia/jsc-wwv.html IMPORTANT DATES --------------- * Submission of papers: November 23, 2009. * Notification of acceptance/rejection: March 22, 2010. GUEST EDITORS ------------ * Demis Ballis (University of Udine, Italy) * Temur Kutsia (RISC, Johannes Kepler University Linz, Austria)

1 0

ANNOUNCE: levmar-0.2
by Bas van Dijk 16 Sep '09

16 Sep '09

Hello, We like to announce a new release of the high-level Levenberg-Marquardt library levmar: http://hackage.haskell.org/package/levmar-0.2 Changes: * There's one new major feature: automatic calculation of the Jacobian using automatic differentiation with Conal Elliott's vector-space library. (Conal: would you like to take a quick look at the implementation and see if I'm using vector-space the way it supposed to be used, thanks) * Furthermore we made the type Model from LevMar more type-safe by replacing: type Model m r = NFunction m r [r] with: type Model m n r = NFunction m r (SizedList n r) * Finally we did lot's of internal refactorings and updated the documentation. regards, Bas and Roel van Dijk

1 0