- Haskell - Haskell.org

Announce: The Haskell Platform 2011.4
by Don Stewart 17 Dec '11

17 Dec '11

We're pleased to announce the release of the Haskell Platform: a single, standard Haskell distribution for everyone. Download the Haskell Platform 2011.4.0.0: http://haskell.org/platform/ The specification, along with installers (including Windows, Apple and Unix installers for a full Haskell environment) are available. The Haskell Platform is a single, standard Haskell distribution for every system, in the form of a blessed library and tool suite for Haskell distilled from the thousands of libraries on Hackage, along with installers for a wide variety of systems. It saves developers work picking and choosing the best Haskell libraries and tools to use for a task. When you install the Haskell Platform, you get the latest stable compiler, an expanded set of core libraries, additional development tools, and cabal-install – so you can download anything else you need from Hackage. What you get is specified here: http://hackage.haskell.org/platform/contents.html Thanks! -- The Platform Infrastructure Team P.S. Special thanks to Mark Lentczner for his excellent work on this release.

1 0

Proposal to incorporate Haskell.org
by Don Stewart 16 Dec '11

16 Dec '11

Hello everyone. The haskell.org committee[1], in the interest of the long-term stability of the open source Haskell community infrastructure, has decided to incorporate haskell.org as a legal entity. This email outlines our recommendation, and seeks input from the community on this decision. The committee's proposal is that haskell.org incorporate as an entity under the Software Freedom Conservancy umbrella organization (the same group that Darcs joined recently): http://sfconservancy.org/ If we proceed with this move, haskell.org will be a legal entity, and registered as a non-profit, allowing us to more directly accept (US tax-deductible) donations, and to invest in assets that benefit the Haskell open source community. We welcome your feedback on the proposal attached below. -- Don Stewart (on behalf of the Haskell.org committee) ------------------------------------------------------------------------ = A proposal for the incorporation of Haskell.org = In recent years, haskell.org has started to receive assets, e.g. money from Google Summer Of Code, donations for Hackathons, and a Sparc machine for use in GHC development. We have also started spending this money: in particular, on hosting haskell.org itself. There is also interest in running fundraising drives for specific things such as Hackathon sponsorship and hosting fees. However, haskell.org doesn't currently exist as a legal entity, meaning that these assets have had to be held on our behalf by other entities, such as Galois and various universities. This leads to tricky situations, with no-one being sure who should decide how the haskell.org assets can be used. To solve these problems, we propose that haskell.org applies to become a member project of the Software Freedom Conservancy (SFC) <http://conservancy.softwarefreedom.org/>. The SFC is a non-profit organization that provides free financial and administrative services to open source projects. Additionally, it has 501(c)(3) status, meaning donations from the US are tax-deductible. The SFC would hold haskell.org's money and other assets, and would be able to accept donations on behalf of haskell.org. The haskell.org committee, as described here [2], will make decisions on spending assets and other decisions related to governing the non-profit. Before proceeding, we are inviting input from the community in the form of specific objections or queries regarding the plan. We've tried to answer some of the most likely questions: Q: Does this mean that my Haskell project must now be covered by a copyleft licence such as GPL? A: No, but Haskell projects using haskell.org resource should use an Open Source licence <http://www.opensource.org/licenses/alphabetical>. Q: Will it still be possible to use community.h.o to host non-open-source material, such as academic papers? A: An overall minority of such content, as is the current situation, is not a problem. Q: Will it still be possible to have job ads on the haskell.org mailing lists and website? A: Yes. Q: Will this affect our ability to host the Haskell Symposium <http://www.haskell.org/haskell-symposium/> and Industrial Haskell Group<http://industry.haskell.org/> webpages within haskell.org? A: No. Q: What will be the relationship between haskell.org and other organizations such as the Haskell Symposium and Industrial Haskell Group? A: Those organisations will continue to exist as separate entities. Q: If an umbrella non-profit organisation "The Haskell Foundation" was created, would haskell.org be able to join it? A: Yes. It's likely that in such a scenario, the Haskell Foundation would become the owner of the haskell.org domain name, with the cost divided between the members. The entity that is part of the SFC would be renamed "community.haskell.org" in order to avoid confusion. [1]: http://www.haskell.org/haskellwiki/Haskell.org_committee [2]: http://www.haskell.org/haskellwiki/Haskell.org_committee#Operation

