Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] Why are arithmetic functions not polymorph?
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2003-06-03 (06:59)
From: John Max Skaller <skaller@o...>
Subject: Re: [Caml-list] Why are arithmetic functions not polymorph?
Oleg Trott wrote:

> On Monday 02 June 2003 11:42 pm, John Max Skaller wrote:
>>The open-ness of the Felix model does make for some
>>degree of fragility compared to the much more robust
>>GCaml model, however the GCaml technique is considerably
>>more verbose, and brevity and easy of naming is one of
>>the arguments in favour of overloading.
> However, you have to sacrifice some of the type inferencing in Felix, right?

Yes. I mainly do bottom up 

inference, which i would call deduction or synthesis.

[Typing pattern variables is slightly different]

John Max Skaller,
snail:10/1 Toxteth Rd, Glebe, NSW 2037, Australia.

To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: