English version
Accueil     À propos     Téléchargement     Ressources     Contactez-nous    

Ce site est rarement mis à jour. Pour les informations les plus récentes, rendez-vous sur le nouveau site OCaml à l'adresse ocaml.org.

Browse thread
[Caml-list] Dynamically evaluating OCaml code
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2004-04-15 (01:40)
From: skaller <skaller@u...>
Subject: Re: [Caml-list] recompiling bytecode
On Thu, 2004-04-15 at 04:21, Brandon J. Van Every wrote:
> skaller wrote:

> > Who cares?
> >
> > I've worked on code where turnaround for compilations were:
> >
> > 1970's -- overnight (Fortran)
> > 1980's -- 2-3 hours (Cobol/Pl1)
> > 1990's -- 20-40 minutes (C/C++)
> > 2000's -- 10-60 seconds (Ocaml)
> Because you are not compiling programs large enough and often enough for
> this to become sheer hell?  

No, I recompile every 20 seconds when I'm fixing bugs.
True, my current project only has around 60 ml files.

I certainly HAVE worked on systems where compile time
was an issue. That is the point of the data above:
I know all about it.

My build system does have 'dependency analysis'.
Its a simple linear order. I find that is perfectly
acceptable. If I change the parser it's a small pain,
since it's at the head of the list :D

But there is very little choice. Ocamlopt requires
the linear ordering to transmit optimisation information
forward. So you can't just recompile modules based on
dependency on interfaces (as you can in C).

And I'm ecstatic! Ocaml is so fast!

John Skaller, mailto:skaller@users.sf.net
voice: 061-2-9660-0850, 
snail: PO BOX 401 Glebe NSW 2037 Australia
Checkout the Felix programming language http://felix.sf.net

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