l >|= f is the infix version of map with reversed arguments.

l1 @ l2 concatenates two lists l1 and l2. As append.

funs <*> l is product (fun f x -> f x) funs l.

f <$> l is like map.

l >>= f is flat_map f l.

i -- j is the infix alias for range. Bounds included.

i --^ j is the infix alias for range'. Second bound j excluded.

• since 0.17

(and&) is combine_shortest. It allows to perform a synchronized product between two lists, stopping gently at the shortest. Usable both with let+ and let*.

    # let f xs ys zs =
        let+ x = xs
        and& y = ys
        and& z = zs in
        x + y + z;;
    val f : int list -> int list -> int list -> int list = <fun>
    # f [1;2] [5;6;7] [10;10];;
    - : int list = [16; 18]

• since 3.1