5 6

Mathematics of Program Construction: Second Call for Papers
by Jeremy.Gibbons＠cs.ox.ac.uk 15 Dec '11

15 Dec '11

SECOND CALL FOR PAPERS 11th International Conference on Mathematics of Program Construction (MPC 2012) Madrid, Spain, 25-27 June 2012 http://babel.ls.fi.upm.es/mpc2012 BACKGROUND The biennial MPC conferences aim to promote the development of mathematical principles and techniques that are demonstrably practical and effective in the process of constructing computer programs, broadly interpreted. The 2012 MPC conference will be held in Madrid, Spain, from 25th to 27th June 2012. The previous conferences were held in Twente, The Netherlands (1989), Oxford, UK (1992), Kloster Irsee, Germany (1995), Marstrand, Sweden (1998), Ponte de Lima, Portugal (2000), Dagstuhl, Germany (2002), Stirling, UK (2004, colocated with AMAST), Kuressaare, Estonia (2006, colocated with AMAST), Marseille, France (2008), and Québec City, Canada (2010, colocated with AMAST). TOPICS Papers are solicited on mathematical methods and tools put to use in program construction. Topics of interest range from algorithmics to support for program construction in programming languages and systems. The notion of "program" is broad, from algorithms to hardware. Some typical areas are type systems, program analysis and transformation, programming-language semantics, security, and program logics. Theoretical contributions are welcome, provided that their relevance to program construction is clear. Reports on applications are welcome, provided that their mathematical basis is evident. INVITED SPEAKERS * Gilles Barthe, IMDEA Software Institute (http://software.imdea.org/people/gilles.barthe/) * Dan Ghica, University of Birmingham (http://www.cs.bham.ac.uk/~drg/) * Tony Hoare, Microsoft Research (http://research.microsoft.com/en-us/people/thoare/) IMPORTANT DATES * Submission of abstracts 09 January 2012 * Submission of full papers 16 January 2012 * Notification to authors: 19 March 2012 * Final version: 16 April 2012 SUBMISSION Submission is in two stages. Abstracts (plain text, 10 to 20 lines) must be submitted by 09 January 2012. Full papers (pdf) adhering to the LaTeX llncs style must be submitted by 16 January 2012. There is no official page limit, but authors should strive for brevity. The web-based system EasyChair will be used for submission (http://www.easychair.org/conferences/?conf=mpc2012) Papers must report previously unpublished work, and not be submitted concurrently to another conference with refereed proceedings. Accepted papers must be presented at the conference by one of the authors. Please feel free to write to mpc2012(a)easychair.org with any questions about academic matters. The proceedings of MPC 2012 will be published in Springer-Verlag's Lecture Notes in Computer Science series, as have all the previous editions. Authors of accepted papers will be expected to transfer copyright to Springer for this purpose. After the conference, we plan that the authors of the best papers will be invited to submit revised versions to a special issue of the Elsevier journal Science of Computer Programming. PROGRAMME COMMITTEE Jeremy Gibbons University of Oxford, UK (co-chair) Pablo Nogueira Universidad Politécnica de Madrid, ES (co-chair) Ralph Back Åbo Akademi, FI Roland Backhouse University of Nottingham, UK Eerke Boiten University of Kent, UK William Cook University of Texas at Austin, US Jules Desharnais Université Laval, CA Lindsay Groves Victoria University of Wellington, NZ Ian Hayes University of Queensland, AU Ralf Hinze University of Oxford, UK Graham Hutton University of Nottingham, UK Johan Jeuring Utrecht Universiteit, NL Christian Lengauer Universität Passau, DE Larissa Meinicke Macquarie University, AU Bernhard Möller Universität Augsburg, DE Carroll Morgan University of New South Wales, AU Shin-Cheng Mu Academia Sinica, TW Dave Naumann Stevens Institute of Technology, US Jose Oliveira Universidade do Minho, PT Steve Reeves University of Waikato, NZ Wouter Swierstra Radboud Universiteit, NL Anya Tafliovich University of Toronto Scarborough, CA VENUE The conference will take place in Madrid, the capital of Spain, in the Facultad de Medicina of Universidad Complutense de Madrid. The Faculty of Medicine is located in Madrid's Ciudad Universitaria (city campus), not far from the city centre and other major tourist attractions. Accommodation has been reserved in a nearby hotel. LOCAL ORGANIZERS Pablo Nogueira Universidad Politécnica de Madrid Ricardo Peña Universidad Complutense de Madrid Alvaro García IMDEA Software Institute and Universidad Politécnica de Madrid Manuel Montenegro Universidad Complutense de Madrid For queries about local matters, please write to pablo(a)babel.ls.fi.upm.es.

