Purely Functional Data Structures - Chris Okasaki

gistfile1.ml

(* This uses the @ operator (aka List.append) which is not tail recursive *)
let suffixes list =
	let rec loop l acc =
		match l with
		| [] -> acc
		| x::xs -> loop xs (acc @ [xs]) in
	loop list [list]

(* This uses an operator @+ constructed from two tail recursive methods... :P *)
let suffixesTR list =
        let (@+) x y = List.rev_append (List.rev x) y in
	let rec loop l acc =
		match l with
		| [] -> acc
		| x::xs -> loop xs (acc @+ [xs]) in
	loop list [list]