December 2009 - Haskell

ANN: Happstack 0.4.1
by Jeremy Shaw 21 Dec '09

21 Dec '09

Happstack 0.4.1 STABLE is now available. We recommend that all users of Happstack update to 0.4.1 immediately. Migration from Happstack 0.3 should be trivial. There was one race condition in happstack-state which could cause a state event to fail under heavy congestion. Happstack is the Haskell Application Server Stack. It is a scalable framework for developing web applications. It is similar in purpose to Django, RoR, Turbogears, Grails, Seaside, etc. Using less buzzwords, it is a collection of libraries which can be used to develop a self-contained server application which does not require SQL or Apache (though it can integrate with both). It includes: * an HTTP server * a rich DSL for deconstructing HTTP Requests and generating Responses * HTML/XML/etc templating via HStringTemplate, HSP, or Text.XHtml * a persistent data store based on user defined Haskell data types with ACID properties and state migration * and more!! Happstack's modular nature means it is easy to integrate unrelated 3rd party modules such as Pandoc, or to add support for an alternative templating system. Additionally, it does not exclude you from using SQL, or supporting other protocols besides HTTP. HOMEPAGE: http://www.happstack.com/ SUPPORTED PLATFORMS: Happstack supports GHC 6.8, 6.10, and 6.12, under GNU/Linux, FreeBSD, OS X, and Windows. GHC 6.12 currently requires a minor patch to HJScript. Details here: http://groups.google.com/group/haskell-server-pages/browse_thread/thread/56… INSTALL: 1. ensure that ~/.cabal/bin is in your $PATH 2. cabal update 3. cabal install happstack * see SUPPORTED PLATFORMS for information about GHC 6.12 NOTABLE CHANGES: For a complete list of changes see: http://www.patch-tag.com/r/mae/happstack/snapshots/all/history Removed: * happstack-contrib has been completely removed. If you were using something in it, please complain on the mailing list. * removed Happstack.Server.S3 -- newer, better maintained S3 libraries are on hackage now * removed unsupported spread-based multimaster support fileServe: * now with sendfile() support! On supported platforms sendfile allows files to be served from the disk to the network in a zero-copy fashion. This means faster transfers, less memory and CPU usage, and no file handle leaks. (hopefully). sendfile uses native sendfile() support on Linux, Windows, OS X, and FreeBSD. Other platforms will use a sendfile emulation mode. We recommend that you use sendFile instead of sendFileStrict or sendFileLazy, unless you have specific needs and know some reason why you must use sendFileStrict or sendFileLazy. * FileServe internals majorly refactored. FileServe now provides a modular way of building your own fileServe-like functions. Also includes functions for serving a single file instead of the contents of a directory. * added more complete list of mime-types * automatically redirect from foo to foo/ if foo is a directory * filter . and .. from request path, but allow filenames and directories which start with . happstack-server: * ServerMonad instance for ErrorT * Added ServerMonad, FilterMonad, and WebMonad for XMLGenT * Added secure flag to cookies. Defaults to False. * fix supportsIPv6 to work with newer versions of network library * simpleHTTPWithSocket + bindPort for H.S.SimpleHTTP (you can use this to start the server as root, bind to the socket, and then drop privileges.) * Fixed Accept-Encoding parser to accepts encodings with a - in them. Added additional tests to acceptEncodingParserTest * fix so basicAuth sets correct response code and headers. * SimpleHTTP: added trailingSlash. Guard which checks that Request URI ends with a / * decode body of PUT requests not just POST * added ifModifiedSince guard * added host and withHost guards to SimpleHTTP (similar to dir and path, but for the requested hostname) other: * happstack-state: Correct an embarrassing race condition bug. * happstack-data: Exported getSafeGet and getSafePut * happstack: add state transition code to guestbook (add email to form, handler, and state), and tar of example _local state before transition experimental: * happstack-state: now has experimental replication support using Amazon Web Services. This support is disabled by default. This feature is highly experimental, may not work, and may even be completely removed in future versions (though, hopefully not). THANKS: Alex Jacobson David Himmelstrup / Lemmih Matthew Elder / mae Antoine Latter Erik Hesselink Pasqualino 'Titto' Assini Nils / McManiaC Thomas Hartman Creighton Hogg / wchogg John MacFarlane Jochem Berndsen / koeien MightByte And everyone who filed bug reports, tested RC1 and RC2, and anyone else I missed.

3 2

Call for Participation - PEPM'10 (co-located with POPL'10)
by Janis Voigtländer 19 Dec '09

19 Dec '09

=============================================================== CALL FOR PARTICIPATION 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 =============================================================== Abstracts of all papers and presentations are available from the above web site. INVITED TALKS: * Lennart Augustsson (Standard Chartered Bank, UK) Title: O, Partial Evaluator, Where Art Thou? * Jeremy G. Siek (University of Colorado at Boulder, USA) Title: General Purpose Languages Should be Metalanguages. CONTRIBUTED TALKS: * Nabil el Boustani and Jurriaan Hage. Corrective Hints for Type Incorrect Generic Java Programs. * Johannes Rudolph and Peter Thiemann. Mnemonics: Type-safe Bytecode Generation at Run Time. * Elvira Albert, Miguel Gomez-Zamalloa and German Puebla. PET: A Partial Evaluation-based Test Case Generation Tool for Java Bytecode. * Martin Hofmann. Igor II - an Analytical Inductive Functional Programming System. * José Pedro Magalhães, Stefan Holdermans, Johan Jeuring and Andres Löh. Optimizing Generics Is Easy! * Michele Baggi, María Alpuente, Demis Ballis and Moreno Falaschi. A Fold/Unfold Transformation Framework for Rewrite Theories extended to CCT. * Hugh Anderson and Siau-Cheng Khoo. Regular Approximation and Bounded Domains for Size-Change Termination. * Évelyne Contejean, Pierre Courtieu, Julien Forest, Andrei Paskevich, Olivier Pons and Xavier Urbain. A3PAT, an Approach for Certified Automated Termination Proofs. * Fritz Henglein. Optimizing Relational Algebra Operations Using Generic Equivalence Discriminators and Lazy Products. * Adrian Riesco and Juan Rodriguez-Hortala. Programming with Singular and Plural Non-deterministic Functions. * Martin Hofmann and Emanuel Kitzelmann. I/O Guided Detection of List Catamorphisms. * Andrew Moss and Dan Page. Bridging the Gap Between Symbolic and Efficient AES Implementations. * Christopher Brown and Simon Thompson. Clone Detection and Elimination for Haskell. * Stefan Holdermans and Jurriaan Hage. Making "Stricterness" More Relevant. * Arun Lakhotia, Davidson Boccardo, Anshuman Singh and Aleardo Manacero Júnior. Context-Sensitive Analysis of Obfuscated x86 Executables. * Xin Li and Mizuhito Ogawa. Conditional Weighted Pushdown Systems and Applications. * Ivan Lazar Miljenovic. The SourceGraph Program. * Florian Haftmann. From Higher-Order Logic to Haskell: There and Back Again. SPECIAL FEATURE: * Andy Gill, Garrin Kimmell and Kevin Matlage. Capturing Functions and Catching Satellites. IMPORTANT DATES: * Early registration deadline: December 22, 2009 * Hotel registration deadline: December 28, 2009

1 0

POPL 2010 - Call for Participation - Early Registration Dec 22
by popl10-announce＠software.imdea.org 19 Dec '09

19 Dec '09

********************************************************************* * ACM SIGPLAN-SIGACT Symposium * * on * * Principles of Programming Languages * * * * January 20-22, 2010 * * Madrid, Spain * * * * Call for Participation * * * * http://www.cse.psu.edu/popl/10/ * ********************************************************************* Important dates * Early registration deadline: *** December 22, 2009 *** * Hotel reservation deadline: December 28, 2009 * Conference: January 20-22, 2010 Hotel All the conference events will take place at the Melia Castilla Hotel, Madrid. We encourage attendees to stay at the conference hotel. Information about the hotel can be found on the POPL web page: http://www.cse.psu.edu/popl/10/ Scope The annual Symposium on Principles of Programming Languages is a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, transformation, implementation and verification of programming languages, programming systems, and programming abstractions. Both experimental and theoretical papers are welcome. Preliminary program A preliminary program can be found at the end of this email in text format, or it can be found here: http://www.cse.psu.edu/popl/10/program.html Invited speakers * Neil Gershenfeld (MIT, USA) * Thomas A. Henzinger (IST, Austria) 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 POPL. Details on the PAC program and the application can be found in the conference web site. PAC also offers support for companion travel. General Chair: Manuel Hermenegildo Director, IMDEA Software Institute Professor, C.S. Department, T.U. of Madrid (UPM), Spain Program Chair: Jens Palsberg Professor, UCLA Computer Science Department Program Committee: Alex Aiken Stanford University Rajeev Alur University of Pennsylvania Cristiano Calcagno Imperial College, London Juan Chen Microsoft Research Wei-Ngan Chin National University of Singapore Mads Dam Royal Institute of Technology, Stockholm Erik Ernst Aarhus University John Field IBM T. J. Watson Research Center Cormac Flanagan UC Santa Cruz Roberto Giacobazzi Universita' degli Studi di Verona Rachid Guerraoui EPFL Sorin Lerner UC San Diego Calvin Lin University of Texas, Austin Atsushi Ohori Tohoku University Jens Palsberg UCLA Andrey Rybalchenko Max Planck Institute for Software Systems Amr Sabry Indiana University Mooly Sagiv Tel-Aviv University Peter Sewell University of Cambridge Tayssir Touili CNRS-LIAFA Affiliated Events * WFLP: Functional and (Constraint) Logic Programming * January 17, 2010 * VMCAI: Verification Model Checking and Abstract Interpretation * January 17-19, 2010 * PADL: Practical Applications of Declarative Languages * January 18-19, 2010 * DAMP: Declarative Aspects of Multicore Programming * January 19, 2010 * PLPV: Programming Languages meets Program Verification * January 19, 2010 * PEPM: Partial Evaluation and Semantics-Based Program Manipulation * January 18-19, 2010 * TLDI:Types in Language Design and Implementation * January 23, 2010 POPL 2010 Preliminary Program ----------------------------- Wednesday, January 20, 2009 =========================== * Invited talk, 9:00-10:00 * Session Chair: Jens Palsberg (UCLA) - Reconfigurable Asynchronous Logic Automata Neil Gershenfeld (MIT, USA) * Session: Concurrency, 10:30-11:30 * Session Chair: John Field (IBM T. J. Watson Research Center) - On the Verification Problem for Weak Memory Models Mohamed Faouzi Atig (LIAFA, University Paris Diderot), Ahmed Bouajjani (LIAFA, University Paris Diderot), Sebastian Burckhardt (Microsoft Research), Madan Musuvathi (Microsoft Research) - Coarse-Grained Transactions Eric Koskinen (University of Cambridge), Matthew Parkinson (University of Cambridge), Maurice Herlihy (Brown University) - Sequential Verification of Serializability H. Attiya (Technion), G. Ramalingam (Microsoft Research India), N. Rinetzky (Queen Mary University of London) * Session: Static Analysis I, 12:00-1:00 * Session Chair: Tayssir Touili (CNRS-LIAFA) - Compositional May-Must Program Analysis: Unleashing the Power of Alternation Patrice Godefroid (Microsoft Research Redmond), Aditya V. Nori (Microsoft Research India), Sriram K. Rajamani (Microsoft Research India), Sai Deep Tetali (Microsoft Research India) - Continuity Analysis of Programs Authors: Swarat Chaudhuri (Pennsylvania State University), Sumit Gulwani (Microsoft Research), Roberto Lublinerman (Pennsylvania State University) - Program Analysis via Satisfiability Modulo Path Programs William R. Harris (University of Wisconsin, Madison, WI), Sriram Sankaranarayanan (NEC Laboratories America, Princeton, NJ), Franjo Ivancic (NEC Laboratories America, Princeton, NJ), Aarti Gupta (NEC Laboratories America, Princeton, NJ) * Session: Verified Compilers, 2:30-3:30 * Session Chair: Sorin Lerner (UC San Diego) - A simple, verified validator for software pipelining Jean-Baptiste Tristan (INRIA Paris-Rocquencourt), Xavier Leroy (INRIA Paris-Rocquencourt) - A Verified Compiler for an Impure Functional Language Adam Chlipala (Harvard University) - Verified just-in-time compiler on x86 Magnus O. Myreen (University of Cambridge) * Session: Type Inference, 4:00-5:00 * Session Chair: Benjamin Pierce (University of Pennsylvania) - Dependent Types from Counterexamples Tachio Terauchi (Tohoku University) - Low-Level Liquid Types Patrick Rondon (UC San Diego), Ranjit Jhala (UC San Diego), Ming Kawaguchi (UC San Diego) - Type Inference for Datalog with Complex Type Hierarchies Max Schaefer (Semmle Ltd., Oxford), Oege de Moor (Semmle Ltd., Oxford) Thursday, January 21, 2009 ========================== * Invited talk, 9:00-10:00 * Session Chair: Jens Palsberg (UCLA) - From Boolean to Quantitative Notions of Correctness Thomas A. Henzinger (IST, Austria) * Session: Reasoning about Programs, 10:30-11:30 * Session Chair: Roberto Giacobazzi (Universita' degli Studi di Verona) - Nominal System T Andrew M. Pitts (University of Cambridge) - A Theory of Indirection via Approximation Aquinas Hobor (National University of Singapore), Robert Dockins (Princeton University), Andrew W. Appel (Princeton University) - A Relational Modal Logic for Higher-Order Stateful ADTs Derek Dreyer (MPI-SWS), Georg Neis (MPI-SWS), Andreas Rossberg (MPI-SWS), Lars Birkedal (ITU-Copenhagen) * Session: Static Analysis II, 12:00-1:00 * Session Chair: Andrey Rybalchenko (Max Planck Institute for Software Systems) - Decision Procedures for Algebraic Data Types with Abstractions Philippe Suter (EPFL), Mirco Dotta (EPFL), Viktor Kuncak (EPFL) - Automatic Numeric Abstractions for Heap-Manipulating Programs Stephen Magill (Carnegie Mellon University), Ming-Hsien Tsai (National Taiwan University), Peter Lee (Carnegie Mellon University), Yih-Kuen Tsay (National Taiwan University) - Static Determination of Quantitative Resource Usage for Higher-Order Programs Steffen Jost (University of St Andrews), Hans-Wolfgang Loidl (University of St Andrews), Kevin Hammond (University of St Andrews), Martin Hofmann (Ludwig-Maximilians University, Munich) * Session: Verification, 2:30-3:30 * Session Chair: Xavier Leroy (INRIA Rocquencourt) - Toward a Verified Relational Database Management System Ryan Wisnesky (Harvard University), Gregory Malecha (Harvard University), Avraham Shinnar (Harvard University), Greg Morrisett (Harvard University) - Counterexample-Guided Focus Andreas Podelski (University of Freiburg), Thomas Wies (EPFL) - Structuring the verification of heap-manipulating programs Aleksandar Nanevski (Microsoft Research, Cambridge / IMDEA Software, Spain), Viktor Vefeiadis (Microsoft Research, Cambridge), Josh Berdine (Microsoft Research, Cambridge) * Session: Types, 4:00-5:00 * Session Chair: Erik Ernst (Aarhus University) - Dependent types and program equivalence Limin Jia (University of Pennsylvania), Jianzhou Zhao (University of Pennsylvania), Vilhelm Sjoberg (University of Pennsylvania), Stephanie Weirich (University of Pennsylvania) - Pure Subtype Systems DeLesley Hutchins (MZA Associates Corporation) - Modular Session Types for Distributed Object-Oriented Programming Simon J Gay (University of Glasgow, UK), Vasco T Vasconcelos (University of Lisbon, Portugal), Antonio Ravara (Instituto de Telecomunicacoes and Technical University of Lisbon, Portugal), Nils Gesbert (University of Glasgow, UK), Alexandre Z Caldeira (University of Lisbon, Portugal) Friday, January 22, 2009 ========================= * Session: Program Synthesis, 9:00-10:00 * Session Chair: Cristiano Calcagno (Imperial College, London) - From Program Verification to Program Synthesis Saurabh Srivastava (University of Maryland, College Park), Sumit Gulwani (Microsoft Research, Redmond), Jeffrey S. Foster (University of Maryland, College Park) - Abstraction-Guided Synthesis of Synchronization Martin Vechev (IBM Research), Eran Yahav (IBM Research), Greta Yorsh (IBM Research) - Programming with Angelic Non-determinism Shaon Barman (UC Berkeley), Rastislav Bodik (UC Berkeley), Satish Chandra (IBM TJ Watson Research), Joel Galenson (UC Berkeley), Doug Kimelman (IBM TJ Watson Research), Casey Rodarmor (UC Berkeley), Nicholas Tung (UC Berkeley) * Session: Relating and Integrating Static and Dynamic Checks, 10:30-11:30 * Session Chair: Matthias Felleisen (Northeastern University) - Contracts Made Manifest Michael Greenberg (University of Pennsylvania), Benjamin Pierce (University of Pennsylvania), Stephanie Weirich (University of Pennsylvania) - Threesomes, With and Without Blame Jeremy G. Siek (University of Colorado at Boulder), Philip Wadler (University of Edinburgh) - Integrating Typed and Untyped Code in a Scripting Language Tobias Wrigstad (Purdue University), Francesco Zappa Nardelli (INRIA), Sylvain Lebresne (Purdue University), Johan Ostlund (Purdue University), Jan Vitek (Purdue University) * Session: Compilers, 12:00-1:00 * Session Chair: Peter Sewell (University of Cambridge) - Generating Compiler Optimizations from Proofs Ross Tate (UC San Diego), Michael Stepp (UC San Diego), Sorin Lerner (UC San Diego) - Automatically Generating Instruction Selectors Using Declarative Machine Descriptions Joao Dias (Tufts University), Norman Ramsey (Tufts University) - Semantics and Algorithms for Data-dependent Grammars Yitzhak Mandelbaum (AT&T Labs - Research), Trevor Jim (AT&T Labs - Research), David Walker (Princeton University) * Session: Security and Ownership, 2:30-3:30 * Session Chair: Mads Dam (Royal Institute of Technology, Stockholm) - Paralocks - Role-Based Information Flow Control and Beyond Niklas Broberg (Gothenburg University), David Sands (Chalmers University of Technology) - Modular Verification of Security Protocol Code by Typing Karthikeyan Bhargavan (Microsoft Research), Cedric Fournet (Microsoft Research), Andrew D. Gordon (Microsoft Research) - Dynamically Checking Ownership Policies in Concurrent C/C++ Programs Jean-Phillipe Martin (Microsoft Research Cambridge), Michael Hicks (University of Maryland, College Park), Manuel Costa (Microsoft Research Cambridge), Periklis Akritidis (University of Cambridge), Miguel Castro (Microsoft Research Cambridge) * Session: Medley, 4:00-5:00 * Session Chair: Mooly Sagiv (Tel-Aviv University) - Nested Interpolants Matthias Heizmann (University of Freiburg, Germany), Jochen Hoenicke (University of Freiburg, Germany), Andreas Podelski (University of Freiburg, Germany) - Monads in Action Andrzej Filinski (University of Copenhagen) - Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification Naoki Kobayashi (Tohoku University), Naoshi Tabuchi (Tohoku University), Hiroshi Unno (Tohoku University)

1 0

Haskell Weekly News: Issue 144 - December 19, 2009
by jfredett＠gmail.com 19 Dec '09

19 Dec '09

--------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20091219 Issue 144 - December 19, 2009 --------------------------------------------------------------------------- Welcome to issue 144 of HWN, a newsletter covering developments in the [1]Haskell community. The big news this week is the release of the Glorious Glasgow Haskell compiler version 6.12.1, lots of exciting new improvements, congratulations from the whole community go out to the devs, good work GHC Team! Otherwise, this week has been quiet, with some interesting discussions about associated types and the new GHC, and some excellent new packages announced. Finally, due to the incoming holidays, there won't be an HWN for the next two weeks, I'll see you Haskellers in 2010, until then, your Haskell Weekly News! Announcements GHC version 6.12.1. Ian Lynagh [2]announced the (Interactive) Glasgow Haskell Compiler, version 6.12.1. Including improved support for parallel execution, Dynamic linking support on Linux, and many other improvments. atom-0.1.4. Tom Hawkins [3]announced a bug fix release of the atom package, affecting floating point variable initialization. text 0.7, fast Unicode text. Bryan O'Sullivan [4]announced a new release of the text package adds support for Unicode I/O explicit-iomodes-0.1. Bas van Dijk [5]announced explicit-iomodes version 0.1, a wrapper around System.IO that provides a Handle type which is parametrized with the IOMode it is in. Hemkay, the 100% Haskell MOD player. Patai Gergely [6]announced a Hemkay, an old-school MOD player in pure Haskell. GT-VMT 2010: deadlines extended. Emilio Tuosto [7]announced a deadline extension to the GT-VMT call for papers. Discussion Restrictions on associated types for classes. Stephen Lavelle [8]asked if there was a way to wrap a associated type in a class constraint. Yay 6.12.1! Evan Laforge [9]talked about some of the changes in the new version of GHC. Blog noise [10]Haskell news from the [11]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Michael Snoyman: [12]data-object family. * Bryan O'Sullivan: [13]Making GHC's I/O manager more scalable. * Conor McBride: [14]Epilogue for Epigram: 2+2=4. * Sebastian Fischer: [15]Thesis submitted. * Bryan O'Sullivan: [16]Data.Text 0.7 gains I/O support. * Ketil Malde: [17]Searching for poly(A) tails. * Mark Jason Dominus: [18]Monads are like burritos. * Sean Leather: [19]"Upwards and downwards accumulations on trees" translated into Haskell. Quotes of the Week * yrlnry: <byorgey> yrlnry: just some lady who had a lot of money and decided she wanted poor grad students to have some of it after she died... pretty nice of her, actually <yrlnry> senile dementia, more likely. * Philonous: A 'newbie', in Haskell, is someone who hasn't yet implemented a compiler. They've only written a monad tutorial. * kmc: Right, for example Either (pun not intended) * kmc: One thing I've learned from open-source software is that if you invent enough wheels, one of them will turn out to be round and capable of rolling. * PhilipWadler: To see that "in" and "out" are inverses, stare at the following diagram * kmc: Data.Map is like a C++ STL map<k,v>, without the suck * edwardkmett: Most monad tutorials are written by people who barely understand monads, if at all, but unfortunately nothing can stop someone from writing a monad tutorial. We've tried, there was blood everywhere. * Cale: A small category is a monad in the 2-category of spans of sets. About the Haskell Weekly News New editions are posted to [20]the Haskell mailing list as well as to [21]the Haskell Sequence and [22]Planet Haskell. [23]RSS is also available, and headlines appear on [24]haskell.org. To help create new editions of this newsletter, please see the information on [25]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [26]http://patch-tag.com/r/jfredett/HWN2/pullrepo HWN2 . References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.general/17678 3. http://article.gmane.org/gmane.comp.lang.haskell.cafe/68009 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67946 5. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67931 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67923 7. http://article.gmane.org/gmane.comp.lang.haskell.general/17676 8. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/68084 9. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/67950 10. http://planet.haskell.org/ 11. http://haskell.org/haskellwiki/Blog_articles 12. http://snoyberg.wordpress.com/2009/12/17/data-object-family/ 13. http://www.serpentine.com/blog/2009/12/17/making-ghcs-io-manager-more-scala… 14. http://www.e-pig.org/epilogue/?p=266 15. http://www-ps.informatik.uni-kiel.de/~sebf/haskell/thesis.html 16. http://www.serpentine.com/blog/2009/12/15/data-text-0-7-gains-io-support/ 17. http://blog.malde.org/index.php/2009/12/14/searching-for-polya-tails/ 18. http://blog.plover.com/prog/burritos.html 19. http://feedproxy.google.com/~r/splonderzoek/~3/4E8TZPDZ-aM/upwards-and-down… 20. http://www.haskell.org/mailman/listinfo/haskell 21. http://sequence.complete.org/ 22. http://planet.haskell.org/ 23. http://sequence.complete.org/node/feed 24. http://haskell.org/ 25. http://haskell.org/haskellwiki/HWN 26. http://patch-tag.com/r/jfredett/HWN2/pullrepo%20HWN2

1 0

[Fwd: Termination Competition 2009 live on the web!]
by Janis Voigtländer 18 Dec '09

18 Dec '09

Hi all, This contest should be of interest to Haskellers. There is an "FP Category" in which termination of Haskell programs is automatically checked. The current state can be observed by following the corresponding "View Results" link from the page http://termcomp.uibk.ac.at/termcomp/competition/categoryList.seam?competiti… Ciao, Janis. -- Jun.-Prof. Dr. Janis Voigtländer http://www.iai.uni-bonn.de/~jv/ mailto:jv@iai.uni-bonn.de

1 0

ANNOUNCE: GHC version 6.12.1
by Ian Lynagh 15 Dec '09

15 Dec '09

============================================================== The (Interactive) Glasgow Haskell Compiler -- version 6.12.1 ============================================================== The GHC Team is pleased to announce a new major release of GHC. There have been a number of significant changes since the last major release, including: * Considerably improved support for parallel execution. GHC 6.10 would execute parallel Haskell programs, but performance was often not very good. Simon Marlow has done lots of performance tuning in 6.12, removing many of the accidental (and largely invisible) gotchas that made parallel programs run slowly. * As part of this parallel-performance tuning, Satnam Singh and Simon Marlow have developed ThreadScope, a GUI that lets you see what is going on inside your parallel program. It's a huge step forward from "It takes 4 seconds with 1 processor, and 3 seconds with 8 processors; now what?". ThreadScope will be released separately from GHC, but at more or less the same time as GHC 6.12. * Dynamic linking is now supported on Linux, and support for other platforms will follow. Thanks for this most recently go to the Industrial Haskell Group who pushed it into a fully-working state; dynamic linking is the culmination of the work of several people over recent years. One effect of dynamic linking is that binaries shrink dramatically, because the run-time system and libraries are shared. Perhaps more importantly, it is possible to make dynamic plugins from Haskell code that can be used from other applications. * The I/O libraries are now Unicode-aware, so your Haskell programs should now handle text files containing non-ascii characters, without special effort. * The package system has been made more robust, by associating each installed package with a unique identifier based on its exposed ABI. Now, cases where the user re-installs a package without recompiling packages that depend on it will be detected, and the packages with broken dependencies will be disabled. Previously, this would lead to obscure compilation errors, or worse, segfaulting programs. This change involved a lot of internal restructuring, but it paves the way for future improvements to the way packages are handled. For instance, in the future we expect to track profiled packages independently of non-profiled ones, and we hope to make it possible to upgrade a package in an ABI-compatible way, without recompiling the packages that depend on it. This latter facility will be especially important as we move towards using more shared libraries. * There are a variety of small language changes, including * Some improvements to data types: record punning, declaring constructors with class constraints, GADT syntax for type families etc. * You can omit the "$" in a top-level Template Haskell splice, which makes the TH call look more like an ordinary top-level declaration with a new keyword. * We're are deprecating mdo for recursive do-notation, in favour of the more expressive rec statement. * We've concluded that the implementation of impredicative polymorphism is unsustainably complicated, so we are re-trenching. It'll be deprecated in 6.12 (but will still work), and will be either removed or replaced with something simpler in 6.14. The full release notes are here: http://haskell.org/ghc/docs/6.12.1/html/users_guide/release-6-12-1.html How to get it ~~~~~~~~~~~~~ The easy way is to go to the web page, which should be self-explanatory: http://www.haskell.org/ghc/ We supply binary builds in the native package format for many platforms, and the source distribution is available from the same place. Packages will appear as they are built - if the package for your system isn't available yet, please try again later. Background ~~~~~~~~~~ Haskell is a standard lazy functional programming language; the current language version is Haskell 98, agreed in December 1998 and revised December 2002. GHC is a state-of-the-art programming suite for Haskell. Included is an optimising compiler generating good code for a variety of platforms, together with an interactive system for convenient, quick development. The distribution includes space and time profiling facilities, a large collection of libraries, and support for various language extensions, including concurrency, exceptions, and foreign language interfaces (C, whatever). GHC is distributed under a BSD-style open source license. A wide variety of Haskell related resources (tutorials, libraries, specifications, documentation, compilers, interpreters, references, contact information, links to research groups) are available from the Haskell home page (see below). On-line GHC-related resources ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Relevant URLs on the World-Wide Web: GHC home page http://www.haskell.org/ghc/ GHC developers' home page http://hackage.haskell.org/trac/ghc/ Haskell home page http://www.haskell.org/ Supported Platforms ~~~~~~~~~~~~~~~~~~~ The list of platforms we support, and the people responsible for them, is here: http://hackage.haskell.org/trac/ghc/wiki/Contributors Ports to other platforms are possible with varying degrees of difficulty. The Building Guide describes how to go about porting to a new platform: http://hackage.haskell.org/trac/ghc/wiki/Building Developers ~~~~~~~~~~ We welcome new contributors. Instructions on accessing our source code repository, and getting started with hacking on GHC, are available from the GHC's developer's site run by Trac: http://hackage.haskell.org/trac/ghc/ Mailing lists ~~~~~~~~~~~~~ We run mailing lists for GHC users and bug reports; to subscribe, use the web interfaces at http://www.haskell.org/mailman/listinfo/glasgow-haskell-users http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs There are several other haskell and ghc-related mailing lists on www.haskell.org; for the full list, see http://www.haskell.org/mailman/listinfo/ Some GHC developers hang out on #haskell on IRC, too: http://www.haskell.org/haskellwiki/IRC_channel Please report bugs using our bug tracking system. Instructions on reporting bugs can be found here: http://www.haskell.org/ghc/reportabug

6 7

Re: ANNOUNCE: GHC version 6.12.1
by Duncan Coutts 14 Dec '09

14 Dec '09

On Mon, 2009-12-14 at 22:49 +0100, Daniel Fischer wrote: > Oh great, that's not what I expected: > > $ cabal install cabal-install > cabal: This version of the cabal program is too old to work with ghc-6.12+. > You will need to install the 'cabal-install' package version 0.8 or higher. > If you still have an older ghc installed (eg 6.10.4), run: > $ cabal install -w ghc-6.10.4 'cabal-install >= 0.8' > $ cabal install -w ghc-6.10.3 'cabal-install >= 0.8' > Resolving dependencies... > cabal: There is no available version of cabal-install that satisfies >=0.8 > > Oops, nothing higher than 0.6.4 on Hackage, even > darcs.haskell.org/cabal-install is only version 0.7.5. Right, the cabal-install 0.8.x release will appear in due course. It shouldn't be too long since I've already been using it for Hackage regression testing of ghc-6.12. > That seems to work, though, but I needed to manually install network, mtl and parsec > before bootstrap.sh ran. Yes, the bootstrap needs updating to take account of the fact that those packages are no longer shipped with ghc-6.12. Duncan

1 0

Call For Participation: DAMP 2010
by Leaf Petersen 14 Dec '09

