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