paulson [Fri, 22 Dec 1995 10:48:59 +0100] rev 1417
Addition of compression, that is, sharing.
Uses refs and Symtab (binary search trees) to get reasonable speed.
Types and terms can be compressed.
paulson [Fri, 22 Dec 1995 10:38:27 +0100] rev 1416
Commented the datatype declaration of thm.
Declared compress: thm -> thm to copy a thm and maximize sharing in it.
"ext_axms" now calls Term.compress_term so that stored axioms use sharing.
paulson [Fri, 22 Dec 1995 10:34:54 +0100] rev 1415
Removed obsolete alist_of and st_of_alist.
Is now simply a structure instead of a functor.
paulson [Fri, 22 Dec 1995 10:30:06 +0100] rev 1414
"prep_const" now calls compress_type to ensure sharing among
types of constants in theories.
paulson [Fri, 22 Dec 1995 10:26:57 +0100] rev 1413
"prepare_proof" has been simplified because
rewrite_rule and rewrite_goals_rule check for empty lists.
The list of premises is *not* passed to Thm.compress; this was tried, but
the potential storage gains seemed not to justify the cpu time required.
paulson [Fri, 22 Dec 1995 10:19:55 +0100] rev 1412
Now "standard" compresses theorems (for sharing).
Also, rewrite_rule and rewrite_goals_rule check for the empty list of
rewrites and do nothing in that case.