- Haskell - Haskell.org

First call-for-papers - Linearity 2014
by Mário Florido 10 Jan '14

10 Jan '14

[We apologize if you have received multiple copies of this message] ============================================================================== Call for Papers Third International Workshop on Linearity http://vsl2014.at/linearity/ July 13, 2014 Vienna, Austria An associated event of the Joint meeting of the 23rd EACSL Annual Conference on Computer Science Logic (CSL) and the 29th ACM/IEEE Symposium on Logic in Computer Science (LICS), as part of the Vienna Summer of Logic. ============================================================================== Aim and Scope ------------- Ever since the birth of Girard's linear logic, there has been a stream of research where linearity is a key issue, covering both theoretical topics and applications to several areas of Computer Science, such as work on proof technology, complexity classes and more recently quantum computation, program analysis, expressive operational semantics, linear programming languages, and techniques for program transformation, update analysis and efficient implementation. The aim of this workshop is to bring together researchers who are currently developing theory and applications of linear calculi, to foster their interaction and provide a forum for presenting new ideas and work in progress, and enable newcomers to learn about current activities in this area. Linearity is a key feature in both theoretical and practical approaches to computer science, and the goal of this workshop is to present work exploring linearity both in theory and practice. Topics of interest include new results that make central use of linearity, ranging from foundational work to applications in any field, are welcome. Also welcome are more exploratory presentations, which may examine open questions and raise fundamental concerns about existing theories and practices. Specifically, topics of interest include, but are not limited to: * sub-linear logics * linear term calculi * linear type systems * linear proof-theory * linear programming languages * applications to concurrency * interaction-based systems * verification of linear systems * quantum models of computation * biological and chemical models of computation Important Dates --------------- * April 13, 2014: Submission deadline * May 10, 2014: Author notification * May 28, 2014: Deadline for final versions of accepted papers * July 13, 2014: Workshop Submission and Publication -------------------------- Authors are invited to submit an extended abstract (8 pages max) describing original ideas and recent results not published nor submitted elsewhere, or a 5-page abstract presenting relevant work that has been or will be published elsewhere, or work in progress. Preliminary proceedings will be available at the workshop. Papers should be written in English, and submitted in PostScript or PDF format, using the EPTCS style files. Submission is through the Easychair website: https://www.easychair.org/conferences/?conf=linearity2014 After the workshop, authors of the extended abstracts will be invited to submit a longe version of their work (typically a 15-pages paper) for publication in an electronic journal such as EPTCS. These submission will undergo a second round of referring. Furthermore, we envision publication of a special issue of a journal after the event. Programme Committee ------------------- * Sandra Alves (chair) * Iliano Cervesato (chair) * Kaustuv Chaudhuri * Maribel Fernández * Mário Florido * Simon Gay * Simone Martini * Luca Paolini * Simona Ronchi Della Rocca * Carsten Schuermann * Robert Simmons * Vasco Vasconcelos Contact ------- Sandra Alves: sandra(a)dcc.fc.up.pt <mailto:sandra@dcc.fc.up.pt> Iliano Cervesato: iliano(a)cmu.edu <mailto:iliano@cmu.edu>

1 0

Fun in the Afternoon at Facebook London: 12 March 2014
by Simon Marlow 10 Jan '14

10 Jan '14

[ please forward this to anyone who might be interested ] Fun in the Afternoon is a regular(ish) event consisting of talks about Functional Programming and related topics. The next one will be held at the Facebook offices in London on 12 March 2014 As with other Fun in the Afternoon events in the past (see http://sneezy.cs.nott.ac.uk/fun/) the plan is to have an afternoon of talks and meet up with fellow FPers, probably followed by some drinking and food. Facebook is located in Covent Garden, and is easily reachable by public transport (however, it is not so easily reachable by private transport!). I'll send out full details including the program and directions nearer the time. Anyone is welcome to attend - if you'd like to come along, just drop me an email. If you'd like to give a talk, please drop me an email containing a title and abstract. Talks will probably be about 30 minutes, depending on the number of talk proposals. The atmosphere is intended to be Fun and informal, so talks that are not fully-baked are completely fine. Try out your crazy ideas on a not-entirely-unforgiving audience. See you in London! Cheers, Simon

1 0

ICFP 2014: Call for papers
by David Van Horn 08 Jan '14

08 Jan '14

===================================================================== 19th ACM SIGPLAN International Conference on Functional Programming ICFP 2014 Gothenburg, Sweden, 1-3 September 2014 http://www.icfpconference.org/icfp2014 ===================================================================== Important Dates ~~~~~~~~~~~~~~~ Submissions due: Saturday, 1 March 2014, 23:59 UTC-11 (anywhere in the world) Author response: Wednesday, 23 April, 2014 Friday, 25 April, 2014 Notification: Monday, 5 May, 2014 Final copy due: Wednesday, 11 June, 2014 Scope ~~~~~ ICFP 2014 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, and from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects, concurrency, or parallelism. Topics of interest include (but are not limited to): * Language Design: concurrency and distribution; modules; components and composition; metaprogramming; interoperability; type systems; relations to imperative, object-oriented, or logic programming * Implementation: abstract machines; virtual machines; interpretation; compilation; compile-time and run-time optimization; memory management; multi-threading; exploiting parallel hardware; interfaces to foreign functions, services, components, or low-level machine resources * Software-Development Techniques: algorithms and data structures; design patterns; specification; verification; validation; proof assistants; debugging; testing; tracing; profiling * Foundations: formal semantics; lambda calculus; rewriting; type theory; monads; continuations; control; state; effects; program verification; dependent types * Analysis and Transformation: control-flow; data-flow; abstract interpretation; partial evaluation; program calculation * Applications and Domain-Specific Languages: symbolic computing; formal-methods tools; artificial intelligence; systems programming; distributed-systems and web programming; hardware design; databases; XML processing; scientific and numerical computing; graphical user interfaces; multimedia programming; scripting; system administration; security * Education: teaching introductory programming; parallel programming; mathematical proof; algebra * Functional Pearls: elegant, instructive, and fun essays on functional programming * Experience Reports: short papers that provide evidence that functional programming really works or describe obstacles that have kept it from working If you are concerned about the appropriateness of some topic, do not hesitate to contact the program chair. Abbreviated instructions for authors ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ * By Saturday, 1 March 2014, 23:59 UTC-11 (anywhere in the world), submit a full paper of at most 12 pages (6 pages for an Experience Report), including bibliography and figures. The deadlines will be strictly enforced and papers exceeding the page limits will be summarily rejected. * Authors have the option to attach supplementary material to a submission, on the understanding that reviewers may choose not to look at it. * Each submission must adhere to SIGPLAN's republication policy, as explained on the web at http://www.sigplan.org/Resources/Policies/Republication * Authors of resubmitted (but previously rejected) papers have the option to attach an annotated copy of the reviews of their previous submission(s), explaining how they have addressed these previous reviews in the present submission. If a reviewer identifies him/herself as a reviewer of this previous submission and wishes to see how his/her comments have been addressed, the program chair will communicate to this reviewer the annotated copy of his/her previous review. Otherwise, no reviewer will read the annotated copies of the previous reviews. Overall, a submission will be evaluated according to its relevance, correctness, significance, originality, and clarity. It should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. The technical content should be accessible to a broad audience. Functional Pearls and Experience Reports are separate categories of papers that need not report original research results and must be marked as such at the time of submission. Detailed guidelines on both categories are on the conference web site. Proceedings will be published by ACM Press. Authors of accepted submissions are expected to transfer the copyright to the ACM. Presentations will be videotaped and released online if the presenter consents. The proceedings will be freely available for download from the ACM Digital Library from one week before the start of the conference until two weeks after the conference. Formatting: Submissions must be in PDF format printable in black and white on US Letter sized paper and interpretable by Ghostscript. Papers must adhere to the standard ACM conference format: two columns, nine-point font on a ten-point baseline, with columns 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter of 2pc (0.33in). A suitable document template for LaTeX is available: http://www.acm.org/sigs/sigplan/authorInformation.htm Submission: Submissions will be accepted on the web at https://www.easychair.org/conferences/?conf=icfp2014 . Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface. Author response: Authors will have a 72-hour period, starting at 0:00 UTC-11 on Wednesday, 23 April 2014, to read reviews and respond to them. ACM Author-Izer is a unique service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge. Downloads through Author-Izer links are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking the definitive version of ACM article should reduce user confusion over article versioning. After your article has been published and assigned to your ACM Author Profile page, please visit http://www.acm.org/publications/acm-author-izer-service to learn how to create your links for fee downloads from the ACM DL. General Chair: Johan Jeuring, Utrecht University Program Chair: Manuel Chakravarty, University of New South Wales Program Committee: Edwin Brady, University of St Andrews Derek Dreyer, Max Planck Institute for Software Systems Ralf Hinze, University of Oxford Zhenjiang Hu, National Institute of Informatics Patricia Johann, Appalachian State University Ken Larsen, University of Copenhagen Yukiyoshi Kameyama, University of Tsukuba Anil Madhavapeddy, University of Cambridge Geoffrey Mainland, Drexel University David Mazières, Stanford University Jay McCarthy, Brigham Young University Matthew Might, University of Utah Ulf Norell, Chalmers University of Technology Tiark Rompf, Swiss Federal Institute of Technology in Lausanne Chung-chieh Shan, Indiana University Mary Sheeran, Chalmers University of Technology Matt Sottile, Galois Don Syme, Microsoft Research Jesse Tov, Harvard University

1 0

ANN: unicode-0.0
by Henning Thielemann 04 Jan '14

04 Jan '14

The first announcement this year: The 'unicode' package contains functions for construction of various characters like: * block graphic elements * frame elements * fractions * subscript and superscript characters http://hackage.haskell.org/package/unicode The package is simple Haskell 2010. For example usage see the included 'visualize' example, buildable with 'cabal install -fbuildExamples', and http://code.haskell.org/~thielema/set-cover/example/Domino.hs

1 0

[ANN] shapely-data v0.1
by Brandon Simmons 23 Dec '13

23 Dec '13

This is the first *real* release `shapely-data`, a haskell library up here on hackage: http://hackage.haskell.org/package/shapely-data for working with algebraic datatypes in a simple generic form made up of haskell's primitive product, sum and unit types: `(,)`, `Either`, and `()`. You can install it with cabal install shapely-data # Motivation and examples In order from most to least important to me, here are the concerns that motivated the library: - Provide a good story for `(,)`/`Either` as a *lingua franca* generic representation that other library writers can use without dependencies, encouraging abstractions in terms of products and sums (motivated specifically by my work on `simple-actors`: http://hackage.haskell.org/package/simple-actors - Support algebraic operations on ADTs, making types composable -- multiplication: let a = (X,(X,(X,()))) b = Left (Y,(Y,())) :: Either (Y,(Y,())) (Z,()) ab = a >*< b in ab == ( Left (X,(X,(X,(Y,(Y,()))))) :: Either (X,(X,(X,(Y,(Y,()))))) (X,(X,(X,(Z,())))) ) -- exponents, etc: fanout (head,(tail,(Prelude.length,()))) [1..3] == (1,([2,3],(3,()))) (unfanin (_4 `ary` (shiftl . Sh.reverse)) 1 2 3 4) == (3,(2,(1,(4,())))) - Support powerful, typed conversions between `Shapely` types data F1 = F1 (Maybe F1) (Maybe [Int]) deriving Eq data F2 = F2 (Maybe F2) (Maybe [Int]) deriving Eq f2 :: F2 f2 = coerce (F1 Nothing $ Just [1..3]) data Tsil a = Snoc (Tsil a) a | Lin deriving Eq truth = massage "123" == Snoc (Snoc (Snoc Lin '3') '2') '1' Lowest on the list is supporting abstracting over different recursion schemes or supporting generic traversals and folds, though some basic support is planned. Finally, in at least some cases this can completely replace `GHC.Generics` and may be a bit simpler. See `examples/Generics.hs` for an example of the `GHC.Generics` wiki example: http://www.haskell.org/haskellwiki/GHC.Generics ...ported to `shapely-data`. And for a nice view on the changes that were required, do: git show 3a65e95 | perl /usr/share/doc/git/contrib/diff-highlight/diff-highlight ## Why not GHC.Generics? The `GHC.Generics` representation has a lot of metadata and a complex structure that can be useful in deriving default instances; more important to us is to have a simple, canonical representation such that two types that differ only in constructor names can be expected to have identical generic representations. This supports APIs that are type-agnostic (e.g. a database library that returns a generic `Product`, convertible later with `to`), and allows us to define algebraic operations and composition & conversion functions. Happy Holidays, everybody! Brandon

1 0

Call for participation: Dutch Functional Programming Day 2014
by Clemens Grelck 23 Dec '13

23 Dec '13

Dear all, The next Dutch Functional Programming day (NL-FP 2014) will take place on Friday, January 10, 2014 at the University of Amsterdam at Amsterdam Science Park. You are all cordially invited to participate: registration is still open. The complete programme including abstracts of the talks as well as all further details can be found on the NL-FP 2014 site(s): http://staff.science.uva.nl/~grelck/nl-fp-day-2014.html http://staff.science.uva.nl/~grelck/nl-fp-dag-2014.html Merry Christmas and best wishes for the new year, Clemens Grelck -- ---------------------------------------------------------------------- Dr Clemens Grelck Science Park 904 University Lecturer 1098XH Amsterdam Netherlands University of Amsterdam Institute for Informatics T +31 (0) 20 525 8683 Computer Systems Architecture Group F +31 (0) 20 525 7490 Office C3.105 www.science.uva.nl/~grelck ----------------------------------------------------------------------

1 0

CFP - Rewriting Techniques for Program Transformations and Evaluation 2014
by Janis Voigtlaender 20 Dec '13

20 Dec '13

CALL FOR PAPERS First International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE'14) affiliated with RTA/TLCA 2014 (a FLoC 2014 workshop, FLoC is part of the Vienna Summer of Logic 2014) 13th July 2014, Vienna, Austria http://www.ki.informatik.uni-frankfurt.de/WPTE14 Aims and Scope ============== The aim of WPTE is to bring together the researchers working on program transformations, evaluation, and operationally based programming language semantics, using rewriting methods, in order to share the techniques and recent developments and to exchange ideas to encourage further activation of research in this area. Topics of interest and in the scope of WPTE are: * Correctness of program transformations, optimizations and translations. * Program transformations for proving termination, confluence and other properties. * Correctness of evaluation strategies. * Operational semantics of programs, operationally-based program equivalences such as contextual equivalences and bisimulations. * Cost-models for arguing about the optimizing power of transformations and the costs of evaluation. * Program transformations for verification and theorem proving purposes. * Translation, simulation, equivalence of programs with different formalisms, and evaluation strategies. * Program transformations for applying rewriting techniques to programs in specific programming languages. * Program inversions and program synthesis. The programming languages of interest include pure, deterministic, impure, non-deterministic, concurrent, parallel languages, and may employ programming paradigms such as functional, logical, typed, imperative, object-oriented, and higher-order. Paper Submissions and Proceedings ================================= WPTE accepts two different kinds of contributions: * Full-papers: ------------ Full-papers must represent original work and should be submitted using the EasyChair interface. We plan to publish full-papers as formal proceedings in the 'OpenAccess Series in Informatics (OASIcs)' of 'Schloss Dagstuhl Leibniz-Zentrum fuer Informatik'. Full-papers should not exceed 12 pages using the OASIcs LaTeX-templates. * Work in progress: ----------------- There will also be a slot for presenting work in progress. An extended abstract of at most 4 pages is required to be submitted using the EasyChair interface. These contributions will not be included in the OASIcs proceedings but they will be distributed to the workshop partipicants. One author of each accepted paper or abstract is expected to present it at the workshop. Important Dates =============== * Submission deadline: 25 April 2014 * Notification of acceptance: 23 May 2014 * Deadline for camera-ready proceedings: 28 May 2014 * Workshop: 13 July 2014, Austria, Vienna Weblinks ======== * EasyChair Submission Website https://www.easychair.org/conferences/?conf=wpte14 * Homepage of WPTE'14 http://www.ki.informatik.uni-frankfurt.de/WPTE14 * OASIcs Website (including LaTeX templates): http://www.dagstuhl.de/en/publications/oasics * Vienna Summer of Logic 2014 http://vsl2014.at Program Committee ================= Takahito Aoto (RIEC, Tohoku University) Yuki Chiba (Japan Advanced Institute of Science and Technology) Fer-Jan de Vries (University of Leicester) Santiago Escobar (Universitat Politècnica de València) Maribel Fernández (King's College London) Johan Jeuring (Open Universiteit Nederland and Universiteit Utrecht) Delia Kesner (Université Paris-Diderot) Sergueï Lenglet (Université de Lorraine) Elena Machkasova (University of Minnesota, Morris) Joachim Niehren (INRIA Lille) David Sabel (Goethe-University Frankfurt am Main) Masahiko Sakai (Nagoya University) Manfred Schmidt-Schauß (Goethe-University Frankfurt am Main) - chair Eijiro Sumii (Tohoku University) Janis Voigtländer (University of Bonn) Harald Zankl (University of Innsbruck) Organizers ========== Manfred Schmidt-Schauß (Goethe-University Frankfurt am Main) - chair Masahiko Sakai (Nagoya University) David Sabel (Goethe-University Frankfurt am Main) Yuki Chiba (Japan Advanced Institute of Science and Technology)

1 0

Call for Papers: ITP 2014
by Gerwin Klein 20 Dec '13

20 Dec '13

Call for Papers ITP 2014 5th International Conference on Interactive Theorem Proving 14th-17th July 2014 in Vienna, Austria http://www.cs.uwyo.edu/~ruben/itp-2014 IMPORTANT DATES Abstract submission: 24th January 2014 Paper submission: 31st January 2014 Author notification: 21st March 2014 Camera-ready: 18th April 2014 Conference: 14th-17th July 2014 CONFERENCE BACKGROUND ITP is the premier international conference for researchers from all areas of interactive theorem proving and its applications. It represents the natural evolution of the TPHOLs conference series to include research related to all other interactive theorem provers. TPHOLs meetings took place every year from 1988 until 2009. In 2010, the first ITP conference was held in Edinburgh, Scotland, as part of the Federated Logic Conference (FLoC). Subsequent ITP conferences were held in Nijmegen, The Netherlands, in 2011, Princeton, New Jersey, USA, in 2012, and Rennes, France in 2013. ITP 2014 will again be a part of FLoC, in Vienna, Austria. PAPER SUBMISSIONS ITP welcomes submissions describing original research on all aspects of interactive theorem proving and its applications. In particular, the ITP community is open to users of all interactive theorem provers. Suggested topics include but are not limited to the following: -> formal aspects of hardware and software, -> formalizations of mathematics, -> improvements in theorem prover technology, -> user interfaces for interactive theorem provers, -> formalizations of computational models, -> use of theorem provers in education, -> industrial applications of interactive theorem provers, and -> concise and elegant worked examples of formalizations ("Proof Pearls"). Submissions must be made electronically in PDF format. Submissions should be prepared using the Springer LNCS format, available from http://www.springer.com/computer/lncs/lncs+authors, and submitted via EasyChair. Submissions must describe original unpublished work not submitted for publication elsewhere, presented in a way that is accessible to users of other systems. The proceedings will be published as a volume in the Springer Lecture Notes in Computer Science series and will be available to participants at the conference. ITP accepts both long papers (up to 16 pages) and "rough diamonds" (up to six pages, possibly in the form of an extended abstract). Both categories of papers will be fully refereed and included in the published proceedings. Papers in the "rough diamonds" category are expected to present innovative and promising ideas that have not yet had the time to mature. Regular papers are expected to present mature research projects with appropriate supporting evidence. All papers should have an abstract of approximately 100 words. Note that abstracts must be submitted a week prior to the paper submission deadline. Papers should also include a list of relevant keywords, which must include the name of the theorem prover featured in the paper. We strongly encourage submissions that describe interactions with or improvements of a theorem prover. Authors of such papers should provide verifiable evidence of an implementation, such as appropriate source files. This material may be uploaded via EasyChair or may be placed online, as long as a URL is included with the submission. Authors of accepted papers are expected to present their papers at the conference, and will be required to sign copyright release forms. All submissions must be written in English. ORGANIZATION Program Chairs Gerwin Klein, NICTA and The University of New South Wales, Australia Ruben Gamboa, University of Wyoming, USA Workshop Chair David Pichardie, INRIA, France Program Committee Jeremy Avigad, Carnegie Mellon University Lennart Beringer, Princeton University Yves Bertot, INRIA Thierry Coquand, Chalmers University Amy Felty, University of Ottawa Ruben Gamboa, University of Wyoming Georges Gonthier, Microsoft Research Elsa Gunter, University of Illinois at Urbana-Champaign John Harrison, Intel Corporation Matt Kaufmann, University of Texas at Austin Gerwin Klein, NICTA and UNSW Alexander Krauss, Technische Universität München Ramana Kumar, University of Cambridge Joe Leslie-Hurd, Intel Corporation Assia Mahboubi, INRIA - École polytechnique Panagiotis Manolios, Northeastern University Magnus O. Myreen, University of Cambridge Tobias Nipkow, TU München Michael Norrish, NICTA Sam Owre, SRI International Christine Paulin-Mohring, Université Paris-Sud Lawrence Paulson, University of Cambridge David Pichardie, INRIA Rennes - Bretagne Atlantique Lee Pike, Galois, Inc. Jose-Luis Ruiz-Reina, University of Seville Julien Schmaltz, Open University of the Netherlands Bas Spitters, Radboud University Nijmegen Sofiene Tahar, Concordia University René Thiemann, University of Innsbruck Laurent Théry, INRIA Christian Urban, King's College London Tjark Weber, Uppsala University Makarius Wenzel, Université Paris-Sud 11

1 0

Haskell Weekly News: Issue 288
by Daniel Santa Cruz 20 Dec '13

20 Dec '13

Welcome to issue 288 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week from December 08 to 14, 2013. Quotes of the Week * nlogax: With FRP.Sodium and Graphics.UI.GLUT you could put together a MonadSodium GLUTamate Top Reddit Stories * The reason why `cabal update` takes so long Domain: github.com, Score: 175, Comments: 89 On Reddit: [1] http://goo.gl/NCsf34 Original: [2] http://goo.gl/BLp5LB * structured-haskell-mode — Structured editing minor mode for Haskell in Emacs Domain: github.com, Score: 103, Comments: 37 On Reddit: [3] http://goo.gl/t8dyd9 Original: [4] http://goo.gl/v6W7js * Amazing LVars talk by Linsey Kuper Domain: youtu.be, Score: 86, Comments: 20 On Reddit: [5] http://goo.gl/JcbNQn Original: [6] http://goo.gl/JPyVnG * 24 Days of Hackage: acid-state Domain: ocharles.org.uk, Score: 84, Comments: 15 On Reddit: [7] http://goo.gl/CBU18T Original: [8] http://goo.gl/W4u7GG * 24 Days of Hackage: pandoc Domain: ocharles.org.uk, Score: 66, Comments: 14 On Reddit: [9] http://goo.gl/rUO2yc Original: [10] http://goo.gl/PhTTFC * text 1.0.0.0 Domain: hackage.haskell.org, Score: 64, Comments: 25 On Reddit: [11] http://goo.gl/9k7ksP Original: [12] http://goo.gl/ISESbc * 24 Days of Hackage: async Domain: ocharles.org.uk, Score: 59, Comments: 11 On Reddit: [13] http://goo.gl/rhrdgM Original: [14] http://goo.gl/C4sQeh * 24 Days of Hackage: sbv (guest post by Tikhon Jelvis) Domain: ocharles.org.uk, Score: 57, Comments: 21 On Reddit: [15] http://goo.gl/YkLqo9 Original: [16] http://goo.gl/frHdyn * 24 Days of Hackage: data-memocombinators Domain: ocharles.org.uk, Score: 56, Comments: 18 On Reddit: [17] http://goo.gl/0FgDo6 Original: [18] http://goo.gl/4GcFKd * Bryan O'Sullivan - Package dependency management: more debate is needed Domain: plus.google.com, Score: 51, Comments: 45 On Reddit: [19] http://goo.gl/Xr7NkU Original: [20] http://goo.gl/f1VPxt * 24 Days of Hackage: gloss Domain: ocharles.org.uk, Score: 49, Comments: 10 On Reddit: [21] http://goo.gl/yBAlXk Original: [22] http://goo.gl/mplvhP * The future of array-oriented computing in Haskell — a survey Domain: justtesting.org, Score: 45, Comments: 11 On Reddit: [23] http://goo.gl/doVpgz Original: [24] http://goo.gl/ezkftd * Progress Reporting in Shake Domain: neilmitchell.blogspot.it, Score: 42, Comments: 3 On Reddit: [25] http://goo.gl/1hvu6c Original: [26] http://goo.gl/4izrhK * [ANN] SFML and SFML-control Domain: self.haskell, Score: 40, Comments: 20 On Reddit: [27] http://goo.gl/NhMJbR Original: [28] http://goo.gl/NhMJbR * 24 Days of Hackage: heist Domain: ocharles.org.uk, Score: 40, Comments: 28 On Reddit: [29] http://goo.gl/FtvnLs Original: [30] http://goo.gl/nEU9Hw Top StackOverflow Questions * How are J/K/APL classified in terms of common paradigms? votes: 10, answers: 1 Read on SO: [31] http://goo.gl/ImISrG * Is it possible to extend free monad interpreters? votes: 9, answers: 5 Read on SO: [32] http://goo.gl/CiJupH * How to detect a Monad? votes: 8, answers: 4 Read on SO: [33] http://goo.gl/WiUhba * Why do Haskell type signature declarations have multiple arrows? votes: 7, answers: 3 Read on SO: [34] http://goo.gl/0LWfMb * “Inheriting” instance of wrapped type votes: 7, answers: 1 Read on SO: [35] http://goo.gl/qBhrqD * Equality function for pair components votes: 7, answers: 1 Read on SO: [36] http://goo.gl/mLk49N * Motivation of having Functional Dependencies votes: 7, answers: 1 Read on SO: [37] http://goo.gl/E31zjJ * Haskell - Lenses, use of 'to' function votes: 7, answers: 1 Read on SO: [38] http://goo.gl/5A028y * What does PINNED mean in -hc profile of Haskell program? votes: 6, answers: 1 Read on SO: [39] http://goo.gl/Qx9eJB Until next time, [40]+Daniel Santa Cruz References 1. https://github.com/nominolo/HTTP/commit/b9bd0a08fa09c6403f91422e3b23f08d339… 2. http://www.reddit.com/r/haskell/comments/1sh67u/the_reason_why_cabal_update… 3. https://github.com/chrisdone/structured-haskell-mode 4. http://www.reddit.com/r/haskell/comments/1sd3aj/structuredhaskellmode_struc… 5. http://youtu.be/8dFO5Ir0xqY 6. http://www.reddit.com/r/haskell/comments/1skf3x/amazing_lvars_talk_by_linse… 7. http://ocharles.org.uk/blog/posts/2013-12-14-24-days-of-hackage-acid-state.… 8. http://www.reddit.com/r/haskell/comments/1svlm2/24_days_of_hackage_acidstat… 9. http://ocharles.org.uk/blog/guest-posts/2013-12-12-24-days-of-hackage-pando… 10. http://www.reddit.com/r/haskell/comments/1srcz6/24_days_of_hackage_pandoc/ 11. http://hackage.haskell.org/package/text-1.0.0.0 12. http://www.reddit.com/r/haskell/comments/1st4jl/text_1000/ 13. http://ocharles.org.uk/blog/posts/2013-12-13-24-days-of-hackage-async.html 14. http://www.reddit.com/r/haskell/comments/1stf7l/24_days_of_hackage_async/ 15. http://ocharles.org.uk/blog/guest-posts/2013-12-09-24-days-of-hackage-sbv.h… 16. http://www.reddit.com/r/haskell/comments/1shnr7/24_days_of_hackage_sbv_gues… 17. http://ocharles.org.uk/blog/posts/2013-12-08-24-days-of-hackage-data-memoco… 18. http://www.reddit.com/r/haskell/comments/1settx/24_days_of_hackage_datamemo… 19. https://plus.google.com/103469090998089605155/posts/HdC6oCy8RWW 20. http://www.reddit.com/r/haskell/comments/1sdwot/bryan_osullivan_package_dep… 21. http://ocharles.org.uk/blog/posts/2013-12-10-24-days-of-hackage-gloss.html 22. http://www.reddit.com/r/haskell/comments/1sl0y5/24_days_of_hackage_gloss/ 23. http://justtesting.org/post/69439080517/the-future-of-array-oriented-comput… 24. http://www.reddit.com/r/haskell/comments/1sfg7l/the_future_of_arrayoriented… 25. http://neilmitchell.blogspot.it/2013/12/progress-reporting-in-shake.html 26. http://www.reddit.com/r/haskell/comments/1sqsyi/progress_reporting_in_shake/ 27. http://www.reddit.com/r/haskell/comments/1sjemq/ann_sfml_and_sfmlcontrol/ 28. http://www.reddit.com/r/haskell/comments/1sjemq/ann_sfml_and_sfmlcontrol/ 29. http://ocharles.org.uk/blog/posts/2013-12-11-24-days-of-hackage-heist.html 30. http://www.reddit.com/r/haskell/comments/1sob71/24_days_of_hackage_heist/ 31. http://stackoverflow.com/questions/20558170/how-are-j-k-apl-classified-in-t… 32. http://stackoverflow.com/questions/20564633/is-it-possible-to-extend-free-m… 33. http://stackoverflow.com/questions/20495627/how-to-detect-a-monad 34. http://stackoverflow.com/questions/20459981/why-do-haskell-type-signature-d… 35. http://stackoverflow.com/questions/20481718/inheriting-instance-of-wrapped-… 36. http://stackoverflow.com/questions/20515404/equality-function-for-pair-comp… 37. http://stackoverflow.com/questions/20526828/motivation-of-having-functional… 38. http://stackoverflow.com/questions/20528718/haskell-lenses-use-of-to-functi… 39. http://stackoverflow.com/questions/20478805/what-does-pinned-mean-in-hc-pro… 40. https://plus.google.com/105107667630152149014/about

1 0

Monad.Reader #23 call for copy
by Edward Z. Yang 18 Dec '13

18 Dec '13

Call for Copy: The Monad.Reader - Issue 23 -------------------------------------------- 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 23 will be: **Friday, January 17, 2014** 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.

2 1