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