Thu, 18 Nov 1993 18:48:23 +0100 expandshort
lcp [Thu, 18 Nov 1993 18:48:23 +0100] rev 128
expandshort
Thu, 18 Nov 1993 14:57:05 +0100 Misc modifs such as expandshort
lcp [Thu, 18 Nov 1993 14:57:05 +0100] rev 127
Misc modifs such as expandshort
Tue, 16 Nov 1993 19:50:20 +0100 added loaded_thys to signature and removed list_/set_loaded
clasohm [Tue, 16 Nov 1993 19:50:20 +0100] rev 126
added loaded_thys to signature and removed list_/set_loaded
Tue, 16 Nov 1993 14:26:15 +0100 changed use_thy's parameter to exact theory name
clasohm [Tue, 16 Nov 1993 14:26:15 +0100] rev 125
changed use_thy's parameter to exact theory name
Tue, 16 Nov 1993 14:24:21 +0100 made pseudo theories for all ML files;
clasohm [Tue, 16 Nov 1993 14:24:21 +0100] rev 124
made pseudo theories for all ML files; documented dependencies between all thy and ML files
Tue, 16 Nov 1993 14:23:19 +0100 moved call of store_theory to end of use t.thy; use t.ML;
clasohm [Tue, 16 Nov 1993 14:23:19 +0100] rev 123
moved call of store_theory to end of use t.thy; use t.ML; use_thy now needs the exact theory name (capital/lower letters); improved handling of incompletly read theories; added function unlink_thy, removed function relations; added reference variable delete_tmpfile; removed some bugs
Tue, 16 Nov 1993 14:13:11 +0100 replaced \un by \union in "Simplification sets"
clasohm [Tue, 16 Nov 1993 14:13:11 +0100] rev 122
replaced \un by \union in "Simplification sets"
Tue, 16 Nov 1993 14:10:19 +0100 changed use_thy's parameter to exact theory name
clasohm [Tue, 16 Nov 1993 14:10:19 +0100] rev 121
changed use_thy's parameter to exact theory name
Mon, 15 Nov 1993 14:41:25 +0100 changed all co- and co_ to co
lcp [Mon, 15 Nov 1993 14:41:25 +0100] rev 120
changed all co- and co_ to co ZF/ex/llistfn: new coinduction example: flip ZF/ex/llist_eq: now uses standard pairs not qpairs
Mon, 15 Nov 1993 14:33:40 +0100 boolE: changed to have equality assumptions instead of P(c); proved many boolean laws
lcp [Mon, 15 Nov 1993 14:33:40 +0100] rev 119
boolE: changed to have equality assumptions instead of P(c); proved many boolean laws
(0) -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip