This is a special case you mentionned there; it’s not about lists, it’s about Functor. And applying a function with fmap using ($) is quite ugly.


On Mon, Feb 17, 2014 at 9:41 AM, Andreas Abel <abela@chalmers.se> wrote:
I am a -1 on both proposals, i.e., on having a special map for the "apply to a fixed argument" case.


On 16.02.2014 21:42, Nikita Volkov wrote:
Also, since the variable input of this combinator seems to be on the
functor side I suggest to inverse the arguments order order, i.e.:

     mapf :: a -> f (a -> b) -> f b

This way it'll target composition. And since it's a combinator over
functions it's a pretty important thing. E.g.:
     mapf 2 . map (*) $ [1..10]

I'd simply write

  map (2 *) [1..10]

Cheers,
Andreas

--
Andreas Abel  <><      Du bist der geliebte Mensch.

Depeartment of Computer Science and Engineering
Chalmers and Gothenburg University, Sweden

andreas.abel@gu.se
http://www2.tcs.ifi.lmu.de/~abel/