- Haskell - Haskell.org

future (editor) of HCAR?
by Janis Voigtlaender 18 Sep '13

18 Sep '13

Dear all, The Haskell Communities and Activities Report has been produced twice a year for more than ten years now: http://www.haskell.org/haskellwiki/Haskell_Communities_and_Activities_Report I have been responsible for producing it the last few years, which was fun. I am now looking to pass that on, handing over the HCAR to someone else. Any takers? Editing HCAR is a few days work per year, but it is also a great way to be involved in the Haskell community - you get a lot of news first hand. There are various procedures in place that automate some of the work, and if someone is interested in taking over, I'm very willing to help along, for example producing the next edition of the report together for a smooth transition. Below I attach the previous call for contributions, which also answers some basic questions about the report. For further questions about the process etc., anybody interested simply get in touch with me. Also, such a transition is a good opportunity to rethink model and processes. Maybe you (anybody on the mailing list) have completely new ideas for how the HCAR should be organized? How it could function better? What other purposes it could serve than it has so far? ... (Or even that HCAR in its existing form is not needed anymore, but could be replaced by something great new?) Best, Janis. -------- Original-Nachricht -------- Betreff: Call for Contributions - Haskell Communities and Activities Report, May 2013 edition Datum: Mon, 08 Apr 2013 21:56:19 +0200 Von: Janis Voigtländer <jv(a)informatik.uni-bonn.de> An: Haskell <haskell(a)haskell.org> Dear all, I would like to collect contributions for the 24th edition of the ================================================================ Haskell Communities & Activities Report http://www.haskell.org/haskellwiki/Haskell_Communities_and_Activities_Report Submission deadline: 1 May 2013 (please send your contributions to hcar at haskell.org, in plain text or LaTeX format) ================================================================ This is the short story: * If you are working on any project that is in some way related to Haskell, please write a short entry and submit it. Even if the project is very small or unfinished or you think it is not important enough --- please reconsider and submit an entry anyway! * If you are interested in an existing project related to Haskell that has not previously been mentioned in the HCAR, please tell me, so that I can contact the project leaders and ask them to submit an entry. * Feel free to pass on this call for contributions to others that might be interested. More detailed information: The Haskell Communities & Activities Report is a bi-annual overview of the state of Haskell as well as Haskell-related projects over the last, and possibly the upcoming six months. If you have only recently been exposed to Haskell, it might be a good idea to browse the previous edition --- you will find interesting projects described as well as several starting points and links that may provide answers to many questions. Contributions will be collected until the submission deadline. They will then be compiled into a coherent report that is published online as soon as it is ready. As always, this is a great opportunity to update your webpages, make new releases, announce or even start new projects, or to talk about developments you want every Haskeller to know about! Looking forward to your contributions, Janis (current editor) FAQ: Q: What format should I write in? A: The required format is a LaTeX source file, adhering to the template that is available at: http://haskell.org/communities/05-2013/template.tex There is also a LaTeX style file at http://haskell.org/communities/05-2013/hcar.sty that you can use to preview your entry. If you do not know LaTeX, then use plain text. If you modify an old entry that you have written for an earlier edition of the report, you should already have received your old entry as a template (provided I have your valid email address). Please modify that template, rather than using your own version of the old entry as a template. Q: Can I include Haskell code? A: Yes. Please use lhs2tex syntax (http://people.cs.uu.nl/andres/lhs2tex/) The report is compiled in mode polycode.fmt. Q: Can I include images? A: Yes, you are even encouraged to do so. Please use .jpg format, then. Q: Should I send files in .zip archives or similar? A: No, plain file attachements are the way. Q: How much should I write? A: Authors are asked to limit entries to about one column of text. A general introduction is helpful. Apart from that, you should focus on recent or upcoming developments. Pointers to online content can be given for more comprehensive or "historic" overviews of a project. Images do not count towards the length limit, so you may want to use this opportunity to pep up entries. There is no minimum length of an entry! The report aims for being as complete as possible, so please consider writing an entry, even if it is only a few lines long. Q: Which topics are relevant? A: All topics which are related to Haskell in some way are relevant. We usually had reports from users of Haskell (private, academic, or commercial), from authors or contributors to projects related to Haskell, from people working on the Haskell language, libraries, on language extensions or variants. We also like reports about distributions of Haskell software, Haskell infrastructure, books and tutorials on Haskell. Reports on past and upcoming events related to Haskell are also relevant. Finally, there might be new topics we do not even think about. As a rule of thumb: if in doubt, then it probably is relevant and has a place in the HCAR. You can also ask the editor. Q: Is unfinished work relevant? Are ideas for projects relevant? A: Yes! You can use the HCAR to talk about projects you are currently working on. You can use it to look for other developers that might help you. Q: If I do not update my entry, but want to keep it in the report, what should I do? A: Tell the editor that there are no changes. The old entry will typically be reused in this case, but it might be dropped if it is older than a year, to give more room and more attention to projects that change a lot. Do not resend complete entries if you have not changed them. Q: Will I get confirmation if I send an entry? How do I know whether my email has even reached the editor, and not ended up in a spam folder? A: Prior to publication of the final report, the editor will send a draft to all contributors, for possible corrections. So if you do not hear from the editor within two weeks after the deadline, it is safer to send another mail and check whether your first one was received.

1 0

