It is not clear to me how we would construct models for cyclic types
(then, I'm just starting to learn how to do it for acyclic types :-).
That is: What do the domains for these types look like? The reason I'm
worrying about this is that when I do abstract interpretation over
structured datatypes
Lennart Augustsson writes:
I thought there were problems with extending Hindley-Milner type systems
with cyclic types: The type inference can handle type correct programs,
but will loop for certain type incorrect programs, or am I mistaken?
It is absolutely unproblematic to extend Hindley
