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
RE: [Caml-list] Are you sure the new "=" of 3.08 is good ?
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Damien Doligez <damien.doligez@i...>
Subject: Re: [Caml-list] Are you sure the new "=" of 3.08 is good ?
On Oct 8, 2004, at 18:35, Harrison, John R wrote:

> For LCF-style theorem provers, I think it's quite important that when
> comparing terms (or similar tree structures) for equality, there should
> be a quick "yes" when two high-level subgraphs are pointer eq. For
> example,

What I did in my soon-to-be-released automatic prover, following
advice from Pierre Weis, was to hash-cons all the terms used by the
program.  Now I only need to use pointer equality: if the pointers
are not the same then I know the terms are not the same.  The speedup
was a factor of 100 because my program does lots of comparisons and
hashing of terms.

-- Damien

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