Re: [Haskell] An APL library for Haskell
by Simon Peyton-Jones 16 Sep '13

16 Sep '13

PS: Oddly I sent this message in March 2012. I don't know why it has taken over year for it to be delivered! Simon From: Haskell-Cafe [mailto:haskell-cafe-bounces@haskell.org] On Behalf Of Simon Peyton-Jones Sent: 08 March 2012 13:45 To: haskell(a)haskell.org; Haskell Cafe Cc: Lennart Augustsson; John Scholes; nicsma(a)chalmers.se; Nate Foster; Andy Gill; Mary Sheeran; Fritz Henglein Subject: [Haskell-cafe] An APL library for Haskell Friends Many of you will know the array language APL<http://en.wikipedia.org/wiki/APL_%28programming_language%29>. It focuses on arrays and in particular has a rich, carefully-thought-out array algebra. An obvious idea is: what would a Haskell library that embodies APL's array algebra look like? In conversation with John Scholes and some of his colleagues in the APL community a group of us developed some ideas for a possible API, which you can find on the Haskell wiki here: http://www.haskell.org/haskellwiki/APL However, we have all gone our separate ways, and I think it's entirely possible that that the idea will go no further. So this message is to ask: * Is anyone interested in an APL-style array library in Haskell? * If so, would you like to lead the process of developing the API? I think there are quite a few people who would be willing to contribute, including some core gurus from the APL community: John Scholes, Arthur Whitney, and Roger Hui. Simon

1 0

Haskell Weekly News: Issue 279
by Daniel Santa Cruz 12 Sep '13

12 Sep '13

