NEWS
author nipkow
Fri Jan 13 14:43:09 2006 +0100 (2006-01-13)
changeset 18674 98d380757893
parent 18644 b59766bc66c9
child 18686 cbbc71acf994
permissions -rw-r--r--
*** empty log message ***
wenzelm@5363
     1
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     2
==============================================
wenzelm@2553
     3
wenzelm@17754
     4
New in this Isabelle release
wenzelm@17754
     5
----------------------------
wenzelm@17754
     6
wenzelm@17754
     7
*** General ***
wenzelm@17754
     8
wenzelm@17918
     9
* Theory syntax: the header format ``theory A = B + C:'' has been
wenzelm@17918
    10
discontinued in favour of ``theory A imports B C begin''.  Use isatool
wenzelm@17918
    11
fixheaders to convert existing theory files.  INCOMPATIBILITY.
wenzelm@17918
    12
wenzelm@17918
    13
* Theory syntax: the old non-Isar theory file format has been
wenzelm@17918
    14
discontinued altogether.  Note that ML proof scripts may still be used
wenzelm@17918
    15
with Isar theories; migration is usually quite simple with the ML
wenzelm@17918
    16
function use_legacy_bindings.  INCOMPATIBILITY.
wenzelm@17918
    17
wenzelm@17981
    18
* Legacy goal package: reduced interface to the bare minimum required
wenzelm@17981
    19
to keep existing proof scripts running.  Most other user-level
wenzelm@17981
    20
functions are now part of the OldGoals structure, which is *not* open
wenzelm@17981
    21
by default (consider isatool expandshort before open OldGoals).
wenzelm@17981
    22
Removed top_sg, prin, printyp, pprint_term/typ altogether, because
wenzelm@17981
    23
these tend to cause confusion about the actual goal (!) context being
wenzelm@17981
    24
used here, which is not necessarily the same as the_context().
wenzelm@17918
    25
wenzelm@17754
    26
* Command 'find_theorems': support "*" wildcard in "name:" criterion.
wenzelm@17754
    27
wenzelm@17754
    28
wenzelm@17865
    29
*** Document preparation ***
wenzelm@17865
    30
wenzelm@17869
    31
* Added antiquotations @{ML_type text} and @{ML_struct text} which
wenzelm@17869
    32
check the given source text as ML type/structure, printing verbatim.
wenzelm@17865
    33
wenzelm@17865
    34
wenzelm@17779
    35
*** Pure ***
wenzelm@17779
    36
wenzelm@17865
    37
* Isar: improper proof element 'guess' is like 'obtain', but derives
wenzelm@17865
    38
the obtained context from the course of reasoning!  For example:
wenzelm@17865
    39
wenzelm@17865
    40
  assume "EX x y. A x & B y"   -- "any previous fact"
wenzelm@17865
    41
  then guess x and y by clarify
wenzelm@17865
    42
wenzelm@17865
    43
This technique is potentially adventurous, depending on the facts and
wenzelm@17865
    44
proof tools being involved here.
wenzelm@17865
    45
wenzelm@18020
    46
* Isar: known facts from the proof context may be specified as literal
wenzelm@18020
    47
propositions, using ASCII back-quote syntax.  This works wherever
wenzelm@18020
    48
named facts used to be allowed so far, in proof commands, proof
wenzelm@18020
    49
methods, attributes etc.  Literal facts are retrieved from the context
wenzelm@18020
    50
according to unification of type and term parameters.  For example,
wenzelm@18020
    51
provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
wenzelm@18020
    52
theorems in the current context, then these are valid literal facts:
wenzelm@18020
    53
