(**  An alternative tail-recursive definition for reverse *)
Fixpoint rev_append (l l': list A) : list A :=
match l with
| [] => l'
| a :: l => rev_append l (a::l')
end.
Definition rev' l : list A := rev_append l [].

(* Specifications: *)
Lemma rev_append_rev : forall l l', rev_append l l' = rev l ++ l'.
Lemma rev_alt : forall l, rev l = rev_append l [].
Fixpoint concat (l : list (list A)) : list A :=
match l with
| [] => []
| x :: l => x ++ concat l
end.