- Haskell-Cafe - Haskell.org

CFP: FHPC 2015: Workshop on Functional High-Performance Computing [w/ICFP]
by Trevor McDonell 23 Apr '15

23 Apr '15

Apologies if you receive this message more than once. ====================================================================== CALL FOR PAPERS FHPC 2015 The 4th ACM SIGPLAN Workshop on Functional High-Performance Computing Vancouver, British Columbia, Canada, Canada September 3, 2015 https://sites.google.com/site/fhpcworkshops/ Co-located with the International Conference on Functional Programming (ICFP 2015) Submission Deadline: Friday, 15 May, 2015 (anywhere on earth) ====================================================================== The FHPC workshop aims at bringing together researchers exploring uses of functional (or more generally, declarative or high-level) programming technology in application domains where high performance is essential. The aim of the meeting is to enable sharing of results, experiences, and novel ideas about how high-level, declarative specifications of computationally challenging problems can serve as maintainable and portable code that approaches (or even exceeds) the performance of machine-oriented imperative implementations. All aspects of performance critical programming and parallel programming are in-scope for the workshop, irrespective of hardware target. This includes both traditional large-scale scientific computing (HPC), as well as work targeting single node systems with SMPs, GPUs, FPGAs, or embedded processors. It is becoming apparent that radically new and well founded methodologies for programming such systems are required to address their inherent complexity and to reconcile execution performance with programming productivity. Proceedings: ============ Accepted papers will be published by the ACM and will appear in the ACM Digital Library. * Submissions due: Friday, 15 May, 2015 (anywhere on earth) * Author notification: Friday, 26 June, 2015 * Final copy due: Sunday, 19 July, 2015 Submitted papers must be in portable document format (PDF), formatted according to the ACM SIGPLAN style guidelines (2 column, 9pt format). See http://www.sigplan.org/authorInformation.htm for more information and style files. Typical papers are expected to be 8 pages (but up to four additional pages are permitted). Contributions to FHPC 2015 should be submitted via Easychair, at the following URL: * https://www.easychair.org/conferences/?conf=fhpc15 The submission site is now open. The FHPC workshops adhere to the ACM SIGPLAN policies regarding programme committee contributions and republication. Any paper submitted must adhere to ACM SIGPLAN's republication policy. PC member submissions are welcome, but will be reviewed to a higher standard. http://www.sigplan.org/Resources/Policies/Review http://www.sigplan.org/Resources/Policies/Republication Travel Support: =============== Student attendees with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC programme, see its web page (http://www.sigplan.org/PAC.htm) Programme Committee: ==================== Tiark Rompf (co-chair) Purdue University, USA Geoffrey Mainland (co-chair) Drexel University, USA Kevin Brown Stanford University, USA James Cheney University of Edinburgh, UK Albert Cohen INRIA, France David Duke University of Leeds, UK Yukiyoshi Kameyama University of Tsukuba, Japan Gabriele Keller University of New South Wales, Australia Paul H J Kelly Imperial College London, UK Trevor L. Mcdonell Indiana University, USA Greg Michaelson Heriot-Watt University, UK Cosmin E. Oancea University of Copenhagen, Denmark Markus Pueschel ETH Zurich, Switzerland Sukyoung Ryu KAIST, Korea Alexander Slesarenko Huawei, Russia Josef Svenningsson Chalmers University of Technology, Sweden

1 0

How to use an crypto with hackage cereal?
by Magicloud Magiclouds 23 Apr '15

23 Apr '15

Hi, I am trying to work with some binary data that encrypted by field instead of the result of serialization. I'd like to use Data.Serialize to wrap the data structure. But I could not figure out how to apply an runtime specified cipher method to the bytestring. Any idea? Or I should use totally other solution? Thanks. -- 竹密岂妨流水过山高哪阻野云飞 And for G+, please use magiclouds#gmail.com.

6 21

compiling GHC 7.8 on raspberry pi
by Sven Bartscher 23 Apr '15

23 Apr '15

Greetings, I'm trying to get a haskell program to run on a raspberry pi (running raspbian). Unfortunately it requires template haskell. Since the GHC included in raspbian wheezy doesn't support TH I'm trying to compile GHC 7.8.4 on the rpi. Most of the compilation worked fine. I got problems with the memory consumption, but adding a lot of swapspace solved this problem. During the final phase the compilation process complains about a "strange closure type 49200" (the exact number is varying, but most often it's 49200). Does anyone here have experience, how to compile GHC 7.8 on a raspberry pi? As a side note: The compilation is running in QEMU while the compiled program should run on a real rpi. Regards Sven

