September 2009 - Haskell

ANNOUNCE: uvector-algorithms 0.2
by Dan Doel 08 Sep '09

08 Sep '09

Greetings, It is my pleasure to announce version 0.2 of the uvector-algorithms package. The package so far has implementations of several sorting and selection algorithms for use on the mutable arrays from the uvector library, as well as combinators for applying them to immutable arrays. New developments in this version include: - A simple benchmarking program for testing the performance of the algorithms (it's what I use to measure them, but I only have one computer to run it on, so perhaps other folks might want to see how it works on their machine) - A testing program, written with quick check to verify properties of the algorithms - Several bugs found and fixed due to the above tests and using HPC to verify good program coverage - Combinators for Schwartzian transform - Reworking radix sort to be more amenable to optimization. It's now around twice as fast. - A Radix instance for strict pairs, and a radix sortBy - Merge sort is now slightly faster due to memcpy in uvector :) The library can be found at hackage: http://hackage.haskell.org/package/uvector-algorithms or in its darcs repository: http://code.haskell.org/~dolio/uvector-algorithms/ As always, I can be notified of any issues. Enjoy. -- Dan

1 0

Ph.D position, Utrecht University, the Netherlands
by S.Doaitse Swierstra 08 Sep '09

08 Sep '09

=================================================== Vacancy PhD student on Realizing Optimal Sharing in the Functional Language Implementations Utrecht University, The Netherlands. =================================================== Within the Software Technology group of the Information and Computing Sciences department of Utrecht University there is a vacancy for a PhD student to work on the efficient implementation of functional languages. The position is funded by NWO, the Netherlands Organization for Scientific Research. ----------------------------------------------------------------------------------------- Project summary: Lambda-calculus and term rewriting are models of computation lying at the basis of functional programming languages. Both possess syntactic meta-theories based on analyzing rewrite steps. Unfortunately, naive implementations are inefficient, since subterms are frequently copied. To overcome this problem in both theoretical systems and actual implementations, duplicate work is avoided by using graph-based term representations, in which identical subterms can be (but not always are) shared. The question arises whether graph-representations and their reductions that are optimal in a theoretical sense can also be practical from an implementer's point of view. However, so far it is unclear whether nice theoretical ideas combine well with existing implementation methods. The overall-goal of this project is to answer this question in a back-and-forth communication between theoretical concepts and practical realizations. Starting points are the recent work on the optimal Lambdascope implementation based on context sharing, and the Haskell implementation developed at Utrecht University. One of the open problems is whether the Lambdascope framework can be extended to efficiently represent sets of mutually recursive definitions. Another, whether global program analysis can discover where Lambdascope-based approaches solve problems due to insufficient sharing. If both questions can be solved, we want to combine Lambdascope-based implementations with conventional frameworks, and investigate how efficient the resulting implementations become. The unique combination of the theoretical depth from the Logic department and the implementation skills and compiler infrastructure from the Computer Science department make Utrecht University the optimal surroundings for such a project. ----------------------------------------------------------------------------------------- Project leaders are Prof.dr. Doaitse Swierstra and dr. Vincent van Oostrom (principal investigator). The project will be executed in close cooperation between * the Software Technology group (http://www.cs.uu.nl/wiki/Center) of the Information and Computing Sciences department (http://www.cs.uu.nl/ ) * and the Theoretical Philosophy group (http://www.uu.nl/EN/faculties/Humanities/research/researchinstitutes/zeno/r… ) of the Philosophy department (http://www.phil.uu.nl/) and between * the more practically oriented PhD student and * the more theory oriented postdoc. ----------------------------------------------------------------------------------------- Requirements: Master degree in Computer Science, Logic, or equivalent. Good knowledge of functional programming, and several advanced computer science techniques. Knowledge of lambda-calculus implementations, Haskell, and compiler construction will be useful. Both theory and software development based on this should appeal to you. Terms of employment: the PhD student should start as soon as possible, but no later than January 1, 2010. The position is for four years (after one year there will be an evaluation), full-time. Gross salary starts with € 2042,-- per month in the first year and increases to € 2612,-- in the fourth year of employment. The salary is supplemented with a holiday bonus of 8% and an end-of-year bonus of 3%. In addition we offer: a pension scheme, partially paid parental leave, facilities for child care, flexible employment conditions in which you may trade salary for vacation days or vice versa. Conditions are based on the Collective Employment Agreement of the Dutch Universities: http://www.vsnu.nl/Workstudy/Universities-as-employers-/Collective-Labour-A… More information: * about the project can be found on http://www.cs.uu.nl/wiki/bin/view/Center/OptimalSharing * about the Software Technology group on http://www.cs.uu.nl/wiki/Center * about the Information and Computing Sciences department on http://www.cs.uu.nl/ * about this vacancy can be obtained from Doaitse Swierstra (doaitse(a)cs.uu.nl , +31 6 4613 6929). Send your application in pdf (or another non-proprietary format) to mailto:SciencePenO@uu.nl with a cc to mailto:doaitse@cs.uu.nl. on or before Sept 31, 2009. Mention vacancy nr 62910.

