Axel Simon - Optimal Inference of Fields in Row-Polymorphic Records
Q: With relation to JS typechecking, we start with some lattices. You have two interesting things: you have reflective operators which shift things down the ladder. You also have this ability tos ay.... I was wondering if you can explain how this work works here
A: Very similar to constructors. YOu have refinements similar to GADTs. What you really need for that is "Expansion of Flow". IT's an SMT problem, a flag says you're in a case, and that passed to the holes.
Q: So, similarly, in OO side effects, to figure out if field's been initialized, does this work wen you have segment references? point to themselves.
A: This is so muhc types, I have not looked into OO, (They have types too) well for type inference you need to summarize behavior on input/output, and this is weird. I don't need co/contravariance. This is pure, which makes it much easier.
