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
Optimizing symbolic processing code
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2009-01-17 (11:39)
From: Andrej Bauer <andrej.bauer@a...>
Subject: Re: [Caml-list] Optimizing symbolic processing code
Dear Hugo,

you have not noticed miniprolog before because it was not there until yesterday.

Almost any optimization will cause my interpreter to go much faster. I
think the most reasonable one to do would be to avoid explicit
subtitutions during unification (since I already keep track of the
environment), but then I get into the union-find business.

I would not be too sure that lists are much slower than arrays when
the lists and arrays are both short. You might be yet another victim
of premature optimization.

How does the performance of your prolog compare to my miniprolog?
Judging from the care you took with your interpreter, yours should be
much faster. It should be easy to run the same program on both and see
what happens.

Best regards,