diff options
author | coq <coq@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2003-12-30 09:53:31 +0000 |
---|---|---|
committer | coq <coq@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2003-12-30 09:53:31 +0000 |
commit | bb6e15cb3d64f2902f98d01b8fe12948a7191095 (patch) | |
tree | cbc0a0f8e740505fb14d13daa47a30070ff258ea /doc/Extraction.tex | |
parent | c15a7826ecaa05bb36e934237b479c7ab2136037 (diff) |
modif generales claude
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@8455 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'doc/Extraction.tex')
-rwxr-xr-x | doc/Extraction.tex | 24 |
1 files changed, 14 insertions, 10 deletions
diff --git a/doc/Extraction.tex b/doc/Extraction.tex index 12a9616e2..19be94560 100755 --- a/doc/Extraction.tex +++ b/doc/Extraction.tex @@ -538,19 +538,23 @@ let treesort leA_dec eqA_dec l = \end{verbatim} Let's test it: - +% Format.set_margin 72;; \begin{verbatim} # #use "heapsort.ml";; type sumbool = Left | Right type nat = O | S of nat type 'a tree = Tree_Leaf | Tree_Node of 'a * 'a tree * 'a tree type 'a list = Nil | Cons of 'a * 'a list -val merge : ('a -> 'a -> sumbool) -> 'b -> 'a list -> 'a list -> 'a list = - <fun> -val heap_to_list : ('a -> 'a -> sumbool) -> 'b -> 'a tree -> 'a list = <fun> -val insert : ('a -> 'a -> sumbool) -> 'b -> 'a tree -> 'a -> 'a tree = <fun> -val list_to_heap : ('a -> 'a -> sumbool) -> 'b -> 'a list -> 'a tree = <fun> -val treesort : ('a -> 'a -> sumbool) -> 'b -> 'a list -> 'a list = <fun> +val merge : + ('a -> 'a -> sumbool) -> 'b -> 'a list -> 'a list -> 'a list = <fun> +val heap_to_list : + ('a -> 'a -> sumbool) -> 'b -> 'a tree -> 'a list = <fun> +val insert : + ('a -> 'a -> sumbool) -> 'b -> 'a tree -> 'a -> 'a tree = <fun> +val list_to_heap : + ('a -> 'a -> sumbool) -> 'b -> 'a list -> 'a tree = <fun> +val treesort : + ('a -> 'a -> sumbool) -> 'b -> 'a list -> 'a list = <fun> \end{verbatim} One can remark that the argument of {\tt treesort} corresponding to @@ -566,9 +570,9 @@ val leAdec : 'a -> 'a -> sumbool = <fun> # let rec listn = function 0 -> Nil | n -> Cons(Random.int 10000,listn (n-1));; val listn : int -> int list = <fun> -# treesort leAdec () (listn 10);; -- : int list = Cons (136, Cons (760, Cons (1512, Cons (2776, Cons (3064, -Cons (4536, Cons (5768, Cons (7560, Cons (8856, Cons (8952, Nil)))))))))) +# treesort leAdec () (listn 9);; +- : int list = Cons (160, Cons (883, Cons (1874, Cons (3275, Cons + (5392, Cons (7320, Cons (8512, Cons (9632, Cons (9876, Nil))))))))) \end{verbatim} Some tests on longer lists (10000 elements) show that the program is |