July 2013 - 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

CFP: Term and Graph rewriting, special issue of MSCS
by Rachid Echahed 13 Feb '14

13 Feb '14

-------------------------------------------------------------------------- First Call for Papers Special Issue of Mathematical Structures in Computer Science (MSCS) on "TERM and GRAPH Rewriting" -------------------------------------------------------------------------- Scope -------------------------------------------------------------------------- Rewriting techniques constitute a foundational theory of computing science. They are being investigated for several structures such as lambda-terms, first-order terms or graphs and have been successfully used in many areas such as programming languages, automated reasoning, program verification, security, etc. This is witnessed by the leading international events ICGT, RTA or TLCA among others. During the last decade, a particular interest has been devoted to the study of the impact of shared structures in term and graph rewriting through the international editions of TERMGRAPH series of workshops. Sharing is indeed ubiquitous in several research areas, for instance: the modelling of first- and higher-order term rewriting by (acyclic or cyclic) graph rewriting, the modelling of biological or chemical abstract machines, the implementation techniques of programming languages. Term and graph rewriting are also used in automated theorem proving and symbolic computation systems working on shared structures... This special issue is devoted to recent developments in all aspects of TERM and GRAPH rewriting. This includes (but is not limited to): term rewriting, graph transformation, proof methods, programming languages, infinitary rewriting, rewrite strategies, semantics, properties of rewriting ... -------------------------------------------------------------------------- Submissions -------------------------------------------------------------------------- Submitted papers must be original and not submitted for publication elsewhere, and will be subject to the standard journal refereeing process of the Mathematical Structures in Computer Science (MSCS) journal. Submissions should be in pdf format following the MSCS instruction for contributors (http://assets.cambridge.org/MSC/MSC_ifc.pdf) and should be submitted electronically via the following easy-chair web site: https://www.easychair.org/conferences/?conf=mscsrewriting2012 -------------------------------------------------------------------------- Important Dates -------------------------------------------------------------------------- January 20, 2012 : Abstract submission February 20, 2012: Paper submission June 15, 2012 : Notification of acceptance -------------------------------------------------------------------------- Guest Editor: -------------------------------------------------------------------------- Rachid Echahed, CNRS LIG Lab., Grenoble, France echahed(a)imag.fr --------------------------------------------------------------------------

1 8

2nd CFP: SCSS 2013
by Temur Kutsia 18 Sep '13

18 Sep '13

[Please post - apologies for multiple copies.] Second Call for Papers SCSS 2013 Symbolic Computation in Software Science 5th International Symposium Castle of Hagenberg, Austria, July 5-6, 2013 Research Institute for Symbolic Computation (RISC) Johannes Kepler University Linz http://www.risc.jku.at/conferences/scss2013/ Scope -------- The purpose of SCSS 2013 is to promote research on theoretical and practical aspects of symbolic computation in software science. The symposium provides a forum for active dialog between researchers from several fields of computer algebra, algebraic geometry, algorithmic combinatorics, computational logic, and software analysis and verification. SCSS 2013 solicits both regular and tool papers on all aspects of symbolic computation and their applications in software science. The topics of the symposium include, but are not limited to the following: - automated reasoning - algorithm (program) synthesis and/or verification - formal methods for the analysis of network security - termination analysis and complexity analysis of algorithms (programs) - extraction of specifications from algorithms (programs) - theorem proving methods and techniques - proof carrying code - generation of inductive assertion for algorithm (programs) - algorithm (program) transformations - formalization and computerization of knowledge (maths, medicine, economy, etc.) - component-based programming - computational origami - query languages (in particular for XML documents) - semantic web and cloud computing Invited Speakers ---------------- Bruno Buchberger (RISC, Johannes Kepler University Linz, Austria) Joel Ouaknine (Oxford University, UK) Program Chair -------------- Laura Kovacs (Vienna University of Technology, Austria and Chalmers University of Technology, Sweden) Program Committee ------------------ María Alpuente (Technical University of Valencia, Spain) Serge Autexier (DFKI, Germany) Nikolaj Bjorner (Microsoft Research) Adel Bouhoula (Higher School of Communications of Tunis, Tunisia) Iliano Cervesato (Carnegie Mellon University — Qatar Campus) Horatiu Cirstea (Loria, France) Jürgen Giesl (RWTH Aachen, Germany) Tetsuo Ida (University of Tsukuba, Japan) Paul Jackson (University of Edinburgh, UK) Tudor Jebelean (RISC, Johannes Kepler University Linz, Austria) Cezary Kaliszyk (University of Innsbruck, Austria) Fairouz Kamareddine (Heriot-Watt University, UK) Temur Kutsia (RISC, Johannes Kepler University Linz, Austria) Stephan Merz (INRIA Lorraine, France) Ali Mili (New Jersey Institute of Technology, USA) Yasuhiko Minamide (University of Tsukuba, Japan) Pierre-Etienne Moreau (INRIA-LORIA Nancy, France) André Platzer (Carnegie Mellon University, USA) Stefan Ratschan (Czech Academy of Sciences) Rachid Rebiha (University of Lugano, Switzerland and IC Unicamp, Brazil) Enric Rodríguez Carbonell (Technical University of Catalonia, Spain) Sorin Stratulat (University of Lorraine, Metz, France) Thomas Sturm (Max Planck Institute for Informatics, Germany) Symposium Chair --------------- Temur Kutsia (RISC, Johannes Kepler University Linz, Austria) Important Dates --------------- April 30, 2013: Abstract submission deadline May 3, 2013: Paper submission deadline June 3, 2013: Notification of acceptance June 17, 2013: Camera-ready copy deadline July 5-6, 2013: SCSS 2013, Castle of Hagenberg, Austria Submission ---------- Submission is via EasyChair: https://www.easychair.org/conferences/?conf=scss2013. Submissions are invited in two categories: regular research papers and tool papers. - Regular research papers must not exceed 12 pages in the EasyChair Class format, with up to 3 additional pages for technical appendices. - Tool papers must not exceed 6 pages in the EasyChair Class format. Publication ---------- The proceedings of SCSS 2013 will be published as a RISC technical report. After the symposium, authors of accepted papers at SCSS 2013 will be invited to submit an extended version of their paper to the special issue of the Journal of Symbolic Computation on SCSS. Submitted papers to the JSC special issue will undergo an additional reviewing.

2 1

PADL 2014: Call for Papers
by Matthew Flatt 29 Jul '13

29 Jul '13

Call for Papers =============== 16th International Symposium on Practical Aspects of Declarative Languages (PADL 2014) http://www.ist.unomaha.edu/padl2014 San Diego, California, USA, January 20-21, 2014 Co-located with ACM POPL'14 Conference Description ====================== Declarative languages build on sound theoretical bases to provide attractive frameworks for application development. These languages have been successfully applied to many different real-world situations, ranging from data base management to active networks to software engineering to decision support systems. New developments in theory and implementation have opened up new application areas. At the same time, applications of declarative languages to novel problems raise numerous interesting research issues. Well-known questions include designing for scalability, language extensions for application deployment, and programming environments. Thus, applications drive the progress in the theory and implementation of declarative systems, and benefit from this progress as well. PADL is a forum for researchers and practitioners to present original work emphasizing novel applications and implementation techniques for all forms of declarative concepts, including, functional, logic, constraints, etc. Topics of interest include, but are not limited to: * Innovative applications of declarative languages * Declarative domain-specific languages and applications * Practical applications of theoretical results * New language developments and their impact on applications * Declarative languages and Software Engineering * Evaluation of implementation techniques on practical applications * Practical experiences and industrial applications * Novel uses of declarative languages in the classroom * Practical extensions such as constraint-based, probabilistic, and reactive languages. PADL'14 welcomes new ideas and approaches pertaining to applications and implementation of declarative languages. In this occasion PADL is co-located, as traditionally, with ACM POPL, which will be held immediately following PADL. The symposium will be held in San Diego, California, USA. Important Dates and Submission Guidelines ========================================= Abstract Submission: September 6, 2013 Paper Submission: September 13, 2013 Notification: October 21, 2013 Camera-ready: November 10, 2013 Symposium: January 20-21, 2014 Authors should submit an electronic copy of the full paper in PDF using the Springer LNCS format. The submission will be done through EasyChair conference system. If electronic submission is impossible, please contact the program chairs for information on how to submit hard copies. All submissions must be original work written in English. Submissions must be unpublished and not submitted for publication elsewhere. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. PADL'14 will accept both technical and application papers: * Technical papers must describe original, previously unpublished research results. Technical papers must not exceed 16 pages in Springer LNCS format. * Application papers are a mechanism to present important practical applications of declarative languages that occur in industry or in areas of research other than Computer Science. Application papers will be published in the Springer-Verlag conference proceedings, and will be presented in a separate session. Application papers are expected to describe complex and/or real-world applications that rely on an innovative use of declarative languages. Application descriptions, engineering solutions and real-world experiences (both positive and negative) are solicited. The limit for application papers is 6 pages in Springer LNCS format. Program Committee ================= Matthew Flatt (co-chair), University of Utah, USA Ronald Garcia, University of British Columbia, Canada Hai-Feng Guo (co-chair), University of Nebraska at Omaha, USA Manuel Hermenegildo, Technical University of Madrid, Spain Joohyung Lee, Arizona State University, USA Yuliya Lierler, University of Nebraska at Omaha, USA Sam Lindley, University of Edinburgh, UK Leaf Petersen, Intel, USA Rinus Plasmeijer, Radboud University Nijmegen, Netherlands C.R. Ramakrishnan, Stony Brook University, USA Sukyoung Ryu, Advanced Institute of Science and Technology, Korea Manuel Serrano, INRIA Sophia-Antipolis, France Yi-Dong Shen, Chinese Academy of Sciences, China Tran Cao Son, New Mexico State University, USA Peter Stuckey, University of Melbourne, Australia Peter Thiemann, University of Freiburg, Germany Hans Tompits, Vienna University of Technology, Austria Aaron Turon, Max Plank Institute, Germany David Van Horn, Northeastern University, USA German Vidal, Technical University of Valencia, Spain Contacts ======== For additional information about papers and submissions, please contact the Program Chairs: Matthew Flatt School of Computing, University of Utah Email: mflatt <AT> cs <DOT> utah <DOT> edu Hai-Feng Guo Department of Computer Science, University of Nebraska at Omaha Email: haifengguo <AT> unomaha <DOT> edu With the Cooperation of ======================= The Association for Logic Programming (ALP) ACM SIGPLAN ===================================

1 0

Strathclyde: Lecturer/Senior Lecturer
by Conor McBride 29 Jul '13

29 Jul '13

The Department of Computer and Information Sciences within the University of Strathclyde seeks to appoint a Lecturer or Senior Lecturer to enhance the internationally leading Mathematically Structured Programming (MSP) research group. The MSP group’s vision is to use mathematics to understand the nature of computation, and to turn that understanding into the next generation of programming languages, and the successful applicant will be expected to further develop the Department’s reputation for excellence in this area. You will have ambitious academic aspirations and an understanding of how to bring in the grant income required to fund those aspirations. You will also be expected to contribute to the Department’s teaching activities in the areas of Computer Science and Software Engineering. For consideration at Lecturer level you will demonstrate significant promise in your research discipline as evidenced by a publications record in high quality venues. To be considered at Senior Lecturer level you will have a strong record of achievement in their career to date including success in securing external funding and experience of teaching undergraduate and/or postgraduate students. Research Starter Grant: The Faculty of Science offers a Research Starter Grant to all new full-time, non-professorial, academic staff within the Faculty. The Grant may be used for any purpose that assists staff to establish their Strathclyde research career and to assist in attracting additional funding for research from external sources. Any grant awarded will be to a maximum of £10,000, and the planned expenditure of the award is normally for a period of 18 months. For further information contact Prof Neil Ghani or Dr Conor McBride

1 0

ETAPS 2014 first call for papers
by Tarmo Uustalu 24 Jul '13

24 Jul '13

[We apologise for multiple copies.] ****************************************************************** FIRST CALL FOR PAPERS: ETAPS 2014 17th European Joint Conferences on Theory And Practice of Software Grenoble, France 5-13 April 2014 http://www.etaps.org/2014 ****************************************************************** -- ABOUT ETAPS -- ETAPS is the primary European forum for academic and industrial researchers working on topics relating to software science. ETAPS, established in 1998, is a confederation of six main annual conferences, accompanied by satellite workshops. ETAPS 2014 is the seventeenth event in the series. -- MAIN CONFERENCES (7-11 April) -- * CC: Compiler Construction * ESOP: European Symposium on Programming * FASE: Fundamental Approaches to Software Engineering * FOSSACS: Foundations of Software Science and Computation Structures * POST: Principles of Security and Trust * TACAS: Tools and Algorithms for the Construction and Analysis of Systems TACAS '14 hosts the 3rd Competition on Software Verification (SV-COMP). -- INVITED SPEAKERS -- * Robert Harper (Carnegie Mellon University, US) * John Launchbury (Galois, US) * Benoit Dupont de Dinechin (Kalray, France) * Maurice Herlihy (Brown University, US) * Christel Baier (Technical University of Dresden, Germany) * Petr Jancar (Technical Univ of Ostrava, Czech Republic) * David Mazieres (Stanford University, US) * Orna Kupferman (Hebrew University Jerusalem, Israel) -- IMPORTANT DATES -- * 4 October 2013: Submission deadline for abstracts (strict) * 11 October 2013: Submission deadline for full papers (strict) * 20 December 2013: Notification of acceptance * 17 January 2014: Camera-ready versions due ESOP and FoSSaCS will use a rebuttal (author response) phase. -- GENERAL SUBMISSION INFORMATION -- ETAPS conferences accept two types of contributions: research papers and tool demonstration papers. Both types will appear in the proceedings and have presentations during the conference. (TACAS has more categories, see below.) A condition of submission is that, if the submission is accepted, one of the authors attends the conference to give the presentation. Submitted papers must be in English presenting original research. They must be unpublished and not submitted for publication elsewhere. In particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden. The proceedings will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline of Springer's Lecture Notes in Computer Science series. Papers must follow the formatting guidelines specified by Springer at the URL http://www.springer.de/comp/lncs/authors.html and be submitted electronically in pdf through the Easychair author interface of the respective conference. Submissions not adhering to the specified format and length may be rejected immediately. - Research papers Different ETAPS 2014 conferences have different page limits. Specifically, FASE, FOSSACS and TACAS have a page limit of 15 pages, whereas CC, ESOP and POST allow at most 20 pages. Additional material intended for the referees but not for publication in the final version - for example, details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. ETAPS referees are at liberty to ignore appendices and papers must be understandable without them. TACAS solicits not only regular research papers, but also case study papers. - Tool demonstration papers Submissions should consist of two parts: * The first part, at most 4 pages, should describe the tool presented. Please include the URL of the tool (if available) and provide information that illustrates the maturity and robustness of the tool. (This part will be included in the proceedings.) * The second part, at most 6 pages, should explain how the demonstration will be carried out and what it will show, including screen dumps and examples. (This part will be not be included in the proceedings, but will be evaluated.) ESOP and FOSSACS do not accept tool demonstration papers. In addition to tool demonstration papers (max 6 pages in their case), TACAS solicits also regular tool papers (max 15 pages) adhering to specific instructions about content and organization. -- SATELLITE EVENTS (5-6 April, 12-13 April) -- Around 20 satellite workshops will take place before and after the main conferences. In addition, on 6 April, some tutorials on topics of wide interest will be offered. -- HOST CITY -- Located in the southeastern part of France, Grenoble is considered as the capital of the Alps. Grenoble is surrounded by nature and high mountains: down the Alps, Grenoble is the meeting point of two important rivers, Drac and Isere. Grenoble has important historical and gastronomic heritages. Leisure activities in breathtaking nature are easily organizable and within short-distance. Grenoble is also a major scientific center in Europe dedicated to high-tech technologies, e.g., nano, micro, bio, and information technologies. -- HOST INSTITUTION -- The event is organized by Universite Joseph Fourier. Located at the heart of the Alps, in outstanding scientific and natural surroundings, the Universite Joseph Fourier in Grenoble is a leading University of Science, Technology and Health. -- ORGANIZERS * General chair: Saddek Bensalem * Conferences chair: Yassine Lakhnech * Workshops chair: Axel Legay * Publicity chair: Ylies Falcone * Finance chair: Nicolas Halbwachs * Web site chair: Marius Bozga -- FURTHER INFORMATION -- Please do not hesitate to contact the organizers at etaps2014.organization(a)imag.fr.

1 0

[ANN] Initial release of the threepenny-gui library, version 0.1.0.0
by Heinrich Apfelmus 21 Jul '13

21 Jul '13

Dear Haskellers, And the shark, he has teeth, And he wears them in (his) face. And Macheath, he has a knife, (But) yes the knife, no-one sees. After an obligatory cryptical quotation from a famous writer, I am pleased to announce the first public release of *threepenny-gui*, a cheap and simple library to satisfy your immediate GUI needs in Haskell. Want to write a small GUI thing but forgot to sacrifice to the giant rubber duck in the sky before trying to install wxHaskell or Gtk2Hs? Then this library is for you! Threepenny-gui is easy to install (!!) because it uses the web browser as a display. Internally, we implement a small web server that communicates with the browser to display GUI elements. Consequently, you can use HTML and CSS to design the user interface. You can freely manipulate the HTML DOM and handle browser events by writing Haskell code. hackage - http://hackage.haskell.org/package/threepenny-gui examples - https://github.com/HeinrichApfelmus/threepenny-gui#examples source - https://github.com/HeinrichApfelmus/threepenny-gui Many thanks to Daniel Austin for collaborating with me on this project and to Chris Done for implementing the Ji library which is the basis for this effort. On that note, the threepenny API for creating and manipulating GUI elements departs from earlier traditions. Do you like the new look and feel of the API? What do you think could be improved? Try it out and send us your feedback! Best regards, Heinrich Apfelmus -- http://apfelmus.nfshost.com

2 2

Parallel and Concurrent Programming in Haskell (O'Reilly) is out!
by Simon Marlow 21 Jul '13

21 Jul '13

I'm pleased to announce that my book, "Parallel and Concurrent Programming in Haskell" (O'Reilly) is now available in ebook formats (epub, mobi, PDF) from O'Reilly: http://shop.oreilly.com/product/0636920026365.do The print version is due very shortly (1-2 weeks I believe), and can be pre-ordered. The book is also on Amazon, and you can get the Kindle version right now: http://www.amazon.co.uk/Parallel-Concurrent-Programming-Haskell-ebook/dp/B0… The sample code is also up on Hackage: http://hackage.haskell.org/package/parconc-examples There will be a Creative Commons version available soon, but I have some more work to do to make that happen, so bear with me. Many thanks to all those who have helped in one way or another - see the Acknowledgements section for the full list. It's taken a bit longer than I expected, and there have been quite a few late nights along the way. I hope you enjoy the book, and I look forward to hearing all the feedback. Cheers :) Simon

