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