One reasonable metric for rating them might be: Imagine you're seeing the function name for the first time, together with a definition of its signature (parameter/return types). Would you have guessed its correct meaning? How sure would you have been?

Of course that's still subjective, so let me present my intuitive reactions so that you can compare them to your own:

Simple version of the function: Map a list to all its subsequences of 2 adjacent items

For the "pairwise" version, the function would only take a code block and a list. Given that function signature, I think the only ones for which I would have guessed the correct meaning and would have been reasonably sure about it, are:

RESULT_LIST = map_adjacent { CODE } LIST
[download]

RESULT_LIST = neighbors { CODE } LIST
[download]

A few comments on some of the others:

• RESULT_LIST = adjoin { CODE } LIST
  [download]

  Doesn't sound like it operates on adjoining items, but rather like it causes things to adjoin (in some unspecified way).

• RESULT_LIST = overlaps { CODE } LIST
  [download]

  Sounds like it does something less generic and more complicated, although I wouldn't be sure what. Maybe LIST accepts a list of ranges rather then numbers, and the function finds (and processes) overlapping ranges? Or something.

• RESULT_LIST = mapAdj { CODE } LIST
  [download]

  Map "adjacent"? Map "adjusted"? Map "adjunct"? ...

• RESULT_LIST = between { CODE } LIST
  RESULT_LIST = between_pairs { CODE } LIST
  [download]

  I might have guessed this one correctly, but would have felt unsure about it.

• RESULT_LIST = pipeline { CODE } LIST
  [download]

  Sounds like the return value of CODE becomes the first input parameter for the next iteration, like in List::Util's reduce. At least that would match my understanding of pipelines in computing.

• RESULT_LIST = map_right_neighbour { CODE } LIST
  [download]

  Sounds like it does one iteration strictly for each element of LIST, with $b set to the element's right neighbor, and on the last iteration, $b set to undef.

Generalized version of the function: Map a list to all its subsequences of n adjacent items

In this case, the function would likely take a code block, a number, and a list. Unfortunately, I don't think I would be very sure about any of my guesses in this scenario, for any of the suggested names. One that hasn't been suggested yet (probably because it's too long), but would be pretty self-explanatory for me, is:

RESULT_LIST = natatime_sliding { CODE } NUMBER, LIST
[download]

Those where there's at least a decent chance that I would have guessed the correct meaning, are, in descending order:

RESULT_LIST = map_adjacent { CODE } NUMBER, LIST
[download]

RESULT_LIST = moving { CODE } NUMBER, LIST
[download]

RESULT_LIST = slide { CODE } NUMBER, LIST
[download]

moving is nice because it's effectively a generalization of "moving average" to "moving <custom calculation>"...

@moving_averages = moving { sum(@_)/@_ } $n, @data
[download]

...but of course if the context in which you're using it has nothing to do with statistics, that recognition value will be lost.

between and map_right_neighbour wouldn't work at all anymore for n > 2.
adjoin, overlaps, mapAdj and pipeline would still have the same problems as above.