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