My internal implementation of the specification for a compiler for the language of Love is not as weakly typed as I had hoped.
To be sure, it's not statically typed (for that would be too boring), but I do have types, which are allocated dynamically at some point during runtime.
The variable Relationship of expression type tuple (e1, e2) has a polymorphic product (T1 x T2) type (because annotating types would be just plain unnatural).
To be sure, the tuple type flows/morphs between these types. However, at any given time, it is typecast to a single type. There is no Heisenberg-y wishy-washyness happening (well, maybe if I observe it too much, the act of observation will affect the reading). At the very least, the probabilistic murkiness is much less pronounced than I had earlier thought.
To be sure, I learn.
To be sure, it's not statically typed (for that would be too boring), but I do have types, which are allocated dynamically at some point during runtime.
The variable Relationship of expression type tuple (e1, e2) has a polymorphic product (T1 x T2) type (because annotating types would be just plain unnatural).
To be sure, the tuple type flows/morphs between these types. However, at any given time, it is typecast to a single type. There is no Heisenberg-y wishy-washyness happening (well, maybe if I observe it too much, the act of observation will affect the reading). At the very least, the probabilistic murkiness is much less pronounced than I had earlier thought.
To be sure, I learn.
No comments:
Post a Comment