Sat, 23 Dec 1995 12:50:53 +0100 New version of type sections and many small changes.
nipkow [Sat, 23 Dec 1995 12:50:53 +0100] rev 1422
New version of type sections and many small changes.
Fri, 22 Dec 1995 13:38:57 +0100 Note that unfold is not exported, that mutual_induct can
paulson [Fri, 22 Dec 1995 13:38:57 +0100] rev 1421
Note that unfold is not exported, that mutual_induct can be omitted (as the trivial theorem True), and comments on storage Also uses Datatype instead of Univ/Quniv as parent theory for lists, and omits quotes around types in theory files.
Fri, 22 Dec 1995 13:33:40 +0100 Added line breaks and other cosmetic changes
paulson [Fri, 22 Dec 1995 13:33:40 +0100] rev 1420
Added line breaks and other cosmetic changes
Fri, 22 Dec 1995 12:25:20 +0100 defined take/drop by induction over list rather than nat.
nipkow [Fri, 22 Dec 1995 12:25:20 +0100] rev 1419
defined take/drop by induction over list rather than nat.
Fri, 22 Dec 1995 11:09:28 +0100 Improving space efficiency of inductive/datatype definitions.
paulson [Fri, 22 Dec 1995 11:09:28 +0100] rev 1418
Improving space efficiency of inductive/datatype definitions. Reduce usage of "open" and change struct open X; D end to let open X in struct D end end whenever possible -- removes X from the final structure. Especially needed for functors Intr_elim and Indrule. intr_elim.ML and constructor.ML now use a common Su.free_SEs instead of generating a new one. Inductive defs no longer export sumprod_free_SEs ZF/intr_elim: Removed unfold:thm from signature INTR_ELIM. It is never used outside, is easily recovered using bnd_mono and def_lfp_Tarski, and takes up considerable store. Moved raw_induct and rec_names to separate signature INTR_ELIM_AUX, for items no longer exported. mutual_induct is simply "True" unless it is going to be significantly different from induct -- either because there is mutual recursion or because it involves tuples.
Fri, 22 Dec 1995 10:48:59 +0100 Addition of compression, that is, sharing.
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.
Fri, 22 Dec 1995 10:38:27 +0100 Commented the datatype declaration of thm.
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.
Fri, 22 Dec 1995 10:34:54 +0100 Removed obsolete alist_of and st_of_alist.
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.
Fri, 22 Dec 1995 10:30:06 +0100 "prep_const" now calls compress_type to ensure sharing among
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.
Fri, 22 Dec 1995 10:26:57 +0100 "prepare_proof" has been simplified because
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.
(0) -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip