- Haskell - Haskell.org

Haskell Weekly News: Issue 262
by Daniel Santa Cruz 14 Mar '13

14 Mar '13

Welcome to issue 262 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of March 03 to 09, 2013. Quotes of the Week * byorgey: The box does not care whether you think it is stupid. It is box. * ksf: duh, we can't run out of energy, as there's a fixed amount of it. * shachaf: getLine :: IO String contains a String in the same way that /bin/ls contains a list of files * macrover: is there a comparison between the various streams/pipes/conduits libraries? Cale: macrover: I am presently resisting the temptation to make a table with the libraries and only one other column which is "maximum number of type parameters to a type constructor". * tac: It's actually really easy to remember all the numeric typeclasses in Haskell. Just think about what makes sense... then make sure whatever your answer is is not that Top Reddit Stories * I can't shake the impression that FRP code is just awful to read. Thoughts? Domain: self.haskell, Score: 63, Comments: 87 On Reddit: [1] http://goo.gl/xKrMm Original: [2] http://goo.gl/xKrMm * Announcing: first release of io-streams Domain: snapframework.com, Score: 58, Comments: 125 On Reddit: [3] http://goo.gl/w53bU Original: [4] http://goo.gl/B1ren * School of Haskell Goes Public -- learning and teaching Haskell Domain: haskell.fpcomplete.com, Score: 50, Comments: 26 On Reddit: [5] http://goo.gl/YPaqA Original: [6] http://goo.gl/4izHq * Announcing http-streams, a new HTTP client library for Haskell using the Snap Framework's io-streams. Domain: blogs.operationaldynamics.com, Score: 43, Comments: 20 On Reddit: [7] http://goo.gl/QKVez Original: [8] http://goo.gl/qygmB * How OCaml type checker works -- or what polymorphism and garbage collection have in common Domain: okmij.org, Score: 43, Comments: 2 On Reddit: [9] http://goo.gl/0CtFH Original: [10] http://goo.gl/7wmWm * Yann Esposito's "Haskell Fast & Hard": A fast-paced tutorial for Haskell beginners Domain: fpcomplete.com, Score: 42, Comments: 16 On Reddit: [11] http://goo.gl/utdiI Original: [12] http://goo.gl/ovldG * hArduino: Control your Arduino board from Haskell Domain: self.haskell, Score: 41, Comments: 3 On Reddit: [13] http://goo.gl/27Ilp Original: [14] http://goo.gl/27Ilp * binary 0.7 Domain: lennartkolmodin.blogspot.ru, Score: 35, Comments: 14 On Reddit: [15] http://goo.gl/VcusD Original: [16] http://goo.gl/LEwBA * IRC Browse: #haskell — first release Domain: ircbrowse.net, Score: 35, Comments: 33 On Reddit: [17] http://goo.gl/3oDKs Original: [18] http://goo.gl/MXygv * Responsive design with Clay Domain: fvisser.nl, Score: 28, Comments: 5 On Reddit: [19] http://goo.gl/0ZLuU Original: [20] http://goo.gl/lQ58q * The 'build' function explained Domain: self.haskell, Score: 28, Comments: 9 On Reddit: [21] http://goo.gl/vlPaF Original: [22] http://goo.gl/vlPaF * How (the syntactic type equality of) GADTs inhibit abstraction Domain: lukepalmer.wordpress.com, Score: 26, Comments: 26 On Reddit: [23] http://goo.gl/fD8j9 Original: [24] http://goo.gl/PY1bj * Caledon 2.0: Consistency & IO. Now based on the calculus of constructions. Domain: github.com, Score: 21, Comments: 7 On Reddit: [25] http://goo.gl/W2qP6 Original: [26] http://goo.gl/rnwSY Top StackOverflow Questions * Are thread pools needed for pure Haskell code? votes: 27, answers: 1 Read on SO: [27] http://goo.gl/Pmrhi * Independent subset of cabal packages set votes: 21, answers: 2 Read on SO: [28] http://goo.gl/qBuws * Should I use a lexer when using a parser combinator library like Parsec? votes: 19, answers: 1 Read on SO: [29] http://goo.gl/6Dfd8 * Current state of Haskell soft real-time votes: 9, answers: 2 Read on SO: [30] http://goo.gl/ueRhX * Difference for ncurses between interpreted and compiled Haskell? votes: 9, answers: 1 Read on SO: [31] http://goo.gl/QnKAQ * More fun with applicative functors votes: 8, answers: 5 Read on SO: [32] http://goo.gl/pykvJ * What's the real benefit of conduit's upstream type parameter? votes: 8, answers: 2 Read on SO: [33] http://goo.gl/RdIUU * What's the benefit of conduit's leftovers? votes: 8, answers: 2 Read on SO: [34] http://goo.gl/oqnty Until next time, +Daniel Santa Cruz References 1. http://www.reddit.com/r/haskell/comments/19v4l1/i_cant_shake_the_impression… 2. http://www.reddit.com/r/haskell/comments/19v4l1/i_cant_shake_the_impression… 3. http://snapframework.com/blog/2013/03/05/announcing-io-streams 4. http://www.reddit.com/r/haskell/comments/19qfr6/announcing_first_release_of… 5. https://haskell.fpcomplete.com/blog/2013/03/SoH-Goes-Public 6. http://www.reddit.com/r/haskell/comments/19ntvz/school_of_haskell_goes_publ… 7. http://blogs.operationaldynamics.com/andrew/software/haskell/http-streams-i… 8. http://www.reddit.com/r/haskell/comments/19rlw5/announcing_httpstreams_a_ne… 9. http://okmij.org/ftp/ML/generalization.html 10. http://www.reddit.com/r/haskell/comments/19wogp/how_ocaml_type_checker_work… 11. https://www.fpcomplete.com/user/yogsototh/haskell-fast-hard 12. http://www.reddit.com/r/haskell/comments/19xrhm/yann_espositos_haskell_fast… 13. http://www.reddit.com/r/haskell/comments/19uwf5/harduino_control_your_ardui… 14. http://www.reddit.com/r/haskell/comments/19uwf5/harduino_control_your_ardui… 15. http://lennartkolmodin.blogspot.ru/2013/03/binary-07.html 16. http://www.reddit.com/r/haskell/comments/19kkuc/binary_07/ 17. http://ircbrowse.net/browse/freenode/haskell 18. http://www.reddit.com/r/haskell/comments/19xxuu/irc_browse_haskell_first_re… 19. http://fvisser.nl/post/2013/march/4/responsive-design-with-clay.html 20. http://www.reddit.com/r/haskell/comments/19lpzv/responsive_design_with_clay/ 21. http://www.reddit.com/r/haskell/comments/19p6w3/the_build_function_explaine… 22. http://www.reddit.com/r/haskell/comments/19p6w3/the_build_function_explaine… 23. http://lukepalmer.wordpress.com/2013/03/04/how-gadts-inhibit-abstraction/ 24. http://www.reddit.com/r/haskell/comments/19mwxr/how_the_syntactic_type_equa… 25. https://github.com/mmirman/caledon 26. http://www.reddit.com/r/haskell/comments/19sq5x/caledon_20_consistency_io_n… 27. http://stackoverflow.com/questions/15191649/are-thread-pools-needed-for-pur… 28. http://stackoverflow.com/questions/15186768/independent-subset-of-cabal-pac… 29. http://stackoverflow.com/questions/15216202/should-i-use-a-lexer-when-using… 30. http://stackoverflow.com/questions/15236238/current-state-of-haskell-soft-r… 31. http://stackoverflow.com/questions/15304317/difference-for-ncurses-between-… 32. http://stackoverflow.com/questions/15209516/more-fun-with-applicative-funct… 33. http://stackoverflow.com/questions/15258406/whats-the-real-benefit-of-condu… 34. http://stackoverflow.com/questions/15258587/whats-the-benefit-of-conduits-l… 35. https://plus.google.com/105107667630152149014/about

