The Coq mailing list

[roconnor AT theorem.ca]

Does anyone know of a nice way of converting a list into a complete binary
tree using structural recursion such that the order is preserved?  Perhaps
more importantly, is there a way to deduce such a function?

-- 
Russell O'Connor                                      <http://r6.ca/>
``All talk about `theft,''' the general counsel of the American Graphophone
Company wrote, ``is the merest claptrap, for there exists no property in
ideas musical, literary or artistic, except as defined by statute.''