Brendan Zabarauskas on Twitter: "@freebroccolo Hoping that a simpler approach can win out. Use simple, easily understandable rules and bail with a helpful error if things fail, requiring more annotations. Similar to how folks ended up going when combining type inference with rank-n polymorphism." / Twitter

This Tweet is unavailable. Learn more

Feb 1, 2018

I've heard it said though (as a pro for coherence) that Scala can be hard to refactor because of the unpredictability of implicit resolution. Not wholly convinced though, and Scala's implicit resolution is far more magic than it needs to be. 🤔

Replying to

and

Hoping that a simpler approach can win out. Use simple, easily understandable rules and bail with a helpful error if things fail, requiring more annotations. Similar to how folks ended up going when combining type inference with rank-n polymorphism.

1:15 PM · Feb 1, 2018Twitter Web Client

Conversation