~icefox/garnetc#30: 
Type inference without unification?

Would sure be nice sometimes. OTOH we already have unification implemented, so hey. On the third hand, unification can be slow? Mentioned here: https://matklad.github.io/2023/08/09/types-and-zig.html . Basically it's a greedy algorithm that just searches forward, if I understand it correctly.

As long as it's a pure subset of unification then we can upgrade it someday as we care to.

Status
REPORTED
Submitter
~icefox
Assigned to
No-one
Submitted
1 year, 2 months ago
Updated
5 months ago
Labels
T-LATER

~icefox 5 months ago

Not worth it, I like unification too much and we basically only(?) have to unify type vars inside a single function.

...uh I should probably make sure that's actually the case before I close this.

Register here or Log in to comment, or comment via email.