I would name my next son Simon if one of those two would implement optional backtracking in the type checker, so that it would try all of the definitions of e.g

I would name my next son Simon if one of those two would implement optional backtracking in the type checker, so that it would try all of the definitions of e.g., map, foldr, filter, and succeed if there is exactly one assignment of types to identifiers that typechecks, fails otherwise. While surely not trivial, it certainly must be possible seeing as how Prolog can be embedded in Haskell. Then the gratuitous namespacing would be optional.