2
$\begingroup$

We can construct a fixed set of combinators with a computational power equivalent to lambda calculus.

Can we do the same with typeclasses (ad-hoc polymorphism)?

For example, construct a finite set of typeclasses from which we can build general ad-hoc polymorphic functions?

| cite | improve this question | | | | |
$\endgroup$
  • $\begingroup$ can you please add an example as to what exactly you are looking for. More specifically, what are you going to use the general ad-hoc polymorphic functions for? $\endgroup$ – Apoorv Ingle Jan 27 at 19:00

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.