A Guide To Pure Type Combinators in Golang or How to Stop Worrying and Love the Functional Programming
Combinators open up an opportunity to depict computation problems in terms of fundamental elements. It delivers powerful patterns for functional programming and make a bridge to the way humans think, allowing anyone to represent anything using structured symbolic expressions. Let’s advance these patterns towards the Golang type system and define combinators over types and their instances to derive complex structures of type T. There are 7 patterns to consider and express their semantic with Golang despite a fact that Golang type system is less powerful and does not support type classes. In the end, combinators are fundamentally computational constructs.
The post defines ad-hoc polymorphism techniques for TypeScript. It helps to define a function with several different types acting in a different way for each type.
Erlang permits writing a generic code but it has a few disadvantages that makes they usage questionable. The datum library provides a parse transform to solve Erlang’s limitations.