On Mon, May 13, 2002 at 03:31:02PM +0200, Markus Mottl wrote:
> Hello,

Hi
 
>...
>
> Needless to say that I get into trouble when I actually want to interpret
> or compile these models to evaluate them on new data. Type checking just
> takes an awful amount of time, in fact much longer than the learning
> algorithm needs for model generation...

I'm conservatively assuming that your code uses just classical types
(guessing that type-checking objects etc. can be more costly).

Could the type experts on this list confirm or deny that :
	- For ``classical'' types, type-checking amounts to term unification.
	- Term unification can be done in worst-case linear-time.
	- Ocaml's unification algorithm is worst-case suboptimal.
	- This explains the ``awful amount of time'' needed for type checking.

If these are true, a fifth question arises :
	- Is it worth to make Ocaml's type checking worst-case optimal ? How will
this affect real average-case performance ?
-- 
Berke Durak
-------------------
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