14 Dec '09

If you're interested in what's going on with Haskell and multicores (and you should be!), please come participate in DAMP. We have several talks about Haskell work in the program this year, and I think all of the talks should be of interest to the Haskell community. Cheers, Leaf Petersen (General Chair) DAMP 2010: Workshop on Declarative Aspects of Multicore Programming Madrid, SPAIN (colocated with POPL 2010) January 19, 2010 damp10.cs.nmsu.edu The advent of multicore architectures has profoundly increased the importance of research in parallel computing. Modern platforms are becoming more complex and heterogenous and novel solutions are needed to account for their peculiarities. Multicore architectures will differ in significant ways from their multisocket predecessors. For example, the communication to compute bandwidth ratio is likely to be higher, which will positively impact performance. More generally, multicore architectures introduce several new dimensions of variability in both performance guarantees and architectural contracts, such as the memory model, that may not stabilize for several generations of product. Programs written in functional or (constraint-)logic programming languages, or in other highly declarative languages with a controlled use of side effects, can greatly simplify parallel programming. Such declarative programming allows for a deterministic semantics even when the underlying implementation might be highly non-deterministic. In addition to simplifying programming this can simplify debugging and analyzing correctness. DAMP 2010 is the fifth in a series of one-day workshops seeking to explore ideas in declarative programming language design that will greatly simplify programming for multicore architectures, and more generally for tightly coupled parallel architectures. DAMP seeks to gather together researchers in declarative approaches to parallel programming and to foster cross fertilization across different approaches. Preliminary Program: ==================== Tuesday January 19th, 2010: Invited Talk [9:00-10:00] * Parallelizing Constraint Programs. Laurent Michel (University of Connecticut) Coffee Break [10:00-10:30] Session 1 [10:30-11:30] * PASTHA - Parallelizing Stencil Calculations in Haskell Michael Lesniak * Ypnos: Declarative Parallel Structured Grid Programming Dominic Orchard, Alan Mycroft, Max Bolingbroke Coffee Break [11:30-12:00] Session 2 [12:00-13:00] * SequenceL: Transparency and Multi-core Parallelism Brad Nemanich, Daniel Cooke, Nelson Rushton * Efficient Parallel Programming in Poly/ML and Isabelle/ML David Matthews, Makarius Wenzel Lunch (PROVIDED by the Conference) [13:00-14:30] Session 3 [14:30-15:30] * S-Net for Multi-Memory Multicores Clemens Grelck, Jukka Julku, Frank Penczek * Compress-and-Conquer for Optimal Multicore Computing Z. George Mou, Hai Liu, Paul Hudak Coffee Break [15:30-16:00] Sesssion 4 [16:00-17:00] * Lightweight Ansynchrony using Parasitic Threads KC Sivaramakrishnan, Lukasz Ziarek, Raghavendra Prasad, Suresh Jagannathan * A Parallel ASP Instantiator Based on DLV Simona Perri, Francesco Ricca, Marco Sirianni Invited Talk [17:00-18:00] * Declarative Data-Parallel Programming with the Accellerator System Satnam Singh (Microsoft Research) URL: ==== http://damp10.cs.nmsu.edu

1 0

GT-VMT 2010: deadlines extended
by Emilio Tuosto 14 Dec '09

14 Dec '09

[We apologize for multiple copies] ==================================================== Call for Papers 9th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2010) http://www.cs.le.ac.uk/events/gtvmt10/ Satellite Event of ETAPS 2010, Cyprus -- March 20-21, 2010 =================================================== Due to several requests, we have decided to extend the deadlines as follows. * NEW DATES * December 23, 2009 Abstract Submission December 27, 2009 Paper Submission January 15, 2010 Notification of Acceptance January 22, 2010 Camera ready version March 20-21, 2010 Workshop * Submissions * The proceedings of GT-VMT10 will be published in the journal Electronic Communications of the EASST. A preliminary version of the proceedings will be available at the workshop. Papers should not exceed 12 pages. For preparing your manuscript, the EASST templates can be downloaded at http://eceasst.cs.tu-berlin.de/template/ The online submission and review system is available at http://www.easychair.org/GTVMT2010/ * Chairs * Jochen Kuester, IBM Zurich Research, JKU [at] zurich.ibm.com Emilio Tuosto, University of Leicester, emilio [at] mcs.le.ac.uk * Program Committee * Paolo Baldan (University of Padova, Italy) Artur Boronat (University of Leicester, UK) Andrea Corradini (University of Pisa, Italy) Claudia Ermel (TU Berlin, Germany) Gregor Engels (University of Paderborn, Germany) Reiko Heckel (University of Leicester, UK) Thomas Hildebrandt (IT University of Copenhagen, Denmark) Holger Giese (HPI Potsdam, Germany) Barbara Koenig (University of Duisburg-Essen) Jochen Kuester (IBM Research - Zurich) [co-chair] Alberto Lluch Lafuente (University of Pisa, Italy) Juan de Lara (Universidad Autonoma de Madrid, Spain) Mark Minas (Universitat der Bundeswehr Muenchen, Germany) Francesco Parisi-Presicce (University of Rome, Italy) Arend Rensink (University of Twente, Netherlands) Gabriele Taentzer (University of Marburg, Germany) Emilio Tuosto (University of Leicester) [co-chair] Daniel Varro (TU Budapest, Hungary) Erhard Weinell (RWTH Aachen University) Albert Zuendorf (University of Kassel, Germany) * Scope * GT-VMT 2010 is the ninth workshop of a series that serves as a forum for all researchers and practitioners interested in the use of graph-based notation, techniques, and tools for the specification, modeling, validation, manipulation and verification of complex systems. The aim of the workshop is to promote engineering approaches that provide effective sound tool support for visual modeling languages, enhancing formal reasoning at the semantic level (e.g., for model analysis, transformation, and consistency management) in different domains, such as UML, Petri nets, Graph Transformation or Business Process/Workflow Models. This year's workshop will have a special focus on visualization, simulation, and verification of concurrent and distributed systems. Concurrency and distribution are among the most vital concerns to nowadays computing due to the importance of interconnected systems and the increased diffusion of multi-core architectures. Nevertheless, concurrent and distributed systems are hard to specify, design, verify and implement. Visual and graph-based techniques may be exploited to cope with the complexity in engineering of and reasoning about concurrent and distributed systems. In fact, graph-based approaches have recently been successfully applied to represent several computational aspects of different classes of distributed systems ranging from mobile systems a-la pi-calculus, to coordination in service-oriented systems, to communication networks. The aim of the workshop is to promote graph- and visual-based approaches for modelling, designing, implementing and reasoning about concurrent and distributed systems. The general areas of interest range from non-functional aspects (e.g., security, quantitive aspects), to (semi)formal modelling frameworks, to visual techniques for distributed and concurrent systems. Besides the traditional topics of the GT-VMT series like - visual language definition (incl. metamodelling, grammars, graphical parsing, etc.) - syntax and semantics of visual languages (incl. OCL, graph patterns, simulation, animation, compilation, verification & validation, static analysis techniques, etc.) - model transformations - graph transformations and visual modeling techniques in engineering, biology, and medicine - case studies and novel application areas - tool support and efficient algorithms more focused topics of interest include but are not limited to - visual and graph-based languages for distributed systems - graph models of distributed computations - verification and validation of distributed systems with visual techniques - graphical static & dynamic analysis of distributed systems - graphs for architectural design languages for distributed systems - visual techniques for modeling process choreographies and distributed workflows - visual/graph-based approaches to distributed coordination mechanisms - graph-based semantics models of novel distributed architectures (e.g., service oriented, GRID, P2P computing, and context aware/adaptive distributed applications) - model transformations of graphical into textual formalisms for distributed systems - model transformations and their application in model-driven development of distributed and concurrent systems - relating models/visual tools for concurrency/distribution - ... *************************************************************** Emilio Tuosto Department of Computer Science University of Leicester Leicester, LE1 7RH United Kingdom Tel. +44 (0) 116 252 5392 Fax. +44 (0) 116 252 3915 homepage -> http://www.cs.le.ac.uk/people/et52 *************************************************************** -- *************************************************************** Emilio Tuosto Department of Computer Science University of Leicester Leicester, LE1 7RH United Kingdom Tel. +44 (0) 116 252 5392 Fax. +44 (0) 116 252 3915 homepage -> http://www.cs.le.ac.uk/people/et52 ***************************************************************

1 0

Haskell Weekly News: Issue 142 - December 13, 2009
by jfredett＠gmail.com 13 Dec '09

13 Dec '09

