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