berghofe [Wed, 31 Oct 2001 20:00:35 +0100] rev 12002
Additional rules for simplifying inside "Goal"
berghofe [Wed, 31 Oct 2001 19:59:21 +0100] rev 12001
- Tuned add_cnstrt
- Fixed bug in reconstruct_proof that caused infinite loop
berghofe [Wed, 31 Oct 2001 19:49:36 +0100] rev 12000
Removed name_thm from finish_global.
berghofe [Wed, 31 Oct 2001 19:41:29 +0100] rev 11999
Tuned function thm_proof.
berghofe [Wed, 31 Oct 2001 19:37:04 +0100] rev 11998
- enter_thmx -> enter_thms
- improved naming of theorems: enter_thms now takes functions pre_name and post_name
as arguments
berghofe [Wed, 31 Oct 2001 19:32:05 +0100] rev 11997
norm_hhf_eq is now stored using open_store_standard_thm.
wenzelm [Wed, 31 Oct 2001 01:28:39 +0100] rev 11996
induct: internalize ``missing'' consumes-facts from goal state
(enables unstructured scripts to perform elim-style induction);
wenzelm [Wed, 31 Oct 2001 01:27:04 +0100] rev 11995
- 'induct' may now use elim-style induction rules without chaining
facts, using ``missing'' premises from the goal state; this allows
rules stemming from inductive sets to be applied in unstructured
scripts, while still benefitting from proper handling of non-atomic
statements; NB: major inductive premises need to be put first, all the
rest of the goal is passed through the induction;
wenzelm [Wed, 31 Oct 2001 01:26:42 +0100] rev 11994
(induct set: ...);
wenzelm [Wed, 31 Oct 2001 01:22:27 +0100] rev 11993
put_consumes: really overwrite existing tag;
wenzelm [Wed, 31 Oct 2001 01:21:56 +0100] rev 11992
finish_global: Tactic.norm_hhf;
wenzelm [Wed, 31 Oct 2001 01:21:31 +0100] rev 11991
use HOL.induct_XXX;
wenzelm [Wed, 31 Oct 2001 01:21:01 +0100] rev 11990
use induct_rulify2;
wenzelm [Wed, 31 Oct 2001 01:20:42 +0100] rev 11989
renamed inductive_XXX to induct_XXX;
added induct_impliesI;
wenzelm [Wed, 31 Oct 2001 01:19:58 +0100] rev 11988
induct_impliesI;
wenzelm [Tue, 30 Oct 2001 17:37:25 +0100] rev 11987
tuned induct proofs;
wenzelm [Tue, 30 Oct 2001 17:33:56 +0100] rev 11986
- 'induct' method now derives symbolic cases from the *rulified* rule
(before it used to rulify cases stemming from the internal atomized
version); this means that the context of a non-atomic statement
becomes is included in the hypothesis, avoiding the slightly
cumbersome show "PROP ?case" form;
wenzelm [Tue, 30 Oct 2001 17:33:03 +0100] rev 11985
tuned;
wenzelm [Tue, 30 Oct 2001 17:30:21 +0100] rev 11984
induct: cases are extracted from rulified rule;
wenzelm [Tue, 30 Oct 2001 17:29:43 +0100] rev 11983
removed obsolete make_raw;
wenzelm [Tue, 30 Oct 2001 13:43:26 +0100] rev 11982
lemma Least_mono moved from Typedef.thy to Set.thy;
wenzelm [Mon, 29 Oct 2001 17:22:18 +0100] rev 11981
tuned;
wenzelm [Mon, 29 Oct 2001 14:09:10 +0100] rev 11980
removed option -depend (not available everywhere?);
wenzelm [Sun, 28 Oct 2001 22:59:12 +0100] rev 11979
converted theory "Set";
wenzelm [Sun, 28 Oct 2001 22:58:39 +0100] rev 11978
fixed string_of_mixfix;
wenzelm [Sun, 28 Oct 2001 21:14:56 +0100] rev 11977
tuned declaration of rules;
wenzelm [Sun, 28 Oct 2001 21:10:47 +0100] rev 11976
equal_intr_rule already declared in Pure;
wenzelm [Sun, 28 Oct 2001 19:44:58 +0100] rev 11975
rules for meta-level conjunction;
wenzelm [Sun, 28 Oct 2001 19:44:26 +0100] rev 11974
tuned prove;
wenzelm [Sat, 27 Oct 2001 23:21:19 +0200] rev 11973
tuned;
wenzelm [Sat, 27 Oct 2001 23:19:55 +0200] rev 11972
added prove;
wenzelm [Sat, 27 Oct 2001 23:19:37 +0200] rev 11971
declare equal_intr_rule as intro;
wenzelm [Sat, 27 Oct 2001 23:19:04 +0200] rev 11970
tuned prove;
added prove_standard;
wenzelm [Sat, 27 Oct 2001 23:18:40 +0200] rev 11969
removed obsolete goal_subclass, goal_arity;
wenzelm [Sat, 27 Oct 2001 23:17:46 +0200] rev 11968
use Tactic.prove;
wenzelm [Sat, 27 Oct 2001 23:17:28 +0200] rev 11967
use Tactic.prove;
improved proof of equality rule;
wenzelm [Sat, 27 Oct 2001 23:16:15 +0200] rev 11966
tuned;
wenzelm [Sat, 27 Oct 2001 23:15:52 +0200] rev 11965
* Pure/axclass: removed obsolete ML interface goal_subclass/goal_arity;
wenzelm [Sat, 27 Oct 2001 23:13:42 +0200] rev 11964
updated;
wenzelm [Sat, 27 Oct 2001 00:09:59 +0200] rev 11963
impose hyps on initial goal configuration (prevents res_inst_tac problems);
wenzelm [Sat, 27 Oct 2001 00:07:48 +0200] rev 11962
added "atomize" method;
wenzelm [Sat, 27 Oct 2001 00:07:19 +0200] rev 11961
prove: primitive goal interface for internal use;
wenzelm [Sat, 27 Oct 2001 00:06:46 +0200] rev 11960
added impose_hyps;
wenzelm [Sat, 27 Oct 2001 00:06:22 +0200] rev 11959
exclude field_simps from user-level "simps";
wenzelm [Sat, 27 Oct 2001 00:05:50 +0200] rev 11958
Isar: fixed rep_datatype args;
wenzelm [Sat, 27 Oct 2001 00:05:14 +0200] rev 11957
hardwire qualified const names;
wenzelm [Sat, 27 Oct 2001 00:00:55 +0200] rev 11956
removed "more" class;
wenzelm [Sat, 27 Oct 2001 00:00:38 +0200] rev 11955
moved product cases/induct to theory Datatype;
wenzelm [Sat, 27 Oct 2001 00:00:05 +0200] rev 11954
made new-style theory;
tuned;
wenzelm [Fri, 26 Oct 2001 23:59:13 +0200] rev 11953
atomize_conj;
wenzelm [Fri, 26 Oct 2001 23:58:21 +0200] rev 11952
* Pure: method 'atomize' presents local goal premises as object-level
statements (atomic meta-level propositions); setup controlled via
rewrite rules declarations of 'atomize' attribute; example
application: 'induct' method with proper rule statements in improper
proof *scripts*;
berghofe [Fri, 26 Oct 2001 23:17:49 +0200] rev 11951
Fixed several bugs concerning arbitrarily branching datatypes.
berghofe [Fri, 26 Oct 2001 19:06:53 +0200] rev 11950
Eliminated occurrence of rule_format.
wenzelm [Fri, 26 Oct 2001 18:16:45 +0200] rev 11949
tuned;
wenzelm [Fri, 26 Oct 2001 18:16:31 +0200] rev 11948
need at least 3 latex runs to get toc right!
wenzelm [Fri, 26 Oct 2001 16:49:10 +0200] rev 11947
tuned;
wenzelm [Fri, 26 Oct 2001 16:18:14 +0200] rev 11946
tuned;
wenzelm [Fri, 26 Oct 2001 14:22:33 +0200] rev 11945
Rrightarrow;
wenzelm [Fri, 26 Oct 2001 14:02:58 +0200] rev 11944
tuned notation;
wenzelm [Fri, 26 Oct 2001 12:24:19 +0200] rev 11943
tuned notation;