--------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20091213 Issue 142 - December 13, 2009 --------------------------------------------------------------------------- Welcome to issue 142 of HWN, a newsletter covering developments in the [1]Haskell community. First of all, apologies for the late edition, I've only one set of finals left, and then everything should return to a normal schedule (at least, that's the plan). This week brings lots of development on the various usb utilities, an edition of the Haskell Web News (which covers, in summary, the events of the previous month in the Haskell online community), and some really great discussion about why Haskell is Pure. Until next week, Haskeller's, your Haskell Weekly News! Announcements Next meeting: December 17th at MIT (32-G882). Ravi Nanavati [2]announced the next meeting of the Boston Area Haskell User Group. Ryan Newton will be talking about Intel Concurrent Collections for Haskell. PCLT-0.1 and PCLT-DB-0.1. Andrey Sisoyev [3]announced his first two packages he's developed in Haskell. Both of his new packages relate to localization of packages. Announcing a summer internship for a NASA-sponsored project. Lee Pike [4]announced a new summer internship sponsored by NASA and Galois, Inc. unicode-symbols-0.1.1. Roel van Dijk [5]announced the release of his package 'unicode-symbols'. This packages offers alternative symbols for a number of common function and operators from the base and container packages. ls-usb-0.1.0.2. Roel van Dijk [6]announced a minor update of ls-usb, his package for listing USB devices connected to your system. usb-safe-0.1. Bas van Dijk [7]announced the release of his package usb-safe, which provides an abstract interface to the bindings-libusb library. usb-0.3. Bas van Dijk [8]announced a new release of his 'usb' library for high-level communication with usb devices from Haskell. bindings-libusb-1.4.2. Bas van Dijk [9]announced a new version of bindings-libusb, a DSL based, low level binding to libusb The Haskell Web News: December 2009 Edition. Don Stewart [10]announced the Haskell Web News for December. new installment of failure framework. Michael Snoyman [11]announced the next installment of the Failure Framework. PortAudio Windows Tutorial and Binaries. M Xyz [12]announced a tutorial for setting up PortAudio on Windows readline-statevar-1.0.1.0. Krzysztof Skrzetnicki [13]announced a small wrapper for readline. hakyll-0.1. Jasper van der Jeugt [14]announced Hakyll, a simple static site generator written in Haskell. Discussion Why? John D. Earle [15]asked about what benefits of purity in Haskell. Type system speculation. Andrew Coppin [16]asked about why we Haskeller's (including himself) are so obsessed with the type system. To Hackage or not to Hackage. John Van Enk [17]asked about whether it was worth putting a package on Hackage. Hayoo and Hoogle (beginner question). drostin77 [18]asked our 'Hopefully Helpful Haskell Community' about the differences between Hoogle and Hayoo. Blog noise [19]Haskell news from the [20]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Manuel M T Chakravarty: [21]Using DTrace to track scheduler events of GHC's runtime. * Darcs: [22]darcs weekly news #47. * Brent Yorgey: [23]Mgu's and universal properties. * Philip Wadler: [24]Computer Science Education Week. * Bryan O'Sullivan: [25]The performance of Data.Text. * Neil Brown: [26]Solving the Santa Claus Problem with Conjunction. * Douglas M. Auclair (geophf): [27]Don't know; don't care: Whatever. * Ivan Lazar Miljenovic: [28]Command Input/Output and blocking. * Galois, Inc: [29]Tech Talk: John Launchbury presents Conal Elliottâs âBeautiful Differentiationâ. * Well-Typed.Com: [30]Talk at the Functional Programming eXchange. * Neil Brown: [31]The Problem with Parallel Participants Professing Priority. * Sean Leather: [32]Draft: "Pull-Ups, Push-Downs, and Passing It Around: Exercises in Functional Incrementalization". * Mikael Vejdemo Johansson (Syzygy-): [33]Coordinatization with hom complexes. * Haskell Web News: [34]What's new in Haskell? December 2009. * Dan Piponi (sigfpe): [35]Where do monads come from?. * Michael Snoyman: [36]Two language extensions. Quotes of the Week * sproingie: | {-# LANGUAGE NoTypeChecking #-} * kmc: the usual structure for a Haskell program is a crunchy IO shell with a gooey chocolate pure function center * sproingie: if it makes Cale's brane asplode, i think there's no hope for me understanding it * Wikipedia: In topology, the long line (or Alexandroff line) is a topological space analogous to the real line, but much longer. * ray: a monad tutorial is like a sausage factory * TomTobin: ::facepalm:: I wrote "Foobar" as a placeholder as I was typing [for the author's name], and never replaced it [in my email]. * ski: > (let id :: (forall id. id -> id) -> id -> id; id id = id id in id) id 5 * dmwit: analogies are endofunctors in the category of bad explanations * knobo: I really like this :) I can see that haskell is really cool now. This i a "matrix moment" for me :) About the Haskell Weekly News New editions are posted to [37]the Haskell mailing list as well as to [38]the Haskell Sequence and [39]Planet Haskell. [40]RSS is also available, and headlines appear on [41]haskell.org. To help create new editions of this newsletter, please see the information on [42]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [43]http://patch-tag.com/r/jfredett/HWN2/pullrepo HWN2 . References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67829 3. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67818 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67637 5. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67628 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67624 7. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67623 8. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67622 9. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67621 10. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67455 11. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67417 12. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67407 13. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67328 14. http://article.gmane.org/gmane.comp.lang.haskell.cafe/67312 15. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/67702 16. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/67658 17. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/67551 18. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/67412 19. http://planet.haskell.org/ 20. http://haskell.org/haskellwiki/Blog_articles 21. http://justtesting.org/post/281294210 22. http://blog.darcs.net/2009/12/darcs-weekly-news-47.html 23. http://byorgey.wordpress.com/2009/12/11/mgus-and-universal-properties/ 24. http://wadler.blogspot.com/2009/12/computer-science-education-week.html 25. http://www.serpentine.com/blog/2009/12/10/the-performance-of-data-text/ 26. http://chplib.wordpress.com/2009/12/10/solving-the-santa-claus-problem-with… 27. http://logicaltypes.blogspot.com/2008/07/dont-know-dont-care-whatever.html 28. http://ivanmiljenovic.wordpress.com/2009/12/10/command-inputoutput-and-bloc… 29. http://www.galois.com/blog/2009/12/09/tech-talk-john-launchbury-presents-co… 30. http://blog.well-typed.com/2009/12/talk-at-the-functional-programming-excha… 31. http://chplib.wordpress.com/2009/12/08/the-problem-with-parallel-participan… 32. http://feedproxy.google.com/~r/splonderzoek/~3/vjibqjB5x04/draft-pull-ups-p… 33. http://blog.mikael.johanssons.org/archive/2009/12/coordinatization-with-hom… 34. http://haskellwebnews.wordpress.com/2009/12/05/whats-new-in-haskell-decembe… 35. http://blog.sigfpe.com/2009/12/where-do-monads-come-from.html 36. http://snoyberg.wordpress.com/2009/12/07/two-language-extensions/ 37. http://www.haskell.org/mailman/listinfo/haskell 38. http://sequence.complete.org/ 39. http://planet.haskell.org/ 40. http://sequence.complete.org/node/feed 41. http://haskell.org/ 42. http://haskell.org/haskellwiki/HWN 43. http://patch-tag.com/r/jfredett/HWN2/pullrepo%20HWN2

1 0