From: Adam P. Jenkins (ajenkins@cs.umass.edu)
Date: Tue Mar 10 1998 - 20:42:23 MET

Date: Tue, 10 Mar 1998 14:42:23 -0500
Message-Id: <199803101942.OAA09854@wagga.cs.umass.edu>
From: "Adam P. Jenkins" <ajenkins@cs.umass.edu>
To: Brian Rogoff <bpr@best.com>
Subject: Overloading
In-Reply-To: <Pine.BSF.3.96.980309124523.7835A-100000@shell5.ba.best.com>

Brian Rogoff writes:
> (My apologies for the lack of a French version of this message)
Same here.

> Hi Caml'ers,
> One of the things I miss the most when I'm working in Caml is
> overloading. There are numerous situations, such as arithmetic, linear
> algebra (where I may want multiplication between scalars, vectors,
> matrices, and higher order tensors), I/O (read/write/open), etc. where
> it is IMO the "right thing". Are there any plans to add some form of
> overloading to Caml in the future? I know that the Haskell folks plan to
> remove the single parameter restriction in type classes and gain more
> expressiveness in these areas, but none of the ML family of languages
> I know of support any overloading.
> My experience with overloading in Ada is almost entirely positive.

I too have missed overloading in ML/Caml. However, it seems to me
that function overloading is opposed to type inference; you can't have
both at the same time without too many explicit casts, which destroys
the point of function overloading. Are there any languages which have
both automatic type inference and function overloading?


This archive was generated by hypermail 2b29 : Sun Jan 02 2000 - 11:58:14 MET