hobbes VS base

https://github.com/morganstanley/hobbes

Things like structural equality and ordering are user functions here rather than magic internal definitions (e.g. equality is defined as a type class, and type class instances can deconstruct algebraic types at compile time to decide how to implement instances). But evaluation is eager by default, so it's pretty easy to reason about performance. And data structures can be persisted to files and/or shared transparently in memory with C/C++ programs without translation, also very convenient for the places where this was used. Actually we built some very big and complicated time series databases with it, used in both pre and post trade settings where ~15% of daily US equity trades happen. So I think these observations are useful and have passed through some pretty significant real tests.

Have a look at Hobbes from Morgan Stanley

https://github.com/morganstanley/hobbes

This approach has several benefits, but there's a lot of appeal also to the way they're doing it, to have the same PL across stages (and then maybe have more than just two stages).

I don’t know OCaml, or really any language that would help me fully understand the code, but my exposure to OCaml is this stuff, and it looks pretty clean to me. https://github.com/janestreet/base

Of course, I haven’t read every file, so maybe I got lucky with my random sampling.

Real World OCaml uses Base to replace OCaml's stdlib. I am not very fond of Base since it deviates from the standard convention of passing functions before values in HOC. To fix the ordering, one has to use labels:

As far as standard library usage goes, I highly recommend using Base. Instead of implementing list_of_string, you could use Base.String.to_list. Even if you don't end up using Base, you can get the same thing from the built in standard library by doing String.to_seq then List.of_seq.