NEWS
author berghofe
Tue Mar 05 18:54:55 2002 +0100 (2002-03-05)
changeset 13023 f869b6822006
parent 12984 6071200efbf6
child 13025 433c57d09d53
permissions -rw-r--r--
Added two paragraphs on "rules" method and code generator.
wenzelm@12899
     1
wenzelm@5363
     2
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     3
==============================================
wenzelm@2553
     4
wenzelm@12984
     5
New in Isabelle2002 (March 2002)
wenzelm@12984
     6
--------------------------------
wenzelm@11474
     7
wenzelm@11572
     8
*** Document preparation ***
wenzelm@11572
     9
wenzelm@11842
    10
* greatly simplified document preparation setup, including more
wenzelm@11842
    11
graceful interpretation of isatool usedir -i/-d/-D options, and more
wenzelm@11842
    12
instructive isatool mkdir; users should basically be able to get
wenzelm@12899
    13
started with "isatool mkdir HOL Test && isatool make"; alternatively,
wenzelm@12899
    14
users may run a separate document processing stage manually like this:
wenzelm@12899
    15
"isatool usedir -D output HOL Test && isatool document Test/output";
wenzelm@11842
    16
wenzelm@11842
    17
* theory dependency graph may now be incorporated into documents;
wenzelm@11842
    18
isatool usedir -g true will produce session_graph.eps/.pdf for use
wenzelm@11842
    19
with \includegraphics of LaTeX;
wenzelm@11842
    20
wenzelm@11864
    21
* proper spacing of consecutive markup elements, especially text
wenzelm@11864
    22
blocks after section headings;
wenzelm@11864
    23
wenzelm@11572
    24
* support bold style (for single symbols only), input syntax is like
wenzelm@11572
    25
this: "\<^bold>\<alpha>" or "\<^bold>A";
wenzelm@11572
    26
wenzelm@11814
    27
* \<bullet> is now output as bold \cdot by default, which looks much
wenzelm@11572
    28
better in printed text;
wenzelm@11572
    29
wenzelm@11712
    30
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm@11712
    31
note that these symbols are currently unavailable in Proof General /
wenzelm@12769
    32
X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
wenzelm@12690
    33
wenzelm@12690
    34
* isatool latex no longer depends on changed TEXINPUTS, instead
wenzelm@12690
    35
isatool document copies the Isabelle style files to the target
wenzelm@12690
    36
location;
wenzelm@11712
    37
wenzelm@11572
    38
wenzelm@11633
    39
*** Isar ***
wenzelm@11633
    40
wenzelm@12312
    41
* Pure/Provers: improved proof by cases and induction;
wenzelm@12280
    42
  - 'case' command admits impromptu naming of parameters (such as
wenzelm@12280
    43
    "case (Suc n)");
wenzelm@12280
    44
  - 'induct' method divinates rule instantiation from the inductive
wenzelm@12280
    45
    claim; no longer requires excessive ?P bindings for proper
wenzelm@12280
    46
    instantiation of cases;
wenzelm@12280
    47
  - 'induct' method properly enumerates all possibilities of set/type
wenzelm@12280
    48
    rules; as a consequence facts may be also passed through *type*
wenzelm@12280
    49
    rules without further ado;
wenzelm@12280
    50
  - 'induct' method now derives symbolic cases from the *rulified*
wenzelm@12280
    51
    rule (before it used to rulify cases stemming from the internal
wenzelm@12280
    52
    atomized version); this means that the context of a non-atomic
wenzelm@12280
    53
    statement becomes is included in the hypothesis, avoiding the
wenzelm@12280
    54
    slightly cumbersome show "PROP ?case" form;
wenzelm@12280
    55
  - 'induct' may now use elim-style induction rules without chaining
wenzelm@12280
    56
    facts, using ``missing'' premises from the goal state; this allows
wenzelm@12280
    57
    rules stemming from inductive sets to be applied in unstructured
wenzelm@12280
    58
    scripts, while still benefitting from proper handling of non-atomic
wenzelm@12280
    59
    statements; NB: major inductive premises need to be put first, all
wenzelm@12280
    60
    the rest of the goal is passed through the induction;
wenzelm@12280
    61
  - 'induct' proper support for mutual induction involving non-atomic
wenzelm@12280
    62
    rule statements (uses the new concept of simultaneous goals, see
wenzelm@12280
    63
    below);
wenzelm@12853
    64
  - append all possible rule selections, but only use the first
wenzelm@12853
    65
    success (no backtracking);
wenzelm@11995
    66
  - removed obsolete "(simplified)" and "(stripped)" options of methods;
wenzelm@12754
    67
  - undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm@12754
    68
  - added 'print_induct_rules' (covered by help item in recent Proof
wenzelm@12754
    69
    General versions);
wenzelm@11995
    70
  - moved induct/cases attributes to Pure, methods to Provers;
wenzelm@11995
    71
  - generic method setup instantiated for FOL and HOL;
wenzelm@11986
    72
wenzelm@12163
    73
* Pure: support multiple simultaneous goal statements, for example
wenzelm@12163
    74
"have a: A and b: B" (same for 'theorem' etc.); being a pure
wenzelm@12163
    75
meta-level mechanism, this acts as if several individual goals had
wenzelm@12163
    76
been stated separately; in particular common proof methods need to be
wenzelm@12163
    77
repeated in order to cover all claims; note that a single elimination
wenzelm@12163
    78
step is *not* sufficient to establish the two conjunctions, so this
wenzelm@12163
    79
fails:
wenzelm@12163
    80
wenzelm@12163
    81
  assume "A & B" then have A and B ..   (*".." fails*)
wenzelm@12163
    82
wenzelm@12163
    83
better use "obtain" in situations as above; alternative refer to
wenzelm@12163
    84
multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
wenzelm@12163
    85
wenzelm@12078
    86
* Pure: proper integration with ``locales''; unlike the original
wenzelm@12210
    87
version by Florian Kammüller, Isar locales package high-level proof
wenzelm@12078
    88
contexts rather than raw logical ones (e.g. we admit to include
wenzelm@12280
    89
attributes everywhere); operations on locales include merge and
wenzelm@12964
    90
rename; support for implicit arguments (``structures''); simultaneous
wenzelm@12964
    91
type-inference over imports and text; see also HOL/ex/Locales.thy for
wenzelm@12964
    92
some examples;
wenzelm@12078
    93
wenzelm@12707
    94
* Pure: the following commands have been ``localized'', supporting a
wenzelm@12707
    95
target locale specification "(in name)": 'lemma', 'theorem',
wenzelm@12707
    96
'corollary', 'lemmas', 'theorems', 'declare'; the results will be
wenzelm@12707
    97
stored both within the locale and at the theory level (exported and
wenzelm@12707
    98
qualified by the locale name);
wenzelm@12707
    99
wenzelm@12964
   100
* Pure: theory goals may now be specified in ``long'' form, with
wenzelm@12964
   101
ad-hoc contexts consisting of arbitrary locale elements. for example
wenzelm@12964
   102
``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
wenzelm@12964
   103
definitions may be given, too); the result is a meta-level rule with
wenzelm@12964
   104
the context elements being discharged in the obvious way;
wenzelm@12964
   105
wenzelm@12964
   106
* Pure: new proof command 'using' allows to augment currently used
wenzelm@12964
   107
facts after a goal statement ('using' is syntactically analogous to
wenzelm@12964
   108
'apply', but acts on the goal's facts only); this allows chained facts
wenzelm@12964
   109
to be separated into parts given before and after a claim, as in
wenzelm@12964
   110
``from a and b have C using d and e <proof>'';
wenzelm@12078
   111
wenzelm@11722
   112
* Pure: renamed "antecedent" case to "rule_context";
wenzelm@11722
   113
wenzelm@12964
   114
* Pure: new 'judgment' command records explicit information about the
wenzelm@12964
   115
object-logic embedding (used by several tools internally); no longer
wenzelm@12964
   116
use hard-wired "Trueprop";
wenzelm@12964
   117
wenzelm@11738
   118
* Pure: added 'corollary' command;
wenzelm@11738
   119
wenzelm@11722
   120
* Pure: fixed 'token_translation' command;
wenzelm@11722
   121
wenzelm@11899
   122
* Pure: removed obsolete 'exported' attribute;
wenzelm@11899
   123
wenzelm@11933
   124
* Pure: dummy pattern "_" in is/let is now automatically lifted over
wenzelm@11933
   125
bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
wenzelm@11899
   126
supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
wenzelm@11899
   127
wenzelm@11952
   128
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm@11952
   129
statements (atomic meta-level propositions); setup controlled via
wenzelm@11952
   130
rewrite rules declarations of 'atomize' attribute; example
wenzelm@11952
   131
application: 'induct' method with proper rule statements in improper
wenzelm@11952
   132
proof *scripts*;
wenzelm@11952
   133
wenzelm@12106
   134
* Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
wenzelm@12106
   135
now consider the syntactic context of assumptions, giving a better
wenzelm@12106
   136
chance to get type-inference of the arguments right (this is
wenzelm@12106
   137
especially important for locales);
wenzelm@12106
   138
wenzelm@12312
   139
* Pure: "sorry" no longer requires quick_and_dirty in interactive
wenzelm@12312
   140
mode;
wenzelm@12312
   141
wenzelm@12405
   142
* Pure/obtain: the formal conclusion "thesis", being marked as
wenzelm@12405
   143
``internal'', may no longer be reference directly in the text;
wenzelm@12405
   144
potential INCOMPATIBILITY, may need to use "?thesis" in rare
wenzelm@12405
   145
situations;
wenzelm@12405
   146
wenzelm@12405
   147
* Pure: generic 'sym' attribute which declares a rule both as pure
wenzelm@12405
   148
'elim?' and for the 'symmetric' operation;
wenzelm@12405
   149
wenzelm@12877
   150
* Pure: marginal comments ``--'' may now occur just anywhere in the
wenzelm@12877
   151
text; the fixed correlation with particular command syntax has been
wenzelm@12877
   152
discontinued;
wenzelm@12877
   153
berghofe@13023
   154
* Pure: new method 'rules' is particularly well-suited for proof
berghofe@13023
   155
search in intuitionistic logic; a bit slower than 'blast' or 'fast',
berghofe@13023
   156
but often produces more compact proof terms with less detours;
berghofe@13023
   157
wenzelm@12364
   158
* Pure/Provers/classical: simplified integration with pure rule
wenzelm@12364
   159
attributes and methods; the classical "intro?/elim?/dest?"
wenzelm@12364
   160
declarations coincide with the pure ones; the "rule" method no longer
wenzelm@12364
   161
includes classically swapped intros; "intro" and "elim" methods no
wenzelm@12364
   162
longer pick rules from the context; also got rid of ML declarations
wenzelm@12364
   163
AddXIs/AddXEs/AddXDs; all of this has some potential for
wenzelm@12364
   164
INCOMPATIBILITY;
wenzelm@12364
   165
wenzelm@12405
   166
* Provers/classical: attribute 'swapped' produces classical inversions
wenzelm@12405
   167
of introduction rules;
wenzelm@12405
   168
wenzelm@12364
   169
* Provers/simplifier: 'simplified' attribute may refer to explicit
wenzelm@12364
   170
rules instead of full simplifier context; 'iff' attribute handles
wenzelm@12364
   171
conditional rules;
wenzelm@11936
   172
wenzelm@11745
   173
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm@11745
   174
wenzelm@11690
   175
* HOL: 'recdef' now fails on unfinished automated proofs, use
wenzelm@11633
   176
"(permissive)" option to recover old behavior;
wenzelm@11633
   177
wenzelm@11933
   178
* HOL: 'inductive' no longer features separate (collective) attributes
wenzelm@11933
   179
for 'intros' (was found too confusing);
wenzelm@11933
   180
wenzelm@12405
   181
* HOL: properly declared induction rules less_induct and
wenzelm@12405
   182
wf_induct_rule;
wenzelm@12405
   183
kleing@11788
   184
wenzelm@11474
   185
*** HOL ***
wenzelm@11474
   186
wenzelm@11702
   187
* HOL: moved over to sane numeral syntax; the new policy is as
wenzelm@11702
   188
follows:
wenzelm@11702
   189
wenzelm@11702
   190
  - 0 and 1 are polymorphic constants, which are defined on any
wenzelm@11702
   191
  numeric type (nat, int, real etc.);
wenzelm@11702
   192
wenzelm@11702
   193
  - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
wenzelm@11702
   194
  binary representation internally;
wenzelm@11702
   195
wenzelm@11702
   196
  - type nat has special constructor Suc, and generally prefers Suc 0
wenzelm@11702
   197
  over 1::nat and Suc (Suc 0) over 2::nat;
wenzelm@11702
   198
wenzelm@12364
   199
This change may cause significant problems of INCOMPATIBILITY; here
wenzelm@12364
   200
are some hints on converting existing sources:
wenzelm@11702
   201
wenzelm@11702
   202
  - due to the new "num" token, "-0" and "-1" etc. are now atomic
wenzelm@11702
   203
  entities, so expressions involving "-" (unary or binary minus) need
wenzelm@11702
   204
  to be spaced properly;
wenzelm@11702
   205
wenzelm@11702
   206
  - existing occurrences of "1" may need to be constraint "1::nat" or
wenzelm@11702
   207
  even replaced by Suc 0; similar for old "2";
wenzelm@11702
   208
wenzelm@11702
   209
  - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
wenzelm@11702
   210
wenzelm@11702
   211
  - remove all special provisions on numerals in proofs;
wenzelm@11702
   212
wenzelm@12837
   213
* HOL: simp rules nat_number_of expand numerals on nat to Suc/0
wenzelm@12837
   214
representation (depends on bin_arith_simps in the default context);
wenzelm@12837
   215
wenzelm@12736
   216
* HOL: symbolic syntax for x^2 (numeral 2);
wenzelm@12736
   217
wenzelm@12335
   218
* HOL: the class of all HOL types is now called "type" rather than
wenzelm@12335
   219
"term"; INCOMPATIBILITY, need to adapt references to this type class
wenzelm@12335
   220
in axclass/classes, instance/arities, and (usually rare) occurrences
wenzelm@12335
   221
in typings (of consts etc.); internally the class is called
wenzelm@12335
   222
"HOL.type", ML programs should refer to HOLogic.typeS;
wenzelm@12335
   223
wenzelm@12280
   224
* HOL/record package improvements:
wenzelm@12280
   225
  - new derived operations "fields" to build a partial record section,
wenzelm@12280
   226
    "extend" to promote a fixed record to a record scheme, and
wenzelm@12280
   227
    "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
wenzelm@12280
   228
    declared as simp by default;
wenzelm@12587
   229
  - shared operations ("more", "fields", etc.) now need to be always
wenzelm@12587
   230
    qualified) --- potential INCOMPATIBILITY;
wenzelm@12280
   231
  - removed "make_scheme" operations (use "make" with "extend") --
wenzelm@12280
   232
    INCOMPATIBILITY;
wenzelm@11937
   233
  - removed "more" class (simply use "term") -- INCOMPATIBILITY;
wenzelm@12253
   234
  - provides cases/induct rules for use with corresponding Isar
wenzelm@12253
   235
    methods (for concrete records, record schemes, concrete more
wenzelm@12280
   236
    parts, and schematic more parts -- in that order);
wenzelm@11930
   237
  - internal definitions directly based on a light-weight abstract
wenzelm@11930
   238
    theory of product types over typedef rather than datatype;
wenzelm@11930
   239
berghofe@13023
   240
* HOL: generic code generator for generating executable ML code from
berghofe@13023
   241
specifications; specific support for HOL constructs such as inductive
berghofe@13023
   242
datatypes and sets, as well as recursive functions; can be invoked
berghofe@13023
   243
via 'generate_code' theory section;
berghofe@13023
   244
wenzelm@11933
   245
* HOL: canonical cases/induct rules for n-tuples (n = 3..7);
wenzelm@11933
   246
wenzelm@11802
   247
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm@11802
   248
(beware of argument permutation!);
wenzelm@11802
   249
wenzelm@11657
   250
* HOL: linorder_less_split superseded by linorder_cases;
wenzelm@11657
   251
wenzelm@12917
   252
* HOL/List: "nodups" renamed to "distinct";
nipkow@12889
   253
wenzelm@11633
   254
* HOL: added "The" definite description operator; move Hilbert's "Eps"
wenzelm@11633
   255
to peripheral theory "Hilbert_Choice";
wenzelm@11437
   256
wenzelm@11572
   257
* HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
wenzelm@11572
   258
in this (rare) case use:
wenzelm@11572
   259
wenzelm@11572
   260
  delSWrapper "split_all_tac"
wenzelm@11572
   261
  addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
wenzelm@11572
   262
wenzelm@11572
   263
* HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
wenzelm@11474
   264
MAY FAIL;
nipkow@11361
   265
wenzelm@11572
   266
* HOL: introduced f^n = f o ... o f; warning: due to the limits of
wenzelm@11572
   267
Isabelle's type classes, ^ on functions and relations has too general
wenzelm@11572
   268
a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
wenzelm@11572
   269
necessary to attach explicit type constraints;
nipkow@11307
   270
wenzelm@12917
   271
* HOL/Relation: the prefix name of the infix "O" has been changed from
wenzelm@12917
   272
"comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
wenzelm@12917
   273
renamed accordingly (eg "compI" -> "rel_compI").
nipkow@12489
   274
wenzelm@11487
   275
* HOL: syntax translations now work properly with numerals and records
wenzelm@11487
   276
expressions;
wenzelm@11474
   277
wenzelm@12457
   278
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm@12457
   279
of "lam" -- INCOMPATIBILITY;
wenzelm@11474
   280
wenzelm@11933
   281
* HOL: got rid of some global declarations (potential INCOMPATIBILITY
wenzelm@11933
   282
for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
wenzelm@11933
   283
renamed "Product_Type.unit";
wenzelm@11611
   284
nipkow@12564
   285
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
nipkow@12564
   286
wenzelm@12924
   287
* HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
wenzelm@12924
   288
the "cases" method);
wenzelm@12924
   289
wenzelm@12597
   290
* HOL/GroupTheory: group theory examples including Sylow's theorem (by
wenzelm@12597
   291
Florian Kammüller);
wenzelm@12597
   292
wenzelm@12608
   293
* HOL/IMP: updated and converted to new-style theory format; several
wenzelm@12608
   294
parts turned into readable document, with proper Isar proof texts and
wenzelm@12608
   295
some explanations (by Gerwin Klein);
wenzelm@12597
   296
wenzelm@12734
   297
* HOL-Real: added Complex_Numbers (by Gertrud Bauer);
wenzelm@12734
   298
wenzelm@12690
   299
* HOL-Hyperreal is now a logic image;
wenzelm@12690
   300
wenzelm@11611
   301
wenzelm@12022
   302
*** HOLCF ***
wenzelm@12022
   303
wenzelm@12622
   304
* Isar: consts/constdefs supports mixfix syntax for continuous
wenzelm@12622
   305
operations;
wenzelm@12622
   306
wenzelm@12622
   307
* Isar: domain package adapted to new-style theory format, e.g. see
wenzelm@12622
   308
HOLCF/ex/Dnat.thy;
wenzelm@12622
   309
wenzelm@12622
   310
* theory Lift: proper use of rep_datatype lift instead of ML hacks --
wenzelm@12280
   311
potential INCOMPATIBILITY; now use plain induct_tac instead of former
wenzelm@12280
   312
lift.induct_tac, always use UU instead of Undef;
wenzelm@12022
   313
wenzelm@12597
   314
* HOLCF/IMP: updated and converted to new-style theory;
wenzelm@12597
   315
wenzelm@12022
   316
wenzelm@11474
   317
*** ZF ***
wenzelm@11474
   318
wenzelm@12622
   319
* Isar: proper integration of logic-specific tools and packages,
wenzelm@12622
   320
including theory commands '(co)inductive', '(co)datatype',
wenzelm@12622
   321
'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
wenzelm@12622
   322
'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
wenzelm@12622
   323
wenzelm@12622
   324
* theory Main no longer includes AC; for the Axiom of Choice, base
wenzelm@12622
   325
your theory on Main_ZFC;
wenzelm@12622
   326
wenzelm@12622
   327
* the integer library now covers quotients and remainders, with many
wenzelm@12622
   328
laws relating division to addition, multiplication, etc.;
paulson@12563
   329
wenzelm@12280
   330
* ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
wenzelm@12280
   331
typeless version of the formalism;
wenzelm@12280
   332
paulson@12777
   333
* ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory format;
wenzelm@12608
   334
wenzelm@12280
   335
* ZF/Induct: new directory for examples of inductive definitions,
wenzelm@12608
   336
including theory Multiset for multiset orderings; converted to
wenzelm@12608
   337
new-style theory format;
wenzelm@12177
   338
paulson@12850
   339
* Many new theorems about lists, ordinals, etc.;
paulson@12850
   340
wenzelm@11474
   341
wenzelm@11474
   342
*** General ***
wenzelm@11474
   343
wenzelm@12280
   344
* Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
wenzelm@12280
   345
variable proof controls level of detail: 0 = no proofs (only oracle
wenzelm@12280
   346
dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
wenzelm@12280
   347
also ref manual for further ML interfaces;
wenzelm@12280
   348
wenzelm@12280
   349
* Pure/axclass: removed obsolete ML interface
wenzelm@12280
   350
goal_subclass/goal_arity;
wenzelm@12280
   351
wenzelm@12280
   352
* Pure/syntax: new token syntax "num" for plain numerals (without "#"
wenzelm@12280
   353
of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
wenzelm@12280
   354
separate tokens, so expressions involving minus need to be spaced
wenzelm@12280
   355
properly;
wenzelm@12280
   356
wenzelm@12312
   357
* Pure/syntax: support non-oriented infixes, using keyword "infix"
wenzelm@12312
   358
rather than "infixl" or "infixr";
wenzelm@12312
   359
wenzelm@12312
   360
* Pure/syntax: concrete syntax for dummy type variables admits genuine
wenzelm@12312
   361
sort constraint specifications in type inference; e.g. "x::_::foo"
wenzelm@12312
   362
ensures that the type of "x" is of sort "foo" (but not necessarily a
wenzelm@12312
   363
type variable);
wenzelm@12280
   364
wenzelm@12280
   365
* Pure/syntax: print modes "type_brackets" and "no_type_brackets"
wenzelm@12280
   366
control output of nested => (types); the default behavior is
wenzelm@12280
   367
"type_brackets";
wenzelm@12280
   368
wenzelm@12280
   369
* Pure/syntax: builtin parse translation for "_constify" turns valued
wenzelm@11817
   370
tokens into AST constants;
wenzelm@11474
   371
wenzelm@12280
   372
* Pure/syntax: prefer later declarations of translations and print
wenzelm@12280
   373
translation functions; potential INCOMPATIBILITY: need to reverse
wenzelm@12280
   374
multiple declarations for same syntax element constant;
wenzelm@12280
   375
wenzelm@12832
   376
* Pure/show_hyps reset by default (in accordance to existing Isar
wenzelm@12832
   377
practice);
wenzelm@12832
   378
wenzelm@12280
   379
* Provers/classical: renamed addaltern to addafter, addSaltern to
wenzelm@12280
   380
addSafter;
wenzelm@12280
   381
wenzelm@12280
   382
* Provers/clasimp: ``iff'' declarations now handle conditional rules
wenzelm@12280
   383
as well;
wenzelm@12253
   384
wenzelm@12538
   385
* system: tested support for MacOS X; should be able to get Isabelle +
wenzelm@12538
   386
Proof General to work in a plain Terminal after installing Poly/ML
wenzelm@12538
   387
(e.g. from the Isabelle distribution area) and GNU bash alone
wenzelm@12538
   388
(e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
wenzelm@12538
   389
support requires further installations, e.g. from
wenzelm@12538
   390
http://fink.sourceforge.net/);
wenzelm@12538
   391
wenzelm@12280
   392
* system: support Poly/ML 4.1.1 (able to manage larger heaps);
wenzelm@11551
   393
wenzelm@12753
   394
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm@12753
   395
of 40 MB), cf. ML_OPTIONS;
wenzelm@12753
   396
wenzelm@11633
   397
* system: Proof General keywords specification is now part of the
wenzelm@11633
   398
Isabelle distribution (see etc/isar-keywords.el);
wenzelm@11633
   399
wenzelm@12728
   400
* system: support for persistent Proof General sessions (refrain from
wenzelm@12728
   401
outdating all loaded theories on startup); user may create writable
wenzelm@12728
   402
logic images like this: ``isabelle -q HOL Test'';
wenzelm@12597
   403
wenzelm@11551
   404
* system: smart selection of Isabelle process versus Isabelle
wenzelm@11572
   405
interface, accommodates case-insensitive file systems (e.g. HFS+); may
wenzelm@11572
   406
run both "isabelle" and "Isabelle" even if file names are badly
wenzelm@11572
   407
damaged (executable inspects the case of the first letter of its own
wenzelm@11572
   408
name); added separate "isabelle-process" and "isabelle-interface";
wenzelm@11551
   409
wenzelm@12472
   410
* system: refrain from any attempt at filtering input streams; no
wenzelm@12472
   411
longer support ``8bit'' encoding of old isabelle font, instead proper
wenzelm@12472
   412
iso-latin characters may now be used; the related isatools
wenzelm@12472
   413
"symbolinput" and "nonascii" have disappeared as well;
wenzelm@12472
   414
wenzelm@12472
   415
* system: removed old "xterm" interface (the print modes "xterm" and
wenzelm@12472
   416
"xterm_color" are still available for direct use in a suitable
wenzelm@12472
   417
terminal);
wenzelm@12472
   418
paulson@11314
   419
oheimb@11169
   420
wenzelm@11062
   421
New in Isabelle99-2 (February 2001)
wenzelm@11062
   422
-----------------------------------
wenzelm@11062
   423
nipkow@10224
   424
*** Overview of INCOMPATIBILITIES ***
nipkow@10224
   425
paulson@11241
   426
* HOL: please note that theories in the Library and elsewhere often use the
paulson@11241
   427
new-style (Isar) format; to refer to their theorems in an ML script you must
wenzelm@12622
   428
bind them to ML identifers by e.g.      val thm_name = thm "thm_name";
paulson@11241
   429
wenzelm@11043
   430
* HOL: inductive package no longer splits induction rule aggressively,
wenzelm@11043
   431
but only as far as specified by the introductions given; the old
oheimb@11130
   432
format may be recovered via ML function complete_split_rule or attribute
wenzelm@11043
   433
'split_rule (complete)';
wenzelm@11043
   434
wenzelm@10998
   435
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
wenzelm@10998
   436
gfp_Tarski to gfp_unfold;
nipkow@10224
   437
paulson@10288
   438
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
paulson@10288
   439
wenzelm@10858
   440
* HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
wenzelm@10858
   441
relation); infix "^^" has been renamed "``"; infix "``" has been
wenzelm@10858
   442
renamed "`"; "univalent" has been renamed "single_valued";
nipkow@10793
   443
wenzelm@10998
   444
* HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
wenzelm@10998
   445
operation;
wenzelm@10998
   446
nipkow@10868
   447
* HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
nipkow@10856
   448
wenzelm@10391
   449
* Isar: 'obtain' no longer declares "that" fact as simp/intro;
wenzelm@10391
   450
wenzelm@10401
   451
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm@10401
   452
consequence, it is no longer monotonic wrt. the local goal context
wenzelm@10401
   453
(which is now passed through the inductive cases);
wenzelm@10401
   454
wenzelm@10976
   455
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm@10976
   456
\<gg> to \<ggreater>;
wenzelm@10976
   457
nipkow@10224
   458
wenzelm@10245
   459
*** Document preparation ***
wenzelm@10245
   460
wenzelm@10858
   461
* \isabellestyle{NAME} selects version of Isabelle output (currently
wenzelm@10858
   462
available: are "it" for near math-mode best-style output, "sl" for
wenzelm@10858
   463
slanted text style, and "tt" for plain type-writer; if no
wenzelm@10858
   464
\isabellestyle command is given, output is according to slanted
wenzelm@10858
   465
type-writer);
wenzelm@10858
   466
wenzelm@10322
   467
* support sub/super scripts (for single symbols only), input syntax is
wenzelm@10322
   468
like this: "A\<^sup>*" or "A\<^sup>\<star>";
wenzelm@10322
   469
wenzelm@10858
   470
* some more standard symbols; see Appendix A of the system manual for
wenzelm@11062
   471
the complete list of symbols defined in isabellesym.sty;
wenzelm@10858
   472
wenzelm@10998
   473
* improved isabelle style files; more abstract symbol implementation
wenzelm@10998
   474
(should now use \isamath{...} and \isatext{...} in custom symbol
wenzelm@10998
   475
definitions);
wenzelm@10998
   476
wenzelm@10634
   477
* antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
wenzelm@10634
   478
state; Note that presentation of goal states does not conform to
wenzelm@10634
   479
actual human-readable proof documents.  Please do not include goal
wenzelm@10634
   480
states into document output unless you really know what you are doing!
wenzelm@10322
   481
wenzelm@11062
   482
* proper indentation of antiquoted output with proportional LaTeX
wenzelm@11062
   483
fonts;
wenzelm@10862
   484
wenzelm@11050
   485
* no_document ML operator temporarily disables LaTeX document
wenzelm@11050
   486
generation;
wenzelm@11050
   487
wenzelm@11062
   488
* isatool unsymbolize tunes sources for plain ASCII communication;
wenzelm@11062
   489
wenzelm@10322
   490
wenzelm@10306
   491
*** Isar ***
wenzelm@10306
   492
wenzelm@10547
   493
* Pure: Isar now suffers initial goal statements to contain unbound
wenzelm@10547
   494
schematic variables (this does not conform to actual readable proof
wenzelm@10547
   495
documents, due to unpredictable outcome and non-compositional proof
wenzelm@10547
   496
checking); users who know what they are doing may use schematic goals
wenzelm@10547
   497
for Prolog-style synthesis of proven results;
wenzelm@10547
   498
wenzelm@10391
   499
* Pure: assumption method (an implicit finishing) now handles actual
wenzelm@10391
   500
rules as well;
wenzelm@10391
   501
wenzelm@10391
   502
* Pure: improved 'obtain' --- moved to Pure, insert "that" into
wenzelm@10391
   503
initial goal, declare "that" only as Pure intro (only for single
wenzelm@10391
   504
steps); the "that" rule assumption may now be involved in implicit
wenzelm@10391
   505
finishing, thus ".." becomes a feasible for trivial obtains;
wenzelm@10391
   506
wenzelm@10391
   507
* Pure: default proof step now includes 'intro_classes'; thus trivial
wenzelm@10391
   508
instance proofs may be performed by "..";
wenzelm@10391
   509
wenzelm@10391
   510
* Pure: ?thesis / ?this / "..." now work for pure meta-level
wenzelm@10391
   511
statements as well;
wenzelm@10306
   512
wenzelm@11097
   513
* Pure: more robust selection of calculational rules;
wenzelm@11097
   514
wenzelm@10858
   515
* Pure: the builtin notion of 'finished' goal now includes the ==-refl
wenzelm@10858
   516
rule (as well as the assumption rule);
wenzelm@10858
   517
wenzelm@10858
   518
* Pure: 'thm_deps' command visualizes dependencies of theorems and
wenzelm@10858
   519
lemmas, using the graph browser tool;
wenzelm@10858
   520
wenzelm@10944
   521
* Pure: predict failure of "show" in interactive mode;
wenzelm@10944
   522
wenzelm@11016
   523
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm@11016
   524
wenzelm@10401
   525
* HOL: improved method 'induct' --- now handles non-atomic goals
wenzelm@10401
   526
(potential INCOMPATIBILITY); tuned error handling;
wenzelm@10401
   527
wenzelm@10557
   528
* HOL: cases and induct rules now provide explicit hints about the
wenzelm@10547
   529
number of facts to be consumed (0 for "type" and 1 for "set" rules);
wenzelm@10547
   530
any remaining facts are inserted into the goal verbatim;
wenzelm@10547
   531
wenzelm@10858
   532
* HOL: local contexts (aka cases) may now contain term bindings as
wenzelm@10858
   533
well; the 'cases' and 'induct' methods new provide a ?case binding for
wenzelm@10858
   534
the result to be shown in each case;
wenzelm@10858
   535
wenzelm@10770
   536
* HOL: added 'recdef_tc' command;
wenzelm@10770
   537
wenzelm@11016
   538
* isatool convert assists in eliminating legacy ML scripts;
wenzelm@11016
   539
wenzelm@10306
   540
wenzelm@10245
   541
*** HOL ***
wenzelm@10245
   542
wenzelm@10245
   543
* HOL/Library: a collection of generic theories to be used together
wenzelm@10245
   544
with main HOL; the theory loader path already includes this directory
wenzelm@10245
   545
by default; the following existing theories have been moved here:
wenzelm@10245
   546
HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
wenzelm@10337
   547
(as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
wenzelm@10245
   548
wenzelm@10966
   549
* HOL/Unix: "Some aspects of Unix file-system security", a typical
wenzelm@10966
   550
modelling and verification task performed in Isabelle/HOL +
wenzelm@10966
   551
Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
wenzelm@10966
   552
wenzelm@11094
   553
* HOL/Algebra: special summation operator SUM no longer exists, it has
wenzelm@11094
   554
been replaced by setsum; infix 'assoc' now has priority 50 (like
wenzelm@11094
   555
'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
wenzelm@11094
   556
'domain', this makes the theory consistent with mathematical
wenzelm@11094
   557
literature;
wenzelm@11094
   558
wenzelm@10514
   559
* HOL basics: added overloaded operations "inverse" and "divide"
wenzelm@10726
   560
(infix "/"), syntax for generic "abs" operation, generic summation
wenzelm@11094
   561
operator \<Sum>;
wenzelm@10452
   562
wenzelm@10391
   563
* HOL/typedef: simplified package, provide more useful rules (see also
wenzelm@10391
   564
HOL/subset.thy);
wenzelm@10391
   565
wenzelm@10915
   566
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm@10915
   567
now expressed as a proper nested rule (old-style tactic scripts may
wenzelm@10915
   568
require atomize_strip_tac to cope with non-atomic premises);
wenzelm@10915
   569
wenzelm@10915
   570
* HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
wenzelm@10915
   571
to "split_conv" (old name still available for compatibility);
wenzelm@10915
   572
wenzelm@10915
   573
* HOL: improved concrete syntax for strings (e.g. allows translation
wenzelm@10915
   574
rules with string literals);
wenzelm@10915
   575
paulson@12245
   576
* HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
paulson@12245
   577
 and Fleuriot's mechanization of analysis, including the transcendental
paulson@12245
   578
 functions for the reals;
paulson@10756
   579
wenzelm@11094
   580
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
wenzelm@10391
   581
wenzelm@10858
   582
paulson@10474
   583
*** CTT ***
paulson@10474
   584
wenzelm@10547
   585
* CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
wenzelm@10547
   586
"lam" is displayed as TWO lambda-symbols
paulson@10474
   587
wenzelm@10547
   588
* CTT: theory Main now available, containing everything (that is, Bool
wenzelm@10547
   589
and Arith);
wenzelm@10547
   590
paulson@10474
   591
wenzelm@10391
   592
*** General ***
wenzelm@10391
   593
wenzelm@10547
   594
* Pure: the Simplifier has been implemented properly as a derived rule
wenzelm@10547
   595
outside of the actual kernel (at last!); the overall performance
wenzelm@10547
   596
penalty in practical applications is about 50%, while reliability of
wenzelm@10547
   597
the Isabelle inference kernel has been greatly improved;
wenzelm@10547
   598
wenzelm@11112
   599
* print modes "brackets" and "no_brackets" control output of nested =>
wenzelm@11112
   600
(types) and ==> (props); the default behaviour is "brackets";
wenzelm@11112
   601
wenzelm@10391
   602
* Provers: fast_tac (and friends) now handle actual object-logic rules
wenzelm@10391
   603
as assumptions as well;
wenzelm@10391
   604
wenzelm@11124
   605
* system: support Poly/ML 4.0;
wenzelm@11124
   606
wenzelm@11124
   607
* system: isatool install handles KDE version 1 or 2;
wenzelm@11124
   608
wenzelm@10391
   609
wenzelm@10245
   610
wenzelm@10103
   611
New in Isabelle99-1 (October 2000)
wenzelm@10103
   612
----------------------------------
wenzelm@8015
   613
wenzelm@10003
   614
*** Overview of INCOMPATIBILITIES ***
paulson@8014
   615
wenzelm@8848
   616
* HOL: simplification of natural numbers is much changed; to partly
wenzelm@8848
   617
recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
wenzelm@8848
   618
issue the following ML commands:
wenzelm@8848
   619
wenzelm@8848
   620
  Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
wenzelm@8848
   621
  Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
paulson@8788
   622
wenzelm@10129
   623
* HOL: simplification no longer dives into case-expressions; this is
wenzelm@10129
   624
controlled by "t.weak_case_cong" for each datatype t;
wenzelm@10003
   625
wenzelm@10003
   626
* HOL: nat_less_induct renamed to less_induct;
wenzelm@10003
   627
wenzelm@10003
   628
* HOL: systematic renaming of the SOME (Eps) rules, may use isatool
wenzelm@10003
   629
fixsome to patch .thy and .ML sources automatically;
paulson@8967
   630
wenzelm@10003
   631
  select_equality  -> some_equality
wenzelm@10003
   632
  select_eq_Ex     -> some_eq_ex
wenzelm@10003
   633
  selectI2EX       -> someI2_ex
wenzelm@10003
   634
  selectI2         -> someI2
wenzelm@10003
   635
  selectI          -> someI
wenzelm@10003
   636
  select1_equality -> some1_equality
wenzelm@10003
   637
  Eps_sym_eq       -> some_sym_eq_trivial
wenzelm@10003
   638
  Eps_eq           -> some_eq_trivial
wenzelm@10003
   639
wenzelm@10003
   640
* HOL: exhaust_tac on datatypes superceded by new generic case_tac;
wenzelm@10003
   641
wenzelm@10003
   642
* HOL: removed obsolete theorem binding expand_if (refer to split_if
wenzelm@10003
   643
instead);
wenzelm@10003
   644
wenzelm@10003
   645
* HOL: the recursion equations generated by 'recdef' are now called
wenzelm@10003
   646
f.simps instead of f.rules;
wenzelm@10003
   647
wenzelm@10003
   648
* HOL: qed_spec_mp now also handles bounded ALL as well;
wenzelm@10003
   649
wenzelm@10003
   650
* HOL: 0 is now overloaded, so the type constraint ":: nat" may
wenzelm@10003
   651
sometimes be needed;
wenzelm@10003
   652
wenzelm@10003
   653
* HOL: the constant for "f``x" is now "image" rather than "op ``";
paulson@8014
   654
paulson@10065
   655
* HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
paulson@10065
   656
wenzelm@9330
   657
* HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
wenzelm@9330
   658
product is now "<*>" instead of "Times"; the lexicographic product is
wenzelm@9330
   659
now "<*lex*>" instead of "**";
nipkow@8705
   660
wenzelm@10003
   661
* HOL: theory Sexp is now in HOL/Induct examples (it used to be part
wenzelm@10003
   662
of main HOL, but was unused); better use HOL's datatype package;
paulson@9971
   663
wenzelm@10137
   664
* HOL: removed "symbols" syntax for constant "override" of theory Map;
wenzelm@10137
   665
the old syntax may be recovered as follows:
wenzelm@10137
   666
wenzelm@10137
   667
  syntax (symbols)
wenzelm@10137
   668
    override  :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
wenzelm@10137
   669
      (infixl "\\<oplus>" 100)
wenzelm@10137
   670
wenzelm@8848
   671
* HOL/Real: "rabs" replaced by overloaded "abs" function;
wenzelm@8848
   672
wenzelm@8887
   673
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm@8887
   674
Lfp, Gfp, WF); this only affects ML packages that refer to const names
wenzelm@8887
   675
internally;
wenzelm@8887
   676
wenzelm@10003
   677
* HOL and ZF: syntax for quotienting wrt an equivalence relation
wenzelm@10003
   678
changed from A/r to A//r;
wenzelm@9908
   679
wenzelm@10003
   680
* ZF: new treatment of arithmetic (nat & int) may break some old
wenzelm@10003
   681
proofs;
wenzelm@8921
   682
wenzelm@10003
   683
* Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
wenzelm@10003
   684
rulify -> rule_format, elimify -> elim_format, ...);
paulson@9542
   685
wenzelm@9941
   686
* Isar/Provers: intro/elim/dest attributes changed; renamed
wenzelm@9941
   687
intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
wenzelm@9937
   688
should have to change intro!! to intro? only); replaced "delrule" by
wenzelm@9937
   689
"rule del";
wenzelm@9437
   690
wenzelm@9612
   691
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
wenzelm@9612
   692
wenzelm@9437
   693
* Provers: strengthened force_tac by using new first_best_tac;
oheimb@9402
   694
wenzelm@10003
   695
* LaTeX document preparation: several changes of isabelle.sty (see
wenzelm@10003
   696
lib/texinputs);
wenzelm@8729
   697
paulson@8014
   698
wenzelm@8487
   699
*** Document preparation ***
wenzelm@8358
   700
wenzelm@9198
   701
* formal comments (text blocks etc.) in new-style theories may now
wenzelm@9753
   702
contain antiquotations of thm/prop/term/typ/text to be presented
wenzelm@9753
   703
according to latex print mode; concrete syntax is like this:
wenzelm@9753
   704
@{term[show_types] "f(x) = a + x"};
wenzelm@9198
   705
wenzelm@8358
   706
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm@8518
   707
including proper document sources;
wenzelm@8358
   708
wenzelm@8358
   709
* generated LaTeX sources are now deleted after successful run
wenzelm@8358
   710
(isatool document -c); may retain a copy somewhere else via -D option
wenzelm@8358
   711
of isatool usedir;
wenzelm@8358
   712
wenzelm@8566
   713
* isatool usedir -D now lets isatool latex -o sty update the Isabelle
wenzelm@10003
   714
style files, achieving self-contained LaTeX sources and simplifying
wenzelm@10003
   715
LaTeX debugging;
wenzelm@8566
   716
wenzelm@8518
   717
* old-style theories now produce (crude) LaTeX output as well;
wenzelm@8358
   718
wenzelm@9057
   719
* browser info session directories are now self-contained (may be put
wenzelm@9437
   720
on WWW server seperately); improved graphs of nested sessions; removed
wenzelm@9437
   721
graph for 'all sessions';
wenzelm@9057
   722
wenzelm@10003
   723
* several improvements in isabelle style files; \isabellestyle{it}
wenzelm@10003
   724
produces fake math mode output; \isamarkupheader is now \section by
wenzelm@10003
   725
default; see lib/texinputs/isabelle.sty etc.;
wenzelm@9489
   726
wenzelm@8358
   727
wenzelm@8184
   728
*** Isar ***
wenzelm@8184
   729
wenzelm@10003
   730
* Isar/Pure: local results and corresponding term bindings are now
wenzelm@10003
   731
subject to Hindley-Milner polymorphism (similar to ML); this
wenzelm@10003
   732
accommodates incremental type-inference very nicely;
wenzelm@8283
   733
wenzelm@10003
   734
* Isar/Pure: new derived language element 'obtain' supports
wenzelm@10003
   735
generalized existence reasoning;
wenzelm@8621
   736
wenzelm@10003
   737
* Isar/Pure: new calculational elements 'moreover' and 'ultimately'
wenzelm@10003
   738
support accumulation of results, without applying any rules yet;
wenzelm@10003
   739
useful to collect intermediate results without explicit name
wenzelm@10003
   740
references, and for use with transitivity rules with more than 2
wenzelm@10003
   741
premises;
wenzelm@8184
   742
wenzelm@10003
   743
* Isar/Pure: scalable support for case-analysis type proofs: new
wenzelm@10003
   744
'case' language element refers to local contexts symbolically, as
wenzelm@10003
   745
produced by certain proof methods; internally, case names are attached
wenzelm@10003
   746
to theorems as "tags";
wenzelm@8440
   747
wenzelm@10003
   748
* Isar/Pure: theory command 'hide' removes declarations from
wenzelm@9330
   749
class/type/const name spaces;
wenzelm@9330
   750
wenzelm@10003
   751
* Isar/Pure: theory command 'defs' supports option "(overloaded)" to
wenzelm@9330
   752
indicate potential overloading;
wenzelm@9330
   753
wenzelm@10003
   754
* Isar/Pure: changed syntax of local blocks from {{ }} to { };
wenzelm@8621
   755
wenzelm@10003
   756
* Isar/Pure: syntax of sorts made 'inner', i.e. have to write
wenzelm@10003
   757
"{a,b,c}" instead of {a,b,c};
wenzelm@9011
   758
wenzelm@10003
   759
* Isar/Pure now provides its own version of intro/elim/dest
wenzelm@10003
   760
attributes; useful for building new logics, but beware of confusion
wenzelm@10003
   761
with the version in Provers/classical;
wenzelm@9612
   762
wenzelm@10003
   763
* Isar/Pure: the local context of (non-atomic) goals is provided via
wenzelm@10003
   764
case name 'antecedent';
wenzelm@8440
   765
wenzelm@10003
   766
* Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
wenzelm@10003
   767
to the current context is now done automatically);
wenzelm@9383
   768
wenzelm@10003
   769
* Isar/Pure: theory command 'method_setup' provides a simple interface
wenzelm@10003
   770
for definining proof methods in ML;
wenzelm@9612
   771
wenzelm@10003
   772
* Isar/Provers: intro/elim/dest attributes changed; renamed
wenzelm@9941
   773
intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
wenzelm@9941
   774
most cases, one should have to change intro!! to intro? only);
wenzelm@9941
   775
replaced "delrule" by "rule del";
wenzelm@8283
   776
wenzelm@10003
   777
* Isar/Provers: new 'hypsubst' method, plain 'subst' method and
wenzelm@10003
   778
'symmetric' attribute (the latter supercedes [RS sym]);
wenzelm@10003
   779
wenzelm@10003
   780
* Isar/Provers: splitter support (via 'split' attribute and 'simp'
wenzelm@10003
   781
method modifier); 'simp' method: 'only:' modifier removes loopers as
wenzelm@10003
   782
well (including splits);
wenzelm@10003
   783
wenzelm@10003
   784
* Isar/Provers: Simplifier and Classical methods now support all kind
wenzelm@10003
   785
of modifiers used in the past, including 'cong', 'iff', etc.
wenzelm@10003
   786
wenzelm@10003
   787
* Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
wenzelm@10003
   788
of Simplifier and Classical reasoner);
wenzelm@10003
   789
wenzelm@10003
   790
* Isar/HOL: new proof method 'cases' and improved version of 'induct'
wenzelm@10003
   791
now support named cases; major packages (inductive, datatype, primrec,
wenzelm@10003
   792
recdef) support case names and properly name parameters;
wenzelm@9612
   793
wenzelm@10003
   794
* Isar/HOL: new transitivity rules for substitution in inequalities --
wenzelm@10003
   795
monotonicity conditions are extracted to be proven at end of
wenzelm@10003
   796
calculations;
wenzelm@10003
   797
wenzelm@10003
   798
* Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
wenzelm@10003
   799
method anyway;
wenzelm@10003
   800
wenzelm@10003
   801
* Isar/HOL: removed old expand_if = split_if; theorems if_splits =
wenzelm@10003
   802
split_if split_if_asm; datatype package provides theorems foo.splits =
wenzelm@10003
   803
foo.split foo.split_asm for each datatype;
wenzelm@10003
   804
wenzelm@10003
   805
* Isar/HOL: tuned inductive package, rename "intrs" to "intros"
wenzelm@10003
   806
(potential INCOMPATIBILITY), emulation of mk_cases feature for proof
wenzelm@10003
   807
scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
wenzelm@10003
   808
use "(cases (simplified))" method in proper proof texts);
wenzelm@10003
   809
wenzelm@10003
   810
* Isar/HOL: added global 'arith_split' attribute for 'arith' method;
wenzelm@10003
   811
wenzelm@10003
   812
* Isar: names of theorems etc. may be natural numbers as well;
wenzelm@10003
   813
wenzelm@10003
   814
* Isar: 'pr' command: optional arguments for goals_limit and
wenzelm@9724
   815
ProofContext.prems_limit; no longer prints theory contexts, but only
wenzelm@9724
   816
proof states;
wenzelm@8487
   817
wenzelm@10003
   818
* Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
wenzelm@8518
   819
additional print modes to be specified; e.g. "pr(latex)" will print
wenzelm@8518
   820
proof state according to the Isabelle LaTeX style;
wenzelm@8487
   821
wenzelm@10003
   822
* Isar: improved support for emulating tactic scripts, including proof
wenzelm@9612
   823
methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
wenzelm@9612
   824
'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
wenzelm@9612
   825
(for HOL datatypes);
wenzelm@8534
   826
wenzelm@10003
   827
* Isar: simplified (more robust) goal selection of proof methods: 1st
wenzelm@10003
   828
goal, all goals, or explicit goal specifier (tactic emulation); thus
wenzelm@10003
   829
'proof method scripts' have to be in depth-first order;
wenzelm@8673
   830
wenzelm@10003
   831
* Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
wenzelm@8729
   832
wenzelm@10003
   833
* Isar: removed 'help' command, which hasn't been too helpful anyway;
wenzelm@10003
   834
should instead use individual commands for printing items
wenzelm@10003
   835
(print_commands, print_methods etc.);
wenzelm@9224
   836
wenzelm@10003
   837
* Isar: added 'nothing' --- the empty list of theorems;
wenzelm@9239
   838
wenzelm@8184
   839
paulson@8014
   840
*** HOL ***
paulson@8014
   841
wenzelm@10080
   842
* HOL/MicroJava: formalization of a fragment of Java, together with a
wenzelm@10080
   843
corresponding virtual machine and a specification of its bytecode
wenzelm@10080
   844
verifier and a lightweight bytecode verifier, including proofs of
wenzelm@10080
   845
type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
wenzelm@10080
   846
Cornelia Pusch (see also the homepage of project Bali at
wenzelm@10080
   847
http://isabelle.in.tum.de/Bali/);
wenzelm@10080
   848
wenzelm@8518
   849
* HOL/Algebra: new theory of rings and univariate polynomials, by
wenzelm@8518
   850
Clemens Ballarin;
paulson@8014
   851
wenzelm@10157
   852
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
wenzelm@10003
   853
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
wenzelm@10003
   854
Rasmussen;
wenzelm@8570
   855
wenzelm@10157
   856
* HOL/Lattice: fundamental concepts of lattice theory and order
wenzelm@10157
   857
structures, including duals, properties of bounds versus algebraic
wenzelm@10157
   858
laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
wenzelm@10157
   859
Theorem for complete lattices etc.; may also serve as a demonstration
wenzelm@10157
   860
for abstract algebraic reasoning using axiomatic type classes, and
wenzelm@10157
   861
mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
wenzelm@10157
   862
wenzelm@10003
   863
* HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
wenzelm@10003
   864
von Oheimb;
paulson@9542
   865
wenzelm@10164
   866
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm@10164
   867
recursive procedures, by David von Oheimb;
wenzelm@10164
   868
wenzelm@10003
   869
* HOL/Lambda: converted into new-style theory and document;
paulson@9542
   870
wenzelm@10003
   871
* HOL/ex/Multiquote: example of multiple nested quotations and
wenzelm@10003
   872
anti-quotations -- basically a generalized version of de-Bruijn
wenzelm@10003
   873
representation; very useful in avoiding lifting of operations;
wenzelm@8848
   874
wenzelm@9612
   875
* HOL/record: added general record equality rule to simpset; fixed
wenzelm@9612
   876
select-update simplification procedure to handle extended records as
wenzelm@9612
   877
well; admit "r" as field name;
paulson@9542
   878
paulson@8967
   879
* HOL: 0 is now overloaded over the new sort "zero", allowing its use with
paulson@8967
   880
other numeric types and also as the identity of groups, rings, etc.;
paulson@8967
   881
paulson@8967
   882
* HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
paulson@8967
   883
Types nat and int belong to this axclass;
paulson@8967
   884
wenzelm@10003
   885
* HOL: greatly improved simplification involving numerals of type nat, int, real:
paulson@8788
   886
   (i + #8 + j) = Suc k simplifies to  #7 + (i + j) = k
paulson@8832
   887
   i*j + k + j*#3*i     simplifies to  #4*(i*j) + k
paulson@8832
   888
  two terms #m*u and #n*u are replaced by #(m+n)*u
paulson@8832
   889
    (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
paulson@8832
   890
  and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
paulson@8832
   891
    or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
paulson@8736
   892
wenzelm@10003
   893
* HOL: meson_tac is available (previously in ex/meson.ML); it is a
wenzelm@10003
   894
powerful prover for predicate logic but knows nothing of clasets; see
wenzelm@10003
   895
ex/mesontest.ML and ex/mesontest2.ML for example applications;
paulson@9835
   896
wenzelm@8848
   897
* HOL: new version of "case_tac" subsumes both boolean case split and
wenzelm@8440
   898
"exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
wenzelm@8518
   899
exists, may define val exhaust_tac = case_tac for ad-hoc portability;
wenzelm@8440
   900
wenzelm@8848
   901
* HOL: simplification no longer dives into case-expressions: only the
wenzelm@10129
   902
selector expression is simplified, but not the remaining arms; to
wenzelm@10129
   903
enable full simplification of case-expressions for datatype t, you may
wenzelm@10129
   904
remove t.weak_case_cong from the simpset, either globally (Delcongs
wenzelm@10129
   905
[thm"t.weak_case_cong"];) or locally (delcongs [...]).
nipkow@8603
   906
wenzelm@8848
   907
* HOL/recdef: the recursion equations generated by 'recdef' for
wenzelm@8848
   908
function 'f' are now called f.simps instead of f.rules; if all
wenzelm@8848
   909
termination conditions are proved automatically, these simplification
wenzelm@8848
   910
rules are added to the simpset, as in primrec; rules may be named
wenzelm@8848
   911
individually as well, resulting in a separate list of theorems for
wenzelm@8848
   912
each equation;
wenzelm@8848
   913
wenzelm@9489
   914
* HOL/While is a new theory that provides a while-combinator. It
wenzelm@9489
   915
permits the definition of tail-recursive functions without the
wenzelm@9489
   916
provision of a termination measure. The latter is necessary once the
wenzelm@9489
   917
invariant proof rule for while is applied.
nipkow@9457
   918
wenzelm@10003
   919
* HOL: new (overloaded) notation for the set of elements below/above
wenzelm@10003
   920
some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
nipkow@8925
   921
wenzelm@8848
   922
* HOL: theorems impI, allI, ballI bound as "strip";
wenzelm@8848
   923
wenzelm@10003
   924
* HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
nipkow@9746
   925
induct_tac th "x1 ... xn" expects th to have a conclusion of the form
nipkow@9746
   926
P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
nipkow@9746
   927
wenzelm@10003
   928
* HOL/Real: "rabs" replaced by overloaded "abs" function;
nipkow@9737
   929
wenzelm@10003
   930
* HOL: theory Sexp now in HOL/Induct examples (it used to be part of
wenzelm@10003
   931
main HOL, but was unused);
nipkow@8626
   932
wenzelm@10003
   933
* HOL: fewer consts declared as global (e.g. have to refer to
wenzelm@10003
   934
"Lfp.lfp" instead of "lfp" internally; affects ML packages only);
wenzelm@8887
   935
wenzelm@10003
   936
* HOL: tuned AST representation of nested pairs, avoiding bogus output
wenzelm@10003
   937
in case of overlap with user translations (e.g. judgements over
wenzelm@10003
   938
tuples); (note that the underlying logical represenation is still
wenzelm@10003
   939
bogus);
wenzelm@9349
   940
nipkow@8412
   941
paulson@9542
   942
*** ZF ***
paulson@9542
   943
wenzelm@10003
   944
* ZF: simplification automatically cancels common terms in arithmetic
wenzelm@10003
   945
expressions over nat and int;
paulson@9542
   946
wenzelm@10003
   947
* ZF: new treatment of nat to minimize type-checking: all operators
wenzelm@10003
   948
coerce their operands to a natural number using the function natify,
wenzelm@10003
   949
making the algebraic laws unconditional;
paulson@9542
   950
wenzelm@10003
   951
* ZF: as above, for int: operators coerce their operands to an integer
wenzelm@10003
   952
using the function intify;
paulson@9542
   953
wenzelm@10003
   954
* ZF: the integer library now contains many of the usual laws for the
wenzelm@10003
   955
orderings, including $<=, and monotonicity laws for $+ and $*;
paulson@9542
   956
wenzelm@10003
   957
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
wenzelm@10003
   958
simplification;
paulson@9388
   959
wenzelm@10003
   960
* FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
wenzelm@10003
   961
to the simplifier and classical reasoner simultaneously;
paulson@9388
   962
paulson@9388
   963
wenzelm@8358
   964
*** General ***
wenzelm@8358
   965
wenzelm@10003
   966
* Provers: blast_tac now handles actual object-logic rules as
wenzelm@10003
   967
assumptions; note that auto_tac uses blast_tac internally as well;
wenzelm@10003
   968
wenzelm@10003
   969
* Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
wenzelm@10003
   970
outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
wenzelm@10003
   971
wenzelm@9941
   972
* Provers: delrules now handles destruct rules as well (no longer need
wenzelm@9941
   973
explicit make_elim);
wenzelm@9941
   974
wenzelm@10003
   975
* Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
wenzelm@10003
   976
  [| inj ?f;          ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
wenzelm@10003
   977
use instead the strong form,
wenzelm@10003
   978
  [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
wenzelm@10003
   979
in HOL, FOL and ZF the function cla_make_elim will create such rules
wenzelm@10003
   980
from destruct-rules;
wenzelm@9489
   981
wenzelm@9709
   982
* Provers: Simplifier.easy_setup provides a fast path to basic
wenzelm@9709
   983
Simplifier setup for new object-logics;
wenzelm@9709
   984
wenzelm@9709
   985
* Pure: AST translation rules no longer require constant head on LHS;
wenzelm@9349
   986
wenzelm@9709
   987
* Pure: improved name spaces: ambiguous output is qualified; support
wenzelm@9709
   988
for hiding of names;
wenzelm@8729
   989
wenzelm@10003
   990
* system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
wenzelm@10003
   991
XSYMBOL_HOME; no longer need to do manual configuration in most
wenzelm@10003
   992
situations;
wenzelm@10003
   993
wenzelm@9709
   994
* system: compression of ML heaps images may now be controlled via -c
wenzelm@9709
   995
option of isabelle and isatool usedir (currently only observed by
wenzelm@9709
   996
Poly/ML);
wenzelm@8358
   997
wenzelm@9981
   998
* system: isatool installfonts may handle X-Symbol fonts as well (very
wenzelm@9981
   999
useful for remote X11);
wenzelm@9981
  1000
wenzelm@9709
  1001
* system: provide TAGS file for Isabelle sources;
wenzelm@9052
  1002
wenzelm@9288
  1003
* ML: infix 'OF' is a version of 'MRS' with more appropriate argument
wenzelm@9288
  1004
order;
wenzelm@9288
  1005
wenzelm@8994
  1006
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
wenzelm@8994
  1007
timing flag supersedes proof_timing and Toplevel.trace;
wenzelm@8994
  1008
wenzelm@10003
  1009
* ML: new combinators |>> and |>>> for incremental transformations
wenzelm@10003
  1010
with secondary results (e.g. certain theory extensions):
wenzelm@10003
  1011
wenzelm@9330
  1012
* ML: PureThy.add_defs gets additional argument to indicate potential
wenzelm@9330
  1013
overloading (usually false);
wenzelm@9330
  1014
wenzelm@10003
  1015
* ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
wenzelm@10003
  1016
results;
wenzelm@8440
  1017
wenzelm@8358
  1018
wenzelm@8015
  1019
wenzelm@7986
  1020
New in Isabelle99 (October 1999)
wenzelm@7986
  1021
--------------------------------
oheimb@4649
  1022
paulson@5931
  1023
*** Overview of INCOMPATIBILITIES (see below for more details) ***
paulson@5931
  1024
paulson@6922
  1025
* HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
paulson@6922
  1026
are no longer simplified.  (This allows the simplifier to unfold recursive
paulson@6922
  1027
functional programs.)  To restore the old behaviour, declare
wenzelm@7215
  1028
wenzelm@7215
  1029
    Delcongs [if_weak_cong];
paulson@6922
  1030
wenzelm@6269
  1031
* HOL: Removed the obsolete syntax "Compl A"; use -A for set
wenzelm@6269
  1032
complement;
paulson@5931
  1033
wenzelm@6269
  1034
* HOL: the predicate "inj" is now defined by translation to "inj_on";
paulson@6174
  1035
berghofe@7847
  1036
* HOL/datatype: mutual_induct_tac no longer exists --
berghofe@7847
  1037
  use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
berghofe@7847
  1038
wenzelm@6386
  1039
* HOL/typedef: fixed type inference for representing set; type
wenzelm@6386
  1040
arguments now have to occur explicitly on the rhs as type constraints;
wenzelm@6386
  1041
wenzelm@6269
  1042
* ZF: The con_defs part of an inductive definition may no longer refer
wenzelm@6269
  1043
to constants declared in the same theory;
nipkow@6057
  1044
wenzelm@6269
  1045
* HOL, ZF: the function mk_cases, generated by the inductive
wenzelm@6269
  1046
definition package, has lost an argument.  To simplify its result, it
wenzelm@6269
  1047
uses the default simpset instead of a supplied list of theorems.
paulson@6141
  1048
wenzelm@7215
  1049
* HOL/List: the constructors of type list are now Nil and Cons;
wenzelm@7215
  1050
nipkow@7619
  1051
* Simplifier: the type of the infix ML functions
wenzelm@8729
  1052
        setSSolver addSSolver setSolver addSolver
nipkow@7619
  1053
is now  simpset * solver -> simpset  where `solver' is a new abstract type
nipkow@7619
  1054
for packaging solvers. A solver is created via
wenzelm@8729
  1055
        mk_solver: string -> (thm list -> int -> tactic) -> solver
nipkow@7619
  1056
where the string argument is only a comment.
nipkow@6057
  1057
wenzelm@7647
  1058
paulson@6069
  1059
*** Proof tools ***
paulson@6069
  1060
wenzelm@6343
  1061
* Provers/Arith/fast_lin_arith.ML contains a functor for creating a
wenzelm@6343
  1062
decision procedure for linear arithmetic. Currently it is used for
wenzelm@7593
  1063
types `nat', `int', and `real' in HOL (see below); it can, should and
wenzelm@7593
  1064
will be instantiated for other types and logics as well.
paulson@6069
  1065
nipkow@7324
  1066
* The simplifier now accepts rewrite rules with flexible heads, eg
nipkow@7324
  1067
     hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
nipkow@7324
  1068
  They are applied like any rule with a non-pattern lhs, i.e. by first-order
nipkow@7324
  1069
  matching.
paulson@6069
  1070
wenzelm@7593
  1071
paulson@6014
  1072
*** General ***
paulson@6014
  1073
wenzelm@7986
  1074
* New Isabelle/Isar subsystem provides an alternative to traditional
wenzelm@7215
  1075
tactical theorem proving; together with the ProofGeneral/isar user
wenzelm@7215
  1076
interface it offers an interactive environment for developing human
wenzelm@7215
  1077
readable proof documents (Isar == Intelligible semi-automated
wenzelm@7886
  1078
reasoning); for further information see isatool doc isar-ref,
wenzelm@7986
  1079
src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
wenzelm@7886
  1080
wenzelm@9612
  1081
* improved and simplified presentation of theories: better HTML markup
wenzelm@9612
  1082
(including colors), graph views in several sizes; isatool usedir now
wenzelm@9612
  1083
provides a proper interface for user theories (via -P option); actual
wenzelm@9612
  1084
document preparation based on (PDF)LaTeX is available as well (for
wenzelm@9612
  1085
new-style theories only); see isatool doc system for more information;
wenzelm@7215
  1086
wenzelm@7252
  1087
* native support for Proof General, both for classic Isabelle and
wenzelm@7986
  1088
Isabelle/Isar;
wenzelm@7215
  1089
wenzelm@7791
  1090
* ML function thm_deps visualizes dependencies of theorems and lemmas,
wenzelm@7791
  1091
using the graph browser tool;
wenzelm@7791
  1092
wenzelm@6751
  1093
* Isabelle manuals now also available as PDF;
wenzelm@6751
  1094
wenzelm@6449
  1095
* theory loader rewritten from scratch (may not be fully
wenzelm@6449
  1096
bug-compatible); old loadpath variable has been replaced by show_path,
wenzelm@6671
  1097
add_path, del_path, reset_path functions; new operations such as
wenzelm@7593
  1098
update_thy, touch_thy, remove_thy, use/update_thy_only (see also
wenzelm@7593
  1099
isatool doc ref);
wenzelm@6449
  1100
wenzelm@7215
  1101
* improved isatool install: option -k creates KDE application icon,
wenzelm@7215
  1102
option -p DIR installs standalone binaries;
wenzelm@7215
  1103
wenzelm@7215
  1104
* added ML_PLATFORM setting (useful for cross-platform installations);
wenzelm@7215
  1105
more robust handling of platform specific ML images for SML/NJ;
wenzelm@7215
  1106
wenzelm@7886
  1107
* the settings environment is now statically scoped, i.e. it is never
wenzelm@7986
  1108
created again in sub-processes invoked from isabelle, isatool, or
wenzelm@7886
  1109
Isabelle;
wenzelm@7886
  1110
wenzelm@7215
  1111
* path element specification '~~' refers to '$ISABELLE_HOME';
wenzelm@7215
  1112
wenzelm@6343
  1113
* in locales, the "assumes" and "defines" parts may be omitted if
wenzelm@6343
  1114
empty;
wenzelm@5973
  1115
wenzelm@6269
  1116
* new print_mode "xsymbols" for extended symbol support (e.g. genuine
wenzelm@6269
  1117
long arrows);
wenzelm@6259
  1118
wenzelm@6343
  1119
* new print_mode "HTML";
wenzelm@6343
  1120
wenzelm@6343
  1121
* new flag show_tags controls display of tags of theorems (which are
wenzelm@6343
  1122
basically just comments that may be attached by some tools);
wenzelm@6343
  1123
wenzelm@6461
  1124
* Isamode 2.6 requires patch to accomodate change of Isabelle font
wenzelm@6461
  1125
mode and goal output format:
wenzelm@6461
  1126
wenzelm@6461
  1127
diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
wenzelm@6461
  1128
244c244
wenzelm@6461
  1129
<       (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
wenzelm@6461
  1130
---
wenzelm@6533
  1131
>       (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
wenzelm@6461
  1132
diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
wenzelm@6461
  1133
181c181
wenzelm@6461
  1134
< (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
wenzelm@6461
  1135
---
wenzelm@6461
  1136
> (defconst proofstate-proofstart-regexp "^Level [0-9]+"
wenzelm@6461
  1137
wenzelm@7450
  1138
* function bind_thms stores lists of theorems (cf. bind_thm);
wenzelm@7450
  1139
wenzelm@7593
  1140
* new shorthand tactics ftac, eatac, datac, fatac;
wenzelm@7593
  1141
wenzelm@7593
  1142
* qed (and friends) now accept "" as result name; in that case the
wenzelm@7986
  1143
theorem is not stored, but proper checks and presentation of the
wenzelm@7986
  1144
result still apply;
wenzelm@7593
  1145
wenzelm@7805
  1146
* theorem database now also indexes constants "Trueprop", "all",
wenzelm@7805
  1147
"==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
wenzelm@7805
  1148
oheimb@6028
  1149
nipkow@6057
  1150
*** HOL ***
nipkow@6057
  1151
wenzelm@7215
  1152
** HOL arithmetic **
wenzelm@7215
  1153
wenzelm@6343
  1154
* There are now decision procedures for linear arithmetic over nat and
wenzelm@6343
  1155
int:
nipkow@6131
  1156
wenzelm@6343
  1157
1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
wenzelm@6343
  1158
`+', `-', `Suc', `min', `max' and numerical constants; other subterms
wenzelm@6343
  1159
are treated as atomic; subformulae not involving type `nat' or `int'
wenzelm@6343
  1160
are ignored; quantified subformulae are ignored unless they are
wenzelm@6343
  1161
positive universal or negative existential. The tactic has to be
wenzelm@6343
  1162
invoked by hand and can be a little bit slow. In particular, the
wenzelm@6343
  1163
running time is exponential in the number of occurrences of `min' and
wenzelm@6343
  1164
`max', and `-' on `nat'.
nipkow@6131
  1165
wenzelm@6343
  1166
2. fast_arith_tac is a cut-down version of arith_tac: it only takes
wenzelm@6343
  1167
(negated) (in)equalities among the premises and the conclusion into
wenzelm@6343
  1168
account (i.e. no compound formulae) and does not know about `min' and
wenzelm@6343
  1169
`max', and `-' on `nat'. It is fast and is used automatically by the
wenzelm@6343
  1170
simplifier.
nipkow@6131
  1171
wenzelm@6343
  1172
NB: At the moment, these decision procedures do not cope with mixed
wenzelm@6343
  1173
nat/int formulae where the two parts interact, such as `m < n ==>
wenzelm@6343
  1174
int(m) < int(n)'.
oheimb@6028
  1175
wenzelm@7215
  1176
* HOL/Numeral provides a generic theory of numerals (encoded
wenzelm@7313
  1177
efficiently as bit strings); setup for types nat/int/real is in place;
wenzelm@7215
  1178
INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
wenzelm@7215
  1179
int, existing theories and proof scripts may require a few additional
wenzelm@7215
  1180
type constraints;
wenzelm@7215
  1181
wenzelm@7215
  1182
* integer division and remainder can now be performed on constant
wenzelm@7215
  1183
arguments;
paulson@7157
  1184
wenzelm@7215
  1185
* many properties of integer multiplication, division and remainder
wenzelm@7215
  1186
are now available;
paulson@6922
  1187
paulson@7287
  1188
* An interface to the Stanford Validity Checker (SVC) is available through the
paulson@7287
  1189
tactic svc_tac.  Propositional tautologies and theorems of linear arithmetic
paulson@7287
  1190
are proved automatically.  SVC must be installed separately, and its results
paulson@7287
  1191
must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
paulson@7287
  1192
invocation of the underlying oracle).  For SVC see
paulson@7444
  1193
  http://verify.stanford.edu/SVC
paulson@6922
  1194
wenzelm@7125
  1195
* IsaMakefile: the HOL-Real target now builds an actual image;
wenzelm@7125
  1196
wenzelm@7215
  1197
wenzelm@7215
  1198
** HOL misc **
wenzelm@7215
  1199
wenzelm@7595
  1200
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
wenzelm@7595
  1201
(in Isabelle/Isar) -- by Gertrud Bauer;
wenzelm@7595
  1202
wenzelm@7691
  1203
* HOL/BCV: generic model of bytecode verification, i.e. data-flow
wenzelm@7691
  1204
analysis for assembly languages with subtypes;
wenzelm@7691
  1205
wenzelm@6278
  1206
* HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
wenzelm@6278
  1207
-- avoids syntactic ambiguities and treats state, transition, and
wenzelm@6278
  1208
temporal levels more uniformly; introduces INCOMPATIBILITIES due to
wenzelm@6278
  1209
changed syntax and (many) tactics;
wenzelm@6278
  1210
wenzelm@7791
  1211
* HOL/inductive: Now also handles more general introduction rules such
wenzelm@7791
  1212
  as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
wenzelm@7791
  1213
  theorems are now maintained within the theory (maintained via the
wenzelm@7791
  1214
  "mono" attribute);
berghofe@7780
  1215
wenzelm@7238
  1216
* HOL/datatype: Now also handles arbitrarily branching datatypes
wenzelm@7238
  1217
  (using function types) such as
wenzelm@7238
  1218
wenzelm@7238
  1219
  datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
berghofe@7047
  1220
wenzelm@7326
  1221
* HOL/record: record_simproc (part of the default simpset) takes care
wenzelm@7326
  1222
of selectors applied to updated records; record_split_tac is no longer
wenzelm@7327
  1223
part of the default claset; update_defs may now be removed from the
wenzelm@7327
  1224
simpset in many cases; COMPATIBILITY: old behavior achieved by
wenzelm@7326
  1225
wenzelm@7326
  1226
  claset_ref () := claset() addSWrapper record_split_wrapper;
wenzelm@7326
  1227
  Delsimprocs [record_simproc]
wenzelm@7326
  1228
wenzelm@6386
  1229
* HOL/typedef: fixed type inference for representing set; type
wenzelm@6386
  1230
arguments now have to occur explicitly on the rhs as type constraints;
wenzelm@6386
  1231
paulson@7287
  1232
* HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
paulson@7287
  1233
names rather than an ML expression;
paulson@7287
  1234
paulson@7287
  1235
* HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
paulson@7287
  1236
supplied later.  Program schemes can be defined, such as
paulson@7287
  1237
    "While B C s = (if B s then While B C (C s) else s)"
paulson@7287
  1238
where the well-founded relation can be chosen after B and C have been given.
wenzelm@6563
  1239
wenzelm@7215
  1240
* HOL/List: the constructors of type list are now Nil and Cons;
wenzelm@7215
  1241
INCOMPATIBILITY: while [] and infix # syntax is still there, of
wenzelm@7215
  1242
course, ML tools referring to List.list.op # etc. have to be adapted;
wenzelm@7215
  1243
wenzelm@7238
  1244
* HOL_quantifiers flag superseded by "HOL" print mode, which is
wenzelm@7238
  1245
disabled by default; run isabelle with option -m HOL to get back to
wenzelm@7238
  1246
the original Gordon/HOL-style output;
wenzelm@7238
  1247
wenzelm@7238
  1248
* HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
wenzelm@7238
  1249
ALL x<=y. P, EX x<y. P, EX x<=y. P;
wenzelm@7238
  1250
wenzelm@7238
  1251
* HOL basic syntax simplified (more orthogonal): all variants of
wenzelm@7238
  1252
All/Ex now support plain / symbolic / HOL notation; plain syntax for
wenzelm@7238
  1253
Eps operator is provided as well: "SOME x. P[x]";
wenzelm@7238
  1254
berghofe@7320
  1255
* HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
wenzelm@7261
  1256
wenzelm@7280
  1257
* HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
wenzelm@7280
  1258
thus available for user theories;
wenzelm@7280
  1259
wenzelm@7300
  1260
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
wenzelm@7300
  1261
HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
wenzelm@7300
  1262
time;
wenzelm@7300
  1263
wenzelm@7986
  1264
* HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
wenzelm@7986
  1265
several times and then mp;
oheimb@7492
  1266
wenzelm@7215
  1267
paulson@7113
  1268
*** LK ***
paulson@7113
  1269
wenzelm@7215
  1270
* the notation <<...>> is now available as a notation for sequences of
wenzelm@7215
  1271
formulas;
paulson@7113
  1272
paulson@7113
  1273
* the simplifier is now installed
paulson@7113
  1274
wenzelm@8729
  1275
* the axiom system has been generalized (thanks to Soren Heilmann)
paulson@7113
  1276
paulson@7113
  1277
* the classical reasoner now has a default rule database
paulson@7113
  1278
paulson@7113
  1279
paulson@6064
  1280
*** ZF ***
paulson@6064
  1281
paulson@6064
  1282
* new primrec section allows primitive recursive functions to be given
wenzelm@6269
  1283
directly (as in HOL) over datatypes and the natural numbers;
paulson@6064
  1284
wenzelm@6269
  1285
* new tactics induct_tac and exhaust_tac for induction (or case
wenzelm@6269
  1286
analysis) over datatypes and the natural numbers;
paulson@6064
  1287
paulson@6064
  1288
* the datatype declaration of type T now defines the recursor T_rec;
paulson@6064
  1289
paulson@6141
  1290
* simplification automatically does freeness reasoning for datatype
wenzelm@6269
  1291
constructors;
paulson@6141
  1292
wenzelm@6269
  1293
* automatic type-inference, with AddTCs command to insert new
wenzelm@6269
  1294
type-checking rules;
paulson@6155
  1295
wenzelm@6269
  1296
* datatype introduction rules are now added as Safe Introduction rules
wenzelm@6269
  1297
to the claset;
paulson@6155
  1298
wenzelm@6269
  1299
* the syntax "if P then x else y" is now available in addition to
wenzelm@6269
  1300
if(P,x,y);
wenzelm@6269
  1301
paulson@6069
  1302
wenzelm@6343
  1303
*** Internal programming interfaces ***
wenzelm@6343
  1304
wenzelm@7919
  1305
* tuned simplifier trace output; new flag debug_simp;
wenzelm@7919
  1306
wenzelm@7420
  1307
* structures Vartab / Termtab (instances of TableFun) offer efficient
wenzelm@7420
  1308
tables indexed by indexname_ord / term_ord (compatible with aconv);
wenzelm@7420
  1309
wenzelm@6386
  1310
* AxClass.axclass_tac lost the theory argument;
wenzelm@6386
  1311
wenzelm@6343
  1312
* tuned current_goals_markers semantics: begin / end goal avoids
wenzelm@6343
  1313
printing empty lines;
wenzelm@6343
  1314
wenzelm@6343
  1315
* removed prs and prs_fn hook, which was broken because it did not
wenzelm@6343
  1316
include \n in its semantics, forcing writeln to add one
wenzelm@6343
  1317
uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
wenzelm@6343
  1318
string -> unit if you really want to output text without newline;
wenzelm@6343
  1319
wenzelm@6343
  1320
* Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
wenzelm@6343
  1321
plain output, interface builders may have to enable 'isabelle_font'
wenzelm@6343
  1322
mode to get Isabelle font glyphs as before;
wenzelm@6343
  1323
wenzelm@6343
  1324
* refined token_translation interface; INCOMPATIBILITY: output length
wenzelm@6343
  1325
now of type real instead of int;
wenzelm@6343
  1326
wenzelm@7196
  1327
* theory loader actions may be traced via new ThyInfo.add_hook
wenzelm@7196
  1328
interface (see src/Pure/Thy/thy_info.ML); example application: keep
wenzelm@7196
  1329
your own database of information attached to *whole* theories -- as
wenzelm@7196
  1330
opposed to intra-theory data slots offered via TheoryDataFun;
wenzelm@7196
  1331
wenzelm@7647
  1332
* proper handling of dangling sort hypotheses (at last!);
wenzelm@7647
  1333
Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
wenzelm@7647
  1334
extra sort hypotheses that can be witnessed from the type signature;
wenzelm@7986
  1335
the force_strip_shyps flag is gone, any remaining shyps are simply
wenzelm@7986
  1336
left in the theorem (with a warning issued by strip_shyps_warning);
wenzelm@7647
  1337
wenzelm@6343
  1338
paulson@6064
  1339
wenzelm@5781
  1340
New in Isabelle98-1 (October 1998)
wenzelm@5781
  1341
----------------------------------
wenzelm@5781
  1342
wenzelm@5127
  1343
*** Overview of INCOMPATIBILITIES (see below for more details) ***
wenzelm@4842
  1344
wenzelm@5726
  1345
* several changes of automated proof tools;
wenzelm@5373
  1346
wenzelm@5726
  1347
* HOL: major changes to the inductive and datatype packages, including
wenzelm@5726
  1348
some minor incompatibilities of theory syntax;
berghofe@5214
  1349
wenzelm@5726
  1350
* HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
wenzelm@5217
  1351
called `inj_on';
paulson@5160
  1352
nipkow@5275
  1353
* HOL: removed duplicate thms in Arith:
nipkow@5275
  1354
  less_imp_add_less  should be replaced by  trans_less_add1
nipkow@5275
  1355
  le_imp_add_le      should be replaced by  trans_le_add1
paulson@5160
  1356
wenzelm@5726
  1357
* HOL: unary minus is now overloaded (new type constraints may be
wenzelm@5726
  1358
required);
paulson@5490
  1359
wenzelm@5726
  1360
* HOL and ZF: unary minus for integers is now #- instead of #~.  In
wenzelm@5726
  1361
ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
wenzelm@5726
  1362
now taken as an integer constant.
paulson@5541
  1363
wenzelm@5726
  1364
* Pure: ML function 'theory_of' renamed to 'theory';
wenzelm@5397
  1365
wenzelm@5363
  1366
wenzelm@5127
  1367
*** Proof tools ***
nipkow@4880
  1368
nipkow@5657
  1369
* Simplifier:
nipkow@5657
  1370
  1. Asm_full_simp_tac is now more aggressive.
nipkow@5657
  1371
     1. It will sometimes reorient premises if that increases their power to
nipkow@5657
  1372
        simplify.
nipkow@5657
  1373
     2. It does no longer proceed strictly from left to right but may also
nipkow@5657
  1374
        rotate premises to achieve further simplification.
nipkow@5657
  1375
     For compatibility reasons there is now Asm_lr_simp_tac which is like the
nipkow@5657
  1376
     old Asm_full_simp_tac in that it does not rotate premises.
nipkow@5657
  1377
  2. The simplifier now knows a little bit about nat-arithmetic.
nipkow@4880
  1378
wenzelm@5127
  1379
* Classical reasoner: wrapper mechanism for the classical reasoner now
wenzelm@5127
  1380
allows for selected deletion of wrappers, by introduction of names for
wenzelm@5127
  1381
wrapper functionals.  This implies that addbefore, addSbefore,
wenzelm@5127
  1382
addaltern, and addSaltern now take a pair (name, tactic) as argument,
wenzelm@5127
  1383
and that adding two tactics with the same name overwrites the first
wenzelm@5127
  1384
one (emitting a warning).
oheimb@4824
  1385
  type wrapper = (int -> tactic) -> (int -> tactic)
oheimb@4649
  1386
  setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
oheimb@4824
  1387
  addWrapper, addSWrapper: claset * (string * wrapper) -> claset
oheimb@4824
  1388
  delWrapper, delSWrapper: claset *  string            -> claset
oheimb@4649
  1389
  getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
oheimb@4649
  1390
wenzelm@5705
  1391
* Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
wenzelm@5726
  1392
semantics; addbefore now affects only the unsafe part of step_tac
wenzelm@5726
  1393
etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
wenzelm@5726
  1394
FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
wenzelm@5726
  1395
by Force_tac;
oheimb@5524
  1396
wenzelm@5726
  1397
* Classical reasoner: setwrapper to setWrapper and compwrapper to
wenzelm@5726
  1398
compWrapper; added safe wrapper (and access functions for it);
oheimb@5524
  1399
wenzelm@5127
  1400
* HOL/split_all_tac is now much faster and fails if there is nothing
wenzelm@5726
  1401
to split.  Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
wenzelm@5726
  1402
and the names of the automatically generated variables have changed.
wenzelm@5726
  1403
split_all_tac has moved within claset() from unsafe wrappers to safe
wenzelm@5726
  1404
wrappers, which means that !!-bound variables are split much more
wenzelm@5726
  1405
aggressively, and safe_tac and clarify_tac now split such variables.
wenzelm@5726
  1406
If this splitting is not appropriate, use delSWrapper "split_all_tac".
wenzelm@5726
  1407
Note: the same holds for record_split_tac, which does the job of
wenzelm@5726
  1408
split_all_tac for record fields.
wenzelm@5127
  1409
wenzelm@5726
  1410
* HOL/Simplifier: Rewrite rules for case distinctions can now be added
wenzelm@5726
  1411
permanently to the default simpset using Addsplits just like
wenzelm@5726
  1412
Addsimps. They can be removed via Delsplits just like
wenzelm@5726
  1413
Delsimps. Lower-case versions are also available.
wenzelm@5127
  1414
wenzelm@5726
  1415
* HOL/Simplifier: The rule split_if is now part of the default
wenzelm@5726
  1416
simpset. This means that the simplifier will eliminate all occurrences
wenzelm@5726
  1417
of if-then-else in the conclusion of a goal. To prevent this, you can
wenzelm@5726
  1418
either remove split_if completely from the default simpset by
wenzelm@5726
  1419
`Delsplits [split_if]' or remove it in a specific call of the
wenzelm@5726
  1420
simplifier using `... delsplits [split_if]'.  You can also add/delete
wenzelm@5726
  1421
other case splitting rules to/from the default simpset: every datatype
wenzelm@5726
  1422
generates suitable rules `split_t_case' and `split_t_case_asm' (where
wenzelm@5726
  1423
t is the name of the datatype).
wenzelm@5127
  1424
wenzelm@5726
  1425
* Classical reasoner / Simplifier combination: new force_tac (and
wenzelm@5127
  1426
derivatives Force_tac, force) combines rewriting and classical
wenzelm@5127
  1427
reasoning (and whatever other tools) similarly to auto_tac, but is
wenzelm@5726
  1428
aimed to solve the given subgoal completely.
wenzelm@5127
  1429
wenzelm@5127
  1430
wenzelm@5127
  1431
*** General ***
wenzelm@5127
  1432
wenzelm@5217
  1433
* new top-level commands `Goal' and `Goalw' that improve upon `goal'
wenzelm@5127
  1434
and `goalw': the theory is no longer needed as an explicit argument -
wenzelm@5127
  1435
the current theory context is used; assumptions are no longer returned
wenzelm@5127
  1436
at the ML-level unless one of them starts with ==> or !!; it is
wenzelm@5217
  1437
recommended to convert to these new commands using isatool fixgoal
wenzelm@5217
  1438
(backup your sources first!);
wenzelm@4842
  1439
wenzelm@5217
  1440
* new top-level commands 'thm' and 'thms' for retrieving theorems from
wenzelm@5207
  1441
the current theory context, and 'theory' to lookup stored theories;
paulson@4806
  1442
paulson@5722
  1443
* new theory section 'locale' for declaring constants, assumptions and
paulson@5722
  1444
definitions that have local scope;
paulson@5722
  1445
wenzelm@5127
  1446
* new theory section 'nonterminals' for purely syntactic types;
wenzelm@4858
  1447
wenzelm@5127
  1448
* new theory section 'setup' for generic ML setup functions
wenzelm@5127
  1449
(e.g. package initialization);
wenzelm@4869
  1450
wenzelm@5131
  1451
* the distribution now includes Isabelle icons: see
wenzelm@5131
  1452
lib/logo/isabelle-{small,tiny}.xpm;
wenzelm@5131
  1453
wenzelm@5363
  1454
* isatool install - install binaries with absolute references to
wenzelm@5363
  1455
ISABELLE_HOME/bin;
wenzelm@5363
  1456
wenzelm@5572
  1457
* isatool logo -- create instances of the Isabelle logo (as EPS);
wenzelm@5572
  1458
wenzelm@5407
  1459
* print mode 'emacs' reserved for Isamode;
wenzelm@5407
  1460
wenzelm@5726
  1461
* support multiple print (ast) translations per constant name;
wenzelm@5726
  1462
wenzelm@6925
  1463
* theorems involving oracles are now printed with a suffixed [!];
wenzelm@6925
  1464
wenzelm@4711
  1465
paulson@4661
  1466
*** HOL ***
paulson@4661
  1467
wenzelm@5710
  1468
* there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
nipkow@5709
  1469
wenzelm@5217
  1470
* HOL/inductive package reorganized and improved: now supports mutual
paulson@5267
  1471
definitions such as
wenzelm@5217
  1472
wenzelm@5217
  1473
  inductive EVEN ODD
wenzelm@5217
  1474
    intrs
wenzelm@5217
  1475
      null "0 : EVEN"
wenzelm@5217
  1476
      oddI "n : EVEN ==> Suc n : ODD"
wenzelm@5217
  1477
      evenI "n : ODD ==> Suc n : EVEN"
wenzelm@5217
  1478
wenzelm@5217
  1479
new theorem list "elims" contains an elimination rule for each of the
wenzelm@5217
  1480
recursive sets; inductive definitions now handle disjunctive premises
wenzelm@5217
  1481
correctly (also ZF);
berghofe@5214
  1482
wenzelm@5217
  1483
INCOMPATIBILITIES: requires Inductive as an ancestor; component
wenzelm@5217
  1484
"mutual_induct" no longer exists - the induction rule is always
wenzelm@5217
  1485
contained in "induct";
wenzelm@5217
  1486
wenzelm@5217
  1487
wenzelm@5217
  1488
* HOL/datatype package re-implemented and greatly improved: now
paulson@5267
  1489
supports mutually recursive datatypes such as
wenzelm@5217
  1490
wenzelm@5217
  1491
  datatype
wenzelm@5217
  1492
    'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
wenzelm@5217
  1493
            | SUM ('a aexp) ('a aexp)
wenzelm@5217
  1494
            | DIFF ('a aexp) ('a aexp)
wenzelm@5217
  1495
            | NUM 'a
wenzelm@5217
  1496
  and
wenzelm@5217
  1497
    'a bexp = LESS ('a aexp) ('a aexp)
wenzelm@5217
  1498
            | AND ('a bexp) ('a bexp)
wenzelm@5217
  1499
            | OR ('a bexp) ('a bexp)
wenzelm@5217
  1500
paulson@5267
  1501
as well as indirectly recursive datatypes such as
berghofe@5214
  1502
wenzelm@5217
  1503
  datatype
wenzelm@5217
  1504
    ('a, 'b) term = Var 'a
wenzelm@5217
  1505
                  | App 'b ((('a, 'b) term) list)
berghofe@5214
  1506
wenzelm@5217
  1507
The new tactic  mutual_induct_tac [<var_1>, ..., <var_n>] i  performs
wenzelm@5217
  1508
induction on mutually / indirectly recursive datatypes.
wenzelm@5217
  1509
wenzelm@5217
  1510
Primrec equations are now stored in theory and can be accessed via
wenzelm@5217
  1511
<function_name>.simps.
wenzelm@5217
  1512
wenzelm@5217
  1513
INCOMPATIBILITIES:
berghofe@5214
  1514
wenzelm@5217
  1515
  - Theories using datatypes must now have theory Datatype as an
wenzelm@5217
  1516
    ancestor.
wenzelm@5217
  1517
  - The specific <typename>.induct_tac no longer exists - use the
wenzelm@5217
  1518
    generic induct_tac instead.
berghofe@5226
  1519
  - natE has been renamed to nat.exhaust - use exhaust_tac
wenzelm@5217
  1520
    instead of res_inst_tac ... natE. Note that the variable
berghofe@5226
  1521
    names in nat.exhaust differ from the names in natE, this
wenzelm@5217
  1522
    may cause some "fragile" proofs to fail.
wenzelm@5217
  1523
  - The theorems split_<typename>_case and split_<typename>_case_asm
wenzelm@5217
  1524
    have been renamed to <typename>.split and <typename>.split_asm.
wenzelm@5217
  1525
  - Since default sorts of type variables are now handled correctly,
wenzelm@5217
  1526
    some datatype definitions may have to be annotated with explicit
wenzelm@5217
  1527
    sort constraints.
wenzelm@5217
  1528
  - Primrec definitions no longer require function name and type
wenzelm@5217
  1529
    of recursive argument.
berghofe@5214
  1530
wenzelm@5217
  1531
Consider using isatool fixdatatype to adapt your theories and proof
wenzelm@5217
  1532
scripts to the new package (backup your sources first!).
wenzelm@5217
  1533
wenzelm@5217
  1534
wenzelm@5726
  1535
* HOL/record package: considerably improved implementation; now
wenzelm@5726
  1536
includes concrete syntax for record types, terms, updates; theorems
wenzelm@5726
  1537
for surjective pairing and splitting !!-bound record variables; proof
wenzelm@5726
  1538
support is as follows:
wenzelm@5726
  1539
wenzelm@5726
  1540
  1) standard conversions (selectors or updates applied to record
wenzelm@5726
  1541
constructor terms) are part of the standard simpset;
wenzelm@5726
  1542
wenzelm@5726
  1543
  2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
wenzelm@5726
  1544
made part of standard simpset and claset via addIffs;
wenzelm@5726
  1545
wenzelm@5726
  1546
  3) a tactic for record field splitting (record_split_tac) is part of
wenzelm@5726
  1547
the standard claset (addSWrapper);
wenzelm@5726
  1548
wenzelm@5726
  1549
To get a better idea about these rules you may retrieve them via
wenzelm@5726
  1550
something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
wenzelm@5726
  1551
the name of your record type.
wenzelm@5726
  1552
wenzelm@5726
  1553
The split tactic 3) conceptually simplifies by the following rule:
wenzelm@5726
  1554
wenzelm@5726
  1555
  "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
wenzelm@5726
  1556
wenzelm@5726
  1557
Thus any record variable that is bound by meta-all will automatically
wenzelm@5726
  1558
blow up into some record constructor term, consequently the
wenzelm@5726
  1559
simplifications of 1), 2) apply.  Thus force_tac, auto_tac etc. shall
wenzelm@5726
  1560
solve record problems automatically.
wenzelm@5726
  1561
berghofe@5214
  1562
wenzelm@5125
  1563
* reorganized the main HOL image: HOL/Integ and String loaded by
wenzelm@5125
  1564
default; theory Main includes everything;
wenzelm@5125
  1565
paulson@5650
  1566
* automatic simplification of integer sums and comparisons, using cancellation;
paulson@5650
  1567
oheimb@5526
  1568
* added option_map_eq_Some and not_Some_eq to the default simpset and claset;
wenzelm@5127
  1569
wenzelm@5127
  1570
* added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
wenzelm@5127
  1571
wenzelm@5127
  1572
* many new identities for unions, intersections, set difference, etc.;
wenzelm@5127
  1573
wenzelm@5127
  1574
* expand_if, expand_split, expand_sum_case and expand_nat_case are now
wenzelm@5127
  1575
called split_if, split_split, split_sum_case and split_nat_case (to go
wenzelm@5127
  1576
with add/delsplits);
wenzelm@5125
  1577
wenzelm@5127
  1578
* HOL/Prod introduces simplification procedure unit_eq_proc rewriting
wenzelm@5127
  1579
(?x::unit) = (); this is made part of the default simpset, which COULD
wenzelm@5127
  1580
MAKE EXISTING PROOFS FAIL under rare circumstances (consider
wenzelm@5207
  1581
'Delsimprocs [unit_eq_proc];' as last resort); also note that
wenzelm@5207
  1582
unit_abs_eta_conv is added in order to counter the effect of
wenzelm@5207
  1583
unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
wenzelm@5207
  1584
%u.f();
wenzelm@5125
  1585
wenzelm@5217
  1586
* HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
wenzelm@5217
  1587
makes more sense);
berghofe@5109
  1588
paulson@5475
  1589
* HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
paulson@5475
  1590
  It and 'sym RS equals0D' are now in the default  claset, giving automatic
paulson@5475
  1591
  disjointness reasoning but breaking a few old proofs.
paulson@5267
  1592
wenzelm@5217
  1593
* HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
wenzelm@5217
  1594
to 'converse' from 'inverse' (for compatibility with ZF and some
wenzelm@5217
  1595
literature);
wenzelm@5085
  1596
wenzelm@5127
  1597
* HOL/recdef can now declare non-recursive functions, with {} supplied as
wenzelm@5127
  1598
the well-founded relation;
oheimb@4838
  1599
paulson@5490
  1600
* HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
paulson@5490
  1601
    Compl A.  The "Compl" syntax remains available as input syntax for this
paulson@5490
  1602
    release ONLY.
paulson@5490
  1603
wenzelm@5127
  1604
* HOL/Update: new theory of function updates:
wenzelm@5127
  1605
    f(a:=b) == %x. if x=a then b else f x
wenzelm@5127
  1606
may also be iterated as in f(a:=b,c:=d,...);
nipkow@5077
  1607
wenzelm@5127
  1608
* HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
paulson@4899
  1609
nipkow@5282
  1610
* HOL/List:
nipkow@5282
  1611
  - new function list_update written xs[i:=v] that updates the i-th
nipkow@5282
  1612
    list position. May also be iterated as in xs[i:=a,j:=b,...].
nipkow@5428
  1613
  - new function `upt' written [i..j(] which generates the list
nipkow@5428
  1614
    [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
nipkow@5428
  1615
    bound write [i..j], which is a shorthand for [i..j+1(].
nipkow@5282
  1616
  - new lexicographic orderings and corresponding wellfoundedness theorems.
paulson@4779
  1617
wenzelm@5127
  1618
* HOL/Arith:
wenzelm@5127
  1619
  - removed 'pred' (predecessor) function;
wenzelm@5127
  1620
  - generalized some theorems about n-1;
wenzelm@5127
  1621
  - many new laws about "div" and "mod";
wenzelm@5127
  1622
  - new laws about greatest common divisors (see theory ex/Primes);
oheimb@4766
  1623
wenzelm@5127
  1624
* HOL/Relation: renamed the relational operator r^-1 "converse"
wenzelm@4842
  1625
instead of "inverse";
wenzelm@4711
  1626
nipkow@5651
  1627
* HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
nipkow@5651
  1628
  of the multiset ordering;
nipkow@5651
  1629
wenzelm@5127
  1630
* directory HOL/Real: a construction of the reals using Dedekind cuts
nipkow@5651
  1631
  (not included by default);
nipkow@4835
  1632
wenzelm@5127
  1633
* directory HOL/UNITY: Chandy and Misra's UNITY formalism;
wenzelm@4711
  1634
nipkow@5651
  1635
* directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
nipkow@5651
  1636
  programs, i.e. different program variables may have different types.
nipkow@5651
  1637
paulson@5142
  1638
* calling (stac rew i) now fails if "rew" has no effect on the goal
paulson@5142
  1639
  [previously, this check worked only if the rewrite rule was unconditional]
paulson@5308
  1640
  Now rew can involve either definitions or equalities (either == or =).
wenzelm@5002
  1641
wenzelm@5363
  1642
paulson@4879
  1643
*** ZF ***
paulson@4879
  1644
paulson@5332
  1645
* theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
paulson@5332
  1646
  only the theorems proved on ZF.ML;
paulson@5160
  1647
paulson@5475
  1648
* ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
paulson@5475
  1649
  It and 'sym RS equals0D' are now in the default  claset, giving automatic
paulson@5475
  1650
  disjointness reasoning but breaking a few old proofs.
paulson@5267
  1651
paulson@5160
  1652
* ZF/Update: new theory of function updates
paulson@5160
  1653
    with default rewrite rule  f(x:=y) ` z = if(z=x, y, f`z)
paulson@5160
  1654
  may also be iterated as in f(a:=b,c:=d,...);
paulson@5160
  1655
paulson@4879
  1656
* in  let x=t in u(x), neither t nor u(x) has to be an FOL term.
oheimb@4649
  1657
paulson@5142
  1658
* calling (stac rew i) now fails if "rew" has no effect on the goal
paulson@5142
  1659
  [previously, this check worked only if the rewrite rule was unconditional]
paulson@5308
  1660
  Now rew can involve either definitions or equalities (either == or =).
paulson@5142
  1661
paulson@5160
  1662
* case_tac provided for compatibility with HOL
paulson@5160
  1663
    (like the old excluded_middle_tac, but with subgoals swapped)
paulson@5160
  1664
wenzelm@4842
  1665
wenzelm@5127
  1666
*** Internal programming interfaces ***
wenzelm@5002
  1667
wenzelm@5251
  1668
* Pure: several new basic modules made available for general use, see
wenzelm@5251
  1669
also src/Pure/README;
wenzelm@5207
  1670
wenzelm@5008
  1671
* improved the theory data mechanism to support encapsulation (data
wenzelm@5008
  1672
kind name replaced by private Object.kind, acting as authorization
wenzelm@5373
  1673
key); new type-safe user interface via functor TheoryDataFun; generic
wenzelm@5373
  1674
print_data function becomes basically useless;
wenzelm@5002
  1675
wenzelm@5251
  1676
* removed global_names compatibility flag -- all theory declarations
wenzelm@5251
  1677
are qualified by default;
wenzelm@5251
  1678
wenzelm@5085
  1679
* module Pure/Syntax now offers quote / antiquote translation
wenzelm@5085
  1680
functions (useful for Hoare logic etc. with implicit dependencies);
wenzelm@5373
  1681
see HOL/ex/Antiquote for an example use;
wenzelm@5085
  1682
wenzelm@5127
  1683
* Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
wenzelm@5127
  1684
cterm -> thm;
wenzelm@5127
  1685
wenzelm@5207
  1686
* new tactical CHANGED_GOAL for checking that a tactic modifies a
wenzelm@5207
  1687
subgoal;
paulson@5142
  1688
wenzelm@5251
  1689
* Display.print_goals function moved to Locale.print_goals;
wenzelm@5251
  1690
wenzelm@5731
  1691
* standard print function for goals supports current_goals_markers
wenzelm@5731
  1692
variable for marking begin of proof, end of proof, start of goal; the
wenzelm@5731
  1693
default is ("", "", ""); setting current_goals_markers := ("<proof>",
wenzelm@5731
  1694
"</proof>", "<goal>") causes SGML like tagged proof state printing,
wenzelm@5731
  1695
for example;
wenzelm@5731
  1696
wenzelm@5002
  1697
wenzelm@5002
  1698
wenzelm@4410
  1699
New in Isabelle98 (January 1998)
wenzelm@4410
  1700
--------------------------------
wenzelm@4410
  1701
wenzelm@4410
  1702
*** Overview of INCOMPATIBILITIES (see below for more details) ***
wenzelm@4410
  1703
wenzelm@4410
  1704
* changed lexical syntax of terms / types: dots made part of long
wenzelm@4410
  1705
identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
wenzelm@4410
  1706
wenzelm@4410
  1707
* simpset (and claset) reference variable replaced by functions
wenzelm@4410
  1708
simpset / simpset_ref;
wenzelm@4410
  1709
wenzelm@4410
  1710
* no longer supports theory aliases (via merge) and non-trivial
wenzelm@4410
  1711
implicit merge of thms' signatures;
wenzelm@4410
  1712
wenzelm@4410
  1713
* most internal names of constants changed due to qualified names;
wenzelm@4410
  1714
wenzelm@4410
  1715
* changed Pure/Sequence interface (see Pure/seq.ML);
wenzelm@4410
  1716
wenzelm@3454
  1717
paulson@3715
  1718
*** General Changes ***
paulson@3715
  1719
wenzelm@4174
  1720
* hierachically structured name spaces (for consts, types, axms, thms
wenzelm@3943
  1721
etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
wenzelm@4108
  1722
old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
wenzelm@4108
  1723
isatool fixdots ensures space after dots (e.g. "%x. x"); set
wenzelm@4174
  1724
long_names for fully qualified output names; NOTE: ML programs
wenzelm@4174
  1725
(special tactics, packages etc.) referring to internal names may have
wenzelm@4174
  1726
to be adapted to cope with fully qualified names; in case of severe
wenzelm@4174
  1727
backward campatibility problems try setting 'global_names' at compile
wenzelm@4174
  1728
time to have enrything declared within a flat name space; one may also
wenzelm@4174
  1729
fine tune name declarations in theories via the 'global' and 'local'
wenzelm@4174
  1730
section;
wenzelm@4108
  1731
wenzelm@4108
  1732
* reimplemented the implicit simpset and claset using the new anytype
wenzelm@4108
  1733
data filed in signatures; references simpset:simpset ref etc. are
wenzelm@4108
  1734
replaced by functions simpset:unit->simpset and
wenzelm@4108
  1735
simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
wenzelm@4108
  1736
to patch your ML files accordingly;
paulson@3856
  1737
wenzelm@3857
  1738
* HTML output now includes theory graph data for display with Java
wenzelm@3857
  1739
applet or isatool browser; data generated automatically via isatool
wenzelm@3901
  1740
usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
wenzelm@3857
  1741
paulson@3856
  1742
* defs may now be conditional; improved rewrite_goals_tac to handle
paulson@3856
  1743
conditional equations;
paulson@3856
  1744
wenzelm@4174
  1745
* defs now admits additional type arguments, using TYPE('a) syntax;
wenzelm@4174
  1746
wenzelm@3901
  1747
* theory aliases via merge (e.g. M=A+B+C) no longer supported, always
wenzelm@3901
  1748
creates a new theory node; implicit merge of thms' signatures is
wenzelm@4112
  1749
restricted to 'trivial' ones; COMPATIBILITY: one may have to use
wenzelm@3901
  1750
transfer:theory->thm->thm in (rare) cases;
wenzelm@3901
  1751
wenzelm@3968
  1752
* improved handling of draft signatures / theories; draft thms (and
wenzelm@3968
  1753
ctyps, cterms) are automatically promoted to real ones;
wenzelm@3968
  1754
wenzelm@3901
  1755
* slightly changed interfaces for oracles: admit many per theory, named
wenzelm@3901
  1756
(e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
wenzelm@3901
  1757
wenzelm@3901
  1758
* print_goals: optional output of const types (set show_consts and
wenzelm@3901
  1759
show_types);
wenzelm@3851
  1760
wenzelm@4388
  1761
* improved output of warnings (###) and errors (***);
wenzelm@3697
  1762
paulson@4178
  1763
* subgoal_tac displays a warning if the new subgoal has type variables;
paulson@4178
  1764
paulson@3715
  1765
* removed old README and Makefiles;
wenzelm@3697
  1766
paulson@3856
  1767
* replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
wenzelm@3670
  1768
paulson@3715
  1769
* removed obsolete init_pps and init_database;
paulson@3715
  1770
paulson@3715
  1771
* deleted the obsolete tactical STATE, which was declared by
paulson@3715
  1772
    fun STATE tacfun st = tacfun st st;
paulson@3715
  1773
wenzelm@4388
  1774
* cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
wenzelm@4388
  1775
(which abbreviates $HOME);
wenzelm@4269
  1776
wenzelm@4269
  1777
* changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
wenzelm@4269
  1778
use isatool fixseq to adapt your ML programs (this works for fully
wenzelm@4269
  1779
qualified references to the Sequence structure only!);
wenzelm@4269
  1780
wenzelm@4381
  1781
* use_thy no longer requires writable current directory; it always
wenzelm@4381
  1782
reloads .ML *and* .thy file, if either one is out of date;
wenzelm@4269
  1783
paulson@3715
  1784
paulson@3715
  1785
*** Classical Reasoner ***
paulson@3715
  1786
wenzelm@3744
  1787
* Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
wenzelm@3744
  1788
tactics that use classical reasoning to simplify a subgoal without
wenzelm@3744
  1789
splitting it into several subgoals;
paulson@3715
  1790
paulson@3719
  1791
* Safe_tac: like safe_tac but uses the default claset;
paulson@3719
  1792
paulson@3715
  1793
paulson@3715
  1794
*** Simplifier ***
paulson@3715
  1795
paulson@3715
  1796
* added simplification meta rules:
paulson@3715
  1797
    (asm_)(full_)simplify: simpset -> thm -> thm;
paulson@3715
  1798
paulson@3715
  1799
* simplifier.ML no longer part of Pure -- has to be loaded by object
paulson@3715
  1800
logics (again);
paulson@3715
  1801
paulson@3715
  1802
* added prems argument to simplification procedures;
paulson@3715
  1803
paulson@4325
  1804
* HOL, FOL, ZF: added infix function `addsplits':
paulson@4325
  1805
  instead of `<simpset> setloop (split_tac <thms>)'
paulson@4325
  1806
  you can simply write `<simpset> addsplits <thms>'
paulson@4325
  1807
paulson@3715
  1808
paulson@3715
  1809
*** Syntax ***
paulson@3715
  1810
wenzelm@4174
  1811
* TYPE('a) syntax for type reflection terms;
wenzelm@4174
  1812
wenzelm@3985
  1813
* no longer handles consts with name "" -- declare as 'syntax' instead;
paulson@3856
  1814
paulson@3856
  1815
* pretty printer: changed order of mixfix annotation preference (again!);
wenzelm@3846
  1816
paulson@3715
  1817
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
paulson@3715
  1818
paulson@3715
  1819
paulson@3715
  1820
*** HOL ***
paulson@3715
  1821
wenzelm@5726
  1822
* HOL: there is a new splitter `split_asm_tac' that can be used e.g.
oheimb@4189
  1823
  with `addloop' of the simplifier to faciliate case splitting in premises.
oheimb@4189
  1824
nipkow@4035
  1825
* HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
wenzelm@3985
  1826
wenzelm@3985
  1827
* HOL/Auth: new protocol proofs including some for the Internet
nipkow@4035
  1828
  protocol TLS;
wenzelm@3985
  1829
wenzelm@4125
  1830
* HOL/Map: new theory of `maps' a la VDM;
nipkow@3982
  1831
wenzelm@4335
  1832
* HOL/simplifier: simplification procedures nat_cancel_sums for
wenzelm@4335
  1833
cancelling out common nat summands from =, <, <= (in)equalities, or
wenzelm@4335
  1834
differences; simplification procedures nat_cancel_factor for
wenzelm@4335
  1835
cancelling common factor from =, <, <= (in)equalities over natural
wenzelm@4373
  1836
sums; nat_cancel contains both kinds of procedures, it is installed by
wenzelm@4373
  1837
default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
wenzelm@4335
  1838
nipkow@3580
  1839
* HOL/simplifier: terms of the form
paulson@4325
  1840
  `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)'  (or t=x)
nipkow@3580
  1841
  are rewritten to
nipkow@4035
  1842
  `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
nipkow@4035
  1843
  and those of the form
paulson@4325
  1844
  `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)'  (or t=x)
nipkow@4035
  1845
  are rewritten to
nipkow@4035
  1846
  `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
nipkow@4035
  1847
nipkow@4035
  1848
* HOL/datatype
nipkow@4035
  1849
  Each datatype `t' now comes with a theorem `split_t_case' of the form
nipkow@3580
  1850
nipkow@4035
  1851
  P(t_case f1 ... fn x) =
nipkow@4035
  1852
     ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
nipkow@4035
  1853
        ...
oheimb@4189
  1854
       (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
nipkow@4035
  1855
     )
nipkow@4035
  1856
oheimb@4930
  1857
  and a theorem `split_t_case_asm' of the form
oheimb@4189
  1858
oheimb@4189
  1859
  P(t_case f1 ... fn x) =
oheimb@4189
  1860
    ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
oheimb@4189
  1861
        ...
oheimb@4189
  1862
       (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
oheimb@4189
  1863
     )
oheimb@4930
  1864
  which can be added to a simpset via `addsplits'. The existing theorems
oheimb@4930
  1865
  expand_list_case and expand_option_case have been renamed to
oheimb@4930
  1866
  split_list_case and split_option_case.
oheimb@4189
  1867
nipkow@4361
  1868
* HOL/Arithmetic:
nipkow@4361
  1869
  - `pred n' is automatically converted to `n-1'.
nipkow@4361
  1870
    Users are strongly encouraged not to use `pred' any longer,
nipkow@4361
  1871
    because it will disappear altogether at some point.
nipkow@4361
  1872
  - Users are strongly encouraged to write "0 < n" rather than
nipkow@4361
  1873
    "n ~= 0". Theorems and proof tools have been modified towards this
nipkow@4361
  1874
    `standard'.
nipkow@4357
  1875
nipkow@4502
  1876
* HOL/Lists:
nipkow@4502
  1877
  the function "set_of_list" has been renamed "set" (and its theorems too);
nipkow@4502
  1878
  the function "nth" now takes its arguments in the reverse order and
nipkow@4502
  1879
  has acquired the infix notation "!" as in "xs!n".
paulson@3570
  1880
paulson@4154
  1881
* HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
paulson@4154
  1882
paulson@4154
  1883
* HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
paulson@4154
  1884
  specialist theorems (like UN1_I) are gone.  Similarly for (INT x.B x);
paulson@4154
  1885
wenzelm@4575
  1886
* HOL/record: extensible records with schematic structural subtyping
wenzelm@4575
  1887
(single inheritance); EXPERIMENTAL version demonstrating the encoding,
wenzelm@4575
  1888
still lacks various theorems and concrete record syntax;
wenzelm@4575
  1889
wenzelm@4125
  1890
paulson@3715
  1891
*** HOLCF ***
wenzelm@3535
  1892
wenzelm@4125
  1893
* removed "axioms" and "generated by" sections;
wenzelm@4125
  1894
oheimb@4123
  1895
* replaced "ops" section by extended "consts" section, which is capable of
wenzelm@4125
  1896
  handling the continuous function space "->" directly;
wenzelm@4125
  1897
wenzelm@4125
  1898
* domain package:
wenzelm@4125
  1899
  . proves theorems immediately and stores them in the theory,
wenzelm@4125
  1900
  . creates hierachical name space,
wenzelm@4125
  1901
  . now uses normal mixfix annotations (instead of cinfix...),
wenzelm@4125
  1902
  . minor changes to some names and values (for consistency),
wenzelm@4125
  1903
  . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
wenzelm@4125
  1904
  . separator between mutual domain defs: changed "," to "and",
wenzelm@4125
  1905
  . improved handling of sort constraints;  now they have to
wenzelm@4125
  1906
    appear on the left-hand side of the equations only;
oheimb@4123
  1907
oheimb@4123
  1908
* fixed LAM <x,y,zs>.b syntax;
wenzelm@3567
  1909
wenzelm@3744
  1910
* added extended adm_tac to simplifier in HOLCF -- can now discharge
wenzelm@3744
  1911
adm (%x. P (t x)), where P is chainfinite and t continuous;
wenzelm@3579
  1912
wenzelm@3579
  1913
paulson@3719
  1914
*** FOL and ZF ***
paulson@3719
  1915
wenzelm@5726
  1916
* FOL: there is a new splitter `split_asm_tac' that can be used e.g.
oheimb@4189
  1917
  with `addloop' of the simplifier to faciliate case splitting in premises.
oheimb@4189
  1918
wenzelm@3744
  1919
* qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
wenzelm@3744
  1920
in HOL, they strip ALL and --> from proved theorems;
wenzelm@3744
  1921
paulson@3719
  1922
wenzelm@3579
  1923
wenzelm@3006
  1924
New in Isabelle94-8 (May 1997)
wenzelm@3006
  1925
------------------------------
wenzelm@2654
  1926
paulson@3002
  1927
*** General Changes ***
paulson@3002
  1928
paulson@3002
  1929
* new utilities to build / run / maintain Isabelle etc. (in parts
paulson@3002
  1930
still somewhat experimental); old Makefiles etc. still functional;
wenzelm@2971
  1931
wenzelm@3205
  1932
* new 'Isabelle System Manual';
wenzelm@3205
  1933
wenzelm@2825
  1934
* INSTALL text, together with ./configure and ./build scripts;
wenzelm@2773
  1935
wenzelm@3006
  1936
* reimplemented type inference for greater efficiency, better error
wenzelm@3006
  1937
messages and clean internal interface;
paulson@3002
  1938
paulson@3002
  1939
* prlim command for dealing with lots of subgoals (an easier way of
paulson@3002
  1940
setting goals_limit);
paulson@3002
  1941
wenzelm@3006
  1942
wenzelm@3006
  1943
*** Syntax ***
paulson@3002
  1944
wenzelm@3116
  1945
* supports alternative (named) syntax tables (parser and pretty
wenzelm@3116
  1946
printer); internal interface is provided by add_modesyntax(_i);
wenzelm@3116
  1947
paulson@3002
  1948
* Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
paulson@3002
  1949
be used in conjunction with the Isabelle symbol font; uses the
paulson@3002
  1950
"symbols" syntax table;
paulson@3002
  1951
wenzelm@2705
  1952
* added token_translation interface (may translate name tokens in
wenzelm@2756
  1953
arbitrary ways, dependent on their type (free, bound, tfree, ...) and
wenzelm@3116
  1954
the current print_mode); IMPORTANT: user print translation functions
wenzelm@3116
  1955
are responsible for marking newly introduced bounds
wenzelm@3116
  1956
(Syntax.mark_boundT);
wenzelm@2705
  1957
wenzelm@2730
  1958
* token translations for modes "xterm" and "xterm_color" that display
wenzelm@3006
  1959
names in bold, underline etc. or colors (which requires a color
wenzelm@3006
  1960
version of xterm);
wenzelm@2730
  1961
paulson@3002
  1962
* infixes may now be declared with names independent of their syntax;
paulson@3002
  1963
paulson@3002
  1964
* added typed_print_translation (like print_translation, but may
paulson@3002
  1965
access type of constant);
paulson@3002
  1966
wenzelm@3006
  1967
paulson@3002
  1968
*** Classical Reasoner ***
paulson@3002
  1969
paulson@3002
  1970
Blast_tac: a new tactic!  It is often more powerful than fast_tac, but has
paulson@3002
  1971
some limitations.  Blast_tac...
paulson@3002
  1972
  + ignores addss, addbefore, addafter; this restriction is intrinsic
paulson@3002
  1973
  + ignores elimination rules that don't have the correct format
wenzelm@5726
  1974
        (the conclusion MUST be a formula variable)
paulson@3002
  1975
  + ignores types, which can make HOL proofs fail
paulson@3002
  1976
  + rules must not require higher-order unification, e.g. apply_type in ZF
paulson@3002
  1977
    [message "Function Var's argument not a bound variable" relates to this]
paulson@3002
  1978
  + its proof strategy is more general but can actually be slower
paulson@3002
  1979
wenzelm@3107
  1980
* substitution with equality assumptions no longer permutes other
wenzelm@3107
  1981
assumptions;
paulson@3002
  1982
paulson@3002
  1983
* minor changes in semantics of addafter (now called addaltern); renamed
paulson@3002
  1984
setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
wenzelm@3107
  1985
(and access functions for it);
paulson@3002
  1986
wenzelm@5726
  1987
* improved combination of classical reasoner and simplifier:
oheimb@3317
  1988
  + functions for handling clasimpsets
oheimb@3317
  1989
  + improvement of addss: now the simplifier is called _after_ the
oheimb@3317
  1990
    safe steps.
oheimb@3317
  1991
  + safe variant of addss called addSss: uses safe simplifications
wenzelm@5726
  1992
    _during_ the safe steps. It is more complete as it allows multiple
oheimb@3317
  1993
    instantiations of unknowns (e.g. with slow_tac).
wenzelm@3006
  1994
paulson@3002
  1995
*** Simplifier ***
paulson@3002
  1996
wenzelm@3006
  1997
* added interface for simplification procedures (functions that
wenzelm@3006
  1998
produce *proven* rewrite rules on the fly, depending on current
wenzelm@3006
  1999
redex);
wenzelm@3006
  2000
wenzelm@3006
  2001
* ordering on terms as parameter (used for ordered rewriting);
wenzelm@3006
  2002
wenzelm@3107
  2003
* new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
paulson@3002
  2004
paulson@3002
  2005
* the solver is now split into a safe and an unsafe part.
paulson@3002
  2006
This should be invisible for the normal user, except that the
paulson@3002
  2007
functions setsolver and addsolver have been renamed to setSolver and
wenzelm@3107
  2008
addSolver; added safe_asm_full_simp_tac;
paulson@3002
  2009
paulson@3002
  2010
paulson@3002
  2011
*** HOL ***
paulson@3002
  2012
nipkow@3042
  2013
* a generic induction tactic `induct_tac' which works for all datatypes and
wenzelm@3107
  2014
also for type `nat';
nipkow@3042
  2015
nipkow@3316
  2016
* a generic case distinction tactic `exhaust_tac' which works for all
nipkow@3316
  2017
datatypes and also for type `nat';
nipkow@3316
  2018
nipkow@3316
  2019
* each datatype comes with a function `size';
nipkow@3316
  2020
paulson@3002
  2021
* patterns in case expressions allow tuple patterns as arguments to
wenzelm@3107
  2022
constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
paulson@3002
  2023
paulson@3002
  2024
* primrec now also works with type nat;
paulson@3002
  2025
paulson@3338
  2026
* recdef: a new declaration form, allows general recursive functions to be
paulson@3338
  2027
defined in theory files.  See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
paulson@3338
  2028
paulson@3002
  2029
* the constant for negation has been renamed from "not" to "Not" to
wenzelm@3107
  2030
harmonize with FOL, ZF, LK, etc.;
paulson@3002
  2031
wenzelm@3107
  2032
* HOL/ex/LFilter theory of a corecursive "filter" functional for
wenzelm@3107
  2033
infinite lists;
paulson@3002
  2034
wenzelm@3227
  2035
* HOL/Modelcheck demonstrates invocation of model checker oracle;
wenzelm@3227
  2036
paulson@3002
  2037
* HOL/ex/Ring.thy declares cring_simp, which solves equational
paulson@3002
  2038
problems in commutative rings, using axiomatic type classes for + and *;
paulson@3002
  2039
paulson@3002
  2040
* more examples in HOL/MiniML and HOL/Auth;
paulson@3002
  2041
paulson@3002
  2042
* more default rewrite rules for quantifiers, union/intersection;
paulson@3002
  2043
nipkow@3321
  2044
* a new constant `arbitrary == @x.False';
nipkow@3321
  2045
wenzelm@3107
  2046
* HOLCF/IOA replaces old HOL/IOA;
wenzelm@3107
  2047
wenzelm@5726
  2048
* HOLCF changes: derived all rules and arities
wenzelm@5726
  2049
  + axiomatic type classes instead of classes
slotosch@2653
  2050
  + typedef instead of faking type definitions
paulson@2747
  2051
  + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
wenzelm@2730
  2052
  + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
slotosch@2653
  2053
  + eliminated the types void, one, tr
slotosch@2653
  2054
  + use unit lift and bool lift (with translations) instead of one and tr
slotosch@2653
  2055
  + eliminated blift from Lift3.thy (use Def instead of blift)
wenzelm@3107
  2056
  all eliminated rules are derived as theorems --> no visible changes ;
oheimb@2649
  2057
wenzelm@3006
  2058
paulson@3002
  2059
*** ZF ***
wenzelm@2553
  2060
paulson@2865
  2061
* ZF now has Fast_tac, Simp_tac and Auto_tac.  Union_iff is a now a default
paulson@2865
  2062
rewrite rule; this may affect some proofs.  eq_cs is gone but can be put back
paulson@2865
  2063
as ZF_cs addSIs [equalityI];
wenzelm@2553
  2064
wenzelm@2554
  2065
wenzelm@2732
  2066
wenzelm@2553
  2067
New in Isabelle94-7 (November 96)
wenzelm@2553
  2068
---------------------------------
wenzelm@2553
  2069
wenzelm@2553
  2070
* allowing negative levels (as offsets) in prlev and choplev;
wenzelm@2553
  2071
wenzelm@2554
  2072
* super-linear speedup for large simplifications;
wenzelm@2554
  2073
wenzelm@2554
  2074
* FOL, ZF and HOL now use miniscoping: rewriting pushes
wenzelm@2554
  2075
quantifications in as far as possible (COULD MAKE EXISTING PROOFS
wenzelm@2554
  2076
FAIL); can suppress it using the command Delsimps (ex_simps @
wenzelm@2554
  2077
all_simps); De Morgan laws are also now included, by default;
wenzelm@2554
  2078
wenzelm@2554
  2079
* improved printing of ==>  :  ~:
wenzelm@2554
  2080
wenzelm@2554
  2081
* new object-logic "Sequents" adds linear logic, while replacing LK
wenzelm@2554
  2082
and Modal (thanks to Sara Kalvala);
wenzelm@2554
  2083
wenzelm@2554
  2084
* HOL/Auth: correctness proofs for authentication protocols;
wenzelm@2554
  2085
wenzelm@2554
  2086
* HOL: new auto_tac combines rewriting and classical reasoning (many
wenzelm@2554
  2087
examples on HOL/Auth);
wenzelm@2554
  2088
wenzelm@2554
  2089
* HOL: new command AddIffs for declaring theorems of the form P=Q to
wenzelm@2554
  2090
the rewriter and classical reasoner simultaneously;
wenzelm@2554
  2091
wenzelm@2554
  2092
* function uresult no longer returns theorems in "standard" format;
wenzelm@2554
  2093
regain previous version by: val uresult = standard o uresult;
wenzelm@2554
  2094
wenzelm@2554
  2095
wenzelm@2554
  2096
wenzelm@2554
  2097
New in Isabelle94-6
wenzelm@2554
  2098
-------------------
wenzelm@2554
  2099
wenzelm@2554
  2100
* oracles -- these establish an interface between Isabelle and trusted
wenzelm@2554
  2101
external reasoners, which may deliver results as theorems;
wenzelm@2554
  2102
wenzelm@2554
  2103
* proof objects (in particular record all uses of oracles);
wenzelm@2554
  2104
wenzelm@2554
  2105
* Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
wenzelm@2554
  2106
wenzelm@2554
  2107
* "constdefs" section in theory files;
wenzelm@2554
  2108
wenzelm@2554
  2109
* "primrec" section (HOL) no longer requires names;
wenzelm@2554
  2110
wenzelm@2554
  2111
* internal type "tactic" now simply "thm -> thm Sequence.seq";
wenzelm@2554
  2112
wenzelm@2554
  2113
wenzelm@2554
  2114
wenzelm@2554
  2115
New in Isabelle94-5
wenzelm@2554
  2116
-------------------
wenzelm@2554
  2117
wenzelm@2554
  2118
* reduced space requirements;
wenzelm@2554
  2119
wenzelm@2554
  2120
* automatic HTML generation from theories;
wenzelm@2554
  2121
wenzelm@2554
  2122
* theory files no longer require "..." (quotes) around most types;
wenzelm@2554
  2123
wenzelm@2554
  2124
* new examples, including two proofs of the Church-Rosser theorem;
wenzelm@2554
  2125
wenzelm@2554
  2126
* non-curried (1994) version of HOL is no longer distributed;
wenzelm@2554
  2127
wenzelm@2553
  2128
paulson@2557
  2129
paulson@2557
  2130
New in Isabelle94-4
paulson@2557
  2131
-------------------
paulson@2557
  2132
paulson@2747
  2133
* greatly reduced space requirements;
paulson@2557
  2134
paulson@2557
  2135
* theory files (.thy) no longer require \...\ escapes at line breaks;
paulson@2557
  2136
wenzelm@5726
  2137
* searchable theorem database (see the section "Retrieving theorems" on
paulson@2557
  2138
page 8 of the Reference Manual);
paulson@2557
  2139
paulson@2557
  2140
* new examples, including Grabczewski's monumental case study of the
paulson@2557
  2141
Axiom of Choice;
paulson@2557
  2142
paulson@2557
  2143
* The previous version of HOL renamed to Old_HOL;
paulson@2557
  2144
wenzelm@5726
  2145
* The new version of HOL (previously called CHOL) uses a curried syntax
paulson@2557
  2146
for functions.  Application looks like f a b instead of f(a,b);
paulson@2557
  2147
paulson@2557
  2148
* Mutually recursive inductive definitions finally work in HOL;
paulson@2557
  2149
paulson@2557
  2150
* In ZF, pattern-matching on tuples is now available in all abstractions and
paulson@2557
  2151
translates to the operator "split";
paulson@2557
  2152
paulson@2557
  2153
paulson@2557
  2154
paulson@2557
  2155
New in Isabelle94-3
paulson@2557
  2156
-------------------
paulson@2557
  2157
wenzelm@5726
  2158
* new infix operator, addss, allowing the classical reasoner to
paulson@2557
  2159
perform simplification at each step of its search.  Example:
wenzelm@5726
  2160
        fast_tac (cs addss ss)
paulson@2557
  2161
wenzelm@5726
  2162
* a new logic, CHOL, the same as HOL, but with a curried syntax
wenzelm@5726
  2163
for functions.  Application looks like f a b instead of f(a,b).  Also pairs
paulson@2557
  2164
look like (a,b) instead of <a,b>;
paulson@2557
  2165
paulson@2557
  2166
* PLEASE NOTE: CHOL will eventually replace HOL!
paulson@2557
  2167
paulson@2557
  2168
* In CHOL, pattern-matching on tuples is now available in all abstractions.
paulson@2557
  2169
It translates to the operator "split".  A new theory of integers is available;
paulson@2557
  2170
paulson@2557
  2171
* In ZF, integer numerals now denote two's-complement binary integers.
paulson@2557
  2172
Arithmetic operations can be performed by rewriting.  See ZF/ex/Bin.ML;
paulson@2557
  2173
wenzelm@5726
  2174
* Many new examples: I/O automata, Church-Rosser theorem, equivalents
paulson@2557
  2175
of the Axiom of Choice;
paulson@2557
  2176
paulson@2557
  2177
paulson@2557
  2178
paulson@2557
  2179
New in Isabelle94-2
paulson@2557
  2180
-------------------
paulson@2557
  2181
wenzelm@5726
  2182
* Significantly faster resolution;
paulson@2557
  2183
paulson@2557
  2184
* the different sections in a .thy file can now be mixed and repeated
paulson@2557
  2185
freely;
paulson@2557
  2186
paulson@2557
  2187
* Database of theorems for FOL, HOL and ZF.  New
paulson@2557
  2188
commands including qed, qed_goal and bind_thm store theorems in the database.
paulson@2557
  2189
paulson@2557
  2190
* Simple database queries: return a named theorem (get_thm) or all theorems of
paulson@2557
  2191
a given theory (thms_of), or find out what theory a theorem was proved in
paulson@2557
  2192
(theory_of_thm);
paulson@2557
  2193
paulson@2557
  2194
* Bugs fixed in the inductive definition and datatype packages;
paulson@2557
  2195
paulson@2557
  2196
* The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
paulson@2557
  2197
and HOL_dup_cs obsolete;
paulson@2557
  2198
paulson@2557
  2199
* Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
paulson@2557
  2200
have been removed;
paulson@2557
  2201
paulson@2557
  2202
* Simpler definition of function space in ZF;
paulson@2557
  2203
paulson@2557
  2204
* new results about cardinal and ordinal arithmetic in ZF;
paulson@2557
  2205
paulson@2557
  2206
* 'subtype' facility in HOL for introducing new types as subsets of existing
paulson@2557
  2207
types;
paulson@2557
  2208
paulson@2557
  2209
wenzelm@2553
  2210
$Id$