1 0

Re: [Haskell] [Haskell-cafe] ANNOUNCE: Anansi 0.4.2 (literate programming pre-processor)
by John Millikin 13 Dec '11

13 Dec '11

On Tue, Dec 13, 2011 at 03:39, Magnus Therning <magnus(a)therning.org> wrote: > 1. What to call files? I understand (C)WEB suggests using .w, and > that noweb uses .nw, what should I call anansi files? I usually use .anansi, but it doesn't matter. You can use whatever extensions you like, or even none at all. > 2. Combining anansi and pandoc works quite well for HTML, but it fails > miserably when trying to use the generated LaTeX: > > > markdown2pdf: ! LaTeX Error: Command \guillemotleft unavailable > in encoding OT1. > > Is there any good way to get around that? The LaTeX loom is designed to output basic markup that can be turned into a PDF with minimum fuss. It probably won't work as-is for more advanced cases, such as when a user wants to use custom templates, or has to inter-operate with pseudo-LaTeX parsers like Pandoc. You could try copying the LaTeX loom into your own code, modifying it to generate the custom output format you want, and then running it as a #!runhaskell script. > 3. Is there any editor support for anansi, syntax highlihgting etc? Not that I know of. Note that Anansi's syntax itself is very minimal, so what you need is an editor that can support formatting a file using multiple syntaxes. I don't know enough about editor modification to figure out which editors support such a feature, or how to enable it.

1 0

ANNOUNCE: smallcheck-0.6; test-framework-smallcheck-0.1
by Roman Cheplyaka 11 Dec '11

11 Dec '11

I'm pleased to announce a new release of SmallCheck. The highlights for this release are: * Default Generic implementation of Serial instance, contributed by Bas van Dijk This means that you don't need to write instances by hand for your types to generate test values for them. See [1] for the details. [1]: http://hackage.haskell.org/packages/archive/smallcheck/0.6/doc/html/Test-Sm… * Revised, organised into modules and documented API * Integration with test-framework, through test-framework-smallcheck package It allows to organize SmallCheck properties into a test suite (possibly together with HUnit or QuickCheck tests), apply timeouts, get nice statistics etc. Thanks to Max Bolingbroke for cooperation on this front. Please refer to the README for more information about SmallCheck: https://github.com/feuerbach/smallcheck/blob/master/README.md Hackage links: http://hackage.haskell.org/package/smallcheck-0.6 http://hackage.haskell.org/package/test-framework-smallcheck-0.1 -- Roman I. Cheplyaka :: http://ro-che.info/

1 0

ANNOUNCE: Anansi 0.4.2 (literate programming pre-processor)
by John Millikin 11 Dec '11

11 Dec '11

Anansi is a preprocessor for literate programs, in the model of NoWeb or nuweb. Literate programming allows both computer code and documentation to be generated from a single unified source. Home page: https://john-millikin.com/software/anansi/ Hackage: http://hackage.haskell.org/package/anansi-0.4.2 ----- This release has a couple cool new features, suggested by Dirk Laurie. Markdown loom =============== Markdown, a lightweight markup language similar to ReStructuredText, is used often on web forums. Use [[ :loom anansi.markdown ]] in your documents to enable. User-defined line pragmas ======================== Users can now add, modify, and disable line pragmas in tangled output based on file extension. This makes it much easier to combine code and data in a single source file. By default, line pragmas are enabled for the C, C++, C#, Haskell, Perl, and Go languages. Customizing the pragma format is easy. Use the ${line}, ${path}, and ${quoted-path} substitutions in an :option. This example code will insert comments into tangled Python code: ------------------------------------------- :# Insert comments into any tangled output file with a name ending in ".py" :option anansi.line-pragma-py=# Generated from ${path} line ${line} ------------------------------------------- To disable line pragmas for a particular file type, just set its pragma format to an empty string: ------------------------------------------- :option anansi.line-pragma-pl= -------------------------------------------

