Lists

An OCaml list is either empty (written `[]`) or built from a "head" element joined to a "tail" (the rest of the list) with the `::` operator, pronounced "cons." `[1; 2; 3]` is just convenient shorthand for `1 :: 2 :: 3 :: []`. Under the hood, every list is this same chain of cons cells terminating in the empty list. Notice OCaml lists use semicolons `;` between elements, not commas: commas in OCaml are reserved for tuples, a different data structure entirely, so mixing them up (`[1, 2, 3]`) is a very common early syntax error.

One important consequence of this structure: every element in an OCaml list must have the *same type*: a `int list` can't also hold a string. This is the type system enforcing consistency, and it's part of why OCaml programs that compile tend to have far fewer "wrong kind of value showed up here" bugs than in loosely-typed languages.

`List.hd` returns a list's first element (its head); the standard library groups this and other list functions under the `List` module, the same organizational pattern you saw with `String` functions. Calling `List.hd` on an empty list raises an exception, since there's no head to return, a case worth keeping in mind once you start writing your own list-processing functions.