Welcome to issue 279 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of August 25 to September 7, 2013. Quotes of the Week * dmwit: I typically figure a parse error on line 500 means I have 500 lines to inspect. * bos: bah, all you category wonks spoil the atmosphere. we were simple peasants, and proud, once. * merijn: edwardk's delegation has reached the point where he can have the language implementor explain his libraries... * ReinH: haasn asks an offhand question. edwardk wrote a thesis on it. * JaffaCake: children are automatically killed if their parents die for any reason * geekosaur: if the platform is batteries included, lens is a full fledged transformer robot included :) * FreeFull: Mathematical laws are so much nicer than legal laws * twey: to edwardk, v. to be working on a larger problem and absent-mindedly spin out a package to satisfy dependencies, accidentally solving the problem more elegantly than existing solutions (but perhaps incomprehensibly to anyone who can't dualize in their head) * elliott: lens is the DLC expansion pack for Haskell * monochrom: new catchy thing to say: an IORef Int contains an Int in the same sense as an IO Int contains an Int Top Reddit Stories * Announcing GHC iOS Domain: self.haskell, Score: 259, Comments: 52 On Reddit: [1] http://goo.gl/28XFCH Original: [2] http://goo.gl/28XFCH * The Haskell Cast: Episode 1 - Edward Kmett on Lenses Domain: haskellcast.com, Score: 101, Comments: 35 On Reddit: [3] http://goo.gl/umnk1Y Original: [4] http://goo.gl/0vKtZ5 * The Haxl Project at Facebook (slides from my talk at ZuriHac) Domain: github.com, Score: 97, Comments: 76 On Reddit: [5] http://goo.gl/1nWvfs Original: [6] http://goo.gl/pWk1Ll * Haskell on the Daily WTF Domain: thedailywtf.com, Score: 96, Comments: 14 On Reddit: [7] http://goo.gl/kJs9FG Original: [8] http://goo.gl/qdM3sz * Cabal 1.18.0 released Domain: groups.google.com, Score: 92, Comments: 30 On Reddit: [9] http://goo.gl/QbNCmx Original: [10] http://goo.gl/OtYTZG * I've got functional curse. I lost my ability to write in C++. I have to ship C++. What do I do? Domain: self.haskell, Score: 69, Comments: 92 On Reddit: [11] http://goo.gl/oQBzBo Original: [12] http://goo.gl/oQBzBo * `pipes-4.0.0` release candidate Domain: self.haskell, Score: 58, Comments: 42 On Reddit: [13] http://goo.gl/NQDJyT Original: [14] http://goo.gl/NQDJyT * Lenses from Scratch Domain: fpcomplete.com, Score: 54, Comments: 29 On Reddit: [15] http://goo.gl/jYq0ob Original: [16] http://goo.gl/6aeyUP * Controlling Chromium in Haskell Domain: jaspervdj.be, Score: 51, Comments: 3 On Reddit: [17] http://goo.gl/W7VVPh Original: [18] http://goo.gl/WD32IC * Interactive Programming: Hot-swapping in Elm Domain: elm-lang.org, Score: 50, Comments: 6 On Reddit: [19] http://goo.gl/D7LYnM Original: [20] http://goo.gl/A9TwJ5 * Lens/Aeson Traversal/Prism Domain: fpcomplete.com, Score: 48, Comments: 10 On Reddit: [21] http://goo.gl/9o9r3R Original: [22] http://goo.gl/IuFJiC * Mandelbrot Domain: fpcomplete.com, Score: 42, Comments: 6 On Reddit: [23] http://goo.gl/pY3MHE Original: [24] http://goo.gl/gySnCb * ANNOUNCE: posix-paths, for faster file system operations Domain: permalink.gmane.org, Score: 41, Comments: 29 On Reddit: [25] http://goo.gl/vI3UCF Original: [26] http://goo.gl/PlQsAO * Control Text LCD with Haskell code. The code runs on mbed. The RAM size is 32kB. Using Ajhc Haskell compiler. Domain: youtube.com, Score: 41, Comments: 8 On Reddit: [27] http://goo.gl/jchNCd Original: [28] http://goo.gl/CqjxBp * DeepSeq Once Domain: fpcomplete.com, Score: 37, Comments: 57 On Reddit: [29] http://goo.gl/WBohP4 Original: [30] http://goo.gl/zRupez * DSLs and Towers of Abstraction with Gershom Bazerman at NY Haskell Domain: vimeo.com, Score: 36, Comments: 6 On Reddit: [31] http://goo.gl/737bji Original: [32] http://goo.gl/rzHY63 * Port Catch to GHC Domain: self.haskell, Score: 36, Comments: 10 On Reddit: [33] http://goo.gl/6mKcFZ Original: [34] http://goo.gl/6mKcFZ * Reflecting values to types and back Domain: fpcomplete.com, Score: 33, Comments: 11 On Reddit: [35] http://goo.gl/id2AiE Original: [36] http://goo.gl/LJHQfW * Haskell Game Programming Book? Domain: self.haskell, Score: 33, Comments: 25 On Reddit: [37] http://goo.gl/qJDSWv Original: [38] http://goo.gl/qJDSWv * ANN: Cabal v1.18.0 released Domain: haskell.org, Score: 33, Comments: 0 On Reddit: [39] http://goo.gl/w08cdI Original: [40] http://goo.gl/aYSkJf * How could little me make Haskell better? Domain: self.haskell, Score: 31, Comments: 31 On Reddit: [41] http://goo.gl/qtnee1 Original: [42] http://goo.gl/qtnee1 Top StackOverflow Questions * Examples of a monad whose Applicative part can be better optimized than the Monad part votes: 19, answers: 3 Read on SO: [43] http://goo.gl/06Awvz * Haskell: unnecessary reevaluations of constant expressions votes: 17, answers: 2 Read on SO: [44] http://goo.gl/82hb99 * equal sign with haskell literals votes: 16, answers: 3 Read on SO: [45] http://goo.gl/F08H9Z * Haskell standalone desktop application authentication (using google / facebook / twitter / etc accounts) votes: 15, answers: 1 Read on SO: [46] http://goo.gl/JQaIfD * Continue debugging in GHC after interrupt votes: 12, answers: 0 Read on SO: [47] http://goo.gl/ZpQms7 * How to automatically generate (and see the code for) Read and Show in Haskell votes: 12, answers: 1 Read on SO: [48] http://goo.gl/dET9H6 * Killing a Haskell binary votes: 11, answers: 2 Read on SO: [49] http://goo.gl/FDnsvz * Haskell: What does ((->) t) mean? votes: 10, answers: 3 Read on SO: [50] http://goo.gl/HAV96m * What does the term “reason about” mean in computer science? votes: 10, answers: 5 Read on SO: [51] http://goo.gl/CV6EE5 * Idiomatic bidirectional Pipes with downstream state without loss votes: 9, answers: 3 Read on SO: [52] http://goo.gl/rjX2uK Until next time, [53]+Daniel Santa Cruz References 1. http://www.reddit.com/r/haskell/comments/1lboh4/announcing_ghc_ios/ 2. http://www.reddit.com/r/haskell/comments/1lboh4/announcing_ghc_ios/ 3. http://www.haskellcast.com/episode/001-edward-kmett-on-lenses/ 4. http://www.reddit.com/r/haskell/comments/1l45c3/the_haskell_cast_episode_1_… 5. https://github.com/meiersi/HaskellerZ/blob/master/meetups/20130829-FPAftern… 6. http://www.reddit.com/r/haskell/comments/1le4y5/the_haxl_project_at_faceboo… 7. http://thedailywtf.com/Articles/OMGWTF2-The-Honorable-Mentions.aspx 8. http://www.reddit.com/r/haskell/comments/1locjo/haskell_on_the_daily_wtf/ 9. https://groups.google.com/forum/#!topic/haskell-cafe/SFoNwaq8wdc 10. http://www.reddit.com/r/haskell/comments/1lqo13/cabal_1180_released/ 11. http://www.reddit.com/r/haskell/comments/1lrrhk/ive_got_functional_curse_i_… 12. http://www.reddit.com/r/haskell/comments/1lrrhk/ive_got_functional_curse_i_… 13. http://www.reddit.com/r/haskell/comments/1lh5u7/pipes400_release_candidate/ 14. http://www.reddit.com/r/haskell/comments/1lh5u7/pipes400_release_candidate/ 15. https://www.fpcomplete.com/user/tel/lenses-from-scratch 16. http://www.reddit.com/r/haskell/comments/1l8ld7/lenses_from_scratch/ 17. http://jaspervdj.be/posts/2013-09-01-controlling-chromium-in-haskell.html 18. http://www.reddit.com/r/haskell/comments/1liux8/controlling_chromium_in_has… 19. http://elm-lang.org/blog/Interactive-Programming.elm 20. http://www.reddit.com/r/haskell/comments/1ln75a/interactive_programming_hot… 21. https://www.fpcomplete.com/user/tel/lens-aeson-traversals-prisms 22. http://www.reddit.com/r/haskell/comments/1l64oe/lensaeson_traversalprism/ 23. https://www.fpcomplete.com/user/edwardk/snippets/mandelbrot 24. http://www.reddit.com/r/haskell/comments/1lkkb0/mandelbrot/ 25. http://permalink.gmane.org/gmane.comp.lang.haskell.general/19946 26. http://www.reddit.com/r/haskell/comments/1liahv/announce_posixpaths_for_fas… 27. http://www.youtube.com/watch?v=fOsjEfNmTkY 28. http://www.reddit.com/r/haskell/comments/1lkboo/control_text_lcd_with_haske… 29. https://www.fpcomplete.com/user/edwardk/snippets/once 30. http://www.reddit.com/r/haskell/comments/1lo15w/deepseq_once/ 31. https://vimeo.com/72870861 32. http://www.reddit.com/r/haskell/comments/1l4ph3/dsls_and_towers_of_abstract… 33. http://www.reddit.com/r/haskell/comments/1lj39q/port_catch_to_ghc/ 34. http://www.reddit.com/r/haskell/comments/1lj39q/port_catch_to_ghc/ 35. https://www.fpcomplete.com/user/thoughtpolice/using-reflection 36. http://www.reddit.com/r/haskell/comments/1l9qzw/reflecting_values_to_types_… 37. http://www.reddit.com/r/haskell/comments/1lgano/haskell_game_programming_bo… 38. http://www.reddit.com/r/haskell/comments/1lgano/haskell_game_programming_bo… 39. http://www.haskell.org/pipermail/haskell-cafe/2013-September/108722.html 40. http://www.reddit.com/r/haskell/comments/1lqo00/ann_cabal_v1180_released/ 41. http://www.reddit.com/r/haskell/comments/1lf6z5/how_could_little_me_make_ha… 42. http://www.reddit.com/r/haskell/comments/1lf6z5/how_could_little_me_make_ha… 43. http://stackoverflow.com/questions/18590639/examples-of-a-monad-whose-appli… 44. http://stackoverflow.com/questions/18655561/haskell-unnecessary-reevaluatio… 45. http://stackoverflow.com/questions/18598365/equal-sign-with-haskell-literals 46. http://stackoverflow.com/questions/18472448/haskell-standalone-desktop-appl… 47. http://stackoverflow.com/questions/18504432/continue-debugging-in-ghc-after… 48. http://stackoverflow.com/questions/18538055/how-to-automatically-generate-a… 49. http://stackoverflow.com/questions/18430748/killing-a-haskell-binary 50. http://stackoverflow.com/questions/18561859/haskell-what-does-t-mean 51. http://stackoverflow.com/questions/18666821/what-does-the-term-reason-about… 52. http://stackoverflow.com/questions/18471706/idiomatic-bidirectional-pipes-w… 53. https://plus.google.com/105107667630152149014/about

