April 2014 - Haskell - Haskell.org

ANNOUNCE: ioctl 0.0.1
by Maciej Piechotka 13 Sep '15

13 Sep '15

A package for type-safe I/O control. Currently only ioctl is supported. Currently simply a extract from my tuntap fork TODO: - Return the integer as well as structure (will break the API) - Port for Windows Network.Socket.IOCtl (as soon as I manage to setup some sane environment on this platform) - Wrapping around DeviceIoControl Example (in hsc): data NotRead = NotRead instance NotRead Int where ioctlReq _ = #const FIONREAD notRead s = ioctlsocket' s NotRead Regards

2 1

Call for talk proposals: HOPE'14 (Workshop on Higher-Order Programming with Effects, affiliated with ICFP'14)
by Neelakantan Krishnaswami 30 Apr '14

30 Apr '14

---------------------------------------------------------------------- CALL FOR TALK PROPOSALS HOPE 2014 The 3rd ACM SIGPLAN Workshop on Higher-Order Programming with Effects August 31, 2014 Gothenburg, Sweden (the day before ICFP 2014) https://www.mpi-sws.org/~neelk/hope2014/ ---------------------------------------------------------------------- HOPE 2014 aims at bringing together researchers interested in the design, semantics, implementation, and verification of higher-order effectful programs. It will be *informal*, consisting of invited talks, contributed talks on work in progress, and open-ended discussion sessions. --------------------- Goals of the Workshop --------------------- A recurring theme in many papers at ICFP, and in the research of many ICFP attendees, is the interaction of higher-order programming with various kinds of effects: storage effects, I/O, control effects, concurrency, etc. While effects are of critical importance in many applications, they also make it hard to build, maintain, and reason about one's code. Higher-order languages (both functional and object-oriented) provide a variety of abstraction mechanisms to help "tame" or "encapsulate" effects (e.g. monads, ADTs, ownership types, typestate, first-class events, transactions, Hoare Type Theory, session types, substructural and region-based type systems), and a number of different semantic models and verification technologies have been developed in order to codify and exploit the benefits of this encapsulation (e.g. bisimulations, step-indexed Kripke logical relations, higher-order separation logic, game semantics, various modal logics). But there remain many open problems, and the field is highly active. The goal of the HOPE workshop is to bring researchers from a variety of different backgrounds and perspectives together to exchange new and exciting ideas concerning the design, semantics, implementation, and verification of higher-order effectful programs. We want HOPE 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 this website. ----------------------- Call for Talk Proposals ----------------------- We solicit proposals for contributed talks. Proposals should be at most 2 pages, in either plain text or PDF format, and should specify how long a talk the speaker wishes to give. By default, contributed talks will be 30 minutes long, 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. We are interested in talks on all topics related to the interaction of higher-order programming and computational effects. 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 hope2014 AT mpi-sws.org. Deadline for talk proposals: June 13, 2014 (Friday) Notification of acceptance: July 4, 2014 (Friday) Workshop: August 31, 2014 (Sunday) The submission website is now open: https://www.easychair.org/conferences/?conf=hope2014 --------------------- Workshop Organization --------------------- Program Co-Chairs: Neel Krishnaswami (University of Birmingham) Hongseok Yang (University of Oxford) Program Committee: Zena Ariola (University of Oregon) Ohad Kammar (University of Cambridge) Ioannis Kassios (ETH Zurich) Naoki Kobayashi (University of Tokyo) Paul Blain Levy (University of Birmingham) Aleks Nanevski (IMDEA) Scott Owens (University of Kent) Sam Staton (Radboud University Nijmegen) Steve Zdancewic (University of Pennsylvania)

1 0

ANNOUNCE (2nd call): Applied Functional Programming (AFP) Summerschool 7-18 July 2014, Utrecht, Netherlands
by Atze Dijkstra 28 Apr '14

28 Apr '14

