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] Formal Methods
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Thomas Fischbacher <Thomas.Fischbacher@P...>
Subject: RE: [Caml-list] Formal Methods

On Thu, 30 Sep 2004, 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.  This is
> because the worst cases are very degenerate, and do not tend to occur in
> common / meaningful programs.

Well, I this is quite different from what I experience if I use a (perl) 
code-generator which spits out ocaml code.

I don't know if this is still a problem, but I already encountered severe 
difficulties when trying to compile a fixed constant definition of an 
array (length ~380 000) of arrays (length ~10) of strings (length ~4).

regards,                   (o_
 Thomas Fischbacher -  //\
(lambda (n) ((lambda (p q r) (p p q r)) (lambda (g x y)           V_/_
(if (= x 0) y (g g (- x 1) (* x y)))) n 1))                  (Debian GNU)

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