Understanding scan from a Functional Programming/Category Theory/Haskell perspective

[pharringtonp19]

As @patrick-kidger and @cgarciae pointed out in their paper on Equinox, we can think of jax.tree_map as a functor.

Would it be correct to think of jax.lax.scan as a bifunctor?

The haskell-like type signature of scan Is very similar to the haskell type signature of bimap

scan :: (c -> a -> (c, b)) -> c -> [a] -> (c, [b]) 

bimap :: (a -> a') -> (b -> b') -> f a b -> f a' b'      

(bimap type signature from here)