Dear all, we bring the following announcement to your attention a 2nd time as the registration deadline (may 5) approaches. thank you, regards, Atze Dijkstra =========== AFP Summerschool 2014 =========== Applied Functional Programming (AFP) Summerschool July 7-18, 2014 Utrecht University, Department of Information and Computing Sciences Utrecht, The Netherlands Summerschool & registration website: http://www.utrechtsummerschool.nl/courses/science/applied-functional-progra… AFP website with edition 2013 info : http://www.cs.uu.nl/wiki/USCS contact : Uscs-afp(a)lists.science.uu.nl *** The 2014 edition of the Applied Functional Programming (AFP) Summerschool in Utrecht, Netherlands will be held from 7-18 July 2014. The summerschool teaches Haskell on both beginners and advanced levels via lectures and lab exercises. More info can be found via the references above, included here is an excerpt from the summerschool website: ``Typed functional programming in Haskell allows for the development of compact programs in minimal time and with maximal guarantees about robustness and correctness. The course introduces Haskell as well as its theoretical underpinnings such as typed lambda calculus, and Damas-Milner type inference. There is ample opportunity to put this all in practice during lab sessions. Typed functional programming languages allow for the development of robust, concise programs in a short amount of time. The key advantages are higher-order functions as an abstraction mechanism, and an advanced type system for safety and reusability. This course introduces Haskell, a state-of-the-art functional programming language, together with some of its theoretical background, such as typed lambda calculi, referential transparency, Damas-Milner type inference, type level programming, and functional design patterns. We will combine this with applications of functional programming, concentrating on topics such as language processing, building graphical user interfaces, networking, databases, and programming for the web. The goal of the course is not just to teach the programming language and underlying theory, but also to learn about the Haskell community and to get hands-on experience by doing lab exercises or a Haskell project of your own.'' *** regards, - Atze - Atze Dijkstra, Department of Information and Computing Sciences. /|\ Utrecht University, PO Box 80089, 3508 TB Utrecht, Netherlands. / | \ Tel.: +31-30-2534118/1454 | WWW : http://www.cs.uu.nl/~atze . /--| \ Fax : +31-30-2513971 .... | Email: atze(a)uu.nl ............... / |___\

2 1

ANNOUNCE: fgl-5.5.0.0
by Ivan Lazar Miljenovic 27 Apr '14

27 Apr '14

I'm pleased to announce a new version of the functional graph library: http://hackage.haskell.org/package/fgl-5.5.0.0 The main change in this version: proper Show, Read and Eq instances for both graph implementations. Previously, Data.Graph.Inductive.Tree had a pretty-printed Show output; now both it and PatriciaTree have Show and Read instances via the mkGraph function, and Eq via deriving (I'm not sure how well this will work because as I write this I realise it may not deal with multiple edges that well... I guess I'll be doing an updated version tomorrow after getting some sleep ;p). The previous Show behaviour of Tree is now available as a pretty-printing function for all DynGraph instances. The PatriciaTree implementation is now exported and used by default, because as far as I'm aware it will always perform better. Finally, the Data.Graph.Inductive.Graphviz module has been removed; if you want to visualise your fgl graph, please see my graphviz package on Hackage (cheap plug? moi?). -- Ivan Lazar Miljenovic Ivan.Miljenovic(a)gmail.com http://IvanMiljenovic.wordpress.com

1 0

Postdoctoral position in probabilistic programming languages
by nr＠cs.tufts.edu 26 Apr '14

26 Apr '14

There is a postdoc opening in my group for work on probabilistic programming languages. Connections with Haskell are strong, and several members of our team are building prototypes in Haskell. I'd welcome applications from scientists with skills or interests in Haskell. Norman Ramsey Postdoctoral position in probabilistic programming languages ============================================================ There is a postdoc open at Tufts University, supported by the project > Probabilistic Programming for Advanced Machine Learning (PPAML) The PPAML project will empower practitioners and researchers in machine learning by creating vastly improved language technology for probabilistic programming. This postdoc provides an opportunity to think deeply about probabilistic modeling and inference and to realize those thoughts in new language designs and (prototype) implementations. Our team is focused on these aspects: - The design of novel languages, especially intermediate languages, for expressing and analyzing probabilistic computations - The development of type systems and other program analyses that will support *efficient* inference over probabilistic models - Languages and language extensions that can formalize and express *intensional* properties that may enable a probabilistic programming system to affect the performance or accuracy of inference and learning The goal is to develop new designs, type systems, and analyses that will not only inform and contribute to the team's research software, but that will of sufficient scope, power, and quality to be publishable in such venues as POPL, PLDI, OOPSLA, and ICFP. Who we are ---------- The research will be supervised at Tufts by Professor Norman Ramsey. The larger team includes senior faculty Mitch Wand and Olin Shivers from Northeastern University, as well as senior colleagues in both programming languages and machine learning at nearby BAE Systems in Burlington. The research will be carried out on the Tufts campus, located near Davis Square in Somerville, Massachusetts, USA, a short distance from Boston. What we're looking for ---------------------- We're looking for a recent PhD (or someone about to graduate) who is committed to the idea of programming languages as a way to express knowledge and solve problems. In addition, - We're looking for someone with a track record of creating interesting and effective software. - We're looking for someone with strong background in at least *one* domain area relating to the project: probability, probabilistic programming, language design, language implementation, type systems, static analysis, measure theory, domain theory, topology, real analysis, or probabilistic inference. - We believe that ideas and software are best developed in tandem. We're therefore looking for someone who will contribute both to the development of the team's software and to the development and publication of new ideas. When and for how long the position can be held ---------------------------------------------- The initial appointment will be for one year, but given mutual agreement, it is expected to be renewed annually for a total of three years. (Support is available through July 2017.) Other mutually agreed arrangements are possible. Salary is competitive. The starting date is negotiable, but if other things are equal, we may extend an offer to the candidate who is available sooner rather than later. What support and benefits are available --------------------------------------- Tufts University is committed to helping postdoctoral scholars gain the skills necessary to become independent researchers. This commitment includes access to resources for personal and professional development. Tufts postdocs are full-time employees of Tufts University and are eligible for benefits, including health and retirement benefits. How and when to apply --------------------- Interested candidates should apply at https://academicjobsonline.org/ajo/jobs/3983 An application should include - A cover letter explaining your interest in the position - Your curriculum vitae - A paper representative of your published work - The names of three people who can, if asked, write letters of reference There is no deadline for applications; we will look at applications as soon as they come in, and we will keep looking until we fill the position. Whom to ask questions --------------------- If you have questions about the project or whether it is a good fit for your interests, please write to Norman Ramsey <nr(a)cs.tufts.edu>.

1 0

Extended Deadline and Final CFP: WPTE'14, First International Workshop on Rewriting Techniques for Program Transformations and Evaluation
by David Sabel 26 Apr '14

26 Apr '14

!!! EXTENDED DEADLINE !!! FINAL CALL FOR PAPERS First International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE'14) affiliated with RTA/TLCA 2014 (a FLoC 2014 workshop, FLoC is part of the Vienna Summer of Logic 2014) 13th July 2014, Vienna, Austria http://www.ki.informatik.uni-frankfurt.de/WPTE14 Aims and Scope ============== The aim of WPTE is to bring together the researchers working on program transformations, evaluation, and operationally based programming language semantics, using rewriting methods, in order to share the techniques and recent developments and to exchange ideas to encourage further activation of research in this area. Topics of interest and in the scope of WPTE are: * Correctness of program transformations, optimizations and translations. * Program transformations for proving termination, confluence and other properties. * Correctness of evaluation strategies. * Operational semantics of programs, operationally-based program equivalences such as contextual equivalences and bisimulations. * Cost-models for arguing about the optimizing power of transformations and the costs of evaluation. * Program transformations for verification and theorem proving purposes. * Translation, simulation, equivalence of programs with different formalisms, and evaluation strategies. * Program transformations for applying rewriting techniques to programs in specific programming languages. * Program inversions and program synthesis. The programming languages of interest include pure, deterministic, impure, non-deterministic, concurrent, parallel languages, and may employ programming paradigms such as functional, logical, typed, imperative, object-oriented, and higher-order. Invited Speaker =============== Andy Gill (University of Kansas) Paper Submissions and Proceedings ================================= WPTE accepts two different kinds of contributions: * Full-papers: ------------ Full-papers must represent original work and should be submitted using the EasyChair interface. We plan to publish full-papers as formal proceedings in the 'OpenAccess Series in Informatics (OASIcs)' of 'Schloss Dagstuhl Leibniz-Zentrum fuer Informatik'. Full-papers should not exceed 12 pages using the OASIcs LaTeX-templates. * Work in progress: ----------------- There will also be a slot for presenting work in progress. An extended abstract of at most 4 pages is required to be submitted using the EasyChair interface. These contributions will not be included in the OASIcs proceedings but they will be distributed to the workshop partipicants. One author of each accepted paper or abstract is expected to present it at the workshop. Important Dates =============== * Submission deadline: 30 April 2014 (new!) * Notification of acceptance: 23 May 2014 * Deadline for camera-ready proceedings: 28 May 2014 * Workshop: 13 July 2014, Austria, Vienna Weblinks ======== * EasyChair Submission Website https://www.easychair.org/conferences/?conf=wpte14 * Homepage of WPTE'14 http://www.ki.informatik.uni-frankfurt.de/WPTE14 * OASIcs Website (including LaTeX templates): http://www.dagstuhl.de/en/publications/oasics * Vienna Summer of Logic 2014 http://vsl2014.at Program Committee ================= Takahito Aoto (RIEC, Tohoku University) Yuki Chiba (Japan Advanced Institute of Science and Technology) Fer-Jan de Vries (University of Leicester) Santiago Escobar (Universitat Politècnica de València) Maribel Fernández (King's College London) Johan Jeuring (Open Universiteit Nederland and Universiteit Utrecht) Delia Kesner (Université Paris-Diderot) Sergueï Lenglet (Université de Lorraine) Elena Machkasova (University of Minnesota, Morris) Joachim Niehren (INRIA Lille) David Sabel (Goethe-University Frankfurt am Main) Masahiko Sakai (Nagoya University) Manfred Schmidt-Schauß (Goethe-University Frankfurt am Main) - chair Eijiro Sumii (Tohoku University) Janis Voigtländer (University of Bonn) Harald Zankl (University of Innsbruck) Organizers ========== Manfred Schmidt-Schauß (Goethe-University Frankfurt am Main) - chair Masahiko Sakai (Nagoya University) David Sabel (Goethe-University Frankfurt am Main) Yuki Chiba (Japan Advanced Institute of Science and Technology) Sponsors ======== Vereinigung von Freunden und Förderern der Johann Wolfgang Goethe Universität Frankfurt am Main e.V. -- ____________________________________________________________ David Sabel Akademischer Rat Professur für Künstliche Intelligenz und Softwaretechnologie Goethe-Universität Frankfurt am Main http://www.ki.informatik.uni-frankfurt.de/persons/sabel ____________________________________________________________

1 0

Monad.Reader #24 call for copy
by Edward Z. Yang 24 Apr '14

24 Apr '14

Call for Copy: The Monad.Reader - Issue 24 -------------------------------------------- Whether you're an established academic or have only just started learning Haskell, if you have something to say, please consider writing an article for The Monad.Reader! The submission deadline for Issue 24 will be: **Saturday, July 5, 2014** The Monad.Reader ~~~~~~~~~~~~~~~~ The Monad.Reader is a electronic magazine about all things Haskell. It is less formal than journal, but somehow more enduring than a wiki- page. There have been a wide variety of articles: exciting code fragments, intriguing puzzles, book reviews, tutorials, and even half-baked research ideas. Submission Details ~~~~~~~~~~~~~~~~~~ NEW this issue: for my reviewing sanity, I am setting a soft page limit of fifteen pages. If you would like to write something longer, get in touch, but remember: brevity is the soul of wit. In any case, contact me if you intend to submit something -- the sooner you let me know what you're up to, the better. Please submit articles for the next issue to me by e-mail. Articles should be written according to the guidelines available from http://themonadreader.wordpress.com/contributing/ Please submit your article in PDF, together with any source files you used. The sources will be released together with the magazine under a BSD license. If you would like to submit an article, but have trouble with LaTeX please let me know and we'll work something out.

1 0

[Haskell-cafe] ANN: Monad.Reader Issue 23
by Edward Z. Yang 24 Apr '14

24 Apr '14

I am pleased to announce that Issue 23 of the Monad Reader is now available. http://themonadreader.files.wordpress.com/2014/04/issue23.pdf http://themonadreader.wordpress.com/2014/04/23/issue-23/ Issue 23 consists of the following five articles: * FizzBuzz in Haskell by Embedding a Domain-Specific Language by Maciej Pírog http://themonadreader.files.wordpress.com/2014/04/fizzbuzz.pdf * Supercompilation: Ideas and Methods (+appendix) by Ilya Klyuchnikov and Dimitur Krustev http://themonadreader.files.wordpress.com/2014/04/super-final.pdf * A Haskell sound specification DSL: Ludic support and deep immersion in Nordic technology-supported LARP by Henrik Bäärnhielm, Daniel Sundström and Mikael Vejdemo-Johansson http://themonadreader.files.wordpress.com/2014/04/celestria_main.pdf * MFlow, a continuation-based web framework without continuations by Alberto Gomez Corona http://themonadreader.files.wordpress.com/2014/04/mflow.pdf * Practical Type System Benefits by Neil Brown http://themonadreader.files.wordpress.com/2014/04/nccb.pdf This time around, I have individual article files for each (and the supercompilation article has an extra appendix not included in the full issue PDF). Feel free to browse the source files. You can check out the entire repository using Git: git clone https://github.com/ezyang/tmr-issue23.git If you’d like to write something for Issue 24, please get in touch! Cheers, Edward

1 0

Haskell Weekly News: Issue 292
by Daniel Santa Cruz 24 Apr '14

24 Apr '14

