Chris Okasaki's "Purely Functional Data Structures", Chapter 2 Excercises

PFDS_Chapter2.ml

(* Excercise 2.1
 * We proceed by induction.
 * If 'lst' is an empty list, we simply return lst itself.
 * If 'lst' is a non-empty list, we store the pointer to the tail of the list,
 * plus any pointers stored by a recursive call to suffixes.
 * []
 *)
let rec suffixes lst =
    match lst with
    [] -> lst
    | _ -> let tail = (List.tl lst) in
        tail :: (suffixes tail);;