1 0

Looking for a new HWN editor
by Brent Yorgey 08 Sep '09

08 Sep '09

Executive summary: * I'm looking for someone to take over as HWN editor * It is highly automated and doesn't take as much time as you might think (about 3-4 hours/week on average) * You DON'T need to be a Haskell guru * It is far from a thankless job and is a fun way to provide an appreciated service to the community! Read on for more details! ------------------------------------------------------------------------- Hi all, As you probably know, I've been the editor of the Haskell Weekly News for a little over a year now, and I've decided that it's time for me to move on to other things. So, I'm looking for someone to volunteer to take over as HWN editor. Why might you want to do this? It's true that there is no concrete reward. But judging from the number of comments I have received from people over the past year, the HWN provides a valuable and appreciated service to the Haskell community: there are many who simply don't have time to read the mailing lists, but like to know about new libraries, compiler releases, interesting discussions, and other major goings-on in the community. What does the editorship entail? Thanks to some automated tools developed specifically for the job, it doesn't take as much time as you might think: usually about 4 hours per week; most of that is spent simply reading/skimming various Haskell mailing lists to pick out items for the HWN. The process generally goes like this: * pick out funny quotes from the IRC channel using an automated tool * pick out Haskell-related blog posts using an automated tool * pick out announcements and discussions from the mailing list with an automated tool, writing a short blurb for each (usually this just involves cutting and pasting from the announcement itself, with a bit of editing to make it flow * compile text and HTML versions with an automated tool * post to sequence.complete.org and the mailing list. There are much more detailed instructions written up, and of course I'll be happy to provide detailed help and support for the first few weeks of the new editor's tenure. I should emphasize that the HWN editor does NOT need to be a Haskell guru. In fact, this could be an ideal job for someone who is relatively new to Haskell and the community, but would like to contribute in a tangible way. I also want to emphasize that with the change in editorship, the HWN need not remain exactly the same: if you have exciting ideas about changes to make to the format or content, be my guest! The HWN will be whatever you make of it. So, let me know if you are interested! There won't be any formal interview process; the first person to contact me who wants to do it, gets the job. But of course, if you are not sure and want more information, feel free to email me with questions. -Brent

4 6

CfPart: FMICS 2009, 2-3 November 2009
by Christophe Joubert 08 Sep '09

08 Sep '09

FMICS 2009 - FIRST CALL FOR PARTICIPATION 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 ** * * * * >> Full programme for FMICS 2009 now available * * * * >> Registration for FMICS 2009 is open * * Early registration before September 14 * * * * >> FMICS 2009 proceedings available as LNCS 5825 * * * ************************************************************ FMICS 2009 is the fourteenth in a series of International Workshop on Formal Methods for Industrial Critical Systems. Previous workshops of the ERCIM working group on Formal Methods for Industrial Critical Systems were held in Oxford (March 1996), Cesena (July 1997), Amsterdam (May 1998), Trento (July 1999), Berlin (April 2000), Paris (July 2001), Malaga (July 2002), Trondheim (June 2003), Linz (September 2004), Lisbon (September 2005), Bonn (August 2006), Berlin (July 2007), and L'Aquila (September 2008). The aim of the 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 who are active in the area of formal methods and are 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. Complete and up to date information can be found at the event website http://users.dsic.upv.es/workshops/fmics2009/. FMICS 2009 is part of the 1st FMweek (Formal Methods week, http://www.win.tue.nl/fmweek/) which brings together 10 international scientific events, 6 project and working group meetings, and a variety of other activities in the area. Further information about the FMICS working group and the next FMICS workshop can be found at: http://www.inrialpes.fr/vasy/fmics. The topics chosen for FMICS 2009 include: - 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 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 new research directions; - impact and costs of the adoption of formal methods; - application of formal methods in standardization and industrial forums; In response to the call for papers, 24 contributions were submitted from 16 different countries. The Program Committee selected ten papers, basing this choice on their scientific quality, originality, and relevance to the workshop. Each paper was reviewed by at least three Program Committee members or external referees. The programme also includes four invited contributions as well as six poster descriptions. INVITED SPEAKERS ---------------- Dino Distefano Queen Mary, University of London, UK Diego Latella CNR/ISTI, Italy Thierry Lecomte ClearSy, France Ken McMillan Cadence Berkeley Labs, USA Following a tradition established over the past few years, the European Association of Software Science and Technology (EASST) will offer an award to the best FMICS paper. VENUE ----- The venue for FMICS 2009 is the Auditorium of Eindhoven University of Technology. The university campus lies in the centre of Eindhoven, within walking distance of conference hotels. The city itself can easily be reached via both its own airport and Schiphol (the Dutch mainport). REGISTRATION ------------ The event website provides a one-stop window where participants can register to FMICS 2009 and to any combination of FMweek events they would like to participate in, and make hotel reservation for their stay in Eindhoven. ************************************************************ * * * +============================================+ * * | | * * | ** FMweek ** | * * | | * * +============================================+ * * | FMICS | FM2009 | REFINE | * * +--------------------------------------------+ * * | PDMC | TESTCOM/FATES | * * +--------------------------------------------+ * * | FACS | CPA | FAST | FMCO | * * +--------------------------------------------+ * * | http://www.win.tue.nl/fmweek | * * +============================================+ * * * ************************************************************ SPONSORS -------- FMICS 2009 is sponsored by the following institutions: the Universidad Politecnica de Valencia, ERCIM, FME, Microsoft Research, the Departamento de Sistemas Informaticos y Computacion (UPV), MEC (Feder) Tin2007-30509-E, EASST, and the Technical University of Eindhoven.

1 0

Last Call for Papers: VSTTE 2009
by Jean-Christophe Filliâtre 08 Sep '09

08 Sep '09

********************************************************* * * * VSTTE 2009 * * * * Workshop on Verified Software * * Theory Tools and Experiments * * * * (affiliated with Formal Methods Week) * * * * November 2, 2009 * * Eindhoven, the Netherlands * * http://vstte09.lri.fr/ * * * * Deadline for submissions: Sep 11, 2009 * * * ********************************************************* FM 2009 is the sixteenth in a series of symposia of the Formal Methods Europe association, and the second one that is organized as a world congress. Ten years after FM'99, the 1st World Congress, the formal methods communities from all over the world will once again have an opportunity to meet. FM 2009 will be both an opportunity to celebrate, and an opportunity to join in when enthusiastic researchers and practitioners from a diversity of backgrounds and schools come together to discuss their ideas and experiences. The workshop on Verified Software: Theories, Tools, and Experiments (VSTTE 2009) will take place on November the 2nd. The focus of this workshop will be on tools, as previous VSTTE conferences in Zurich and Toronto emphasised theories and experiments. Consisting of contributed papers and invited talks, the workshop will focus on the tools behind the development of systematic methods for specifying, building, and verifying high-quality software. This includes topics like: * Program logic * Specification and verification techniques * Tool support for specification languages * Tool for various design methodologies * Tool integration and plug-ins * Automation in formal verification * Tool comparisons and benchmark repositories * Combination of tools and techniques (e.g. formal vs. semiformal, software specification vs. engineering techniques) * Customizing tools for particular applications Papers about tool architectures, and their achievements are most welcome. The contributed papers, which should report on previously unpublished work, can reflect current and preliminary work in areas of software verification. New technical results, overviews of new developments in software verification projects, short papers accompanying tool demonstrations, as well as position papers on how to further advance the goal of verified software are all welcome. SUBMISSION PROCEDURE ==================== VSTTE proceedings will be published as a special issue of the Software Tools for Technology Transfer (STTT) journal. Submitted papers should not have been submitted elsewhere for publication. Papers should use Springer-Verlag's STTT package ftp://ftp.springer.de/pub/tex/latex/svjour/sttt/, and should not exceed 15 pages including appendices. Papers are processed through the EasyChair conference management system. IMPORTANT DATES =============== Submission deadline September 11, 2009, 11:59pm Samoa time (UTC-11) Notification of acceptance October 2, 2009 Final version October 16, 2009 PROGRAM COMMITTEE ================= * David Deharbe, Dimap UFRN, Brazil * Dino Distefano, Queen Mary University of London, UK * Jean-Christophe Filliâtre (co-chair), CNRS, France * Leo Freitas (co-chair), University of York, UK * John McDermott, Naval Research Laboratory, USA * Yannick Moy, AdaCore, France * Arnaud Venet, Kestrel Technology, USA CONTACT ======= Leo Freitas, leo(a)cs.york.ac.uk Department of Computer Science University of York, YO10 5DD York, UK Tel: (+44) (0) 1904 434753 Jean-Christophe Filliatre, Jean-Christophe.Filliatre(a)lri.fr CNRS / INRIA Saclay - Ile-de-france - ProVal Parc Orsay Universite, batiment N 4, rue Jacques Monod 91893 Orsay Cedex FRANCE Tel: (+33) (0)1 74 85 42 27 FURTHER INFORMATION =================== Further information will be put on the workshop web-page http://vstte09.lri.fr/.

1 0

ANNOUNCE: dbmigrations 0.1
by Jonathan Daugherty 08 Sep '09

08 Sep '09

dbmigrations is: A library and program for the creation, management, and installation of schema updates (called migrations) for a relational database. In particular, this package lets the migration author express explicit dependencies between migrations and the management tool automatically installs or reverts migrations accordingly, using transactions for safety. This package is written to support any HDBC-supported database, although at present only PostgreSQL is fully supported. To get started, see the included README and MOO.TXT files and the usage output for the "moo" command. Get it from Hackage: http://hackage.haskell.org/package/dbmigrations Or get the source with darcs: http://repos.codevine.org/dbmigrations/ This package is motivated by the need for a framework-independent, solid tool to manage database schema changes in a clean way without assuming a linear sequence of changes assumed by existing tools. dbmigrations lets you manage a forest of schema changes. Future work will include an hscurses-based tool to visualize and manipulate available migrations and their dependencies and support for other database engines. Please don't hesitate to send patches, feedback, and criticism directly to me at drcygnus AT gmail DOT com. I'd like to say thanks to Josh Hoyt and Jason Dagit for suggesting improvements, providing support, and showing me how beautiful Haskell is. Thanks! Enjoy! -- Jonathan Daugherty

1 0

ANNOUNCE: Palindromes 0.1
by Johan Jeuring 06 Sep '09

06 Sep '09

Palindromes ============================================== Palindromes is a package for finding palindromes in files. Visit the homepage http://www.jeuring.net/Palindromes/ Features -------- The primary features of Palindromes include: * Linear-time algorithm for finding exact palindromes * Linear-time algorithm for finding text palindromes, ignoring spaces, case of characters, and punctuation symbols. Requirements ------------ Palindromes has the following requirements: * GHC version 6.8.1 or later - It has been tested with version 6.10.1. * Cabal library version 1.2.1 or later - It has been tested with version 1.6.0.1. Download & Installation ----------------------- * Use cabal-install cabal install palindromes * If you don't have cabal-install, you must download the Palindromes package from HackageDB and install it manually. Get the `tar.gz` file and decompress it. http://hackage.haskell.org/package/palindromes Once downloaded, use the following commands for configuring, building, and installing the library. runghc Setup.lhs configure runghc Setup.lhs build runghc Setup.lhs install * Get the source: svn checkout https://subversion.cs.uu.nl/repos/staff.johanj.palindromes/ Documentation ------------- The API is documented using Haddock and available on the Palindromes package site. Examples -------- You can find example palindromes, on which Palindromes has been tested, in the `examples` directory of the source distribution. https://subversion.cs.uu.nl/repos/staff.johanj.palindromes/trunk/examples/p… Bugs & Support -------------- To report bugs, use the Google Code project page for Palindromes. http://code.google.com/p/palindromes/ For general concerns and questions, email the author: johan at jeuring.net Licensing --------- Palindromes is licensed under the so-called BSD3 license. See the included `LICENSE` file. Credits ------- Palindromes is based on the functional program developed by Johan Jeuring in his PhD thesis. The current author and maintainer of Palindromes is Johan Jeuring. http://www.jeuring.net/

1 0

Haskell Weekly News: Issue 129 - September 5, 2009
by Brent Yorgey 05 Sep '09

05 Sep '09

--------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20090905 Issue 129 - September 05, 2009 --------------------------------------------------------------------------- Welcome to issue 129 of HWN, a newsletter covering developments in the [1]Haskell community. The [2]Haskell Symposium was a great success, with many [3]interesting talks and a good discussion on the future of Haskell. Watch this space for links to video from the Symposium as it becomes available! Announcements HStringTemplate 0.6.2. Sterling Clover [4]announced some new features in the [5]HStringTemplate library, including simple quasiquotation; proper Unicode support; creation of groups from hierarchies of directories; separators applied within iterated template application; depthwise chained iterated template application; generalized encoding functions; and more. fclabels-0.4.0 - First class accessor labels. Sebastiaan Visser [6]announced a new release of the [7]fclabels package, straight from ICFP in Edinburgh. The package provides first-class labels which act as fully composable, bidirectional record fields, as well as support for automatically generating them from record types. vty-4.0.0.1 released. Corey O'Connor [8]announced release 4.0.0.1 of [9]vty, a terminal UI library. This release brings a number of important fixes, features, and performance enhancements, including a completely rewritten output backend; efficient, "scanline rasterization" style output span generator; terminfo based display terminal implementation; improved Unicode support; 256 color support; and more. haskell-src-exts-1.1.4. Niklas Broberg [10]announced the release of [11]haskell-src-exts-1.1.4, a package for Haskell source code manipulation. The experimental code in Language.Haskell.Annotated{.*} has changed quite a lot, although the stable portion of the package interface has not changed. Significantly, the package now includes an exact-printer which allows round-tripping between parsing and pretty-printing to be the identity. Next BostonHaskell meeting: September 16th at MIT (32G-882). Ravi Nanavati [12]announced the September meeting of the Boston Area Haskell Users' Group, to be held Wednesday, September 16th from 7pm - 9pm. As usual, it will be held in the MIT CSAIL Reading Room (32-G882, on the 8th floor of the Gates Tower of the MIT's Stata Center at 32 Vassar St in Cambridge, MA). The featured speaker will be Edward Kmett, who will be presenting the second part of his monoids and parsing presentation: "A Parallel Parsing Trifecta: Iteratees, Parsec, and Monoids". lenses -- Simple Functional Lenses. Job Vranish [13]announced the release of [14]lenses, a simple but powerful implementation of function lenses (aka functional references/accessors). This library provides a convenient way to access and update the elements of a structure. It is very similar to Data.Accessors, but simpler, a bit more generic and has fewer dependencies. Dutch HUG: meeting next week (September 11th) in Utrecht. Tom Lokhorst [15]invited functional programmers in The Netherlands to the [16]Dutch Haskell User Group, meeting Friday, September 11 at 19:00 in the [17]Booth Hall of the Utrecht University Library. Thomas (noknok) will be talking about his system for doing propositional logic in Haskell. Pedro will give an introductory talk about generic programming, and Sean will talk about xformat, a library for extensible and type-safe formatting with scanf- and printf-like functions. There is also still space for short 5-minute lighting talk about something related to Haskell or functional programming; contact Tom if you're interested. moe html combinator. Jinjing Wang [18]announced the release of [19]moe, a DSL for generating HTML. jail-0.0.1 - Jailed IO monad. Sebastiaan Visser [20]announced the first release of the [21]jail package, a jailed IO monad that can restrict filesystem access for your code. scion 0.1. Thomas Schilling [22]announced the first release of [23]Scion, a Haskell library that aims to implement those parts of a Haskell IDE which are independent of a particular front-end. Scion is based on the GHC API and Cabal. It provides both a Haskell API and a server for non-Haskell clients such as Emacs and Vim. Blog noise [24]Haskell news from the [25]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Don Stewart (dons): [26]DEFUN 2009: Multicore Programming in Haskell Now!. * Bryan O'Sullivan: [27]Slides from my CUFP 2009 keynote talk. * LHC Team: [28]Yet another unfair benchmark.. * Alex McLean: [29]Hackpact documentation. * >>> Jeff Foster: [30]Exploring Haskell's List Functions. * Don Stewart (dons): [31]Parallel Programming in Haskell: A Reading List. * David Amos: [32]Finite fields, part 2. * >>> Jeff Foster: [33]Debugging in Haskell. * apfelmus: [34]Fun with Morse Code. * Ketil Malde: [35]Parsing ints. * Alex McLean: [36]Hackpact. * Greg Bacon: [37]Finding duplicates with Perl and Haskell. * Colin Adams: [38]Selecting software for a replacement for this website. * Don Stewart (dons): [39]Haskell Popularity Rankings: September 2009. * Mikael Vejdemo-Johansson: [40][Stanford] MATH 198: Category Theory and Functional Programming. * Jeff Heard: [41]HDR imaging library for Haskell based on pfsutils. * David Amos: [42]Extension fields. * Magnus Therning: [43]Trying to work out iteratees. Quotes of the Week * benmachine: ho hum. I understand both your positions. but i don't understand mine, now :( * ksf: agda is actually a secret mindwar-weapon of the illuminati, who want to wrack your nerves with excessively big symbol sets requiring a keyboard with 10 modifier keys. just like APL. * Axman6: does anyone else think that C++ looks like a dead fish? (C++<) * Cale: The difference between Many Worlds and Copenhagen is a garbage collector ;) * apfelmus: Lambda Fu, form 72 - three way dragon zip: 'averages3 xs = zipWith3 avg xs (drop 1 xs) (drop 2 xs); where avg a b c = (a+b+c) / 3' About the Haskell Weekly News New editions are posted to [44]the Haskell mailing list as well as to [45]the Haskell Sequence and [46]Planet Haskell. [47]RSS is also available, and headlines appear on [48]haskell.org. To help create new editions of this newsletter, please see the information on [49]how to contribute. Send stories to byorgey at cis dot upenn dot edu. The darcs repository is available at darcs get [50]http://code.haskell.org/~byorgey/code/hwn/ . References 1. http://haskell.org/ 2. http://www.haskell.org/haskell-symposium/2009/ 3. http://www.haskell.org/haskell-symposium/2009/schedule.html 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63108 5. http://hackage.haskell.org/package/HStringTemplate 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63082 7. http://hackage.haskell.org/package/fclabels 8. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63072 9. http://hackage.haskell.org/package/vty 10. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63068 11. http://hackage.haskell.org/package/haskell-src-exts 12. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63067 13. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63059 14. http://hackage.haskell.org/package/lenses 15. http://article.gmane.org/gmane.comp.lang.haskell.cafe/63000 16. http://www.haskell.org/haskellwiki/Dutch_HUG 17. http://www.uu.nl/EN/library/contact/university_library/zaalverhuur/Pages/de… 18. http://article.gmane.org/gmane.comp.lang.haskell.cafe/62865 19. http://hackage.haskell.org/package/moe 20. http://article.gmane.org/gmane.comp.lang.haskell.cafe/62839 21. http://hackage.haskell.org/package/jail 22. http://article.gmane.org/gmane.comp.lang.haskell.cafe/62820 23. http://hackage.haskell.org/package/scion 24. http://planet.haskell.org/ 25. http://haskell.org/haskellwiki/Blog_articles 26. http://donsbot.wordpress.com/2009/09/05/defun-2009-multicore-programming-in… 27. http://www.serpentine.com/blog/2009/09/04/slides-from-my-cufp-2009-keynote-… 28. http://lhc-compiler.blogspot.com/2009/09/yet-another-unfair-benchmark.html 29. http://yaxu.org/hackpact-documentation/ 30. http://www.fatvat.co.uk/2009/09/exploring-haskells-list-functions.html 31. http://donsbot.wordpress.com/2009/09/03/parallel-programming-in-haskell-a-r… 32. http://haskellformaths.blogspot.com/2009/09/finite-fields-part-2.html 33. http://www.fatvat.co.uk/2009/09/debugging-in-haskell.html 34. http://apfelmus.nfshost.com/fun-with-morse-code.html 35. http://blog.malde.org/index.php/2009/08/31/parsing-ints/ 36. http://yaxu.org/hackpact/ 37. http://feedproxy.google.com/~r/gbacon/~3/aaZePz6Gv2Q/finding-duplicates-wit… 38. http://colina.demon.co.uk/?q=node/753 39. http://donsbot.wordpress.com/2009/08/29/haskell-popularity-rankings-septemb… 40. http://blog.mikael.johanssons.org/archive/2009/08/stanford-math-198-categor… 41. http://vis.renci.org/jeff/2009/08/28/hdr-imaging-library-for-haskell-based-… 42. http://haskellformaths.blogspot.com/2009/08/extension-fields.html 43. http://therning.org/magnus/archives/735 44. http://www.haskell.org/mailman/listinfo/haskell 45. http://sequence.complete.org/ 46. http://planet.haskell.org/ 47. http://sequence.complete.org/node/feed 48. http://haskell.org/ 49. http://haskell.org/haskellwiki/HWN 50. http://code.haskell.org/~byorgey/code/hwn/

1 0

DAMP 2010 Final Call For Papers
by Leaf Petersen 05 Sep '09

05 Sep '09

DAMP 2010: Workshop Declarative Aspects of Multicore Programming Madrid, SPAIN (colocated with POPL 2010) January 19, 2010 damp10.cs.nmsu.edu SUBMISSION DEADLINE: SEPTEMBER 21, 2009 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. The emphasis will be on (constraint-)logic and functional programming, but any declarative programming language ideas that aim to raise the level of abstraction are welcome. DAMP seeks to gather together researchers in declarative approaches to parallel programming and to foster cross fertilization across different approaches. Specific topics include, but are not limited to: * investigation of applications of logic, constraint logic, and functional programing to multicore programing * run-time issues of exploitation of parallelism using declarative programming approaches (e.g., garbage collection, scheduling) * architectural impact on exploitation of parallelism from declarative languages * type systems and analysis for accurately detecting dependencies, aliasing, side effects, and impure features * language level declarative constructs for expressing parallelism * declarative language specification for the description of data placement and distribution * compilation and static analysis techniques to support exploitation of parallelism from declarative languages (e.g., granularity control) * practical experiences and challenges arising from parallel declarative programming * technology for debugging parallel programs * design and implementation of domain-specific declarative languages for multicore programming Submission: Submitted papers papers should not exceed 10 pages in ACM SIGPLAN conference format. Submission is electronic via: http://www.easychair.org/conferences/?conf=damp10 Accepted papers will be published in the ACM Digital Library and in a physical proceedings. Papers must adhere to the SIGPLAN Republication Policy: http://www.sigplan.org/republicationpolicy.htm Concurrent submissions to other conferences, workshops, journals, or similar forums of publication are not allowed. However, DAMP is intended to be a venue for discussion and exploration of works-in-progress, and so publication of a paper at DAMP 2010 is not intended to preclude later publication as appropriate. Additional information about the submission process can be found at the conference web site. Important dates: Abstract submission: Sept. 21 Paper submission: Sept. 25 Notification to authors: Oct. 26 Camera ready: Nov. 9 Program Chair: Enrico Pontelli New Mexico State University General Chairs: Leaf Petersen Intel Corporation Santa Clara, CA, USA Program Committee: Manuel Carro Universidad Politecnica de Madrid Clemens Grelck University of Hertfordshire Haifeng Guo University of Nebraska at Omaha Gabriele Keller University of New South Wales Hans-Wolfgang Loidl Ludwig-Maximilians-Universitat Munchen Leaf Petersen Intel Corporation John Reppy University of Chicago Ricardo Rocha University of Porto Kostis Sagonas National Technical University of Athens Vitor Santos Costa University of Porto Satnam Singh Microsoft Research Philip Trinder Heriot-Watt University Pascal Van Hentenryck Brown University URL: http://damp10.cs.nmsu.edu

1 0

ANN: vty-4.0.0.1 released
by Corey O'Connor 04 Sep '09

04 Sep '09

Vty is a terminal UI library. Release 4.0.0.1 brings a number of important fixes, features, and performance enhancements. - Completely rewritten output backend. - Efficient, "scanline rasterization" style output span generator. Has not been fully optimized, but should be fast enough. - Terminfo based display terminal implementation. With specialized derivitives for xterm, Terminal.app, and iTerm.app. - Attempts to robustly handle even terminals that don't support all display attributes. - I've tested the following terminals with success: iTerm.app, Terminal.app, xterm, rxvt, mlterm, Eterm, gnome-terminal, konsole, screen, linux vty. Hopefully you will be as successfull. - Improved unicode support. Double wide characters will display as expected. - 256 color support. See Graphics.Vty.Attributes.Color240. The actual output color is adjusted according to the number of colors the terminal supports. - The Graphics.Vty.Image combinators no longer require matching dimensions to arguments! Unspecified areas are filled in with a user-customizable background pattern. See Graphics.Vty.Picture. - output picture will be cropped to display size as expected. - GHC 6.8 support is broken :-( - Unknown Windows platform support. - API changes: - "getSize" has been removed. Use "terminal vty >>= display_bounds" where "vty" is an instance of the Vty data structure. - added a "terminal" field to the Vty data structure. Accesses the TerminalHandle associated with the Vty instance. See Graphics.Vty.Terminal for details on the API usable with a TerminalHandle. - Graphics.Vty.Types has undergone a number of changes. Summary: - Partitioned into Graphics.Vty.Attributes for display attributes. Graphics.Vty.Image for image combinators. Graphics.Vty.Picture for final picture construction. - Graphics.Vty.Attributes: - "setFG" and "setBG" are now "with_fore_color" and "with_back_color" - All other "set.." equations similarly replaced. - "attr" is now "def_attr", short for "default display attributes" Also added a "current_attr" for "currently applied display attributes" - Graphics.Vty.Image: - "horzcat" is now "horiz_cat" - "vertcat" is now "vert_cat" - "renderBS" is now "utf8_bytestring" - "renderChar" is now "char" - "renderFill" is now "char_fill" - added a "utf8_string" and "string" (AKA "iso_10464_string") for UTF-8 encoded Strings and ISO-10464 encoded Strings. String literals in GHC have an ISO-10464 runtime representation. - Graphics.Vty.Picture: - exports Graphics.Vty.Image - "pic" is now "pic_for_image" - added API for setting background fill pattern. issues resolved: - "gnome terminal displays non-basic attributes as strikethrough" - http://trac.haskell.org/vty/ticket/14 - "Multi-byte characters are not displayed correctly on update" - http://trac.haskell.org/vty/ticket/10 - "Redraw does not handle rendering a line that extends beyond screen width characters" - http://trac.haskell.org/vty/ticket/13 - "The <|> and <-> combinators should be more forgiving of mismatched dimensions" - http://trac.haskell.org/vty/ticket/9 - "256-color support" - http://trac.haskell.org/vty/ticket/19

1 0