1 0

APLAS 2013 - Call for Posters and Demos
by Shin-ya Katsumata 10 Sep '13

10 Sep '13

(Apologies for multiple copies) Call for Posters and Demos: APLAS 2013 11th Asian Symposium on Programming Languages and Systems 9-11 December 2013 Melbourne, Australia (colocated with CPP 2013) http://aplas2013.soic.indiana.edu/ Submission due: 7 October 2013 (Monday), 23:59 UTC Notification: 18 October 2013 (Friday) APLAS 2013 will include a poster and demo session during the conference. The poster session aims to give students and professionals an opportunity to present technical materials to the research community, and to get responses from other researchers in the field. * Scope Poster and demo contributions are sought in all areas of programming languages and systems, including the following topics: - semantics, logics, foundational theory; - design of languages, type systems and foundational calculi; - domain-specific languages; - compilers, interpreters, abstract machines; - program derivation, synthesis and transformation; - program analysis, verification, model-checking; - logic, constraint, probabilistic and quantum programming; - software security; - concurrency and parallelism; - tools and environments for programming and implementation. * Submission Each presenter should e-mail a 1-2 page abstract in PDF to the poster chair (Shin-ya Katsumata: aplas2013-poster AT kurims.kyoto-u.ac.jp) by 7 October, 23:59 UTC. The abstract should include the title, style of the presentation (poster only or poster plus demo), author(s), affiliation(s) and summary of the work. We will announce the accepted presentations on 18 October. We hope to accommodate every presentation, but may restrict them (based on relevance and interest to the community) due to space constraints. The format of the poster will be announced later. * Important Dates Submission due: 7 October 2013 (Monday), 23:59 UTC Notification: 18 October 2013 (Friday) Conference: 9-11 December 2013 (Monday-Wednesday) * Contact Poster chair: Shin-ya Katsumata (aplas2013-poster AT kurims.kyoto-u.ac.jp)

1 0

Last Call for Participation - ICSM 2013, the 29th IEEE International Conference on Software Maintenance
by Natalia Dragan 10 Sep '13

10 Sep '13

