Re: Proposal reminder: Add functions to get consecutive elements to Data.List

We have now passed the deadline for discussion of this proposal. The count is 2 for and 3 against. Including myself in the vote would yield a tie on the outcome. The response was more positive than I had thought it would be, albeit not entirely conclusive. I think it would be fair to put this to rest for now. I guess it will come up again in the future, since the functions are useful enough to warrant a common name IMO. Many thanks to all for the valuable input. /Johan 2016-05-20 7:27 GMT+02:00 wren romano :

On Thu, May 19, 2016 at 2:33 PM, Theodore Lief Gannon wrote:

...

Whoops, responded privately (and also made a mistake I wanted to correct, so I guess that works out). To the list this time:

I don't like using the 'zip' terminology here; I feel like that should be reserved for multiple distinct data sources.

Why not 'map2'?

I too dislike the "zip" terminology here, for the same reason. But I also I mislike "map" since this isn't functorial in any particular way (I'd expect "map2" to have to do with some sort of 2-functors).

I'm agnostic on adding the function vs not, but If we're bikeshedding for short names how about "twine"? (The problem I see with "pairwise" is that it's ambiguous about whether values get "reused": i.e., matching even elements to odds[1], vs matching every element to the next/last.)

[1] I also note without comment that this interpretation is the inverse to what is traditionally called "zip" in the non-wellfounded set theory community; e.g., when viewing streams (like the Thue–Morse sequence) as a greatest solution to a system of equations.

-- Live well, ~wren _______________________________________________ Libraries mailing list Libraries@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries