2 ms·
The ones I've been paying attention to are data parallel programming systems and type inference algorithms (simpler ones than MLF).
by kd0amg 12y ago
The ones I've been paying attention to are data parallel programming systems and type inference algorithms (simpler ones than MLF).
- tel 12y agoWhat are good examples of things in the bucket of type inference algorithms that are simpler than MLF? You must be looking for ones which infer sophisticated logics, still, otherwise that bucket will always be dominated by HM, no?
- kd0amg 12y agoBoxy types, HMF, and bidirectional (older but more recently applied to parametric polymorphism) all leverage partial annotations to handle a more flexible parametric polymorphism than HM itself allows.