1 0

WORLDCOMP Strikes Again for the Last Time
by chrisrogersrogers＠aol.com 13 Mar '13

13 Mar '13

I graduated from University of Florida (UFL) and am currently running a computer firm in Florida. I have attended WORLDCOMP http://www.world-academy-of-science.org in 2010. Except for few keynote speeches and presentations, the conference was very disappointing due to a large number of poor quality papers and cancellation of some sessions. I was instantly suspicious of this conference. Me and my UFL and UGA friends started a study on WORLDCOMP. We submitted a paper to WORLDCOMP 2011 and again (the same paper with a modified title) to WORLDCOMP 2012. This paper had numerous fundamental mistakes. Sample statements from that paper include: (1). Binary logic is fuzzy logic and vice versa (2). Pascal developed fuzzy logic (3). Object oriented languages do not exhibit any polymorphism or inheritance (4). TCP and IP are synonyms and are part of OSI model (5). Distributed systems deal with only one computer (6). Laptop is an example for a super computer (7). Operating system is an example for computer hardware Also, our paper did not express any conceptual meaning. However, it was accepted both the times without any modifications (and without any reviews) and we were invited to submit the final paper and a payment of $500+ fee to present the paper. We decided to use the fee for better purposes than making Prof. Hamid Arabnia (Chairman of WORLDCOMP) rich. After that, we received few reminders from WORLDCOMP to pay the fee but we never responded. We MUST say that you should look at the website http://sites.google.com/site/worlddump1 if you have any thoughts to submit a paper to WORLDCOMP. DBLP and other indexing agencies have stopped indexing WORLDCOMP’s proceedings since 2011 due to its fakeness. The status of your WORLDCOMP papers can be changed from “scientific” to “other” (i.e., junk or non-technical) at anytime. See the comments http://www.mail-archive.com/tccc@lists.cs.columbia.edu/msg05168.html of a respected researcher on this. Better not to have a paper than having it in WORLDCOMP and spoil the resume and peace of mind forever! Our study revealed that WORLDCOMP is a money making business, using UGA mask, for Prof. Hamid Arabnia. He is throwing out a small chunk of that money (around 20 dollars per paper published in WORLDCOMP’s proceedings) to his puppet who publicizes WORLDCOMP and also defends it at various forums, using fake/anonymous names. The puppet uses fake names and defames other conferences/people to divert traffic to WORLDCOMP. That is, the puppet does all his best to get a maximum number of papers published at WORLDCOMP to get more money into his (and Prof. Hamid Arabnia’s) pockets. Monte Carlo Resort (the venue of WORLDCOMP until 2012) has refused to provide the venue for WORLDCOMP’13 because of the fears of their image being tarnished due to WORLDCOMP’s fraudulent activities. WORLDCOMP will not be held after 2013. The paper submission deadline for WORLDCOMP’13 is March 18, 2013 (it will be extended many times, as usual) but still there are no committee members, no reviewers, and there is no conference Chairman. The only contact details available on WORLDCOMP’s website is just an email address! What bothers us the most is that Prof. Hamid Arabnia never posted an apology for the damage he has done to the research community. He is still trying to defend WORLDCOMP. Let us make a direct request to him: publish all reviews for all the papers (after blocking identifiable details) since 2000 conference. Reveal the names and affiliations of all the reviewers (for each year) and how many papers each reviewer had reviewed on average. We also request him to look at the Open Challenge at http://sites.google.com/site/dumpconf We think that it is our professional obligation to spread this message to alert the computer science community. Sorry for posting to multiple lists. Spreading the word is the only way to stop this bogus conference. Please forward this message to other mailing lists and people. We are shocked with Prof. Hamid Arabnia and his puppet’s activities http://worldcomp-fake-bogus.blogspot.com Search Google using the keywords “worldcomp, fake” for additional links. Sincerely, Chris

