- Haskell - Haskell.org

Haskell Weekly News: Issue 145 - January 10, 2010
by jfredett＠gmail.com 10 Jan '10

10 Jan '10

--------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20100110 Issue 145 - January 10, 2010 --------------------------------------------------------------------------- Welcome to issue 145 of HWN, a newsletter covering developments in the [1]Haskell community. Welcome back Haskellers to the HWN! After a short hiatus we return with a megaedition covering the last three weeks of Haskell news and discussion. Needless to say, lots of new package and event announcements, as well as some really great discussions (the discussion about 'lawless' uninstances of Functors was particularly interesting) over the holiday break. Hopefully everyone had a safe and happy holiday season, and is back now steadily working off the winter-weight (in accordance with resolutions or no) by tapping steadily at the keyboard, producing wonderful new packages for me to place in this, your Haskell Weekly News! Announcements Last CfP for TGC 2010: EXTENDED deadline Jan. 20 2010. Emilio Tuosto [2]announced an extension to the TGC'10 call for papers. SourceGraph-0.6.0.0 and Graphalyze-0.9.0.0. Ivan Lazar Miljenovic [3]announced new releases of the SourceGraph and Graphalyze packages. Streaming Component Combinators 0.4. Mario Blazevic [4]announced version 0.4 of Streaming Component Combinators (SCC). safer-file-handles-0.1. Bas van Dijk [5]announced a new member of the 'monadic regions' family -- safer-file-handles. This package provides safety features on top of System.IO for handling file handles and operations. HOR 2010 1st CALL FOR ABSTRACTS. Frederic Blanqui [6]1f4e gmane.comp.lang.haskell.general/17710 announced the first call for abstracts for the Fifth International Workshop on Higher-Order Rewriting. vty-4.2.1.0. Corey O'Connor [7]announced a new version of the vty package. stm-io-hooks-0.6.0. Peter Robinson [8]announced a new version of stm-io-hooks. This version includes major interface changes, including the elimation of the 'onRetry' combinator. hecc-0.2. Marcel Fourne [9]announced the second release of his elliptic curve cryptography package, hecc. This release includes a license change to the BSD3 license, speed improvements, and new algorithms for point multiplication, as well as other changes. ghc-6.12.1 binary package for OpenSolaris. Michael Lee [10]announced a binary package availability of ghc-6.12 for OpenSolaris. Final Call for Participation: TLDI'10. Andrew Kennedy [11]announced the final call for participation in TLDI'10, the Workshop on Types in Language Design and Implementation. Haskell Web News: Looking back on 2009. Don Stewart [12]announced The Haskell Web News, a monthly summary of the hottest news about the Haskell programming language. hakyll-0.4. Jasper Van der Jeugt [13]announced the release of hakyll, a static site generator library. system-uuid-1.2.0. Jason Dusek [14]announced a new release of system-uuid. New versions of ALL the monadic regions packages. Bas van Dijk [15]announced a new version of all of the monadic regions packages, explanation of what this means is best left to the original post, linked previously. tuntap-0.0.1. John Van Enk [16]announced a new package, extracted from his in-progress VPN project. This package provides access to the TUN/TAP device in Linux. CPython / libpython bindings. John Millikin [17]announced a package providing bindings to the C API for CPython/libpython. Discussion Typed Configuration Files. Sebastian Fischer [18]asked about whether there was an analogue to CmdArgs for config files. Review request for my permutations implementation. CK Kashyap [19]asked for a review of his implementation of a function for finding permutations -- in addition to a review he asked for earlier for code involving monads. The result is a nice pair of threads with introductory material about idiomatic, efficient Haskell code. lawless instances of Functor. Paul Brauner [20]asked about 'lawless' instances (Editor's Note: more so -- 'uninstances', since by definition, it cannot be a functor without satisfying the laws, even if it an instance can be written) of the `Functor` class. This is in an effort to better understand how Functors work in Haskell and in the wider theory. Blog noise [21]Haskell news from the [22]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Neil Mitchell: [23]Using .ghci files to run projects. * Tom Moertel: [24]A formal language for recipes: brain dump. * Mark Jason Dominus: [25]A monad for probability and provenance. * Alex Mason: [26]A small follow up. * Russell O'Connor: [27]Constructive Classical Completeness. * Galois, Inc: [28]GHC Nominated for Programming Language Award. * Neil Brown: [29]CHP vs CML, Forking and Picky Receivers. * Conal Elliott: [30]Is Haskell a purely functional language?. * Conal Elliott: [31]Can functional programming be liberated from the von Neumann paradigm?. * Real-World Haskell: [32]Real World Haskell in Japaneseâå®æŠã§åŠã¶é¢æ°åèšèªããã°ã©ãã³ã°. * Conal Elliott: [33]Garbage collecting the semantics of FRP. * Alex Mason: [34]Why I love Cereal. * Mark Jason Dominus: [35]A short bibliography of probability monads. * Conal Elliott: [36]Communication, curiosity, and personal style. * Epilogue for Epigram: [37]Bidirectional Basics. * Neil Mitchell: [38]Explaining Haskell IO without Monads. * Conal Elliott: [39]Is program proving viable and useful?. * Conal Elliott: [40]Why program with continuous time?. Quotes of the Week * fasta: Haskell is like an efficient version of Python and is used for the same things. * koeien37: there are the languages that everybody complains about, and the languages that nobody use * Pseudonym: Olegs can be warded off by adding a note claiming that it's impossible to implement in the type system. * elly: I leave for five minutes and godel numbering of endofunctors is invokved as a potential proof that the universe is simulated. Thanks, #haskell :P * kmc: a monad is like an invisible train filled with jello traveling backwards in time * conal: "Obviously" is one of those words that is most useful when it is least true * Jafet: Javascript is pretty much a DSL for making your web browser take up more CPU * copumpkin: limpac: in this channel we're all automata with no feelings, except for the occasional feeling of hate. * dmhouse: I'm not sure it's working correctly but it sure is fast... * Cale: We need a bunch of "Will it monad?" video clips, with "It monads!" at the end of each. * merijn: I run on HST (Hacker Standard Time) which is essentially current time zone -3 * ray: [about an anti-FP blog post] i came up with some contrived example, announced that it's impossible, and therefore FP sucks * hiredman: I used to think "dons" was a title, like people who were recognized as being really good at haskell were called dons About the Haskell Weekly News New editions are posted to [41]the Haskell mailing list as well as to [42]the Haskell Sequence and [43]Planet Haskell. [44]RSS is also available, and headlines appear on [45]haskell.org. To help create new editions of this newsletter, please see the information on [46]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [47]http://patch-tag.com/r/jfredett/HWN2/pullrepo HWN2 . References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.general/17716 3. http://article.gmane.org/gmane.comp.lang.haskell.general/17714 4. http://article.gmane.org/gmane.comp.lang.haskell.general/17713 5. http://article.gmane.org/gmane.comp.lang.haskell.general/17711 6. http://article.gmane.org/ 7. http://article.gmane.org/gmane.comp.lang.haskell.general/17705 8. http://article.gmane.org/gmane.comp.lang.haskell.general/17704 9. http://article.gmane.org/gmane.comp.lang.haskell.general/17701 10. http://article.gmane.org/gmane.comp.lang.haskell.general/17700 11. http://article.gmane.org/gmane.comp.lang.haskell.general/17699 12. http://article.gmane.org/gmane.comp.lang.haskell.general/17698 13. http://article.gmane.org/gmane.comp.lang.haskell.cafe/68864 14. http://article.gmane.org/gmane.comp.lang.haskell.cafe/68857 15. http://article.gmane.org/gmane.comp.lang.haskell.cafe/68827 16. http://article.gmane.org/gmane.comp.lang.haskell.cafe/68807 17. http://article.gmane.org/gmane.comp.lang.haskell.cafe/68388 18. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/68865 19. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/68811 20. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/68711 21. http://planet.haskell.org/ 22. http://haskell.org/haskellwiki/Blog_articles 23. http://neilmitchell.blogspot.com/2010/01/using-ghci-files-to-run-projects.h… 24. http://blog.moertel.com/articles/2010/01/08/a-formal-language-for-recipes-b… 25. http://blog.plover.com/prog/haskell/probmonad.html 26. http://random.axman6.com/blog/?p=139 27. http://r6.ca/blog/20100107T035902Z.html 28. http://www.galois.com/blog/2010/01/06/ghc-nominated-for-programming-languag… 29. http://chplib.wordpress.com/2010/01/06/chp-vs-cml-forking-and-picky-receive… 30. http://conal.net/blog/posts/is-haskell-a-purely-functional-language/ 31. http://conal.net/blog/posts/can-functional-programming-be-liberated-from-th… 32. http://www.realworldhaskell.org/blog/2010/01/05/real-world-haskell%e2%80%94… 33. http://conal.net/blog/posts/garbage-collecting-the-semantics-of-frp/ 34. http://random.axman6.com/blog/?p=124 35. http://blog.plover.com/prog/haskell/probmonad-refs.html 36. http://conal.net/blog/posts/communication-curiosity-and-personal-style/ 37. http://www.e-pig.org/epilogue/?p=283 38. http://neilmitchell.blogspot.com/2010/01/haskell-io-without-monads.html 39. http://conal.net/blog/posts/is-program-proving-viable-and-useful/ 40. http://conal.net/blog/posts/why-program-with-continuous-time/ 41. http://www.haskell.org/mailman/listinfo/haskell 42. http://sequence.complete.org/ 43. http://planet.haskell.org/ 44. http://sequence.complete.org/node/feed 45. http://haskell.org/ 46. http://haskell.org/haskellwiki/HWN 47. http://patch-tag.com/r/jfredett/HWN2/pullrepo%20HWN2

1 0

ANNOUNCE: SourceGraph-0.6.0.0 and Graphalyze-0.9.0.0
by Ivan Lazar Miljenovic 10 Jan '10

10 Jan '10

I'm pleased to announce the latest releases of SourceGraph [1] and Graphalyze [2]. [1]: http://hackage.haskell.org/package/SourceGraph [2]: http://hackage.haskell.org/package/Graphalyze SourceGraph is a program that performs static code analysis on Haskell projects on the by applying graph theoretic techniques to the project's call graph. Graphalyze is a library for analysing discrete data using graph theory, and as such performs the heavy lifting for SourceGraph. Sample analysis reports generated by SourceGraph are available at http://code.haskell.org/~ivanm/Sample_SourceGraph/SampleReports.html . I will also be demoing SourceGraph at PEPM [3] in Madrid on 19 January. [3]: http://www.program-transformation.org/PEPM10/ Changes since the previous version include: * Now supports "implicitly exported" entities (as requested by Curt Sampson). This includes instantiated class methods from other modules and functions, etc. that start with an underscore (see http://www.haskell.org/ghc/docs/latest/html/users_guide/options-sanity.html for more information). * All inaccessible entities are now reported, not just those that were root nodes in the call graph. * Edges are now colour-coded based upon whether they are part of a clique, cycle or a chain. * Level-based analyses: visualise how deep an entity is from those exported entities. * A re-done TODO that lists in detail what is planned for SourceGraph. * Lots of under-the-hood changes that don't sound as interesting as the above :-( -- Ivan Lazar Miljenovic Ivan.Miljenovic(a)gmail.com IvanMiljenovic.wordpress.com

2 4

Last CfP for TGC 2010: EXTENDED deadline Jan. 20 2010
by Emilio Tuosto 09 Jan '10

09 Jan '10

Due to several requests, the TGC'10 chairs have decided to extend the deadline for submsissions to January 20th ================================================================ Call for Papers TGC 2010 Fifth International Symposium on TRUSTWORTHY GLOBAL COMPUTING http://www.pst.ifi.lmu.de/tgc2010 LMU, Munich, February 26-26, 2010 ---------------------------------------------------------------- co-located with the review of FP6 GCII projects AEOLUS and SENSORIA ================================================================ IMPORTANT DATES --------------- Paper submissions: January 20, 2010 EXTENDED Final version (pre-proc.): February, 2010 Conference: February 24-26, 2010 Final version (post-proc.): March 22, 2010 SCOPE ------ The Symposium on Trustworthy Global Computing is an international annual venue dedicated to safe and reliable computation in global computers. It focuses on providing frameworks, tools, and protocols for constructing well-behaved applications and on reasoning rigorously about their behaviour and properties. The related models of computation incorporate code and data mobility over distributed networks with highly dynamic topologies and heterogeneous devices. We solicit papers in all areas of global computing, including (but not limited to): * theories, models and algorithms for global computing and service oriented computing * language concepts and abstraction mechanisms * security through verifiable evidence * resource usage and information flow policies * game-theoretic approaches to selfishness * verification of cryptographic protocols and their use * trust, access control and security enforcement mechanisms * sharing information and computation * efficient communication * self configuration, adaptation, and dynamic components management * software principles to support debugging and verification * test generators, symbolic interpreters, type checkers * model checkers, theorem provers, static analyzers * approximation algorithms, impossibility results, and structural properties * privacy, reliability and business integrity SUBMISSION DETAILS ------------------ Papers can be submitted online through the EASYCHAIR website http://www.easychair.org/conferences/?conf=tgc2010 Contributions must be in Postscript or PDF and consist of no more than 15 pages in the Springer LNCS style. Additional details and proofs omitted due to space limitations may be included in a clearly marked appendix. Submitted papers must describe work unpublished in refereed venues, and not submitted for publication elsewhere. PROCEEDINGS ----------- We plan to publish Springer LNCS post-proceedings shortly after the conference, to give the authors the opportunity to take into account discussions and suggestions at the conference. Pre-proceedings with the accepted papers will be made available at the conference. ORIGINS & PLANS --------------- In 2010, the symposium is co-located with the reviews of the following FP6 GCII projects: AEOLUS - Algorithmic Principles for Building Efficient Overlay Computers SENSORIA - Software Engineering for Service-Oriented Overlay Computers TGC 2008, the fourth Symposium on Trustworthy Global Computing, was held in Barcelona (Spain), on November 3 - 4, 2008. The symposium was co-located with the reviews of the FP6 GCII projects AEOLUS, MOBIUS and SENSORIA. TGC 2007 was held on November 5-6, 2007 in Sophia-Antipolis, France and it was followed by the Workshop on the Interplay of Programming Languages and Cryptography on November 7, 2007. The symposium was co-located with the reviews of the FP6 GCII projects AEOLUS, MOBIUS and SENSORIA. TGC 2006 was held in Lucca (Italy), on November 7 - 9, 2006 and it was co-located with the reviews of EU FET-IST FP6 Projects AEOLUS, MOBIUS, SENSORIA and CATNETS. The first TGC event took place in Edinburgh on April 7-9, 2005 with the co-sponsorship of IFIP TC-2, as part of ETAPS 2005. TGC 2005 was the evolution of the previous Global Computing I Workshops held in Rovereto in 2003 and 2004 (see e.g. LNCS 2874) and the workshops on Foundation of Global Computing held as satellite events of ICALP and Concur (see e.g. ENTCS Vol. 85). STEERING COMMITTE ----------------- Gilles Barthe (IMDEA Software, Madrid) Rocco De Nicola (University of Florence) Christos Kaklamanis (University of Patras) Ugo Montanari (University of Pisa) Davide Sangiorgi (University of Bologna) Don Sannella (University of Edinburgh) Vladimiro Sassone (University of Southampton) Martin Wirsing (University of Munich) PROGRAM CHAIRS -------------- Martin Hofmann - hofmann(a)tcs.ifi.lmu.de Institut fur Informatik, LMU Munich Martin Wirsing - wirsing(a)lmu.de Institut fur Informatik, LMU Munich PROGRAM COMMITTEE (to be invited!) ----------------- * Gilles Barthe (IMDEA Software, Madrid) * Roberto Bruni (University of Pisa) * Rocco De Nicola (University of Florence) * Howard Foster (Imperial College) * Samir Genaim (Universidad Complutense de Madrid) * Stefania Gnesi (ISTI, Pisa) * Martin Hofmann (LMU Munich) (co-chair) * Thomas Jensen (IRISA, Rennes) * Christos Kaklamanis (University of Patras) * Alberto Marchetti-Spaccamela (University of Roma "La Sapienza") * Paddy Nixon (University College Dublin) * Giuseppe Persiano (University of Salerno) * Geppino Pucci (University of Padova) * Paola Quaglia (University of Trento) * Don Sannella (University of Edinburgh) * Vladimiro Sassone (University of Southampton) * Maria J. Serna (Universitat Politècnica de Catalunya) * Carolyn Talcott (SRI International) * Emilio Tuosto (University of Leicester) * Nobuko Yoshida (Imperial College London) * Martin Wirsing (LMU Munich) (co-chair) * Franco Zambonelli (University of Modena) LOCAL ORGANIZATION ------------------ * Nora Koch (chair) * Axel Rauschmayer * Gefei Zhang -- *************************************************************** 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

ANN: Streaming Component Combinators 0.4
by Mario Blažević 08 Jan '10

08 Jan '10

Version 0.4 of Streaming Component Combinators, or SCC for short, has been released on Hackage. Get it at http://hackage.haskell.org/package/scc There isn't much new high-level functionality compared to the previous version, but the implementation has been heavily refactored and the foundations completely replaced. I'm particularly happy to have found a way to drop the ugly reliance on Data.Dynamic and to encode the required constraints in the type system instead. The foundation of streaming components in this version is the new Control.Concurrent.Coroutine module, whose main export is the monad transformer Coroutine. It can transform any monad into a suspendable, resumable, trampoline-style-runnable monad. Coroutines can be nested, which was the requirement for streaming and the main stumbling block for the implementation. The solution, worth at least 10 milliOlegs according to my estimate, was to parameterize the Coroutine with a functor that wraps the coroutine suspension, and to use nested functors for suspension from nested coroutines. The type system automatically figures out how many wrappings to apply to each suspension depending on how many intermediate coroutines it suspends. In other news is the project's Wiki page at http://trac.haskell.org/SCC/wiki/. It's still rudimentary, but growing. All feedback will be appreciated.

1 0

ANNOUNCE: New versions of ALL the monadic regions packages
by Bas van Dijk 07 Jan '10

07 Jan '10

Hello, As I explained in my announcement of 'safer-file-handles', I discovered a serious lack of expressive power in my 'regions' package. I have now solved that problem in the way I envisaged by removing the 'resource' parameter from 'RegionT' and using existential quantification to bring the 'resource' type back at the place I need it but hidden from the outside. Now you're able to open multiple types of resources in a single region which all will be closed automatically on termination of the region. These are the new releases: http://hackage.haskell.org/package/regions-0.2 http://hackage.haskell.org/package/regions-monadsfd-0.2 http://hackage.haskell.org/package/regions-monadstf-0.2.0.1 http://hackage.haskell.org/package/usb-safe-0.5 http://hackage.haskell.org/package/safer-file-handles-0.2 (Note that in the process I shuffled a bit with the API's. That's one of the reasons all these are major releases.) Do you want to see this in action? See 'example.hs' in the following package that demonstrates opening multiple different types of resources in a single region. The example extends the example in the 'usb-safe-examples' package by first opening a USB device (my USB mouse) and a temporary file in the same region. Next the device is configured, an interface is claimed and an alternate is set. Next some bytes are read from an endpoint of the device. Finally these bytes are written to the temporary file. It's fun to see this in action so do try it out: darcs get http://code.haskell.org/~basvandijk/code/usb-safe-and-safer-file-handles-ex… regards and see some of you at FP-NL tomorrow! Bas

1 0

ANNOUNCE: safer-file-handles-0.1
by Bas van Dijk 07 Jan '10

07 Jan '10

Hello, I'm happy to announce another member in the 'monadic regions' family: safer-file-handles: http://hackage.haskell.org/package/safer-file-handles-0.1 The package uses my 'regions' and 'explicit-iomodes' packages to add two safety features on top of the regular System.IO file handles and operations: * Regional file handles. Files must be opened in a region. When the region terminates all opened files are automatically closed. The main advantage of regions is that the handles to the opened files can not be returned from the region which ensures no I/O with closed files is possible. * Explicit IOModes. The regional file handles are parameterized by the IOMode in which they were opened. All operations on handles explicitly specify the needed IOMode. This way it is impossible to read from a write-only handle or write to a read-only handle for example. The primary technique used in this package is called "Lightweight monadic regions" which was invented by Oleg Kiselyov and Chung-chieh Shan. See: http://okmij.org/ftp/Haskell/regions.html#light-weight This technique is implemented in the 'regions' package which is re-exported from 'safer-file-handles'. See the 'safer-file-handles-examples' package for examples how to use this package: darcs get http://code.haskell.org/~basvandijk/code/safer-file-handles-examples regards, Bas P.S. While I wrote this message I realized a serious lack of expressive power of my regions package. Namely that I can't write a program that opens two different types of resources in the _same_ region. If for example I want to combine my usb-safe package and this package the following won't type-check: openBoth ∷ Device → FilePath → IO () openBoth usbDevice filePath = runTopRegion $ do h1 ← open usbDevice ∷ RegionT Device s IO (RegionalHandle Device (RegionT Device s IO)) h2 ← openFile filePath ReadMode ∷ RegionT File s IO (RegionalHandle File (RegionT File s IO)) return () The reason, as can be seen from the types of the monadic actions, is that the monad types differ between the two actions and bind ((>>=) :: Monad m => m a -> (a -> m b) -> m b) obviously requires them to be the same. The main problem thus, is that I parameterized the region with the type of resources. Note that I'm working on a solution where I remove the resource type from RegionT. So instead of: newtype RegionT resource s (pr ∷ * → *) α = RegionT { unRegionT ∷ ReaderT (IORef [Opened resource]) pr α } I will have: newtype RegionT s (pr ∷ * → *) α = RegionT { unRegionT ∷ ReaderT (IORef [SomeOpenedResource]) pr α } data SomeOpenedResource = ∀ resource. Resource resource ⇒ Some (Opened resource) Hopefully I will be able to release this fix before FP-NL tomorrow.

1 0

HOR 2010 1st CALL FOR ABSTRACTS
by Frederic Blanqui 07 Jan '10

07 Jan '10

************************************** * * * HOR 2010 1st CALL FOR ABSTRACTS * * * ************************************** 5th International Workshop on Higher-Order Rewriting (Affiliated with RTA'2010) Wednesday July 14, 2010, Edinburgh, UK http://hor.pps.jussieu.fr/10/ IMPORTANT DATES: March 25, 2010 : deadline electronic submission of paper April 20, 2010 : notification of acceptance of papers May 17, 2010 : deadline for final version of accepted papers HOR 2010 is a forum to present work concerning all aspects of higher-order rewriting. The aim is to provide an informal and friendly setting to discuss recent work and work in progress. HOR 2010 is part of FLoC 2010 in Edinburgh. HOR 2007 was part of RDP 2007 in Paris, France. HOR 2006 was part of FLoC 2006 in Seattle, USA. HOR 2004 was part of RDP 2004 in Aachen, Germany. HOR 2002 was part of FLoC 2002 in Copenhagen, Denmark. TOPICS of interest include (but are not limited to): APPLICATIONS: proof checking, theorem proving, generic programming, declarative programming, program transformation, automated termination/confluence tools FOUNDATIONS: pattern matching, unification, strategies, narrowing, termination, syntactic properties, type theory, complexity of derivations. FRAMEWORKS: term rewriting, conditional rewriting, graph rewriting, net rewriting, comparisons of different frameworks. IMPLEMENTATION: explicit substitution, rewriting tools, compilation techniques. SEMANTICS: semantics of higher-order rewriting, categorical rewriting, higher-order abstract syntax, games and rewriting INVITED SPEAKERS: Maribel Fernández King's College London, UK Silvia Ghilezan University of Novi Sad, Serbia PROGRAM COMMITTEE Zena Ariola University of Oregon, USA Frédéric Blanqui INRIA & Tsinghua University, China Eduardo Bonelli Universidad Nacional de Quilmes, Argentina, chair Mariangiola Dezani-Ciancaglini Università di Torino, Italy Roel de Vrijer Vrije Universiteit, The Netherlands HOR 2010 SUBMISSIONS: Abstracts between 2 and 5 pages. As HOR is meant to be a platform to discuss ongoing research we are also interested in abstracts describing work in progress, or problems in higher-order rewriting. Please use the EasyChair page http://www.easychair.org/conferences/?conf=hor2010 to submit or update your paper (updates are always possible before the deadline). Please address your questions to the PC chair, under: ebonelli * gmail.com (where '*' is replaced by '@'). PROCEEDINGS: The proceedings of HOR 2010 will be made available on the HOR 2010 web page and copies will be distributed to the participants at the workshop. Publication of post-workshop proceedings in EPTCS is under consideration. STEERING COMMITTEE Delia Kesner Université Paris 7, France Femke van Raamsdonk Vrije Universiteit, The Netherlands LOCAL ARRANGEMENTS: Venue Coordinator of the local organizing committee of FLoC'2010: Floris Geerts (fgeerts(a)inf.ed.ac.uk)

1 0

Reminder: ZuriHac - Haskell hackathon in Zurich, March 19-21
by Johan Tibell 06 Jan '10

06 Jan '10

Hi all! This is to remind you that we're organizing ZuriHac, a Haskell hackathon/get-together, to be held March 19-21 at the Google Office in Zurich, Switzerland. Lots of people have already registered but we still have space for more! If you plan on coming, please register [1] so we can make sure there's seating for everyone. Registration, travel, lodging and many other details will soon be available on the ZuriHac wiki [2]. If you have any questions don't hesitate to drop Christophe or me an email (or email addresses can be found on the wiki.) WHEN Friday March 19 2:30pm to 6:30pm Saturday March 20 10am to 6pm Sunday March 21 10am to 6pm WHERE We will be in the TechTalk area of the Google Office at Brandschenkestrasse 110. Please see the wiki [3] for directions. ORGANIZERS Johan Tibell Christophe Poucet Hope to see you in Zurich! - The ZuriHac team [1] http://haskell.org/haskellwiki/ZuriHac/Register [2] http://haskell.org/haskellwiki/ZuriHac [3] http://haskell.org/haskellwiki/ZuriHac#Getting_to_the_Google_Office

1 0

ANN: WFLP 2010 Call for participation
by Pablo Nogueira 01 Jan '10

01 Jan '10

******************************************************************** Call For Participation WFLP2010 19th International Workshop on Functional and (Constraint) Logic Programming Madrid, Spain, January 17, 2010 http://babel.ls.fi.upm.es/events/wflp2010/ ********* colocated with Principles of Programming Languages POPL 2010 http://www.cse.psu.edu/popl/10/ ******************************************************************** IMPORTANT DATES Hotel reservation deadline: December 28, 2009 VENUE WFLP2010 and all POPL'10 affiliated events will take place at the Melia Castilla Hotel, Madrid. REGISTRATION To register for WFLP2010, follow the link from the POPL 2010 page, at http://www.cse.psu.edu/popl/10/ SCOPE The aim of the Workshop on Functional and (Constraint) Logic Programming is to bring together researchers interested in functional programming and (constraint) logic programming with special emphasis on the integration of both paradigms and of other declarative programming extensions. It promotes the cross-fertilizing exchange of ideas and experiences among researchers and students from the different communities interested in the foundations, applications, and combinations of high-level declarative programming languages and related areas. INVITED SPEAKER Mariangiola Dezani (University of Torino, Italy) ACCEPTED PAPERS Transforming Functional Logic Programs into Monadic Functional Programs Bernd Brassel, Sebastian Fischer, Michael Hanus and Fabian Reck Mixed-level Embedding and JIT Compilation for an Iteratively Staged DSL George Giorgidze and Henrik Nilsson An Access Control Language based on Term Rewriting and Description Logic Michele Baggi, Demis Ballis and Moreno Falaschi Lazy and Faithful Assertions for Functional Logic Programs Michael Hanus Parameterized Models for On-line and Off-line Use Pieter Wuille and Tom Schrijvers A Denotational Semantics for Curry Jan Christiansen, Daniel Seidel and Janis Voigtlander A Declarative Debugger of Missing Answers for Functional and Logic Programming Rafael del Vado Virseda and Fernando Perez Morente Efficient and Compositional Higher-Order Streams Gergely Patai Bridging the gap between two Concurrent Constraint Languages Alexei Lescaylle Daudinot and Alicia Villanueva Garcia Large scale random testing with QuickCheck on MapReduce framework Shigeru Kusakabe and Yuuki Ikuta Automated verification of security protocols in tccp Alexei Lescaylle Daudinot and Alicia Villanueva Garcia Implementation and Evaluation of a Declarative Debugger for Java Herbert Kuchen and Christian Hermanns PROGRAM CHAIR Julio Marino (Universidad Politecnica de Madrid, Spain) PROGRAM COMMITTEE Maria Alpuente (Universidad Politecnica de Valencia, Spain) Sergio Antoy (Portland State University, USA) Bernd Brassel (CAU Kiel, Germany) Olaf Chitil (Univ. of Kent, UK) Rachid Echahed (CNRS-IMAG, France) Santiago Escobar (Universidad Politecnica de Valencia, Spain) Moreno Falaschi (Universita di Siena, Italy) Murdoch Gabbay (Heriot-Watt University, UK) Maria Garcia de la Banda (Monash University, Australia) Victor Gulias (Lambdastream SL, Spain) Michael Hanus (CAU Kiel, Germany) Herbert Kuchen (Univ. of Muenster, Germany) Francisco Lopez-Fraguas (Universidad Complutense de Madrid, Spain) James Lipton (Wesleyan University, USA) Mircea Marin (Univ. of Tsukuba, Japan) Juan Jose Moreno-Navarro (Ministry of Science & Innovation, Spain) Brigitte Pientka (McGill University, Canada)

1 0

Nominations for the Haskell 2011 committee
by Simon Marlow 29 Dec '09

29 Dec '09

So that the Haskell 2011 cycle can get underway, we are soliciting nominations for new committee members. Since this is the first time we've done this, the procedure is still somewhat unsettled and things may yet change, but the current guidelines are written down here: http://hackage.haskell.org/trac/haskell-prime/wiki/Committee In particular, on the makeup of the commitee: The committee should represent each class of stakeholders with roughly equal weight. These classes are * Implementers (compiler/tool writers) * Commercial users * Non-commercial users (e.g. open source) * Academic users (using Haskell in research) * Teachers * Authors In addition, members of the committee should be long-standing users with a deep knowledge of Haskell, and preferably with experience of language design. The committee should contain at least some members with a comprehensive knowledge of the dark corners of the Haskell language design, who can offer perspective and rationale for existing choices and comment on the ramifications of making different choices. To nominate someone (which may be yourself), send a message to haskell-prime(a)haskell.org. Please give reasons for your nomination. The current committee will appoint new commitee members and editors starting in the new year, so the deadline for nominations is 31 December 2009. During discussion amongst the current commitee, we realised that the choice of committee should be informed not just by the criteria above, but also by the particular proposals that are expected to be under consideration during this cycle. With that in mind, we plan that following the nominations the current committee will choose a "core commitee" of up to 10 members, and further members may be appointed during the year based on expertise needed to consider particular proposals. Accordingly, now would be a good time to start discussing which proposals should be considered in the Haskell 2011 timeframe, as that may affect the choice of commitee members. More details on the current Haskell Prime process are here: http://hackage.haskell.org/trac/haskell-prime/wiki/Process Cheers, Simon

2 1