`A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
wenzelm@18020
    54
wenzelm@18020
    55
There is also a proof method "fact" which does the same composition
wenzelm@18044
    56
for explicit goal states, e.g. the following proof texts coincide with
wenzelm@18044
    57
certain special cases of literal facts:
wenzelm@18020
    58
wenzelm@18020
    59
  have "A" by fact                 ==  note `A`
wenzelm@18020
    60
  have "A ==> B" by fact           ==  note `A ==> B`
wenzelm@18020
    61
  have "!!x. P x ==> Q x" by fact  ==  note `!!x. P x ==> Q x`
wenzelm@18020
    62
  have "P a ==> Q a" by fact       ==  note `P a ==> Q a`
wenzelm@18020
    63
wenzelm@18308
    64
* Isar: 'def' now admits simultaneous definitions, e.g.:
wenzelm@18308
    65
wenzelm@18308
    66
  def x == "t" and y == "u"
wenzelm@18308
    67
wenzelm@18540
    68
* Isar: added command 'unfolding', which is structurally similar to
wenzelm@18540
    69
'using', but affects both the goal state and facts by unfolding given
wenzelm@18540
    70
meta-level equations.  Thus many occurrences of the 'unfold' method or
wenzelm@18540
    71
'unfolded' attribute may be replaced by first-class proof text.
wenzelm@18540
    72
wenzelm@18233
    73
* Provers/induct: improved internal context management to support
wenzelm@18233
    74
local fixes and defines on-the-fly.  Thus explicit meta-level
wenzelm@18233
    75
connectives !! and ==> are rarely required anymore in inductive goals
wenzelm@18233
    76
(using object-logic connectives for this purpose has been long
wenzelm@18233
    77
obsolete anyway).  The subsequent proof patterns illustrate advanced
wenzelm@18233
    78
techniques of natural induction; general datatypes and inductive sets
wenzelm@18267
    79
work analogously (see also src/HOL/Lambda for realistic examples).
wenzelm@18267
    80
wenzelm@18267
    81
(1) This is how to ``strengthen'' an inductive goal wrt. certain
wenzelm@18239
    82
parameters:
wenzelm@18233
    83
wenzelm@18233
    84
  lemma
wenzelm@18233
    85
    fixes n :: nat and x :: 'a
wenzelm@18233
    86
    assumes a: "A n x"
wenzelm@18233
    87
    shows "P n x"
wenzelm@18233
    88
    using a                     -- {* make induct insert fact a *}
wenzelm@18233
    89
  proof (induct n fixing: x)    -- {* generalize goal to "!!x. A n x ==> P n x" *}
wenzelm@18248
    90
    case 0
wenzelm@18233
    91
    show ?case sorry
wenzelm@18233
    92
  next
wenzelm@18248
    93
    case (Suc n)
wenzelm@18239
    94
    note `!!x. A n x ==> P n x` -- {* induction hypothesis, according to induction rule *}
wenzelm@18239
    95
    note `A (Suc n) x`          -- {* induction premise, stemming from fact a *}
wenzelm@18233
    96
    show ?case sorry
wenzelm@18233
    97
  qed
wenzelm@18233
    98
wenzelm@18267
    99
(2) This is how to perform induction over ``expressions of a certain
wenzelm@18233
   100
form'', using a locally defined inductive parameter n == "a x"
wenzelm@18239
   101
together with strengthening (the latter is usually required to get
wenzelm@18267
   102
sufficiently flexible induction hypotheses):
wenzelm@18233
   103
wenzelm@18233
   104
  lemma
wenzelm@18233
   105
    fixes a :: "'a => nat"
wenzelm@18233
   106
    assumes a: "A (a x)"
wenzelm@18233
   107
    shows "P (a x)"
wenzelm@18233
   108
    using a
wenzelm@18233
   109
  proof (induct n == "a x" fixing: x)
wenzelm@18233
   110
    ...
wenzelm@18233
   111
wenzelm@18267
   112
See also HOL/Isar_examples/Puzzle.thy for an application of the this
wenzelm@18267
   113
particular technique.
wenzelm@18267
   114
wenzelm@18267
   115
(3) This is how to perform existential reasoning ('obtain') by
wenzelm@18267
   116
induction, while avoiding explicit object-logic encodings:
wenzelm@18267
   117
wenzelm@18267
   118
  fix n :: nat
wenzelm@18267
   119
  obtain x :: 'a where "P n x" and "Q n x"
wenzelm@18267
   120
  proof (induct n fixing: thesis)
wenzelm@18267
   121
    case 0
wenzelm@18267
   122
    obtain x where "P 0 x" and "Q 0 x" sorry
wenzelm@18399
   123
    then show thesis by (rule 0)
wenzelm@18267
   124
  next
wenzelm@18267
   125
    case (Suc n)
wenzelm@18267
   126
    obtain x where "P n x" and "Q n x" by (rule Suc.hyps)
wenzelm@18267
   127
    obtain x where "P (Suc n) x" and "Q (Suc n) x" sorry
wenzelm@18267
   128
    then show thesis by (rule Suc.prems)
wenzelm@18267
   129
  qed
wenzelm@18267
   130
wenzelm@18267
   131
Here the 'fixing: thesis' specification essentially modifies the scope
wenzelm@18267
   132
of the formal thesis parameter, in order to the get the whole
wenzelm@18267
   133
existence statement through the induction as expected.
wenzelm@18233
   134
wenzelm@18506
   135
* Provers/induct: mutual induction rules are now specified as a list
wenzelm@18506
   136
of rule sharing the same induction cases.  HOL packages usually
wenzelm@18506
   137
provide foo_bar.inducts for mutually defined items foo and bar
wenzelm@18506
   138
(e.g. inductive sets or datatypes).  INCOMPATIBILITY, users need to
wenzelm@18506
   139
specify mutual induction rules differently, i.e. like this:
wenzelm@18506
   140
wenzelm@18506
   141
  (induct rule: foo_bar.inducts)
wenzelm@18506
   142
  (induct set: foo bar)
wenzelm@18506
   143
  (induct type: foo bar)
wenzelm@18506
   144
wenzelm@18506
   145
The ML function ProjectRule.projections turns old-style rules into the
wenzelm@18506
   146
new format.
wenzelm@18506
   147
wenzelm@18506
   148
* Provers/induct: improved handling of simultaneous goals.  Instead of
wenzelm@18506
   149
introducing object-level conjunction, the statement is now split into
wenzelm@18506
   150
several conclusions, while the corresponding symbolic cases are
wenzelm@18601
   151
nested accordingly.  INCOMPATIBILITY, proofs need to be structured
wenzelm@18601
   152
explicitly.  For example:
wenzelm@18480
   153
wenzelm@18480
   154
  lemma
wenzelm@18480
   155
    fixes n :: nat
wenzelm@18480
   156
    shows "P n" and "Q n"
wenzelm@18480
   157
  proof (induct n)
wenzelm@18601
   158
    case 0 case 1
wenzelm@18480
   159
    show "P 0" sorry
wenzelm@18480
   160
  next
wenzelm@18601
   161
    case 0 case 2
wenzelm@18480
   162
    show "Q 0" sorry
wenzelm@18480
   163
  next
wenzelm@18601
   164
    case (Suc n) case 1
wenzelm@18480
   165
    note `P n` and `Q n`
wenzelm@18480
   166
    show "P (Suc n)" sorry
wenzelm@18480
   167
  next
wenzelm@18601
   168
    case (Suc n) case 2
wenzelm@18480
   169
    note `P n` and `Q n`
wenzelm@18480
   170
    show "Q (Suc n)" sorry
wenzelm@18480
   171
  qed
wenzelm@18480
   172
wenzelm@18601
   173
The split into subcases may be deferred as follows -- this is
wenzelm@18601
   174
particularly relevant for goal statements with local premises.
wenzelm@18601
   175
wenzelm@18601
   176
  lemma
wenzelm@18601
   177
    fixes n :: nat
wenzelm@18601
   178
    shows "A n ==> P n" and "B n ==> Q n"
wenzelm@18601
   179
  proof (induct n)
wenzelm@18601
   180
    case 0
wenzelm@18601
   181
    {
wenzelm@18601
   182
      case 1
wenzelm@18601
   183
      note `A 0`
wenzelm@18601
   184
      show "P 0" sorry
wenzelm@18601
   185
    next
wenzelm@18601
   186
      case 2
wenzelm@18601
   187
      note `B 0`
wenzelm@18601
   188
      show "Q 0" sorry
wenzelm@18601
   189
    }
wenzelm@18601
   190
  next
wenzelm@18601
   191
    case (Suc n)
wenzelm@18601
   192
    note `A n ==> P n` and `B n ==> Q n`
wenzelm@18601
   193
    {
wenzelm@18601
   194
      case 1
wenzelm@18601
   195
      note `A (Suc n)`
wenzelm@18601
   196
      show "P (Suc n)" sorry
wenzelm@18601
   197
    next
wenzelm@18601
   198
      case 2
wenzelm@18601
   199
      note `B (Suc n)`
wenzelm@18601
   200
      show "Q (Suc n)" sorry
wenzelm@18601
   201
    }
wenzelm@18601
   202
  qed
wenzelm@18601
   203
wenzelm@18506
   204
If simultaneous goals are to be used with mutual rules, the statement
wenzelm@18506
   205
needs to be structured carefully as a two-level conjunction, using
wenzelm@18506
   206
lists of propositions separated by 'and':
wenzelm@18506
   207
wenzelm@18507
   208
  lemma
wenzelm@18507
   209
    shows "a : A ==> P1 a"
wenzelm@18507
   210
          "a : A ==> P2 a"
wenzelm@18507
   211
      and "b : B ==> Q1 b"
wenzelm@18507
   212
          "b : B ==> Q2 b"
wenzelm@18507
   213
          "b : B ==> Q3 b"
wenzelm@18507
   214
  proof (induct set: A B)
wenzelm@18480
   215
wenzelm@18399
   216
* Provers/induct: support coinduction as well.  See
wenzelm@18399
   217
src/HOL/Library/Coinductive_List.thy for various examples.
wenzelm@18399
   218
nipkow@18674
   219
* Simplifier: by default the simplifier trace only shows top level rewrites
nipkow@18674
   220
now. That is, trace_simp_depth_limit is set to 1 by default. Thus there is
nipkow@18674
   221
less danger of being flooded by the trace. The trace indicates where parts
nipkow@18674
   222
have been suppressed.
nipkow@18674
   223
  
wenzelm@18536
   224
* Provers/classical: removed obsolete classical version of elim_format
wenzelm@18536
   225
attribute; classical elim/dest rules are now treated uniformly when
wenzelm@18536
   226
manipulating the claset.
wenzelm@18536
   227
paulson@18557
   228
* Provers/classical: stricter checks to ensure that supplied intro, dest and 
paulson@18557
   229
elim rules are well-formed; dest and elim rules must have at least one premise.
paulson@18557
   230
wenzelm@18536
   231
* Syntax: input syntax now supports dummy variable binding "%_. b",
wenzelm@18536
   232
where the body does not mention the bound variable.  Note that dummy
wenzelm@18536
   233
patterns implicitly depend on their context of bounds, which makes
wenzelm@18536
   234
"{_. _}" match any set comprehension as expected.  Potential
wenzelm@18536
   235
INCOMPATIBILITY -- parse translations need to cope with syntactic
wenzelm@18536
   236
constant "_idtdummy" in the binding position.
wenzelm@18536
   237
wenzelm@18536
   238
* Syntax: removed obsolete syntactic constant "_K" and its associated
wenzelm@18536
   239
parse translation.  INCOMPATIBILITY -- use dummy abstraction instead,
wenzelm@18536
   240
for example "A -> B" => "Pi A (%_. B)".
wenzelm@17779
   241
wenzelm@17865
   242
nipkow@17806
   243
*** HOL ***
nipkow@17806
   244
wenzelm@17996
   245
* Alternative iff syntax "A <-> B" for equality on bool (with priority
wenzelm@17996
   246
25 like -->); output depends on the "iff" print_mode, the default is
wenzelm@17996
   247
"A = B" (with priority 50).
wenzelm@17996
   248
nipkow@18674
   249
* "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
nipkow@18674
   250
wenzelm@17865
   251
* In the context of the assumption "~(s = t)" the Simplifier rewrites
wenzelm@17865
   252
"t = s" to False (by simproc "neq_simproc").  For backward
wenzelm@17865
   253
compatibility this can be disabled by ML "reset use_neq_simproc".
wenzelm@17779
   254
webertj@17809
   255
* Tactics 'sat' and 'satx' reimplemented, several improvements: goals
webertj@17809
   256
no longer need to be stated as "<prems> ==> False", equivalences (i.e.
wenzelm@17865
   257
"=" on type bool) are handled, variable names of the form "lit_<n>"
wenzelm@17865
   258
are no longer reserved, significant speedup.
wenzelm@17865
   259
wenzelm@18480
   260
* inductive and datatype: provide projections of mutual rules, bundled
wenzelm@18480
   261
as foo_bar.inducts;
wenzelm@18480
   262
wenzelm@18446
   263
* Library: added theory Coinductive_List of potentially infinite lists
wenzelm@18446
   264
as greatest fixed-point.
wenzelm@18399
   265
webertj@17809
   266
wenzelm@17878
   267
*** ML ***
wenzelm@17878
   268
haftmann@18450
   269
* Pure/library:
haftmann@18450
   270
haftmann@18450
   271
  val burrow: ('a list -> 'b list) -> 'a list list -> 'b list list
haftmann@18549
   272
  val fold_burrow: ('a list -> 'c -> 'b list * 'd) -> 'a list list -> 'c -> 'b list list * 'd
haftmann@18450
   273
wenzelm@18540
   274
The semantics of "burrow" is: "take a function with *simulatanously*
wenzelm@18540
   275
transforms a list of value, and apply it *simulatanously* to a list of
wenzelm@18540
   276
list of values of the appropriate type". Confer this with "map" which
wenzelm@18540
   277
would *not* apply its argument function simulatanously but in
haftmann@18549
   278
sequence. "fold_burrow" has an additional context.
wenzelm@18540
   279
wenzelm@18540
   280
Both actually avoid the usage of "unflat" since they hide away
wenzelm@18540
   281
"unflat" from the user.
haftmann@18450
   282
wenzelm@18446
   283
* Pure/library: functions map2 and fold2 with curried syntax for
wenzelm@18446
   284
simultanous mapping and folding:
wenzelm@18446
   285
haftmann@18422
   286
    val map2: ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list
haftmann@18422
   287
    val fold2: ('a -> 'b -> 'c -> 'c) -> 'a list -> 'b list -> 'c -> 'c
haftmann@18422
   288
wenzelm@18446
   289
* Pure/library: indexed lists - some functions in the Isabelle library
wenzelm@18446
   290
treating lists over 'a as finite mappings from [0...n] to 'a have been
wenzelm@18446
   291
given more convenient names and signatures reminiscent of similar
wenzelm@18446
   292
functions for alists, tables, etc:
haftmann@18051
   293
haftmann@18051
   294
  val nth: 'a list -> int -> 'a 
haftmann@18051
   295
  val nth_update: int * 'a -> 'a list -> 'a list
haftmann@18051
   296
  val nth_map: int -> ('a -> 'a) -> 'a list -> 'a list
haftmann@18051
   297
  val fold_index: (int * 'a -> 'b -> 'b) -> 'a list -> 'b -> 'b
haftmann@18051
   298
wenzelm@18446
   299
Note that fold_index starts counting at index 0, not 1 like foldln
wenzelm@18446
   300
used to.
wenzelm@18446
   301
wenzelm@18446
   302
* Pure/General: name_mangler.ML provides a functor for generic name
wenzelm@18446
   303
mangling (bijective mapping from any expression values to strings).
wenzelm@18446
   304
wenzelm@18446
   305
* Pure/General: rat.ML implements rational numbers.
wenzelm@18446
   306
wenzelm@18642
   307
* Pure: datatype Context.generic joins theory/Proof.context and
wenzelm@18644
   308
provides some facilities for code that works in either kind of
wenzelm@18642
   309
context, notably GenericDataFun for uniform theory and proof data.
wenzelm@18642
   310
wenzelm@18642
   311
* Pure: type Context.generic attribute is now the preferred
wenzelm@18642
   312
representation for global vs. local attributes while avoiding code
wenzelm@18642
   313
duplication; Attrib.theory/context/generic converts between different
wenzelm@18642
   314
types of attributes.  Various Pure/HOL/ZF packages work with generic
wenzelm@18642
   315
attributes now, INCOMPATIBILITY.
wenzelm@18642
   316
wenzelm@18446
   317
* Pure: several functions of signature "... -> theory -> theory * ..."
wenzelm@18446
   318
have been reoriented to "... -> theory -> ... * theory" in order to
wenzelm@18446
   319
allow natural usage in combination with the ||>, ||>>, |-> and
wenzelm@18446
   320
fold_map combinators.
haftmann@18051
   321
wenzelm@18020
   322
* Pure: primitive rule lift_rule now takes goal cterm instead of an
wenzelm@18145
   323
actual goal state (thm).  Use Thm.lift_rule (Thm.cprem_of st i) to
wenzelm@18020
   324
achieve the old behaviour.
wenzelm@18020
   325
wenzelm@18020
   326
* Pure: the "Goal" constant is now called "prop", supporting a
wenzelm@18020
   327
slightly more general idea of ``protecting'' meta-level rule
wenzelm@18020
   328
statements.
wenzelm@18020
   329
wenzelm@18567
   330
* Pure: structure Goal provides simple interfaces for
wenzelm@17981
   331
init/conclude/finish and tactical prove operations (replacing former
wenzelm@17981
   332
Tactic.prove).  Note that OldGoals.prove_goalw_cterm has long been
wenzelm@17981
   333
obsolete, it is ill-behaved in a local proof context (e.g. with local
wenzelm@17981
   334
fixes/assumes or in a locale context).
wenzelm@17981
   335
wenzelm@18590
   336
* Pure/Isar: Toplevel.theory_to_proof admits transactions that modify
wenzelm@18590
   337
the theory before entering a proof state.  Transactions now always see
wenzelm@18590
   338
a quasi-functional intermediate checkpoint, both in interactive and
wenzelm@18590
   339
batch mode.
wenzelm@18567
   340
wenzelm@17878
   341
* Simplifier: the simpset of a running simplification process now
wenzelm@17878
   342
contains a proof context (cf. Simplifier.the_context), which is the
wenzelm@17878
   343
very context that the initial simpset has been retrieved from (by
wenzelm@17890
   344
simpset_of/local_simpset_of).  Consequently, all plug-in components
wenzelm@17878
   345
(solver, looper etc.) may depend on arbitrary proof data.
wenzelm@17878
   346
wenzelm@17878
   347
* Simplifier.inherit_context inherits the proof context (plus the
wenzelm@17878
   348
local bounds) of the current simplification process; any simproc
wenzelm@17878
   349
etc. that calls the Simplifier recursively should do this!  Removed
wenzelm@17878
   350
former Simplifier.inherit_bounds, which is already included here --
wenzelm@17890
   351
INCOMPATIBILITY.  Tools based on low-level rewriting may even have to
wenzelm@17890
   352
specify an explicit context using Simplifier.context/theory_context.
wenzelm@17878
   353
wenzelm@17878
   354
* Simplifier/Classical Reasoner: more abstract interfaces
wenzelm@17878
   355
change_simpset/claset for modifying the simpset/claset reference of a
wenzelm@17878
   356
theory; raw versions simpset/claset_ref etc. have been discontinued --
wenzelm@17878
   357
INCOMPATIBILITY.
wenzelm@17878
   358
wenzelm@18540
   359
* Provers: more generic wrt. syntax of object-logics, avoid hardwired
wenzelm@18540
   360
"Trueprop" etc.
wenzelm@18540
   361
wenzelm@17878
   362
wenzelm@17754
   363
wenzelm@17720
   364
New in Isabelle2005 (October 2005)
wenzelm@17720
   365
----------------------------------
wenzelm@14655
   366
wenzelm@14655
   367
*** General ***
wenzelm@14655
   368
nipkow@15130
   369
* Theory headers: the new header syntax for Isar theories is
nipkow@15130
   370
nipkow@15130
   371
  theory <name>
wenzelm@16234
   372
  imports <theory1> ... <theoryN>
wenzelm@16234
   373
  uses <file1> ... <fileM>
nipkow@15130
   374
  begin
nipkow@15130
   375
wenzelm@16234
   376
where the 'uses' part is optional.  The previous syntax
wenzelm@16234
   377
wenzelm@16234
   378
  theory <name> = <theory1> + ... + <theoryN>:
wenzelm@16234
   379
wenzelm@16717
   380
will disappear in the next release.  Use isatool fixheaders to convert
wenzelm@16717
   381
existing theory files.  Note that there is no change in ancient
wenzelm@17371
   382
non-Isar theories now, but these will disappear soon.
nipkow@15130
   383
berghofe@15475
   384
* Theory loader: parent theories can now also be referred to via
wenzelm@16234
   385
relative and absolute paths.
wenzelm@16234
   386
wenzelm@17408
   387
* Command 'find_theorems' searches for a list of criteria instead of a
wenzelm@17408
   388
list of constants. Known criteria are: intro, elim, dest, name:string,
wenzelm@17408
   389
simp:term, and any term. Criteria can be preceded by '-' to select
wenzelm@17408
   390
theorems that do not match. Intro, elim, dest select theorems that
wenzelm@17408
   391
match the current goal, name:s selects theorems whose fully qualified
wenzelm@17408
   392
name contain s, and simp:term selects all simplification rules whose
wenzelm@17408
   393
lhs match term.  Any other term is interpreted as pattern and selects
wenzelm@17408
   394
all theorems matching the pattern. Available in ProofGeneral under
wenzelm@17408
   395
'ProofGeneral -> Find Theorems' or C-c C-f.  Example:
wenzelm@16234
   396
wenzelm@17275
   397
  C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
wenzelm@16234
   398
wenzelm@16234
   399
prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
wenzelm@16234
   400
matching the current goal as introduction rule and not having "HOL."
wenzelm@16234
   401
in their name (i.e. not being defined in theory HOL).
wenzelm@16013
   402
wenzelm@17408
   403
* Command 'thms_containing' has been discontinued in favour of
wenzelm@17408
   404
'find_theorems'; INCOMPATIBILITY.
wenzelm@17408
   405
wenzelm@17385
   406
* Communication with Proof General is now 8bit clean, which means that
wenzelm@17385
   407
Unicode text in UTF-8 encoding may be used within theory texts (both
wenzelm@17408
   408
formal and informal parts).  Cf. option -U of the Isabelle Proof
wenzelm@17538
   409
General interface.  Here are some simple examples (cf. src/HOL/ex):
wenzelm@17538
   410
wenzelm@17538
   411
  http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
wenzelm@17538
   412
  http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
wenzelm@17385
   413
wenzelm@17425
   414
* Improved efficiency of the Simplifier and, to a lesser degree, the
wenzelm@17425
   415
Classical Reasoner.  Typical big applications run around 2 times
wenzelm@17425
   416
faster.
wenzelm@17425
   417
wenzelm@15703
   418
wenzelm@15703
   419
*** Document preparation ***
wenzelm@15703
   420
wenzelm@16234
   421
* Commands 'display_drafts' and 'print_drafts' perform simple output
wenzelm@16234
   422
of raw sources.  Only those symbols that do not require additional
wenzelm@16234
   423
LaTeX packages (depending on comments in isabellesym.sty) are
wenzelm@16234
   424
displayed properly, everything else is left verbatim.  isatool display
wenzelm@16234
   425
and isatool print are used as front ends (these are subject to the
wenzelm@16234
   426
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
wenzelm@16234
   427
wenzelm@17047
   428
* Command tags control specific markup of certain regions of text,
wenzelm@17047
   429
notably folding and hiding.  Predefined tags include "theory" (for
wenzelm@17047
   430
theory begin and end), "proof" for proof commands, and "ML" for
wenzelm@17047
   431
commands involving ML code; the additional tags "visible" and
wenzelm@17047
   432
"invisible" are unused by default.  Users may give explicit tag
wenzelm@17047
   433
specifications in the text, e.g. ''by %invisible (auto)''.  The
wenzelm@17047
   434
interpretation of tags is determined by the LaTeX job during document
wenzelm@17047
   435
preparation: see option -V of isatool usedir, or options -n and -t of
wenzelm@17047
   436
isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
wenzelm@17047
   437
\isadroptag.
wenzelm@17047
   438
wenzelm@17047
   439
Several document versions may be produced at the same time via isatool
wenzelm@17047
   440
usedir (the generated index.html will link all of them).  Typical
wenzelm@17047
   441
specifications include ''-V document=theory,proof,ML'' to present
wenzelm@17047
   442
theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
wenzelm@17047
   443
proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
wenzelm@17047
   444
these parts without any formal replacement text.  The Isabelle site
wenzelm@17047
   445
default settings produce ''document'' and ''outline'' versions as
wenzelm@17047
   446
specified above.
wenzelm@16234
   447
haftmann@17402
   448
* Several new antiquotations:
wenzelm@15979
   449
wenzelm@15979
   450
  @{term_type term} prints a term with its type annotated;
wenzelm@15979
   451
wenzelm@15979
   452
  @{typeof term} prints the type of a term;
wenzelm@15979
   453
wenzelm@16234
   454
  @{const const} is the same as @{term const}, but checks that the
wenzelm@16234
   455
  argument is a known logical constant;
wenzelm@15979
   456
wenzelm@15979
   457
  @{term_style style term} and @{thm_style style thm} print a term or
wenzelm@16234
   458
  theorem applying a "style" to it
wenzelm@16234
   459
wenzelm@17117
   460
  @{ML text}
wenzelm@17117
   461
wenzelm@16234
   462
Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
wenzelm@16234
   463
definitions, equations, inequations etc., 'concl' printing only the
schirmer@17393
   464
conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
wenzelm@16234
   465
to print the specified premise.  TermStyle.add_style provides an ML
wenzelm@16234
   466
interface for introducing further styles.  See also the "LaTeX Sugar"
wenzelm@17117
   467
document practical applications.  The ML antiquotation prints
wenzelm@17117
   468
type-checked ML expressions verbatim.
wenzelm@16234
   469
wenzelm@17259
   470
* Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
wenzelm@17259
   471
and 'text' support optional locale specification '(in loc)', which
wenzelm@17269
   472
specifies the default context for interpreting antiquotations.  For
wenzelm@17269
   473
example: 'text (in lattice) {* @{thm inf_assoc}*}'.
wenzelm@17259
   474
wenzelm@17259
   475
* Option 'locale=NAME' of antiquotations specifies an alternative
wenzelm@17259
   476
context interpreting the subsequent argument.  For example: @{thm
wenzelm@17269
   477
[locale=lattice] inf_assoc}.
wenzelm@17259
   478
wenzelm@17097
   479
* Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
wenzelm@17097
   480
a proof context.
wenzelm@17097
   481
wenzelm@17097
   482
* Proper output of antiquotations for theory commands involving a
wenzelm@17097
   483
proof context (such as 'locale' or 'theorem (in loc) ...').
wenzelm@17097
   484
wenzelm@17193
   485
* Delimiters of outer tokens (string etc.) now produce separate LaTeX
wenzelm@17193
   486
macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
wenzelm@17193
   487
wenzelm@17193
   488
* isatool usedir: new option -C (default true) controls whether option
wenzelm@17193
   489
-D should include a copy of the original document directory; -C false
wenzelm@17193
   490
prevents unwanted effects such as copying of administrative CVS data.
wenzelm@17193
   491
wenzelm@16234
   492
wenzelm@16234
   493
*** Pure ***
wenzelm@16234
   494
wenzelm@16234
   495
* Considerably improved version of 'constdefs' command.  Now performs
wenzelm@16234
   496
automatic type-inference of declared constants; additional support for
wenzelm@16234
   497
local structure declarations (cf. locales and HOL records), see also
wenzelm@16234
   498
isar-ref manual.  Potential INCOMPATIBILITY: need to observe strictly
wenzelm@16234
   499
sequential dependencies of definitions within a single 'constdefs'
wenzelm@16234
   500
section; moreover, the declared name needs to be an identifier.  If
wenzelm@16234
   501
all fails, consider to fall back on 'consts' and 'defs' separately.
wenzelm@16234
   502
wenzelm@16234
   503
* Improved indexed syntax and implicit structures.  First of all,
wenzelm@16234
   504
indexed syntax provides a notational device for subscripted
wenzelm@16234
   505
application, using the new syntax \<^bsub>term\<^esub> for arbitrary
wenzelm@16234
   506
expressions.  Secondly, in a local context with structure
wenzelm@16234
   507
declarations, number indexes \<^sub>n or the empty index (default
wenzelm@16234
   508
number 1) refer to a certain fixed variable implicitly; option
wenzelm@16234
   509
show_structs controls printing of implicit structures.  Typical
wenzelm@16234
   510
applications of these concepts involve record types and locales.
wenzelm@16234
   511
wenzelm@16234
   512
* New command 'no_syntax' removes grammar declarations (and
wenzelm@16234
   513
translations) resulting from the given syntax specification, which is
wenzelm@16234
   514
interpreted in the same manner as for the 'syntax' command.
wenzelm@16234
   515
wenzelm@16234
   516
* 'Advanced' translation functions (parse_translation etc.) may depend
wenzelm@16234
   517
on the signature of the theory context being presently used for
wenzelm@16234
   518
parsing/printing, see also isar-ref manual.
wenzelm@16234
   519
wenzelm@16856
   520
* Improved 'oracle' command provides a type-safe interface to turn an
wenzelm@16856
   521
ML expression of type theory -> T -> term into a primitive rule of
wenzelm@16856
   522
type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
wenzelm@16856
   523
is already included here); see also FOL/ex/IffExample.thy;
wenzelm@16856
   524
INCOMPATIBILITY.
wenzelm@16856
   525
wenzelm@17275
   526
* axclass: name space prefix for class "c" is now "c_class" (was "c"
wenzelm@17275
   527
before); "cI" is no longer bound, use "c.intro" instead.
wenzelm@17275
   528
INCOMPATIBILITY.  This change avoids clashes of fact bindings for
wenzelm@17275
   529
axclasses vs. locales.
wenzelm@17275
   530
wenzelm@16234
   531
* Improved internal renaming of symbolic identifiers -- attach primes
wenzelm@16234
   532
instead of base 26 numbers.
wenzelm@16234
   533
wenzelm@16234
   534
* New flag show_question_marks controls printing of leading question
wenzelm@16234
   535
marks in schematic variable names.
wenzelm@16234
   536
wenzelm@16234
   537
* In schematic variable names, *any* symbol following \<^isub> or
wenzelm@16234
   538
\<^isup> is now treated as part of the base name.  For example, the
wenzelm@16234
   539
following works without printing of awkward ".0" indexes:
wenzelm@16234
   540
wenzelm@16234
   541
  lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
wenzelm@16234
   542
    by simp
wenzelm@16234
   543
wenzelm@16234
   544
* Inner syntax includes (*(*nested*) comments*).
wenzelm@16234
   545
wenzelm@17548
   546
* Pretty printer now supports unbreakable blocks, specified in mixfix
wenzelm@16234
   547
annotations as "(00...)".
wenzelm@16234
   548
wenzelm@16234
   549
* Clear separation of logical types and nonterminals, where the latter
wenzelm@16234
   550
may only occur in 'syntax' specifications or type abbreviations.
wenzelm@16234
   551
Before that distinction was only partially implemented via type class
wenzelm@16234
   552
"logic" vs. "{}".  Potential INCOMPATIBILITY in rare cases of improper
wenzelm@16234
   553
use of 'types'/'consts' instead of 'nonterminals'/'syntax'.  Some very
wenzelm@16234
   554
exotic syntax specifications may require further adaption
wenzelm@17691
   555
(e.g. Cube/Cube.thy).
wenzelm@16234
   556
wenzelm@16234
   557
* Removed obsolete type class "logic", use the top sort {} instead.
wenzelm@16234
   558
Note that non-logical types should be declared as 'nonterminals'
wenzelm@16234
   559
rather than 'types'.  INCOMPATIBILITY for new object-logic
wenzelm@16234
   560
specifications.
wenzelm@16234
   561
ballarin@17095
   562
* Attributes 'induct' and 'cases': type or set names may now be
ballarin@17095
   563
locally fixed variables as well.
ballarin@17095
   564
wenzelm@16234
   565
* Simplifier: can now control the depth to which conditional rewriting
wenzelm@16234
   566
is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
wenzelm@16234
   567
Limit.
wenzelm@16234
   568
wenzelm@16234
   569
* Simplifier: simplification procedures may now take the current
wenzelm@16234
   570
simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
wenzelm@16234
   571
interface), which is very useful for calling the Simplifier
wenzelm@16234
   572
recursively.  Minor INCOMPATIBILITY: the 'prems' argument of simprocs
wenzelm@16234
   573
is gone -- use prems_of_ss on the simpset instead.  Moreover, the
wenzelm@16234
   574
low-level mk_simproc no longer applies Logic.varify internally, to
wenzelm@16234
   575
allow for use in a context of fixed variables.
wenzelm@16234
   576
wenzelm@16234
   577
* thin_tac now works even if the assumption being deleted contains !!
wenzelm@16234
   578
or ==>.  More generally, erule now works even if the major premise of
wenzelm@16234
   579
the elimination rule contains !! or ==>.
wenzelm@16234
   580
wenzelm@17597
   581
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
nipkow@17590
   582
wenzelm@16234
   583
* Reorganized bootstrapping of the Pure theories; CPure is now derived
wenzelm@16234
   584
from Pure, which contains all common declarations already.  Both
wenzelm@16234
   585
theories are defined via plain Isabelle/Isar .thy files.
wenzelm@16234
   586
INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
wenzelm@16234
   587
CPure.elim / CPure.dest attributes) now appear in the Pure name space;
wenzelm@16234
   588
use isatool fixcpure to adapt your theory and ML sources.
wenzelm@16234
   589
wenzelm@16234
   590
* New syntax 'name(i-j, i-, i, ...)' for referring to specific
wenzelm@16234
   591
selections of theorems in named facts via index ranges.
wenzelm@16234
   592
wenzelm@17097
   593
* 'print_theorems': in theory mode, really print the difference
wenzelm@17097
   594
wrt. the last state (works for interactive theory development only),
wenzelm@17097
   595
in proof mode print all local facts (cf. 'print_facts');
wenzelm@17097
   596
wenzelm@17397
   597
* 'hide': option '(open)' hides only base names.
wenzelm@17397
   598
wenzelm@17275
   599
* More efficient treatment of intermediate checkpoints in interactive
wenzelm@17275
   600
theory development.
wenzelm@17275
   601
berghofe@17663
   602
* Code generator is now invoked via code_module (incremental code
wenzelm@17664
   603
generation) and code_library (modular code generation, ML structures
wenzelm@17664
   604
for each theory).  INCOMPATIBILITY: new keywords 'file' and 'contains'
wenzelm@17664
   605
must be quoted when used as identifiers.
wenzelm@17664
   606
wenzelm@17664
   607
* New 'value' command for reading, evaluating and printing terms using
wenzelm@17664
   608
the code generator.  INCOMPATIBILITY: command keyword 'value' must be
wenzelm@17664
   609
quoted when used as identifier.
berghofe@17663
   610
wenzelm@16234
   611
wenzelm@16234
   612
*** Locales ***
ballarin@17095
   613
wenzelm@17385
   614
* New commands for the interpretation of locale expressions in
wenzelm@17385
   615
theories (1), locales (2) and proof contexts (3).  These generate
wenzelm@17385
   616
proof obligations from the expression specification.  After the
wenzelm@17385
   617
obligations have been discharged, theorems of the expression are added
wenzelm@17385
   618
to the theory, target locale or proof context.  The synopsis of the
wenzelm@17385
   619
commands is a follows:
wenzelm@17385
   620
ballarin@17095
   621
  (1) interpretation expr inst
ballarin@17095
   622
  (2) interpretation target < expr
ballarin@17095
   623
  (3) interpret expr inst
wenzelm@17385
   624
ballarin@17095
   625
Interpretation in theories and proof contexts require a parameter
ballarin@17095
   626
instantiation of terms from the current context.  This is applied to
wenzelm@17385
   627
specifications and theorems of the interpreted expression.
wenzelm@17385
   628
Interpretation in locales only permits parameter renaming through the
wenzelm@17385
   629
locale expression.  Interpretation is smart in that interpretations
wenzelm@17385
   630
that are active already do not occur in proof obligations, neither are
wenzelm@17385
   631
instantiated theorems stored in duplicate.  Use 'print_interps' to
wenzelm@17385
   632
inspect active interpretations of a particular locale.  For details,
ballarin@17436
   633
see the Isar Reference manual.  Examples can be found in
ballarin@17436
   634
HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
wenzelm@16234
   635
wenzelm@16234
   636
INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
wenzelm@16234
   637
'interpret' instead.
wenzelm@16234
   638
wenzelm@17385
   639
* New context element 'constrains' for adding type constraints to
wenzelm@17385
   640
parameters.
wenzelm@17385
   641
wenzelm@17385
   642
* Context expressions: renaming of parameters with syntax
wenzelm@17385
   643
redeclaration.
ballarin@17095
   644
ballarin@17095
   645
* Locale declaration: 'includes' disallowed.
ballarin@17095
   646
wenzelm@16234
   647
* Proper static binding of attribute syntax -- i.e. types / terms /
wenzelm@16234
   648
facts mentioned as arguments are always those of the locale definition
wenzelm@16234
   649
context, independently of the context of later invocations.  Moreover,
wenzelm@16234
   650
locale operations (renaming and type / term instantiation) are applied
wenzelm@16234
   651
to attribute arguments as expected.
wenzelm@16234
   652
wenzelm@16234
   653
INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
wenzelm@16234
   654
actual attributes; rare situations may require Attrib.attribute to
wenzelm@16234
   655
embed those attributes into Attrib.src that lack concrete syntax.
wenzelm@16234
   656
Attribute implementations need to cooperate properly with the static
wenzelm@16234
   657
binding mechanism.  Basic parsers Args.XXX_typ/term/prop and
wenzelm@16234
   658
Attrib.XXX_thm etc. already do the right thing without further
wenzelm@16234
   659
intervention.  Only unusual applications -- such as "where" or "of"
wenzelm@16234
   660
(cf. src/Pure/Isar/attrib.ML), which process arguments depending both
wenzelm@16234
   661
on the context and the facts involved -- may have to assign parsed
wenzelm@16234
   662
values to argument tokens explicitly.
wenzelm@16234
   663
wenzelm@16234
   664
* Changed parameter management in theorem generation for long goal
wenzelm@16234
   665
statements with 'includes'.  INCOMPATIBILITY: produces a different
wenzelm@16234
   666
theorem statement in rare situations.
wenzelm@16234
   667
ballarin@17228
   668
* Locale inspection command 'print_locale' omits notes elements.  Use
ballarin@17228
   669
'print_locale!' to have them included in the output.
ballarin@17228
   670
wenzelm@16234
   671
wenzelm@16234
   672
*** Provers ***
wenzelm@16234
   673
wenzelm@16234
   674
* Provers/hypsubst.ML: improved version of the subst method, for
wenzelm@16234
   675
single-step rewriting: it now works in bound variable contexts. New is
wenzelm@16234
   676
'subst (asm)', for rewriting an assumption.  INCOMPATIBILITY: may
wenzelm@16234
   677
rewrite a different subterm than the original subst method, which is
wenzelm@16234
   678
still available as 'simplesubst'.
wenzelm@16234
   679
wenzelm@16234
   680
* Provers/quasi.ML: new transitivity reasoners for transitivity only
wenzelm@16234
   681
and quasi orders.
wenzelm@16234
   682
wenzelm@16234
   683
* Provers/trancl.ML: new transitivity reasoner for transitive and
wenzelm@16234
   684
reflexive-transitive closure of relations.
wenzelm@16234
   685
wenzelm@16234
   686
* Provers/blast.ML: new reference depth_limit to make blast's depth
wenzelm@16234
   687
limit (previously hard-coded with a value of 20) user-definable.
wenzelm@16234
   688
wenzelm@16234
   689
* Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
wenzelm@16234
   690
is peformed already.  Object-logics merely need to finish their
wenzelm@16234
   691
initial simpset configuration as before.  INCOMPATIBILITY.
wenzelm@15703
   692
berghofe@15475
   693
schirmer@14700
   694
*** HOL ***
schirmer@14700
   695
wenzelm@16234
   696
* Symbolic syntax of Hilbert Choice Operator is now as follows:
wenzelm@14878
   697
wenzelm@14878
   698
  syntax (epsilon)
wenzelm@14878
   699
    "_Eps" :: "[pttrn, bool] => 'a"    ("(3\<some>_./ _)" [0, 10] 10)
wenzelm@14878
   700
wenzelm@16234
   701
The symbol \<some> is displayed as the alternative epsilon of LaTeX
wenzelm@16234
   702
and x-symbol; use option '-m epsilon' to get it actually printed.
wenzelm@16234
   703
Moreover, the mathematically important symbolic identifier \<epsilon>
wenzelm@16234
   704
becomes available as variable, constant etc.  INCOMPATIBILITY,
wenzelm@16234
   705
wenzelm@16234
   706
* "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
wenzelm@16234
   707
Similarly for all quantifiers: "ALL x > y" etc.  The x-symbol for >=
wenzelm@17371
   708
is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
avigad@17016
   709
support corresponding Isar calculations.
wenzelm@16234
   710
wenzelm@16234
   711
* "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
wenzelm@16234
   712
instead of ":".
wenzelm@16234
   713
wenzelm@16234
   714
* theory SetInterval: changed the syntax for open intervals:
wenzelm@16234
   715
wenzelm@16234
   716
  Old       New
wenzelm@16234
   717
  {..n(}    {..<n}
wenzelm@16234
   718
  {)n..}    {n<..}
wenzelm@16234
   719
  {m..n(}   {m..<n}
wenzelm@16234
   720
  {)m..n}   {m<..n}
wenzelm@16234
   721
  {)m..n(}  {m<..<n}
wenzelm@16234
   722
wenzelm@16234
   723
The old syntax is still supported but will disappear in the next
wenzelm@16234
   724
release.  For conversion use the following Emacs search and replace
wenzelm@16234
   725
patterns (these are not perfect but work quite well):
nipkow@15046
   726
nipkow@15046
   727
  {)\([^\.]*\)\.\.  ->  {\1<\.\.}
nipkow@15046
   728
  \.\.\([^(}]*\)(}  ->  \.\.<\1}
nipkow@15046
   729
wenzelm@17533
   730
* Theory Commutative_Ring (in Library): method comm_ring for proving
wenzelm@17533
   731
equalities in commutative rings; method 'algebra' provides a generic
wenzelm@17533
   732
interface.
wenzelm@17389
   733
wenzelm@17389
   734
* Theory Finite_Set: changed the syntax for 'setsum', summation over
wenzelm@16234
   735
finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
wenzelm@17371
   736
now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
paulson@17189
   737
be a tuple pattern.
wenzelm@16234
   738
wenzelm@16234
   739
Some new syntax forms are available:
wenzelm@16234
   740
wenzelm@16234
   741
  "\<Sum>x | P. e"      for     "setsum (%x. e) {x. P}"
wenzelm@16234
   742
  "\<Sum>x = a..b. e"   for     "setsum (%x. e) {a..b}"
wenzelm@16234
   743
  "\<Sum>x = a..<b. e"  for     "setsum (%x. e) {a..<b}"
wenzelm@16234
   744
  "\<Sum>x < k. e"      for     "setsum (%x. e) {..<k}"
wenzelm@16234
   745
wenzelm@16234
   746
The latter form "\<Sum>x < k. e" used to be based on a separate
wenzelm@16234
   747
function "Summation", which has been discontinued.
wenzelm@16234
   748
wenzelm@16234
   749
* theory Finite_Set: in structured induction proofs, the insert case
wenzelm@16234
   750
is now 'case (insert x F)' instead of the old counterintuitive 'case
wenzelm@16234
   751
(insert F x)'.
wenzelm@16234
   752
wenzelm@16234
   753
* The 'refute' command has been extended to support a much larger
wenzelm@16234
   754
fragment of HOL, including axiomatic type classes, constdefs and
wenzelm@16234
   755
typedefs, inductive datatypes and recursion.
wenzelm@16234
   756
webertj@17700
   757
* New tactics 'sat' and 'satx' to prove propositional tautologies.
webertj@17700
   758
Requires zChaff with proof generation to be installed.  See
webertj@17700
   759
HOL/ex/SAT_Examples.thy for examples.
webertj@17619
   760
wenzelm@16234
   761
* Datatype induction via method 'induct' now preserves the name of the
wenzelm@16234
   762
induction variable. For example, when proving P(xs::'a list) by
wenzelm@16234
   763
induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
wenzelm@16234
   764
than P(list) ==> P(a#list) as previously.  Potential INCOMPATIBILITY
wenzelm@16234
   765
in unstructured proof scripts.
wenzelm@16234
   766
wenzelm@16234
   767
* Reworked implementation of records.  Improved scalability for
wenzelm@16234
   768
records with many fields, avoiding performance problems for type
wenzelm@16234
   769
inference. Records are no longer composed of nested field types, but
wenzelm@16234
   770
of nested extension types. Therefore the record type only grows linear
wenzelm@16234
   771
in the number of extensions and not in the number of fields.  The
wenzelm@16234
   772
top-level (users) view on records is preserved.  Potential
wenzelm@16234
   773
INCOMPATIBILITY only in strange cases, where the theory depends on the
wenzelm@16234
   774
old record representation. The type generated for a record is called
wenzelm@16234
   775
<record_name>_ext_type.
wenzelm@16234
   776
wenzelm@16234
   777
Flag record_quick_and_dirty_sensitive can be enabled to skip the
wenzelm@16234
   778
proofs triggered by a record definition or a simproc (if
wenzelm@16234
   779
quick_and_dirty is enabled).  Definitions of large records can take
wenzelm@16234
   780
quite long.
wenzelm@16234
   781
wenzelm@16234
   782
New simproc record_upd_simproc for simplification of multiple record
wenzelm@16234
   783
updates enabled by default.  Moreover, trivial updates are also
wenzelm@16234
   784
removed: r(|x := x r|) = r.  INCOMPATIBILITY: old proofs break
wenzelm@16234
   785
occasionally, since simplification is more powerful by default.
wenzelm@16234
   786
wenzelm@17275
   787
* typedef: proper support for polymorphic sets, which contain extra
wenzelm@17275
   788
type-variables in the term.
wenzelm@17275
   789
wenzelm@16234
   790
* Simplifier: automatically reasons about transitivity chains
wenzelm@16234
   791
involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
wenzelm@16234
   792
provided by Provers/trancl.ML as additional solvers.  INCOMPATIBILITY:
wenzelm@16234
   793
old proofs break occasionally as simplification may now solve more
wenzelm@16234
   794
goals than previously.
wenzelm@16234
   795
wenzelm@16234
   796
* Simplifier: converts x <= y into x = y if assumption y <= x is
wenzelm@16234
   797
present.  Works for all partial orders (class "order"), in particular
wenzelm@16234
   798
numbers and sets.  For linear orders (e.g. numbers) it treats ~ x < y
wenzelm@16234
   799
just like y <= x.
wenzelm@16234
   800
wenzelm@16234
   801
* Simplifier: new simproc for "let x = a in f x".  If a is a free or
wenzelm@16234
   802
bound variable or a constant then the let is unfolded.  Otherwise
wenzelm@16234
   803
first a is simplified to b, and then f b is simplified to g. If
wenzelm@16234
   804
possible we abstract b from g arriving at "let x = b in h x",
wenzelm@16234
   805
otherwise we unfold the let and arrive at g.  The simproc can be
wenzelm@16234
   806
enabled/disabled by the reference use_let_simproc.  Potential
wenzelm@16234
   807
INCOMPATIBILITY since simplification is more powerful by default.
webertj@15776
   808
paulson@16563
   809
* Classical reasoning: the meson method now accepts theorems as arguments.
paulson@16563
   810
paulson@17595
   811
* Prover support: pre-release of the Isabelle-ATP linkup, which runs background
paulson@17595
   812
jobs to provide advice on the provability of subgoals.
paulson@17595
   813
wenzelm@16891
   814
* Theory OrderedGroup and Ring_and_Field: various additions and
wenzelm@16891
   815
improvements to faciliate calculations involving equalities and
wenzelm@16891
   816
inequalities.
wenzelm@16891
   817
wenzelm@16891
   818
The following theorems have been eliminated or modified
wenzelm@16891
   819
(INCOMPATIBILITY):
avigad@16888
   820
avigad@16888
   821
  abs_eq             now named abs_of_nonneg
wenzelm@17371
   822
  abs_of_ge_0        now named abs_of_nonneg
wenzelm@17371
   823
  abs_minus_eq       now named abs_of_nonpos
avigad@16888
   824
  imp_abs_id         now named abs_of_nonneg
avigad@16888
   825
  imp_abs_neg_id     now named abs_of_nonpos
avigad@16888
   826
  mult_pos           now named mult_pos_pos
avigad@16888
   827
  mult_pos_le        now named mult_nonneg_nonneg
avigad@16888
   828
  mult_pos_neg_le    now named mult_nonneg_nonpos
avigad@16888
   829
  mult_pos_neg2_le   now named mult_nonneg_nonpos2
avigad@16888
   830
  mult_neg           now named mult_neg_neg
avigad@16888
   831
  mult_neg_le        now named mult_nonpos_nonpos
avigad@16888
   832
wenzelm@16891
   833
* Theory Parity: added rules for simplifying exponents.
wenzelm@16891
   834
nipkow@17092
   835
* Theory List:
nipkow@17092
   836
nipkow@17092
   837
The following theorems have been eliminated or modified
nipkow@17092
   838
(INCOMPATIBILITY):
nipkow@17092
   839
nipkow@17092
   840
  list_all_Nil       now named list_all.simps(1)
nipkow@17092
   841
  list_all_Cons      now named list_all.simps(2)
nipkow@17092
   842
  list_all_conv      now named list_all_iff
nipkow@17092
   843
  set_mem_eq         now named mem_iff
nipkow@17092
   844
wenzelm@16929
   845
* Theories SetsAndFunctions and BigO (see HOL/Library) support
wenzelm@16929
   846
asymptotic "big O" calculations.  See the notes in BigO.thy.
wenzelm@16929
   847
avigad@16888
   848
avigad@16888
   849
*** HOL-Complex ***
avigad@16888
   850
wenzelm@16891
   851
* Theory RealDef: better support for embedding natural numbers and
wenzelm@16891
   852
integers in the reals.
wenzelm@16891
   853
wenzelm@16891
   854
The following theorems have been eliminated or modified
wenzelm@16891
   855
(INCOMPATIBILITY):
wenzelm@16891
   856
avigad@17016
   857
  exp_ge_add_one_self  now requires no hypotheses
avigad@17016
   858
  real_of_int_add      reversed direction of equality (use [symmetric])
avigad@17016
   859
  real_of_int_minus    reversed direction of equality (use [symmetric])
avigad@17016
   860
  real_of_int_diff     reversed direction of equality (use [symmetric])
avigad@17016
   861
  real_of_int_mult     reversed direction of equality (use [symmetric])
wenzelm@16891
   862
wenzelm@16891
   863
* Theory RComplete: expanded support for floor and ceiling functions.
avigad@16888
   864
avigad@16962
   865
* Theory Ln is new, with properties of the natural logarithm
avigad@16962
   866
wenzelm@17423
   867
* Hyperreal: There is a new type constructor "star" for making
wenzelm@17423
   868
nonstandard types.  The old type names are now type synonyms:
wenzelm@17423
   869
wenzelm@17423
   870
  hypreal = real star
wenzelm@17423
   871
  hypnat = nat star
wenzelm@17423
   872
  hcomplex = complex star
wenzelm@17423
   873
wenzelm@17423
   874
* Hyperreal: Many groups of similarly-defined constants have been
huffman@17442
   875
replaced by polymorphic versions (INCOMPATIBILITY):
wenzelm@17423
   876
wenzelm@17423
   877
  star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
wenzelm@17423
   878
wenzelm@17423
   879
  starset      <-- starsetNat, starsetC
wenzelm@17423
   880
  *s*          <-- *sNat*, *sc*
wenzelm@17423
   881
  starset_n    <-- starsetNat_n, starsetC_n
wenzelm@17423
   882
  *sn*         <-- *sNatn*, *scn*
wenzelm@17423
   883
  InternalSets <-- InternalNatSets, InternalCSets
wenzelm@17423
   884
huffman@17442
   885
  starfun      <-- starfun{Nat,Nat2,C,RC,CR}
wenzelm@17423
   886
  *f*          <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
huffman@17442
   887
  starfun_n    <-- starfun{Nat,Nat2,C,RC,CR}_n
wenzelm@17423
   888
  *fn*         <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
huffman@17442
   889
  InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
wenzelm@17423
   890
wenzelm@17423
   891
* Hyperreal: Many type-specific theorems have been removed in favor of
huffman@17442
   892
theorems specific to various axiomatic type classes (INCOMPATIBILITY):
huffman@17442
   893
huffman@17442
   894
  add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
huffman@17442
   895
  add_assoc   <-- {hypreal,hypnat,hcomplex}_add_assocs
huffman@17442
   896
  OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
huffman@17442
   897
  OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
wenzelm@17423
   898
  right_minus <-- hypreal_add_minus
huffman@17442
   899
  left_minus <-- {hypreal,hcomplex}_add_minus_left
huffman@17442
   900
  mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
huffman@17442
   901
  mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
huffman@17442
   902
  mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
wenzelm@17423
   903
  mult_1_right <-- hcomplex_mult_one_right
wenzelm@17423
   904
  mult_zero_left <-- hcomplex_mult_zero_left
huffman@17442
   905
  left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
wenzelm@17423
   906
  right_distrib <-- hypnat_add_mult_distrib2
huffman@17442
   907
  zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
wenzelm@17423
   908
  right_inverse <-- hypreal_mult_inverse
wenzelm@17423
   909
  left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
huffman@17442
   910
  order_refl <-- {hypreal,hypnat}_le_refl
huffman@17442
   911
  order_trans <-- {hypreal,hypnat}_le_trans
huffman@17442
   912
  order_antisym <-- {hypreal,hypnat}_le_anti_sym
huffman@17442
   913
  order_less_le <-- {hypreal,hypnat}_less_le
huffman@17442
   914
  linorder_linear <-- {hypreal,hypnat}_le_linear
huffman@17442
   915
  add_left_mono <-- {hypreal,hypnat}_add_left_mono
huffman@17442
   916
  mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
wenzelm@17423
   917
  add_nonneg_nonneg <-- hypreal_le_add_order
wenzelm@17423
   918
wenzelm@17423
   919
* Hyperreal: Separate theorems having to do with type-specific
wenzelm@17423
   920
versions of constants have been merged into theorems that apply to the
huffman@17442
   921
new polymorphic constants (INCOMPATIBILITY):
huffman@17442
   922
huffman@17442
   923
  STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
huffman@17442
   924
  STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
huffman@17442
   925
  STAR_Un <-- {STAR,NatStar,STARC}_Un
huffman@17442
   926
  STAR_Int <-- {STAR,NatStar,STARC}_Int
huffman@17442
   927
  STAR_Compl <-- {STAR,NatStar,STARC}_Compl
huffman@17442
   928
  STAR_subset <-- {STAR,NatStar,STARC}_subset
huffman@17442
   929
  STAR_mem <-- {STAR,NatStar,STARC}_mem
huffman@17442
   930
  STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
huffman@17442
   931
  STAR_diff <-- {STAR,STARC}_diff
huffman@17442
   932
  STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
huffman@17442
   933
    STARC_hcomplex_of_complex}_image_subset
huffman@17442
   934
  starset_n_Un <-- starset{Nat,C}_n_Un
huffman@17442
   935
  starset_n_Int <-- starset{Nat,C}_n_Int
huffman@17442
   936
  starset_n_Compl <-- starset{Nat,C}_n_Compl
huffman@17442
   937
  starset_n_diff <-- starset{Nat,C}_n_diff
huffman@17442
   938
  InternalSets_Un <-- Internal{Nat,C}Sets_Un
huffman@17442
   939
  InternalSets_Int <-- Internal{Nat,C}Sets_Int
huffman@17442
   940
  InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
huffman@17442
   941
  InternalSets_diff <-- Internal{Nat,C}Sets_diff
huffman@17442
   942
  InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
huffman@17442
   943
  InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
huffman@17442
   944
  starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
huffman@17442
   945
  starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
huffman@17442
   946
  starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
huffman@17442
   947
  starfun <-- starfun{Nat,Nat2,C,RC,CR}
huffman@17442
   948
  starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
huffman@17442
   949
  starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
huffman@17442
   950
  starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
huffman@17442
   951
  starfun_diff <-- starfun{C,RC,CR}_diff
huffman@17442
   952
  starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
huffman@17442
   953
  starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
huffman@17442
   954
  starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
huffman@17442
   955
  starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
huffman@17442
   956
  starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
huffman@17442
   957
  starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
wenzelm@17423
   958
  starfun_Id <-- starfunC_Id
huffman@17442
   959
  starfun_approx <-- starfun{Nat,CR}_approx
huffman@17442
   960
  starfun_capprox <-- starfun{C,RC}_capprox
wenzelm@17423
   961
  starfun_abs <-- starfunNat_rabs
huffman@17442
   962
  starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
huffman@17442
   963
  starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
wenzelm@17423
   964
  starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
huffman@17442
   965
  starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
huffman@17442
   966
  starfun_add_capprox <-- starfun{C,RC}_add_capprox
wenzelm@17423
   967
  starfun_add_approx <-- starfunCR_add_approx
wenzelm@17423
   968
  starfun_inverse_inverse <-- starfunC_inverse_inverse
huffman@17442
   969
  starfun_divide <-- starfun{C,CR,RC}_divide
huffman@17442
   970
  starfun_n <-- starfun{Nat,C}_n
huffman@17442
   971
  starfun_n_mult <-- starfun{Nat,C}_n_mult
huffman@17442
   972
  starfun_n_add <-- starfun{Nat,C}_n_add
wenzelm@17423
   973
  starfun_n_add_minus <-- starfunNat_n_add_minus
huffman@17442
   974
  starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
huffman@17442
   975
  starfun_n_minus <-- starfun{Nat,C}_n_minus
huffman@17442
   976
  starfun_n_eq <-- starfun{Nat,C}_n_eq
huffman@17442
   977
huffman@17442
   978
  star_n_add <-- {hypreal,hypnat,hcomplex}_add
huffman@17442
   979
  star_n_minus <-- {hypreal,hcomplex}_minus
huffman@17442
   980
  star_n_diff <-- {hypreal,hcomplex}_diff
huffman@17442
   981
  star_n_mult <-- {hypreal,hcomplex}_mult
huffman@17442
   982
  star_n_inverse <-- {hypreal,hcomplex}_inverse
huffman@17442
   983
  star_n_le <-- {hypreal,hypnat}_le
huffman@17442
   984
  star_n_less <-- {hypreal,hypnat}_less
huffman@17442
   985
  star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
huffman@17442
   986
  star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
wenzelm@17423
   987
  star_n_abs <-- hypreal_hrabs
wenzelm@17423
   988
  star_n_divide <-- hcomplex_divide
wenzelm@17423
   989
huffman@17442
   990
  star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
huffman@17442
   991
  star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
wenzelm@17423
   992
  star_of_diff <-- hypreal_of_real_diff
huffman@17442
   993
  star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
huffman@17442
   994
  star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
huffman@17442
   995
  star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
huffman@17442
   996
  star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
huffman@17442
   997
  star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
huffman@17442
   998
  star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
huffman@17442
   999
  star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
huffman@17442
  1000
  star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
huffman@17442
  1001
  star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
huffman@17442
  1002
  star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
huffman@17442
  1003
  star_of_number_of <-- {hypreal,hcomplex}_number_of
wenzelm@17423
  1004
  star_of_number_less <-- number_of_less_hypreal_of_real_iff
wenzelm@17423
  1005
  star_of_number_le <-- number_of_le_hypreal_of_real_iff
wenzelm@17423
  1006
  star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
wenzelm@17423
  1007
  star_of_less_number <-- hypreal_of_real_less_number_of_iff
wenzelm@17423
  1008
  star_of_le_number <-- hypreal_of_real_le_number_of_iff
wenzelm@17423
  1009
  star_of_power <-- hypreal_of_real_power
wenzelm@17423
  1010
  star_of_eq_0 <-- hcomplex_of_complex_zero_iff
wenzelm@17423
  1011
huffman@17442
  1012
* Hyperreal: new method "transfer" that implements the transfer
huffman@17442
  1013
principle of nonstandard analysis. With a subgoal that mentions
huffman@17442
  1014
nonstandard types like "'a star", the command "apply transfer"
huffman@17442
  1015
replaces it with an equivalent one that mentions only standard types.
huffman@17442
  1016
To be successful, all free variables must have standard types; non-
huffman@17442
  1017
standard variables must have explicit universal quantifiers.
huffman@17442
  1018
wenzelm@17641
  1019
* Hyperreal: A theory of Taylor series.
wenzelm@17641
  1020
wenzelm@14655
  1021
wenzelm@14682
  1022
*** HOLCF ***
wenzelm@14682
  1023
wenzelm@17533
  1024
* Discontinued special version of 'constdefs' (which used to support
wenzelm@17533
  1025
continuous functions) in favor of the general Pure one with full
wenzelm@17533
  1026
type-inference.
wenzelm@17533
  1027
wenzelm@17533
  1028
* New simplification procedure for solving continuity conditions; it
wenzelm@17533
  1029
is much faster on terms with many nested lambda abstractions (cubic
huffman@17442
  1030
instead of exponential time).
huffman@17442
  1031
wenzelm@17533
  1032
* New syntax for domain package: selector names are now optional.
huffman@17442
  1033
Parentheses should be omitted unless argument is lazy, for example:
huffman@17442
  1034
huffman@17442
  1035
  domain 'a stream = cons "'a" (lazy "'a stream")
huffman@17442
  1036
wenzelm@17533
  1037
* New command 'fixrec' for defining recursive functions with pattern
wenzelm@17533
  1038
matching; defining multiple functions with mutual recursion is also
wenzelm@17533
  1039
supported.  Patterns may include the constants cpair, spair, up, sinl,
wenzelm@17533
  1040
sinr, or any data constructor defined by the domain package. The given
wenzelm@17533
  1041
equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
wenzelm@17533
  1042
syntax and examples.
wenzelm@17533
  1043
wenzelm@17533
  1044
* New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
wenzelm@17533
  1045
of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
wenzelm@17533
  1046
but the proof obligation additionally includes an admissibility
wenzelm@17533
  1047
requirement. The packages generate instances of class cpo or pcpo,
wenzelm@17533
  1048
with continuity and strictness theorems for Rep and Abs.
huffman@17442
  1049
huffman@17584
  1050
* HOLCF: Many theorems have been renamed according to a more standard naming
huffman@17584
  1051
scheme (INCOMPATIBILITY):
huffman@17584
  1052
huffman@17584
  1053
  foo_inject:  "foo$x = foo$y ==> x = y"
huffman@17584
  1054
  foo_eq:      "(foo$x = foo$y) = (x = y)"
huffman@17584
  1055
  foo_less:    "(foo$x << foo$y) = (x << y)"
huffman@17584
  1056
  foo_strict:  "foo$UU = UU"
huffman@17584
  1057
  foo_defined: "... ==> foo$x ~= UU"
huffman@17584
  1058
  foo_defined_iff: "(foo$x = UU) = (x = UU)"
huffman@17584
  1059
wenzelm@14682
  1060
paulson@14885
  1061
*** ZF ***
paulson@14885
  1062
wenzelm@16234
  1063
* ZF/ex: theories Group and Ring provide examples in abstract algebra,
wenzelm@16234
  1064
including the First Isomorphism Theorem (on quotienting by the kernel
wenzelm@16234
  1065
of a homomorphism).
wenzelm@15089
  1066
wenzelm@15089
  1067
* ZF/Simplifier: install second copy of type solver that actually
wenzelm@16234
  1068
makes use of TC rules declared to Isar proof contexts (or locales);
wenzelm@16234
  1069
the old version is still required for ML proof scripts.
wenzelm@15703
  1070
wenzelm@15703
  1071
wenzelm@17445
  1072
*** Cube ***
wenzelm@17445
  1073
wenzelm@17445
  1074
* Converted to Isar theory format; use locales instead of axiomatic
wenzelm@17445
  1075
theories.
wenzelm@17445
  1076
wenzelm@17445
  1077
wenzelm@15703
  1078
*** ML ***
wenzelm@15703
  1079
wenzelm@15973
  1080
* Pure/library.ML no longer defines its own option datatype, but uses
wenzelm@16234
  1081
that of the SML basis, which has constructors NONE and SOME instead of
wenzelm@16234
  1082
None and Some, as well as exception Option.Option instead of OPTION.
wenzelm@16234
  1083
The functions the, if_none, is_some, is_none have been adapted
wenzelm@16234
  1084
accordingly, while Option.map replaces apsome.
wenzelm@15973
  1085
wenzelm@16860
  1086
* Pure/library.ML: the exception LIST has been given up in favour of
wenzelm@16860
  1087
the standard exceptions Empty and Subscript, as well as
wenzelm@16860
  1088
Library.UnequalLengths.  Function like Library.hd and Library.tl are
wenzelm@16860
  1089
superceded by the standard hd and tl functions etc.
wenzelm@16860
  1090
wenzelm@16860
  1091
A number of basic list functions are no longer exported to the ML
wenzelm@16860
  1092
toplevel, as they are variants of predefined functions.  The following
wenzelm@16234
  1093
suggests how one can translate existing code:
wenzelm@15973
  1094
wenzelm@15973
  1095
    rev_append xs ys = List.revAppend (xs, ys)
wenzelm@15973
  1096
    nth_elem (i, xs) = List.nth (xs, i)
wenzelm@15973
  1097
    last_elem xs = List.last xs
wenzelm@15973
  1098
    flat xss = List.concat xss
wenzelm@16234
  1099
    seq fs = List.app fs
wenzelm@15973
  1100
    partition P xs = List.partition P xs
wenzelm@15973
  1101
    mapfilter f xs = List.mapPartial f xs
wenzelm@15973
  1102
wenzelm@16860
  1103
* Pure/library.ML: several combinators for linear functional
wenzelm@16860
  1104
transformations, notably reverse application and composition:
wenzelm@16860
  1105
wenzelm@17371
  1106
  x |> f                f #> g
wenzelm@17371
  1107
  (x, y) |-> f          f #-> g
wenzelm@16860
  1108
haftmann@17495
  1109
* Pure/library.ML: introduced/changed precedence of infix operators:
haftmann@17495
  1110
haftmann@17495
  1111
  infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
haftmann@17495
  1112
  infix 2 ?;
haftmann@17495
  1113
  infix 3 o oo ooo oooo;
haftmann@17495
  1114
  infix 4 ~~ upto downto;
haftmann@17495
  1115
haftmann@17495
  1116
Maybe INCOMPATIBILITY when any of those is used in conjunction with other
haftmann@17495
  1117
infix operators.
haftmann@17495
  1118
wenzelm@17408
  1119
* Pure/library.ML: natural list combinators fold, fold_rev, and
haftmann@16869
  1120
fold_map support linear functional transformations and nesting.  For
wenzelm@16860
  1121
example:
wenzelm@16860
  1122
wenzelm@16860
  1123
  fold f [x1, ..., xN] y =
wenzelm@16860
  1124
    y |> f x1 |> ... |> f xN
wenzelm@16860
  1125
wenzelm@16860
  1126
  (fold o fold) f [xs1, ..., xsN] y =
wenzelm@16860
  1127
    y |> fold f xs1 |> ... |> fold f xsN
wenzelm@16860
  1128
wenzelm@16860
  1129
  fold f [x1, ..., xN] =
wenzelm@16860
  1130
    f x1 #> ... #> f xN
wenzelm@16860
  1131
wenzelm@16860
  1132
  (fold o fold) f [xs1, ..., xsN] =
wenzelm@16860
  1133
    fold f xs1 #> ... #> fold f xsN
wenzelm@16860
  1134
wenzelm@17408
  1135
* Pure/library.ML: the following selectors on type 'a option are
wenzelm@17408
  1136
available:
wenzelm@17408
  1137
wenzelm@17408
  1138
  the:               'a option -> 'a  (*partial*)
wenzelm@17408
  1139
  these:             'a option -> 'a  where 'a = 'b list
haftmann@17402
  1140
  the_default: 'a -> 'a option -> 'a
haftmann@17402
  1141
  the_list:          'a option -> 'a list
haftmann@17402
  1142
wenzelm@17408
  1143
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides
wenzelm@17408
  1144
basic operations for association lists, following natural argument
haftmann@17564
  1145
order; moreover the explicit equality predicate passed here avoids
haftmann@17495
  1146
potentially expensive polymorphic runtime equality checks.
haftmann@17495
  1147
The old functions may be expressed as follows:
wenzelm@17408
  1148
wenzelm@17408
  1149
  assoc = uncurry (AList.lookup (op =))
wenzelm@17408
  1150
  assocs = these oo AList.lookup (op =)
wenzelm@17408
  1151
  overwrite = uncurry (AList.update (op =)) o swap
wenzelm@17408
  1152
haftmann@17564
  1153
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides
haftmann@17564
  1154
haftmann@17564
  1155
  val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
haftmann@17564
  1156
  val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
haftmann@17564
  1157
haftmann@17564
  1158
replacing make_keylist and keyfilter (occassionally used)
haftmann@17564
  1159
Naive rewrites:
haftmann@17564
  1160
haftmann@17564
  1161
  make_keylist = AList.make
haftmann@17564
  1162
  keyfilter = AList.find (op =)
haftmann@17564
  1163
haftmann@17564
  1164
* eq_fst and eq_snd now take explicit equality parameter, thus
haftmann@17564
  1165
  avoiding eqtypes. Naive rewrites:
haftmann@17564
  1166
haftmann@17564
  1167
    eq_fst = eq_fst (op =)
haftmann@17564
  1168
    eq_snd = eq_snd (op =)
haftmann@17564
  1169
haftmann@17564
  1170
* Removed deprecated apl and apr (rarely used).
haftmann@17564
  1171
  Naive rewrites:
haftmann@17564
  1172
haftmann@17564
  1173
    apl (n, op) =>>= curry op n
haftmann@17564
  1174
    apr (op, m) =>>= fn n => op (n, m)
haftmann@17564
  1175
wenzelm@17408
  1176
* Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
wenzelm@17408
  1177
provides a reasonably efficient light-weight implementation of sets as
wenzelm@17408
  1178
lists.
wenzelm@17408
  1179
wenzelm@17408
  1180
* Pure/General: generic tables (cf. Pure/General/table.ML) provide a
wenzelm@17408
  1181
few new operations; existing lookup and update are now curried to
wenzelm@17408
  1182
follow natural argument order (for use with fold etc.);
wenzelm@17408
  1183
INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
wenzelm@17408
  1184
wenzelm@17408
  1185
* Pure/General: output via the Isabelle channels of
wenzelm@17408
  1186
writeln/warning/error etc. is now passed through Output.output, with a
wenzelm@17408
  1187
hook for arbitrary transformations depending on the print_mode
wenzelm@17408
  1188
(cf. Output.add_mode -- the first active mode that provides a output
wenzelm@17408
  1189
function wins).  Already formatted output may be embedded into further
wenzelm@17408
  1190
text via Output.raw; the result of Pretty.string_of/str_of and derived
wenzelm@17408
  1191
functions (string_of_term/cterm/thm etc.) is already marked raw to
wenzelm@17408
  1192
accommodate easy composition of diagnostic messages etc.  Programmers
wenzelm@17408
  1193
rarely need to care about Output.output or Output.raw at all, with
wenzelm@17408
  1194
some notable exceptions: Output.output is required when bypassing the
wenzelm@17408
  1195
standard channels (writeln etc.), or in token translations to produce
wenzelm@17408
  1196
properly formatted results; Output.raw is required when capturing
wenzelm@17408
  1197
already output material that will eventually be presented to the user
wenzelm@17408
  1198
a second time.  For the default print mode, both Output.output and
wenzelm@17408
  1199
Output.raw have no effect.
wenzelm@17408
  1200
wenzelm@17408
  1201
* Pure/General: Output.time_accumulator NAME creates an operator ('a
wenzelm@17408
  1202
-> 'b) -> 'a -> 'b to measure runtime and count invocations; the
wenzelm@17408
  1203
cumulative results are displayed at the end of a batch session.
wenzelm@17408
  1204
wenzelm@17408
  1205
* Pure/General: File.sysify_path and File.quote_sysify path have been
wenzelm@17408
  1206
replaced by File.platform_path and File.shell_path (with appropriate
wenzelm@17408
  1207
hooks).  This provides a clean interface for unusual systems where the
wenzelm@17408
  1208
internal and external process view of file names are different.
wenzelm@17408
  1209
wenzelm@16689
  1210
* Pure: more efficient orders for basic syntactic entities: added
wenzelm@16689
  1211
fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
wenzelm@16689
  1212
and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
wenzelm@16689
  1213
NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
wenzelm@16689
  1214
orders now -- potential INCOMPATIBILITY for code that depends on a
wenzelm@16689
  1215
particular order for Symtab.keys, Symtab.dest, etc. (consider using
wenzelm@16689
  1216
Library.sort_strings on result).
wenzelm@16689
  1217
wenzelm@17408
  1218
* Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
wenzelm@17408
  1219
fold_types traverse types/terms from left to right, observing natural
wenzelm@17408
  1220
argument order.  Supercedes previous foldl_XXX versions, add_frees,
wenzelm@17408
  1221
add_vars etc. have been adapted as well: INCOMPATIBILITY.
wenzelm@17408
  1222
wenzelm@16151
  1223
* Pure: name spaces have been refined, with significant changes of the
wenzelm@16234
  1224
internal interfaces -- INCOMPATIBILITY.  Renamed cond_extern(_table)
wenzelm@16234
  1225
to extern(_table).  The plain name entry path is superceded by a
wenzelm@16234
  1226
general 'naming' context, which also includes the 'policy' to produce
wenzelm@16234
  1227
a fully qualified name and external accesses of a fully qualified
wenzelm@16234
  1228
name; NameSpace.extend is superceded by context dependent
wenzelm@16234
  1229
Sign.declare_name.  Several theory and proof context operations modify
wenzelm@16234
  1230
the naming context.  Especially note Theory.restore_naming and
wenzelm@16234
  1231
ProofContext.restore_naming to get back to a sane state; note that
wenzelm@16234
  1232
Theory.add_path is no longer sufficient to recover from
wenzelm@16234
  1233
Theory.absolute_path in particular.
wenzelm@16234
  1234
wenzelm@16234
  1235
* Pure: new flags short_names (default false) and unique_names
wenzelm@16234
  1236
(default true) for controlling output of qualified names.  If
wenzelm@16234
  1237
short_names is set, names are printed unqualified.  If unique_names is
wenzelm@16234
  1238
reset, the name prefix is reduced to the minimum required to achieve
wenzelm@16234
  1239
the original result when interning again, even if there is an overlap
wenzelm@16234
  1240
with earlier declarations.
wenzelm@16151
  1241
wenzelm@16456
  1242
* Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
wenzelm@16456
  1243
now 'extend', and 'merge' gets an additional Pretty.pp argument
wenzelm@16456
  1244
(useful for printing error messages).  INCOMPATIBILITY.
wenzelm@16456
  1245
wenzelm@16456
  1246
* Pure: major reorganization of the theory context.  Type Sign.sg and
wenzelm@16456
  1247
Theory.theory are now identified, referring to the universal
wenzelm@16456
  1248
Context.theory (see Pure/context.ML).  Actual signature and theory
wenzelm@16456
  1249
content is managed as theory data.  The old code and interfaces were
wenzelm@16456
  1250
spread over many files and structures; the new arrangement introduces
wenzelm@16456
  1251
considerable INCOMPATIBILITY to gain more clarity:
wenzelm@16456
  1252
wenzelm@16456
  1253
  Context -- theory management operations (name, identity, inclusion,
wenzelm@16456
  1254
    parents, ancestors, merge, etc.), plus generic theory data;
wenzelm@16456
  1255
wenzelm@16456
  1256
  Sign -- logical signature and syntax operations (declaring consts,
wenzelm@16456
  1257
    types, etc.), plus certify/read for common entities;
wenzelm@16456
  1258
wenzelm@16456
  1259
  Theory -- logical theory operations (stating axioms, definitions,
wenzelm@16456
  1260
    oracles), plus a copy of logical signature operations (consts,
wenzelm@16456
  1261
    types, etc.); also a few basic management operations (Theory.copy,
wenzelm@16456
  1262
    Theory.merge, etc.)
wenzelm@16456
  1263
wenzelm@16456
  1264
The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
wenzelm@16456
  1265
etc.) as well as the sign field in Thm.rep_thm etc. have been retained
wenzelm@16456
  1266
for convenience -- they merely return the theory.
wenzelm@16456
  1267
wenzelm@17193
  1268
* Pure: type Type.tsig is superceded by theory in most interfaces.
wenzelm@17193
  1269
wenzelm@16547
  1270
* Pure: the Isar proof context type is already defined early in Pure
wenzelm@16547
  1271
as Context.proof (note that ProofContext.context and Proof.context are
wenzelm@16547
  1272
aliases, where the latter is the preferred name).  This enables other
wenzelm@16547
  1273
Isabelle components to refer to that type even before Isar is present.
wenzelm@16547
  1274
wenzelm@16373
  1275
* Pure/sign/theory: discontinued named name spaces (i.e. classK,
wenzelm@16373
  1276
typeK, constK, axiomK, oracleK), but provide explicit operations for
wenzelm@16373
  1277
any of these kinds.  For example, Sign.intern typeK is now
wenzelm@16373
  1278
Sign.intern_type, Theory.hide_space Sign.typeK is now
wenzelm@16373
  1279
Theory.hide_types.  Also note that former
wenzelm@16373
  1280
Theory.hide_classes/types/consts are now
wenzelm@16373
  1281
Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
wenzelm@16373
  1282
internalize their arguments!  INCOMPATIBILITY.
wenzelm@16373
  1283
wenzelm@16506
  1284
* Pure: get_thm interface (of PureThy and ProofContext) expects
wenzelm@16506
  1285
datatype thmref (with constructors Name and NameSelection) instead of
wenzelm@16506
  1286
plain string -- INCOMPATIBILITY;
wenzelm@16506
  1287
wenzelm@16151
  1288
* Pure: cases produced by proof methods specify options, where NONE
wenzelm@16234
  1289
means to remove case bindings -- INCOMPATIBILITY in
wenzelm@16234
  1290
(RAW_)METHOD_CASES.
wenzelm@16151
  1291
wenzelm@16373
  1292
* Pure: the following operations retrieve axioms or theorems from a
wenzelm@16373
  1293
theory node or theory hierarchy, respectively:
wenzelm@16373
  1294
wenzelm@16373
  1295
  Theory.axioms_of: theory -> (string * term) list
wenzelm@16373
  1296
  Theory.all_axioms_of: theory -> (string * term) list
wenzelm@16373
  1297
  PureThy.thms_of: theory -> (string * thm) list
wenzelm@16373
  1298
  PureThy.all_thms_of: theory -> (string * thm) list
wenzelm@16373
  1299
wenzelm@16718
  1300
* Pure: print_tac now outputs the goal through the trace channel.
wenzelm@16718
  1301
wenzelm@17408
  1302
* Isar toplevel: improved diagnostics, mostly for Poly/ML only.
wenzelm@17408
  1303
Reference Toplevel.debug (default false) controls detailed printing
wenzelm@17408
  1304
and tracing of low-level exceptions; Toplevel.profiling (default 0)
wenzelm@17408
  1305
controls execution profiling -- set to 1 for time and 2 for space
wenzelm@17408
  1306
(both increase the runtime).
wenzelm@17408
  1307
wenzelm@17408
  1308
* Isar session: The initial use of ROOT.ML is now always timed,
wenzelm@17408
  1309
i.e. the log will show the actual process times, in contrast to the
wenzelm@17408
  1310
elapsed wall-clock time that the outer shell wrapper produces.
wenzelm@17408
  1311
wenzelm@17408
  1312
* Simplifier: improved handling of bound variables (nameless
wenzelm@16997
  1313
representation, avoid allocating new strings).  Simprocs that invoke
wenzelm@16997
  1314
the Simplifier recursively should use Simplifier.inherit_bounds to
wenzelm@17720
  1315
avoid local name clashes.  Failure to do so produces warnings
wenzelm@17720
  1316
"Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
wenzelm@17720
  1317
for further details.
wenzelm@16234
  1318
wenzelm@17166
  1319
* ML functions legacy_bindings and use_legacy_bindings produce ML fact
wenzelm@17166
  1320
bindings for all theorems stored within a given theory; this may help
wenzelm@17166
  1321
in porting non-Isar theories to Isar ones, while keeping ML proof
wenzelm@17166
  1322
scripts for the time being.
wenzelm@17166
  1323
wenzelm@17457
  1324
* ML operator HTML.with_charset specifies the charset begin used for
wenzelm@17457
  1325
generated HTML files.  For example:
wenzelm@17457
  1326
wenzelm@17457
  1327
  HTML.with_charset "utf-8" use_thy "Hebrew";
wenzelm@17538
  1328
  HTML.with_charset "utf-8" use_thy "Chinese";
wenzelm@17457
  1329
wenzelm@16234
  1330
wenzelm@16234
  1331
*** System ***
wenzelm@16234
  1332
wenzelm@16234
  1333
* Allow symlinks to all proper Isabelle executables (Isabelle,
wenzelm@16234
  1334
isabelle, isatool etc.).
wenzelm@16234
  1335
wenzelm@16234
  1336
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for
wenzelm@16234
  1337
isatool doc, isatool mkdir, display_drafts etc.).
wenzelm@16234
  1338
wenzelm@16234
  1339
* isatool usedir: option -f allows specification of the ML file to be
wenzelm@16234
  1340
used by Isabelle; default is ROOT.ML.
wenzelm@16234
  1341
wenzelm@16251
  1342
* New isatool version outputs the version identifier of the Isabelle
wenzelm@16251
  1343
distribution being used.
wenzelm@16251
  1344
wenzelm@16251
  1345
* HOL: new isatool dimacs2hol converts files in DIMACS CNF format
wenzelm@16234
  1346
(containing Boolean satisfiability problems) into Isabelle/HOL
wenzelm@16234
  1347
theories.
wenzelm@15703
  1348
wenzelm@15703
  1349
wenzelm@14655
  1350
wenzelm@14606
  1351
New in Isabelle2004 (April 2004)
wenzelm@14606
  1352
--------------------------------
wenzelm@13280
  1353
skalberg@14171
  1354
*** General ***
skalberg@14171
  1355
ballarin@14398
  1356
* Provers/order.ML:  new efficient reasoner for partial and linear orders.
ballarin@14398
  1357
  Replaces linorder.ML.
ballarin@14398
  1358
wenzelm@14606
  1359
* Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
wenzelm@14606
  1360
  (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
skalberg@14173
  1361
  (\<a>...\<z>), are now considered normal letters, and can therefore
skalberg@14173
  1362
  be used anywhere where an ASCII letter (a...zA...Z) has until
skalberg@14173
  1363
  now. COMPATIBILITY: This obviously changes the parsing of some
skalberg@14173
  1364
  terms, especially where a symbol has been used as a binder, say
skalberg@14173
  1365
  '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
skalberg@14173
  1366
  as an identifier.  Fix it by inserting a space around former
skalberg@14173
  1367
  symbols.  Call 'isatool fixgreek' to try to fix parsing errors in
skalberg@14173
  1368
  existing theory and ML files.
skalberg@14171
  1369
paulson@14237
  1370
* Pure: Macintosh and Windows line-breaks are now allowed in theory files.
paulson@14237
  1371
wenzelm@14731
  1372
* Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
wenzelm@14731
  1373
  allowed in identifiers. Similar to Greek letters \<^isub> is now considered
wenzelm@14731
  1374
  a normal (but invisible) letter. For multiple letter subscripts repeat
wenzelm@14731
  1375
  \<^isub> like this: x\<^isub>1\<^isub>2.
kleing@14233
  1376
kleing@14333
  1377
* Pure: There are now sub-/superscripts that can span more than one
kleing@14333
  1378
  character. Text between \<^bsub> and \<^esub> is set in subscript in
wenzelm@14606
  1379
  ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
wenzelm@14606
  1380
  superscript. The new control characters are not identifier parts.
kleing@14333
  1381
schirmer@14561
  1382
* Pure: Control-symbols of the form \<^raw:...> will literally print the
wenzelm@14606
  1383
  content of "..." to the latex file instead of \isacntrl... . The "..."
wenzelm@14606
  1384
  may consist of any printable characters excluding the end bracket >.
schirmer@14361
  1385
paulson@14237
  1386
* Pure: Using new Isar command "finalconsts" (or the ML functions
paulson@14237
  1387
  Theory.add_finals or Theory.add_finals_i) it is now possible to
paulson@14237
  1388
  declare constants "final", which prevents their being given a definition
paulson@14237
  1389
  later.  It is useful for constants whose behaviour is fixed axiomatically
skalberg@14224
  1390
  rather than definitionally, such as the meta-logic connectives.
skalberg@14224
  1391
wenzelm@14606
  1392
* Pure: 'instance' now handles general arities with general sorts
wenzelm@14606
  1393
  (i.e. intersections of classes),
skalberg@14503
  1394
kleing@14547
  1395
* Presentation: generated HTML now uses a CSS style sheet to make layout
wenzelm@14731
  1396
  (somewhat) independent of content. It is copied from lib/html/isabelle.css.
kleing@14547
  1397
  It can be changed to alter the colors/layout of generated pages.
kleing@14547
  1398
wenzelm@14556
  1399
ballarin@14175
  1400
*** Isar ***
ballarin@14175
  1401
ballarin@14508
  1402
* Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
ballarin@14508
  1403
  cut_tac, subgoal_tac and thin_tac:
ballarin@14175
  1404
  - Now understand static (Isar) contexts.  As a consequence, users of Isar
ballarin@14175
  1405
    locales are no longer forced to write Isar proof scripts.
ballarin@14175
  1406
    For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
ballarin@14175
  1407
    emulations.
ballarin@14175
  1408
  - INCOMPATIBILITY: names of variables to be instantiated may no
ballarin@14211
  1409
    longer be enclosed in quotes.  Instead, precede variable name with `?'.
ballarin@14211
  1410
    This is consistent with the instantiation attribute "where".
ballarin@14211
  1411
ballarin@14257
  1412
* Attributes "where" and "of":
ballarin@14285
  1413
  - Now take type variables of instantiated theorem into account when reading
ballarin@14285
  1414
    the instantiation string.  This fixes a bug that caused instantiated
ballarin@14285
  1415
    theorems to have too special types in some circumstances.
ballarin@14285
  1416
  - "where" permits explicit instantiations of type variables.
ballarin@14257
  1417
wenzelm@14556
  1418
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm@14556
  1419
  current facts ("this"), admitting arbitrary combinations with "then"
wenzelm@14556
  1420
  and derived forms.
kleing@14283
  1421
ballarin@14211
  1422
* Locales:
ballarin@14211
  1423
  - Goal statements involving the context element "includes" no longer
ballarin@14211
  1424
    generate theorems with internal delta predicates (those ending on
ballarin@14211
  1425
    "_axioms") in the premise.
ballarin@14211
  1426
    Resolve particular premise with <locale>.intro to obtain old form.
ballarin@14211
  1427
  - Fixed bug in type inference ("unify_frozen") that prevented mix of target
ballarin@14211
  1428
    specification and "includes" elements in goal statement.
ballarin@14254
  1429
  - Rule sets <locale>.intro and <locale>.axioms no longer declared as
ballarin@14254
  1430
    [intro?] and [elim?] (respectively) by default.
ballarin@14508
  1431
  - Experimental command for instantiation of locales in proof contexts:
ballarin@14551
  1432
        instantiate <label>[<attrs>]: <loc>
ballarin@14508
  1433
    Instantiates locale <loc> and adds all its theorems to the current context
ballarin@14551
  1434
    taking into account their attributes.  Label and attrs are optional
ballarin@14551
  1435
    modifiers, like in theorem declarations.  If present, names of
ballarin@14551
  1436
    instantiated theorems are qualified with <label>, and the attributes
ballarin@14551
  1437
    <attrs> are applied after any attributes these theorems might have already.
ballarin@14551
  1438
      If the locale has assumptions, a chained fact of the form
ballarin@14508
  1439
    "<loc> t1 ... tn" is expected from which instantiations of the parameters
ballarin@14551
  1440
    are derived.  The command does not support old-style locales declared
ballarin@14551
  1441
    with "locale (open)".
ballarin@14551
  1442
      A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
ballarin@14175
  1443
ballarin@14175
  1444
* HOL: Tactic emulation methods induct_tac and case_tac understand static
ballarin@14175
  1445
  (Isar) contexts.
ballarin@14175
  1446
wenzelm@14556
  1447