1 0

ARiSVe 2013: submission deadline extension to April 8, 2013
by Andrei Paskevich 11 Mar '13

11 Mar '13

Call For Papers 1st International Workshop on Automated Reasoning in Software Verification *** EXTENDED DEADLINE *** http://arisve2013.lri.fr Monday, June 10, 2013 Lake Placid, NY, USA Affiliated with CADE-24 Aims and Scope The focus of the workshop is application of automated reasoning in the context of software verification, and, more generally, automation in software verification. Relevant topics include but are not limited to: * specifics of verification-related automated reasoning tasks; * efficient translation of high-level verification conditions to logical languages of automated reasoning tools; * handling of the prover's feedback: proofs, models, answer terms; * logical theories of interest for program verification, decision procedures, integration into existing ATP and SMT systems; * combination of automated and user-assisted verification; * tool presentations, tool comparisons, and benchmarks; * experience reports on verification of complex algorithms and real-life software with the use of automated reasoning tools. Paper Submission and Proceedings All submissions are reviewed by the program committee. We expect that one author of every accepted paper will present their work at the workshop. Submissions are limited to 6-12 pages in the LaTeX EasyChair format easychair.cls (http://www.easychair.org/publications/easychair.zip) Technical details may be included in an appendix to be read at the reviewers' discretion. Tool presentation papers and experience reports are welcome. Papers should be submitted through EasyChair, at http://www.easychair.org/conferences/?conf=arisve2013 Submissions must be in PDF format. Electronic version of proceedings will be freely distributed from the workshop web site. Important Dates * Abstract submission deadline: April 3, 2013 (EXTENDED) * Submission deadline: April 8, 2013 (EXTENDED) * Notification: April 30, 2013 * Camera ready versions due: May 10, 2013 * Workshop: June 10, 2013 Invited Speaker K. Rustan M. Leino (Microsoft Research) Program Committee * June Andronick (NICTA) * Clark Barrett (New York University) * Ernie Cohen (Microsoft Corp.) * Loïc Correnson (CEA) * Gidon Ernst (Ausburg University) * Jean-Christophe Filliâtre (CNRS), co-chair * Alwyn Goodloe (NASA) * Matthias Horbach (Koblenz University) * Vladimir Klebanov (Karlsruhe Institute of Technology) * Konstantin Korovin (The University of Manchester) * Rosemary Monahan (National University of Ireland) * Andrei Paskevich (Université Paris-Sud), co-chair * Silvio Ranise (Fondazione Bruno Kessler)

