September 2015 - Libraries

ANN: CfN for new Haskell Prime language committee
by Herbert Valerio Riedel 23 Sep '15

23 Sep '15

Dear Haskell Community, In short, it's time to assemble a new Haskell Prime language committee. Please refer to the CfN at https://mail.haskell.org/pipermail/haskell-prime/2015-September/003936.html for more details. Cheers, hvr -- PGP fingerprint: 427C B69A AC9D 00F2 A43C AF1C BA3C BA3F FE22 B574

1 0

Proposal: Data.Functor.<.> for `fmap f2 . f1`
by Ömer Sinan Ağacan 21 Sep '15

21 Sep '15

I don't know if "I find this very useful" is enough for adding a function to base, but here it goes: infixl 4 <.> (<.>) :: Functor f => (b -> c) -> (a -> f b) -> (a -> f c) f1 <.> f2 = fmap f1 . f2 {-# INLINE (<.>) #-} I first defined this couple of months ago and I find myself looking for this function all the time now. One problem with this is that the name is used by widely used `filepath` library.

8 8

Proposal: Export Any from Unsafe.Coerce
by David Feuer 15 Sep '15

15 Sep '15

Any is the sanctioned intermediary for unsafeCoerce. GHC claims to guarantee that any lifted type can be coerced to and from Any without harm. Yet Any seems to be available only from the deeply mystical GHC.Prim, which users outside the GHC source tree are never supposed to import. While GHC.Exts would be an acceptable place, I think Unsafe.Coerce is more appropriate, and will make it easier for users to find this type.

4 3

List function pragma discipline
by Joachim Breitner 12 Sep '15

12 Sep '15

Dear list, I was working on https://ghc.haskell.org/trac/ghc/ticket/10788 (performance regressions involving minimum), and I found it quite unsatisfactory to twiddle with individual functions, based on individual test cases, this way. Of course I can improve things for a combination of functions and testcase, but if so, shouldn’t I be improving others as well? What about other test cases – will they regress? How should I balance the goals of speed, code size and simplicity? This feels more like a random walk rather than hill-climbing, let alone a disciplined approach to the problem. Can we have a disciplined approach? I.e. a set of guidelines that work well in general, can be documented and communicated to the user, and that we can follow in such cases? Here is a rough draft, more to show what I am aiming for, rather than a finished work: * Functions that can take part in list fusion have RULES to rewrite them in terms of foldr/build, but also RULES to write them back. Phase control ensures that this is done by phase 0, and the following applies to phase 0. * Recursive non-polymorphic non-higher-order functions are not marked as INLINE (and thus not inlineable, beside possibly the wrapper of a worker-wrapper split). * Recursive polymorphic non-higher-order functions are marked as INLINEABLE, and SPECIALIZE pragmas are given for common cases. (Example: minimum, maximum). * Recursive higher-order functions are implemented with a local recursive function, to allow for inlining (foldl, foldr, maximumBy), at least if there is a chance of further optimizations due to strictness analysis. Given such a guideline, I would then know what to do with such a ticket, instead of stabbing in the dark. It might mean that we would have to tell a user who observes suboptimal performance in one case that this is unavoidable (we cannot optimize for everyone) and possibly explain how to work around the issue. Or we might find that the discipline could be improved, but then the improvement should be applied to all functions. Thoughts? Joachim -- Joachim “nomeata” Breitner mail(a)joachim-breitner.de • http://www.joachim-breitner.de/ Jabber: nomeata(a)joachim-breitner.de • GPG-Key: 0xF0FBF51F Debian Developer: nomeata(a)debian.org

4 3

ANNOUNCE: graphviz-2999.18.0.0
by Ivan Lazar Miljenovic 06 Sep '15

06 Sep '15

This is my "sorry it took so long" release: I'd like to apologise to all the people that have been nagging^W gently asking me when a GHC 7.10.*-compatible release would be available that it's taken me until now to do this, but I'm finally pleased to be able to say that you can now use my graphviz library to generate/parse Dot code and visualise graphs using the Graphviz suite of tools. As part of this version release, graphviz is now developed using git and can be found on GitHub: https://github.com/ivan-m/graphviz The major version bump is due to an extra attribute being made available, so in most (all?) cases you can safely version bump your existing dependencies. -- Ivan Lazar Miljenovic Ivan.Miljenovic(a)gmail.com http://IvanMiljenovic.wordpress.com

1 0

Proposal: generalise Monoid's mconcat
by Fermin Reig 01 Sep '15

01 Sep '15

We could generalise: mconcat:: [a] -> a mconcat = foldr mappend memtpy to: mconcat:: Foldable t => t a -> a mconcat = foldr mappend memtpy -- even -- mconcat = fold Fermin PS: I cannot find a proposal for this in the archives, apologies if it's been raised before and I missed it.

9 11