February 2015 - Haskell

Rank-N types with (.) composition
by Tyson Whitehead 11 Feb '15

11 Feb '15

I came across something that seems a bit strange to me. Here is a simplified version (the original was trying to move from a lens ReifiedFold to a lens-action ReifiedMonadicFold) {-# LANGUAGE RankNTypes #-} import Control.Applicative newtype Wrap = Wrap { extract :: forall f. Functor f => f Int } trip :: Wrap -> Wrap trip a = Wrap (extract a) The compiler is okay with this. It chokes on this alternative though trip :: Wrap -> Wrap trip = Wrap . extract giving (GHC 7.8.2) Couldn't match type ‘f0 Int’ with ‘forall (f :: * -> *). Functor f => f Int’ Expected type: f0 Int -> Wrap Actual type: (forall (f :: * -> *). Functor f => f Int) -> Wrap In the first argument of ‘(.)’, namely ‘Wrap’ In the expression: Wrap . extract I'm guessing this is because the compiler fancy footwork to handle the implicit parameters, something like trip a = Wrap (\f fDict -> extract a f fDict) where f is the Functor type and fDict is the associated dictionary, isn't compatible with the (.) definition of f . g = \x -> f (g x) Is this correct? I would appreciate anyone insight here. Is there a way combine these (.) style? Thanks! -Tyson

6 10

Re: [Haskell] [Haskell-cafe] GHC 7.10 Prelude: we need your opinion
by Simon Peyton Jones 10 Feb '15

10 Feb '15

| What were the objections? Especially the principle ones? Please read the info pages, which set out the arguments quite carefully. Also, I spammed several email lists to ensure broad coverage, but it'd be best to debate on the libraries(a)haskell.org, rather than reply-to-all; that's what it's for. (Which I failed to send the announcement to! I'll fix that.) Simon | -----Original Message----- | From: Miguel Mitrofanov [mailto:miguelimo38@yandex.ru] | Sent: 10 February 2015 15:59 | To: Simon Peyton Jones; haskell(a)haskell.org; Haskell Cafe (haskell- | cafe(a)haskell.org) GHC users; ghc-devs(a)haskell.org | Subject: Re: [Haskell-cafe] GHC 7.10 Prelude: we need your opinion | | What were the objections? Especially the principle ones? | | 10.02.2015, 18:51, "Simon Peyton Jones" <simonpj(a)microsoft.com>: | > Haskell Friends | > | > This email asks for your help in deciding how to proceed with some | Prelude changes in GHC 7.10. Please read on, but all the info is also | at the survey link, here: http://goo.gl/forms/XP1W2JdfpX. Deadline | is 21 Feb. | > | > The Core Libraries Committee (CLC) is responsible for developing the | core libraries that ship with GHC. This is an important but | painstaking task, and we owe the CLC a big vote of thanks for taking | it on. | > | > For over a year the CLC has been working on integrating the Foldable | and Traversable classes (shipped in base in GHC 7.8) into the core | libraries, and into the Prelude in particular. Detailed planning for | GHC 7.10 started in the autumn of 2014, and the CLC went ahead with | this integration. | > | > Then we had a failure of communication. As these changes affect the | Prelude, which is in scope for all users of Haskell, these changes | should be held to a higher bar than the regular libraries@ review | process. However, the Foldable/Traversable changes were not | particularly well signposted. Many people have only recently woken up | to them, and some have objected (both in principle and detail). | > | > This is an extremely unfortunate situation. On the one hand we are | at RC2 for GHC 7.10, so library authors have invested effort in | updating their libraries to the new Prelude. On the other, altering | the Prelude is in effect altering the language, something we take | pretty seriously. We should have had this debate back in 2014, but | here we are, and it is unproductive to argue about whose fault it is. | We all share responsibility. | > | > We need to decide what to do now. A small group of us met by Skype | and we've decided to do this: | > | > · Push back GHC 7.10's release by at least a month, to late | March. This delay also gives us breathing space to address an | unrelated show-stopping bug, Trac #9858. | > | > · Invite input from the Haskell community on which of two | approaches to adopt (this survey). The main questions revolve around | impact on the Haskell ecosystem (commercial applications, teaching, | libraries, etc etc), so we want to ask your opinion rather than guess | it. | > | > · Ask Simon Marlow and Simon Peyton Jones to decide which | approach to follow for GHC 7.10. | > | > Wiki pages have been created summarizing these two primary | alternatives, including many more points and counter-points and | technical details: | > | > · Overall summary: | https://ghc.haskell.org/trac/ghc/wiki/Prelude710 | > | > · Details of Plan List: | https://ghc.haskell.org/trac/ghc/wiki/Prelude710/List | > | > · Details of Plan FTP: | https://ghc.haskell.org/trac/ghc/wiki/Prelude710/FTP | > | > This survey invites your input on which plan we should follow. Would | you please | > | > · Read the details of the alternative plans on the three | wiki pages above | > | > · Add your response to the survey | > | > Please do read the background. Well-informed responses will | help. Thank you! | > | > DEADLINE: 21 February 2015 | > | > Simon PJ | > | > , | > | > _______________________________________________ | > Haskell-Cafe mailing list | > Haskell-Cafe(a)haskell.org | > http://www.haskell.org/mailman/listinfo/haskell-cafe

1 0

GHC 7.10 Prelude: we need your opinion
by Simon Peyton Jones 10 Feb '15

10 Feb '15

Haskell Friends This email asks for your help in deciding how to proceed with some Prelude changes in GHC 7.10. Please read on, but all the info is also at the survey link, here: http://goo.gl/forms/XP1W2JdfpX. Deadline is 21 Feb. The Core Libraries Committee (CLC) is responsible for developing the core libraries that ship with GHC. This is an important but painstaking task, and we owe the CLC a big vote of thanks for taking it on. For over a year the CLC has been working on integrating the Foldable and Traversable classes (shipped in base in GHC 7.8) into the core libraries, and into the Prelude in particular. Detailed planning for GHC 7.10 started in the autumn of 2014, and the CLC went ahead with this integration. Then we had a failure of communication. As these changes affect the Prelude, which is in scope for all users of Haskell, these changes should be held to a higher bar than the regular libraries@ review process. However, the Foldable/Traversable changes were not particularly well signposted. Many people have only recently woken up to them, and some have objected (both in principle and detail). This is an extremely unfortunate situation. On the one hand we are at RC2 for GHC 7.10, so library authors have invested effort in updating their libraries to the new Prelude. On the other, altering the Prelude is in effect altering the language, something we take pretty seriously. We should have had this debate back in 2014, but here we are, and it is unproductive to argue about whose fault it is. We all share responsibility. We need to decide what to do now. A small group of us met by Skype and we've decided to do this: · Push back GHC 7.10's release by at least a month, to late March. This delay also gives us breathing space to address an unrelated show-stopping bug, Trac #9858. · Invite input from the Haskell community on which of two approaches to adopt (this survey<http://goo.gl/forms/XP1W2JdfpX>). The main questions revolve around impact on the Haskell ecosystem (commercial applications, teaching, libraries, etc etc), so we want to ask your opinion rather than guess it. · Ask Simon Marlow and Simon Peyton Jones to decide which approach to follow for GHC 7.10. Wiki pages have been created summarizing these two primary alternatives, including many more points and counter-points and technical details: · Overall summary: https://ghc.haskell.org/trac/ghc/wiki/Prelude710<https://www.google.com/url?q=https%3A%2F%2Fghc.haskell.org%2Ftrac%2Fghc%2Fw…> · Details of Plan List: https://ghc.haskell.org/trac/ghc/wiki/Prelude710/List<https://www.google.com/url?q=https%3A%2F%2Fghc.haskell.org%2Ftrac%2Fghc%2Fw…> · Details of Plan FTP: https://ghc.haskell.org/trac/ghc/wiki/Prelude710/FTP<https://www.google.com/url?q=https%3A%2F%2Fghc.haskell.org%2Ftrac%2Fghc%2Fw…> This survey invites your input on which plan we should follow. Would you please · Read the details of the alternative plans on the three wiki pages above · Add your response to the survey<http://goo.gl/forms/XP1W2JdfpX> Please do read the background. Well-informed responses will help. Thank you! DEADLINE: 21 February 2015 Simon PJ

1 0

First Call for Papers, PxTP 2015
by Andrei Paskevich 10 Feb '15

10 Feb '15

The Fourth International Workshop on Proof eXchange for Theorem Proving (PxTP) http://pxtp15.lri.fr/ August 2-3, 2015, Berlin, Germany associated with CADE 2015 Important dates * Abstract submission: Thu, May 7, 2015 * Paper submission: Thu, May 14, 2015 * Notification: Tue, June 16, 2015 * Camera ready versions due: Thu, June 25, 2015 * Workshop: August 2-3, 2015 Background The PxTP workshop brings together researchers working on various aspects of communication, integration, and cooperation between reasoning systems and formalisms. The progress in computer-aided reasoning, both automated and interactive, during the past decades, made it possible to build deduction tools that are increasingly more applicable to a wider range of problems and are able to tackle larger problems progressively faster. In recent years, cooperation of such tools in larger verification environments has demonstrated the potential to reduce the amount of manual intervention. Examples include the Sledgehammer tool providing an interface between Isabelle and (untrusted) automated provers, and also collaboration of the HOL Light and Isabelle systems in the formal proof of the Kepler conjecture. Cooperation between reasoning systems relies on availability of theoretical formalisms and practical tools to exchange problems, proofs, and models. The PxTP workshop strives to encourage such cooperation by inviting contributions on suitable integration, translation and communication methods, standards, protocols, and programming interfaces. The workshop welcomes the interested developers of automated and interactive theorem proving tools, developers of combined systems, developers and users of translation tools and interfaces, and producers of standards and protocols. We are interested both in success stories and in descriptions of the current bottlenecks and proposals for improvement. Topics Topics of interest for this workshop include all aspects of cooperation between reasoning tools, whether automatic or interactive. More specifically, some suggested topics are: * applications that integrate reasoning tools (ideally with certification of the result); * translations between logics, proof systems, models; * distribution of proof obligations among heterogeneous reasoning tools; * algorithms and tools for checking and importing (replaying, reconstructing) proofs; * proposed formats for expressing problems and solutions for different classes of logic solvers (SAT, SMT, QBF, first-order logic, higher-order logic, typed logic, rewriting, etc.); * meta-languages, logical frameworks, communication methods, standards, protocols, and APIs connected to problems, proofs, and models; * comparison, refactoring, and optimization of proofs; * practical experiences, case studies, feasibility studies; * applications relying on importing proofs from automatic theorem provers, such as certified static analysis, proof-carrying code, or certified compilation; * data structures and algorithms for improved proof production in solvers (e.g., efficient proof representations). Submissions Researchers interested in participating are invited to submit either an extended abstract (up to 8 pages) or a regular paper (up to 15 pages). Submissions will be refereed by the program committee, which will select a balanced program of high-quality contributions. Short submissions that could stimulate fruitful discussion at the workshop are particularly welcome. We expect that one author of every accepted paper will present their work at the workshop. Submitted papers should describe previously unpublished work, and must be prepared using the LaTeX EPTCS class (http://style.eptcs.org/) Papers will be submitted via EasyChair, at the PxTP'2015 workshop page (http://www.easychair.org/conferences/?conf=pxtp2015) Accepted full papers will appear in an EPTCS volume. Invited speakers (joint with the AMI'2015 workshop) * Georges Gonthier (Microsoft Research) * Bart Jacobs (KU Leuven) Program committee * Jesse Alama (Vienna University of Technology) * Peter Baumgartner (NICTA) * Jasmin Blanchette (TU München) * Guillaume Burel (CÉDRIC, ENSIIE) * Évelyne Contejean (LRI, CNRS, Université Paris Sud) * Cezary Kaliszyk (University of Innsbruck), co-chair * Ramana Kumar (University of Cambridge) * Dale Miller (Inria / LIX, École polytechnique) * Bruno Woltzenlogel Paleo (Vienna University of Technology) * Andrei Paskevich (LRI, Université Paris Sud), co-chair * Damien Pous (LIP, CNRS, ENS Lyon) * Geoff Sutcliffe (University of Miami) * Laurent Théry (Inria) * Cesare Tinelli (University of Iowa) * Josef Urban (Radboud University Nijmegen)

1 0

4Yr PostDoc with McBride/Ghani
by Neil Ghani 09 Feb '15

09 Feb '15

Please forward to anyone you think might be interested cheers neil Salary range: £30434 - £34,233 FTE: 1.0 Term: Fixed Term (4 years) Closing date: 23 February 2015 Applications are invited for a Research Associate to work under the supervision of Professor Neil Ghani and Dr Conor McBride on the EPSRC grant "Homotopy Type Theory: Programming and Verification". Homotopy Type Theory (HoTT) is a revolutionary new approach to type theory where types are interpreted as spaces, terms as points and equalities as paths. Decades of research in homotopy theory has uncovered the structure of such paths and HoTT uses this structure as the basis of a new theory of equality. Excitingly, within homotopy theory, one naturally studies higher homotopies of paths between paths and this gives the higher dimensional structure of equality we previously lacked. The objective of this grant is to translate the advances of HoTT into more concrete programming language and verification tools. You will join a team consisting of Prof Neil Ghani, Dr Conor McBride at the University of Strathclyde as well as Dr Nicola Gambino at the University of Leeds and Dr Thorsten Altenkirch at the Univeristy of Nottingham. We will be hiring an RA to work on the more theoretical parts of the project at Nottignham while your main duties will be to conduct research on the more applied - that is programming language - aspects of the project at Strathclyde. You will possess a PhD in mathematics or computer science and be familiar with type theory, category theory and programming languages. Interviews have been scheduled for 25 March 2015. For informal enquiries, please contact Professor Neil Ghani, (email: neil.ghani(a)strath.ac.uk<mailto:neil.ghani@strath.ac.uk> or tel: 0141 548 4303) or Dr Conor McBride, (email conor.mcbride(a)strath.ac.uk<mailto:conor.mcbride@strath.ac.uk> or tel 01415483121.

1 0

CF STUDENT POSTERS for Innovations'15 (No registration fees), Dubai, November 01-03, 2015
by Nabeel Al-Qirim 08 Feb '15

08 Feb '15

CF STUDENT POSTERS for Innovations'15 (No registration fees), Dubai, November 01-03, 2015 IIT’15: The 11th International Conference on Innovations in Information Technology 2015 URL: http://www.it-innovations.ae/iit2015/posters.html The IIT’15 Student Poster and Demos Committee invites all undergraduate and graduate students to submit an extended (2 pages max.) abstract and to display it as a poster during the IIT’15. The poster topic should fall within the conference’s theme and tracks. SUBMISSION Extended abstracts should be sent to Dr. Nabeel Al-Qirim at nalqirim(a)uaeu.ac.ae. All students are encouraged to review their abstracts with their faculty advisers prior to submission. All accepted abstracts will be published by the IIT’15 proceedings. IMPORTANT DATES -Student Poster (Extended Paper) Submission May 30, 2015 -Notification of Student Poster acceptance July 15, 2015 -Camera ready Extended Paper and Poster material September 01, 2015 -Conference November 01-03, 2015 BEST STUDENT POSTER AWARDS There will be a competition for best student poster award at the IIT’15. This award will be given to recognize student excellence in research and presentation. CONTACT Queries should be directed to: Dr. Nabeel Al-Qirim at nalqirim(a)uaeu.ac.ae Thanks, Dr. Nabeel Al-Qirim IIT’15 Student Poster and Demos Chair College of Information Technology United Arab Emirates University P.O Box 15551 - Al Ain United Arab Emirates Tel: +971-3-7135531 Mobile: +971-507308705 Fax: +971-3-7672018 Email: nalqirim(a)uaeu.ac.ae Website: http://nalqirim.wix.com/nabeel-al-qirim ________________________________ Disclaimer: This email and the file(s) attached shall remain confidential and is intended for the receivers use only. If you are not the intended receiver or if you have received this email by mistake, please advise the sender and delete the email along with its attachment(s) from your system immediately. You do not have the right to copy/print/distribute this email or attached file(s), or to release its contents to any other party other than the intended receivers whatsoever; except if you take prior written approval from the sender. If you violate the above, you will be legally held accountable.

1 0

Re: [Haskell] [Haskell-cafe] Haskell Weekly News: Issue 316
by Takenobu Tani 07 Feb '15

07 Feb '15

sorry, frequent mail in important thread. I understood why I did not receive initial mail. Daniel's initial mail was determined that the spam mail in Gmail. I found it in Gmail spam folder. Cheers, Takenobu 2015-02-07 10:32 GMT+09:00 Takenobu Tani <takenobu.hs(a)gmail.com>: > Hi Brandon, > > Thank you for your help. > I think my environmental problems. > > It's OK, if everyone could read it in cafe:-) > > Thank you, > Takenobu > > > > 2015-02-06 23:12 GMT+09:00 Brandon Allbery <allbery.b(a)gmail.com>: > >> On Fri, Feb 6, 2015 at 7:59 AM, Takenobu Tani <takenobu.hs(a)gmail.com> >> wrote: >> >>> and, to haskell-cafe, >>> "Haskell Weekly News: Issue 316" original message[1] had sent only to >>> haskell@haskell.org? >>> (not to haskell-cafe? or my mailer trouble?) >>> >> >> gmail suppresses duplicate messages, so if you are subscribed to both >> lists you will receive it only once. >> >> -- >> brandon s allbery kf8nh sine nomine >> associates >> allbery.b(a)gmail.com >> ballbery(a)sinenomine.net >> unix, openafs, kerberos, infrastructure, xmonad >> http://sinenomine.net >> > >

