- Haskell - Haskell.org

[Haskell-cafe] Monad.Reader #20 call for copy
by Edward Z. Yang 07 Mar '12

07 Mar '12

I'm pleased to announce that I, Edward Z. Yang, will be taking over Brent Yorgey's role as lead editor of the Monad Reader! Call for Copy: The Monad.Reader - Issue 20 -------------------------------------------- Whether you're an established academic or have only just started learning Haskell, if you have something to say, please consider writing an article for The Monad.Reader! The submission deadline for Issue 20 will be: **Monday, March 5** The Monad.Reader ~~~~~~~~~~~~~~~~ The Monad.Reader is a electronic magazine about all things Haskell. It is less formal than journal, but somehow more enduring than a wiki- page. There have been a wide variety of articles: exciting code fragments, intriguing puzzles, book reviews, tutorials, and even half-baked research ideas. Submission Details ~~~~~~~~~~~~~~~~~~ Get in touch with me if you intend to submit something -- the sooner you let me know what you're up to, the better. Please submit articles for the next issue to me by e-mail (ezyang(a)mit.edu) Articles should be written according to the guidelines available from http://themonadreader.wordpress.com/contributing/ Please submit your article in PDF, together with any source files you used. The sources will be released together with the magazine under a BSD license. If you would like to submit an article, but have trouble with LaTeX please let me know and we'll work something out.

1 1

Displaying trees in Haskell
by Luana Fagarasan 07 Mar '12

07 Mar '12

Hello, I am quite new to Haskell and I am seeking the best way to display trees graphically when using Haskell. I have looked on the web, but am still not clear! For those interested, please find more detailed information below. Regards, Luana Fagarasan Further information: I am writing a theorem prover in Haskell as my final year project. This is very loosely based on the HAL theorem prover described in "ML for the working programmer" by Larry Paulson. I would like to display the proof tree (containing the main goal as the root and subgoals that were developed along the way as leaves/nodes), once a proof is found. More generally I would be interested in understanding more about GUIs when using Haskell.

3 2

Higher types in contexts
by Barney Hilken 06 Mar '12

06 Mar '12

Is there any deep reason why I can't write a polymorphic type in a context? I think the record update problem can be (sort of) solved if you could write: class Has r Rev (forall a. [a] -> [a]) => HRClass r where setHRClass :: (forall a.[a] -> [a]) -> r -> r but polymorphic types are not allowed in contexts. Is this one of the problems SPJ considers "Hard" or is it a feasible extension? Barney.

2 1

ANNOUNCE: isohunt-0.1, bindings to isoHunt API
by Reiner Pope 06 Mar '12

06 Mar '12

Hi list, I'm pleased to announce the first release to Hackage of isohunt, a library which binds to the isoHunt API. See http://hackage.haskell.org/package/isohunt Cheers, Reiner

1 0

CFP: TFP12, Trends in Functional Programming 2012, St Andrews, U.K., June 12-14, 2012
by Hans-Wolfgang Loidl 05 Mar '12

05 Mar '12

