Tue, 01 Jul 1997 17:34:42 +0200 New theorem priK_inj_eq, injectivity of priK
paulson [Tue, 01 Jul 1997 17:34:42 +0200] rev 3477
New theorem priK_inj_eq, injectivity of priK
Tue, 01 Jul 1997 17:34:13 +0200 spy_analz_tac: Restored iffI to the list of rules used to break down
paulson [Tue, 01 Jul 1997 17:34:13 +0200] rev 3476
spy_analz_tac: Restored iffI to the list of rules used to break down the subgoal
Tue, 01 Jul 1997 17:32:12 +0200 New theory TLS
paulson [Tue, 01 Jul 1997 17:32:12 +0200] rev 3475
New theory TLS
Tue, 01 Jul 1997 11:11:42 +0200 Baby TLS. Proofs work, but model seems unrealistic
paulson [Tue, 01 Jul 1997 11:11:42 +0200] rev 3474
Baby TLS. Proofs work, but model seems unrealistic
Tue, 01 Jul 1997 10:45:59 +0200 New and stronger lemmas; more default simp/cla rules
paulson [Tue, 01 Jul 1997 10:45:59 +0200] rev 3473
New and stronger lemmas; more default simp/cla rules
Tue, 01 Jul 1997 10:39:28 +0200 Deleted the obsolete operators newK, newN and nPair
paulson [Tue, 01 Jul 1997 10:39:28 +0200] rev 3472
Deleted the obsolete operators newK, newN and nPair
Tue, 01 Jul 1997 10:38:11 +0200 Now the possibility proof calls the appropriate tactic
paulson [Tue, 01 Jul 1997 10:38:11 +0200] rev 3471
Now the possibility proof calls the appropriate tactic
Tue, 01 Jul 1997 10:37:42 +0200 Added a comment
paulson [Tue, 01 Jul 1997 10:37:42 +0200] rev 3470
Added a comment
Tue, 01 Jul 1997 10:37:03 +0200 Now Collect_mem_eq is a default simprule (how could it have ever been omitted?
paulson [Tue, 01 Jul 1997 10:37:03 +0200] rev 3469
Now Collect_mem_eq is a default simprule (how could it have ever been omitted?
Tue, 01 Jul 1997 10:34:30 +0200 New laws for the "lists" operator
paulson [Tue, 01 Jul 1997 10:34:30 +0200] rev 3468
New laws for the "lists" operator
(0) -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip