September 2009 - Haskell

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

ANNOUNCE: bindings-levmar-0.1.1
by Roel van Dijk 16 Sep '09

16 Sep '09

I am pleased to announce the release of bindings-levmar-0.1.1: http://hackage.haskell.org/package/bindings-levmar The most important change compared to the previous version is a custom configure script (copied from hmatrix) that detects which libraries are needed. The cabal file also has some flags which allow you to choose for instance intel's mkl library instead of the normal lapack (also copied from hmatrix). Happy hacking, Roel and Bas van Dijk

1 0

ANNOUNCE: Haskeline 0.6.2
by Judah Jacobson 15 Sep '09

15 Sep '09

I am pleased to announce the release of Haskeline 0.6.2: http://hackage.haskell.org/package/haskeline (Make sure to run cabal update first to get its updated dependencies.) Haskeline provides a user interface for line input in command-line programs. The library is similar in purpose to readline or editline, but since it is written in Haskell it is (hopefully) more easily used in other Haskell programs. With this release, thanks to much appreciated feedback and suggestions from the community, Haskeline's features become more competitive with its C alternatives. Improvements include: * A multitude of new emacs and vi bindings: http://trac.haskell.org/haskeline/wiki/KeyBindings * A new preference 'historyDuplicates' to remove repeated history entries * Recognize PageUp and PageDown keys * Compatibility with ghc-6.12 * Correct width calculations for Unicode combining characters Documentation, development and mailing list information can be found at: http://trac.haskell.org/haskeline Best, -Judah

2 2

PEPM'10 - Last CFP (Submission: 6 Oct 09, Notification: 29 Oct 09)
by Janis Voigtlaender 15 Sep '09

15 Sep '09

=============================================================== CALL FOR PAPERS ACM SIGPLAN 2010 Workshop on Partial Evaluation and Program Manipulation (PEPM'10) Madrid, January 18-19, 2010 (Affiliated with POPL'10) http://www.program-transformation.org/PEPM10 =============================================================== INVITED SPEAKERS: * Lennart Augustsson (Standard Chartered Bank, UK) * Jeremy Siek (University of Colorado at Boulder, USA) IMPORTANT DATES: * Paper submission: Tue, October 6, 2009, 23:59, Apia time * Author notification: Thu, October 29, 2009 * Camera-ready papers: Mon, November 9, 2009 To facilitate smooth organization of the review process, authors are asked to submit a short abstract by October 1, 2009. SUBMISSION CATEGORIES: * Regular research papers (max. 10 pages in ACM Proceedings style) * Tool demonstration papers (max. 4 pages plus max. 6 pages appendix) TRAVEL SUPPORT: Students and other attendants in need can apply for a SIGPLAN PAC grant to help cover expenses. For details, see http://www.sigplan.org/PAC.htm. SCOPE: The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theories, tools, and applications of analysis and manipulation of programs. The 2010 PEPM workshop will be based on a broad interpretation of semantics-based program manipulation in a continued effort to expand the scope of PEPM significantly beyond the traditionally covered areas of partial evaluation and specialization and include practical applications of program transformations such as refactoring tools, and practical implementation techniques such as rule-based transformation systems. In addition, it covers manipulation and transformations of program and system representations such as structural and semantic models that occur in the context of model-driven development. In order to reach out to practitioners, there is a separate category of tool demonstration papers. Topics of interest for PEPM'10 include, but are not limited to: * Program and model manipulation techniques such as transformations driven by rules, patterns, or analyses, partial evaluation, specialization, program inversion, program composition, slicing, symbolic execution, refactoring, aspect weaving, decompilation, and obfuscation. * Program analysis techniques that are used to drive program/model manipulation such as abstract interpretation, static analysis, binding-time analysis, dynamic analysis, constraint solving, type systems, automated testing and test case generation. * Analysis and transformation for programs/models with advanced features such as objects, generics, ownership types, aspects, reflection, XML type systems, component frameworks, and middleware. * Techniques that treat programs/models as data objects including meta-programming, generative programming, deep embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Application of the above techniques including experimental studies, engineering needed for scalability, and benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, resource-limited computation, and security. We especially encourage papers that break new ground including descriptions of how program/model manipulation tools can be integrated into realistic software development processes, descriptions of robust tools capable of effectively handling realistic applications, and new areas of application such as rapidly evolving systems, distributed and web-based programming including middleware manipulation, model-driven development, and on-the-fly program adaptation driven by run-time or statistical analysis. PROCEEDINGS: There will be formal proceedings published by ACM Press. In addition to printed proceedings, accepted papers will be included in the ACM Digital Library. Selected papers may later on be invited for a journal special issue dedicated to PEPM'10. SUBMISSION GUIDELINES: Papers should be submitted electronically via the workshop web site. Regular research papers must not exceed 10 pages in ACM Proceedings style. Tool demonstration papers must not exceed 4 pages in ACM Proceedings style, and authors will be expected to present a live demonstration of the described tool at the workshop (tool papers should include an additional appendix of up to 6 extra pages giving the outline, screenshots, examples, etc. to indicate the content of the proposed live demo at the workshop). Authors using Latex to prepare their submissions should use the new improved SIGPLAN proceedings style (sigplanconf.cls, 9pt template). PROGRAM CO-CHAIRS: * John Gallagher (Roskilde University, Denmark, and IMDEA Software, Spain) * Janis Voigtländer (Technische Universität Dresden, Germany) PROGRAM COMMITTEE MEMBERS: * Wei-Ngan Chin (National University of Singapore, Singapore) * Michael Codish (Ben-Gurion University of the Negev, Israel) * Jim Cordy (Queen's University, Canada) * Nate Foster (University of Pennsylvania, USA) * Haifeng Guo (University of Nebraska at Omaha, USA) * Patricia Johann (University of Strathclyde, UK) * Oleg Kiselyov (FNMOC, USA) * Günter Kniesel (University of Bonn, Germany) * Viktor Kuncak (Ecole Polytechnique Fédérale de Lausanne, Switzerland) * Yanhong Annie Liu (State University of New York at Stony Brook, USA) * Andres Löh (Utrecht University, Netherlands) * Jan Midtgaard (Roskilde University, Denmark) * David Monniaux (National Center for Scientific Research (CNRS) and VERIMAG laboratory, France) * Akimasa Morihata (University of Tokyo, Japan) * Alberto Pettorossi (Università di Roma Tor Vergata, Italy) * João Saraiva (Universidade do Minho, Portugal) * Ganesh Sittampalam (Credit Suisse, UK) * Fausto Spoto (Università di Verona, Italy) * Harald Søndergaard (University of Melbourne, Australia) * Walid Taha (Rice University, USA)