2 1

VMCAI 2014: Call for Papers
by Xavier Rival 20 Jul '13

20 Jul '13

VMCAI 2014 CALL FOR PAPERS 15th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI) January 19-21, 2014, San Diego, USA Co-located with POPL 2014 (January 22-24, 2014) 41th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages SCOPE VMCAI provides a forum for researchers from the communities of Verification, Model Checking, and Abstract Interpretation, facilitating interaction, cross-fertilization, and advancement of hybrid methods that combine these and related areas. The program of VMCAI'14 will consist of refereed research papers and tool demonstrations, as well as invited lectures and tutorials. Research contributions can report new results as well as experimental evaluations and comparisons of existing techniques. Topics include, but are not limited to: program verification, model checking, abstract interpretation and abstract domains, program synthesis, static analysis, type systems, deductive methods, program certification, error diagnosis, program transformation, hybrid and cyberphysical systems. Submissions can address any programming paradigm, including concurrent, constraint, functional, imperative, logic and object-oriented programming. Papers must describe original work, be written and presented in English, and must not overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with refereed proceedings. Proceedings are published by Springer-Verlag as volumes in the Lecture Notes in Computer Science series. IMPORTANT DATES Abstract Submission: September 6, 2013 Paper Submission: September 13, 2013 Acceptance Notification: October 25, 2013 Conference: January 19-21, 2014 (right before POPL) The deadlines are strict and will not be changed. SUBMISSION INSTRUCTIONS The VMCAI 2014 proceedings will be published as a volume in Springer's Lecture Notes in Computer Science series. The page limit for submissions is: 18 pages in Springer's LNCS format. Additional material may be placed in an appendix, to be read at the discretion of the reviewers and to be omitted in the final version. Formatting style files and further guidelines for formatting can be found at http://www.springer.de/comp/lncs/authors.html. Submissions deviating from these guidelines risk summary rejection. Please prepare your submission in accordance with the rules described. PROGRAM COMMITTEE Program Chairs: Kenneth McMillan (MSR, USA & Co-Chair) Xavier Rival (CNRS & ENS Paris & INRIA, France & Co-Chair) Program Committee: Christel Baier, Technische Universität Dresden, Germany Agostino Cortesi, Universita Ca Foscari of Venezia, Italy Jerome Feret, CNRS & ENS & INRIA, France Alexey Gotsman, IMDEA Software Institute, Spain Aarti Gupta, NEC Labs, USA Alan J. Hu, University of British Columbia, Canada Laura Kovacs, Chalmers University of Technology, Sweden Daniel Kroening, Oxford University, UK Mark Marron, MSR, USA Isabella Mastroeni, Universita di Verona, Italy Kenneth McMillan, MSR, USA & Co-Chair Matthew Might, University of Utah, USA David Monniaux, CNRS & University of Grenoble, France Kedar Namjoshi, Bell Labs, USA Peter O'Hearn, University College of London, UK Ruzica Piskac, MPI-SWS, Germany Sylvie Putot, CEA, France Xavier Rival, CNRS & ENS & INRIA, France & Co-Chair Philipp Rümmer, Uppsala University, Sweden Sriram Sankaranarayanan, University of Colorado at Boulder, USA Tachio Terauchi, Nagoya University, Japan Tayssir Touili, CNRS & University of Paris 7, France Eran Yahav, Technion, Israel VMCAI STEERING COMMITTEE Agostino Cortesi, Universita' Ca' Foscari, Venice, Italy Patrick Cousot, Ecole Normale Superieure, France and NYU, USA E. Allen Emerson, University of Texas at Austin, USA Andreas Podelski, University of Freiburg, Germany Thomas W. Reps, University of Wisconsin at Madison, USA David Schmidt, Kansas State University, USA Lenore Zuck, University of Illinois at Chicago, USA