1 0

ANNOUNCE: Workflow-0.5.8.0
by Alberto G. Corona 09 Dec '11

09 Dec '11

This is A new version of the package workflow. I probably will change the name of this package since it is too generic. A workflow can be seen as a persistent thread that executes a monadic computation. Therefore, it can be used in very time consuming computations such are CPU intensive calculations with intermediate results or with procedures that are most of the time waiting for the response of a process or an user, that are prone to comunication failures, timeouts or shutdowns. Workflow has a operation, called "step" that lift the monadic computation to the Workflow monad. This bring services of transparent state loogging, so that the computation can be restarted at the point of stop/failure. Additionally , the package has persistent queues, persistent data collections, and persistent timeouts (whit which the workflow can wait for days, months or even years, more than the average time between failures). This is important for programming office workflow or in election processes where the user has a limited time to decide/vote. This version has many improvements: it admits Data.Binary serialization for logging (besides RefSerialize of previous versions). . It also has an EDSL of high level monadic combinators that represent workflow patterns. For example, split, merge, synchronization, votation etc. There are examples in the online documentation and some demos in the package. My motivation for developping Workflow is to use it in a project for electronic democracy in the Web. If anyone is interested in the package Workflow and/or electronic democracy, I will be happy to talk with him. Hope to be useful Alberto.

1 0

