(** ** Building the sorted list *)
#[deprecated(since="8.3", note="Use mergesort.v")]

(* Specifications: *)
Lemma heap_to_list : forall T:Tree, is_heap T -> flat_spec T.
#[deprecated(since="8.3", note="Use mergesort.v")]
(** * Specification of treesort *)
Theorem treesort :
forall l:list A,
{m : list A | Sorted leA m & permutation _ eqA_dec l m}.