- Haskell - Haskell.org

ANNOUNCE: Turbinado V0.6
by Alson Kemp 13 Mar '09

13 Mar '09

Turbinado (http://www.turbinado.org) is a Rails-ish Model-View-Controller web serving framework for Haskell. It's in heavy development, is making excellent progress and is designed to make building websites in Haskell a joy. It’s been long enough since Turbinado V0.4 that I figured I’d skip V0.5 and go straight to announcing Turbinado V0.6. Lots of new excellent features: * By popular demand, support for CGI serving. Apparently some web hosts don’t support HTTP proxying, so some folks requested CGI support. * Statically compiled Layouts, Views, Controllers (to complement dynamic loading). * Support for “.format” in routes. If a request path is “/User/List.xml”, then the following View will be called: /App/Views/User/ListXml.hs. * Lower case paths. * Support for cookies (see here for examples). * Encrypted cookie sessions (see here to see how to use them). * Much easier installs using cabal-install. * Support for GHC 6.10. GHC 6.8 is no longer supported. Turbinado V0.7 will be all about: * Documentation. (seriously.) * User authentication. * Tutorials.

1 0

Call for papers: Workshop on Termination (WST 2009)
by Johannes Waldmann 12 Mar '09

12 Mar '09

Dear all, the 10th Intl. Workshop on Termination welcomes contributions from the functional programming community. See the general call for papers below, and let me add a few words here. The typical functional (compiler) programmer needs - termination of programs - termination of program transformations (rules) - termination of program analysis (type checking/inference) So I'm sure the workshop topic is highly relevant, and we are looking for *your* contributions. Also, we have an annual competition for automated termination provers, http://termination-portal.org/wiki/Termination_Competition and since 2007 it contains a Haskell category. The problems there are taken directly from the Standard Prelude. So if you have some kind of Haskell source code analyzer that knows something about termination (perhaps only internally), then you're welcome turn it into a Haskell termination prover and submit it to this competition. (Details will be discussed at the workshop.) Best regards, Johannes Waldmann. ..................................................................... Tenth International Workshop on Termination (WST 2009) Leipzig, Germany, June 3-5, 2009 http://www.imn.htwk-leipzig.de/wst09/ Termination is a fundamental topic in computer science. Classical undecidability results show that termination is difficult. On the other hand, programs are usually required to terminate. So methods are needed that prove termination and non-termination automatically for a wide range of programs. Termination proofs are essential not only for program verification, but also as components of program transformation systems. The topic is challenging both in theory (mathematical logic, proof theory) and practice (software development, formal methods), and many interesting ramifications are yet to be explored. The 10th International Workshop on Termination will delve into all aspects of termination of processes. It will continue the sequence of successful workshops held in St. Andrews (1993), La Bresse (1995), Ede (1997), Dagstuhl (1999), Utrecht (2001), Valencia (2003), Aachen (2004), Seattle (2006), and Paris (2007). It will attain the same friendly atmosphere as those past workshops. The intent is to bring together, in an informal setting, researchers interested in all aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop shall help exchange ideas from term rewriting and from the various programming language communities. Contributions from the imperative, constraint, functional, and logic programming communities, and papers investigating new applications of termination are particularly welcome. Program Committee: Frederic Blanqui, INRIA, FR and Tsinghua University, CN Byron Cook, Microsoft Corporation, US Alfons Geser, HTWK Leipzig, DE (chair) Michael Hanus, Universität Kiel, DE Janis Voigtlander, Technische Universität Dresden, DE Local organization: Johannes Waldmann, HTWK Leipzig, DE Important Dates: Paper submission 19 April 2009 Notification 26 April 2009 Final Paper Version 3 May 2009 Conference Venue: The workshop will be held in the city of Leipzig, at the conference center Mediencampus Villa Ida. Hosting institution: Hochschule fur Technik, Wirtschaft und Kultur Leipzig, in cooperation with Leipzig School of Media and Medienstiftung der Sparkasse Leipzig.

1 0

Announce: iteratee-0.1.0
by John Lato 12 Mar '09

12 Mar '09

I am pleased to announce the hackage release of iteratee-0.1.0. This library implements enumerators and iteratees as proposed by Oleg Kiselyov (http://okmij.org/ftp/Haskell/Iteratee/) Significant differences from his original code include: - Seeking is allowed within any monad; the specific RBIO monad is neither required nor provided. - Data buffers may be of arbitrary types as specified by the StreamChunk type class. This allows for user-provided buffer types (e.g. arrays, vectors, etc.). Instances are provided for lists and ByteStrings. This, in conjunction with seeking, allows for efficient processing of binary data in addition to text. - Cross-platform support. Currently this is slightly less efficient than the Posix operations, but should run on any system targeted by a Haskell compiler. Although basic I/O specific enumerators are provided, this library should allow seamless interoperation with user-provided iteratees and enumerators. I hope that this flexibility will encourage a much wider adoption of enumerator-based IO in the Haskell community. This library is experimental, and the API is subject to change if it will seem advantageous. Patches are welcome: the darcs repo is at http://inmachina.net/~jwlato/haskell/iteratee . Discussion and comments are also always welcome. I would like to acknowledge several individuals for their contributions and suggestions: Oleg Kiselyov Paulo Tanimoto Johan Tibell Cheers, John Lato

5 6

Microsoft PhD Scholarship at Strathclyde
by Conor McBride 10 Mar '09

10 Mar '09

Apologies for crossposting. Please forward this message to individuals or lists who may be interested. In addition to the recently advertised PhD position at Strathclyde on "Reusability and Dependent Types", I am delighted to advertise the following PhD opportunity. {--------------------------------------------------------- -- Haskell Types with Numeric Constraints ---------------- ---------------------------------------------------------} We are grateful to Microsoft Research for their sponsorship of this project, which includes an internship, and with it the chance to make a real difference to world of principled but practical programming. The project investigates the practical and theoretical impact of extending Haskell's type system with numeric expressions (representing sizes, or ranges, or costs, for example) and constraints capturing richer safety properties than are currently managed by static typing. It has three strands: (1) to investigate type inference with numeric constraints, (2) to investigate new programming structures, patterns, and techniques which exploit numeric indexing, and (3) to study the performance benefits derivable from richer guarantees. A bright student could bring significant benefits to developers using Haskell, a language with increasing industrial traction — not least at Microsoft. Work on the Glasgow Haskell Compiler, at Strathclyde! {---------------------------------------------------------} The position is fully funded, covering stipend, fees (at the home/EU rate), equipment, and travel, starting in October 2009. The closing date for applications is 15th April 2009. For further details, see: http://personal.cis.strath.ac.uk/~conor/phds/ or email me (conor(a)cis.strath.ac.uk) I look forward to hearing from you. Yours &c Conor McBride

1 0

ANNOUNCE: Harpy 0.4.4 - Runtime code generation for x86 machine code
by Dirk Kleeblatt 10 Mar '09

10 Mar '09

Dear Haskell community, we are pleased to announce the release of Harpy 0.4.1, a library for runtime code generation for x86 machine code. Harpy is available from Hackage or from Harpy's homepage: http://uebb.cs.tu-berlin.de/harpy/ *** New in version 0.4.1 *** New Instances: - Many of Harpy's types are now instances of Eq. New instructions: - Added support for the prefetching instructions PREFETCH0, PREFETCH1, PREFETCH2 and PREFETCHNTA. Bug fixes: - Harpy.X86Disassembler.disassembleBloc was too strict and caused stack overflows for large inputs. This was fixed. - Disassembler: The instruction prefix list was not cleared when beginning to parse a new instruction. This caused incorrect disassembly of SSE instructions. - Disassembler: A bug has been fixed in the parsing routine for the addressing mode "scaled index + 32 bit offset" without base register. Enjoy, Dirk

1 0

Google Summer of Code 2009
by Malcolm Wallace 10 Mar '09

10 Mar '09

Gentle Haskellers, The Google Summer of Code will be running again this year. Once again, haskell.org has the opportunity to bid to become a mentoring organisation. (Although, as always, there is no guarantee of acceptance.) If you have ideas for student projects that you think would benefit the Haskell community, now is the time to start discussing them on mailing lists of your choice. We especially encourage students to communicate with the wider community: if you keep your ideas private, you have a much worse chance of acceptance than if you develop ideas in collaboration with those who will be your "customers", end-users, or fellow-developers. This is the open-source world! The timeline is that Haskell.org will apply for GSoC membership between 9-13 March, and if we are successful, students can submit applications between 23 March - 3 April. If you wish to help publicise GSoC amongst students, there are official posters/fliers available (not specific to haskell.org) http://code.google.com/p/google-summer-of-code/wiki/GsocFlyers Regards, Malcolm

3 3

ANN: sparsebit 0.5 - Sparse Bitmaps for Pattern Match Coverage
by Ahn, Ki Yung 10 Mar '09

10 Mar '09

sparsebit - Sparse Bitmaps for Pattern Match Coverage http://hackage.haskell.org/cgi-bin/hackage-scripts/package/sparsebit This library packages the functional peal paper 'Sparse Bitmaps for Pattern Match Coverage' submitted to ICFP 2009 by Ki Yung Ahn and Tim Sheard. You can look up the tutorial-like paper and the talk slides, which are availabel at: http://kyagrd.dyndns.org/wiki/SparseBitmapsForPatternMatchCoverage Abstract: Pattern matching coverage over Algebraic Data Types(ADTs) has most often been studied in the context of pattern compilation algorithms. However, it is worth considering the pattern matching coverage problem in isolation, since general solutions will be independent of the specifics of any implementation or language. We define an intuitive and mathematically well-established bit masking semantics for pattern match coverage. We design and implement a sparse bitmap data structure, which realizes this semantics in a compact and flexible manner. This bitmap data structure supports computing coverage solutions of large programs incrementally from coverage solutions of sub-programs. It can also be used as a common data representation for pattern coverage shared between different tools (e.g., compilers, linting tools, software analysis tools) that need pattern match coverage information. Additional source files Type.hs and TestType.hs packaged with this library provides the examples and QuickCheck extracted from the paper to demonstrate how to use this library. ==================================================================== Some additional notes: Personally, I am very happy to upload my first project on Hackage. If you are looking for simple and elegant way of describing pattern match coverage or testing exhaustiveness of pattern matching, we hope this may give you a better insight. This is a reference implementation, but I think it is still usable to some extent. One might want to define monadic version of the library functions and operators since the type representation in the program analysis tools might be monadic for implementation reasons (easy to generate fresh type variables) and performance reasons (to exploit sharing while unification of type variables). And in such cases, more optimized implementation of tensor product may be possible as well. And there are some other issues discussed in the paper as well. I was not able to make the haddock documentation appear in Hackage, although I have no problem generating documentation using "cabal haddock" locally. It would be nice if there is a way to see some diagnose of warning or error messages why haddock failed on Hackage. -- Ahn, Ki Yung

1 0

[FMICS 2009] Third Call for Papers
by FMICS 2009 workshop chair 09 Mar '09

09 Mar '09

FMICS 2009 - 3RD CALL FOR PAPERS Please visit: http://users.dsic.upv.es/workshops/fmics2009 ************************************************************ * 14th International Workshop on * * Formal Methods for Industrial Critical Systems * * FMICS 2009 * * * * November 2-3, 2009 * * Eindhoven, The Netherlands * ************************************************************ * ** NEWS ** * * * * >> Price for best paper -- awarded by EASST * * * ************************************************************ * * * LNCS proceedings * * Springer has confirmed that the proceedings * * will be published in their Lecture Notes in * * Computer Science series. * * * ************************************************************ IMPORTANT DATES --------------- Deadline for abstracts: 1st April Deadline for papers: 7 April Accept/Reject notification: 15 June Camera-ready version: 15 July Workshop: 2-3 November SCOPE OF THE WORKSHOP --------------------- The aim of the ERCIM FMICS workshop series is to provide a forum for researchers who are interested in the development and application of formal methods in industry. In particular, these workshops bring together scientists and engineers that are active in the area of formal methods and interested in exchanging their experiences in the industrial usage of these methods. These workshops also strive to promote research and development for the improvement of formal methods and tools for industrial applications. Topics include, but are not restricted to: - Design, specification, code generation and testing based on formal methods. - Methods, techniques and tools to support automated analysis, certification, debugging, learning, optimization and transformation of complex, distributed, real-time systems and embedded systems. - Verification and validation methods that address shortcomings of existing methods with respect to their industrial applicability (e.g., scalability and usability issues). - Tools for the development of formal design descriptions. - Case studies and experience reports on industrial applications of formal methods, focusing on lessons learned or identification of new research directions. - Impact of the adoption of formal methods on the development process and associated costs. - Application of formal methods in standardization and industrial forums. INVITED SPEAKERS ---------------- To be announced CO-CHAIRS --------- Maria Alpuente Tech. University Valencia, Spain Byron Cook Microsoft Research, UK PROGRAM COMMITTEE ------------------- Hassan Ait-Kaci Ilog, Canada Maria Alpuente Tech. University Valencia, Spain Thomas Arts IT-Univ. i Goteborg, Sweden Demis Ballis Universita Udine, Italy Josh Berdine Microsoft Research, UK Lubos Brim Masarykova Univ., Czech Republic Darren Cofer Rockwell Collins, USA Byron Cook Microsoft Research, UK Patrick Cousot Ecole Normale Superieure, France Santiago Escobar Tech. University Valencia, Spain Azadeh Farzan University of Toronto, Canada Hubert Garavel INRIA Rhone-Alpes, France Stefania Gnesi ISTI-CNR, Italy Alexey Gotsman University of Cambridge, UK Holger Hermanns Universitat Saarlandes, Germany Christophe Joubert Tech. University Valencia, Spain Daniel Kroening ETH Zurich, Switzerland Michael Leuschel Universitat Dusseldorf, Germany Pedro Merino Universidad de Malaga, Spain Juan Jose Moreno-Navarro Univ. Politecnica Madrid, Spain Corina Pasareanu NASA Ames Research Center, USA Jaco van de Pol Univ. Twente, The Netherlands Murali Rangarajan Honeywell, USA Jakob Rehof Tech. Univ. Dortmund, Germany Andrey Rybalchenko Max-Planck-Gesellschaft, Germany Marcel Verhoef Chess, The Netherlands Martin Wirsing Universitat Munchen, Germany Hongseok Yang University of London, UK Greta Yorsh IBM Watson Research Center, USA ERCIM FMICS WG COORDINATOR -------------------------- Alessandro Fantechi Univ. Firenze, ISTI-CNR, Italy WORKSHOP CHAIR -------------- Christophe Joubert Tech. University Valencia, Spain PAPER SUBMISSIONS ----------------- Submissions must be made electronically through the EasyChair system. Papers should be up to 16 pages in LNCS format, with the names and affiliations of the authors and a clear and informative abstract. Additional details may be included in a clearly marked appendix, which will be read at the discretion of the program committee. All submissions must report on original research. Submitted papers must not have previously appeared in a journal or conference with published proceedings and must not be concurrently submitted to any other peer-reviewed workshop, symposium, conference or archival journal. Any partial overlap with any such published or concurrently submitted paper must be clearly indicated. Case study papers should identify lessons learned, validate theoretical results (such as scalability of methods), or provide specific motivation for further research and development. The workshop proceedings will be published in the Springer series Lecture Notes in Computer Science (LNCS). CO-LOCATION ----------- FMICS 2009 is part of the first Formal Methods Week (FMweek), which will bring together a choice of events in the area, including TESTCOM/FATES (Conference on Testing of Communicating Systems and Workshop on Formal Approaches to Testing of Software), FACS (Formal Aspects of Component Software), PDMC (Parallel and Distributed Methods of verifiCation), FM2009 (Symposium of Formal Methods Europe), CPA (Communicating Process Architectures), FAST (Formal Aspects of Security and Trust), FMCO (Formal Methods for Components and Objects), and the REFINE Workshop. For the latest information on FMweek, see http://www.win.tue.nl/fmweek. ************************************************************ * * * +============================================+ * * | | * * | ** FMweek ** | * * | | * * +============================================+ * * | CPA | FACS | FAST | * * +--------------------------------------------+ * * | FM2009 | FMCO | FMICS | * * +--------------------------------------------+ * * | PDMC | REFINE | TESTCOM/FATES | * * +--------------------------------------------+ * * | http://www.win.tue.nl/fmweek | * * +============================================+ * * * ************************************************************

1 0

ANN : happs-tutorial 0.8
by Creighton Hogg 09 Mar '09

09 Mar '09

Hello, I'd like to announce the release of the happstack-0.2 compatible release of happs-tutorial on hackage and available for perusing on tutorial.happstack.com. A number of changes occurred in this release: * General cleanup of code for readability * Migration to the new Happstack.Server.SimpleHTTP api * Addition of a chapter on multimaster, the Spread Toolkit based system for syncing your applications across multiple Happstack instances. * Revised chapters on introducing Happstack.Server and Happstack.State, with an emphasis on simple, well-commented examples showing the orthogonality of these separate libraries. * Minor bug fixes Cheers, Creighton

1 0

ANNOUNCE: Holumbus-MapReduce 0.0.1
by Stefan Schmidt 08 Mar '09

08 Mar '09

The Holumbus framework is known for building specialized search-engines like the Hayoo! Haskell API search. Now, I'd like to announce the newest libraries of the Holumbus framework: Holumbus-MapReduce 0.0.1 Holumbus-Distribution 0.0.1 Holumbus-Storage 0.0.1 As part of my Master's Thesis at the University of Applied Sciences in Wedel, Germany, I have developed a library for building distributed MapReduce systems in Haskell. The existing Holumbus-Searchengine library already offers a MapReduce implementation, but it does not provide mechanisms for distributed computing. The newly developed Holumbus-MapReduce library contains of tools and modules for building individualized distributed MapReduce systems. Holumbus-MapReduce is based on two libraries: Holumbus-Distributed and Holumbus-Storage. Maybe they could be useful for building other distributed systems, not only a MapReduce system. Holumbus-Distribution consists of modules and tools for the implementation of distributed systems in general. Besides common data types and small helper functions, this library provides a mailbox-based data transfer mechanism. It offers an easy-to-use interface for inter- and intra-process communication like in Erlang or Mozart/Oz. Holumbus-Storage is designed to build a distributed storage system which can be linked into other programs. It is used by the MapReduce system for the data management. All three libraries are still under heavy development and should not be considered for creating applications in productive environments. But I think, it's time to give them to the community for suggestions on further development and features. Please email comments, bugs, etc. to sts(a)holumbus.org Stefan Schmidt Holumbus on Hackage: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Holumbus-MapRedu… http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Holumbus-Distrib… http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Holumbus-Storage link to my thesis: http://www.holumbus.org/redmine/attachments/37/thesis-mapreduce.pdf project homepage: http://www.holumbus.org/redmine/wiki/holumbus darcs repository (latest snapshots): http://holumbus.fh-wedel.de/holumbus/src

1 0