blob: 5b88844d7eeaf190b27f2b0f2d4fdb03124b8617 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
|
(* test evaluation order
'y' is translated into a constant, and is therefore considered
non-recursive. With the current letrec compilation method,
it should be evaluated before x and z.
*)
type tree = Tree of tree list
let test =
let rec x = (print_endline "x"; Tree [y; z])
and y = (print_endline "y"; Tree [])
and z = (print_endline "z"; Tree [x])
in
match (x, y, z) with
| (Tree [y1; z1], Tree[], Tree[x1]) ->
assert (y1 == y);
assert (z1 == z);
assert (x1 == x)
| _ ->
assert false
|
