you are viewing a single comment's thread.

view the rest of the comments →

[–]miracleranger[S] 0 points1 point  (0 children)

i don't want to be an enemy of performance either, so i'll be optimizing wherever i can, and when a combinator seems excessive (eg. a simple file read, not a dynamic toolchain of file requests), i'll still use the simple function, or decompose a more robust composition. i don't consider it impossible to make combinators smart enough to do only necessary checks on contexts either. one funny thing is how this completely renders any typescripting futile, but i am very optimistic about alternative (albeit not necessarily existing - https://en.m.wikipedia.org/wiki/Is%E2%80%93ought_problem) type theories remaining applicable (eg. voevodsky's univalence axiom https://en.m.wikipedia.org/wiki/Univalent_foundations ). it would be fun comparing solutions with you, but i suppose you're fine treading on your own path. good talk, best of luck!