[mookid11]

I think this is the first time I see anyone like the OCaml syntax.

[macintux]

I've not looked at OCaml, but when I discovered that ML's pattern matching works for function heads, I immediately became more interested.

Pattern matching for function heads is magical. Thus sayeth the Erlang fanboi.

[chwind]

what is a function head?

[ZephyrP]

In some languages, a function can be defined multiple times with different signatures (multiple 'heads'). It will try each clause until it finds one that matches, allowing you to filter or change course on the basis of the value or characteristics of the arguments.

This allows you to easily create special logic for corner cases and is generally extremely useful.

[macintux]

If you look at the Wikipedia article for Greatest Common Divisor, you see this:

  gcd(a, 0) = a
  gcd(a, b) = gcd(b, a mod b)

That, in effect, is what pattern matching + function heads gives you. You can copy that function directly into ML or Erlang, modulo a couple tiny bits of syntax.

  gcd(A, 0) -> A;
  gcd(A, B) -> gcd(B, A rem B).

[aaron-santos]

Pattern matching can be used in the parameter list of function's definition.

[sfilargi]

I think I like Reason's syntax better, but can't say I dislike Ocaml's.

[kibwen]

And I believe Reason's syntax was inspired by Rust, so we've come full circle. :P