1 0

Re: [Haskell] [Haskell-cafe] Haskell Weekly News: Issue 316
by Brandon Allbery 06 Feb '15

06 Feb '15

On Fri, Feb 6, 2015 at 7:59 AM, Takenobu Tani <takenobu.hs(a)gmail.com> wrote: > and, to haskell-cafe, > "Haskell Weekly News: Issue 316" original message[1] had sent only to > haskell@haskell.org? > (not to haskell-cafe? or my mailer trouble?) > gmail suppresses duplicate messages, so if you are subscribed to both lists you will receive it only once. -- brandon s allbery kf8nh sine nomine associates allbery.b(a)gmail.com ballbery(a)sinenomine.net unix, openafs, kerberos, infrastructure, xmonad http://sinenomine.net

1 0

PhD Studentships at St Andrews
by Kevin Hammond 06 Feb '15

06 Feb '15

[Please forward to suitable candidates. Thanks! Kevin.] The School of Computer Science at the University of St Andrews has several fully funded research scholarships available. These are available to UK residents (possibly also to EU nationals), and pay fees as well as maintenance. There is no formal deadline, but applications should be made as soon as possible. We have an active group of about ten academics, postdoctoral research fellows and postgraduate students working on a variety of topics in functional programming. We'd welcome applicants who are interested in any aspect of functional programming and related areas, including: Parallel Functional programming; Heterogeneous multicores (including CPU/GPU combinations); Refactoring; Program Generation; Domain Specific Languages; Static Analysis; Patterns of computation; Machine-Learning; Compilation; Real-time functional programming (e.g. in Hume); Semantics of Programming Languages; Functional cloud computing; Functional Programming and Security; Dependent Types; Effects and other extra-functional properties; Relaxed memory consistency; Multicore programming; Formal concurrency models; Concurrency verification; Application of functional ideas to other paradigms, including C and C++; Data Analytics. We work with various functional languages including Haskell, Erlang, idris, OCAML, Hume and F#. We have excellent links with both academic and industry, and are coordinating the EU Framework 7 ParaPhrase project, which involves 13 partners from 8 European countries: http://www.paraphrase-ict.eu, and the EU Horizon 2020 RePhrase project, which involves 8 partners from 8 European countries: http://rephrase.weebly.com Please contact me to discuss possible project ideas. Applications should be made through: http://www.cs.st-andrews.ac.uk/prospective-pg/research-degrees 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