Less than two weeks till ICSM 2013: get ready for another edition of insightful results in the field of Software Maintenance! Make sure to take a look at the co-located events as well: http://icsm2013.tue.nl/Schedule/index.html It is still possible to register, online as well as on-site. http://icsm2013.tue.nl/Registration/index.html See you in Eindhoven! ============================================================================ 22 - 28 September 2013 - Eindhoven, The Netherlands Register here! http://icsm2013.tue.nl/Registration/index.html Student support for attending ICSM or co-located events: *Travel grants for female students* *NSF grants for US-based students* http://icsm2013.tue.nl/Travel/TravelGrant/index.html Stay informed: http://icsm2013.tue.nl/, Twitter: @IEEEICSM ============================================================================ ICSM is the premiere international venue in software maintenance and evolution, where participants from academia, government, and industry meet and share ideas and experiences for solving critical software maintenance problems. ICSM 2013 will be held in Eindhoven, The Netherlands. The conference venue is the main lecture building (Auditorium) of Eindhoven University of Technology. ICSM 2013 will have five tracks: Research Track Early Research Achievements (ERA) Track Industry Track Tools Track Doctoral Symposium Keynote Speakers: Jeff Magee, Imperial College London, UK: Intrinsic Definition in Software Architecture Evolution Michael Feathers, DepthFirst: Reflecting Upon the Useful Life of Software http://icsm2013.tue.nl/Keynotes/index.html Travel Grants: Two kinds of travel grants are available for students attending ICSM or co-located events. Please find the details on the website. http://icsm2013.tue.nl/Travel/TravelGrant/index.html In addition to ICSM in 2013 we will be welcoming a number of co-located events, for which you can register on the ICSM websitehttp://icsm2013.tue.nl/Registration/index.html : 13th IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM), 15th IEEE International Symposium on Web Systems Evolution (WSE), 7th International Symposium on the Maintenance and Evolution of Service-Oriented and Cloud-Based Systems (MESOCA), 1st IEEE Working Conference on Software Visualization (VISSOFT) 1st International Workshop on Communicating Business Process and Software Models: Quality, Understandability, and Maintainability (CPSM). The schedule of the events is available here: http://icsm2013.tue.nl/Schedule/index.html ============================================================================ Eindhoven is located in the province of North Brabant in the south of the Netherlands. The city counts 213,809 inhabitants (as of January 1st, 2010), which makes it the fifth-largest city of the Netherlands. Eindhoven is well known for modern art, design and technology. The Van Abbemuseum of Modern Art belongs to the world top ten of modern art museums (http://www.vanabbemuseum.nl/) and hosts works of artists such as Picasso, Chagall, Kandinsky, El Lissitzky, Theo van Doesburg, Mondriaan, and Appel. Main design destinations in Eindhoven are the Design Huis (http://www.designhuis.nl/en) art exhibition of Piet Hein Eek design at Strijp Rwww.pietheineek.nl <http://www.pietheineek.nl/><http://www.pietheineek.nl <http://www.pietheineek.nl/>> and a new neighborhood Strijp-S (http://www.strijp-s.nl/) Technological highlights are the PSV Stadium (http://www.philipsstadion.nl/home.html) and the DAF Museum (www.dafmuseum.nl <http://www.dafmuseum.nl/><http://www.dafmuseum.nl <http://www.dafmuseum.nl/>>). ============================================================================ Register now: http://icsm2013.tue.nl/Registration/index.html ============================================================================

1 0

Hackage 2 now available for beta testing
by Duncan Coutts 09 Sep '13

09 Sep '13

Well-Typed and the Industrial Haskell Group (IHG) are very pleased to announce that Hackage 2 is now available for public beta testing. The plan is to do the final switchover in late September, to coincide with ICFP. http://beta.hackage.haskell.org/ Read on for details of how to help with the public beta, an overview of the new features and what the IHG has been doing to help. Support from the Industrial Haskell Group ========================================= The IHG is a consortium of companies that rely on Haskell. The IHG members have funded the effort to get Hackage 2 up to feature parity and get it ready for the switchover. The IHG funded this effort because while the volunteer effort got us the "first 90%" of the way there (including adding a number of new features) there was still the "last 90%" to do to get it production ready. The IHG members decided to fund Hackage 2 not just because they are good citizens, but out of enlightened self-interest. Hackage has over 5000 packages written by over 1000 people -- including the world's best Haskell developers. This is a massive resource. The IHG members recognise that improvements to the tools and infrastructure that the community uses helps the community to produce more and better code. This is a benefit to everyone in the community -- including the commercial users. The IHG is keen to increase its membership so that more resources can be dedicated to improving the Haskell development platform. If your organisation relies on Haskell in some way then you may want to consider joining. See the IHG website for more details or contact info(a)industry.haskell.org. [IHG website]: http://industry.haskell.org/ Despite the help of the IHG in getting to this point, Hackage is a community project, and its success depends on the community maintaining and further improving the new server. The code is now on github so it is easier to contribute, and now that the server is live there is more immediate gratification for volunteers contributing fixes and new features. Public beta =========== We would like to encourage you to take part in the public beta testing. We need help both from package authors as well as other users of the site. Please report any problems you find using the issue tracker on the hackage-server github site. [issue tracker]: https://github.com/haskell/hackage-server/issues [github site]: https://github.com/haskell/hackage-server We are mirroring packages from the old server (every 30min) so it is suitable to use as your main hackage server with some caveats: we are allowing package authors to upload (as well as doing the mirroring) so you may find a slightly different set of packages on this server. If you are a package author then you are welcome to poke about and upload packages. We have imported user accounts from the old server (except for a small number of early adopters of the original server who will need to contact an administrator). Note that before we do the final switchover we will *delete everything* from the beta instance and do a fresh import from the old hackage server. Configuring cabal-install ------------------------- Edit your ~/.cabal/config file. Comment-out the existing "remote-repo" line near the top of the file and add in a new one like this: --remote-repo: hackage.haskell.org:http://hackage.haskell.org/packages/archive remote-repo: beta.hackage.haskell.org:http://beta.hackage.haskell.org/ New features ============ Though our main priority has been feature parity so that we can switch over, volunteers have contributed several new features, including better package search, a new site theme, improved security, the ability to fix package dependencies after a release, changelogs, and a REST-style interface. See the beta site for more details on these new features, plus details of other features that are partially implemented or are in need of improvement. [new features]: http://beta.hackage.haskell.org/new-features Contributing to the development =============================== The code is on github and we welcome pull requests. There are open tickets describing existing bugs and features that we want or that are in need of improvement. Help on any of these would be greatly appreciated. There is some developer and user documentation on the github wiki, including a quick guide to getting your own server instance up and running. You can ask questions on the cabal-devel mailing list or on IRC in the #hackage channel on freenode. [code]: https://github.com/haskell/hackage-server [github wiki]: https://github.com/haskell/hackage-server/wiki [cabal-devel]: http://www.haskell.org/mailman/listinfo/cabal-devel -- Duncan Coutts, Haskell Consultant Well-Typed LLP, http://www.well-typed.com/