3 3

[FUN] Cheryl's birthday; solved using Haskell/SBV
by Levent Erkok 23 Apr '15

23 Apr '15

For those of us who'd rather have Haskell do the thinking for us: https://gist.github.com/LeventErkok/654a86a3ec7d3799b624 Honestly, this is more an exercise in how to formalize such puzzles as opposed to demonstrating the capabilities of SBV or SMT-solvers in general; but fun nonetheless. The backend SMT solver (I used Z3) solves the puzzle instantly. Enjoy.. -Levent. PS. Thanks to Amit Goel for suggesting the formalization strategy used in the encoding.

1 0

cabal install glade
by Jean Lopes 22 Apr '15

22 Apr '15

Hello, I am trying to install the Glade package from hackage, and I keep getting exit failure... Hope someone can help me solve it! What I did: $ mkdir ~/haskell/project $ cd ~/haskell/project $ cabal sandbox init $ cabal update $ cabal install alex $ cabal install happy $ cabal install gtk2hs-buildtools $ cabal install gtk #successful until here $ cabal install glade The last statement gave me the following error: $ [1 of 2] Compiling SetupWrapper ( /tmp/cairo-0.12.5.3-5133/cairo-0.12.5.3/SetupWrapper.hs, /tmp/cairo-0.12.5.3-5133/cairo-0.12.5.3/dist/dist-sandbox-acbd4b7/setup/SetupWrapper.o ) $ $ /tmp/cairo-0.12.5.3-5133/cairo-0.12.5.3/SetupWrapper.hs:91:17: $ Ambiguous occurrence ‘die’ $ It could refer to either ‘Distribution.Simple.Utils.die’, $ imported from ‘Distribution.Simple.Utils’ at /tmp/cairo-0.12.5.3-5133/cairo-0.12.5.3/SetupWrapper.hs:8:1-32 $ or ‘System.Exit.die’, $ imported from ‘System.Exit’ at /tmp/cairo-0.12.5.3-5133/cairo-0.12.5.3/SetupWrapper.hs:21:1-18 $ Failed to install cairo-0.12.5.3 $ [1 of 2] Compiling SetupWrapper ( /tmp/glib-0.12.5.4-5133/glib-0.12.5.4/SetupWrapper.hs, /tmp/glib-0.12.5.4-5133/glib-0.12.5.4/dist/dist-sandbox-acbd4b7/setup/SetupWrapper.o ) $ $ /tmp/glib-0.12.5.4-5133/glib-0.12.5.4/SetupWrapper.hs:91:17: $ Ambiguous occurrence ‘die’ $ It could refer to either ‘Distribution.Simple.Utils.die’, $ imported from ‘Distribution.Simple.Utils’ at /tmp/glib-0.12.5.4-5133/glib-0.12.5.4/SetupWrapper.hs:8:1-32 $ or ‘System.Exit.die’, $ imported from ‘System.Exit’ at /tmp/glib-0.12.5.4-5133/glib-0.12.5.4/SetupWrapper.hs:21:1-18 $ Failed to install glib-0.12.5.4 $ cabal: Error: some packages failed to install: $ cairo-0.12.5.3 failed during the configure step. The exception was: $ ExitFailure 1 $ gio-0.12.5.3 depends on glib-0.12.5.4 which failed to install. $ glade-0.12.5.0 depends on glib-0.12.5.4 which failed to install. $ glib-0.12.5.4 failed during the configure step. The exception was: $ ExitFailure 1 $ gtk-0.12.5.7 depends on glib-0.12.5.4 which failed to install. $ pango-0.12.5.3 depends on glib-0.12.5.4 which failed to install. Important: You can assume I don't know much. I'm rather new to Haskell/cabal

4 9

Help wanted with Wiki.Haskell.Org
by Gershom B 21 Apr '15

21 Apr '15