kleing@14136
  1448
*** HOL ***
kleing@14136
  1449
kleing@14624
  1450
* Proof import: new image HOL4 contains the imported library from
kleing@14624
  1451
  the HOL4 system with about 2500 theorems. It is imported by
kleing@14624
  1452
  replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
kleing@14624
  1453
  can be used like any other Isabelle image.  See
kleing@14624
  1454
  HOL/Import/HOL/README for more information.
kleing@14624
  1455
ballarin@14398
  1456
* Simplifier:
ballarin@14398
  1457
  - Much improved handling of linear and partial orders.
ballarin@14398
  1458
    Reasoners for linear and partial orders are set up for type classes
ballarin@14398
  1459
    "linorder" and "order" respectively, and are added to the default simpset
ballarin@14398
  1460
    as solvers.  This means that the simplifier can build transitivity chains
ballarin@14398
  1461
    to solve goals from the assumptions.
ballarin@14398
  1462
  - INCOMPATIBILITY: old proofs break occasionally.  Typically, applications
ballarin@14398
  1463
    of blast or auto after simplification become unnecessary because the goal
ballarin@14398
  1464
    is solved by simplification already.
ballarin@14398
  1465
wenzelm@14731
  1466
* Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
paulson@14389
  1467
    all proved in axiomatic type classes for semirings, rings and fields.
paulson@14389
  1468
paulson@14389
  1469
* Numerics:
paulson@14389
  1470
  - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
wenzelm@14731
  1471
    now formalized using the Ring_and_Field theory mentioned above.
paulson@14389
  1472
  - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
paulson@14389
  1473
    than before, because now they are set up once in a generic manner.
wenzelm@14731
  1474
  - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
paulson@14480
  1475
    Look for the general versions in Ring_and_Field (and Power if they concern
paulson@14480
  1476
    exponentiation).
paulson@14389
  1477
paulson@14401
  1478
* Type "rat" of the rational numbers is now available in HOL-Complex.
paulson@14389
  1479
schirmer@14255
  1480
* Records:
schirmer@14255
  1481
  - Record types are now by default printed with their type abbreviation
schirmer@14255
  1482
    instead of the list of all field types. This can be configured via
schirmer@14255
  1483
    the reference "print_record_type_abbr".
wenzelm@14731
  1484
  - Simproc "record_upd_simproc" for simplification of multiple updates added
schirmer@14255
  1485
    (not enabled by default).
schirmer@14427
  1486
  - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
schirmer@14427
  1487
    EX x. x = sel r to True (not enabled by default).
schirmer@14255
  1488
  - Tactic "record_split_simp_tac" to split and simplify records added.
wenzelm@14731
  1489
kleing@14136
  1490
* 'specification' command added, allowing for definition by
skalberg@14224
  1491
  specification.  There is also an 'ax_specification' command that
skalberg@14224
  1492
  introduces the new constants axiomatically.
kleing@14136
  1493
nipkow@14375
  1494
* arith(_tac) is now able to generate counterexamples for reals as well.
nipkow@14375
  1495
ballarin@14399
  1496
* HOL-Algebra: new locale "ring" for non-commutative rings.
ballarin@14399
  1497
paulson@14243
  1498
* HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
kleing@14610
  1499
  definitions, thanks to Sava Krsti\'{c} and John Matthews.
kleing@14610
  1500
wenzelm@14731
  1501
* HOL-Matrix: a first theory for matrices in HOL with an application of
kleing@14610
  1502
  matrix theory to linear programming.
kleing@14136
  1503
nipkow@14380
  1504
* Unions and Intersections:
nipkow@15119
  1505
  The latex output syntax of UN and INT has been changed
nipkow@15119
  1506
  from "\Union x \in A. B" to "\Union_{x \in A} B"
nipkow@15119
  1507
  i.e. the index formulae has become a subscript.
nipkow@15119
  1508
  Similarly for "\Union x. B", and for \Inter instead of \Union.
nipkow@14380
  1509
kleing@14418
  1510
* Unions and Intersections over Intervals:
wenzelm@14731
  1511
  There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
wenzelm@14731
  1512
  also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
kleing@14418
  1513
  like in normal math, and corresponding versions for < and for intersection.
kleing@14418
  1514
nipkow@15677
  1515
* HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
nipkow@15677
  1516
  lexicographic dictonary ordering has been added as "lexord".
nipkow@15677
  1517
paulson@14401
  1518
* ML: the legacy theory structures Int and List have been removed. They had
paulson@14401
  1519
  conflicted with ML Basis Library structures having the same names.
nipkow@14380
  1520
webertj@14464
  1521
* 'refute' command added to search for (finite) countermodels.  Only works
webertj@14464
  1522
  for a fragment of HOL.  The installation of an external SAT solver is
webertj@14464
  1523
  highly recommended.  See "HOL/Refute.thy" for details.
webertj@14464
  1524
berghofe@14602
  1525
* 'quickcheck' command: Allows to find counterexamples by evaluating
berghofe@14602
  1526
  formulae under an assignment of free variables to random values.
berghofe@14602
  1527
  In contrast to 'refute', it can deal with inductive datatypes,
berghofe@14602
  1528
  but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
berghofe@14602
  1529
  for examples.
webertj@14464
  1530
wenzelm@14606
  1531
oheimb@14536
  1532
*** HOLCF ***
oheimb@14536
  1533
oheimb@14536
  1534
* Streams now come with concatenation and are part of the HOLCF image
oheimb@14536
  1535
wenzelm@14572
  1536
wenzelm@14572
  1537
kleing@14136
  1538
New in Isabelle2003 (May 2003)
wenzelm@14606
  1539
------------------------------
kleing@14136
  1540
wenzelm@13280
  1541
*** General ***
wenzelm@13280
  1542
berghofe@13618
  1543
* Provers/simplifier:
berghofe@13618
  1544
nipkow@13781
  1545
  - Completely reimplemented method simp (ML: Asm_full_simp_tac):
berghofe@13618
  1546
    Assumptions are now subject to complete mutual simplification,
berghofe@13618
  1547
    not just from left to right. The simplifier now preserves
berghofe@13618
  1548
    the order of assumptions.
berghofe@13618
  1549
berghofe@13618
  1550
    Potential INCOMPATIBILITY:
berghofe@13618
  1551
nipkow@13781
  1552
    -- simp sometimes diverges where the old version did
nipkow@13781
  1553
       not, e.g. invoking simp on the goal
