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