1 0

Job Opportunity: Data Scientist/Haskell programmer at madvertise Mobile Advertising (Berlin)
by Andreas Granström 08 Mar '13

08 Mar '13

Hello all, We are an advanced stage start-up company (raising a C round, currently just under 100 people), and we are looking for an addition to our Data Science/Algorithm development team. At Madvertise we work on very hard problems in computational advertising. Our team has developed and has maintained ownership of the 'Decision Engine', the core optimization component of our ad server. It is written completely in Haskell and has been running in production for several months now with impressive results. The position obviously includes day-to-day Haskell programming, but the ability and willingness to do applied research in the field of computational advertising is also required. To quote from the official position description (linked below): "Although every person in the team has their strengths, everyone needs to be prepared to participate in the entire R&D chain: from research to prototyping and implementation, down to deployment into production. Besides this we are also expected to provide other departments with technical expertise on analysis-heavy topics, e.g., fraud detection." For more detailed information regarding the position in terms of requirements and responsibilities, please visit http://madvertise.com/data-scientist-fm-berlin If you have any questions, feel free to contact me directly, or email our HR team at careers (at) madvertise (dot) com. Best Regards, Andreas Granström

1 0

Newbie
by Dan Lior 08 Mar '13

08 Mar '13

Hello, I'm new to Haskell and this is my first post to this forum. A few questions right off the bat: 1) Is this the right place for newbies to post questions about Haskell? 2) Is there a FAQ for Haskell questions? 3) Are there any active Haskell user groups in the Chicago area? A more technical question: I'm messing around with basic Haskell examples on eclipse using the FP add-on running over GHC. The following code works: pred :: Int -> Int pred 0 = 0 pred n = n-1 The following code doesn't: pred :: Int -> Int pred 0 = 0 pred n+1 = n Does anyone know why this might be? "Thanks" and "I apologize" in advance. dan

4 3

ICTAC 2013: The submission deadline has been extended to 22 March 2013.
by Huibiao Zhu 08 Mar '13

08 Mar '13

