ocaml: phase 5.1 permutations_gen.ml baseline (24 perms, 12 with a<b ends)

Recursive permutation generator via fold-pick-recurse:

  let rec permutations xs = match xs with
    | [] -> [[]]
    | _ ->
      List.fold_left (fun acc x ->
        let rest = List.filter (fun y -> y <> x) xs in
        let subs = permutations rest in
        acc @ List.map (fun p -> x :: p) subs
      ) [] xs

For permutations of [1; 2; 3; 4] (24 total), count those whose
first element is less than the last:

  match p with
  | [a; _; _; b] when a < b -> count := !count + 1
  | _ -> ()

By symmetry, exactly half satisfy a < b = 12.

Tests List.filter, recursive fold with append, fixed-length
list pattern [a; _; _; b] with multiple wildcards + when guard.

183 baseline programs total.

lib/ocaml/baseline/expected.json

@@ -134,6 +134,7 @@
   "pascal.ml": 252,
   "peano.ml": 30,
   "perfect.ml": 3,
+  "permutations_gen.ml": 12,
   "pi_leibniz.ml": 314,
   "prefix_sum.ml": 66,
   "pretty_table.ml": 64,

lib/ocaml/baseline/permutations_gen.ml

@@ -0,0 +1,20 @@
+let rec permutations xs =
+  match xs with
+  | [] -> [[]]
+  | _ ->
+    List.fold_left (fun acc x ->
+      let rest = List.filter (fun y -> y <> x) xs in
+      let subs = permutations rest in
+      acc @ List.map (fun p -> x :: p) subs
+    ) [] xs
+
+;;
+
+let ps = permutations [1; 2; 3; 4] in
+let count = ref 0 in
+List.iter (fun p ->
+  match p with
+  | [a; _; _; b] when a < b -> count := !count + 1
+  | _ -> ()
+) ps;
+!count