1 0

HOPE 2013 Last Call for Participation (with Workshop Program)
by Hongseok Yang 09 Sep '13

09 Sep '13

---------------------------------------------------------------------- CALL FOR PARTICIPATION HOPE 2013 The 2nd ACM SIGPLAN Workshop on Higher-Order Programming with Effects September 28, 2013 Boston, Massachusetts (the day after ICFP 2013) http://hope2013.mpi-sws.org ---------------------------------------------------------------------- HOPE 2013 aims at bringing together researchers interested in the design, semantics, implementation, and verification of higher-order effectful programs. It will be *informal*, consisting of invited talks and contributed talks on work in progress. ------------ Registration ------------ Web site: https://regmaster3.com/2013conf/ICFP13/register.php This is the registration site for ICFP 2013 and all the affiliated workshops including HOPE 2013. ---------------- Workshop Program ---------------- We received 20 high-quality submissions for talk proposals this year, from which the program committee decided to accept 10 for presentation at the workshop. The talks will be video-recorded, and the recordings will be made available here after the workshop. Also this year, the workshop will feature a special session in memory of John Reynolds. The session will include talks from Olivier Danvy, Robert Harper, Peter O'Hearn, and Uday Reddy, with a mixture of scientific and personal reflections on John's life and work. This special session is sponsored in part by a generous donation from Microsoft Research. Session 1: Concurrent Program Logics 9:00 Impredicative Concurrent Abstract Predicates Kasper Svendsen and Lars Birkedal 9:30 Subjective Concurrent Protocol Logic Aleksandar Nanevski, Ruy Ley-Wild, Ilya Sergey, and German Andres Delbianco 10:00 Protocols for Protocols: Using Modal Separation Logic to Prove Extrinsic Properties of Secure Communication David Swasey, Derek Dreyer, Deepak Garg, Robert Harper, and Aaron Turon 10:30 Coffee Break Session 2: Semantics 11:00 A Kripke Logical Relation for Affine Functions: The Story of a Free Theorem in the Presence of Non-termination Phillip Mates and Amal Ahmed 11:30 Deconstructing General References via Game Semantics Andrzej Murawski and Nikos Tzevelekos 12:00 Linking Isn't Substitution Jeremy Siek 12:30 Lunch (NOTE: only one hour for lunch) Session 3: Special Session in Memory of John Reynolds 1:30 Olivier Danvy 2:00 Robert Harper 2:30 Peter O'Hearn 3:00 Uday Reddy 3:30 Coffee Break Session 4: Types and Verification 4:00 Refinement Types and Algebraic Effects Danel Ahman 4:30 Adventures in Knot-Tying while Verifying a Thread Library in Coq Adam Chlipala 5:00 The Ins and Outs of Iteration in Mezzo Armael Gueneau, Francois Pottier, and Jonathan Protzenko 5:30 Attacking the Imperative Relationship Update Problem with Almost Everywhere Heap Invariants Devin Coughlin and Bor-Yuh Evan Chang --------------------- Goals of the Workshop --------------------- A recurring theme in many papers at ICFP, and in the research of many ICFP attendees, is the interaction of higher-order programming with various kinds of effects: storage effects, I/O, control effects, concurrency, etc. While effects are of critical importance in many applications, they also make it hard to build, maintain, and reason about one's code. Higher-order languages (both functional and object-oriented) provide a variety of abstraction mechanisms to help "tame" or "encapsulate" effects (e.g. monads, ADTs, ownership types, typestate, first-class events, transactions, Hoare Type Theory, session types, substructural and region-based type systems), and a number of different semantic models and verification technologies have been developed in order to codify and exploit the benefits of this encapsulation (e.g. bisimulations, step-indexed Kripke logical relations, higher-order separation logic, game semantics, various modal logics). But there remain many open problems, and the field is highly active. The goal of the HOPE workshop is to bring researchers from a variety of different backgrounds and perspectives together to exchange new and exciting ideas concerning the design, semantics, implementation, and verification of higher-order effectful programs. --------------------- Workshop Organization --------------------- Program Co-Chairs: Derek Dreyer (MPI-SWS, Germany) Hongseok Yang (University of Oxford) Program Committee: Anindya Banerjee (IMDEA Software Institute) Lars Birkedal (Aarhus University) Aquinas Hobor (National University of Singapore) Chung-Kil Hur (Microsoft Research Cambridge) Patricia Johann (Appalachian State University) Matthew Might (University of Utah) Peter Mueller (ETH Zurich) Brigitte Pientka (McGill University) Zhong Shao (Yale)