1 0

Haskell Weekly News: Issue 273
by Daniel Santa Cruz 18 Jul '13

18 Jul '13

Welcome to issue 273 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of June 30 to July 13, 2013. Quotes of the Week * monochrom: 8-bit word uses less memory, but if it doesn't have to preserve information, I know how to use 0 bits of memory. * byorgey: you know, servers migrate in the summer to their ancestral breeding grounds * emeijer: It must me said on the other hand compiler writers seem to ignore the existence of formal semantics completely, probably because they don't like greek letters. * byorgey: now we have the pig operator <^(++)^> as well as the robot monkey operator (:[]) * chrisdone: i remember when the internet was black and white and you had to upload web pages back onto the internet when you were done with them * raganwald: Immuteability: The property of functional programmers that prevents them from shutting up about pure functional programming. Top Reddit Stories * On taking the last n elements of a list Domain: joachim-breitner.de, Score: 69, Comments: 37 On Reddit: [1] http://goo.gl/E9hRX Original: [2] http://goo.gl/9Uf74 * Comonads are NOT objects Domain: gelisam.blogspot.ca, Score: 62, Comments: 50 On Reddit: [3] http://goo.gl/tgdhh Original: [4] http://goo.gl/i3EDv * ANNOUNCE: Haste, the Haskell to JS compiler, is now on Hackage Domain: hackage.haskell.org, Score: 60, Comments: 27 On Reddit: [5] http://goo.gl/GTpj5 Original: [6] http://goo.gl/Nzpe7 * Postmodern Haskell and OpenGL: Introducing vinyl-gl Domain: arcadianvisions.com, Score: 57, Comments: 6 On Reddit: [7] http://goo.gl/9mVbl Original: [8] http://goo.gl/Zh5jE * ANNOUNCE: haskell-mode 13.07 (& Survey) Domain: projects.haskell.org, Score: 49, Comments: 18 On Reddit: [9] http://goo.gl/gYU24 Original: [10] http://goo.gl/YSmk4 * Why the world needs Haskell Domain: devalot.com, Score: 46, Comments: 22 On Reddit: [11] http://goo.gl/ekD96 Original: [12] http://goo.gl/LBxRP * Cartesian Closed Comic #20: Weird language Domain: ro-che.info, Score: 42, Comments: 10 On Reddit: [13] http://goo.gl/In50H Original: [14] http://goo.gl/tblYa * Do naming practices hurt Haskell? Domain: self.haskell, Score: 38, Comments: 222 On Reddit: [15] http://goo.gl/mnwO9 Original: [16] http://goo.gl/mnwO9 * ANNOUNCE: [17] http://goo.gl/pp0Vf Domain: self.haskell, Score: 37, Comments: 18 On Reddit: [18] http://goo.gl/MRDO7 Original: [19] http://goo.gl/MRDO7 * Skills Matter : In The Brain of Edsko de Vries: Lazy I/O and Alternatives in Haskell Domain: skillsmatter.com, Score: 37, Comments: 14 On Reddit: [20] http://goo.gl/13zlQ Original: [21] http://goo.gl/QSyTu * Attoparsec tutorial - School of Haskell Domain: fpcomplete.com, Score: 35, Comments: 17 On Reddit: [22] http://goo.gl/Riydl Original: [23] http://goo.gl/P2oiy * FP Haskell Center Beta Released and Beta Accounts Activated Domain: fpcomplete.com, Score: 33, Comments: 7 On Reddit: [24] http://goo.gl/Zs3kU Original: [25] http://goo.gl/vgy5m Top StackOverflow Questions * What advantage does Monad give us over an Applicative? votes: 17, answers: 7 Read on SO: [26] http://goo.gl/4L0gj * Encoding “Less Than” with Haskell votes: 11, answers: 1 Read on SO: [27] http://goo.gl/1Qsvn * Why is factorial calculation much faster in Haskell than in Java votes: 11, answers: 5 Read on SO: [28] http://goo.gl/QTbrl * Haskell: Can typeclasses define types (ala type traits) votes: 10, answers: 2 Read on SO: [29] http://goo.gl/yLSqT * C++ and Haskell codes differs in execution time on different machines votes: 10, answers: 1 Read on SO: [30] http://goo.gl/LRs3k * GHC.Generics or Data.Data? votes: 10, answers: 1 Read on SO: [31] http://goo.gl/yU6Ri * Constraint subset higher-order constraint votes: 9, answers: 1 Read on SO: [32] http://goo.gl/MTTws * How to make catamorphisms work with parameterized/indexed types? votes: 9, answers: 2 Read on SO: [33] http://goo.gl/FNSZg * How to “change” single values in large objects in elegant way? votes: 9, answers: 1 Read on SO: [34] http://goo.gl/3KuJj * What programming languages have something like Haskell’s `newtype` votes: 9, answers: 4 Read on SO: [35] http://goo.gl/vzUAI * Implementing a zipper for length-indexed lists votes: 8, answers: 1 Read on SO: [36] http://goo.gl/ja6VS * Does Haskell concatenate String literals at compile time? votes: 8, answers: 4 Read on SO: [37] http://goo.gl/sr61q * Combining lenses votes: 8, answers: 2 Read on SO: [38] http://goo.gl/qEbPd Until next time, [38]+Daniel Santa Cruz References 1. http://www.joachim-breitner.de/blog/archives/600-On-taking-the-last-n-eleme… 2. http://www.reddit.com/r/haskell/comments/1i64mt/on_taking_the_last_n_elemen… 3. http://gelisam.blogspot.ca/2013/07/comonads-are-neighbourhoods-not-objects.… 4. http://www.reddit.com/r/haskell/comments/1hficb/comonads_are_not_objects/ 5. http://hackage.haskell.org/package/haste-compiler 6. http://www.reddit.com/r/haskell/comments/1htqi2/announce_haste_the_haskell_… 7. http://www.arcadianvisions.com/blog/?p=388 8. http://www.reddit.com/r/haskell/comments/1hhrfn/postmodern_haskell_and_open… 9. http://projects.haskell.org/pipermail/haskellmode-emacs/2013-June/000188.ht… 10. http://www.reddit.com/r/haskell/comments/1hd21v/announce_haskellmode_1307_s… 11. http://www.devalot.com/articles/2013/07/why-haskell.html 12. http://www.reddit.com/r/haskell/comments/1hzz2d/why_the_world_needs_haskell/ 13. http://ro-che.info/ccc/20.html 14. http://www.reddit.com/r/haskell/comments/1i8e6v/cartesian_closed_comic_20_w… 15. http://www.reddit.com/r/haskell/comments/1i0uiq/do_naming_practices_hurt_ha… 16. http://www.reddit.com/r/haskell/comments/1i0uiq/do_naming_practices_hurt_ha… 17. http://www.reddit.com/r/haskell/comments/1i2a9l/announce_httphackagehaskell… 18. http://www.reddit.com/r/haskell/comments/1i2a9l/announce_httphackagehaskell… 19. http://skillsmatter.com/podcast/home/lazy-io-and-alternatives-in-haskell/jd… 20. http://www.reddit.com/r/haskell/comments/1i438a/skills_matter_in_the_brain_… 21. https://www.fpcomplete.com/school/attoparsec 22. http://www.reddit.com/r/haskell/comments/1hkg3g/attoparsec_tutorial_school_… 23. https://www.fpcomplete.com/blog/2013/06/fp-haskell-center-beta-announcement 24. http://www.reddit.com/r/haskell/comments/1hfbgs/fp_haskell_center_beta_rele… 25. http://stackoverflow.com/questions/17409260/what-advantage-does-monad-give-… 26. http://stackoverflow.com/questions/17578728/encoding-less-than-with-haskell 27. http://stackoverflow.com/questions/17584630/why-is-factorial-calculation-mu… 28. http://stackoverflow.com/questions/17398784/haskell-can-typeclasses-define-… 29. http://stackoverflow.com/questions/17412348/c-and-haskell-codes-differs-in-… 30. http://stackoverflow.com/questions/17502603/ghc-generics-or-data-data 31. http://stackoverflow.com/questions/17502985/constraint-subset-higher-order-… 32. http://stackoverflow.com/questions/17503131/how-to-make-catamorphisms-work-… 33. http://stackoverflow.com/questions/17518749/how-to-change-single-values-in-… 34. http://stackoverflow.com/questions/17591276/what-programming-languages-have… 35. http://stackoverflow.com/questions/17501777/implementing-a-zipper-for-lengt… 36. http://stackoverflow.com/questions/17513273/does-haskell-concatenate-string… 37. http://stackoverflow.com/questions/17528119/combining-lenses 38. https://plus.google.com/105107667630152149014/about

1 0