add ocaml to euclidean

[strega-nil]

No description provided.

[leios]

Well, that's a language that isn't seen very often! Thanks for the submission! =)

[yawaramin]

A bit late but hopefully helpful.

[yawaramin]

Can also be written as

let rec euclid_mod a = function
  | 0 -> a
  | b -> euclid_mod b (a mod b)

This also looks more like the Haskell version that uses patterns directly in equations.

[yawaramin]

Looks good, I'd condense it a little bit since the body is so narrow:

let rec euclid_sub a b =
  if a = b then a
  else if a < b then euclid_sub a (b - a)
  else euclid_sub (a - b) b

[yawaramin]

Can use print_endline to avoid manually adding newlines, use pipe-forward, and also sequence into a single expression, i.e.

let () =
  chk1 |> int_of_string |> print_endline;
  chk2 |> int_of_string |> print_endline