[Ur] last type decl wins?

[Marc Weber]

Excerpts from Adam Chlipala's message of Sat Apr 16 17:21:39 +0200 2011:
> I think of almost every Haskell program as an "incomprehensible 
> entangled mess," because of implicit mutual recursion spread across 
> files!

You're talking about this, correct?

    a = b

    b = a

without a "and" ?

Am I right that a compiler could be made pretty printing a
"implicit mutual recursion spread across files!"
adding those "ands" for reading then?

There are advantages to the Haskell way as ell.
If you start moving functions for that reason only and start merging 
you won some time when reading - but you'll have a lot more trouble when
merging..

I don't expect there being a perfect way at all.

> Being forced to choose different names for similar functions 
> with different scopes leads to longer and harder-to-understand names.
May I conclude from that that urweb should support overloading? :)

Do you have some specific function names in mind which share a name but
have slightly different behaviour?

would map and queryX be such cases?

I want to make sure I understand you rather than pushing any feature.

Marc Weber