02:19 <discocaml> <anishr> i am trying to get a better understanding of ocamls type inference algorithm; does anyone have any good resources?

02:20 <discocaml> <anishr> https://caml.inria.fr/pub/docs/u3-ocaml/ocaml-ml.html#toc4

02:20 <discocaml> <anishr> I was reading this but its not v self contained; i understand most of it but was looking for smth more self contained that i prob could learn more from

04:03 <discocaml> <polyml> have you seen https://okmij.org/ftp/ML/generalization.html ?

06:24 <discocaml> <lukstafi> Old but classic: https://caml.inria.fr/pub/docs/u3-ocaml/

06:26 <discocaml> <lukstafi> I don't remember seeing these, thanks for sharing

06:35 <discocaml> <lukstafi> Ah apologies, I responded without reading your question...

14:34 <leah2> can others connect to staging.ocaml.org ?

14:43 <wbooze> no

14:43 <wbooze> takes forever, so something is wrong

14:44 <wbooze> https://www.isitdownrightnow.com/staging.ocaml.org.html, it's down

16:21 <discocaml> <_moorish> @bluddy5 listen son

22:46 <Anish> I have a question about principality that i came upon while reading real world ocaml

22:46 <Anish> https://dev.realworldocaml.org/compiler-frontend.html

22:47 <Anish> why exactly is that example not in principal mode or whatever? What does it mean by subexpression order, and is there anywhere i can read more about this? thanks!

23:26 <discocaml> <contificate> For that example, you can imagine that the compiler has an internal representation of `e ; e'` (don't need to imagine, though: `Pexp_sequence of expression * expression`). So the typing of the program shouldn't depend on what order `e` and `e'` are typed.

23:27 <discocaml> <contificate> For that specific example, if inference typed `e'` first in `e ; e'` instead of `e`, it'd assume the argument's type is `t`. Then, when checking `e`, would complain that `t` lacks the relevant field.