berghofe@13618
  1554
berghofe@13618
  1555
        [| P (f x); y = x; f x = f y |] ==> Q
berghofe@13618
  1556
nipkow@13781
  1557
       now gives rise to the infinite reduction sequence
nipkow@13781
  1558
nipkow@13781
  1559
        P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
nipkow@13781
  1560
nipkow@13781
  1561
       Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
nipkow@13781
  1562
       kind of problem.
nipkow@13781
  1563
nipkow@13781
  1564
    -- Tactics combining classical reasoner and simplification (such as auto)
nipkow@13781
  1565
       are also affected by this change, because many of them rely on
nipkow@13781
  1566
       simp. They may sometimes diverge as well or yield a different numbers
nipkow@13781
  1567
       of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
nipkow@13781
  1568
       in case of problems. Sometimes subsequent calls to the classical
nipkow@13781
  1569
       reasoner will fail because a preceeding call to the simplifier too
nipkow@13781
  1570
       eagerly simplified the goal, e.g. deleted redundant premises.
berghofe@13618
  1571
berghofe@13618
  1572
  - The simplifier trace now shows the names of the applied rewrite rules
berghofe@13618
  1573
nipkow@13829
  1574
  - You can limit the number of recursive invocations of the simplifier
nipkow@13829
  1575
    during conditional rewriting (where the simplifie tries to solve the
nipkow@13829
  1576
    conditions before applying the rewrite rule):
nipkow@13829
  1577
    ML "simp_depth_limit := n"
nipkow@13829
  1578
    where n is an integer. Thus you can force termination where previously
nipkow@13829
  1579
    the simplifier would diverge.
nipkow@13829
  1580
ballarin@13835
  1581
  - Accepts free variables as head terms in congruence rules.  Useful in Isar.
nipkow@13829
  1582
ballarin@13938
  1583
  - No longer aborts on failed congruence proof.  Instead, the
ballarin@13938
  1584
    congruence is ignored.
ballarin@13938
  1585
berghofe@14008
  1586
* Pure: New generic framework for extracting programs from constructive
berghofe@14008
  1587
  proofs. See HOL/Extraction.thy for an example instantiation, as well
berghofe@14008
  1588
  as HOL/Extraction for some case studies.
berghofe@14008
  1589
nipkow@13868
  1590
* Pure: The main goal of the proof state is no longer shown by default, only
nipkow@13868
  1591
the subgoals. This behaviour is controlled by a new flag.
ballarin@13835
  1592
   PG menu: Isabelle/Isar -> Settings -> Show Main Goal
nipkow@13815
  1593
(ML: Proof.show_main_goal).
nipkow@13815
  1594
nipkow@13815
  1595
* Pure: You can find all matching introduction rules for subgoal 1, i.e. all
nipkow@13815
  1596
rules whose conclusion matches subgoal 1:
nipkow@13815
  1597
      PG menu: Isabelle/Isar -> Show me -> matching rules
nipkow@13815
  1598
The rules are ordered by how closely they match the subgoal.
nipkow@13815
  1599
In particular, rules that solve a subgoal outright are displayed first
nipkow@13815
  1600
(or rather last, the way they are printed).
nipkow@13815
  1601
(ML: ProofGeneral.print_intros())
nipkow@13815
  1602
nipkow@13815
  1603
* Pure: New flag trace_unify_fail causes unification to print
nipkow@13781
  1604
diagnostic information (PG: in trace buffer) when it fails. This is
nipkow@13781
  1605
useful for figuring out why single step proofs like rule, erule or
nipkow@13781
  1606
assumption failed.
nipkow@13781
  1607
nipkow@13815
  1608
* Pure: Locale specifications now produce predicate definitions
wenzelm@13410
  1609
according to the body of text (covering assumptions modulo local
wenzelm@13410
  1610
definitions); predicate "loc_axioms" covers newly introduced text,
wenzelm@13410
  1611
while "loc" is cumulative wrt. all included locale expressions; the
wenzelm@13410
  1612
latter view is presented only on export into the global theory
wenzelm@13410
  1613
context; potential INCOMPATIBILITY, use "(open)" option to fall back
wenzelm@13410
  1614
on the old view without predicates;
wenzelm@13410
  1615
wenzelm@13459
  1616
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm@13459
  1617
parameters (as in CASL, for example); just specify something like
wenzelm@13459
  1618
``var x + var y + struct M'' as import;
wenzelm@13459
  1619
wenzelm@13463
  1620
* Pure: improved thms_containing: proper indexing of facts instead of
wenzelm@13463
  1621
raw theorems; check validity of results wrt. current name space;
wenzelm@13463
  1622
include local facts of proof configuration (also covers active
wenzelm@13541
  1623
locales), cover fixed variables in index; may use "_" in term
wenzelm@13541
  1624
specification; an optional limit for the number of printed facts may
wenzelm@13541
  1625
be given (the default is 40);
wenzelm@13541
  1626
wenzelm@13541
  1627
* Pure: disallow duplicate fact bindings within new-style theory files
wenzelm@13541
  1628
(batch-mode only);
wenzelm@13540
  1629
wenzelm@13463
  1630
* Provers: improved induct method: assumptions introduced by case
wenzelm@13463
  1631
"foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
wenzelm@13463
  1632
the goal statement); "foo" still refers to all facts collectively;
wenzelm@13463
  1633
paulson@13550
  1634
* Provers: the function blast.overloaded has been removed: all constants
paulson@13550
  1635
are regarded as potentially overloaded, which improves robustness in exchange
paulson@13550
  1636
for slight decrease in efficiency;
paulson@13550
  1637
nipkow@13781
  1638
* Provers/linorder: New generic prover for transitivity reasoning over
nipkow@13781
  1639
linear orders.  Note: this prover is not efficient!
nipkow@13781
  1640
wenzelm@13522
  1641
* Isar: preview of problems to finish 'show' now produce an error
wenzelm@13522
  1642
rather than just a warning (in interactive mode);
wenzelm@13522
  1643
wenzelm@13280
  1644
nipkow@13158
  1645
*** HOL ***
nipkow@13158
  1646
nipkow@13899
  1647
* arith(_tac)
nipkow@13899
  1648
nipkow@13899
  1649
 - Produces a counter example if it cannot prove a goal.
nipkow@13899
  1650
   Note that the counter example may be spurious if the goal is not a formula
nipkow@13899
  1651
   of quantifier-free linear arithmetic.
nipkow@13899
  1652
   In ProofGeneral the counter example appears in the trace buffer.
nipkow@13899
  1653
nipkow@13899
  1654
 - Knows about div k and mod k where k is a numeral of type nat or int.
nipkow@13899
  1655
nipkow@13899
  1656
 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
nipkow@13899
  1657
   linear arithmetic fails. This takes account of quantifiers and divisibility.
wenzelm@14731
  1658
   Presburger arithmetic can also be called explicitly via presburger(_tac).
nipkow@13899
  1659
nipkow@13899
  1660
* simp's arithmetic capabilities have been enhanced a bit: it now
nipkow@13899
  1661
takes ~= in premises into account (by performing a case split);
nipkow@13899
  1662
nipkow@13899
  1663
* simp reduces "m*(n div m) + n mod m" to n, even if the two summands
nipkow@13899
  1664
are distributed over a sum of terms;
nipkow@13899
  1665
ballarin@13735
  1666
* New tactic "trans_tac" and method "trans" instantiate
ballarin@13735
  1667
Provers/linorder.ML for axclasses "order" and "linorder" (predicates
wenzelm@14731
  1668
"<=", "<" and "=").
wenzelm@14731
  1669
wenzelm@14731
  1670
* function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
paulson@13587
  1671
HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
paulson@13587
  1672
wenzelm@13443
  1673
* 'typedef' command has new option "open" to suppress the set
wenzelm@13443
  1674
definition;
wenzelm@13443
  1675
wenzelm@13522
  1676
* functions Min and Max on finite sets have been introduced (theory
wenzelm@13522
  1677
Finite_Set);
nipkow@13492
  1678
wenzelm@13443
  1679
* attribute [symmetric] now works for relations as well; it turns
wenzelm@13443
  1680
(x,y) : R^-1 into (y,x) : R, and vice versa;
wenzelm@13443
  1681
nipkow@13613
  1682
* induct over a !!-quantified statement (say !!x1..xn):
nipkow@13613
  1683
  each "case" automatically performs "fix x1 .. xn" with exactly those names.
nipkow@13613
  1684
nipkow@13899
  1685
