From acfoltzer at gmail.com Fri Nov 1 19:11:21 2013 From: acfoltzer at gmail.com (Adam Foltzer) Date: Fri, 1 Nov 2013 12:11:21 -0700 Subject: [Haskell] Internship opportunities at Galois Message-ID: Hello, Galois has some exciting opportunities for interns in software engineering and research for 2014. Most of our projects use Haskell to some extent, so this is a great chance to get experience applying functional programming to real-world problems. Please pass along this posting to anyone you think might be interested, even if they don't yet know Haskell! Thank you, Adam Foltzer --- # Galois Software Engineering/Research Intern # Galois is currently seeking software engineering and research interns for 2014 at all educational levels. We are committed to matching interns with exciting and engaging engineering work that fits their particular interests, creating lasting value for interns, Galois, and our community. A Galois internship is a chance to tackle cutting-edge, meaningful problems in a uniquely collaborative environment with world-leading researchers. Roles may include technology research and development, requirements gathering, implementation, testing, formal verification, and infrastructure development. Past interns have integrated formal methods tools into larger projects, built comprehensive validation suites, synthesized high-performance cryptographic algorithms, written autopilots for quad-copters, designed the syntax and semantics of scripting languages, and researched type system extensions for academic publication. We deeply believe in providing comprehensive support and mentorship to all of our employees, particularly interns. We provide our employees with a steward who regularly checks in to ensure that they feel welcome and safe in the Galois community while gaining real value from their experiences. ## About Galois ## Our mission is to create trustworthiness in critical systems. We're in the business of taking blue-sky ideas and turning them into real-world technology solutions. We've been developing real-world systems for over ten years using functional programming, language design, and formal methods. Galois values diversity. We believe that differing viewpoints and experiences are essential to the process of innovation. We look broadly, including outside of established communities, to deliver innovation. ## How to Prepare ## An internship is an opportunity for learning and growth as an engineer. To make the most of the opportunity, we ask that candidates have experience reading, writing, and maintaining code in a realistic project. Many university courses involve multi-week collaborative projects that provide this type of experience. Most of our projects use the Haskell programming language and the git version control system. These tools aren't often taught in computer science classes, but there are many free resources available that we recommend for learning: - [Learn You a Haskell for Great Good!] [1] by Miran Lipova?a - [Real World Haskell] [2] by Bryan O'Sullivan, Don Stewart, and John Goerzen - [tryGit] [3] by Code School - [Pro Git] [4] by Scott Chacon [1]: http://learnyouahaskell.com/ [2]: http://book.realworldhaskell.org/ [3]: http://try.github.io [4]: http://git-scm.com/book ## Qualifications ## - The ability to be geographically located in Portland during the internship - Experience reading, writing, and maintaining code in a project as described above - Proficiency in software development practices such as design, documentation, testing, and the use of version control - Well-developed verbal and written communication skills; comfort in a collaborative team environment The following skills are not required, but may be relevant to a particular project. - Proficiency in Haskell or other programming languages with rich type systems (eg., OCaml, Standard ML, Scala) - Experience using C and assembly languages for low-level systems programming - Development experience in high assurance systems or security software - Specific experience in an area of Galois' expertise, such as: - Assured information sharing - Software modelling and formal verification - Cyber-physical systems and control systems - Operating systems, virtualization and secure platforms - Networking and mobile technology - Cyber defense systems - Scientific computing - Program analysis and software evaluation - Web security ## Logistics ## The length and start date of the internship are negotiable: starting any time from the new year through next fall is acceptable, but an intern must be at Galois for at least three continuous months. The internship is paid competitively, and interns are responsible for living arrangements (although we can certainly help you find arrangements). Galois is located in the heart of downtown Portland with multiple public transportation options available and world-class bicycle infrastructure. ## Application Details ## Send an email to careers at galois.com with the subject line "Internship 2014" with the following contents: - Email body: a brief plain-text note explaining your interests, experience, and other relevant details - Attachment: CV/Resume (PDF, plain text, or markdown only) **Applications must be received at least two months before the desired start date**. For example, we must receive your application by November 6, 2013, if you wish to start on January 6, 2014. -------------- next part -------------- An HTML attachment was scrubbed... URL: From marlowsd at gmail.com Mon Nov 4 13:40:01 2013 From: marlowsd at gmail.com (Simon Marlow) Date: Mon, 04 Nov 2013 13:40:01 +0000 Subject: [Haskell] Internship at Facebook London working on Haxl Message-ID: <5277A3B1.1060805@gmail.com> We have an opening for an internship at Facebook London in 2014, working on the Haxl project. Our project is a mix of language/DSL design, tools, and systems programming, written in a combination of Haskell and C++. We?re looking for a candidate who will be able to explore some of the open problems with a view to producing a research publication. The ideal candidate: - Is a PhD student, preferably towards the end of their PhD. - Has a deep understanding of Haskell, and is not scared of C++. - Has research experience in a relevant area: systems programming with Haskell, or language and DSL design, for example. - Is fired up by the idea of solving interesting problems at scale. Timing: we are flexible on timing, the available start dates are Jan 6th, May 27th, July 7th, and September 2nd. Internships last 12 weeks. Any questions feel free to email me directly. To apply, please get in touch with Ruth McIntyre (ruth at fb.com). Cheers, Simon From dstcruz at gmail.com Thu Nov 7 03:26:51 2013 From: dstcruz at gmail.com (Daniel Santa Cruz) Date: Wed, 6 Nov 2013 22:26:51 -0500 Subject: [Haskell] Haskell Weekly News: Issue 285 Message-ID: Welcome to issue 285 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the weeks of October 20 to November 02, 2013. Quotes of the Week * roconnor: edwardk: is comonad Haskell 1.4? I liked Haskell 1.4. * Peaker: Don't trust the @src, luke * dmwit: If it fits in a tweet, you haven't included enough information to debug it yet. Top Reddit Stories * The Haskell Cast #3 - Simon Peyton Jones on GHC Domain: haskellcast.com, Score: 88, Comments: 11 On Reddit: [1] http://goo.gl/0sGzlg Original: [2] http://goo.gl/wQ4FKi * Elm 0.10 released: faster strings, nice colors, bug fixes, and searchable documentation Domain: elm-lang.org, Score: 74, Comments: 9 On Reddit: [3] http://goo.gl/HJ2fc7 Original: [4] http://goo.gl/xFJJMN * Procrustean Mathematics by Edward Kmett Domain: fpcomplete.com, Score: 71, Comments: 17 On Reddit: [5] http://goo.gl/AsB0CM Original: [6] http://goo.gl/E1iDNM * Haskell hurdle: uninteresting world Domain: gundersen.net, Score: 68, Comments: 58 On Reddit: [7] http://goo.gl/W8l3T1 Original: [8] http://goo.gl/uBVp1f * websockets-0.8 released: with browser shell example + bonus section on pipes vs. conduit vs. io-streams Domain: jaspervdj.be, Score: 65, Comments: 9 On Reddit: [9] http://goo.gl/0XvXZa Original: [10] http://goo.gl/eUDMn1 * IHaskell: Haskell for Interactive Computing Domain: gibiansky.github.io, Score: 61, Comments: 26 On Reddit: [11] http://goo.gl/ZpNpq8 Original: [12] http://goo.gl/A8iccI * ShellCheck ? static analysis and linting tool for sh/bash script Domain: shellcheck.net, Score: 55, Comments: 10 On Reddit: [13] http://goo.gl/z0giaP Original: [14] http://goo.gl/zF3DLB * Micro-tutorial: liftM by accident Domain: self.haskell, Score: 54, Comments: 29 On Reddit: [15] http://goo.gl/d6ReRs Original: [16] http://goo.gl/d6ReRs * Barclays are hiring: Haskell developers in London and Kiev Domain: self.haskell, Score: 52, Comments: 14 On Reddit: [17] http://goo.gl/Fq7JPE Original: [18] http://goo.gl/Fq7JPE * License monads Domain: joeyh.name, Score: 52, Comments: 18 On Reddit: [19] http://goo.gl/oZ9La1 Original: [20] http://goo.gl/9C1Stp * Show Reddit: My weekend project, PureScript Domain: functorial.com, Score: 49, Comments: 61 On Reddit: [21] http://goo.gl/sRx1Eh Original: [22] http://goo.gl/TJBCYN * Deamortized ST by Edward Kmett Domain: fpcomplete.com, Score: 49, Comments: 57 On Reddit: [23] http://goo.gl/Vck3Ij Original: [24] http://goo.gl/wtaueO * HaLVM 2.0 Developer's Release (trans: buggy but API-stable pre-release) now available for folks to try. GHC 7.8, threaded RTS, SMP HaLVM support, 0-copy networking, and more. Domain: community.galois.com, Score: 44, Comments: 13 On Reddit: [25] http://goo.gl/5Psg7B Original: [26] http://goo.gl/xQFUA2 * Could you explain why complexity of monadic IO is worth it? Domain: self.haskell, Score: 43, Comments: 128 On Reddit: [27] http://goo.gl/esFCc4 Original: [28] http://goo.gl/esFCc4 * London Haskell User Group 18/09/2013: Oliver Charles on pipes [video] Domain: ocharles.org.uk, Score: 42, Comments: 14 On Reddit: [29] http://goo.gl/8kDKnw Original: [30] http://goo.gl/hi3L3P * C-- as a project separate from GHC Domain: cminusminus.org, Score: 42, Comments: 14 On Reddit: [31] http://goo.gl/fvUjIk Original: [32] http://goo.gl/VueAA * How to start a new Haskell project Domain: jabberwocky.eu, Score: 42, Comments: 26 On Reddit: [33] http://goo.gl/6dRRXn Original: [34] http://goo.gl/btWJYS * The let-no-escape optimization Domain: lambda.jstolarek.com, Score: 41, Comments: 1 On Reddit: [35] http://goo.gl/l8xhuP Original: [36] http://goo.gl/J8uekI * Improving Applicative do-notation Domain: tmorris.net, Score: 40, Comments: 150 On Reddit: [37] http://goo.gl/MXoPdz Original: [38] http://goo.gl/y1I8Tx * Odersky: The Trouble with Types - Strange Loop 2013 [InfoQ] Domain: infoq.com, Score: 39, Comments: 55 On Reddit: [39] http://goo.gl/5QEJfz Original: [40] http://goo.gl/Ir4kwG Top StackOverflow Questions * Haskell Thrift library 300x slower than C++ in performance test votes: 34, answers: 5 Read on SO: [41] http://goo.gl/timvYf * Creating methods bound to records in Haskell votes: 10, answers: 1 Read on SO: [42] http://goo.gl/4E4Sgh * Installing & Building GHC with OSX Mavericks GHC votes: 10, answers: 1 Read on SO: [43] http://goo.gl/44PIaj * How to properly communicate compile-time information to Template Haskell functions? votes: 10, answers: 0 Read on SO: [44] http://goo.gl/YQkGbl * Data.Text vs String votes: 9, answers: 2 Read on SO: [45] http://goo.gl/ttjnJ1 * Why is matrix multiplication faster with Repa than with hmatrix? votes: 9, answers: 1 Read on SO: [46] http://goo.gl/e36toD * Efficient functional algorithm for computing closure under an operator votes: 8, answers: 1 Read on SO: [47] http://goo.gl/538Yyr * Why doesn't Haskell sequence these IO actions properly? votes: 8, answers: 2 Read on SO: [48] http://goo.gl/82PZYb * Is there a way to make my word counting program faster without using impure tricks? votes: 8, answers: 1 Read on SO: [49] http://goo.gl/F3OiUk * Is it better to define Functor in terms of Applicative in terms of Monad, or vice versa? votes: 8, answers: 3 Read on SO: [50] http://goo.gl/xEkVIf * Standard Haskell function :: (a -> Maybe b) -> [a] -> Maybe b votes: 8, answers: 3 Read on SO: [51] http://goo.gl/JdA5Xf * Why are cabal reinstalls ?always dangerous?? votes: 8, answers: 1 Read on SO: [52] http://goo.gl/kCdUsL * How to use the maybe monoid and combine values with a custom operation, easily? votes: 8, answers: 3 Read on SO: [53] http://goo.gl/BpL8NK Until next time, [54]+Daniel Santa Cruz References 1. http://www.haskellcast.com/episode/003-simon-peyton-jones-on-ghc/ 2. http://www.reddit.com/r/haskell/comments/1pe8tj/the_haskell_cast_3_simon_peyton_jones_on_ghc/ 3. http://elm-lang.org/blog/announce/0.10.elm 4. http://www.reddit.com/r/haskell/comments/1p43xx/elm_010_released_faster_strings_nice_colors_bug/ 5. https://www.fpcomplete.com/user/edwardk/editorial/procrustean-mathematics 6. http://www.reddit.com/r/haskell/comments/1p85al/procrustean_mathematics_by_edward_kmett/ 7. http://www.gundersen.net/functional-programming-hurdle-uninteresting-programs/ 8. http://www.reddit.com/r/haskell/comments/1oyy54/haskell_hurdle_uninteresting_world/ 9. http://jaspervdj.be/posts/2013-10-22-websockets-0.8.html 10. http://www.reddit.com/r/haskell/comments/1p0bey/websockets08_released_with_browser_shell_example/ 11. http://gibiansky.github.io/IHaskell/ 12. http://www.reddit.com/r/haskell/comments/1oxj6k/ihaskell_haskell_for_interactive_computing/ 13. http://www.shellcheck.net/about.html 14. http://www.reddit.com/r/haskell/comments/1pg7ym/shellcheck_static_analysis_and_linting_tool_for/ 15. http://www.reddit.com/r/haskell/comments/1pd1ep/microtutorial_liftm_by_accident/ 16. http://www.reddit.com/r/haskell/comments/1pd1ep/microtutorial_liftm_by_accident/ 17. http://www.reddit.com/r/haskell/comments/1p70l3/barclays_are_hiring_haskell_developers_in_london/ 18. http://www.reddit.com/r/haskell/comments/1p70l3/barclays_are_hiring_haskell_developers_in_london/ 19. http://joeyh.name/blog/entry/license_monads/ 20. http://www.reddit.com/r/haskell/comments/1plql7/license_monads/ 21. http://functorial.com/purescript/ 22. http://www.reddit.com/r/haskell/comments/1pkzd0/show_reddit_my_weekend_project_purescript/ 23. https://www.fpcomplete.com/user/edwardk/oblivious/deamortized-st 24. http://www.reddit.com/r/haskell/comments/1pnrqn/deamortized_st_by_edward_kmett/ 25. http://community.galois.com/pipermail/halvm-devel/2013-October/000041.html 26. http://www.reddit.com/r/haskell/comments/1ot4ep/halvm_20_developers_release_trans_buggy_but/ 27. http://www.reddit.com/r/haskell/comments/1owtvs/could_you_explain_why_complexity_of_monadic_io_is/ 28. http://www.reddit.com/r/haskell/comments/1owtvs/could_you_explain_why_complexity_of_monadic_io_is/ 29. http://ocharles.org.uk/blog/posts/2013-10-23-pipes-talk.html 30. http://www.reddit.com/r/haskell/comments/1p1wrt/london_haskell_user_group_18092013_oliver_charles/ 31. http://www.cminusminus.org/ 32. http://www.reddit.com/r/haskell/comments/1pbbon/c_as_a_project_separate_from_ghc/ 33. http://jabberwocky.eu/2013/10/24/how-to-start-a-new-haskell-project/ 34. http://www.reddit.com/r/haskell/comments/1pdxcr/how_to_start_a_new_haskell_project/ 35. http://lambda.jstolarek.com/2013/10/let-no-escape/ 36. http://www.reddit.com/r/haskell/comments/1pi6fz/the_letnoescape_optimization/ 37. http://tmorris.net/posts/applicative-do/index.html 38. http://www.reddit.com/r/haskell/comments/1ou06l/improving_applicative_donotation/ 39. http://www.infoq.com/presentations/data-types-issues 40. http://www.reddit.com/r/haskell/comments/1pjjy5/odersky_the_trouble_with_types_strange_loop_2013/ 41. http://stackoverflow.com/questions/19512952/haskell-thrift-library-300x-slower-than-c-in-performance-test 42. http://stackoverflow.com/questions/19484232/creating-methods-bound-to-records-in-haskell 43. http://stackoverflow.com/questions/19579577/installing-building-ghc-with-osx-mavericks-ghc 44. http://stackoverflow.com/questions/19679024/how-to-properly-communicate-compile-time-information-to-template-haskell-functio 45. http://stackoverflow.com/questions/19608745/data-text-vs-string 46. http://stackoverflow.com/questions/19733382/why-is-matrix-multiplication-faster-with-repa-than-with-hmatrix 47. http://stackoverflow.com/questions/19485082/efficient-functional-algorithm-for-computing-closure-under-an-operator 48. http://stackoverflow.com/questions/19513660/why-doesnt-haskell-sequence-these-io-actions-properly 49. http://stackoverflow.com/questions/19535688/is-there-a-way-to-make-my-word-counting-program-faster-without-using-impure-tric 50. http://stackoverflow.com/questions/19635265/is-it-better-to-define-functor-in-terms-of-applicative-in-terms-of-monad-or-vic 51. http://stackoverflow.com/questions/19643664/standard-haskell-function-a-maybe-b-a-maybe-b 52. http://stackoverflow.com/questions/19692644/why-are-cabal-reinstalls-always-dangerous 53. http://stackoverflow.com/questions/19706501/how-to-use-the-maybe-monoid-and-combine-values-with-a-custom-operation-easily 54. https://plus.google.com/105107667630152149014/about -------------- next part -------------- An HTML attachment was scrubbed... URL: From alexander.herz at mytum.de Thu Nov 7 09:40:59 2013 From: alexander.herz at mytum.de (Alexander Herz) Date: Thu, 07 Nov 2013 10:40:59 +0100 Subject: [Haskell] repa not running in parallel? Message-ID: <527B602B.3000602@mytum.de> Hi, I'm new to haskell and I tried to reproduce the perfomance values from the paper "Regular, Shape-polymorphic, Parallel Arrays in Haskell". I modified the repa-mmult example from the repa-example package to use the mmultP from Data.Array.Repa.Algorithms.Matrix. Then I compile it with "ghc -threaded -fglasgow-exts -O Main.hs" but running it with two large matrices : "./Main -random 4096 4096 -random 4096 4096" I can see that only one of my 4 cpus is utilized. What am I doing wrong? Note: The unmodified repa-example also does not run in parallel. Thx, Alex From roma at ro-che.info Thu Nov 7 09:44:30 2013 From: roma at ro-che.info (Roman Cheplyaka) Date: Thu, 7 Nov 2013 11:44:30 +0200 Subject: [Haskell] repa not running in parallel? In-Reply-To: <527B602B.3000602@mytum.de> References: <527B602B.3000602@mytum.de> Message-ID: <20131107094430.GA27115@sniper> Try adding +RTS -N at the end of your ./Main command line. * Alexander Herz [2013-11-07 10:40:59+0100] > Hi, > > I'm new to haskell and I tried to reproduce the perfomance values > from the paper "Regular, Shape-polymorphic, Parallel Arrays in > Haskell". > > I modified the repa-mmult example from the repa-example package to > use the mmultP from Data.Array.Repa.Algorithms.Matrix. > > Then I compile it with "ghc -threaded -fglasgow-exts -O Main.hs" but > running it with two large matrices : > > "./Main -random 4096 4096 -random 4096 4096" I can see that only one > of my 4 cpus is utilized. > > What am I doing wrong? > > Note: The unmodified repa-example also does not run in parallel. > > Thx, > Alex > _______________________________________________ > Haskell mailing list > Haskell at haskell.org > http://www.haskell.org/mailman/listinfo/haskell -------------- next part -------------- A non-text attachment was scrubbed... Name: signature.asc Type: application/pgp-signature Size: 836 bytes Desc: Digital signature URL: From tikhon at jelv.is Thu Nov 7 09:45:35 2013 From: tikhon at jelv.is (Tikhon Jelvis) Date: Thu, 7 Nov 2013 01:45:35 -0800 Subject: [Haskell] repa not running in parallel? In-Reply-To: <527B602B.3000602@mytum.de> References: <527B602B.3000602@mytum.de> Message-ID: I think you need to specify how many cores to use when you call your ./Main program. Something like "./Main -random 4096 4096 -random 4096 4096 +RTS -N4" (given that you have 4 cores). You'll also need to add -rtsopts when you're compiling your code with ghc. On Thu, Nov 7, 2013 at 1:40 AM, Alexander Herz wrote: > Hi, > > I'm new to haskell and I tried to reproduce the perfomance values from the > paper "Regular, Shape-polymorphic, Parallel Arrays in Haskell". > > I modified the repa-mmult example from the repa-example package to use the > mmultP from Data.Array.Repa.Algorithms.Matrix. > > Then I compile it with "ghc -threaded -fglasgow-exts -O Main.hs" but > running it with two large matrices : > > "./Main -random 4096 4096 -random 4096 4096" I can see that only one of my > 4 cpus is utilized. > > What am I doing wrong? > > Note: The unmodified repa-example also does not run in parallel. > > Thx, > Alex > _______________________________________________ > Haskell mailing list > Haskell at haskell.org > http://www.haskell.org/mailman/listinfo/haskell > -------------- next part -------------- An HTML attachment was scrubbed... URL: From alexander.herz at mytum.de Thu Nov 7 09:47:52 2013 From: alexander.herz at mytum.de (Alexander Herz) Date: Thu, 07 Nov 2013 10:47:52 +0100 Subject: [Haskell] repa not running in parallel? In-Reply-To: <527B602B.3000602@mytum.de> References: <527B602B.3000602@mytum.de> Message-ID: <527B61C8.7000706@mytum.de> Problem solved! Sorry for using the wrong list. Alex On 11/07/2013 10:40 AM, Alexander Herz wrote: > Hi, > > I'm new to haskell and I tried to reproduce the perfomance values from > the paper "Regular, Shape-polymorphic, Parallel Arrays in Haskell". > > I modified the repa-mmult example from the repa-example package to use > the mmultP from Data.Array.Repa.Algorithms.Matrix. > > Then I compile it with "ghc -threaded -fglasgow-exts -O Main.hs" but > running it with two large matrices : > > "./Main -random 4096 4096 -random 4096 4096" I can see that only one > of my 4 cpus is utilized. > > What am I doing wrong? > > Note: The unmodified repa-example also does not run in parallel. > > Thx, > Alex > _______________________________________________ > Haskell mailing list > Haskell at haskell.org > http://www.haskell.org/mailman/listinfo/haskell From claude at mathr.co.uk Thu Nov 7 09:54:27 2013 From: claude at mathr.co.uk (Claude Heiland-Allen) Date: Thu, 07 Nov 2013 09:54:27 +0000 Subject: [Haskell] repa not running in parallel? In-Reply-To: <527B602B.3000602@mytum.de> References: <527B602B.3000602@mytum.de> Message-ID: <527B6353.8040709@mathr.co.uk> Hi Alexander, On 07/11/13 09:40, Alexander Herz wrote: > Hi, > > I'm new to haskell and I tried to reproduce the perfomance values from > the paper "Regular, Shape-polymorphic, Parallel Arrays in Haskell". > > I modified the repa-mmult example from the repa-example package to use > the mmultP from Data.Array.Repa.Algorithms.Matrix. > > Then I compile it with "ghc -threaded -fglasgow-exts -O Main.hs" but > running it with two large matrices : > > "./Main -random 4096 4096 -random 4096 4096" I can see that only one of > my 4 cpus is utilized. > > What am I doing wrong? Probably, not running with ./Main +RTS -N -RTS ... http://www.haskell.org/ghc/docs/7.6.3/html/users_guide/using-smp.html#parallel-options > Note: The unmodified repa-example also does not run in parallel. > > Thx, > Alex Claude -- http://mathr.co.uk From ben_moseley at mac.com Fri Nov 8 09:18:45 2013 From: ben_moseley at mac.com (Ben Moseley) Date: Fri, 08 Nov 2013 09:18:45 +0000 Subject: [Haskell] Job opportunities at Startup - London and Exeter Message-ID: <383DBEED-9A29-4C0E-AB47-0D83F91D928C@mac.com> If you are an experienced developer, have a keen interest in functional programming and would be interested in working at an ambitious, funded, consumer-focused UK startup, please get in touch with me. Our main server-side infra is Haskell-based but we also use Java and Objective-C for the mobile platforms we target. Beyond the obvious technical skills, successful candidates will need focus and determination to get the job done. In return we offer a hugely exciting and challenging working environment, competitive compensation, a great culture (we'll probably try and drag you away from your keyboard and onto a mountain bike) and an experienced management team with a proven track-record. We are looking for developers to be based in London and Exeter. -- Ben Moseley - Programmer ben at benmoseley.net -------------- next part -------------- An HTML attachment was scrubbed... URL: From andres at well-typed.com Mon Nov 11 18:22:14 2013 From: andres at well-typed.com (=?ISO-8859-1?Q?Andres_L=F6h?=) Date: Mon, 11 Nov 2013 19:22:14 +0100 Subject: [Haskell] New: Haskell meeting in Regensburg, 2013-11-12, 20:00 Message-ID: Hi. There's a new monthly Haskell meeting in Regensburg, Bavaria, Germany. Tomorrow will be our third meeting, and the first one with a Haskell talk: Tuesday, 12 November 2013 20:00 Plan 9, Werftstra?e 15, 93059 Regensburg There'll be a short presentation by Martin Ruderer on how to solve problems such as the n-queens problem in Haskell. In addition, there's time for informal discussions and drinks. Everyone who's interested in Haskell is welcome. No actual knowledge of Haskell is expected or required. We'll speak German and/or English, depending on who's going to be there. If you'd like to get updates about future Regensburg Haskell meetings or vote on when we meet next, please join our mailing list at http://lists.binary-kitchen.de/listinfo/haskell If you have any questions and for some reason don't want to join the mailing list, you can also email me :) Hope to see many of you tomorrow. Cheers, Andres From abbasakbar at hushmail.com Tue Nov 12 18:18:19 2013 From: abbasakbar at hushmail.com (abbasakbar at hushmail.com) Date: Tue, 12 Nov 2013 18:18:19 +0000 Subject: [Haskell] Fake Conferences CSCI and WORLDCOMP of Hamid Arabnia Message-ID: <20131112181819.5122A6017B@smtp.hushmail.com> Fake Conferences CSCI and WORLDCOMP of Hamid Arabnia Hamid Arabnia from University of Georgia is well known for his fake WORLDCOMP conferences https://sites.google.com/site/worlddump1 or https://sites.google.com/site/dumpconf Hamid Arabnia understood that he cannot deceive researchers anymore using his WORLDCOMP. Hamid Arabnia (Guru of Fake Conferences and champion of academic scam) has recently started 2014 International Conference on Computational Science and Computational Intelligence (CSCI'14) http://www.americancse.org to deceive researchers further. CSCI'14 is started under the title of ?American Council on Science and Education? which is a dummy corporation (does not exist anywhere in the world). Hamid Arabnia buried his name in the list of names of other innocent steering and program committee members of CSCI?14 to avoid any special attention. He knows that if his name is given any special attention then researchers immediately know that the conference is fake due to his ?track record? with WORLDCOMP. Hamid Arabnia (the money hungry beast) spoiled the reputations and careers of many authors and committee members involved in his infamous WORLDCOMP for more than a decade and he is now ready to do the same using CSCI. Interestingly, CSCI is scheduled to be held at the same venue where WORLDCOMP was held until 2012. Hamid Arabnia claimed that CSCI proceedings will be published by IEEE but no one knows if IEEE really publishes. Many scholars have already sent emails to IEEE protesting for the unethical behavior of Hamid Arabnia and for the new series of his bogus conferences CSCI. CSCI paper submission deadline will be extended multiple times as usual. Do not spoil your resume by submitting your papers in this bogus conference CSCI which will not be held beyond 2014. Sincerely, Many researchers cheated by Hamid Arabnia conferences From dstcruz at gmail.com Wed Nov 13 03:47:41 2013 From: dstcruz at gmail.com (Daniel Santa Cruz) Date: Tue, 12 Nov 2013 22:47:41 -0500 Subject: [Haskell] Haskell Weekly News: Issue 286 Message-ID: Welcome to issue 286 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the weeks of November 03 to 09, 2013. Quotes of the Week * edwardk: (->) is syntax, sadly. * chrisdone: my brother was killed by an IO monad hpc: i guess it started as an evaluation, but ended up as an execution... * mauke: no, haskell doesn't support trees * un1xguy: first web server was written in php... Top Reddit Stories * Haskell, the Language Most Likely to Change the Way you Think About Programming Domain: m.huffpost.com, Score: 54, Comments: 71 On Reddit: [1] http://goo.gl/E0dfbl Original: [2] http://goo.gl/1CGVmK * Announcing 24 Days of Hackage 2013 - I need your help! Domain: ocharles.org.uk, Score: 53, Comments: 45 On Reddit: [3] http://goo.gl/7RupOj Original: [4] http://goo.gl/6Uog4B * Pyret: New teaching language from makers of Racket with ADTs and pattern matching Domain: pyret.org, Score: 47, Comments: 25 On Reddit: [5] http://goo.gl/Xeyyyh Original: [6] http://goo.gl/GJmYgI * haskintex: Write and run Haskell within LaTeX Domain: daniel-diaz.github.io, Score: 42, Comments: 14 On Reddit: [7] http://goo.gl/1UTbdL Original: [8] http://goo.gl/2DbE5I * Haskell.org SSL rollout Domain: hackage.haskell.org, Score: 41, Comments: 9 On Reddit: [9] http://goo.gl/2DvgLX Original: [10] http://goo.gl/M0QwMh * Why Lists? Domain: self.haskell, Score: 36, Comments: 54 On Reddit: [11] http://goo.gl/Y2ma9V Original: [12] http://goo.gl/Y2ma9V * Frege: a JVM pure functional programming language in the spirit of Haskell Domain: github.com, Score: 36, Comments: 22 On Reddit: [13] http://goo.gl/pyaB8s Original: [14] http://goo.gl/kJWFg * Switching from imperative to functional programming with games in Elm (xpost from /r/programming) Domain: github.com, Score: 35, Comments: 11 On Reddit: [15] http://goo.gl/CbsMhS Original: [16] http://goo.gl/0MpQJ0 * FP Complete is hiring a Ruby expert Haskeller. Help bring Haskell to Rubyists! Domain: self.haskell, Score: 34, Comments: 26 On Reddit: [17] http://goo.gl/eb6G1s Original: [18] http://goo.gl/eb6G1s * plaimi?s introduction to Haskell for the Haskell-curious game programmer [PDF] Domain: secure.plaimi.net, Score: 31, Comments: 21 On Reddit: [19] http://goo.gl/khkU80 Original: [20] http://goo.gl/ZgRzkn * The F# Computation Expression Zoo (Why "computation expressions" are not just an "enterprise-y monad") Domain: tomasp.net, Score: 31, Comments: 18 On Reddit: [21] http://goo.gl/qnbrNx Original: [22] http://goo.gl/ErKmeU * Try PureScript Domain: tryps.functorial.com, Score: 30, Comments: 13 On Reddit: [23] http://goo.gl/mOJCvG Original: [24] http://goo.gl/aujnyl * Internship at Facebook London working on Haxl Domain: haskell.org, Score: 30, Comments: 4 On Reddit: [25] http://goo.gl/pHjgFp Original: [26] http://goo.gl/3qrzyR * Soostone is hiring in Turkey Domain: haskell.org, Score: 29, Comments: 15 On Reddit: [27] http://goo.gl/juSJLL Original: [28] http://goo.gl/IpYTkJ * Mind-bending behavior for deserialization in Haskell Domain: justinleitgeb.com, Score: 25, Comments: 75 On Reddit: [29] http://goo.gl/4BnEVn Original: [30] http://goo.gl/wTC06g * Hudak and Jones - An Experiment in Software Prototyping Productivity - 1994 [PDF] Domain: cs.yale.edu, Score: 24, Comments: 9 On Reddit: [31] http://goo.gl/krp66H Original: [32] http://goo.gl/qK6H98 * Webcast: Designing Domain Specific Languages with Haskell - Michael Snoyman - 2012-11-14 Domain: oreillynet.com, Score: 23, Comments: 0 On Reddit: [33] http://goo.gl/liqoge Original: [34] http://goo.gl/X7N0eN * Code review request: Wikipedia API for Haskell Domain: self.haskell, Score: 23, Comments: 25 On Reddit: [35] http://goo.gl/VgPCpC Original: [36] http://goo.gl/VgPCpC * transliterate: A korean transliteration library targeting GHC, Fay, and JS Domain: github.com, Score: 21, Comments: 16 On Reddit: [37] http://goo.gl/oYrL6c Original: [38] http://goo.gl/OAZ1z9 * lens-family 1.0.0 Domain: comments.gmane.org, Score: 20, Comments: 5 On Reddit: [39] http://goo.gl/H1HFyZ Original: [40] http://goo.gl/oAAd6Z * Gershom Bazerman, NYC Haskell Meetup Organizer, interviewed for your great learning Domain: rogueleaderr.com, Score: 20, Comments: 0 On Reddit: [41] http://goo.gl/unTdeJ Original: [42] http://goo.gl/0hJ1DL Top StackOverflow Questions * ?Eta reduce? is not always held in Haskell? votes: 11, answers: 1 Read on SO: [43] http://goo.gl/G0NZPp * Data Constructor promotion in GHC-7.6 votes: 10, answers: 0 Read on SO: [44] http://goo.gl/huK32T * best way to check arguments of a function in haskell votes: 9, answers: 1 Read on SO: [45] http://goo.gl/Cz5VDs * Processing a very large text file with lazy Texts and ByteStrings votes: 8, answers: 1 Read on SO: [46] http://goo.gl/eMtxDx * Style vs Performance Using Vectors votes: 8, answers: 1 Read on SO: [47] http://goo.gl/gm9o08 * Monad with no wrapped value? votes: 8, answers: 4 Read on SO: [48] http://goo.gl/XPBwQd * Is it safe to reuse a conduit? votes: 7, answers: 1 Read on SO: [49] http://goo.gl/QTepyV * Haskell Repa stencil hacks votes: 6, answers: 1 Read on SO: [50] http://goo.gl/2vEqVg * Are Functor instances unique? votes: 6, answers: 1 Read on SO: [51] http://goo.gl/EHm4yq Until next time, [52]+Daniel Santa Cruz References 1. http://m.huffpost.com/us/entry/4242119 2. http://www.reddit.com/r/haskell/comments/1q93r2/haskell_the_language_most_likely_to_change_the/ 3. http://ocharles.org.uk/blog/posts/2013-11-06-24-days-of-hackage-2013.html 4. http://www.reddit.com/r/haskell/comments/1q1sg1/announcing_24_days_of_hackage_2013_i_need_your/ 5. http://www.pyret.org/index.html 6. http://www.reddit.com/r/haskell/comments/1q8wv5/pyret_new_teaching_language_from_makers_of_racket/ 7. http://daniel-diaz.github.io/projects/haskintex 8. http://www.reddit.com/r/haskell/comments/1pwcd7/haskintex_write_and_run_haskell_within_latex/ 9. https://hackage.haskell.org/ 10. http://www.reddit.com/r/haskell/comments/1q1039/haskellorg_ssl_rollout/ 11. http://www.reddit.com/r/haskell/comments/1q0jsj/why_lists/ 12. http://www.reddit.com/r/haskell/comments/1q0jsj/why_lists/ 13. https://github.com/Frege/frege 14. http://www.reddit.com/r/haskell/comments/1q3r8v/frege_a_jvm_pure_functional_programming_language/ 15. https://github.com/Dobiasd/elm-articles/blob/master/switching_from_imperative_to_functional_programming_with_games_in_Elm.md 16. http://www.reddit.com/r/haskell/comments/1q5s14/switching_from_imperative_to_functional/ 17. http://www.reddit.com/r/haskell/comments/1pv6ua/fp_complete_is_hiring_a_ruby_expert_haskeller/ 18. http://www.reddit.com/r/haskell/comments/1pv6ua/fp_complete_is_hiring_a_ruby_expert_haskeller/ 19. https://secure.plaimi.net/~alexander/tmp/main.pdf 20. http://www.reddit.com/r/haskell/comments/1q1b9f/plaimis_introduction_to_haskell_for_the/ 21. http://tomasp.net/blog/2013/computation-zoo-padl/index.html 22. http://www.reddit.com/r/haskell/comments/1q6o2a/the_f_computation_expression_zoo_why_computation/ 23. http://tryps.functorial.com/ 24. http://www.reddit.com/r/haskell/comments/1pu02e/try_purescript/ 25. http://www.haskell.org/pipermail/haskell/2013-November/023977.html 26. http://www.reddit.com/r/haskell/comments/1pvggf/internship_at_facebook_london_working_on_haxl/ 27. http://www.haskell.org/pipermail/haskell-cafe/2013-November/111295.html 28. http://www.reddit.com/r/haskell/comments/1pyfor/soostone_is_hiring_in_turkey/ 29. http://justinleitgeb.com/haskell/mind-bending-behavior-for-deserialization-in-haskell/ 30. http://www.reddit.com/r/haskell/comments/1q4r3b/mindbending_behavior_for_deserialization_in/ 31. http://www.cs.yale.edu/publications/techreports/tr1049.pdf 32. http://www.reddit.com/r/haskell/comments/1pxvbk/hudak_and_jones_an_experiment_in_software/ 33. http://oreillynet.com/pub/e/2400 34. http://www.reddit.com/r/haskell/comments/1pzre6/webcast_designing_domain_specific_languages_with/ 35. http://www.reddit.com/r/haskell/comments/1pzymv/code_review_request_wikipedia_api_for_haskell/ 36. http://www.reddit.com/r/haskell/comments/1pzymv/code_review_request_wikipedia_api_for_haskell/ 37. https://github.com/bergmark/transliterate 38. http://www.reddit.com/r/haskell/comments/1q367s/transliterate_a_korean_transliteration_library/ 39. http://comments.gmane.org/gmane.comp.lang.haskell.cafe/107972 40. http://www.reddit.com/r/haskell/comments/1ps3d7/lensfamily_100/ 41. http://rogueleaderr.com/post/66018558718/a-interview-4-gershom-bazerman-organizer-of#disqus_thread 42. http://www.reddit.com/r/haskell/comments/1pwkey/gershom_bazerman_nyc_haskell_meetup_organizer/ 43. http://stackoverflow.com/questions/19758828/eta-reduce-is-not-always-held-in-haskell 44. http://stackoverflow.com/questions/19875636/data-constructor-promotion-in-ghc-7-6 45. http://stackoverflow.com/questions/19869902/best-way-to-check-arguments-of-a-function-in-haskell 46. http://stackoverflow.com/questions/19779559/processing-a-very-large-text-file-with-lazy-texts-and-bytestrings 47. http://stackoverflow.com/questions/19803949/style-vs-performance-using-vectors 48. http://stackoverflow.com/questions/19884548/monad-with-no-wrapped-value 49. http://stackoverflow.com/questions/19793824/is-it-safe-to-reuse-a-conduit 50. http://stackoverflow.com/questions/19749343/haskell-repa-stencil-hacks 51. http://stackoverflow.com/questions/19774904/are-functor-instances-unique 52. https://plus.google.com/105107667630152149014/about -------------- next part -------------- An HTML attachment was scrubbed... URL: From mdmkolbe at gmail.com Wed Nov 13 18:16:48 2013 From: mdmkolbe at gmail.com (Michael D. Adams) Date: Wed, 13 Nov 2013 12:16:48 -0600 Subject: [Haskell] ANNOUNCE: Haskell Pdf Presenter (hpdfp) 0.2.2 Message-ID: ANNOUNCE: Haskell Pdf Presenter (hpdfp) 0.2.2 I'm pleased to announce the first public release of the Haskell Pdf Presenter (hpdfp). Project home page: http://michaeldadams.org/projects/haskell-pdf-presenter/ Project on Hackage: http://hackage.haskell.org/package/haskell-pdf-presenter/ Project repository: http://michaeldadams.org/repos-pub/hg/haskell-pdf-presenter/ What it is ========== The Haskell Pdf Presenter (hpdfp) is a tool for presenting PDF-based slide shows. For example, as a presenter, I like to see the next slide before it is shown to the audience as well as how much allotted time remains. I was never quite satisfied with the existing tools for this, so I wrote my own and hpdfp is the result. Though I originally wrote it for my own use, the tool has matured over time, and I now wish to share it with others. Aside from being a useful tool, I think hpdfp is a good example of elegance and economy in program design. Despite being only a thousand lines long, this program is full of features that may not be obvious at first glance so please be sure to look at the available help. Status ====== I've been using this tool in my own talks for over a year now, and it is fairly stable and feature complete. I've only tested it on Ubuntu so I don't know if it ports to other platforms. I'd love to hear any field reports about how it runs on other platforms. Future Directions ================= I have a long TODO list of ideas I may implement in the future, but most development has been driven by the practical considerations that I discover as I use the tool. If you have a use case for a particular feature, please let me know. ================ Feature requests, bug reports, suggestions or feedback as well as contributions to the documentation or implementation are most welcome. Michael D. Adams From mail at nh2.me Wed Nov 13 19:57:54 2013 From: mail at nh2.me (=?UTF-8?B?TmlrbGFzIEhhbWLDvGNoZW4=?=) Date: Wed, 13 Nov 2013 19:57:54 +0000 Subject: [Haskell] [Haskell-cafe] ANNOUNCE: Haskell Pdf Presenter (hpdfp) 0.2.2 In-Reply-To: References: Message-ID: <5283D9C2.2070108@nh2.me> That is great, I've been interested in that program since your POPL talk. One problem I've had with it so far: It takes 100% CPU time when idle, which makes my laptop go quite hot. Any idea why that could be? On Wed 13 Nov 2013 18:16:48 GMT, Michael D. Adams wrote: > ANNOUNCE: Haskell Pdf Presenter (hpdfp) 0.2.2 > > I'm pleased to announce the first public release of the Haskell Pdf > Presenter (hpdfp). > > Project home page: > http://michaeldadams.org/projects/haskell-pdf-presenter/ > > Project on Hackage: > http://hackage.haskell.org/package/haskell-pdf-presenter/ > > Project repository: > http://michaeldadams.org/repos-pub/hg/haskell-pdf-presenter/ > > What it is > ========== > The Haskell Pdf Presenter (hpdfp) is a tool for presenting PDF-based > slide shows. For example, as a presenter, I like to see the next slide > before it is shown to the audience as well as how much allotted time > remains. I was never quite satisfied with the existing tools for this, > so I wrote my own and hpdfp is the result. > > Though I originally wrote it for my own use, the tool has matured over > time, and I now wish to share it with others. Aside from being a > useful tool, I think hpdfp is a good example of elegance and economy > in program design. Despite being only a thousand lines long, this > program is full of features that may not be obvious at first glance so > please be sure to look at the available help. > > Status > ====== > I've been using this tool in my own talks for over a year now, and > it is fairly stable and feature complete. I've only tested it on > Ubuntu so I don't know if it ports to other platforms. I'd love to > hear any field reports about how it runs on other platforms. > > Future Directions > ================= > I have a long TODO list of ideas I may implement in the future, but > most development has been driven by the practical considerations that > I discover as I use the tool. If you have a use case for a particular > feature, please let me know. > > ================ > > Feature requests, bug reports, suggestions or feedback as well as > contributions to the documentation or implementation are most welcome. > > Michael D. Adams > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe at haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe From mdmkolbe at gmail.com Thu Nov 14 08:14:12 2013 From: mdmkolbe at gmail.com (Michael D. Adams) Date: Thu, 14 Nov 2013 02:14:12 -0600 Subject: [Haskell] [Haskell-cafe] ANNOUNCE: Haskell Pdf Presenter (hpdfp) 0.2.2 In-Reply-To: <5283D9C2.2070108@nh2.me> References: <5283D9C2.2070108@nh2.me> Message-ID: When the program is doing background rendering, it will go to 100% CPU time, but once the background rendering completes, it should settle down to almost no CPU usage at all (my task manager literally shows 0% CPU once pre-rending completes). Does this high CPU usage happen even when you don't load a PDF? After loading a PDF, there will be a small progress bar that races across the bottom of the presenter window. This represents the pre-rendering process. Does the CPU usage lower after that process completes? (If you need to run the experiment a few times, note that pressing Ctrl-R will flush the cache and re-trigger pre-rending.) If what you are seeing isn't just the background rendering, then the first place I would look is to see if the render thread is properly switching from renderThreadSoon (which burns up CPU) to renderThreadDelayed (which has a 100ms delay to avoid burning up CPU). You might also try changing the 100ms delay in renderThreadDelayed (HaskellPdfPresenter.hs line 932) to something larger like 1000ms. What operating system, compiler and package versions are you using? If you have any other clues, figure out what is going on, or if there is any way I can help you solve this, please let me know. On Wed, Nov 13, 2013 at 1:57 PM, Niklas Hamb?chen wrote: > That is great, I've been interested in that program since your POPL > talk. > > One problem I've had with it so far: > It takes 100% CPU time when idle, which makes my laptop go quite hot. > Any idea why that could be? > > On Wed 13 Nov 2013 18:16:48 GMT, Michael D. Adams wrote: >> ANNOUNCE: Haskell Pdf Presenter (hpdfp) 0.2.2 >> >> I'm pleased to announce the first public release of the Haskell Pdf >> Presenter (hpdfp). >> >> Project home page: >> http://michaeldadams.org/projects/haskell-pdf-presenter/ >> >> Project on Hackage: >> http://hackage.haskell.org/package/haskell-pdf-presenter/ >> >> Project repository: >> http://michaeldadams.org/repos-pub/hg/haskell-pdf-presenter/ >> >> What it is >> ========== >> The Haskell Pdf Presenter (hpdfp) is a tool for presenting PDF-based >> slide shows. For example, as a presenter, I like to see the next slide >> before it is shown to the audience as well as how much allotted time >> remains. I was never quite satisfied with the existing tools for this, >> so I wrote my own and hpdfp is the result. >> >> Though I originally wrote it for my own use, the tool has matured over >> time, and I now wish to share it with others. Aside from being a >> useful tool, I think hpdfp is a good example of elegance and economy >> in program design. Despite being only a thousand lines long, this >> program is full of features that may not be obvious at first glance so >> please be sure to look at the available help. >> >> Status >> ====== >> I've been using this tool in my own talks for over a year now, and >> it is fairly stable and feature complete. I've only tested it on >> Ubuntu so I don't know if it ports to other platforms. I'd love to >> hear any field reports about how it runs on other platforms. >> >> Future Directions >> ================= >> I have a long TODO list of ideas I may implement in the future, but >> most development has been driven by the practical considerations that >> I discover as I use the tool. If you have a use case for a particular >> feature, please let me know. >> >> ================ >> >> Feature requests, bug reports, suggestions or feedback as well as >> contributions to the documentation or implementation are most welcome. >> >> Michael D. Adams >> _______________________________________________ >> Haskell-Cafe mailing list >> Haskell-Cafe at haskell.org >> http://www.haskell.org/mailman/listinfo/haskell-cafe From jv at informatik.uni-bonn.de Thu Nov 14 08:33:44 2013 From: jv at informatik.uni-bonn.de (Janis Voigtlaender) Date: Thu, 14 Nov 2013 09:33:44 +0100 Subject: [Haskell] ANNOUNCE: Haskell Communities and Activities Report (25th ed., November 2013) Message-ID: <52848AE8.5040204@informatik.uni-bonn.de> On behalf of all the contributors, we are pleased to announce that the Haskell Communities and Activities Report (25th edition, November 2013) is now available, in PDF and HTML formats: http://haskell.org/communities/11-2013/report.pdf http://haskell.org/communities/11-2013/html/report.html Many thanks go to all the people that contributed to this report, both directly, by sending in descriptions, and indirectly, by doing all the interesting things that are reported. We hope you will find it as interesting a read as we did. If you have not encountered the Haskell Communities and Activities Reports before, you may like to know that the first of these reports was published in November 2001. Their goal is to improve the communication between the increasingly diverse groups, projects, and individuals working on, with, or inspired by Haskell. The idea behind these reports is simple: Every six months, a call goes out to all of you enjoying Haskell to contribute brief summaries of your own area of work. Many of you respond (eagerly, unprompted, and sometimes in time for the actual deadline) to the call. The editors collect all the contributions into a single report and feed that back to the community. When we try for the next update, six months from now, you might want to report on your own work, project, research area or group as well. So, please put the following into your diaries now: ======================================== End of April 2014: target deadline for contributions to the May 2014 edition of the HC&A Report ======================================== Unfortunately, many Haskellers working on interesting projects are so busy with their work that they seem to have lost the time to follow the Haskell related mailing lists and newsgroups, and have trouble even finding time to report on their work. If you are a member, user or friend of a project so burdened, please find someone willing to make time to report and ask them to "register" with the editors for a simple e-mail reminder in October (you could point us to them as well, and we can then politely ask if they want to contribute, but it might work better if you do the initial asking). Of course, they will still have to find the ten to fifteen minutes to draw up their report, but maybe we can increase our coverage of all that is going on in the community. Feel free to circulate this announcement further in order to reach people who might otherwise not see it. Enjoy! Mihai Maruseac and Janis Voigtlaender From mail at nh2.me Thu Nov 14 14:51:27 2013 From: mail at nh2.me (=?ISO-8859-1?Q?Niklas_Hamb=FCchen?=) Date: Thu, 14 Nov 2013 14:51:27 +0000 Subject: [Haskell] [Haskell-cafe] ANNOUNCE: Haskell Pdf Presenter (hpdfp) 0.2.2 In-Reply-To: References: <5283D9C2.2070108@nh2.me> Message-ID: <5284E36F.3080200@nh2.me> On 14/11/13 08:14, Michael D. Adams wrote: > When the program is doing background rendering, it will go to 100% CPU > time, but once the background rendering completes, it should settle > down to almost no CPU usage at all (my task manager literally shows 0% > CPU once pre-rending completes). > > Does this high CPU usage happen even when you don't load a PDF? > > After loading a PDF, there will be a small progress bar that races > across the bottom of the presenter window. This represents the > pre-rendering process. Does the CPU usage lower after that process > completes? (If you need to run the experiment a few times, note that > pressing Ctrl-R will flush the cache and re-trigger pre-rending.) You are right, it is the background rendering. I accidentally re-triggered it multiple times by re-sizing the window. Thanks for your explanation! From ehaussecker at gmail.com Mon Nov 18 23:06:21 2013 From: ehaussecker at gmail.com (Enzo) Date: Mon, 18 Nov 2013 15:06:21 -0800 Subject: [Haskell] ANN: smtps-gmail-1.0.0: Gmail API Message-ID: Hello, Do you use *Haskell*? Do you use *Gmail*? If you answered yes to these questions, then you will love *smtps-gmail* ? a Haskell implementation of the Gmail API. This package provides a simple interface to Gmail using the simple message transfer protocol with transport layer security. More information is available on Hackage: http://hackage.haskell.org/package/smtps-gmail. Cheers, Enzo Haussecker -------------- next part -------------- An HTML attachment was scrubbed... URL: From gergely at risko.hu Tue Nov 19 13:02:29 2013 From: gergely at risko.hu (Gergely Risko) Date: Tue, 19 Nov 2013 14:02:29 +0100 Subject: [Haskell] ANN: smtps-gmail-1.0.0: Gmail API References: Message-ID: <878uwkk0ii.fsf@gergely.risko.hu> On Mon, 18 Nov 2013 15:06:21 -0800, Enzo writes: > Do you use Haskell? Do you use Gmail? If you answered yes to these > questions, then you will love smtps-gmail ? a Haskell implementation > of the Gmail API. This package provides a simple interface to Gmail > using the simple message transfer protocol with transport layer > security. More information is available on Hackage: > http://hackage.haskell.org/package/smtps-gmail. https://github.com/enzoh/smtps-gmail/issues/1 Thanks, Gergely From kh at cs.st-andrews.ac.uk Wed Nov 20 09:08:53 2013 From: kh at cs.st-andrews.ac.uk (Kevin Hammond) Date: Wed, 20 Nov 2013 09:08:53 +0000 Subject: [Haskell] EAPLS PhD Award 2013 - Call for Nominations Message-ID: <20290CDD-DF40-400D-9DB4-8805A475A763@cs.st-andrews.ac.uk> [Haskellers definitely welcome! Kevin] EAPLS PhD Award 2013: Call for Nominations ======================================== URL: http://eapls.org/pages/phd_award/ Since a few years, the European Association for Programming Languages and Systems has established a Best Dissertation Award in the international research area of programming languages and systems. The award will go to the PhD student who in the previous period has made the most original and influential contribution to the area. The purpose of the award is to draw attention to excellent work, to help the career of the student in question, and to promote the research field as a whole. Eligibility ----------- Eligible for the award are those who successfully defended their PhD * at an academic institution in Europe * in the field of Programming Languages and Systems * in the period from 1 November 2012 ?- 1 November 2013 Nominations ----------- Candidates for the award must be nominated by their supervisor. Nominating a candidate consists of submitting the thesis to https://www.easychair.org/conferences/?conf?plsphd2013. The nomination must be accompanied by (a zip file containing) * a letter from the supervisor describing why the thesis should be considered for the award; * a report from an independent researcher who has acted as examiner of the thesis at its defense. The theses will be evaluated with respect to originality, influence, relevance to the field and (to a lesser degree) quality of writing. Procedure --------- The nominations will be evaluated and compared by an international committee of experts from across Europe. The procedure to be followed is analogous to the review phase of a conference. The justification by the supervisor and the external report will play an important role in the evaluation. Members of the expert committee are barred from nominating their own PhD students for the award. The award consists of a certificate announcing the winner to have received the EAPLS PhD award 2013. The supervisor will receive a copy of this certificate. If possible, the certificate will be handed out ceremonially at a suitable occasion, as for instance the ETAPS conference. Apart from the winner, no further ranking of nominees will be published. The decision of the expert committee is final and binding, and will not be subject to discussion. Important dates --------------- 31 December 2013: Deadline for nominations 10 April 2014: Announcement of the award winner Expert committee ---------------- The Expert committee includes: * Gilles Barthe, IMDEA Software Institute, Spain * Eerke Boiten, University of Kent, U.K. * Mark van den Brand, Universiteit Eindhoven, The Netherlands * Paolo Ciancarini, Universita di Bologna, Italy * Stefano Crespi Reghizzi, Politecnico di Milano, Italy * Kei Davis, Los Alamos National Laboratory, U.S.A. * Mariangiola Dezani, Universita di Torino, Italy * Josuka D?az-Labrador, Universidad de Duesto, Spain * Marko van Eekelen, Radboud Universiteit Nijmegen, The Netherlands * Giorgio Ghelli, University of Pisa, Italy * Stefan Gruner, University of Pretoria, South Africa * Kevin Hammond, University of St Andrews, U.K. * Martin Hofmann, Ludwig-Maximilians-Universit?t M?nchen, Germany * Paul Klint, CWI and University of Amsterdam, The Netherlands * Jens Knoop, Technische Universit?t Wien, Austria * Ralf L?mmel, University of Koblenz-Landau, Germany * Rita Loogen, Philipps-Universit?t Marburg, Germany * Tiziana Margaria, University of Potsdam, Germany * Greg Michaelson, Heriot-Watt University , Edinburgh, U.K. * Alan Mycroft, University of Cambridge, U.K. * Catuscia Palamidessi, LIX, France * Ricardo Pe?a, Universidad Complutense de Madrid, Spain * Arnd Poetzsch-Heffter, Technische Universit?t Kaiserslautern, Germany * Arend Rensink, Universiteit Twente, The Netherlands * Bernhard Steffen, Technische Universit?t Dortmund, Germany * Peter Van Roy, Universit? Catholique de Louvain, Belgium Best Wishes, Kevin -------- Kevin Hammond, Professor of Computer Science, University of St Andrews T: +44-1334 463241 F: +44-1334-463278 W: http://www.cs.st-andrews.ac.uk/~kh In accordance with University policy on electronic mail, this email reflects the opinions of the individual concerned, may contain confidential or copyright information that should not be copied or distributed without permission, may be of a private or personal nature unless explicitly indicated otherwise, and should not under any circumstances be taken as an official statement of University policy or procedure (see http://www.st-and.ac.uk). The University of St Andrews is a charity registered in Scotland : No SC013532 From Garrett.Morris at ed.ac.uk Wed Nov 20 12:12:14 2013 From: Garrett.Morris at ed.ac.uk (J. Garrett Morris) Date: Wed, 20 Nov 2013 12:12:14 +0000 Subject: [Haskell] Fwd: PhD studentship on ABCD In-Reply-To: References: Message-ID: Apologies for multiple copies. ---------- Forwarded message ---------- From: Philip Wadler Date: Wed, Nov 20, 2013 at 12:02 PM Subject: PhD studentship on ABCD To: "types-announce at lists.seas.upenn.edu" , lfcs-interest at inf.ed.ac.uk, spls at mailhost.dcs.gla.ac.uk We are recruiting for one PhD student to work on design and implementation of programming languages. The post is on the project "From Data Types to Session Types: A Basis for Concurrency and Distribution". The project has particular emphasis on putting theory into practice, embedding session types in a range of programming languages and applying them to realistic case studies. The research programme is joint between the University of Edinburgh, University of Glasgow, and Imperial College London, and includes collaboration with Amazon, Cognizant, Red Hat, VMware, and the Ocean Observatories Initiative. We have a programme grant funded by EPSRC for five years from 20 May 2013. The successful candidate will join a team responsible for extending the functional web programming language Links with session types to support concurrency and distribution. We will test our techniques by providing a library to access Amazon Web Services (AWS) cloud computing infrastructure, and perform empirical experiments to assess how our language design impacts the performance of programmers. You should possess an undergraduate degree in a relevant area, or being nearing completion of same, or have comparable experience. You should have evidence of ability to undertake research and communicate well. You should have a background in programming languages, including type systems, and programming and software engineering skills. It is desirable for candidates to also have one or more of the following: a combination of theoretical and practical skills; experience of web programming or cloud programming; knowledge of the theory or practice of concurrent and distributed systems; knowledge of linear logic; or training in empirical measurement of programming tasks. We especially welcome applications from women and minorities. We seek applicants at an international level of excellence. The School of Informatics at Edinburgh is among the strongest in the world, and Edinburgh is known as a cultural centre providing a high quality of life. The successful candidate will receive a studentship covering tuition and subsistence. Students from the UK or EU are preferred, but studentships may be available for overseas students with strong qualifications. Applications should be received by 13 December to be eligible for the full range of scholarships. Consult the University of Edinburgh website for details of how to apply. Enquiries can be addressed to: Prof. Philip Wadler (wadler at inf.ed.ac.uk), Principal Investigator of the ABCD project. -- .\ Philip Wadler, Professor of Theoretical Computer Science ./\ School of Informatics, University of Edinburgh / \ http://homepages.inf.ed.ac.uk/wadler/ The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. From Jeremy.Gibbons at cs.ox.ac.uk Wed Nov 20 15:09:04 2013 From: Jeremy.Gibbons at cs.ox.ac.uk (Jeremy.Gibbons at cs.ox.ac.uk) Date: Wed, 20 Nov 2013 15:09:04 +0000 Subject: [Haskell] ACM SIGPLAN Workshop on Data-Centric Programming (at POPL) - talk proposal deadline extended to 22nd Nov Message-ID: <201311201509.rAKF94ml030113@linux2.cs.ox.ac.uk> ACM SIGPLAN Workshop on Data-Centric Programming 2014 ----------------------------------------------------- DEADLINE EXTENDED TO FRIDAY NOVEMBER 22 - CONTRIBUTIONS ARE 2 PAGES Please consider submitting to this great workshop Colocated with POPL, January 25, 2014 | San Diego, USA http://research.microsoft.com/DCP2014 Submission: November 22, 2013 Notification: December 4, 2013 We're very pleased to announce DCP 2014, an exciting workshop which builds on the success of the Data-Driven Functional Programming (DDFP) workshop at POPL 2013. This workshop is for anyone who loves the application of functional programming (and indeed other programming paradigms as well) to data-rich domains. Please consider submitting to the workshop - whatever your flavor of data, whatever your flavor of data-centric programming. We want this to be a great event that opens up opportunities at the intersection of data and programming. Functional programming techniques are increasingly important in data-centric programming: languages like Haskell, Scala, and C# draw heavily on a range of functional techniques and find application in numerous data-driven domains; paradigms like map/reduce and its extensions lie at the core of modern scalable data processing; and "information-rich" languages like Ur, F#, and Gosu use meta-programming to integrate type-safe queries, web-based APIs, and scalable data sources - along with associated semantically-rich metadata - into the programming language. In principle, the expressiveness, strong typing, and core functional paradigm of these languages make them an ideal choice for expressing robust and scalable data-centric programming. On the other end, the web of data is growing at an enormous pace, with few dedicated software applications capable of dealing efficiently in information-rich spaces. Reasons for that include one (or more) of the following research issues: lack of integrated development environments (IDEs, such as Visual Studio and Eclipse), poor programming language support, lack of standard testbeds and/or benchmarks, inadequate training, and perhaps the need for curriculum revision. Properly addressing these issues requires interdisciplinary skills, and the collaboration between academia and industry. Many challenges remain. Workshop Goals -------------- This workshop invites submissions that explore the gap between today's data management challenges, particularly the ones related to dealing with large amounts of semantically rich data, and the lack of adequate tools. We are looking for contributions that discuss, promote and further advance the programming of semantically-rich data including the development of new languages, extension of existing ones, and the inclusion of semantic-enabled capabilities into existing IDEs. In this forum, we will discuss, promote, and advance the use of data-centric programming in information-rich data spaces - including the development of new programming and data-manipulation systems as well as the extension of existing ones. By devising methods for handling data from the programming level, we can promote the research and development of better data-centric programming technologies as a whole, as well as facilitate the shift towards both principled and effective data-centric computing. Talk Proposals -------------- We want DCP to be as informal and interactive as possible. The program will thus involve a combination of invited talks, contributed talks about work in progress, and open-ended discussion sessions. There will be no published proceedings, but participants will be invited to submit working documents, talk slides, etc. to be posted on the workshop website. We invite proposals for talks in any area related to the connection between programming and data, including, but not limited to: * Formal systems that capture the essential theoretical elements of data-centric programming * Experimental systems that demonstrate novel data-centric programming techniques * Technology that demonstrates correctness, scalability, productivity, robustness, or maintainability of data-centric programs * Schema evolution, schema-type mapping, query languages, probabilistic programming, network-connected programming, or semi-structured data * Programming-related aspects of knowledge representation techniques including database theory, ontology techniques, and linked data * Impact of specific application areas (e.g. e-science, e-gov, sensors) on information-rich application design * Data exploration and visualization * Evaluation of data quality * Plugins and IDEs for information-rich application development * Cleaning and provenance of data, services, and processes Talks about work in progress are particularly encouraged. If you have any questions about the relevance of a particular topic, please contact the PC chairs at the address dcp.2014 at lambda-calcul.us . We solicit proposals for contributed talks. Proposals should be at most 2 pages, in either plain text or PDF format. We plan to allocate 30-minute talk slots; but proposals for shorter or longer talks will also be considered. Speakers may also submit supplementary material (e.g. a full paper, talk slides) if they desire, which PC members are free (but not expected) to read. Organization ------------ Program Chairs Jeremy Gibbons, University of Oxford, United Kingdom Evelyne Viegas, Microsoft Research, United States Program Committee Soren Auer, University of Bonn, Germany Nate Foster, Cornell University, United States Juliana Freire, Polytechnic Institute of New York University, United States Erik Meijer, Applied Duality, United States Steffen Staab, University of Koblenz, Germany Don Syme, Microsoft Research Cambridge, United Kingdom Hadley Wickham, Rice University, United States From c.grelck at uva.nl Wed Nov 20 16:31:18 2013 From: c.grelck at uva.nl (Clemens Grelck) Date: Wed, 20 Nov 2013 17:31:18 +0100 Subject: [Haskell] Call for participation: Dutch Functional Programming Day 2014 Message-ID: <528CE3D6.60605@uva.nl> Dear all, The next Netherlands Functional Programming day (NL-FP 2014) will take place on Friday, January 10, 2014 at the University of Amsterdam at Amsterdam Science Park. You are all cordially invited to participate and, of course, to give a presentation. The day will largely follow the pattern of the previous NL-FP days with a moderately timed start, a day of enjoyable talks in between lunch and coffee breaks and ending with a joint dinner in a nearby restaurant. All further details can be found on the NL-FP 2014 site(s): http://staff.science.uva.nl/~grelck/nl-fp-day-2014.html http://staff.science.uva.nl/~grelck/nl-fp-dag-2014.html Hope to see you all in Amsterdam in January! Best regards, Clemens Grelck -- ---------------------------------------------------------------------- Dr Clemens Grelck Science Park 904 University Lecturer 1098XH Amsterdam Netherlands University of Amsterdam Institute for Informatics T +31 (0) 20 525 8683 Computer Systems Architecture Group F +31 (0) 20 525 7490 Office C3.105 www.science.uva.nl/~grelck ---------------------------------------------------------------------- From nad at cse.gu.se Wed Nov 20 16:45:42 2013 From: nad at cse.gu.se (Nils Anders Danielsson) Date: Wed, 20 Nov 2013 17:45:42 +0100 Subject: [Haskell] Call for participation: PLPV 2014 Message-ID: <528CE736.9080706@cse.gu.se> You are cordially invited to participate in the Eighth ACM SIGPLAN Workshop on Programming Languages meets Program Verification Date: 21 January 2014 Location: San Diego, in conjunction with POPL 2014 Program: http://www.cse.chalmers.se/~nad/plpv-2014/ Invited talks: - Ranjit Jhala on liquid types for Haskell. - Lee Pike on Programming Languages for High-Assurance Autonomous Vehicles. Contributed talks: - Verified Programs with Binders. Martin Clochard, Claude March? and Andrei Paskevich. - Formalizing a Correctness Property of a Type-Directed Partial Evaluator. Noriko Hirota and Kenichi Asai. - An Abstract Categorical Semantics for Functional Reactive Programming with Processes. Wolfgang Jeltsch. - Substructural Typestates. Filipe Militao, Jonathan Aldrich and Luis Caires. - The Recursive Polarized Dual Calculus. Aaron Stump. Registration: https://regmaster3.com/2014conf/POPL14/register.php Early registration closes 31 December 2012. Best regards, Nils Anders Danielsson and Bart Jacobs From tews at os.inf.tu-dresden.de Thu Nov 21 10:44:32 2013 From: tews at os.inf.tu-dresden.de (Hendrik Tews) Date: Thu, 21 Nov 2013 11:44:32 +0100 Subject: [Haskell] Job announcement: formal methods engineer Message-ID: <21133.58384.537101.350194@blau.inf.tu-dresden.de> Dear all, [My excuses if see this email more than once] FireEye Inc. seeks outstanding formal-methods experts to join FireEye's software verification team in Dresden, Germany. Applicants should have strong knowledge in logical reasoning, software modeling and formal software verification. FireEye is a next generation security company that provides the industry's leading cross-enterprise threat protection technology to dynamically identify and block cyber-attacks in real time. FireEye was ranked fourth fastest growing company in North America and won the Wall Street Journal Innovation Award in 2012. By joining FireEye you may contribute to protect the world from the next generation of cyber-attacks! If you are interested or have questions, please contact Hendrik Tews via Dresden at FireEye.com or Roland Carter or visit FireEye's careers page at http://FireEye.com/careers . Look up http://FireEye.com for more information about FireEye. Bye, Hendrik Tews From dagitj at gmail.com Thu Nov 21 21:20:39 2013 From: dagitj at gmail.com (Jason Dagit) Date: Thu, 21 Nov 2013 13:20:39 -0800 Subject: [Haskell] ANN: New Haskell.org committee members Message-ID: The Haskell.org committee has selected new members following the October self-nomination period. The new members are: * Adam Foltzer * Nicolas Wu * Andres Loeh Thank you to everyone who submitted a self-nomation. We had many very strong candidates and it was not easy for us to narrow the selection down to just three people. I would like to add, that if you've self-nominated in the past but not be picked, please self-nominate again in the future. Cheers, Jason -------------- next part -------------- An HTML attachment was scrubbed... URL: From alan.schmitt at inria.fr Fri Nov 22 10:44:21 2013 From: alan.schmitt at inria.fr (Alan Schmitt) Date: Fri, 22 Nov 2013 11:44:21 +0100 Subject: [Haskell] Call for Participation: Programming Languages Mentoring Workshop - a POPL workshop. Message-ID: CALL FOR PARTICIPATION SIGPLAN Programming Languages Mentoring Workshop, San Diego, USA Tuesday January 21, 2014 Co-located with POPL 2014 PLMW web page: http://plmw2014.inria.fr/ After the resounding success of the first two Programming Languages Mentoring Workshops at POPL 2012 and POPL 2013, we proudly announce the 3rd SIGPLAN Programming Languages Mentoring Workshop (PLMW), co-located with POPL 2014 and organised by Amal Ahmed, Benjamin C. Pierce, and Alan Schmitt. The purpose of this mentoring workshop is to encourage graduate students and senior undergraduate students to pursue careers in programming language research. This workshop will provide technical sessions on cutting-edge research in programming languages, and mentoring sessions on how to prepare for a research career. We will bring together leaders in programming language research from academia and industry to give talks on their research areas. The workshop will engage students in a process of imagining how they might contribute to our research community. We especially encourage women and underrepresented minority students to attend PLMW. This workshop is part of the activities surrounding POPL, the Symposium on Principles of Programming Languages, and takes place the day before the main conference. One goal of the workshop is to make the POPL conference more accessible to newcomers. We hope that participants will stay through the entire conference. A number of sponsors have generously donated scholarship funds for qualified students to attend PLMW. These scholarships should cover reasonable expenses (airfare, hotel, and registration fees) for attendance at both the workshop and the POPL conference. Students attending this year will get one year free student membership of SIGPLAN, unless they prefer to opt out during their application. The workshop registration is open to all. Students with alternative sources of funding are welcome. APPLICATION for PLMW scholarship: The scholarship application can be accessed from the workshop web site (http://plmw2014.inria.fr/). The deadline for full consideration of funding is 10th December, 2013. Selected participants will be notified from Friday 14th December, and will need to register for the workshop by December 24th. SPONSORS: Facebook Google Jane Street Microsoft Research NSF SIGPLAN From thomas.anberree at nottingham.edu.cn Sat Nov 23 04:07:49 2013 From: thomas.anberree at nottingham.edu.cn (Thomas ANBERREE) Date: Sat, 23 Nov 2013 12:07:49 +0800 Subject: [Haskell] Temporary Teaching Assistant Position to teach Functional Programming in China Message-ID: Hello, We are looking for someone to teach the module G51FUN ?Functional Programming? from February to June 2014 at the Chinese campus of the University of Nottingham. The position is opened to candidates currently studying a PhD in Functional Programming. The position is not yet officially opened but, because it might take time for some candidates to obtain a Chinese working visa, we need to act quickly. The contract should include (to be confirmed): * A stipend of about 5500 GBP for 4-5 months presence in China * Flights * Accommodation Would candidates please quickly contact me by email : Thomas.Anberree at nottingham.edu.cn. Please attach a short CV including experience in teaching using English and in functional programming. USEFUL LINKS: * Book, slides, etc. by Graham Hutton to teach G51FUN: http://www.cs.nott.ac.uk/~gmh/book.html * Module catalogue entry: http://modulecatalogue.nottingham.ac.uk/Nottingham/asp/ModuleDetails.asp?crs_id=007252&year_id=000113 * The UNNC academic calendar can be found there: http://www.nottingham.edu.cn/en/academicservices/documents/academic-calendar-2013-14.pdf * CS at UNNC: http://www.nottingham.edu.cn/en/engineering/departments/computer-science/index.aspx Best regards Thomas This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of The University of Nottingham Ningbo China. This message has been checked for viruses but the contents of an attachment may still contain software viruses which could damage your computer system: you are advised to perform your own checks. Email communications with The University of Nottingham Ningbo China may be monitored as permitted by UK and Chinese legislation. -------------- next part -------------- An HTML attachment was scrubbed... URL: From jv at informatik.uni-bonn.de Sun Nov 24 08:24:42 2013 From: jv at informatik.uni-bonn.de (Janis Voigtlaender) Date: Sun, 24 Nov 2013 09:24:42 +0100 Subject: [Haskell] Second call for papers, BX 2014 Message-ID: <5291B7CA.8080600@informatik.uni-bonn.de> Third International Workshop on Bidirectional Transformations (BX 2014) Friday March 28th, 2014 Athens, Greece co-located with EDBT/ICDT 2014 Web site: http://bx-community.wikidot.com/bx2014:home Submission site: https://www.easychair.org/account/signin.cgi?conf=bx2014 Paper length: 3-8 pages, ACM format. In-progress work is highly encouraged, if limited to 4 pages. Bidirectional transformations (bx) are a mechanism for maintaining the consistency of at least two related sources of information. Such sources can be relational data, software models, documents, graphs, trees, and so on. BX are an emerging topic in a wide range of research areas with prominent presence at top conferences in different fields. However, much of the research in bx tends to get limited exposure outside of a single field of study. The purpose of this workshop series is not only to further research into bx, but to promote cross-disciplinary research and awareness in the area. The first two instances of this workshop, BX'12 and BX'13, served as a dedicated venue for bx in all relevant areas, including: - Databases - Programming Languages - Software Engineering - Graph Transformation This instance of the workshop is the first at a database venue. The workshop rotates between venues in different areas to promote the cross-disciplinary nature of the work, as methodologies used for bx range from classical program transformation and updateable views to graph transformation techniques, from ad-hoc techniques for data synchronization to the development of domain-specific languages and their integration. We also solicit papers on model/metamodel co-evolution, which is a different yet closely related subject. Aims and Topics The aim of the workshop is to bring together researchers and practitioners, established and new, interested in bidirectional transformations from different perspectives, such as: * inversion of data exchange mappings * new perspectives on view updatability * data-schema co-evolution and data synchronization * software-model synchronization * consistency analysis * (coupled) software/model transformations * language-based approaches Submissions can be: * novel research concepts and results * position papers and research perspectives * application of bx in new domains * analysis of gaps between formal concepts and application scenarios * examination of the efficiency of algorithms * analysis/classification of requirements for bx technologies * proposals and justification for benchmarks * summary papers providing novel comparisons between existing technologies * case studies and tool support Submitted papers must be in ACM format in accordance with the other workshops and proceedings at EDBT/ICDT. Papers may be 3-8 pages in length; the length of the paper should be appropriate for the level of completeness of the work. Important Dates: Paper submission date: 7th December 2013 Author notification: 7th January 2014 Camera-ready date: 20th January 2014 Workshop date: 28th March 2014 Accepted papers will be published in the workshop proceedings of EDBT/ICDT and will be available at the conference. From jv at informatik.uni-bonn.de Sun Nov 24 08:33:28 2013 From: jv at informatik.uni-bonn.de (Janis Voigtlaender) Date: Sun, 24 Nov 2013 09:33:28 +0100 Subject: [Haskell] FLOPS 2014: 2nd Call for Papers Message-ID: <5291B9D8.70006@informatik.uni-bonn.de> NEWS: - Journal publications in JFP (Journal of Functional Programming) and TPLP (Theory and Practice of Logic Programming) are planned (see below). - Hyakumangoku Matsuri ( https://www.google.com/search?q=hyakumangoku%20matsuri&tbm=isch ) is scheduled *just* after FLOPS 2014. Call For Papers =============== Twelfth International Symposium on Functional and Logic Programming (FLOPS 2014) June 4-6, 2014 Kanazawa, Japan http://www.jaist.ac.jp/flops2014/ FLOPS is a forum for research on all issues concerning declarative programming, including functional programming and logic programming, and aims to promote cross-fertilization and integration between the two paradigms. Previous FLOPS meetings were held at Fuji Susono (1995), Shonan Village (1996), Kyoto (1998), Tsukuba (1999), Tokyo (2001), Aizu (2002), Nara (2004), Fuji Susono (2006), Ise (2008), Sendai (2010), and Kobe (2012). Topics ====== FLOPS solicits original papers in all areas of functional and logic programming, including (but not limited to): - Language issues: language design and constructs, programming methodology, integration of paradigms, interfacing with other languages, type systems, constraints, concurrency and distributed computing. - Foundations: logic and semantics, rewrite systems and narrowing, type theory, proof systems. - Implementation issues: compilation techniques, memory management, program analysis and transformation, partial evaluation, parallelism. - Applications: case studies, real-world applications, graphical user interfaces, Internet applications, XML, databases, formal methods and model checking. The proceedings will be published as an LNCS volume. The proceedings of the previous meetings (FLOPS 1999, 2001, 2002, 2004, 2006, 2008, 2010, and 2012) were published as LNCS 1722, 2024, 2441, 2998, 3945, 4989, 6009, and 7294. PC Co-Chairs ============ Michael Codish (Ben-Gurion University of the Negev) Eijiro Sumii (Tohoku University) PC Members ========== Lars Birkedal (Aarhus University) Michael Codish (Ben-Gurion University of the Negev) [co-chair] Marina De Vos (University of Bath) Moreno Falaschi (Universita degli studi di Udine) Carsten Fuhs (University College London) John Gallagher (Roskilde Universitet / IMDEA Software Institute) Samir Genaim (Universidad Complutense de Madrid) Laura Giordano (Universita del Piemonte Orientale) Ichiro Hasuo (University of Tokyo) Fritz Henglein (University of Copenhagen) Andy King (University of Kent) Oleg Kiselyov Vitaly Lagoon (MathWorks) Shin-Cheng Mu (Academia Sinica) Keiko Nakata (Institute of Cybernetics at Tallinn University of Technology) Luke Ong (University of Oxford) Peter Schachte (University of Melbourne) Takehide Soh (Kobe University) Eijiro Sumii (Tohoku University) [co-chair] Tachio Terauchi (Nagoya University) Joost Vennekens (KU Leuven) Janis Voigtlaender (Universitaet Bonn) Stephanie Weirich (University of Pennsylvania) Local Chair =========== Yuki Chiba (JAIST) Submission ========== Submissions must be unpublished and not submitted for publication elsewhere. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. See also ACM SIGPLAN Republication Policy: http://www.sigplan.org/Resources/Policies/Republication Submissions should fall into one of the following categories: - Regular research papers: they should describe new results and will be judged on originality, correctness, and significance. - System descriptions: they should contain a link to a working system and will be judged on originality, usefulness, and design. - Declarative pearls: new and excellent declarative programs or theories with illustrative applications. System descriptions and declarative pearls must be explicitly marked as such in the title. Submissions must be written in English and can be up to 15 pages long including references, though pearls are typically shorter. Authors are required to use LaTeX2e and the Springer llncs class file, available at: http://www.springer.de/comp/lncs/authors.html Regular research papers should be supported by proofs and/or experimental results. In case of lack of space, this supporting information should be made accessible otherwise (e.g., a link to a Web page, or an appendix). Papers should be submitted electronically at: https://www.easychair.org/conferences/?conf=flops2014 Important Dates =============== Submission deadline: December 13, 2013 Author notification: February 10, 2014 Camera-ready copy: March 7, 2014 Journal Publication =================== - Journal of Functional Programming and - Theory and Practice of Logic Programming 2-4 of the best papers in each of the two areas: Functional Programming and Logic Programming, will be invited for inclusion in a designated FLOPS section within each of the two journals. The Theory and Practice of Logic Programming papers will appear as "Rapid Publications". All of the these submissions are expected to represent high-quality revisions and extensions of the selected FLOPS papers and will be reviewed under the standard criteria of each journal. Venue ===== Main Hall, Ishikawa Prefectural Museum of Art, 2-1 Dewa-machi, Kanazawa, Ishikawa 920-0963 JAPAN. Some Previous FLOPS =================== FLOPS 2012, Kobe: http://www.org.kobe-u.ac.jp/flops2012/ FLOPS 2010, Sendai: http://www.kb.ecei.tohoku.ac.jp/flops2010/ FLOPS 2008, Ise: http://www.math.nagoya-u.ac.jp/~garrigue/FLOPS2008/ Sponsor ======= Japan Society for Software Science and Technology (JSSST), Special Interest Group on Programming and Programming Languages (SIG-PPL) In Cooperation With =================== ACM SIGPLAN Asian Association for Foundation of Software (AAFS) Association for Logic Programming (ALP) From Graham.Hutton at nottingham.ac.uk Fri Nov 29 09:23:14 2013 From: Graham.Hutton at nottingham.ac.uk (Graham Hutton) Date: Fri, 29 Nov 2013 09:23:14 +0000 Subject: [Haskell] 10 PhD studentships in Nottingham Message-ID: Dear all, The School of Computer Science in Nottingham is advertising 10 fully-funded PhD studentships. Applicants in the area of the Functional Programming lab (fp.cs.nott.ac.uk) are encouraged! If you are interested in applying, please contact a potential academic supervisor in the FP lab prior to submitting your application. Best wishes, Graham +-----------------------------------------------------------+ 10 Fully-Funded PhD Studentships School of Computer Science University of Nottingham, UK Applications are invited for up to ten fully-funded PhD studentships in the School of Computer Science at the University of Nottingham, starting on 1st October 2014. The topics for the studentships are open, but should relate to the interests of one of the School?s research groups: Agents Lab; Automated Scheduling, Optimisation and Planning; Computer Vision Lab; Functional Programming Lab; Intelligent Modelling and Analysis; Mixed Reality Lab; Networked Systems. The studentships are for three years and include a stipend of ?13,726 per year and tuition fees, and are available to students of any nationality. Applicants are normally expected to have a first-class Undergraduate or Masters degree in Computer Science or a related discipline, and should discuss their interest and obtain the support of a potential supervisor in the School before applying. To apply, please submit the following items by email to : (1) a brief covering letter that describes your reasons for wishing to pursue a PhD, any ideas you have regarding possible areas or topics, and the name of a potential supervisor; (2) a copy of your CV, including your actual or expected degree class(es), and results of all University examinations; (3) an example of your technical writing, such as a project report or dissertation; (4) contact details for two academic referees. Closing date for applications: 10th January 2014 +-----------------------------------------------------------+ -- Prof Graham Hutton Functional Programming Lab School of Computer Science University of Nottingham, UK http://www.cs.nott.ac.uk/~gmh This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. This message has been checked for viruses but the contents of an attachment may still contain software viruses which could damage your computer system, you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation.