Thu, 02 Jan 2014 20:10:08 +0100 prevent tactic from getting out of sync and wrongly attack next subgoal
blanchet [Thu, 02 Jan 2014 20:10:08 +0100] rev 54915
prevent tactic from getting out of sync and wrongly attack next subgoal
Thu, 02 Jan 2014 19:07:36 +0100 removed pointless warning (cf. http://stackoverflow.com/questions/20233463/isabelle-metis-proof-state-contains-the-universal-sort/20785045#20785045)
blanchet [Thu, 02 Jan 2014 19:07:36 +0100] rev 54914
removed pointless warning (cf. http://stackoverflow.com/questions/20233463/isabelle-metis-proof-state-contains-the-universal-sort/20785045#20785045)
Thu, 02 Jan 2014 09:50:22 +0100 consider code as exhaustive
blanchet [Thu, 02 Jan 2014 09:50:22 +0100] rev 54913
consider code as exhaustive
Thu, 02 Jan 2014 09:50:22 +0100 proper handling of corner case, take 2
blanchet [Thu, 02 Jan 2014 09:50:22 +0100] rev 54912
proper handling of corner case, take 2
Thu, 02 Jan 2014 09:50:22 +0100 robustness
blanchet [Thu, 02 Jan 2014 09:50:22 +0100] rev 54911
robustness
Thu, 02 Jan 2014 09:50:22 +0100 properly synchronize parallel lists
blanchet [Thu, 02 Jan 2014 09:50:22 +0100] rev 54910
properly synchronize parallel lists
Thu, 02 Jan 2014 09:50:22 +0100 graceful handling of one-constructor case
blanchet [Thu, 02 Jan 2014 09:50:22 +0100] rev 54909
graceful handling of one-constructor case
Thu, 02 Jan 2014 09:50:22 +0100 gracefully handle single-equation case, where 'nchotomy' is 'True'
blanchet [Thu, 02 Jan 2014 09:50:22 +0100] rev 54908
gracefully handle single-equation case, where 'nchotomy' is 'True'
Thu, 02 Jan 2014 09:50:22 +0100 made tactic handle gracefully the case of missing constructors
blanchet [Thu, 02 Jan 2014 09:50:22 +0100] rev 54907
made tactic handle gracefully the case of missing constructors
Thu, 02 Jan 2014 09:50:22 +0100 removed 'nchotomy' property
blanchet [Thu, 02 Jan 2014 09:50:22 +0100] rev 54906
removed 'nchotomy' property
Thu, 02 Jan 2014 09:50:22 +0100 don't generate any proof obligation for implicit (de facto) exclusiveness
blanchet [Thu, 02 Jan 2014 09:50:22 +0100] rev 54905
don't generate any proof obligation for implicit (de facto) exclusiveness
Thu, 02 Jan 2014 09:50:22 +0100 detect syntactic exhaustiveness
blanchet [Thu, 02 Jan 2014 09:50:22 +0100] rev 54904
detect syntactic exhaustiveness
Thu, 02 Jan 2014 09:50:22 +0100 internally allow different values for 'exhaustive' for different constructors
blanchet [Thu, 02 Jan 2014 09:50:22 +0100] rev 54903
internally allow different values for 'exhaustive' for different constructors
Thu, 02 Jan 2014 09:50:22 +0100 internally allow different values for 'sequential' for different constructors
blanchet [Thu, 02 Jan 2014 09:50:22 +0100] rev 54902
internally allow different values for 'sequential' for different constructors
Thu, 02 Jan 2014 09:50:22 +0100 use same name for feature internally as in user interface, to facilitate grepping
blanchet [Thu, 02 Jan 2014 09:50:22 +0100] rev 54901
use same name for feature internally as in user interface, to facilitate grepping
Thu, 02 Jan 2014 09:50:22 +0100 generate 'disc_iff' property in 'primcorec'
blanchet [Thu, 02 Jan 2014 09:50:22 +0100] rev 54900
generate 'disc_iff' property in 'primcorec'
Thu, 02 Jan 2014 09:50:22 +0100 added tactic to prove 'disc_iff' properties in 'primcorec'
blanchet [Thu, 02 Jan 2014 09:50:22 +0100] rev 54899
added tactic to prove 'disc_iff' properties in 'primcorec'
Wed, 01 Jan 2014 21:23:32 +0100 merged
wenzelm [Wed, 01 Jan 2014 21:23:32 +0100] rev 54898
merged
Wed, 01 Jan 2014 20:14:47 +0100 clarified blast after change of SELECT_GOAL in 210bca64b894: do not smash flex-flex pairs of overall goal state (in analogy to maxidx) -- NB: Isar goal structure serves as natural boundary, e.g. in "by blast";
wenzelm [Wed, 01 Jan 2014 20:14:47 +0100] rev 54897
clarified blast after change of SELECT_GOAL in 210bca64b894: do not smash flex-flex pairs of overall goal state (in analogy to maxidx) -- NB: Isar goal structure serves as natural boundary, e.g. in "by blast";
Wed, 01 Jan 2014 14:32:31 +0100 updated keywords;
wenzelm [Wed, 01 Jan 2014 14:32:31 +0100] rev 54896
updated keywords;
Wed, 01 Jan 2014 14:29:22 +0100 clarified simplifier context;
wenzelm [Wed, 01 Jan 2014 14:29:22 +0100] rev 54895
clarified simplifier context; eliminated Simplifier.global_context;
Wed, 01 Jan 2014 13:24:23 +0100 simplified settings for src/HOL/Tools/SMT;
wenzelm [Wed, 01 Jan 2014 13:24:23 +0100] rev 54894
simplified settings for src/HOL/Tools/SMT;
Wed, 01 Jan 2014 12:57:26 +0100 avoid unicode text, which causes problems when recoding symbols (e.g. via UTF8-Isabelle in Isabelle/jEdit);
wenzelm [Wed, 01 Jan 2014 12:57:26 +0100] rev 54893
avoid unicode text, which causes problems when recoding symbols (e.g. via UTF8-Isabelle in Isabelle/jEdit);
Wed, 01 Jan 2014 15:55:11 +0100 dropped obsolete references to recdef
haftmann [Wed, 01 Jan 2014 15:55:11 +0100] rev 54892
dropped obsolete references to recdef
Wed, 01 Jan 2014 11:35:21 +0100 examples how to avoid the "code, code del" antipattern
haftmann [Wed, 01 Jan 2014 11:35:21 +0100] rev 54891
examples how to avoid the "code, code del" antipattern
Wed, 01 Jan 2014 01:05:48 +0100 fundamental treatment of undefined vs. universally partial replaces code_abort
haftmann [Wed, 01 Jan 2014 01:05:48 +0100] rev 54890
fundamental treatment of undefined vs. universally partial replaces code_abort
Wed, 01 Jan 2014 01:05:46 +0100 explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann [Wed, 01 Jan 2014 01:05:46 +0100] rev 54889
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
Wed, 01 Jan 2014 01:05:30 +0100 tuned whitespace
haftmann [Wed, 01 Jan 2014 01:05:30 +0100] rev 54888
tuned whitespace
Wed, 01 Jan 2014 01:05:30 +0100 more precise wording
haftmann [Wed, 01 Jan 2014 01:05:30 +0100] rev 54887
more precise wording
Wed, 01 Jan 2014 01:05:30 +0100 uniform bookkeeping also in the case of deletion
haftmann [Wed, 01 Jan 2014 01:05:30 +0100] rev 54886
uniform bookkeeping also in the case of deletion
(0) -30000 -10000 -3000 -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 +3000 +10000 tip