* Map: `empty' is no longer a constant but a syntactic abbreviation for
nipkow@13899
  1686
%x. None. Warning: empty_def now refers to the previously hidden definition
nipkow@13899
  1687
of the empty set.
nipkow@13899
  1688
ballarin@14018
  1689
* Algebra: formalization of classical algebra.  Intended as base for
ballarin@14018
  1690
any algebraic development in Isabelle.  Currently covers group theory
ballarin@14018
  1691
(up to Sylow's theorem) and ring theory (Universal Property of
ballarin@14018
  1692
Univariate Polynomials).  Contributions welcome;
paulson@13960
  1693
paulson@13960
  1694
* GroupTheory: deleted, since its material has been moved to Algebra;
paulson@13960
  1695
wenzelm@14731
  1696
* Complex: new directory of the complex numbers with numeric constants,
wenzelm@14731
  1697
nonstandard complex numbers, and some complex analysis, standard and
paulson@13966
  1698
nonstandard (Jacques Fleuriot);
paulson@13966
  1699
paulson@13966
  1700
* HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
paulson@13966
  1701
wenzelm@14731
  1702
* Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
paulson@13966
  1703
Fleuriot);
paulson@13960
  1704
wenzelm@13549
  1705
* Real/HahnBanach: updated and adapted to locales;
wenzelm@13549
  1706
ballarin@13995
  1707
* NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
ballarin@13995
  1708
Gray and Kramer);
paulson@13872
  1709
paulson@13872
  1710
* UNITY: added the Meier-Sanders theory of progress sets;
paulson@13872
  1711
kleing@14011
  1712
* MicroJava: bytecode verifier and lightweight bytecode verifier
kleing@14011
  1713
as abstract algorithms, instantiated to the JVM;
kleing@14011
  1714
schirmer@14010
  1715
* Bali: Java source language formalization. Type system, operational
schirmer@14010
  1716
semantics, axiomatic semantics. Supported language features:
schirmer@14010
  1717
classes, interfaces, objects,virtual methods, static methods,
schirmer@14010
  1718
static/instance fields, arrays, access modifiers, definite
schirmer@14010
  1719
assignment, exceptions.
wenzelm@13549
  1720
kleing@14011
  1721
wenzelm@13549
  1722
*** ZF ***
wenzelm@13549
  1723
webertj@15154
  1724
* ZF/Constructible: consistency proof for AC (Gdel's constructible
wenzelm@13549
  1725
universe, etc.);
wenzelm@13549
  1726
paulson@13872
  1727
* Main ZF: virtually all theories converted to new-style format;
nipkow@13518
  1728
wenzelm@13280
  1729
wenzelm@13478
  1730
*** ML ***
wenzelm@13478
  1731
wenzelm@13478
  1732
* Pure: Tactic.prove provides sane interface for internal proofs;
wenzelm@13478
  1733
omits the infamous "standard" operation, so this is more appropriate
wenzelm@13478
  1734
than prove_goalw_cterm in many situations (e.g. in simprocs);
wenzelm@13478
  1735
wenzelm@13478
  1736
* Pure: improved error reporting of simprocs;
wenzelm@13478
  1737
wenzelm@13478
  1738
* Provers: Simplifier.simproc(_i) provides sane interface for setting
wenzelm@13478
  1739
up simprocs;
wenzelm@13478
  1740
wenzelm@13478
  1741
kleing@13953
  1742
*** Document preparation ***
kleing@13953
  1743
kleing@13953
  1744
* uses \par instead of \\ for line breaks in theory text. This may
kleing@13953
  1745
shift some page breaks in large documents. To get the old behaviour
kleing@13953
  1746
use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
kleing@13953
  1747
wenzelm@14731
  1748
* minimized dependencies of isabelle.sty and isabellesym.sty on
kleing@13953
  1749
other packages
kleing@13953
  1750
kleing@13953
  1751
* \<euro> now needs package babel/greek instead of marvosym (which
kleing@13953
  1752
broke \Rightarrow)
kleing@13953
  1753
wenzelm@14731
  1754
* normal size for \<zero>...\<nine> (uses \mathbf instead of
kleing@13954
  1755
textcomp package)
kleing@13953
  1756
wenzelm@13280
  1757
wenzelm@14572
  1758
wenzelm@12984
  1759
New in Isabelle2002 (March 2002)
wenzelm@12984
  1760
--------------------------------
wenzelm@11474
  1761
wenzelm@11572
  1762
*** Document preparation ***
wenzelm@11572
  1763
wenzelm@11842
  1764
* greatly simplified document preparation setup, including more
wenzelm@11842
  1765
graceful interpretation of isatool usedir -i/-d/-D options, and more
wenzelm@11842
  1766
instructive isatool mkdir; users should basically be able to get
wenzelm@12899
  1767
started with "isatool mkdir HOL Test && isatool make"; alternatively,
wenzelm@12899
  1768
users may run a separate document processing stage manually like this:
wenzelm@12899
  1769
"isatool usedir -D output HOL Test && isatool document Test/output";
wenzelm@11842
  1770
wenzelm@11842
  1771
* theory dependency graph may now be incorporated into documents;
wenzelm@11842
  1772
isatool usedir -g true will produce session_graph.eps/.pdf for use
wenzelm@11842
  1773
with \includegraphics of LaTeX;
wenzelm@11842
  1774
wenzelm@11864
  1775
* proper spacing of consecutive markup elements, especially text
wenzelm@11864
  1776
blocks after section headings;
wenzelm@11864
  1777
wenzelm@11572
  1778
* support bold style (for single symbols only), input syntax is like
wenzelm@11572
  1779
this: "\<^bold>\<alpha>" or "\<^bold>A";
wenzelm@11572
  1780
wenzelm@11814
  1781
* \<bullet> is now output as bold \cdot by default, which looks much
wenzelm@11572
  1782
better in printed text;
wenzelm@11572
  1783
wenzelm@11712
  1784
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm@11712
  1785
note that these symbols are currently unavailable in Proof General /
wenzelm@12769
  1786
X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
wenzelm@12690
  1787
wenzelm@12690
  1788
* isatool latex no longer depends on changed TEXINPUTS, instead
wenzelm@12690
  1789
isatool document copies the Isabelle style files to the target
wenzelm@12690
  1790
location;
wenzelm@11712
  1791
wenzelm@11572
  1792
wenzelm@11633
  1793
*** Isar ***
wenzelm@11633
  1794
wenzelm@12312
  1795
* Pure/Provers: improved proof by cases and induction;
wenzelm@12280
  1796
  - 'case' command admits impromptu naming of parameters (such as
wenzelm@12280
  1797
    "case (Suc n)");
wenzelm@12280
  1798
  - 'induct' method divinates rule instantiation from the inductive
wenzelm@12280
  1799
    claim; no longer requires excessive ?P bindings for proper
wenzelm@12280
  1800
    instantiation of cases;
wenzelm@12280
  1801
  - 'induct' method properly enumerates all possibilities of set/type
wenzelm@12280
  1802
    rules; as a consequence facts may be also passed through *type*
wenzelm@12280
  1803
    rules without further ado;
wenzelm@12280
  1804
  - 'induct' method now derives symbolic cases from the *rulified*
wenzelm@12280
  1805
    rule (before it used to rulify cases stemming from the internal
wenzelm@12280
  1806
    atomized version); this means that the context of a non-atomic
wenzelm@12280
  1807
    statement becomes is included in the hypothesis, avoiding the
wenzelm@12280
  1808
    slightly cumbersome show "PROP ?case" form;
wenzelm@12280
  1809
  - 'induct' may now use elim-style induction rules without chaining
wenzelm@12280
  1810
    facts, using ``missing'' premises from the goal state; this allows
wenzelm@12280
  1811
    rules stemming from inductive sets to be applied in unstructured
wenzelm@12280
  1812
    scripts, while still benefitting from proper handling of non-atomic
wenzelm@12280
  1813
    statements; NB: major inductive premises need to be put first, all
wenzelm@12280
  1814
    the rest of the goal is passed through the induction;
wenzelm@12280
  1815
  - 'induct' proper support for mutual induction involving non-atomic
wenzelm@12280
  1816
    rule statements (uses the new concept of simultaneous goals, see
wenzelm@12280
  1817
    below);
wenzelm@12853
  1818
  - append all possible rule selections, but only use the first
wenzelm@12853
  1819
    success (no backtracking);
wenzelm@11995
  1820
  - removed obsolete "(simplified)" and "(stripped)" options of methods;
wenzelm@12754
  1821
  - undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm@12754
  1822
  - added 'print_induct_rules' (covered by help item in recent Proof
wenzelm@12754
  1823
    General versions);
wenzelm@11995
  1824
  - moved induct/cases attributes to Pure, methods to Provers;
wenzelm@11995
  1825
  - generic method setup instantiated for FOL and HOL;
wenzelm@11986
  1826
wenzelm@12163
  1827
* Pure: support multiple simultaneous goal statements, for example
wenzelm@12163
  1828
"have a: A and b: B" (same for 'theorem' etc.); being a pure
wenzelm@12163
  1829
meta-level mechanism, this acts as if several individual goals had
wenzelm@12163
  1830
been stated separately; in particular common proof methods need to be
wenzelm@12163
  1831
repeated in order to cover all claims; note that a single elimination
wenzelm@12163
  1832
step is *not* sufficient to establish the two conjunctions, so this
wenzelm@12163
  1833
fails:
wenzelm@12163
  1834
wenzelm@12163
  1835
  assume "A & B" then have A and B ..   (*".." fails*)
wenzelm@12163
  1836
wenzelm@12163
  1837
better use "obtain" in situations as above; alternative refer to
wenzelm@12163
  1838
multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
wenzelm@12163
  1839
wenzelm@12078
  1840
* Pure: proper integration with ``locales''; unlike the original
webertj@15154
  1841
version by Florian Kammller, Isar locales package high-level proof
wenzelm@12078
  1842
contexts rather than raw logical ones (e.g. we admit to include
wenzelm@12280
  1843
attributes everywhere); operations on locales include merge and
wenzelm@12964
  1844
rename; support for implicit arguments (``structures''); simultaneous
wenzelm@12964
  1845
type-inference over imports and text; see also HOL/ex/Locales.thy for
wenzelm@12964
  1846
some examples;
wenzelm@12078
  1847
wenzelm@12707
  1848
* Pure: the following commands have been ``localized'', supporting a
wenzelm@12707
  1849
target locale specification "(in name)": 'lemma', 'theorem',
wenzelm@12707
  1850
'corollary', 'lemmas', 'theorems', 'declare'; the results will be
wenzelm@12707
  1851
stored both within the locale and at the theory level (exported and
wenzelm@12707
  1852
qualified by the locale name);
wenzelm@12707
  1853
wenzelm@12964
  1854
* Pure: theory goals may now be specified in ``long'' form, with
wenzelm@12964
  1855
ad-hoc contexts consisting of arbitrary locale elements. for example
wenzelm@12964
  1856
``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
wenzelm@12964
  1857
definitions may be given, too); the result is a meta-level rule with
wenzelm@12964
  1858
the context elements being discharged in the obvious way;
wenzelm@12964
  1859
wenzelm@12964
  1860
* Pure: new proof command 'using' allows to augment currently used
wenzelm@12964
  1861
facts after a goal statement ('using' is syntactically analogous to
wenzelm@12964
  1862
'apply', but acts on the goal's facts only); this allows chained facts
wenzelm@12964
  1863
to be separated into parts given before and after a claim, as in
wenzelm@12964
  1864
``from a and b have C using d and e <proof>'';
wenzelm@12078
  1865
wenzelm@11722
  1866
* Pure: renamed "antecedent" case to "rule_context";
wenzelm@11722
  1867
wenzelm@12964
  1868
* Pure: new 'judgment' command records explicit information about the
wenzelm@12964
  1869
object-logic embedding (used by several tools internally); no longer
wenzelm@12964
  1870
use hard-wired "Trueprop";
wenzelm@12964
  1871
wenzelm@11738
  1872
* Pure: added 'corollary' command;
wenzelm@11738
  1873
wenzelm@11722
  1874
* Pure: fixed 'token_translation' command;
wenzelm@11722
  1875
wenzelm@11899
  1876
* Pure: removed obsolete 'exported' attribute;
wenzelm@11899
  1877
wenzelm@11933
  1878
* Pure: dummy pattern "_" in is/let is now automatically lifted over
wenzelm@11933
  1879
bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
wenzelm@11899
  1880
supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
wenzelm@11899
  1881
wenzelm@11952
  1882
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm@11952
  1883
statements (atomic meta-level propositions); setup controlled via
wenzelm@11952
  1884
rewrite rules declarations of 'atomize' attribute; example
wenzelm@11952
  1885
application: 'induct' method with proper rule statements in improper
wenzelm@11952
  1886
proof *scripts*;
wenzelm@11952
  1887
wenzelm@12106
  1888
* Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
wenzelm@12106
  1889
now consider the syntactic context of assumptions, giving a better
wenzelm@12106
  1890
chance to get type-inference of the arguments right (this is
wenzelm@12106
  1891
especially important for locales);
wenzelm@12106
  1892
wenzelm@12312
  1893
* Pure: "sorry" no longer requires quick_and_dirty in interactive
wenzelm@12312
  1894
mode;
wenzelm@12312
  1895
wenzelm@12405
  1896
* Pure/obtain: the formal conclusion "thesis", being marked as
wenzelm@12405
  1897
``internal'', may no longer be reference directly in the text;
wenzelm@12405
  1898
potential INCOMPATIBILITY, may need to use "?thesis" in rare
wenzelm@12405
  1899
situations;
wenzelm@12405
  1900
wenzelm@12405
  1901
* Pure: generic 'sym' attribute which declares a rule both as pure
wenzelm@12405
  1902
'elim?' and for the 'symmetric' operation;
wenzelm@12405
  1903
wenzelm@12877
  1904
* Pure: marginal comments ``--'' may now occur just anywhere in the
wenzelm@12877
  1905
text; the fixed correlation with particular command syntax has been
wenzelm@12877
  1906
discontinued;
wenzelm@12877
  1907
berghofe@13023
  1908
* Pure: new method 'rules' is particularly well-suited for proof
berghofe@13023
  1909
search in intuitionistic logic; a bit slower than 'blast' or 'fast',
berghofe@13023
  1910
but often produces more compact proof terms with less detours;
berghofe@13023
  1911
wenzelm@12364
  1912
* Pure/Provers/classical: simplified integration with pure rule
wenzelm@12364
  1913
attributes and methods; the classical "intro?/elim?/dest?"
wenzelm@12364
  1914
declarations coincide with the pure ones; the "rule" method no longer
wenzelm@12364
  1915
includes classically swapped intros; "intro" and "elim" methods no
wenzelm@12364
  1916
longer pick rules from the context; also got rid of ML declarations
wenzelm@12364
  1917
AddXIs/AddXEs/AddXDs; all of this has some potential for
wenzelm@12364
  1918
INCOMPATIBILITY;
wenzelm@12364
  1919
wenzelm@12405
  1920
* Provers/classical: attribute 'swapped' produces classical inversions
wenzelm@12405
  1921
of introduction rules;
wenzelm@12405
  1922
wenzelm@12364
  1923
* Provers/simplifier: 'simplified' attribute may refer to explicit
wenzelm@12364
  1924
rules instead of full simplifier context; 'iff' attribute handles
wenzelm@12364
  1925
conditional rules;
wenzelm@11936
  1926
wenzelm@11745
  1927
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm@11745
  1928
wenzelm@11690
  1929
* HOL: 'recdef' now fails on unfinished automated proofs, use
wenzelm@11633
  1930
"(permissive)" option to recover old behavior;
wenzelm@11633
  1931
wenzelm@11933
  1932
* HOL: 'inductive' no longer features separate (collective) attributes
wenzelm@11933
  1933
for 'intros' (was found too confusing);
wenzelm@11933
  1934
wenzelm@12405
  1935
* HOL: properly declared induction rules less_induct and
wenzelm@12405
  1936
wf_induct_rule;
wenzelm@12405
  1937
kleing@11788
  1938
wenzelm@11474
  1939
*** HOL ***
wenzelm@11474
  1940
wenzelm@11702
  1941
* HOL: moved over to sane numeral syntax; the new policy is as
wenzelm@11702
  1942
follows:
wenzelm@11702
  1943
wenzelm@11702
  1944
  - 0 and 1 are polymorphic constants, which are defined on any
wenzelm@11702
  1945
  numeric type (nat, int, real etc.);
wenzelm@11702
  1946
wenzelm@11702
  1947
  - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
wenzelm@11702
  1948
  binary representation internally;
wenzelm@11702
  1949
wenzelm@11702
  1950
  - type nat has special constructor Suc, and generally prefers Suc 0
wenzelm@11702
  1951
  over 1::nat and Suc (Suc 0) over 2::nat;
wenzelm@11702
  1952
wenzelm@12364
  1953
This change may cause significant problems of INCOMPATIBILITY; here
wenzelm@12364
  1954
are some hints on converting existing sources:
wenzelm@11702
  1955
wenzelm@11702
  1956
  - due to the new "num" token, "-0" and "-1" etc. are now atomic
wenzelm@11702
  1957
  entities, so expressions involving "-" (unary or binary minus) need
wenzelm@11702
  1958
  to be spaced properly;
wenzelm@11702
  1959
wenzelm@11702
  1960
  - existing occurrences of "1" may need to be constraint "1::nat" or
wenzelm@11702
  1961
  even replaced by Suc 0; similar for old "2";
wenzelm@11702
  1962
wenzelm@11702
  1963
  - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
wenzelm@11702
  1964
wenzelm@11702
  1965
  - remove all special provisions on numerals in proofs;
wenzelm@11702
  1966
wenzelm@13042
  1967
* HOL: simp rules nat_number expand numerals on nat to Suc/0
wenzelm@12837
  1968
representation (depends on bin_arith_simps in the default context);
wenzelm@12837
  1969
wenzelm@12736
  1970
* HOL: symbolic syntax for x^2 (numeral 2);
wenzelm@12736
  1971
wenzelm@12335
  1972
* HOL: the class of all HOL types is now called "type" rather than
wenzelm@12335
  1973
"term"; INCOMPATIBILITY, need to adapt references to this type class
wenzelm@12335
  1974
in axclass/classes, instance/arities, and (usually rare) occurrences
wenzelm@12335
  1975
in typings (of consts etc.); internally the class is called
wenzelm@12335
  1976
"HOL.type", ML programs should refer to HOLogic.typeS;
wenzelm@12335
  1977
wenzelm@12280
  1978
* HOL/record package improvements:
wenzelm@12280
  1979
  - new derived operations "fields" to build a partial record section,
wenzelm@12280
  1980
    "extend" to promote a fixed record to a record scheme, and
wenzelm@12280
  1981
    "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
wenzelm@12280
  1982
    declared as simp by default;
wenzelm@12587
  1983
  - shared operations ("more", "fields", etc.) now need to be always
wenzelm@12587
  1984
    qualified) --- potential INCOMPATIBILITY;
wenzelm@12280
  1985
  - removed "make_scheme" operations (use "make" with "extend") --
wenzelm@12280
  1986
    INCOMPATIBILITY;
wenzelm@11937
  1987
  - removed "more" class (simply use "term") -- INCOMPATIBILITY;
wenzelm@12253
  1988
  - provides cases/induct rules for use with corresponding Isar
wenzelm@12253
  1989
    methods (for concrete records, record schemes, concrete more
wenzelm@12280
  1990
    parts, and schematic more parts -- in that order);
wenzelm@11930
  1991
  - internal definitions directly based on a light-weight abstract
wenzelm@11930
  1992
    theory of product types over typedef rather than datatype;
wenzelm@11930
  1993
berghofe@13023
  1994
* HOL: generic code generator for generating executable ML code from
berghofe@13023
  1995
specifications; specific support for HOL constructs such as inductive
berghofe@13023
  1996
datatypes and sets, as well as recursive functions; can be invoked
berghofe@13023
  1997
via 'generate_code' theory section;
berghofe@13023
  1998
wenzelm@11933
  1999
* HOL: canonical cases/induct rules for n-tuples (n = 3..7);
wenzelm@11933
  2000
paulson@13824
  2001
* HOL: consolidated and renamed several theories.  In particular:
wenzelm@14731
  2002
        Ord.thy has been absorbed into HOL.thy
wenzelm@14731
  2003
        String.thy has been absorbed into List.thy
wenzelm@14731
  2004
wenzelm@11802
  2005
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm@11802
  2006
(beware of argument permutation!);
wenzelm@11802
  2007
wenzelm@11657
  2008
* HOL: linorder_less_split superseded by linorder_cases;
wenzelm@11657
  2009
wenzelm@12917
  2010
* HOL/List: "nodups" renamed to "distinct";
nipkow@12889
  2011
wenzelm@11633
  2012
* HOL: added "The" definite description operator; move Hilbert's "Eps"
paulson@13824
  2013
to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
paulson@13824
  2014
  - Ex_def has changed, now need to use some_eq_ex
wenzelm@11437
  2015
wenzelm@11572
  2016
* HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
wenzelm@11572
  2017
in this (rare) case use:
wenzelm@11572
  2018
wenzelm@11572
  2019
  delSWrapper "split_all_tac"
wenzelm@11572
  2020
  addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
wenzelm@11572
  2021
wenzelm@11572
  2022
* HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
wenzelm@11474
  2023
MAY FAIL;
nipkow@11361
  2024
wenzelm@11572
  2025
* HOL: introduced f^n = f o ... o f; warning: due to the limits of
wenzelm@11572
  2026
Isabelle's type classes, ^ on functions and relations has too general
wenzelm@11572
  2027
a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
wenzelm@11572
  2028
necessary to attach explicit type constraints;
nipkow@11307
  2029
wenzelm@12917
  2030
* HOL/Relation: the prefix name of the infix "O" has been changed from
wenzelm@12917
  2031
"comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
wenzelm@12917
  2032
renamed accordingly (eg "compI" -> "rel_compI").
nipkow@12489
  2033
wenzelm@11487
  2034
* HOL: syntax translations now work properly with numerals and records
wenzelm@11487
  2035
expressions;
wenzelm@11474
  2036
wenzelm@12457
  2037
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm@12457
  2038
of "lam" -- INCOMPATIBILITY;
wenzelm@11474
  2039
wenzelm@11933
  2040
* HOL: got rid of some global declarations (potential INCOMPATIBILITY
wenzelm@11933
  2041
for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
wenzelm@11933
  2042
renamed "Product_Type.unit";
wenzelm@11611
  2043
nipkow@12564
  2044
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
nipkow@12564
  2045
wenzelm@12924
  2046
* HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
wenzelm@12924
  2047
the "cases" method);
wenzelm@12924
  2048
wenzelm@12597
  2049
* HOL/GroupTheory: group theory examples including Sylow's theorem (by
webertj@15154
  2050
Florian Kammller);
wenzelm@12597
  2051
wenzelm@12608
  2052
* HOL/IMP: updated and converted to new-style theory format; several
wenzelm@12608
  2053
parts turned into readable document, with proper Isar proof texts and
wenzelm@12608
  2054
some explanations (by Gerwin Klein);
wenzelm@12597
  2055
wenzelm@12734
  2056
* HOL-Real: added Complex_Numbers (by Gertrud Bauer);
wenzelm@12734
  2057
wenzelm@12690
  2058
* HOL-Hyperreal is now a logic image;
wenzelm@12690
  2059
wenzelm@11611
  2060
wenzelm@12022
  2061
*** HOLCF ***
wenzelm@12022
  2062
wenzelm@12622
  2063
* Isar: consts/constdefs supports mixfix syntax for continuous
wenzelm@12622
  2064
operations;
wenzelm@12622
  2065
wenzelm@12622
  2066
* Isar: domain package adapted to new-style theory format, e.g. see
wenzelm@12622
  2067
HOLCF/ex/Dnat.thy;
wenzelm@12622
  2068
wenzelm@12622
  2069
* theory Lift: proper use of rep_datatype lift instead of ML hacks --
wenzelm@12280
  2070
potential INCOMPATIBILITY; now use plain induct_tac instead of former
wenzelm@12280
  2071
lift.induct_tac, always use UU instead of Undef;
wenzelm@12022
  2072
wenzelm@12597
  2073
* HOLCF/IMP: updated and converted to new-style theory;
wenzelm@12597
  2074
wenzelm@12022
  2075
wenzelm@11474
  2076
*** ZF ***
wenzelm@11474
  2077
wenzelm@12622
  2078
* Isar: proper integration of logic-specific tools and packages,
wenzelm@12622
  2079
including theory commands '(co)inductive', '(co)datatype',
wenzelm@12622
  2080
'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
wenzelm@12622
  2081
'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
wenzelm@12622
  2082
wenzelm@12622
  2083
* theory Main no longer includes AC; for the Axiom of Choice, base
wenzelm@12622
  2084
your theory on Main_ZFC;
wenzelm@12622
  2085
wenzelm@12622
  2086
* the integer library now covers quotients and remainders, with many
wenzelm@12622
  2087
laws relating division to addition, multiplication, etc.;
paulson@12563
  2088
wenzelm@12280
  2089
* ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
wenzelm@12280
  2090
typeless version of the formalism;
wenzelm@12280
  2091
wenzelm@13025
  2092
* ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
wenzelm@13025
  2093
format;
wenzelm@12608
  2094
wenzelm@12280
  2095
* ZF/Induct: new directory for examples of inductive definitions,
wenzelm@12608
  2096
including theory Multiset for multiset orderings; converted to
wenzelm@12608
  2097
new-style theory format;
wenzelm@12177
  2098
wenzelm@13025
  2099
* ZF: many new theorems about lists, ordinals, etc.;
paulson@12850
  2100
wenzelm@11474
  2101
wenzelm@11474
  2102
*** General ***
wenzelm@11474
  2103
wenzelm@12280
  2104
* Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
wenzelm@12280
  2105
variable proof controls level of detail: 0 = no proofs (only oracle
wenzelm@12280
  2106
dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
wenzelm@12280
  2107
also ref manual for further ML interfaces;
wenzelm@12280
  2108
wenzelm@12280
  2109
* Pure/axclass: removed obsolete ML interface
wenzelm@12280
  2110
goal_subclass/goal_arity;
wenzelm@12280
  2111
wenzelm@12280
  2112
* Pure/syntax: new token syntax "num" for plain numerals (without "#"
wenzelm@12280
  2113
of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
wenzelm@12280
  2114
separate tokens, so expressions involving minus need to be spaced
wenzelm@12280
  2115
properly;
wenzelm@12280
  2116
wenzelm@12312
  2117
* Pure/syntax: support non-oriented infixes, using keyword "infix"
wenzelm@12312
  2118
rather than "infixl" or "infixr";
wenzelm@12312
  2119
wenzelm@12312
  2120
* Pure/syntax: concrete syntax for dummy type variables admits genuine
wenzelm@12312
  2121
sort constraint specifications in type inference; e.g. "x::_::foo"
wenzelm@12312
  2122
ensures that the type of "x" is of sort "foo" (but not necessarily a
wenzelm@12312
  2123
type variable);
wenzelm@12280
  2124
wenzelm@12280
  2125
* Pure/syntax: print modes "type_brackets" and "no_type_brackets"
wenzelm@12280
  2126
control output of nested => (types); the default behavior is
wenzelm@12280
  2127
"type_brackets";
wenzelm@12280
  2128
wenzelm@12280
  2129
* Pure/syntax: builtin parse translation for "_constify" turns valued
wenzelm@11817
  2130
tokens into AST constants;
wenzelm@11474
  2131
wenzelm@12280
  2132
* Pure/syntax: prefer later declarations of translations and print
wenzelm@12280
  2133
translation functions; potential INCOMPATIBILITY: need to reverse
wenzelm@12280
  2134
multiple declarations for same syntax element constant;
wenzelm@12280
  2135
wenzelm@12832
  2136
* Pure/show_hyps reset by default (in accordance to existing Isar
wenzelm@12832
  2137
practice);
wenzelm@12832
  2138
wenzelm@12280
  2139
* Provers/classical: renamed addaltern to addafter, addSaltern to
wenzelm@12280
  2140
addSafter;
wenzelm@12280
  2141
wenzelm@12280
  2142
* Provers/clasimp: ``iff'' declarations now handle conditional rules
wenzelm@12280
  2143
as well;
wenzelm@12253
  2144
wenzelm@12538
  2145
* system: tested support for MacOS X; should be able to get Isabelle +
wenzelm@12538
  2146
Proof General to work in a plain Terminal after installing Poly/ML
wenzelm@12538
  2147
(e.g. from the Isabelle distribution area) and GNU bash alone
wenzelm@12538
  2148
(e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
wenzelm@12538
  2149
support requires further installations, e.g. from
wenzelm@12538
  2150
http://fink.sourceforge.net/);
wenzelm@12538
  2151
wenzelm@12280
  2152
* system: support Poly/ML 4.1.1 (able to manage larger heaps);
wenzelm@11551
  2153
wenzelm@12753
  2154
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm@12753
  2155
of 40 MB), cf. ML_OPTIONS;
wenzelm@12753
  2156
wenzelm@11633
  2157
* system: Proof General keywords specification is now part of the
wenzelm@11633
  2158
Isabelle distribution (see etc/isar-keywords.el);
wenzelm@11633
  2159
wenzelm@12728
  2160
* system: support for persistent Proof General sessions (refrain from
wenzelm@12728
  2161
outdating all loaded theories on startup); user may create writable
wenzelm@12728
  2162
logic images like this: ``isabelle -q HOL Test'';
wenzelm@12597
  2163
wenzelm@11551
  2164
* system: smart selection of Isabelle process versus Isabelle
wenzelm@11572
  2165
interface, accommodates case-insensitive file systems (e.g. HFS+); may
wenzelm@11572
  2166
run both "isabelle" and "Isabelle" even if file names are badly
wenzelm@11572
  2167
damaged (executable inspects the case of the first letter of its own
wenzelm@11572
  2168
name); added separate "isabelle-process" and "isabelle-interface";
wenzelm@11551
  2169
wenzelm@12472
  2170
* system: refrain from any attempt at filtering input streams; no
wenzelm@12472
  2171
longer support ``8bit'' encoding of old isabelle font, instead proper
wenzelm@12472
  2172
iso-latin characters may now be used; the related isatools
wenzelm@12472
  2173
"symbolinput" and "nonascii" have disappeared as well;
wenzelm@12472
  2174
wenzelm@12472
  2175
* system: removed old "xterm" interface (the print modes "xterm" and
wenzelm@12472
  2176
"xterm_color" are still available for direct use in a suitable
wenzelm@12472
  2177
terminal);
wenzelm@12472
  2178
paulson@11314
  2179
oheimb@11169
  2180
wenzelm@11062
  2181
New in Isabelle99-2 (February 2001)
wenzelm@11062
  2182
-----------------------------------
wenzelm@11062
  2183
nipkow@10224
  2184
*** Overview of INCOMPATIBILITIES ***
nipkow@10224
  2185
paulson@11241
  2186
* HOL: please note that theories in the Library and elsewhere often use the
paulson@11241
  2187
new-style (Isar) format; to refer to their theorems in an ML script you must
wenzelm@12622
  2188
bind them to ML identifers by e.g.      val thm_name = thm "thm_name";
paulson@11241
  2189
wenzelm@11043
  2190
* HOL: inductive package no longer splits induction rule aggressively,
wenzelm@11043
  2191
but only as far as specified by the introductions given; the old
oheimb@11130
  2192
format may be recovered via ML function complete_split_rule or attribute
wenzelm@11043
  2193
'split_rule (complete)';
wenzelm@11043
  2194
wenzelm@10998
  2195
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
wenzelm@10998
  2196
gfp_Tarski to gfp_unfold;
nipkow@10224
  2197
paulson@10288
  2198
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
paulson@10288
  2199
wenzelm@10858
  2200
* HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
wenzelm@10858
  2201
relation); infix "^^" has been renamed "``"; infix "``" has been
wenzelm@10858
  2202
renamed "`"; "univalent" has been renamed "single_valued";
nipkow@10793
  2203
