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