*************************************************************** ICTAC 2013 10th International Colloquium on Theoretical Aspects of Computing *** Call For Papers *** The submission deadline has been extended to 22 March 2013. September 4-6, 2013 Shanghai, China http://ictac2013.ecnu.edu.cn/ *************************************************************** ICTAC 2013 is the 10th International Colloquium on Theoretical Aspects of Computing, the latest in a series founded by the International Institute for Software Technology of the United Nations University (UNU-IIST). ICTAC 2013 will bring together practitioners and researchers from academia, industry and government to present research and to exchange ideas and experience addressing challenges in both theoretical aspects of computing and in the exploitation of theory through methods and tools for system development. The other main purpose is to promote cooperation in research and education between participants and their institutions, from developing and industrial countries, as in the mandate of the United Nations University. THEMES AND TOPICS OF PAPERS ICTAC 2013 calls for regular research papers on theories of computation and programming, foundations of software engineering, and on formal techniques in software design and verification; short papers on recent work or proposals of challenges in new programming paradigms such as Cyber-Physical Systems, Cloud Computing and Social Networks; and papers about tools that support formal techniques for software modeling, system design and verification. The topical areas of the conference include, but not limited to Automata theory and formal languages; Principles and semantics of programming languages; Theories of concurrency, mobility and reconfiguration; Logics and their applications; Software architectures and their models, refinement and verification; Relationship between software requirements, models and code; Program static and dynamic analysis and verification; Software specification, refinement, verification and testing; Model checking and theorem proving; Models of object and component systems; Coordination and feature interaction; Integration of theories, formal methods and tools for engineering computing systems; Service-oriented architectures: models and development methods; Models of concurrency, security, and mobility; Theory of distributed, grid and cloud computing; Real-time, embedded, hybrid and cyber-physical systems; Type and category theory in computer science; Models for learning and education; Case studies, theories, tools and experiments of verified systems; Domain-specific modeling and technology: examples, frameworks and experience. Challenges and foundations in the environmental modeling and monitoring, healthcare, and disaster management. PUBLICATION AND SUBMISSION As for the past editions, it is the plan that the proceedings of ICTAC 2013 will be published by Springer in the series Lecture Notes in Computer Science (LNCS) and will be available at the colloquium. A special issue of a journal with extended version of selected papers from ICTAC 2013 is under negotiation. Submissions to the colloquium must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. Submissions can be Regular Papers, Short Papers or Tool Papers. Short papers can present recent or ongoing work or discuss new ideas which are at an early stage of development and have not been thoroughly evaluated yet. Papers should be written in English. Regular Papers should not exceed 18 pages and Short Papers and tool papers should be between 5 and 10 pages in LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). Papers must be submitted at http://www.easychair.org/conferences/?conf=ictac2013. Short papers and tool papers must contain clear reference to the background theories and techniques; and a tool paper must further provide a link to a webpage that contains a tutorial and demo of the tool. All queries should be sent to the e-mail address ictac2013(a)sei.ecnu.edu.cn. MPORTANT DATES (NEW) Paper submission deadline: 22 March 2013 Paper Accept/Reject Notification: 3 May 2013 Final paper submission: 17 May 2013 Conference dates: 4 --- 6 September 2013 ASSOCIATED EVENTS Festschrift Symposium in Honor of Prof. Jifeng He: 01-03 September 2013 Summer School on Software Engineering: 26-30 August 2013 INVITED SPEAKERS Luca Cardelli, Microsoft Research Cambridge, UK Jifeng He, East China Normal University, China Marta Kwiatkowska, University of Oxford, UK CONFERENCE CHAIRS Zhou Chaochen, Software Institute, Chinese Academy of Sciences, China Peter Haddawy, UNU-IIST, Macau SAR, China Bill Roscoe, University of Oxford, UK PROGRAMME CHAIRS Zhiming Liu, UNU-IIST, Macau SAR, China Jim Woodcock, University of York, UK Huibiao Zhu, East China Normal University, China PROGRAMME COMMITTEE Farhad Arbab (CWI and Leiden University, The Netherlands) Michael Butler (University of Southampton, UK) Ana Cavalcanti (University of York, UK) Zhenbang Chen (National University of Defense Technology, China) Van Hung Dang (University of Engineering and Technology, Vietnam) Thao Dang (VERIMAG, France) David Deharbe (Universidade Federal do Rio Grande do Norte, Brasil) Jinsong Dong (National University of Singapore, Singapore) Meenakshi Dsouza (IIIT, India) Zhenhua Duan (Xidian University, China) John Fitzgerald (Newcastle University, UK) Martin Fraenzle (Carl von Ossietzky University Oldenburg, Germany) Marcelo Frias (Instituto Tecnologico Buenos Aires, Argentina) Lindsay Groves (Victoria University of Wellington, New Zealand) Kim Guldstrand Larsen (Aalborg University, Denmark) Ian J. Hayes (University of Queensland, Australia) Zhenjiang Hu (NII, Japan) Lei Ju (Shandong University, China) Daniel Kroening (Oxford University, UK) Martin Leucker (University of Lübeck, Germany) Zhiming Liu (UNU-IIST, Macau SAR, China) Annabelle Mciver (Macquarie University, Australia) Dominique Mery (Université de Lorraine, France) Tobias Nipkow (Technische Universit?t München, Germany) Paritosh Pandya (TIFR, India) Jun Pang (University of Luxembourg, Luxembourg) Geguang Pu (East China Normal University, China) Shengchao Qin (Teesside University, UK) Zongyan Qiu (Peking University, China) Abhik Roychoudhury (National University of Singapore, Singapore) Augusto Sampaio (Federal university of Pernambuco, Brasil) Ondrej Sery (University of Lugano, Switzerland) Natarajan Shankar (SRI, US) Marjan Sirjani (Reykjavik University, Iceland) Andrzej Tarlecki (Warsaw University, Poland) Mark Utting (The University of Waikato, New Zealand) Tarmo Uustalu (Tallinn University of Technology, Estonia) Farn Wang (National Taiwan University, Taiwan) Burkhart Wolff (University Paris-Sud, France) Jim Woodcock (University of York, UK) Wang Yi (Uppsala University, Sweden) Naijun Zhan (Chinese Academy of Sciences, China) Jianjun Zhao (Shanghai Jiao Tong University, China) Jianhua Zhao (Nanjing University, China) Huibiao Zhu (East China Normal University, China)

1 0