wenzelm@10998
  2204
* HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
wenzelm@10998
  2205
operation;
wenzelm@10998
  2206
nipkow@10868
  2207
* HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
nipkow@10856
  2208
wenzelm@10391
  2209
* Isar: 'obtain' no longer declares "that" fact as simp/intro;
wenzelm@10391
  2210
wenzelm@10401
  2211
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm@10401
  2212
consequence, it is no longer monotonic wrt. the local goal context
wenzelm@10401
  2213
(which is now passed through the inductive cases);
wenzelm@10401
  2214
wenzelm@10976
  2215
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm@10976
  2216
\<gg> to \<ggreater>;
wenzelm@10976
  2217
nipkow@10224
  2218
wenzelm@10245
  2219
*** Document preparation ***
wenzelm@10245
  2220
wenzelm@10858
  2221
* \isabellestyle{NAME} selects version of Isabelle output (currently
wenzelm@10858
  2222
available: are "it" for near math-mode best-style output, "sl" for
wenzelm@10858
  2223
slanted text style, and "tt" for plain type-writer; if no
wenzelm@10858
  2224
\isabellestyle command is given, output is according to slanted
wenzelm@10858
  2225
type-writer);
wenzelm@10858
  2226
wenzelm@10322
  2227
* support sub/super scripts (for single symbols only), input syntax is
wenzelm@10322
  2228
like this: "A\<^sup>*" or "A\<^sup>\<star>";
wenzelm@10322
  2229
wenzelm@10858
  2230
* some more standard symbols; see Appendix A of the system manual for
wenzelm@11062
  2231
the complete list of symbols defined in isabellesym.sty;
wenzelm@10858
  2232
wenzelm@10998
  2233
* improved isabelle style files; more abstract symbol implementation
wenzelm@10998
  2234
(should now use \isamath{...} and \isatext{...} in custom symbol
wenzelm@10998
  2235
definitions);
wenzelm@10998
  2236
wenzelm@10634
  2237
* antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
wenzelm@10634
  2238
state; Note that presentation of goal states does not conform to
wenzelm@10634
  2239
actual human-readable proof documents.  Please do not include goal
wenzelm@10634
  2240
states into document output unless you really know what you are doing!
wenzelm@10322
  2241
wenzelm@11062
  2242
* proper indentation of antiquoted output with proportional LaTeX
wenzelm@11062
  2243
fonts;
wenzelm@10862
  2244
wenzelm@11050
  2245
* no_document ML operator temporarily disables LaTeX document
wenzelm@11050
  2246
generation;
wenzelm@11050
  2247
wenzelm@11062
  2248
* isatool unsymbolize tunes sources for plain ASCII communication;
wenzelm@11062
  2249
wenzelm@10322
  2250
wenzelm@10306
  2251
*** Isar ***
wenzelm@10306
  2252
wenzelm@10547
  2253
* Pure: Isar now suffers initial goal statements to contain unbound
wenzelm@10547
  2254
schematic variables (this does not conform to actual readable proof
wenzelm@10547
  2255
documents, due to unpredictable outcome and non-compositional proof
wenzelm@10547
  2256
checking); users who know what they are doing may use schematic goals
wenzelm@10547
  2257
for Prolog-style synthesis of proven results;
wenzelm@10547
  2258
wenzelm@10391
  2259
* Pure: assumption method (an implicit finishing) now handles actual
wenzelm@10391
  2260
rules as well;
wenzelm@10391
  2261
wenzelm@10391
  2262
* Pure: improved 'obtain' --- moved to Pure, insert "that" into
wenzelm@10391
  2263
initial goal, declare "that" only as Pure intro (only for single
wenzelm@10391
  2264
steps); the "that" rule assumption may now be involved in implicit
wenzelm@10391
  2265
finishing, thus ".." becomes a feasible for trivial obtains;
wenzelm@10391
  2266
wenzelm@10391
  2267
* Pure: default proof step now includes 'intro_classes'; thus trivial
wenzelm@10391
  2268
instance proofs may be performed by "..";
wenzelm@10391
  2269
wenzelm@10391
  2270
* Pure: ?thesis / ?this / "..." now work for pure meta-level
wenzelm@10391
  2271
statements as well;
wenzelm@10306
  2272
wenzelm@11097
  2273
* Pure: more robust selection of calculational rules;
wenzelm@11097
  2274
wenzelm@10858
  2275
* Pure: the builtin notion of 'finished' goal now includes the ==-refl
wenzelm@10858
  2276
rule (as well as the assumption rule);
wenzelm@10858
  2277
wenzelm@10858
  2278
* Pure: 'thm_deps' command visualizes dependencies of theorems and
wenzelm@10858
  2279
lemmas, using the graph browser tool;
wenzelm@10858
  2280
wenzelm@10944
  2281
* Pure: predict failure of "show" in interactive mode;
wenzelm@10944
  2282
wenzelm@11016
  2283
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm@11016
  2284
wenzelm@10401
  2285
* HOL: improved method 'induct' --- now handles non-atomic goals
wenzelm@10401
  2286
(potential INCOMPATIBILITY); tuned error handling;
wenzelm@10401
  2287
wenzelm@10557
  2288
* HOL: cases and induct rules now provide explicit hints about the
wenzelm@10547
  2289
number of facts to be consumed (0 for "type" and 1 for "set" rules);
wenzelm@10547
  2290
any remaining facts are inserted into the goal verbatim;
wenzelm@10547
  2291
wenzelm@10858
  2292
* HOL: local contexts (aka cases) may now contain term bindings as
wenzelm@10858
  2293
well; the 'cases' and 'induct' methods new provide a ?case binding for
wenzelm@10858
  2294
the result to be shown in each case;
wenzelm@10858
  2295
wenzelm@10770
  2296
* HOL: added 'recdef_tc' command;
wenzelm@10770
  2297
wenzelm@11016
  2298
* isatool convert assists in eliminating legacy ML scripts;
wenzelm@11016
  2299
wenzelm@10306
  2300
wenzelm@10245
  2301
*** HOL ***
wenzelm@10245
  2302
wenzelm@10245
  2303
* HOL/Library: a collection of generic theories to be used together
wenzelm@10245
  2304
with main HOL; the theory loader path already includes this directory
wenzelm@10245
  2305
by default; the following existing theories have been moved here:
wenzelm@10245
  2306
HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
wenzelm@10337
  2307
(as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
wenzelm@10245
  2308
wenzelm@10966
  2309
* HOL/Unix: "Some aspects of Unix file-system security", a typical
wenzelm@10966
  2310
modelling and verification task performed in Isabelle/HOL +
wenzelm@10966
  2311
Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
wenzelm@10966
  2312
wenzelm@11094
  2313
* HOL/Algebra: special summation operator SUM no longer exists, it has
wenzelm@11094
  2314
been replaced by setsum; infix 'assoc' now has priority 50 (like
wenzelm@11094
  2315
'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
wenzelm@11094
  2316
'domain', this makes the theory consistent with mathematical
wenzelm@11094
  2317
literature;
wenzelm@11094
  2318
wenzelm@10514
  2319
* HOL basics: added overloaded operations "inverse" and "divide"
wenzelm@10726
  2320
(infix "/"), syntax for generic "abs" operation, generic summation
wenzelm@11094
  2321
operator \<Sum>;
wenzelm@10452
  2322
wenzelm@10391
  2323
* HOL/typedef: simplified package, provide more useful rules (see also
wenzelm@10391
  2324
HOL/subset.thy);
wenzelm@10391
  2325
wenzelm@10915
  2326
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm@10915
  2327
now expressed as a proper nested rule (old-style tactic scripts may
wenzelm@10915
  2328
require atomize_strip_tac to cope with non-atomic premises);
wenzelm@10915
  2329
wenzelm@10915
  2330
* HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
wenzelm@10915
  2331
to "split_conv" (old name still available for compatibility);
wenzelm@10915
  2332
wenzelm@10915
  2333
* HOL: improved concrete syntax for strings (e.g. allows translation
wenzelm@10915
  2334
rules with string literals);
wenzelm@10915
  2335
paulson@12245
  2336
* HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
paulson@12245
  2337
 and Fleuriot's mechanization of analysis, including the transcendental
paulson@12245
  2338
 functions for the reals;
paulson@10756
  2339
wenzelm@11094
  2340
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
wenzelm@10391
  2341
wenzelm@10858
  2342
paulson@10474
  2343
*** CTT ***
paulson@10474
  2344
wenzelm@10547
  2345
* CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
wenzelm@10547
  2346
"lam" is displayed as TWO lambda-symbols
paulson@10474
  2347
wenzelm@10547
  2348
* CTT: theory Main now available, containing everything (that is, Bool
wenzelm@10547
  2349
and Arith);
wenzelm@10547
  2350
paulson@10474
  2351
wenzelm@10391
  2352
*** General ***
wenzelm@10391
  2353
wenzelm@10547
  2354
* Pure: the Simplifier has been implemented properly as a derived rule
wenzelm@10547
  2355
outside of the actual kernel (at last!); the overall performance
wenzelm@10547
  2356
penalty in practical applications is about 50%, while reliability of
wenzelm@10547
  2357
the Isabelle inference kernel has been greatly improved;
wenzelm@10547
  2358
wenzelm@11112
  2359
* print modes "brackets" and "no_brackets" control output of nested =>
wenzelm@11112
  2360
(types) and ==> (props); the default behaviour is "brackets";
wenzelm@11112
  2361
wenzelm@10391
  2362
* Provers: fast_tac (and friends) now handle actual object-logic rules
wenzelm@10391
  2363
as assumptions as well;
wenzelm@10391
  2364
wenzelm@11124
  2365
* system: support Poly/ML 4.0;
wenzelm@11124
  2366
wenzelm@11124
  2367
* system: isatool install handles KDE version 1 or 2;
wenzelm@11124
  2368
wenzelm@10391
  2369
wenzelm@10245
  2370
wenzelm@10103
  2371
New in Isabelle99-1 (October 2000)
wenzelm@10103
  2372
----------------------------------
wenzelm@8015
  2373
wenzelm@10003
  2374
*** Overview of INCOMPATIBILITIES ***
paulson@8014
  2375
wenzelm@8848
  2376
* HOL: simplification of natural numbers is much changed; to partly
wenzelm@8848
  2377
recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
wenzelm@8848
  2378
issue the following ML commands:
wenzelm@8848
  2379
wenzelm@8848
  2380
  Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
wenzelm@8848
  2381
  Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
paulson@8788
  2382
wenzelm@10129
  2383
* HOL: simplification no longer dives into case-expressions; this is
wenzelm@10129
  2384
controlled by "t.weak_case_cong" for each datatype t;
wenzelm@10003
  2385
wenzelm@10003
  2386
* HOL: nat_less_induct renamed to less_induct;
wenzelm@10003
  2387
wenzelm@10003
  2388
* HOL: systematic renaming of the SOME (Eps) rules, may use isatool
wenzelm@10003
  2389
fixsome to patch .thy and .ML sources automatically;
paulson@8967
  2390
wenzelm@10003
  2391
  select_equality  -> some_equality
wenzelm@10003
  2392
  select_eq_Ex     -> some_eq_ex
wenzelm@10003
  2393
  selectI2EX       -> someI2_ex
wenzelm@10003
  2394
  selectI2         -> someI2
wenzelm@10003
  2395
  selectI          -> someI
wenzelm@10003
  2396
  select1_equality -> some1_equality
wenzelm@10003
  2397
  Eps_sym_eq       -> some_sym_eq_trivial
wenzelm@10003
  2398
  Eps_eq           -> some_eq_trivial
wenzelm@10003
  2399
wenzelm@10003
  2400
* HOL: exhaust_tac on datatypes superceded by new generic case_tac;
wenzelm@10003
  2401
wenzelm@10003
  2402
* HOL: removed obsolete theorem binding expand_if (refer to split_if
wenzelm@10003
  2403
instead);
wenzelm@10003
  2404
wenzelm@10003
  2405
* HOL: the recursion equations generated by 'recdef' are now called
wenzelm@10003
  2406
f.simps instead of f.rules;
wenzelm@10003
  2407
wenzelm@10003
  2408
* HOL: qed_spec_mp now also handles bounded ALL as well;
wenzelm@10003
  2409
wenzelm@10003
  2410
* HOL: 0 is now overloaded, so the type constraint ":: nat" may
wenzelm@10003
  2411
sometimes be needed;
wenzelm@10003
  2412
wenzelm@10003
  2413
* HOL: the constant for "f``x" is now "image" rather than "op ``";
paulson@8014
  2414
paulson@10065
  2415
* HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
paulson@10065
  2416
wenzelm@9330
  2417
* HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
wenzelm@9330
  2418
product is now "<*>" instead of "Times"; the lexicographic product is
wenzelm@9330
  2419
now "<*lex*>" instead of "**";
nipkow@8705
  2420
wenzelm@10003
  2421
* HOL: theory Sexp is now in HOL/Induct examples (it used to be part
wenzelm@10003
  2422
of main HOL, but was unused); better use HOL's datatype package;
paulson@9971
  2423
wenzelm@10137
  2424
* HOL: removed "symbols" syntax for constant "override" of theory Map;
wenzelm@10137
  2425
the old syntax may be recovered as follows:
wenzelm@10137
  2426
wenzelm@10137
  2427
  syntax (symbols)
wenzelm@10137
  2428
    override  :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
wenzelm@10137
  2429
      (infixl "\\<oplus>" 100)
wenzelm@10137
  2430
wenzelm@8848
  2431
* HOL/Real: "rabs" replaced by overloaded "abs" function;
wenzelm@8848
  2432
wenzelm@8887
  2433
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm@8887
  2434
Lfp, Gfp, WF); this only affects ML packages that refer to const names
wenzelm@8887
  2435
internally;
wenzelm@8887
  2436
wenzelm@10003
  2437
* HOL and ZF: syntax for quotienting wrt an equivalence relation
wenzelm@10003
  2438
changed from A/r to A//r;
wenzelm@9908
  2439
wenzelm@10003
  2440
* ZF: new treatment of arithmetic (nat & int) may break some old
wenzelm@10003
  2441
proofs;
wenzelm@8921
  2442
wenzelm@10003
  2443
* Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
wenzelm@10003
  2444
rulify -> rule_format, elimify -> elim_format, ...);
paulson@9542
  2445
wenzelm@9941
  2446
* Isar/Provers: intro/elim/dest attributes changed; renamed
wenzelm@9941
  2447
intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
wenzelm@9937
  2448
should have to change intro!! to intro? only); replaced "delrule" by
wenzelm@9937
  2449
"rule del";
wenzelm@9437
  2450
wenzelm@9612
  2451
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
wenzelm@9612
  2452
wenzelm@9437
  2453
* Provers: strengthened force_tac by using new first_best_tac;
oheimb@9402
  2454
wenzelm@10003
  2455
* LaTeX document preparation: several changes of isabelle.sty (see
wenzelm@10003
  2456
lib/texinputs);
wenzelm@8729
  2457
paulson@8014
  2458
wenzelm@8487
  2459
*** Document preparation ***
wenzelm@8358
  2460
wenzelm@9198
  2461
* formal comments (text blocks etc.) in new-style theories may now
wenzelm@9753
  2462
contain antiquotations of thm/prop/term/typ/text to be presented
wenzelm@9753
  2463
according to latex print mode; concrete syntax is like this:
wenzelm@9753
  2464
@{term[show_types] "f(x) = a + x"};
wenzelm@9198
  2465
wenzelm@8358
  2466
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm@8518
  2467
including proper document sources;
wenzelm@8358
  2468
wenzelm@8358
  2469
* generated LaTeX sources are now deleted after successful run
wenzelm@8358
  2470
(isatool document -c); may retain a copy somewhere else via -D option
wenzelm@8358
  2471
of isatool usedir;
wenzelm@8358
  2472
wenzelm@8566
  2473
* isatool usedir -D now lets isatool latex -o sty update the Isabelle
wenzelm@10003
  2474
style files, achieving self-contained LaTeX sources and simplifying
wenzelm@10003
  2475
LaTeX debugging;
wenzelm@8566
  2476
wenzelm@8518
  2477
* old-style theories now produce (crude) LaTeX output as well;
wenzelm@8358
  2478
wenzelm@9057
  2479
* browser info session directories are now self-contained (may be put
wenzelm@9437
  2480
on WWW server seperately); improved graphs of nested sessions; removed
wenzelm@9437
  2481
graph for 'all sessions';
wenzelm@9057
  2482
wenzelm@10003
  2483
* several improvements in isabelle style files; \isabellestyle{it}
wenzelm@10003
  2484
produces fake math mode output; \isamarkupheader is now \section by
wenzelm@10003
  2485
default; see lib/texinputs/isabelle.sty etc.;
wenzelm@9489
  2486
wenzelm@8358
  2487
wenzelm@8184
  2488
*** Isar ***
wenzelm@8184
  2489
wenzelm@10003
  2490
* Isar/Pure: local results and corresponding term bindings are now
wenzelm@10003
  2491
subject to Hindley-Milner polymorphism (similar to ML); this
wenzelm@10003
  2492
accommodates incremental type-inference very nicely;
wenzelm@8283
  2493
wenzelm@10003
  2494
* Isar/Pure: new derived language element 'obtain' supports
wenzelm@10003
  2495
generalized existence reasoning;
wenzelm@8621
  2496
wenzelm@10003
  2497
* Isar/Pure: new calculational elements 'moreover' and 'ultimately'
wenzelm@10003
  2498
support accumulation of results, without applying any rules yet;
wenzelm@10003
  2499
useful to collect intermediate results without explicit name
wenzelm@10003
  2500
references, and for use with transitivity rules with more than 2
wenzelm@10003
  2501
premises;
wenzelm@8184
  2502
wenzelm@10003
  2503
* Isar/Pure: scalable support for case-analysis type proofs: new
wenzelm@10003
  2504
'case' language element refers to local contexts symbolically, as
wenzelm@10003
  2505
produced by certain proof methods; internally, case names are attached
wenzelm@10003
  2506
to theorems as "tags";
wenzelm@8440
  2507
wenzelm@10003
  2508
* Isar/Pure: theory command 'hide' removes declarations from
wenzelm@9330
  2509
class/type/const name spaces;
wenzelm@9330
  2510
wenzelm@10003
  2511
* Isar/Pure: theory command 'defs' supports option "(overloaded)" to
wenzelm@9330
  2512
indicate potential overloading;
wenzelm@9330
  2513
wenzelm@10003
  2514
* Isar/Pure: changed syntax of local blocks from {{ }} to { };
wenzelm@8621
  2515
wenzelm@10003
  2516
* Isar/Pure: syntax of sorts made 'inner', i.e. have to write
wenzelm@10003
  2517
"{a,b,c}" instead of {a,b,c};
wenzelm@9011
  2518
wenzelm@10003
  2519
* Isar/Pure now provides its own version of intro/elim/dest
wenzelm@10003
  2520
attributes; useful for building new logics, but beware of confusion
wenzelm@10003
  2521
with the version in Provers/classical;
wenzelm@9612
  2522
wenzelm@10003
  2523
* Isar/Pure: the local context of (non-atomic) goals is provided via
wenzelm@10003
  2524
case name 'antecedent';
wenzelm@8440
  2525
wenzelm@10003
  2526
* Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
wenzelm@10003
  2527
to the current context is now done automatically);
wenzelm@9383
  2528
wenzelm@10003