Version française
Home     About     Download     Resources     Contact us    
Browse thread
[Caml-list] Formal Methods
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Jon Harrop <jon@j...>
Subject: Re: [Caml-list] Formal Methods
On Thursday 30 September 2004 18:35, Jacques Carette wrote:
> I also see an analogy with type systems such as Ocaml's: in theory, type
> inference is exponential, while in practice it is very fast.

I'd contest the "very fast".

When writing an API for my vector graphics engine, I wrote a lot of generic 
HOFs. The time taken to compile increased by a factor of ten. This prompted 
me to split my sources into separate compilation units to speed partial 
recompilations.

I believe the slow compile times are due to the complicated types involved 
(often half a page in the .mli) although the functions themselves are often 
very simple. So I think the time taken for compilers to deal with types can 
be very significant and can influence programming. So I don't think type 
handling is not always "very fast" in practice.

Cheers,
Jon.

-------------------
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