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