Welcome to issue 292 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from April 13 to 19, 2014 Edward Kemett wrote in to remind us of the Call For Proposals for CUFP 2014, which is going to be held in Gothenburg, Sweden between September 4-6. See more details here [1] http://goo.gl/X62cBO Quotes of the Week * pdxleif: see s.p. jones & h.p. lovecraft's paper on the subject: "generic programming with lenses, barbed wire, and the fibres of sanity" Top Reddit Stories * A time traveling debugger for Elm - pause, rewind, replay, and change history Domain: debug.elm-lang.org, Score: 87, Comments: 6 On Reddit: [2] http://goo.gl/GJahIU Original: [3] http://goo.gl/V2kcCP * OC: Haskell programming font with ligatures Domain: github.com, Score: 78, Comments: 59 On Reddit: [4] http://goo.gl/ZaFRJ4 Original: [5] http://goo.gl/m17EUj * Porting GHC: A Tale of Two Architectures Domain: chiark.greenend.org.uk, Score: 77, Comments: 12 On Reddit: [6] http://goo.gl/MJ196R Original: [7] http://goo.gl/PVVHZo * Try Idris Domain: tryidris.org, Score: 70, Comments: 22 On Reddit: [8] http://goo.gl/7hn84J Original: [9] http://goo.gl/6iPW8S * Why are examples completely absent from hackage? Am I missing something? Domain: self.haskell, Score: 67, Comments: 68 On Reddit: [10] http://goo.gl/QmZjZs Original: [11] http://goo.gl/QmZjZs * Implementing Python in Haskell - Melbourne Haskell Users Group, April 24 Domain: meetup.com, Score: 53, Comments: 6 On Reddit: [12] http://goo.gl/tYRtG9 Original: [13] http://goo.gl/oClHGb * Blog post - Haskell Gets Static Typing Right - Andres Löh Domain: skillsmatterblog.wordpress.com, Score: 51, Comments: 25 On Reddit: [14] http://goo.gl/5AQO4h Original: [15] http://goo.gl/WddMUA * Haskell for all: Scalable program architectures Domain: haskellforall.com, Score: 45, Comments: 19 On Reddit: [16] http://goo.gl/JDYSQl Original: [17] http://goo.gl/MUrRRg * GHC 7.8′s -staticlib flag makes compiling Mac libs easy Domain: maxs.io, Score: 42, Comments: 5 On Reddit: [18] http://goo.gl/SVICOm Original: [19] http://goo.gl/FwVdOv * Autocomplete command line options with GHC 7.8 Domain: self.haskell, Score: 39, Comments: 10 On Reddit: [20] http://goo.gl/bXNI20 Original: [21] http://goo.gl/bXNI20 * How to learn Haskell Domain: acm3.wustl.edu, Score: 39, Comments: 16 On Reddit: [22] http://goo.gl/oaQsAL Original: [23] http://goo.gl/TLbCEL * Calling Python from Haskell Domain: lunaryorn.com, Score: 36, Comments: 14 On Reddit: [24] http://goo.gl/9n8O4m Original: [25] http://goo.gl/j8YqgK * "latest API" link in Hackage Domain: self.haskell, Score: 30, Comments: 15 On Reddit: [26] http://goo.gl/RJnphF Original: [27] http://goo.gl/RJnphF * Functional Pearl: F for Functor Domain: cs.ox.ac.uk, Score: 27, Comments: 14 On Reddit: [28] http://goo.gl/i7TPuf Original: [29] http://goo.gl/7c33Xn Top StackOverflow Questions * Idris eager evaluation votes: 14, answers: 1 Read on SO: [30] http://goo.gl/LDpNtI * Why use such a peculiar function type in monads? votes: 11, answers: 4 Read on SO: [31] http://goo.gl/XX8KSX * How does mapA work with a Stream Function Arrow in Haskell? votes: 8, answers: 1 Read on SO: [32] http://goo.gl/vECKBa * Lenses and Monomorphism Restriction votes: 8, answers: 2 Read on SO: [33] http://goo.gl/hG44KA * Is this a GHC bug? votes: 7, answers: 1 Read on SO: [34] http://goo.gl/sqByI2 * Why do some of threepenny-gui FRP combinators operate on a MonadIO monad instead of being pure? votes: 6, answers: 2 Read on SO: [35] http://goo.gl/ySVqya * S combinator in Haskell votes: 6, answers: 2 Read on SO: [36] http://goo.gl/vnb64N * Graphing criterion benchmarks taking different orders of magnitude of time votes: 6, answers: 1 Read on SO: [37] http://goo.gl/J3jgWf * Fun with fixity votes: 6, answers: 1 Read on SO: [38] http://goo.gl/molyi9 Until next time, [39]+Daniel Santa Cruz References 1. http://cufp.org/2014cfp 2. http://debug.elm-lang.org/ 3. http://www.reddit.com/r/haskell/comments/233ff9/a_time_traveling_debugger_f… 4. https://github.com/i-tu/source-code-pro-L/ 5. http://www.reddit.com/r/haskell/comments/23g9dv/oc_haskell_programming_font… 6. http://www.chiark.greenend.org.uk/ucgi/~cjwatson/blosxom/2014-04-15-porting… 7. http://www.reddit.com/r/haskell/comments/232erb/porting_ghc_a_tale_of_two_a… 8. http://www.tryidris.org/console 9. http://www.reddit.com/r/haskell/comments/22yww7/try_idris/ 10. http://www.reddit.com/r/haskell/comments/23dxli/why_are_examples_completely… 11. http://www.reddit.com/r/haskell/comments/23dxli/why_are_examples_completely… 12. http://www.meetup.com/Melbourne-Haskell-Users-Group/events/174401572/ 13. http://www.reddit.com/r/haskell/comments/238akv/implementing_python_in_hask… 14. http://skillsmatterblog.wordpress.com/2014/04/15/guest-post-haskell-gets-st… 15. http://www.reddit.com/r/haskell/comments/233njg/blog_post_haskell_gets_stat… 16. http://www.haskellforall.com/2014/04/scalable-program-architectures.html 17. http://www.reddit.com/r/haskell/comments/2300zb/haskell_for_all_scalable_pr… 18. http://maxs.io/ghc-78-static-lib-flag/ 19. http://www.reddit.com/r/haskell/comments/23fyok/ghc_78s_staticlib_flag_make… 20. http://www.reddit.com/r/haskell/comments/236qkb/autocomplete_command_line_o… 21. http://www.reddit.com/r/haskell/comments/236qkb/autocomplete_command_line_o… 22. http://acm3.wustl.edu/functional/haskell.php 23. http://www.reddit.com/r/haskell/comments/239f2m/how_to_learn_haskell/ 24. http://www.lunaryorn.com/2014/04/15/calling-python-from-haskell.html 25. http://www.reddit.com/r/haskell/comments/2330aj/calling_python_from_haskell/ 26. http://www.reddit.com/r/haskell/comments/22xz96/latest_api_link_in_hackage/ 27. http://www.reddit.com/r/haskell/comments/22xz96/latest_api_link_in_hackage/ 28. http://www.cs.ox.ac.uk/people/daniel.james/functor/functor.pdf 29. http://www.reddit.com/r/haskell/comments/2327e7/functional_pearl_f_for_func… 30. http://stackoverflow.com/questions/23149532/idris-eager-evaluation 31. http://stackoverflow.com/questions/23051800/why-use-such-a-peculiar-functio… 32. http://stackoverflow.com/questions/23048100/how-does-mapa-work-with-a-strea… 33. http://stackoverflow.com/questions/23066099/lenses-and-monomorphism-restric… 34. http://stackoverflow.com/questions/23091080/is-this-a-ghc-bug 35. http://stackoverflow.com/questions/23044464/why-do-some-of-threepenny-gui-f… 36. http://stackoverflow.com/questions/23095224/s-combinator-in-haskell 37. http://stackoverflow.com/questions/23129649/graphing-criterion-benchmarks-t… 38. http://stackoverflow.com/questions/23142075/fun-with-fixity 39. https://plus.google.com/105107667630152149014/about

