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