1 0

Videos of HIW 2009
by Malcolm Wallace 14 Sep '09

14 Sep '09

Videos of all the presentations/discussions at the recent Haskell Implementers Workshop 2009, in Edinburgh, are now online. http://www.vimeo.com/album/126462 The programme of talks (which does not mention some of the on-the-day 5minute slots) is here: http://haskell.org/haskellwiki/HaskellImplementorsWorkshop Regards, Malcolm

2 1

ANN: CmdArgs - easy command line argument processing
by Neil Mitchell 14 Sep '09

14 Sep '09

Hi, I am pleased to announce CmdArgs v0.1. CmdArgs is a library for easy command line argument processing - taking the arguments passed into your program from getArgs and converting them into a structured value for use in your program. Compared to the System.Console.GetOpts library there are two key advantages: 1) The command line argument processors are shorter - in a typical case they are about 1/3 the size, 90 lines with getopts vs 30 simpler lines with CmdArgs (for HLint). 2) CmdArgs can support multiple mode command lines, such as those found in hpc, darcs and cabal. The guiding principle of CmdArgs is to try and write each piece of information only once, which makes the command line processing shorter, and eliminates many of the accidental copy-and-paste style bugs that are easy with getopts. CmdArgs requires GHC, but other than this restriction, I do not foresee any reason for anyone to use getopts over CmdArgs. To install use the standard cabal magic: cabal update && cabal install cmdargs Useful links Home page: http://community.haskell.org/~ndm/cmdargs/ Manual: http://community.haskell.org/~ndm/darcs/cmdargs/cmdargs.htm Haddock: http://hackage.haskell.org/packages/archive/cmdargs/latest/doc/html/System-… If you want to start using CmdArgs I recommend reading through the manual, and referring to the haddock documentation as necessary. I welcome any comments and bug reports. Thanks, Neil

1 0

ANNOUNCE: OpenGL 2.4.0.1
by Sven Panne 13 Sep '09

13 Sep '09

A new version of the OpenGL package has been uploaded to Hackage. * Fixed maxTextureUnit query. This change didn't make it in the last release... :-( Cheers, S.

1 0