One of the central repositories of knowledge in the Haskell world is the HaskellWiki (https://wiki.haskell.org) This wiki has been with the Haskell community for years, and contains a wealth of knowledge. Like other services on the haskell.org domain and with haskell.org equipment, ultimate responsibility for maintaining it falls on the Haskell Committee. However, it is a community wiki, and requires care and maintenance and contributions from all of us. The wiki has been, and continues to be, a vital component in the Haskell world. Like any wiki, it is fueled by contributions from many people, and in this sense it is thriving. However, it could use a certain amount of attention and work in three key areas. We are looking for volunteers to step up in these regards, 1) Account Creation Management: Account creation is manual only because spambots otherwise destroy us. It would be worth investigating if a full upgrade and new plugins could help this issue. In the meantime, the responsibility for creating new accounts has fallen on only one person for years. This is not a good situation. We would like to set up a mail alias for wiki admins and extend account creation rights to a range of people. If you would be willing to be one of a team of responders to account creation requests, please write and let us know. 2) Technical and design oversight: Now that we have a new haskell.org homepage, the current wiki frontpage could use a redesign. For that matter, the whole wiki could use a bit of a redesign to bring it into a more modern style. Along with that, it may be the case that additional plugins — such as for typesetting code or equations better — could be quite helpful. It would be good to have a mediawiki admin who wants to help improve the technical capacities of the site, as well as to overhaul its look. Again, if you are interested in taking charge of this, please let us know. 3) Content curation: One issue with a large collection of documents written by different people is the lack of curation. Some pages fall out of date, information is spread across multiple pages instead of collected together, and quality varies greatly. Without a central authority, no one is responsible (or empowered) to fix the situation. There is a balance between keeping things up-to-date and preserving the historic content of the wiki, and without people feeling empowered to make big changes, the tendency will always fall towards the latter. We're looking for people in the community to volunteer to help improve this status quo. The task, generally speaking, is to be responsible for curating and improving the content of the wiki, but that's clearly a vague description with lots of room for individual embellishment. This doesn't need to be a single person either: a team working in a coordinated fashion could be incredibly effective. Once more, depending on response, we’d be happy to designate and empower people to make broader changes on the wiki or to organize a team to do so. If you are interested in this as well, please let us know. Gershom, for the Haskell.org Committee

6 7

haskell.org
by Ertugrul Söylemez 21 Apr '15

21 Apr '15

Hi everybody, I'd like to note that the prime "sieve" example that is sitting at the top of the homepage is not a real sieve and will more likely make people with number theory experience (like me) feel highly irritated rather than fascinated. A real sieve does not only run a million times (!) faster and consumes far less memory, but is also much longer, even in Haskell. Here is a real one: <http://lpaste.net/101980> I don't want to make a mountain out of a molehill, but please note: If I'd be new to Haskell, that example would have turned me off, because it would have hurt my ability to take Haskell programmers seriously. You can easily promote your tools when you claim that they can build a car easily, except in reality it's just a toy bicycle. It's the same feeling to cryptographers when people call a regular stream cipher a "one-time pad" and promote it as such. It rings the "this is snake oil!" alarm bell. So I propose to either rename the 'sieve' function to something more appropriate (like `trialDiv`) or replace the example altogether. I would suggest an example that truly shows Haskell's strengths. Trial division search is really just a bad substitute for the more common and equally inappropriate list quicksort example. Greets, Ertugrul

9 14

Looking for Senior Software Engineers
by Jonathan Fischoff 21 Apr '15

21 Apr '15

Dear Haskellers, There are two senior software engineer openings at skedge.me, a Haskell and NixOS based company located in Manhattan NY. Here are the job postings. http://www.indeed.com/cmp/skedge.me/jobs/Senior-Software-Engineer-18d7f042d… http://www.indeed.com/cmp/skedge.me/jobs/Senior-Software-Engineer-b62e69029… Professional Haskell experience is not required. Provided you have experience maintaining and developing web services, this is your chance to become a professional Haskeller (if you're not one already). Relocation will be provided, but remote is not an option. Please send your resumes to jobs(a)skedge.me if you are interested. Sincerely, Jonathan Fischoff VP of Engineering at skege.me

1 0

ANN: Upload agentx, Library for write extensible SNMP agents.
by Алексей Смирнов 21 Apr '15

21 Apr '15

Can be useful for create monitoring tools. Usage example in docs. get, set, walk, context is work. Bulk work as simple get. Tables don't work, Indexes don't work. https://hackage.haskell.org/package/agentx https://github.com/chemist/agentx -- Alexey Smirnov.

1 0

[ANN] Haskell Music - Two tracks in the Jungle style
by Anton Kholomiov 21 Apr '15

21 Apr '15

Dear list. I'd like to share two new tracks made in haskell (with csound-expression lib). They are two etudes in the style of the Jungle. One track is just a joke. I hope that Simon doesn't mind me sampling him. The track is made in Haskell :) So it's a musical thank-you for the wonderful language! https://soundcloud.com/anton-kho/jungle-etude-1 https://soundcloud.com/anton-kho/jungle-etude-2-feat-simon-peyton-jones Anton

2 2