仅仅用map确实是不可能的，但是可以用显式递归来实现，如下所示：

bowling :: [Int] -> [Int]
bowling [] = []
bowling (x:xs) = case x of
    10 -> case xs of
        y:z:_ -> x + y + z:bowling xs
        _ -> error "Uh oh, got a 10 but one or both of the next two numbers to add were missing"
    _ -> x:bowling xs

如果你真的想用高阶函数来实现这一点，你可以用mapAccumR或para来代替。例如，用mapAccumR：

import Data.Traversable (mapAccumR)

bowling :: [Int] -> [Int]
bowling = snd . mapAccumR go (uhoh,uhoh) where
  go :: (Int,Int) -> Int -> ((Int,Int), Int)
  go ~(y,z) x = ((x,y), if x == 10 then x+y+z else x)
  uhoh :: Int
  uhoh = error "Uh oh, got a 10 but one or both of the next two numbers to add were missing"