1 0

Haskell Weekly News: Issue 316
by Daniel Santa Cruz 06 Feb '15

06 Feb '15

Welcome to issue 316 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from January 18 to 31, 2015 After doing more than 150 of these, I have come to the conclusion that it is time for me to take a permanent break from HWN. I realize that "we could do better", and have something a bit more edited than a collection of links, and some quotes. I wish I had more time to devote to such endeavor, but my time is currently being taken up by trying to help my 1 year old explore her little world. If you'd like to be the one to continue the long tradition of HWN, drop me a line. Thanks for following along for the last 3 years! Quotes of the Week * johnw: "Sir, what weapon did the assailant use against you?" "All I know is that it was done in IO, officer." * monochrom: $ can't buy you love, but it can buy you function application * hiptobecubic: benzrf, well sure. I'm not suggesting that lens has actually left any operators available for anything Top Reddit Stories * I think I've nailed it! I've solved the records problem! Domain: nikita-volkov.github.io, Score: 348, Comments: 193 Original: [1] http://goo.gl/PhJo6K On Reddit: [2] http://goo.gl/vWPeOj * Use Haskell for shell scripting Domain: haskellforall.com, Score: 121, Comments: 62 Original: [3] http://goo.gl/Fx4HeT On Reddit: [4] http://goo.gl/2g83KR * Major Prelude changes proposed Domain: haskell.org, Score: 119, Comments: 252 Original: [5] http://goo.gl/wtFWt3 On Reddit: [6] http://goo.gl/kaegj2 * Slides from Don Stewart's Google tech talk Domain: code.haskell.org, Score: 104, Comments: 75 Original: [7] http://goo.gl/ejfoFp On Reddit: [8] http://goo.gl/9cK9dB * Haskell Design Patterns: .Extended Modules Domain: jaspervdj.be, Score: 86, Comments: 29 Original: [9] http://goo.gl/TvwGCF On Reddit: [10] http://goo.gl/wkNx38 * IO Monad Considered Harmful Domain: blog.jle.im, Score: 86, Comments: 157 Original: [11] http://goo.gl/z9Elq7 On Reddit: [12] http://goo.gl/uehgF9 * We are making great efforts to spread Haskell around our local programming groups. Today, I finally saw a Haskell post, so I'm glad it is kinda working. Kinda. Domain: i.imgur.com, Score: 86, Comments: 41 Original: [13] http://goo.gl/0SsbT7 On Reddit: [14] http://goo.gl/gyBJ1o * My Haskell tooling wishlist by Chris Done Domain: chrisdone.com, Score: 77, Comments: 27 Original: [15] http://goo.gl/VIRJgM On Reddit: [16] http://goo.gl/ChmItY * Categories for Programmers: Functors Domain: bartoszmilewski.com, Score: 70, Comments: 14 Original: [17] http://goo.gl/6M64jC On Reddit: [18] http://goo.gl/tW6ubH * I wrote another monad tutorial. Sorry. Domain: kevinmahoney.co.uk, Score: 63, Comments: 22 Original: [19] http://goo.gl/zEQIgS On Reddit: [20] http://goo.gl/XXeZN3 * Introducing SJS, a type inferer and checker for JavaScript (written in Haskell) Domain: noamlewis.wordpress.com, Score: 61, Comments: 33 Original: [21] http://goo.gl/oQRSNo On Reddit: [22] http://goo.gl/1LfY1u * Solving the expression problem with Object Algebras and Tagless Interpreters Domain: oleksandrmanzyuk.wordpress.com, Score: 59, Comments: 30 Original: [23] http://goo.gl/daJWGy On Reddit: [24] http://goo.gl/fKy9zV Top StackOverflow Questions * Why do we need monads? votes: 142, answers: 5 Read on SO: [25] http://goo.gl/Ioviv9 * Why compiling this Haskell program with -fllvm produces a different result? votes: 19, answers: 0 Read on SO: [26] http://goo.gl/twid2N * What is the difference between traits in Rust and typeclasses in Haskell? votes: 18, answers: 0 Read on SO: [27] http://goo.gl/KJdBqh * Motivation behind Phantom Types? votes: 17, answers: 3 Read on SO: [28] http://goo.gl/q7IQQC * What is the precedence of ~, and why? votes: 17, answers: 1 Read on SO: [29] http://goo.gl/iZHxLy * Using GHC API to compile Haskell sources to CORE and CORE to binary votes: 13, answers: 2 Read on SO: [30] http://goo.gl/Qto29m * How to ship an executable with Language.Haskell.Interpreter? votes: 13, answers: 0 Read on SO: [31] http://goo.gl/JptPyG Until next time, [32]+Daniel Santa Cruz References 1. http://nikita-volkov.github.io/record/ 2. http://www.reddit.com/r/haskell/comments/2svayz/i_think_ive_nailed_it_ive_s… 3. http://www.haskellforall.com/2015/01/use-haskell-for-shell-scripting.html 4. http://www.reddit.com/r/haskell/comments/2u6b8m/use_haskell_for_shell_scrip… 5. https://www.haskell.org/pipermail/libraries/2015-January/024777.html 6. http://www.reddit.com/r/haskell/comments/2ttvsj/major_prelude_changes_propo… 7. http://code.haskell.org/~dons/talks/dons-google-2015-01-27.pdf 8. http://www.reddit.com/r/haskell/comments/2u0380/slides_from_don_stewarts_go… 9. http://jaspervdj.be/posts/2015-01-20-haskell-design-patterns-extended-modul… 10. http://www.reddit.com/r/haskell/comments/2t4lba/haskell_design_patterns_ext… 11. http://blog.jle.im/entry/io-monad-considered-harmful 12. http://www.reddit.com/r/haskell/comments/2tbbxh/io_monad_considered_harmful/ 13. http://i.imgur.com/Rw8mmad.jpg 14. http://www.reddit.com/r/haskell/comments/2tg9gs/we_are_making_great_efforts… 15. http://chrisdone.com/posts/haskell-wishlist 16. http://www.reddit.com/r/haskell/comments/2tpwim/my_haskell_tooling_wishlist… 17. http://bartoszmilewski.com/2015/01/20/functors/ 18. http://www.reddit.com/r/haskell/comments/2t2g5a/categories_for_programmers_… 19. http://kevinmahoney.co.uk/articles/haskell-io/ 20. http://www.reddit.com/r/haskell/comments/2trmyx/i_wrote_another_monad_tutor… 21. https://noamlewis.wordpress.com/2015/01/20/introducing-sjs-a-type-inferer-a… 22. http://www.reddit.com/r/haskell/comments/2szt1u/introducing_sjs_a_type_infe… 23. https://oleksandrmanzyuk.wordpress.com/2014/06/18/from-object-algebras-to-f… 24. http://www.reddit.com/r/haskell/comments/2stmt6/solving_the_expression_prob… 25. http://stackoverflow.com/questions/28139259/why-do-we-need-monads 26. http://stackoverflow.com/questions/28053448/why-compiling-this-haskell-prog… 27. http://stackoverflow.com/questions/28123453/what-is-the-difference-between-… 28. http://stackoverflow.com/questions/28247543/motivation-behind-phantom-types 29. http://stackoverflow.com/questions/28257511/what-is-the-precedence-of-and-w… 30. http://stackoverflow.com/questions/28059669/using-ghc-api-to-compile-haskel… 31. http://stackoverflow.com/questions/28204973/how-to-ship-an-executable-with-… 32. https://plus.google.com/105107667630152149014/about

4 4