|
|
|
|
|
by KirinDave
3218 days ago
|
|
That would let people do this, and I hear people ask for it a lot. I dunno if it'd actually be better without the possiblity of not-wow-slow combinators. Golang has all these weird performance pitfalls that you only hit if you contort the language too hard. Naming combinatior functions sometimes trips those conditions. I'm of the opinion that even just pattern matching and the kind of nil type propagation checking that TypeScript does could help enourmously. Generics won't fix error handling without compiler help, and the best way to get that help is to introduce pattern matching as a forcing function. |
|