On Wed, 3 Jan 2001, Pierre Weis wrote:
> > (2) explicit declarations for operator associativity and precedence
> 
> You mean that the actual implicit way of specifying associativity and
> precedence of users's defined operators is not powerful enough for your
> programs ?

I'm of the opinion that the Ocaml solution is a very good compromise
between a fixed set of reusable (pre|in)fix operators (C++, Ada) and the
more powerful Haskell/Clean/SML/Caml approach which allows arbitrary 
specification. It is certainly true that in the Haskell and Clean papers 
on parser combinators that I've read, the authors use good taste in 
choosing operators, and since the papers are of an expository nature the 
symbols are well explained. I wonder if the same holds for the average 
working Haskell or Clean program which makes heavy use of infixes. What do 
the Haskell programmers on the list think? Does the Haskell approach buy 
much more in practice? 

I think that suggestion (1) for overloading is significantly more important, 
and helps quite a bit with (2), since it reduces the need for additional 
operators. That and the mixin modules (or some other approach for recursive 
modules) are on top of my language feature wish-list. I won't hold my
breath though...

> > Happy New Year!

If you read the ML-2000 paper, you'll see that neither user defined infixes 
nor overloading were to be in ML2K. Good riddance to 2000 I say! The future 
of ML is here now.

-- Brian