1 0

ANNOUNCE: MemeXML 0.0.2
by Florian Eggenhofer 06 Sep '13

06 Sep '13

Hello haskellers, I am pleased to announce a libary to parse Multiple EM for Motif Elicitation (MEME) output files in xml format. MEME can be used to isolate reoccouring motifs from sets of biological sequences. * On hackage: http://hackage.haskell.org/package/memexml * Via cabal: cabal install memexml * git repo: https://github.com/eggzilla/memexml More about MEME: http://meme.nbcr.net/meme/meme-intro.html Florian -- Florian Eggenhofer PhD-Student Institute for Theoretical Chemistry University of Vienna A-1090 Vienna, Waehringer Strasse 17

1 0

ETAPS 2014 2nd call for papers
by Tarmo Uustalu 06 Sep '13

06 Sep '13

[We apologise for multiple copies.] A month to go! ****************************************************************** FIRST CALL FOR PAPERS: ETAPS 2014 17th European Joint Conferences on Theory And Practice of Software Grenoble, France 5-13 April 2014 http://www.etaps.org/2014 ****************************************************************** -- ABOUT ETAPS -- ETAPS is the primary European forum for academic and industrial researchers working on topics relating to software science. ETAPS, established in 1998, is a confederation of six main annual conferences, accompanied by satellite workshops. ETAPS 2014 is the seventeenth event in the series. -- MAIN CONFERENCES (7-11 April) -- * CC: Compiler Construction * ESOP: European Symposium on Programming * FASE: Fundamental Approaches to Software Engineering * FOSSACS: Foundations of Software Science and Computation Structures * POST: Principles of Security and Trust * TACAS: Tools and Algorithms for the Construction and Analysis of Systems TACAS '14 hosts the 3rd Competition on Software Verification (SV-COMP). -- INVITED SPEAKERS -- * Robert Harper (Carnegie Mellon University, US) * John Launchbury (Galois, US) * Benoit Dupont de Dinechin (Kalray, France) * Maurice Herlihy (Brown University, US) * Christel Baier (Technical University of Dresden, Germany) * Petr Jancar (Technical Univ of Ostrava, Czech Republic) * David Mazieres (Stanford University, US) * Orna Kupferman (Hebrew University Jerusalem, Israel) -- IMPORTANT DATES -- * 4 October 2013: Submission deadline for abstracts (strict) * 11 October 2013: Submission deadline for full papers (strict) * 20 December 2013: Notification of acceptance * 17 January 2014: Camera-ready versions due ESOP and FoSSaCS will use a rebuttal (author response) phase. -- GENERAL SUBMISSION INFORMATION -- ETAPS conferences accept two types of contributions: research papers and tool demonstration papers. Both types will appear in the proceedings and have presentations during the conference. (TACAS has more categories, see below.) A condition of submission is that, if the submission is accepted, one of the authors attends the conference to give the presentation. Submitted papers must be in English presenting original research. They must be unpublished and not submitted for publication elsewhere. In particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden. The proceedings will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline of Springer's Lecture Notes in Computer Science series. Papers must follow the formatting guidelines specified by Springer at the URL http://www.springer.de/comp/lncs/authors.html and be submitted electronically in pdf through the Easychair author interface of the respective conference. Submissions not adhering to the specified format and length may be rejected immediately. - Research papers Different ETAPS 2014 conferences have different page limits. Specifically, FASE, FOSSACS and TACAS have a page limit of 15 pages, whereas CC, ESOP and POST allow at most 20 pages. Additional material intended for the referees but not for publication in the final version - for example, details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. ETAPS referees are at liberty to ignore appendices and papers must be understandable without them. TACAS solicits not only regular research papers, but also case study papers. - Tool demonstration papers Submissions should consist of two parts: * The first part, at most 4 pages, should describe the tool presented. Please include the URL of the tool (if available) and provide information that illustrates the maturity and robustness of the tool. (This part will be included in the proceedings.) * The second part, at most 6 pages, should explain how the demonstration will be carried out and what it will show, including screen dumps and examples. (This part will be not be included in the proceedings, but will be evaluated.) ESOP and FOSSACS do not accept tool demonstration papers. In addition to tool demonstration papers (max 6 pages in their case), TACAS solicits also regular tool papers (max 15 pages) adhering to specific instructions about content and organization. -- SATELLITE EVENTS (5-6 April, 12-13 April) -- Around 20 satellite workshops will take place before and after the main conferences. In addition, on 6 April, some tutorials on topics of wide interest will be offered. -- HOST CITY -- Located in the southeastern part of France, Grenoble is considered as the capital of the Alps. Grenoble is surrounded by nature and high mountains: down the Alps, Grenoble is the meeting point of two important rivers, Drac and Isere. Grenoble has important historical and gastronomic heritages. Leisure activities in breathtaking nature are easily organizable and within short-distance. Grenoble is also a major scientific center in Europe dedicated to high-tech technologies, e.g., nano, micro, bio, and information technologies. -- HOST INSTITUTION -- The event is organized by Universite Joseph Fourier. Located at the heart of the Alps, in outstanding scientific and natural surroundings, the Universite Joseph Fourier in Grenoble is a leading University of Science, Technology and Health. -- ORGANIZERS * General chair: Saddek Bensalem * Conferences chair: Yassine Lakhnech * Workshops chair: Axel Legay * Publicity chair: Ylies Falcone * Finance chair: Nicolas Halbwachs * Web site chair: Marius Bozga -- FURTHER INFORMATION -- Please do not hesitate to contact the organizers at etaps2014.organization(a)imag.fr.