[Announcement] New release of hArduino: Control your Arduino board from Haskell
by Levent Erkok 07 Mar '13

07 Mar '13

A new release (v0.5) of hArduno is out, now supporting servo-motors, shift-registers, seven-segment displays, and distance sensors. Comes with a bunch of examples to play around with: http://leventerkok.github.com/hArduino/ On Hackage: http://hackage.haskell.org/package/hArduino -Levent.

1 0

Haskell Weekly News: Issue 261
by Daniel Santa Cruz 07 Mar '13

07 Mar '13

Welcome to issue 261 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of February 24 to March 02, 2013. Quotes of the Week * EvilMachine: I always picture some poor mutant guy whose every body part looks alike in the deepest depths of the dark ages going to the doc, and being told he has ‚monomorphism‚. * pmk: the last time i asked GHC to compile a function with forty (.)'s in a row, it took over an hour Top Reddit Stories * Some draft chapters of "Parallel and Concurrent Programming in Haskell" available online for comment Domain: self.haskell, Score: 79, Comments: 40 On Reddit: [1] http://goo.gl/emvnI Original: [2] http://goo.gl/emvnI * Hulk: A Haskell IRC server - Nice example of real world monad without IO Domain: chrisdone.com, Score: 62, Comments: 18 On Reddit: [3] http://goo.gl/CR986 Original: [4] http://goo.gl/RhjG6 * Hole-driven Haskell Domain: matthew.brecknell.net, Score: 59, Comments: 52 On Reddit: [5] http://goo.gl/5ctnJ Original: [6] http://goo.gl/NqJVi * Chasing a Space Leak in Shake: Profiling, reduction, digging thru stacks Domain: neilmitchell.blogspot.com, Score: 46, Comments: 11 On Reddit: [7] http://goo.gl/cO86j Original: [8] http://goo.gl/v09x6 * Haskell patterns ad nauseam Domain: yaxu.org, Score: 39, Comments: 2 On Reddit: [9] http://goo.gl/dapAz Original: [10] http://goo.gl/hPW6y * Cross Compiling for iOS with GHC Domain: hackage.haskell.org, Score: 35, Comments: 18 On Reddit: [11] http://goo.gl/3uzjR Original: [12] http://goo.gl/Kw0Pe * From Set Theory to Type Theory Domain: golem.ph.utexas.edu, Score: 35, Comments: 8 On Reddit: [13] http://goo.gl/HaPN4 Original: [14] http://goo.gl/LUi5f * EclipseFP 2.5.0 released: cabal-dev support, import cleaning, and more Domain: jpmoresmau.blogspot.fr, Score: 31, Comments: 0 On Reddit: [15] http://goo.gl/lR6Tc Original: [16] http://goo.gl/JJzBz * Michael Snoyman's overview of the new conduit 1.0, on School of Haskell Domain: haskell.fpcomplete.com, Score: 31, Comments: 11 On Reddit: [17] http://goo.gl/aFbw1 Original: [18] http://goo.gl/ObEHA * How is Haskell tackling the multicore problem? - Simon Marlow Domain: youtube.com, Score: 28, Comments: 5 On Reddit: [19] http://goo.gl/qOKlJ Original: [20] http://goo.gl/HVddu * Generics and Protocol Buffers... now on Hackage Domain: breaks.for.alienz.org, Score: 28, Comments: 5 On Reddit: [21] http://goo.gl/WqIyn Original: [22] http://goo.gl/J9NKB * Demonstrating tidal - haskell music patterns in action Domain: blog.lurk.org, Score: 24, Comments: 5 On Reddit: [23] http://goo.gl/4ddqI Original: [24] http://goo.gl/Ift8y * GHC iOS Packages Domain: github.com, Score: 23, Comments: 5 On Reddit: [25] http://goo.gl/PONjI Original: [26] http://goo.gl/6D3Gz * SoH tutorial: a regular expression matcher using continuations Domain: haskell.fpcomplete.com, Score: 22, Comments: 4 On Reddit: [27] http://goo.gl/toQpy Original: [28] http://goo.gl/BZ1xI * [nyc-haskell] Greg Wright - A Purely Symbolic Effort in Mathematics Domain: vimeo.com, Score: 22, Comments: 6 On Reddit: [29] http://goo.gl/jNybI Original: [30] http://goo.gl/Q8pq8 * ANN: clckwrks 0.16 Haskell blog/CMS platform released. Includes a screencast demonstrating clckwrks features. Domain: clckwrks.com, Score: 20, Comments: 2 On Reddit: [31] http://goo.gl/Tp92p Original: [32] http://goo.gl/zV7Sj Top StackOverflow Questions * Do Hask or Agda have equalisers? votes: 23, answers: 2 Read on SO: [33] http://goo.gl/k74C9 * Prove idempotency of type-level disjunction votes: 17, answers: 2 Read on SO: [34] http://goo.gl/wsFUL * Internal representation of Haskell lists? votes: 16, answers: 2 Read on SO: [35] http://goo.gl/TCGDk * GHC Generating Redundant Core Operations votes: 15, answers: 1 Read on SO: [36] http://goo.gl/d9zWP * eliminating repetition in cabal files votes: 14, answers: 0 Read on SO: [37] http://goo.gl/2StJ9 * Translate from monad to applicative votes: 12, answers: 3 Read on SO: [38] http://goo.gl/IbSUi * Memoizing multiplication votes: 10, answers: 2 Read on SO: [39] http://goo.gl/EXvUk * Most efficient way to seek around in a large file votes: 9, answers: 1 Read on SO: [40] http://goo.gl/C9FGp * Does Haskell optimizer utilize memoization for repeated function calls in a scope? votes: 9, answers: 3 Read on SO: [41] http://goo.gl/3qDPQ * Existential type in higher order function votes: 9, answers: 1 Read on SO: [42] http://goo.gl/YfalJ * Haskell `ncurses` library votes: 9, answers: 2 Read on SO: [43] http://goo.gl/w7vKf Until next time, +Daniel Santa Cruz References 1. http://www.reddit.com/r/haskell/comments/195app/some_draft_chapters_of_para… 2. http://www.reddit.com/r/haskell/comments/195app/some_draft_chapters_of_para… 3. http://chrisdone.com/posts/hulk-haskell-irc-server 4. http://www.reddit.com/r/haskell/comments/194ngx/hulk_a_haskell_irc_server_n… 5. http://matthew.brecknell.net/posts/2013/02/26/hole-driven-haskell/ 6. http://www.reddit.com/r/haskell/comments/19aj9t/holedriven_haskell/ 7. http://neilmitchell.blogspot.com/2013/02/chasing-space-leak-in-shake.html 8. http://www.reddit.com/r/haskell/comments/197ax4/chasing_a_space_leak_in_sha… 9. http://yaxu.org/haskell-patterns-ad-nauseam/ 10. http://www.reddit.com/r/haskell/comments/19e2ln/haskell_patterns_ad_nauseam/ 11. http://hackage.haskell.org/trac/ghc/wiki/Building/CrossCompiling/iOS 12. http://www.reddit.com/r/haskell/comments/19cq83/cross_compiling_for_ios_wit… 13. http://golem.ph.utexas.edu/category/2013/01/from_set_theory_to_type_theory.… 14. http://www.reddit.com/r/haskell/comments/19igl8/from_set_theory_to_type_the… 15. http://jpmoresmau.blogspot.fr/2013/02/eclipsefp-250-released.html 16. http://www.reddit.com/r/haskell/comments/199smc/eclipsefp_250_released_caba… 17. https://haskell.fpcomplete.com/school/pick-of-the-week/conduit-overview 18. http://www.reddit.com/r/haskell/comments/19akp3/michael_snoymans_overview_o… 19. https://www.youtube.com/watch?v=Mu6JjZsIdu8 20. http://www.reddit.com/r/haskell/comments/19eh7e/how_is_haskell_tackling_the… 21. http://breaks.for.alienz.org/blog/2013/02/28/generics-and-protocol-buffers-… 22. http://www.reddit.com/r/haskell/comments/19et3i/generics_and_protocol_buffe… 23. http://blog.lurk.org/demonstrating-tidal/ 24. http://www.reddit.com/r/haskell/comments/19jq16/demonstrating_tidal_haskell… 25. https://github.com/kaoskorobase/ghc-ios-cabal-scripts 26. http://www.reddit.com/r/haskell/comments/19gufd/ghc_ios_packages/ 27. https://haskell.fpcomplete.com/user/pbv/a-regular-expression-matcher 28. http://www.reddit.com/r/haskell/comments/199523/soh_tutorial_a_regular_expr… 29. https://vimeo.com/60737699 30. http://www.reddit.com/r/haskell/comments/19fp85/nychaskell_greg_wright_a_pu… 31. http://clckwrks.com/page/view-page-slug/10/ann--clckwrks-0-16---now-built-w… 32. http://www.reddit.com/r/haskell/comments/19a393/ann_clckwrks_016_haskell_bl… 33. http://stackoverflow.com/questions/15047775/do-hask-or-agda-have-equalisers 34. http://stackoverflow.com/questions/15180557/prove-idempotency-of-type-level… 35. http://stackoverflow.com/questions/15063115/internal-representation-of-hask… 36. http://stackoverflow.com/questions/15095902/ghc-generating-redundant-core-o… 37. http://stackoverflow.com/questions/15179316/eliminating-repetition-in-cabal… 38. http://stackoverflow.com/questions/15123552/translate-from-monad-to-applica… 39. http://stackoverflow.com/questions/15080399/memoizing-multiplication 40. http://stackoverflow.com/questions/15052905/most-efficient-way-to-seek-arou… 41. http://stackoverflow.com/questions/15084162/does-haskell-optimizer-utilize-… 42. http://stackoverflow.com/questions/15125522/existential-type-in-higher-orde… 43. http://stackoverflow.com/questions/15176015/haskell-ncurses-library 44. https://plus.google.com/105107667630152149014/about

