No, OCaml compiles polymorphic functions once by using an universal representation of values which tends to play better with a type system with recursively poly

No, OCaml compiles polymorphic functions once by using an universal representation of values which tends to play better with a type system with recursively polymorphic functions, higher-rank polymorphism or existential types (which all imply that concrete types are not always known statically in OCaml).