1 0

Oberwolfach Seminar on Mathematics for Scientific Programming
by Jeremy.Gibbons＠cs.ox.ac.uk 05 Sep '13

05 Sep '13

Call for Participation OBERWOLFACH SEMINAR ON MATHEMATICS FOR SCIENTIFIC COMPUTATION Mathematisches Forschunginstitut Oberwolfach 24th to 30th November 2013 http://www.mfo.de/occasion/1348a MOTIVATION Computational science today depends crucially on simulations, which are typically based on algorithms that have a sound mathematical justification. For example, an iterative procedure such as Newton's method is motivated by appealing to the properties of twice continuously differentiable functions and their Taylor expansion, which also yield convergence conditions and approximation estimates. These algorithms are then implemented on a computer, using a programming language such as Fortran or C++. Often, the implementation will introduce new computational steps and otherwise modify the structure of the mathematical algorithm - for handling or reducing round-off errors, enabling more efficient memory access, exploiting parallelization, and so on. As a result, the final implementation usually looks very different from the mathematical algorithm, and the justification given for the latter does not directly extend to the former. But if we are to ensure the correctness of simulations, we need mathematical certainty for both. We aim to bring to the scientific programming community mathematical techniques that allow us to achieve the transition from mathematical algorithm to efficient implementation in a principled manner, with each step motivated by the application of a mathematical theorem. The intended participants are students and researchers in computational science (including areas such as engineering, biology, and economics), and any scientists dissatisfied with state of the art in transforming mathematics into code. They will be equipped subsequently to make a significant contribution to increasing the correctness of the simulations that play such an important role in current scientific activity. CONTENT This rigorous approach to programming is most easily presented in the framework of functional programming: program calculation can be reduced to straightforward equational reasoning, provided that all program variables are immutable. Accordingly, we will introduce the basic syntax and ideas using Haskell, currently the one of the most successful functional programming languages. The emphasis is not on functional programming as such, and even less so on a specific language such as Haskell; but rather, on the mathematics behind program development, which can then be transferred to other contexts, such as imperative programming, or parallel programming. This mathematical foundation lies in category theory, which unifies what could otherwise appear as a large collection of "bite-sized" theorems for program development, too many for any developer to remember and use efficiently. Category theory is a broad subject: we will limit ourselves to what is essential as a framework for datatypes and programs (functors, universal properties, algebras, monads). The many examples, such as fusion (loop elimination), optimal bracketing (important for non-associative operations such as those on floating-point numbers), or parallel programming skeletons (such as Google's MapReduce), will be readily understandable and relevant to scientific computing practitioners. One of the most effective ways to counter floating-point errors and to obtain validated results is to use interval analysis, which however requires more complex data structures and algorithms than is common in other areas of scientific computation. Extending a function on real or floating-point numbers to one on intervals is a matter of symbolic computation, similar to the symbolic differentiation or integration that is performed by tools such as Mathematica. The problem of obtaining the best extension is complicated by the fact that some familiar properties (such as that x-x=0 for any x, and distributivity of multiplication over addition) do not apply to intervals, and is a good source of examples for calculational programming. Finally, we will present a larger application, a generic program for inter-temporal optimization with dynamic programming. This kind of problem is ubiquitous in economic modeling, and hence in many integrated assessment models, such as those aiming to compute costs of climate change. It has both algebraic aspects (the organization of the computation for backward induction), which can be tackled with the categorical methods presented, and numerical ones (the local optimization techniques), where interval analysis can be used. The Seminar is organized by: * Paul Flondor, Professor of Mathematics at Politehnica University Bucharest (pflondor(a)yahoo.co.uk) * Jeremy Gibbons, Professor of Computing at the University of Oxford (jeremy.gibbons(a)cs.ox.ac.uk) * Cezar Ionescu, researcher at Potsdam Institute for Climate Impact Research (ionescu(a)pik-potsdam.de) HOW TO APPLY Applications to participate should include * full name and address, including e-mail address * short CV, present position, university * name of supervisor of PhD thesis * a short summary of previous work and interest and should be sent preferably by e-mail (pdf files) to: Prof. Dr. Dietmar Kröner Mathematisches Forschungsinstitut Oberwolfach Schwarzwaldstr. 9-11 77709 Oberwolfach-Walke Germany seminars(a)mfo.de The deadline for applications is 15th September, and the number of participants is restricted to 25. The Institute covers accommodation and food; thanks to support from the Carl Friedrich von Siemens Foundation, some contribution may also be made towards travel expenses. For more information, contact the organizers or see the Institute's webpage: http://www.mfo.de/scientific-programme/meetings/oberwolfach-seminars

1 0