1 0

OdHac: second call for participation
by Roman Cheplyaka 06 Mar '13

06 Mar '13

------------------------------------------------------------------------ OdHac International Haskell Hackathon May 3-5, 2013 Odessa, Ukraine http://haskell.org/haskellwiki/OdHac Co-organized with Provectus IT ------------------------------------------------------------------------ The international Haskell hackathon in Odessa is just two months away! To attend, please register at http://bit.ly/OdHacReg. ## Projects A big idea of this Hackathon is to concentrate the effort around a few important and established projects. Although participants are free to work on their own projects, it's more fun to work together! So far we've got two great projects: Hakyll and Fay http://www.haskell.org/haskellwiki/OdHac/Projects#Hakyll http://www.haskell.org/haskellwiki/OdHac/Projects#Fay Feel free to add new projects to the wiki! One project we'd love to see represented, because of its enormous value to the community, is Cabal. So far several core Cabal hackers have expressed willingness to offer help via IRC, but it would be great to have a Cabal expert on site. If you can coordinate the effort around Cabal and answer questions, and you're planning to come — please get in touch with me. ## Accommodation The Hackathon dates overlap with a series of holidays in Ukraine and neighbour countries, and Odessa is a popular tourist destination. So book early! We offer an accommodation program to make it simple for you: http://www.haskell.org/haskellwiki/OdHac/Accommodation