[In short: submissions of papers & ext'd abstracts by March 26th; TFP12 symposium June 12-14th; Apologies for multiple copies of this call -- HWL ] CALL FOR PAPERS 13th International Symposium Trends in Functional Programming 2012 St Andrews, U.K. June 12-14, 2012 http://www.tifp.org/TFP12.html The symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions (see below), described in draft papers submitted prior to the symposium. A formal post-symposium refereeing process then selects a subset of the articles presented at the symposium and submitted for formal publication. Selected papers will be published as a Springer Lecture Notes in Computer Science (LNCS: http://www.springer.com/lncs) volume. TFP 2012 will be the main event of a week of functional programming extravaganza at the University of St Andrews. The week will start with the International Workshop on Trends in Functional Programming in Education, followed by TFP, followed by a workshop on 75 years of Lambda Calculus, an Erlang day, and a technical workshop on Patterns for MultiCores (ParaPhrase/Release projects). The TFP symposium is the heir of the successful series of Scottish Functional Programming Workshops. Previous TFP symposia were held in Edinburgh (Scotland) in 2003, in Munich (Germany) in 2004, in Tallinn (Estonia) in 2005, in Nottingham (UK) in 2006, in New York (USA) in 2007, in Nijmegen (The Netherlands) in 2008, in Komarno (Slovakia) in 2009, in Oklahoma (USA) in 2010, and in Madrid (Spain) in 2011. For further general information about TFP please see the TFP homepage at http://www.tifp.org/. SCOPE OF THE SYMPOSIUM The symposium recognises that new trends may arise through various routes. As part of the symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: Research Articles: leading-edge, previously unpublished research work Position Articles: on what new trends should or should not be Project Articles: descriptions of recently started new projects Evaluation Articles: what lessons can be drawn from a finished project Overview Articles: summarising work with respect to a trendy subject Articles must be original and not submitted for simultaneous publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or more experience oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Articles on the following subject areas are particularly welcome: . Functional programming and multicore/manycore computing . Functional programming in the cloud . High performance functional computing . Extra-functional (behavioural) properties of functional programs . Dependently typed functional programming . Validation and verification of functional programs . Using functional techniques to verify/reason about imperative/object-oriented programs . Debugging for functional languages . Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids, etc. . Interoperability with imperative programming languages . Novel memory management techniques . Program transformation techniques . Empirical performance studies . Abstract/virtual machines and compilers for functional languages . New implementation strategies . Any new emerging trend in the functional programming area If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2012 program chair, Hans-Wolfgang Loidl, at tfp12(a)easychair.org BEST STUDENT PAPER AWARD TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A student paper is one for which the authors state that the paper is mainly the work of students, the students are listed as first authors, and a student would present the paper. A prize for the best student paper is awarded each year. SUBMISSION AND DRAFT PROCEEDINGS Acceptance of papers for presentation at the symposium is based on a lightweight peer review process of extended abstracts (2 to 10 pages in length) or full papers (max 16 pages). Accepted abstracts are to be completed to full papers before the symposium for publication in the draft proceedings. Latex style files are available from Springer's web page (llncs2e.zip), and are linked below. The submission must clearly indicate which category it belongs to: research, position, project, evaluation, or overview paper. It should also indicate whether the main author or authors are research students. Formatting details can be found at the TFP 2012 website. Paper submission is done through TFP12's easychair page: https://www.easychair.org/conferences/?conf=tfp12 Important dates (2012): Full papers/extended abstracts submission: March 26th Notification of acceptance for presentation: April 4th Early registration deadline: April 11th Camera ready for draft proceeding: May 28th The papers of the local proceedings will also be made available on-line under some copyright conditions, with which all authors are asked to agree. POST-SYMPOSIUM REFEREEING AND PUBLICATION In addition to the symposium draft proceedings, we will continue the previous years' decision of publishing a high-quality subset of contributions in the Springer Lecture Notes in Computer Science (LNCS) series. Proceedings of the last two instances of TFP have been published as LNCS 6546 (TFP10) and LNCS 7193 (TFP11). All TFP authors will be invited to submit revised papers after the symposium. These will be refereed using normal conference standards and a subset of the submitted papers, over all categories, will be selected for publication. Papers will be judged on their contribution to the research area with appropriate criteria applied to each category of paper. Student papers will be given extra feedback by the Program Committee in order to assist those unfamiliar with the publication process and to help in improving the quality of the paper. Important dates (2012): TFP 2012 Symposium: June 12-14th Student papers feedback: June 22nd Submission for formal review: July 9th Notification of acceptance for LNCS: September 17th Camera ready paper: October 15th REGISTRATION Registration for TFP12, as well as the adjoined workshops, is handled through the on-line registration page below. Note that for guaranteed on-site accommodation, registration must be completed by the early registration deadline of April 11th, 2012. http://onlineshop.st-andrews.ac.uk/browse/product.asp?catid=34&modid=2&comp… TFP 2012 ORGANIZATION Steering Committee Chair: Marko van Eekelen, Radboud University Nijmegen and Open University, NL Steering Committee Treasurer: Hans-Wolfgang Loidl, Heriot-Watt University, UK Symposium Organization Chair: Kevin Hammond, University of St. Andrews, UK Local Arrangements: Edwin Brady, Vladimir Janjic, University of St. Andrews, UK TFP 2012 PROGRAMME COMMITTEE Peter Achten, Radboud University Nijmegen, The Netherlands Jost Berthold, University of Copenhagen, Denmark Edwin Brady, University of St. Andrews, U.K. Matthias Blume, Google, U.S.A. Clemens Grelck, University of Amsterdam, The Netherlands Kevin Hammond, University of St. Andrews, U.K. Graham Hutton, University of Nottingham, U.K Patricia Johann, University of Strathclyde, U.K. Hans-Wolfgang Loidl (PC Chair), Heriot-Watt University, U.K. Jay McCarthy, Brigham Young University, Utah, U.S.A. Rex Page, University of Oklahoma, U.S.A. Ricardo Peña, Complutense University of Madrid, Spain Kostis Sagonas, Uppsala University, Sweden Manuel Serrano, INRIA Sophia Antipolis, France Mary Sheeran, Chalmers, Sweden Nikhil Swamy, Microsoft Research, Redmond, U.S.A. Phil Trinder, Heriot-Watt University, U.K. Wim A Vanderbauwhede, University of Glasgow, U.K. Marko van Eekelen, Radboud University Nijmegen, The Netherlands David Van Horn, Northeastern University, U.S.A. Malcolm Wallace, Standard Chartered, U.K. Viktória Zsók, Eötvös Loránd University, Hungary SPONSORS TFP 2012 is sponsored by Erlang Solutions Ltd. and the Scottish Informatics and Computer Science Alliance (SICSA). INVITED SPEAKER In this instance of TFP, an invited talk will be given by David A Turner, Professor emeritus at Middlesex University and at the University of Kent, inventor of Miranda, KRC and SASL. Prof Turner will be talking on the history of functional programming languages. LINKS Main TFP12 page: http://www.tifp.org/TFP12.html TFP home page: http://www.tifp.org/ Submission page: https://www.easychair.org/conferences/?conf=tfp12 Latex style files: ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip Registration page: http://onlineshop.st-andrews.ac.uk/browse/product.asp?catid=34&modid=2&comp… Facebook page: http://www.facebook.com/pages/TFP-Symposium-Series-on-Trends-in-Functional-… -- Hans-Wolfgang Loidl School of Mathematical and Computer Sciences, Heriot-Watt University, Riccarton, Edinburgh EH14 4AS Scotland, U.K.

1 0

LOLA 2012 -- call for contributed talks
by Amal Ahmed 02 Mar '12

02 Mar '12

============================================================ *** CALL FOR CONTRIBUTED TALKS *** LOLA 2012 Syntax and Semantics of Low Level Languages Sunday 24th June 2012, Dubrovnik, Croatia A LICS 2012-affiliated workshop http://www.ccs.neu.edu/home/amal/lola2012 ============================================================ IMPORTANT DATES Submission deadline Friday 13th April 2012 Author notification Monday 30th April 2012 Workshop Sunday 24th June 2012 SUBMISSION LINK The submissions will be made by easychair at https://www.easychair.org/conferences/?conf=lola2012 DESCRIPTION OF THE WORKSHOP It has been understood since the late 1960s that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high level programming languages, and to the development of reasoning principles for such languages. Yet low level languages, such as machine code, and the compilation of high level languages into a low level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of this past decade has been that low level languages are also governed by logical principles. From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low level languages (such as heaps, registers and code pointers) and low level properties of programs (such as resource usage) goes hand in hand with the some of the most advanced contemporary researches in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and sublinear programming. The LOLA workshop, affiliated with LICS, will bring together researchers interested in many aspects of the relationship between logic and low level languages and programs. Topics of interest include, but are not limited to: Typed assembly languages, Certified assembly programming, Certified and certifying compilation, Proof-carrying code, Program optimization, Modal logic and realizability in machine code, Realizability and double orthogonality in assembly code, Parametricity, modules and existential types, General references, Kripke models and recursive types, Continuations and concurrency, Implicit complexity, sublinear programming and Turing machines, Closures and explicit substitutions, Linear logic and separation logic, Game semantics, abstract machines and hardware synthesis, Monoidal and premonoidal categories, traces and effects. SUBMISSION INFORMATION: LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants, welcoming proposals for talks on work in progress, overviews of larger programmes, position presentations and short tutorials as well as more traditional research talks describing new results. The programme committee will select the workshop presentations from submitted proposals, which may take the form either of a short abstract or of a longer (published or unpublished) paper describing completed work. PROGRAM CO-CHAIRS: Amal Ahmed (Northeastern University) Aleksandar Nanevski (IMDEA Software) PROGRAM COMMITTEE: Cristiano Calcagno (Imperial College London and Monoidics Limited) Robert Dockins (Princeton University) Martin Hofmann (LMU Munich) Xavier Leroy (INRIA Rocquencourt) Andrzej Murawski (University of Leicester) Sungwoo Park (Pohang University of Science and Technology) Dusko Pavlovic (Royal Holloway, University of London) Andreas Rossberg (Google)

1 0

CFP: First Workshop on Cross-Model Language Design and Implementation
by James Cheney 01 Mar '12

01 Mar '12

[The topic of the workshop, cross-model programming, certainly includes Haskell-based research on domain-specific embedded languages, database programming, Web programming, data parallelism, Cloud Haskell, etc. --James] CALL FOR PAPERS XLDI 2012: First international workshop on Cross-model Language Design and Implementation Affiliated with ICFP 2012, Copenhagen, Denmark Sponsored by ACM SIGPLAN September 9, 2012 http://workshops.inf.ed.ac.uk/xldi2012/ There has recently been a burst of systems research advocating high-performance commodity "big data" or "massively parallel" computing models, often using simpler high-level languages or interfaces as front-ends. This work is often described as part of a shift towards a new "cloud computing" paradigm, but these buzzwords mask the major problems these techniques face: both big data and massively parallel systems currently employ systems-based methods and testing regimes that cannot offer guarantees of safety, security, correctness and evolvability. Language-based techniques, particularly formalization, verification, abstraction, and representation independence, offer the promise to reconcile the performance benefits of new execution models with the advantages of modern programming languages. Cross-model programming is not a new problem: for example, smooth integration of relational database programming models into general-purpose programming languages has been a long-standing challenge, with some approaches now in mainstream use (such as Microsoft's LINQ). But in the last few years there has been a dramatic increase in the number of domain-specific languages or libraries for interfacing with different computing models (data-parallelism, sensor networks, MapReduce-style fault-tolerant parallelism, distributed programming, Bayesian inference engines, declarative networking, or multi-tier Web programming), as well as techniques for language-integrated querying or processing data over other data models. Cross-model programs that execute in multiple (possibly heterogeneous) environments have much more challenging security, debugging, validation, and optimization problems. - Language designs for simplifying cross-model programming with database queries, data parallelism, networking, distributed programming, Web programming, or security primitives. - Formalizations or comparisons of existing languages, libraries or extensions for integrating multiple execution models - Monads, comprehensions, arrows, applicative functors, formlets, and other abstractions for combining or embedding models - Compilation and implementation techniques for cross-model programs - Type systems (polymorphism, dependent types, GADTs, modal types, refinement types) to support safe cross-model programming - Domain-specific embedded languages or libraries, syntax extensions, meta-programming facilities, or staged computation. - Language support for programming with XML, RDF, JSON, or other data interchange formats, or for programming Web services or other distributed programming formalisms. - Techniques for securing, debugging, performance profiling, optimization, or provenance tracking in cross-model programs. SUBMISSIONS: Submission should consist of short papers of at most 3 pages in ACM SIGPLAN conference format (sigplanconf.cls). Submissions will be accepted electronically. The submission site will be advertised around one month before the submission deadline. Simultaneous submission to another workshop, conference or journal is not allowed. An author of each accepted paper is expected to present the paper at the workshop. There will be no formal proceedings, but submissions will be made available from the workshop web page. Authors will retain the copyright. IMPORTANT DATES: Submission: May 15 Notification: July 1 Final papers due: August 1 Workshop: September 9 ICFP 2012: September 10-12 ORGANIZATION: Program committee: James Cheney, University of Edinburgh (co-chair) Kathleen Fisher, Tufts University Matthew Fluet, Rochester Institute of Technology Nate Foster, Cornell University Torsten Grust, University of Tuebingen (co-chair) Anastasios Kementsietsidis, IBM Research Shriram Krishnamurthi, Brown University Peter Thiemann, University of Freiburg Atsushi Ohori, Tohoku University Jan van den Bussche, University of Hasselt

1 0

Re: [Haskell] Look I found interesting opportunity...
by Craig Ugoretz 01 Mar '12

01 Mar '12

Hola! I couldnt even afford groceries for the month this helped me turn my luck around I was in desperate need of an alternative. <a href="http://lakpro.cz/newsjournal/99ColinAnderson/">http://lakpro.cz/newsjournal/99ColinAnderson/</a> now nobody disrespects me you can pull this off too

1 0

ANN: CoreFoundation-0.1
by Reiner Pope 01 Mar '12

01 Mar '12

Hi all, I have just made the first release of CoreFoundation on Hackage: http://hackage.haskell.org/package/CoreFoundation This library provides bindings to part of the Apple CoreFoundation framework. In particular, there is complete support for the CoreFoundation Preferences system, including pure marshalling between "property list" types and Haskell types. Cheers, Reiner

1 0

Haskell Weekly News: Issue 217
by Daniel Santa Cruz 01 Mar '12

01 Mar '12

Welcome to the 217th issue of the HWN, a newsletter covering developments in the Haskell community during the week of February 19 to 25, 2012. You can find the HTML version of this issue at: http://contemplatecode.blogspot.com/2012/02/haskell-weekly-news-issue-217.h… Quotes of the Week * nand`: oh, wait, ANSI is the physical layout * cmccann: some programmers have a problem to solve and think "I know, I need an existential type." now they have another problem, but can't solve it because all they know about it is that the problem exists. * Philippa: The only data type is Nat! (Which succs). * hpc: peano arithmetic SSSSZ life * cmccann: unicode snowman is a valid identifier in Haskell, BTW * Jafet: Haskell is an imperatively functional abstract enterprise programming language template * Cale: Array is immutable boxed Cale: UArray is immutable unboxed Cale: IOArray is mutable boxed elliott: IOUArray is an array of debts. * c_wraith: It [C] frees you to use whatever data structure you want, by providing you none! * Brandon Allbery: If you absolutely insist on shooting yourself in the foot this way in Haskell, it can be done; but there is no reason Haskell should make it *easy* to do so. That's C's superpower. :) Top Reddit Stories * ANNOUNCE: Sodium, a new Haskell FRP (Reactive Programming) system Domain: hackage.haskell.org, Score: 41, Comments: 38 On Reddit: [1] http://goo.gl/IY2a1 Original: [2] http://goo.gl/OOpl1 * Adventures in Parsec - Parsing logs in Haskell Domain: variadic.me, Score: 31, Comments: 24 On Reddit: [3] http://goo.gl/pkHdy Original: [4] http://goo.gl/fDRdE * Wanted: an efficient union algorithm for hash-array mapped tries Domain: blog.johantibell.com, Score: 30, Comments: 13 On Reddit: [5] http://goo.gl/p7n4c Original: [6] http://goo.gl/4XCui * How reliable is Hackage supposed to be? Domain: self.haskell, Score: 29, Comments: 20 On Reddit: [7] http://goo.gl/qfqJ3 Original: [8] http://goo.gl/qfqJ3 * Mathematics in the Age of the Turing Machine -- I recommend starting in section 2 Domain: math.pitt.edu, Score: 28, Comments: 1 On Reddit: [9] http://goo.gl/T4jGx Original: [10] http://goo.gl/9SmzX * Conduits: Simplifying ResourceT Domain: yesodweb.com, Score: 28, Comments: 6 On Reddit: [11] http://goo.gl/PW0C2 Original: [12] http://goo.gl/9a5Dz * Clarifying a mis-understanding about regions (and iteratees) Domain: haskell.org, Score: 27, Comments: 4 On Reddit: [13] http://goo.gl/P3sVE Original: [14] http://goo.gl/WWjUb * Concatenative Haskell Part II: Custom DSL Syntax Using QuasiQuotes Domain: github.com, Score: 25, Comments: 6 On Reddit: [15] http://goo.gl/DP0bY Original: [16] http://goo.gl/Lvlnc * Designing a serialization API Domain: blog.johantibell.com, Score: 24, Comments: 1 On Reddit: [17] http://goo.gl/SFMTx Original: [18] http://goo.gl/vcdsS * Getting Started with Disciple Core Domain: disciple.ouroborus.net, Score: 19, Comments: 1 On Reddit: [19] http://goo.gl/FCPla Original: [20] http://goo.gl/7J8oN * hs-logo: Logo turtle graphics interpreter written in Haskell Domain: deepakjois.github.com, Score: 18, Comments: 5 On Reddit: [21] http://goo.gl/wRIqZ Original: [22] http://goo.gl/JE37a * The Simply-typed Lambda Calculus with Constraints Domain: flippac.wordpress.com, Score: 16, Comments: 3 On Reddit: [23] http://goo.gl/ZNNB1 Original: [24] http://goo.gl/QbT6a * Data Structure Agnostic JSON Serialization Domain: blog.melding-monads.com, Score: 14, Comments: 1 On Reddit: [25] http://goo.gl/9QD9o Original: [26] http://goo.gl/WsPtb Top StackOverflow Questions * Evaluation strategy votes: 19, answers: 4 Read on SO: [27] http://goo.gl/rcJyz * Guards vs. if-then-else vs. cases in Haskell votes: 18, answers: 2 Read on SO: [28] http://goo.gl/BmH0X * Division by zero in Haskell votes: 15, answers: 4 Read on SO: [29] http://goo.gl/a0cER * Memory efficient strings in Haskell votes: 15, answers: 2 Read on SO: [30] http://goo.gl/4kUdm * What prevents an efficient Haskell virtual machine (like JVM)? votes: 12, answers: 4 Read on SO: [31] http://goo.gl/RphqH * Is indexing of Data.Vector.Unboxed.Mutable.MVector really this slow? votes: 11, answers: 2 Read on SO: [32] http://goo.gl/72fhd * Haskell: filtering a heterogenous list by type votes: 10, answers: 2 Read on SO: [33] http://goo.gl/uFm1I * ghci tab-completion in haskell-mode votes: 10, answers: 1 Read on SO: [34] http://goo.gl/QaAo5 * Non-maintainer uploads to Hackage votes: 10, answers: 2 Read on SO: [35] http://goo.gl/lVFHN * withFile vs. openFile votes: 9, answers: 4 Read on SO: [36] http://goo.gl/KQ6Fu Until next time, Daniel Santa Cruz References 1. http://hackage.haskell.org/package/sodium 2. http://www.reddit.com/r/haskell/comments/pyxpx/announce_sodium_a_new_haskel… 3. http://variadic.me/posts/2012-02-24-adventures-in-parsec.html 4. http://www.reddit.com/r/haskell/comments/q41rr/adventures_in_parsec_parsing… 5. http://blog.johantibell.com/2012/02/wanted-efficient-union-algorithm-for.ht… 6. http://www.reddit.com/r/haskell/comments/q0a02/wanted_an_efficient_union_al… 7. http://www.reddit.com/r/haskell/comments/pwjc9/how_reliable_is_hackage_supp… 8. http://www.reddit.com/r/haskell/comments/pwjc9/how_reliable_is_hackage_supp… 9. http://www.math.pitt.edu/~thales/papers/turing.pdf 10. http://www.reddit.com/r/haskell/comments/pwx2b/mathematics_in_the_age_of_th… 11. http://www.yesodweb.com/blog/2012/02/simplifying-resourcet 12. http://www.reddit.com/r/haskell/comments/q37rf/conduits_simplifying_resourc… 13. http://www.haskell.org/pipermail/haskell-cafe/2012-February/099689.html 14. http://www.reddit.com/r/haskell/comments/q293l/clarifying_a_misunderstandin… 15. https://github.com/leonidas/codeblog/blob/master/2012/2012-02-21-concatenat… 16. http://www.reddit.com/r/haskell/comments/pzh53/concatenative_haskell_part_i… 17. http://blog.johantibell.com/2012/02/designing-serialization-api.html 18. http://www.reddit.com/r/haskell/comments/q0kcv/designing_a_serialization_ap… 19. http://disciple.ouroborus.net/wiki/Tutorial/Core 20. http://www.reddit.com/r/haskell/comments/q1url/getting_started_with_discipl… 21. http://deepakjois.github.com/hs-logo/ 22. http://www.reddit.com/r/haskell/comments/pzf9k/hslogo_logo_turtle_graphics_… 23. http://flippac.wordpress.com/2012/02/23/the-simply-typed-lambda-calculus-wi… 24. http://www.reddit.com/r/haskell/comments/q2ga5/the_simplytyped_lambda_calcu… 25. http://blog.melding-monads.com/2012/02/24/data-structure-agnostic-json-seri… 26. http://www.reddit.com/r/haskell/comments/q3t70/data_structure_agnostic_json… 27. http://stackoverflow.com/questions/9439470/evaluation-strategy 28. http://stackoverflow.com/questions/9345589/guards-vs-if-then-else-vs-cases-… 29. http://stackoverflow.com/questions/9354016/division-by-zero-in-haskell 30. http://stackoverflow.com/questions/9398572/memory-efficient-strings-in-hask… 31. http://stackoverflow.com/questions/9352744/what-prevents-an-efficient-haske… 32. http://stackoverflow.com/questions/9409634/is-indexing-of-data-vector-unbox… 33. http://stackoverflow.com/questions/9396023/haskell-filtering-a-heterogenous… 34. http://stackoverflow.com/questions/9431779/ghci-tab-completion-in-haskell-m… 35. http://stackoverflow.com/questions/9435513/non-maintainer-uploads-to-hackage 36. http://stackoverflow.com/questions/9406463/withfile-vs-openfile

1 0