1 0

[Haskell.org GSoC] Accepted Proposals
by Edward Kmett 22 Apr '14

22 Apr '14

I'm pleased to announce the list of accepted student proposals for haskell.org for the Google Summer of Code 2014. Title Student Mentor Adding profiling support to GHCJS -- JavaScript backend for GHC Ömer Sinan Aǧacan Luite Stegeman Concurrent Lock-Free Hash Map for Haskell Mathias Bartl Ryan Newton Darcs: Hashed Files and Cache Marcio Díaz Eric Kow HDBC Improvements Edisach Nicolas Wu Darcs: History reordering: performance and features Ale Gadea Guillaume Hoffmann Implement Constraint-Based Layout in Diagrams Allan Gardner Daniel Bergey Lensify Diagrams Niklas Haas Brent Yorgey An Efficient Computational Algebra and Symbolic Linear Algebra Library in Haskell Hiromi ISHII Edward Kmett Complete plugins-ng "low-level", "filewatch", and "cabal" packages Kẏra Greg Weber Build Interactive Websites with GHCJS and Sodium Kyle Raftogianis Luite Stegeman Pandoc improvements: Embedded base64 images and EPUB 3.0 reader Matthew Pickering John MacFarlane Agda-like Interaction Mode for Emacs Alejandro Serrano David Raymond Christiansen Debugging tool for GHCJS Nathan van Doorn Luite Stegeman Flesh out features of Hackage 2 Chris Wong Duncan Coutts You can explore the abstracts of the accepted proposals at http://www.google-melange.com/gsoc/org2/google/gsoc2014/haskell I would like to take a moment to offer congratulations to all of the students we were able to accept into the program this year. That said, I would also like to offer my condolences to those students whom we were not able to bring into the program. We received 14 slots in total this year - more than we ever received in past years - yet still not nearly enough to accept all of the excellent proposals we received this time around. Please consider applying again next year. I am looking forward to working with you on another Summer of Code, and I hope we can all make an effort as a community to be welcoming and to help you in your projects. If you have any questions or concerns about the process, please feel free to email me or chase me down on #haskell-gsoc on irc.freenode.net. -Edward Kmett

2 2