CfP: Only one week left for submitting abstracts to TAP 2012 (International Conference on Test and Proofs
by Achim D. Brucker 09 Dec '11

09 Dec '11

(Apologies for duplicates) ************************************************* **** Less than one week until the deadline *** **** for submitting abstract to TAP 2012 *** ************************************************* CALL FOR PAPERS Full and short Research Paper, Industrial Expierence Papers, Tool Papers Abstract submission: Dec 14, 2011, Paper submission Dec 21, 2012 6th INTERNATIONAL CONFERENCE ON TEST AND PROOFS (TAP 2012) http://lifc.univ-fcomte.fr/tap2012/ May 31 - June 1, 2012, Prague, Czech Republic Part of the TOOLS Federated Conferences 2012 http://tools2012.fit.cvut.cz/ The TAP conference is devoted to the convergence of proofs and tests, to the application of techniques from both sides and their combination for the advancement of software quality. Test and Proof seem to be contradictory techniques: if you have proved your program to be correct, it is fruitless to comb it for bugs; and if you are testing it, that is surely a sign that you have given up on any hope to prove its correctness. Accordingly, proofs and tests have, since the onset of software engineering research, been pursued by distinct communities. However, the development of both approaches lead to the discovery of common issues and to the realization that each may need the other. The emergence of model checking has been one of the first signs that contradiction may yield to complementarity. Further evidence give test data generation techniques from models or programs which boil down to constraint resolution techniques for relatively large formula; the advent of powerful SMT solvers have therefore powered new testing techniques. Finally, since formal, proof-based verification is costly, testing invariants and background theories can be helpful to detect errors early and to improve cost effectivity. Summing up, in the past few years an increasing number of research efforts have encountered the need for combining proofs and tests, dropping earlier dogmatic views of incompatibility and taking instead the best of what each of these software engineering domains has to offer. The TAP conference aims to bring together researchers and practitioners working in the converging fields of testing and proving, and will offer a generous allocation of papers, panels and informal discussions. Topics of interest cover theory definitions, tool constructions and experimentations and include (other topics related to TAP are welcome): - Transfer of concepts from testing to proving (e.g., coverage criteria) and from proving to testing - Program proving with the aid of testing techniques - New problematics in automated reasoning emerging from specificities of test generation - Verification and testing techniques combining proofs and tests - Generation of test data, oracles, or preambles by deductive techniques such as: theorem proving, model checking, symbolic execution, constraint logic programming - Model-based testing and verification - Generation of specifications by deduction - Automatic bug finding - Debugging of programs combining static and dynamic analysis - Formal frameworks - Tool descriptions and experience reports - Case studies combining tests and proofs - Applying combination of test and proof techniques to new application domains such as validating security procotols or vulnerability detection of programs Important Dates: ================ Abstract submission: December 14, 2011 Paper submission: December 21, 2011 Notification: March 2, 2012 Camera ready version: March 19, 2012 TAP conference: May 31 - June 1, 2012 (to be confirmed) TOOLS conferences (TOOLS, ICMT, SC, TAP): May 29 - June 01, 2012 Conference Chairs: Bertrand Meyer Program Chairs: Achim D. Brucker and Jacques Julliand Program Committee (to be extended): =================================== Nazareno Aguirre, Bernhard K. Aichernig, Paul Ammann, Dirk Beyer, Nikolaj Bjorner, Robert Clarisó, Marco Comini, Catherine Dubois, Gordon Fraser, Angelo Gargantini, Alain Giorgetti, Patrice Godefroid, Martin Gogolla, Arnaud Gotlieb, Reiner Hähnle, Bart Jacobs, Thierry Jéron, Gregory Kapfhammer, Nikolai Kosmatov, Victor Kuliamin, Karl Meinke, Jeff Offutt, Holger Schlingloff, T.H. Tse, Margus Veanes, Luca Viganò, Burkhart Wolff, Fatiha Zaidi Submission: =========== Please submit your papers via http://lifc.univ-fcomte.fr/tap2012/. TAP 2012 will accept two types of papers: - Research papers: full papers with at most 16 pages in LNCS format (pdf), which have to be original, unpublished and not submitted elsewhere. - Short contributions: work in progress, (industrial) experience reports or tool demonstrations, position statements; an extended abstract with at most 6 pages in LNCS format (pdf) is expected. Accepted papers will be published in the Springer LNCS series and will be available at the conference. The contents of previous TAP proceedings is available at: http://www.informatik.uni-trier.de/~ley/db/conf/tap/ -- Dr. Achim D. Brucker, SAP Research, Vincenz-Priessnitz-Str. 1, D-76131 Karlsruhe Phone: +49 6227 7-52595, Fax: +49-6227 78-50502, http://www.brucker.ch

1 0

VSTTE 2012: First Call for Participation
by Gudmund Grov 08 Dec '11

08 Dec '11

***************************************************************** *** First Call for Participation *** VSTTE 2012 Verified Software: Theories, Tools and Experiments January 28-29, 2012 Philadelphia, USA (co-located with POPL and VMCAI) https://sites.google.com/site/vstte2012/ ****************************************************************** The Fourth International Conference on Verified Software: Theories, Tools, and Experiments will take place on January 28-29, 2012. The focus of the conference is the development of systematic methods for specifying, building, and verifying software. The goal of this conference is to advance the state of the art through the interaction of theory development, tool evolution, and experimental validation. Historically, the conference came out of the Verified Software Initiative (VSI), a cooperative, international initiative directed at the scientific challenges of large-scale software verification. An informal verification competition has been held and the winner will be announced during the conference. KEYNOTE SPEAKERS Rupak Majumdar, Max Planck Institute for Software Systems Wolfgang Paul, Saarland University TUTORIALS Francesco Logozzo, Microsoft Research Rustan Leino, Microsoft Research PROGRAM The full program is available at the conference web site: https://sites.google.com/site/vstte2012/program VENUE The conference is co-located with POPL and will be held at the Sheraton Society Hill Hotel in Philadelphia's historic district. For hotel rate details and booking please see the POPL webpage: http://www.cse.psu.edu/popl/12/ REGISTRATION Registration is handled by the POPL registration. For rates, please see http://www.cse.psu.edu/popl/12/ and for registration please follow this link: https://regmaster3.com/2012conf/POPL12/register.php Note that early registration deadline is December 24, 2011. -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336.

1 0

Haskell Weekly News: Issue 210
by Daniel Santa Cruz 08 Dec '11

08 Dec '11

Welcome to issue 210 of the HWN, a newsletter covering developments in the Haskell community. This release covers the week of November 27 to December 3, 2011. You can find the HTML version at: http://contemplatecode.blogspot.com/2011/12/haskell-weekly-news-issue-210.h… Announcements Heinrich Hordegen announced a tentative 2012 meeting schedule for Munich Haskell group. [1] http://goo.gl/JrnP6 New and Updated Projects * data-timeout (Mikhail Vorozhtsov) Allows one to specify time units for timeouts and convert between them. [2] http://goo.gl/fbfGM * Netwire (Ertugrul Soylemez; 3.0.0) Major API change. [3] http://goo.gl/8hPwS * monad-control (Bas van Dijk; 0.3) New and improved API. [4] http://goo.gl/so3s9 Quotes of the Week * Jafet: They're not nasty; their niceness is just distributed over more people * copumpkin: U NEED MOANAD * xplat: i have a feeling that trying to write an interesting dependently-typed program in Shen at any time in the near future would be like trying to host a holiday dinner starting with an empty lot, 2x4s, a stack of window panes, some cables and wiring boxes, sheets of drywall, disconnected appliances, roof shingles, rolls of insulation and bags of concrete * Axman6: {-# PRAGMA ThisShitNeedsMoarFast #-} Top Reddit Stories * Name Your Type Variables! Domain: amateurtopologist.com, Score: 71, Comments: 38 On Reddit: [5] http://goo.gl/I2uny Original: [6] http://goo.gl/yRbmO * Insane Haskell Professor on Lambda Calculus. Wait for it... Domain: youtube.com, Score: 66, Comments: 17 On Reddit: [7] http://goo.gl/uDQJS Original: [8] http://goo.gl/IauHk * criterion 0.6 produces shiny new performance reports Domain: bos.github.com, Score: 63, Comments: 8 On Reddit: [9] http://goo.gl/F2K76 Original: [10] http://goo.gl/x720h * [commit: base] master: Add traceStack :: String -> a -> a Domain: haskell.org, Score: 48, Comments: 5 On Reddit: [11] http://goo.gl/HCbf2 Original: [12] http://goo.gl/JzO3O * Elm: functional reactive web-programming (compiles to html, css, js). Just added reactive values, basic canvas support, and new interactive examples. Domain: elm-lang.org, Score: 45, Comments: 19 On Reddit: [13] http://goo.gl/mKS9a Original: [14] http://goo.gl/ASt27 * Snap 0.7 released Domain: snapframework.com, Score: 41, Comments: 1 On Reddit: [15] http://goo.gl/R3A8Y Original: [16] http://goo.gl/SVgXy * Haskell Communities and Activities Report - November 2011 edition Domain: haskell.org, Score: 35, Comments: 0 On Reddit: [17] http://goo.gl/X82AK Original: [18] http://goo.gl/CGKAr * "fix' f = f (fix' f)" vs. "fix f = let x = f x in x" Domain: groups.google.com, Score: 33, Comments: 15 On Reddit: [19] http://goo.gl/vadtO Original: [20] http://goo.gl/SQSFL * Announcing cabal-src: solve (some of) cabal dependency hell Domain: yesodweb.com, Score: 32, Comments: 15 On Reddit: [21] http://goo.gl/PIB4S Original: [22] http://goo.gl/00LZz * aeson 0.4: easier, faster, nicer Domain: github.com, Score: 31, Comments: 18 On Reddit: [23] http://goo.gl/G1J5A Original: [24] http://goo.gl/DQ4bc * Package authors: Please use Packdeps! Domain: yesodweb.com, Score: 24, Comments: 10 On Reddit: [25] http://goo.gl/bLYvt Original: [26] http://goo.gl/fNh9n * Slides from my guest lecture at Stanford Domain: blog.johantibell.com, Score: 22, Comments: 14 On Reddit: [27] http://goo.gl/ITFkN Original: [28] http://goo.gl/4w1tK Top StackOverflow Questions * How to write a Haskell function that takes a variadic function as an argument votes: 28, answers: 1 Read on SO: [29] http://goo.gl/JqZ3H * Functional lenses votes: 18, answers: 2 Read on SO: [30] http://goo.gl/Qn2Ff * Haskell : An example of a Foldable which is not a Functor? votes: 17, answers: 2 Read on SO: [31] http://goo.gl/42lSo * How does IncoherentInstances work? votes: 17, answers: 1 Read on SO: [32] http://goo.gl/O1Ha4 * Minimum specification for Haskell library type classes? votes: 16, answers: 2 Read on SO: [33] http://goo.gl/L7mO6 * Expressive and composable error types votes: 16, answers: 1 Read on SO: [34] http://goo.gl/vkoZb * Distributed Haskell state of the art in 2011? votes: 16, answers: 2 Read on SO: [35] http://goo.gl/mx0kd * Is it possible to implement liftM2 in Scala? votes: 15, answers: 1 Read on SO: [36] http://goo.gl/p6TDl * Are Haskell FlexibleInstances a stable extension to the language? votes: 15, answers: 1 Read on SO: [37] http://goo.gl/sQc37 * Is Milner let polymorphism a rank 2 feature? votes: 13, answers: 4 Read on SO: [38] http://goo.gl/kOcnW Until next time, Daniel Santa Cruz References 1. http://comments.gmane.org/gmane.comp.lang.haskell.cafe/94240 2. http://comments.gmane.org/gmane.comp.lang.haskell.libraries/16691 3. http://comments.gmane.org/gmane.comp.lang.haskell.cafe/94245 4. http://comments.gmane.org/gmane.comp.lang.haskell.general/19038 5. http://www.amateurtopologist.com/blog/2011/10/11/name-your-type-variables/ 6. http://www.reddit.com/r/haskell/comments/mxz3k/name_your_type_variables/ 7. http://www.youtube.com/watch?v=5TMojC0Nb6A 8. http://www.reddit.com/r/haskell/comments/mw094/insane_haskell_professor_on_… 9. http://bos.github.com/criterion/ 10. http://www.reddit.com/r/haskell/comments/mx8vw/criterion_06_produces_shiny_… 11. http://www.haskell.org/pipermail/cvs-libraries/2011-November/014698.html 12. http://www.reddit.com/r/haskell/comments/muq40/commit_base_master_add_trace… 13. http://elm-lang.org/Elm.elm 14. http://www.reddit.com/r/haskell/comments/mwbvj/elm_functional_reactive_webp… 15. http://snapframework.com/blog/2011/12/01/snap-0.7-released 16. http://www.reddit.com/r/haskell/comments/mwx4t/snap_07_released/ 17. http://www.haskell.org/communities/11-2011/html/report.html 18. http://www.reddit.com/r/haskell/comments/mzbia/haskell_communities_and_acti… 19. http://groups.google.com/group/stanford-11au-cs240h/browse_thread/thread/41… 20. http://www.reddit.com/r/haskell/comments/mt7nt/fix_f_f_fix_f_vs_fix_f_let_x… 21. http://www.yesodweb.com/blog/2011/11/cabal-src 22. http://www.reddit.com/r/haskell/comments/mrz9p/announcing_cabalsrc_solve_so… 23. https://github.com/bos/aeson/blob/0.4.0.0/release-notes.markdown 24. http://www.reddit.com/r/haskell/comments/mvtmk/aeson_04_easier_faster_nicer/ 25. http://www.yesodweb.com/blog/2011/12/please-use-packdeps 26. http://www.reddit.com/r/haskell/comments/mvp4w/package_authors_please_use_p… 27. http://blog.johantibell.com/2011/11/slides-from-my-guest-lecture-at.html 28. http://www.reddit.com/r/haskell/comments/mvoqd/slides_from_my_guest_lecture… 29. http://stackoverflow.com/questions/8353845/how-to-write-a-haskell-function-… 30. http://stackoverflow.com/questions/8307370/functional-lenses 31. http://stackoverflow.com/questions/8359115/haskell-an-example-of-a-foldable… 32. http://stackoverflow.com/questions/8371499/how-does-incoherentinstances-work 33. http://stackoverflow.com/questions/8320039/minimum-specification-for-haskel… 34. http://stackoverflow.com/questions/8320855/expressive-and-composable-error-… 35. http://stackoverflow.com/questions/8362998/distributed-haskell-state-of-the… 36. http://stackoverflow.com/questions/8366518/is-it-possible-to-implement-lift… 37. http://stackoverflow.com/questions/8367423/are-haskell-flexibleinstances-a-… 38. http://stackoverflow.com/questions/8296695/is-milner-let-polymorphism-a-ran…

1 0