1 0

Research Assistantship at Oxford on Bidirectional Transformations
by Jeremy.Gibbons＠cs.ox.ac.uk 05 Mar '13

05 Mar '13

Postdoctoral Research Assistant "A THEORY OF LEAST-CHANGE FOR BIDIRECTIONAL TRANSFORMATIONS" Department of Computer Science, University of Oxford Applications are invited for a Research Fellowship on an EPSRC-funded project "A Theory of Least-Change for Bidirectional Transformations". The project is a collaboration between Professor Jeremy Gibbons in the Department of Computer Science, University of Oxford, and Dr Perdita Stevens and Dr James Cheney in the School of Informatics, University of Edinburgh. The project concerns bidirectional transformations, which are a means of maintaining consistency between multiple information sources: when one source is edited, the others may need updating to restore consistency. There are applications in model-driven engineering, database design, and program development, among others. A bidirectional transformation can be implemented in terms of several unidirectional restoring functions, one per source; but this duplicates information, wasting effort and risking inconsistencies. Bidirectional transformation languages allow one to describe the consistency relationship and the restoring functions with a single declarative specification. Our aim in this project is to study the principle of least change: that a bidirectional transformation should not make unnecessary or unnecessarily large changes when it re-establishes consistency. The primary focus of the Oxford contribution is the development of a theory of alignment for bidirectional transformations on structured data, especially in the case of non-free datatypes such as associative lists and graphs. We conjecture that the mathematics of container datatypes and combinatorial species will be particularly relevant. The Fellowship will be under the supervision of Professor Jeremy Gibbons at Oxford, and is available for three years from 31st August 2013 (or any time before that). The salary is on a standard scale, from £29,541 to £36,298 per annum. For further details, including a job description and information on how to apply, please see the webpage (http://www.cs.ox.ac.uk/news/619-full.html) If you have any questions, please write to me (jeremy.gibbons(a)cs.ox.ac.uk) Please pass this advert on to anyone you think may be interested. Jeremy Jeremy.Gibbons(a)cs.ox.ac.uk Oxford University Department of Computer Science, Wolfson Building, Parks Road, Oxford OX1 3QD, UK. +44 1865 283521 http://www.cs.ox.ac.uk/people/jeremy.gibbons/

1 0