Version française
Home     About     Download     Resources     Contact us    
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: -- (:)
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, mailto:skaller@ozemail.com.au
snail:10/1 Toxteth Rd, Glebe, NSW 2037, Australia.
voice:61-2-9660-0850


-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners