NEWS
author haftmann
Thu, 29 Nov 2007 17:08:26 +0100
changeset 25502 9200b36280c0
parent 25464 0ca80ce89001
child 25508 00b59b9c7c83
permissions -rw-r--r--
instance command as rudimentary class 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
wenzelm@25464
    17
* Constant "card" now with authentic syntax.
wenzelm@25464
    18
wenzelm@25464
    19
wenzelm@25464
    20
wenzelm@25429
    21
New in Isabelle2007 (November 2007)
wenzelm@25429
    22
-----------------------------------
wenzelm@17754
    23
wenzelm@17754
    24
*** General ***
wenzelm@17754
    25
wenzelm@22826
    26
* More uniform information about legacy features, notably a
wenzelm@22826
    27
warning/error of "Legacy feature: ...", depending on the state of the
wenzelm@23367
    28
tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
wenzelm@23367
    29
legacy features will disappear eventually.
wenzelm@22826
    30
wenzelm@17918
    31
* Theory syntax: the header format ``theory A = B + C:'' has been
wenzelm@17918
    32
discontinued in favour of ``theory A imports B C begin''.  Use isatool
wenzelm@17918
    33
fixheaders to convert existing theory files.  INCOMPATIBILITY.
wenzelm@17918
    34
wenzelm@17918
    35
* Theory syntax: the old non-Isar theory file format has been
wenzelm@17918
    36
discontinued altogether.  Note that ML proof scripts may still be used
wenzelm@17918
    37
with Isar theories; migration is usually quite simple with the ML
wenzelm@17918
    38
function use_legacy_bindings.  INCOMPATIBILITY.
wenzelm@17918
    39
wenzelm@22871
    40
* Theory syntax: some popular names (e.g. 'class', 'declaration',
wenzelm@22871
    41
'fun', 'help', 'if') are now keywords.  INCOMPATIBILITY, use double
wenzelm@22871
    42
quotes.
wenzelm@19814
    43
wenzelm@23888
    44
* Theory loader: be more serious about observing the static theory
wenzelm@23888
    45
header specifications (including optional directories), but not the
wenzelm@24172
    46
accidental file locations of previously successful loads.  The strict
wenzelm@24172
    47
update policy of former update_thy is now already performed by
wenzelm@24172
    48
use_thy, so the former has been removed; use_thys updates several
wenzelm@24172
    49
theories simultaneously, just as 'imports' within a theory header
wenzelm@24172
    50
specification, but without merging the results.  Potential
wenzelm@24172
    51
INCOMPATIBILITY: may need to refine theory headers and commands
wenzelm@24172
    52
ROOT.ML which depend on load order.
wenzelm@23888
    53
wenzelm@23888
    54
* Theory loader: optional support for content-based file
wenzelm@23888
    55
identification, instead of the traditional scheme of full physical
wenzelm@23889
    56
path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
wenzelm@23888
    57
(cf. the system manual).  The new scheme allows to work with
wenzelm@23888
    58
non-finished theories in persistent session images, such that source
wenzelm@23888
    59
files may be moved later on without requiring reloads.
wenzelm@23888
    60
wenzelm@24187
    61
* Theory loader: old-style ML proof scripts being *attached* to a thy
wenzelm@24187
    62
file (with the same base name as the theory) are considered a legacy
wenzelm@24800
    63
feature, which will disappear eventually. Even now, the theory loader
wenzelm@24800
    64
no longer maintains dependencies on such files.
wenzelm@24800
    65
wenzelm@24800
    66
* Syntax: the scope for resolving ambiguities via type-inference is
wenzelm@24800
    67
now limited to individual terms, instead of whole simultaneous
wenzelm@24234
    68
specifications as before. This greatly reduces the complexity of the
wenzelm@24234
    69
syntax module and improves flexibility by separating parsing and
wenzelm@24234
    70
type-checking. INCOMPATIBILITY: additional type-constraints (explicit
wenzelm@24234
    71
'fixes' etc.) are required in rare situations.
wenzelm@24234
    72
wenzelm@25034
    73
* Syntax: constants introduced by new-style packages ('definition',
wenzelm@25034
    74
'abbreviation' etc.) are passed through the syntax module in
wenzelm@25034
    75
``authentic mode''. This means that associated mixfix annotations
wenzelm@25034
    76
really stick to such constants, independently of potential name space
wenzelm@25034
    77
ambiguities introduced later on. INCOMPATIBILITY: constants in parse
wenzelm@25034
    78
trees are represented slightly differently, may need to adapt syntax
wenzelm@25034
    79
translations accordingly. Use CONST marker in 'translations' and
wenzelm@25034
    80
@{const_syntax} antiquotation in 'parse_translation' etc.
wenzelm@25034
    81
wenzelm@17981
    82
* Legacy goal package: reduced interface to the bare minimum required
wenzelm@17981
    83
to keep existing proof scripts running.  Most other user-level
wenzelm@17981
    84
functions are now part of the OldGoals structure, which is *not* open
wenzelm@17981
    85
by default (consider isatool expandshort before open OldGoals).
wenzelm@17981
    86
Removed top_sg, prin, printyp, pprint_term/typ altogether, because
wenzelm@17981
    87
these tend to cause confusion about the actual goal (!) context being
wenzelm@17981
    88
used here, which is not necessarily the same as the_context().
wenzelm@17918
    89
wenzelm@23379
    90
* Command 'find_theorems': supports "*" wild-card in "name:"
wenzelm@23379
    91
criterion; "with_dups" option.  Certain ProofGeneral versions might
wenzelm@23379
    92
support a specific search form (see ProofGeneral/CHANGES).
webertj@22965
    93
wenzelm@20370
    94
* The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
wenzelm@20370
    95
by default, which means that "prems" (and also "fixed variables") are
wenzelm@20370
    96
suppressed from proof state output.  Note that the ProofGeneral
wenzelm@20370
    97
settings mechanism allows to change and save options persistently, but
wenzelm@20370
    98
older versions of Isabelle will fail to start up if a negative prems
wenzelm@20370
    99
limit is imposed.
wenzelm@20370
   100
wenzelm@21308
   101
* Local theory targets may be specified by non-nested blocks of
wenzelm@21308
   102
``context/locale/class ... begin'' followed by ``end''.  The body may
wenzelm@21308
   103
contain definitions, theorems etc., including any derived mechanism
wenzelm@21308
   104
that has been implemented on top of these primitives.  This concept
wenzelm@21308
   105
generalizes the existing ``theorem (in ...)'' towards more versatility
wenzelm@21308
   106
and scalability.
wenzelm@21308
   107
wenzelm@21960
   108
* Proof General interface: proper undo of final 'end' command;
wenzelm@21960
   109
discontinued Isabelle/classic mode (ML proof scripts).
wenzelm@21960
   110
wenzelm@17754
   111
wenzelm@17865
   112
*** Document preparation ***
wenzelm@17865
   113
wenzelm@21717
   114
* Added antiquotation @{theory name} which prints the given name,
wenzelm@21717
   115
after checking that it refers to a valid ancestor theory in the
wenzelm@21717
   116
current context.
haftmann@21339
   117
wenzelm@17869
   118
* Added antiquotations @{ML_type text} and @{ML_struct text} which
wenzelm@17869
   119
check the given source text as ML type/structure, printing verbatim.
wenzelm@17865
   120
wenzelm@21717
   121
* Added antiquotation @{abbrev "c args"} which prints the abbreviation
wenzelm@21717
   122
"c args == rhs" given in the current context.  (Any number of
wenzelm@21735
   123
arguments may be given on the LHS.)
wenzelm@21717
   124
wenzelm@21717
   125
wenzelm@17779
   126
*** Pure ***
wenzelm@17779
   127
wenzelm@24800
   128
* The 'class' package offers a combination of axclass and locale to
wenzelm@25129
   129
achieve Haskell-like type classes in Isabelle.  Definitions and
wenzelm@25129
   130
theorems within a class context produce both relative results (with
wenzelm@25129
   131
implicit parameters according to the locale context), and polymorphic
wenzelm@25129
   132
constants with qualified polymorphism (according to the class
wenzelm@25129
   133
context).  Within the body context of a 'class' target, a separate
wenzelm@25129
   134
syntax layer ("user space type system") takes care of converting
wenzelm@25129
   135
between global polymorphic consts and internal locale representation.
wenzelm@25177
   136
See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
haftmann@25184
   137
"isatool doc classes" provides a tutorial.
wenzelm@20807
   138
haftmann@25199
   139
* Generic code generator framework allows to generate executable
wenzelm@24800
   140
code for ML and Haskell (including Isabelle classes).  A short usage
wenzelm@24800
   141
sketch:
haftmann@20188
   142
haftmann@20188
   143
    internal compilation:
haftmann@25199
   144
        export_code <list of constants (term syntax)> in SML
haftmann@20453
   145
    writing SML code to a file:
haftmann@25199
   146
        export_code <list of constants (term syntax)> in SML <filename>
haftmann@22735
   147
    writing OCaml code to a file:
haftmann@25199
   148
        export_code <list of constants (term syntax)> in OCaml <filename>
haftmann@20188
   149
    writing Haskell code to a bunch of files:
haftmann@25199
   150
        export_code <list of constants (term syntax)> in Haskell <filename>
haftmann@25199
   151
haftmann@25199
   152
    evaluating closed propositions to True/False using code generation:
haftmann@25184
   153
        method ``eval''
haftmann@25184
   154
haftmann@25184
   155
Reasonable default setup of framework in HOL.
haftmann@20453
   156
haftmann@20453
   157
Theorem attributs for selecting and transforming function equations theorems:
haftmann@20453
   158
haftmann@22845
   159
    [code fun]:        select a theorem as function equation for a specific constant
haftmann@22845
   160
    [code fun del]:    deselect a theorem as function equation for a specific constant
haftmann@22845
   161
    [code inline]:     select an equation theorem for unfolding (inlining) in place
haftmann@22845
   162
    [code inline del]: deselect an equation theorem for unfolding (inlining) in place
haftmann@20453
   163
haftmann@22735
   164
User-defined serializations (target in {SML, OCaml, Haskell}):
haftmann@20453
   165
haftmann@20453
   166
    code_const <and-list of constants (term syntax)>
haftmann@20453
   167
      {(target) <and-list of const target syntax>}+
haftmann@20453
   168
haftmann@20453
   169
    code_type <and-list of type constructors>
haftmann@20453
   170
      {(target) <and-list of type target syntax>}+
haftmann@20453
   171
haftmann@20453
   172
    code_instance <and-list of instances>
haftmann@20453
   173
      {(target)}+
haftmann@20453
   174
        where instance ::= <type constructor> :: <class>
haftmann@20453
   175
haftmann@20453
   176
    code_class <and_list of classes>
haftmann@20453
   177
      {(target) <and-list of class target syntax>}+
haftmann@20453
   178
        where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
haftmann@20453
   179
haftmann@25199
   180
code_instance and code_class only are effective to target Haskell.
haftmann@22735
   181
wenzelm@25177
   182
For example usage see src/HOL/ex/Codegenerator.thy and
wenzelm@25177
   183
src/HOL/ex/Codegenerator_Pretty.thy.  A separate tutorial on code
wenzelm@24800
   184
generation from Isabelle/HOL theories is available via "isatool doc
wenzelm@24800
   185
codegen".
haftmann@20188
   186
wenzelm@25129
   187
* Code generator: consts in 'consts_code' Isar commands are now
wenzelm@25129
   188
referred to by usual term syntax (including optional type
wenzelm@25129
   189
annotations).
wenzelm@25129
   190
wenzelm@19254
   191
* Command 'no_translations' removes translation rules from theory
wenzelm@19254
   192
syntax.
wenzelm@19254
   193
wenzelm@19625
   194
* Overloaded definitions are now actually checked for acyclic
wenzelm@19714
   195
dependencies.  The overloading scheme is slightly more general than
wenzelm@19714
   196
that of Haskell98, although Isabelle does not demand an exact
wenzelm@19714
   197
correspondence to type class and instance declarations.
wenzelm@19714
   198
INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
wenzelm@19714
   199
exotic versions of overloading -- at the discretion of the user!
wenzelm@19711
   200
wenzelm@19711
   201
Polymorphic constants are represented via type arguments, i.e. the
wenzelm@19711
   202
instantiation that matches an instance against the most general
wenzelm@19711
   203
declaration given in the signature.  For example, with the declaration
wenzelm@19711
   204
c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
wenzelm@19711
   205
as c(nat).  Overloading is essentially simultaneous structural
wenzelm@19711
   206
recursion over such type arguments.  Incomplete specification patterns
wenzelm@19714
   207
impose global constraints on all occurrences, e.g. c('a * 'a) on the
wenzelm@19715
   208
LHS means that more general c('a * 'b) will be disallowed on any RHS.
wenzelm@19714
   209
Command 'print_theory' outputs the normalized system of recursive
wenzelm@19714
   210
equations, see section "definitions".
wenzelm@19625
   211
wenzelm@24086
   212
* Configuration options are maintained within the theory or proof
wenzelm@24086
   213
context (with name and type bool/int/string), providing a very simple
wenzelm@24086
   214
interface to a poor-man's version of general context data.  Tools may
wenzelm@24110
   215
declare options in ML (e.g. using Attrib.config_int) and then refer to
wenzelm@24110
   216
these values using Config.get etc.  Users may change options via an
wenzelm@24110
   217
associated attribute of the same name.  This form of context
wenzelm@24110
   218
declaration works particularly well with commands 'declare' or
wenzelm@24110
   219
'using', for example ``declare [[foo = 42]]''.  Thus it has become
wenzelm@24110
   220
very easy to avoid global references, which would not observe Isar
wenzelm@24110
   221
toplevel undo/redo and fail to work with multithreading.
wenzelm@24086
   222
wenzelm@24172
   223
Various global ML references of Pure and HOL have been turned into
wenzelm@24172
   224
configuration options:
wenzelm@24172
   225
wenzelm@24172
   226
  Unify.search_bound		unify_search_bound
wenzelm@24172
   227
  Unify.trace_bound		unify_trace_bound
wenzelm@24172
   228
  Unify.trace_simp		unify_trace_simp
wenzelm@24172
   229
  Unify.trace_types		unify_trace_types
wenzelm@24172
   230
  Simplifier.simp_depth_limit	simp_depth_limit
wenzelm@24172
   231
  Blast.depth_limit		blast_depth_limit
wenzelm@24172
   232
  DatatypeProp.dtK		datatype_distinctness_limit
wenzelm@24172
   233
  fast_arith_neq_limit  	fast_arith_neq_limit
wenzelm@24172
   234
  fast_arith_split_limit	fast_arith_split_limit
wenzelm@24172
   235
wenzelm@24086
   236
* Named collections of theorems may be easily installed as context
wenzelm@24800
   237
data using the functor NamedThmsFun (see also
wenzelm@24086
   238
src/Pure/Tools/named_thms.ML).  The user may add or delete facts via
wenzelm@24110
   239
attributes; there is also a toplevel print command.  This facility is
wenzelm@24110
   240
just a common case of general context data, which is the preferred way
wenzelm@24110
   241
for anything more complex than just a list of facts in canonical
wenzelm@24110
   242
order.
wenzelm@24086
   243
wenzelm@24032
   244
* Isar: command 'declaration' augments a local theory by generic
wenzelm@24032
   245
declaration functions written in ML.  This enables arbitrary content
wenzelm@24032
   246
being added to the context, depending on a morphism that tells the
wenzelm@24032
   247
difference of the original declaration context wrt. the application
wenzelm@24032
   248
context encountered later on.
wenzelm@24032
   249
wenzelm@24032
   250
* Isar: proper interfaces for simplification procedures.  Command
wenzelm@24032
   251
'simproc_setup' declares named simprocs (with match patterns, and body
wenzelm@24032
   252
text in ML).  Attribute "simproc" adds/deletes simprocs in the current
wenzelm@24032
   253
context.  ML antiquotation @{simproc name} retrieves named simprocs.
wenzelm@24032
   254
wenzelm@24032
   255
* Isar: an extra pair of brackets around attribute declarations
wenzelm@24032
   256
abbreviates a theorem reference involving an internal dummy fact,
wenzelm@24032
   257
which will be ignored later --- only the effect of the attribute on
wenzelm@24032
   258
the background context will persist.  This form of in-place
wenzelm@24032
   259
declarations is particularly useful with commands like 'declare' and
wenzelm@24032
   260
'using', for example ``have A using [[simproc a]] by simp''.
wenzelm@24032
   261
wenzelm@23369
   262
* Isar: method "assumption" (and implicit closing of subproofs) now
wenzelm@23369
   263
takes simple non-atomic goal assumptions into account: after applying
wenzelm@23369
   264
an assumption as a rule the resulting subgoals are solved by atomic
wenzelm@23369
   265
assumption steps.  This is particularly useful to finish 'obtain'
wenzelm@23369
   266
goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
wenzelm@23369
   267
without referring to the original premise "!!x. P x ==> thesis" in the
wenzelm@23369
   268
Isar proof context.  POTENTIAL INCOMPATIBILITY: method "assumption" is
wenzelm@23369
   269
more permissive.
wenzelm@23369
   270
wenzelm@23369
   271
* Isar: implicit use of prems from the Isar proof context is
wenzelm@23369
   272
considered a legacy feature.  Common applications like ``have A .''
wenzelm@23369
   273
may be replaced by ``have A by fact'' or ``note `A`''.  In general,
wenzelm@23369
   274
referencing facts explicitly here improves readability and
wenzelm@23369
   275
maintainability of proof texts.
wenzelm@23369
   276
wenzelm@17865
   277
* Isar: improper proof element 'guess' is like 'obtain', but derives
wenzelm@17865
   278
the obtained context from the course of reasoning!  For example:
wenzelm@17865
   279
wenzelm@17865
   280
  assume "EX x y. A x & B y"   -- "any previous fact"
wenzelm@17865
   281
  then guess x and y by clarify
wenzelm@17865
   282
wenzelm@17865
   283
This technique is potentially adventurous, depending on the facts and
wenzelm@17865
   284
proof tools being involved here.
wenzelm@17865
   285
wenzelm@18020
   286
* Isar: known facts from the proof context may be specified as literal
wenzelm@18020
   287
propositions, using ASCII back-quote syntax.  This works wherever
wenzelm@18020
   288
named facts used to be allowed so far, in proof commands, proof
wenzelm@18020
   289
methods, attributes etc.  Literal facts are retrieved from the context
wenzelm@18020
   290
according to unification of type and term parameters.  For example,
wenzelm@18020
   291
provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
wenzelm@18020
   292
theorems in the current context, then these are valid literal facts:
wenzelm@18020
   293
`A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
wenzelm@18020
   294
wenzelm@18020
   295
There is also a proof method "fact" which does the same composition
wenzelm@18044
   296
for explicit goal states, e.g. the following proof texts coincide with
wenzelm@18044
   297
certain special cases of literal facts:
wenzelm@18020
   298
wenzelm@18020
   299
  have "A" by fact                 ==  note `A`
wenzelm@18020
   300
  have "A ==> B" by fact           ==  note `A ==> B`
wenzelm@18020
   301
  have "!!x. P x ==> Q x" by fact  ==  note `!!x. P x ==> Q x`
wenzelm@18020
   302
  have "P a ==> Q a" by fact       ==  note `P a ==> Q a`
wenzelm@18020
   303
wenzelm@20118
   304
* Isar: ":" (colon) is no longer a symbolic identifier character in
wenzelm@20118
   305
outer syntax.  Thus symbolic identifiers may be used without
wenzelm@20118
   306
additional white space in declarations like this: ``assume *: A''.
wenzelm@20118
   307
wenzelm@20013
   308
* Isar: 'print_facts' prints all local facts of the current context,
wenzelm@20013
   309
both named and unnamed ones.
wenzelm@20013
   310
wenzelm@18308
   311
* Isar: 'def' now admits simultaneous definitions, e.g.:
wenzelm@18308
   312
wenzelm@18308
   313
  def x == "t" and y == "u"
wenzelm@18308
   314
wenzelm@18540
   315
* Isar: added command 'unfolding', which is structurally similar to
wenzelm@18540
   316
'using', but affects both the goal state and facts by unfolding given
wenzelm@18815
   317
rewrite rules.  Thus many occurrences of the 'unfold' method or
wenzelm@18540
   318
'unfolded' attribute may be replaced by first-class proof text.
wenzelm@18540
   319
wenzelm@18815
   320
* Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
wenzelm@18815
   321
and command 'unfolding' now all support object-level equalities
wenzelm@18815
   322
(potentially conditional).  The underlying notion of rewrite rule is
wenzelm@18815
   323
analogous to the 'rule_format' attribute, but *not* that of the
wenzelm@18815
   324
Simplifier (which is usually more generous).
wenzelm@18815
   325
kleing@24238
   326
* Isar: the new attribute [rotated n] (default n = 1) rotates the
kleing@24238
   327
premises of a theorem by n. Useful in conjunction with drule.
kleing@24238
   328
wenzelm@19220
   329
* Isar: the goal restriction operator [N] (default N = 1) evaluates a
wenzelm@19220
   330
method expression within a sandbox consisting of the first N
wenzelm@19240
   331
sub-goals, which need to exist.  For example, ``simp_all [3]''
wenzelm@19240
   332
simplifies the first three sub-goals, while (rule foo, simp_all)[]
wenzelm@19240
   333
simplifies all new goals that emerge from applying rule foo to the
wenzelm@19240
   334
originally first one.
wenzelm@19220
   335
wenzelm@19814
   336
* Isar: schematic goals are no longer restricted to higher-order
wenzelm@19814
   337
patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
wenzelm@19814
   338
expected.
wenzelm@19814
   339
wenzelm@18901
   340
* Isar: the conclusion of a long theorem statement is now either
wenzelm@18901
   341
'shows' (a simultaneous conjunction, as before), or 'obtains'
wenzelm@18901
   342
(essentially a disjunction of cases with local parameters and
wenzelm@18901
   343
assumptions).  The latter allows to express general elimination rules
wenzelm@18910
   344
adequately; in this notation common elimination rules look like this:
wenzelm@18901
   345
wenzelm@18901
   346
  lemma exE:    -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
wenzelm@18901
   347
    assumes "EX x. P x"
wenzelm@18901
   348
    obtains x where "P x"
wenzelm@18901
   349
wenzelm@18901
   350
  lemma conjE:  -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
wenzelm@18901
   351
    assumes "A & B"
wenzelm@18901
   352
    obtains A and B
wenzelm@18901
   353
wenzelm@18901
   354
  lemma disjE:  -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
wenzelm@18901
   355
    assumes "A | B"
wenzelm@18901
   356
    obtains
wenzelm@18901
   357
      A
wenzelm@18901
   358
    | B
wenzelm@18901
   359
wenzelm@18910
   360
The subsequent classical rules even refer to the formal "thesis"
wenzelm@18901
   361
explicitly:
wenzelm@18901
   362
wenzelm@18901
   363
  lemma classical:     -- "(~ thesis ==> thesis) ==> thesis"
wenzelm@18901
   364
    obtains "~ thesis"
wenzelm@18901
   365
wenzelm@18910
   366
  lemma Peirce's_Law:  -- "((thesis ==> something) ==> thesis) ==> thesis"
wenzelm@18910
   367
    obtains "thesis ==> something"
wenzelm@18901
   368
wenzelm@18901
   369
The actual proof of an 'obtains' statement is analogous to that of the
wenzelm@18910
   370
Isar proof element 'obtain', only that there may be several cases.
wenzelm@18910
   371
Optional case names may be specified in parentheses; these will be
wenzelm@18910
   372
available both in the present proof and as annotations in the
wenzelm@18910
   373
resulting rule, for later use with the 'cases' method (cf. attribute
wenzelm@18910
   374
case_names).
wenzelm@18901
   375
wenzelm@21447
   376
* Isar: the assumptions of a long theorem statement are available as
wenzelm@21447
   377
"assms" fact in the proof context.  This is more appropriate than the
wenzelm@21447
   378
(historical) "prems", which refers to all assumptions of the current
wenzelm@21447
   379
context, including those from the target locale, proof body etc.
wenzelm@21447
   380
wenzelm@19263
   381
* Isar: 'print_statement' prints theorems from the current theory or
wenzelm@19263
   382
proof context in long statement form, according to the syntax of a
wenzelm@19263
   383
top-level lemma.
wenzelm@19263
   384
wenzelm@18901
   385
* Isar: 'obtain' takes an optional case name for the local context
wenzelm@18901
   386
introduction rule (default "that").
wenzelm@18901
   387
wenzelm@19587
   388
* Isar: removed obsolete 'concl is' patterns.  INCOMPATIBILITY, use
wenzelm@19587
   389
explicit (is "_ ==> ?foo") in the rare cases where this still happens
wenzelm@19587
   390
to occur.
wenzelm@19587
   391
wenzelm@19682
   392
* Pure: syntax "CONST name" produces a fully internalized constant
wenzelm@19682
   393
according to the current context.  This is particularly useful for
wenzelm@19682
   394
syntax translations that should refer to internal constant
wenzelm@19682
   395
representations independently of name spaces.
wenzelm@19682
   396
wenzelm@21537
   397
* Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
wenzelm@21537
   398
instead of "FOO ". This allows multiple binder declarations to coexist
wenzelm@21537
   399
in the same context.  INCOMPATIBILITY.
wenzelm@21537
   400
wenzelm@21209
   401
* Isar/locales: 'notation' provides a robust interface to the 'syntax'
wenzelm@21209
   402
primitive that also works in a locale context (both for constants and
wenzelm@24950
   403
fixed variables). Type declaration and internal syntactic representation
wenzelm@24950
   404
of given constants retrieved from the context. Likewise, the
wenzelm@24950
   405
'no_notation' command allows to remove given syntax annotations from the
wenzelm@24950
   406
current context.
wenzelm@19682
   407
wenzelm@19665
   408
* Isar/locales: new derived specification elements 'axiomatization',
wenzelm@19665
   409
'definition', 'abbreviation', which support type-inference, admit
wenzelm@19083
   410
object-level specifications (equality, equivalence).  See also the
wenzelm@19083
   411
isar-ref manual.  Examples:
wenzelm@19081
   412
wenzelm@19665
   413
  axiomatization
wenzelm@21595
   414
    eq  (infix "===" 50) where
wenzelm@21595
   415
    eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
wenzelm@21595
   416
wenzelm@21595
   417
  definition "f x y = x + y + 1"
wenzelm@21595
   418
  definition g where "g x = f x x"
wenzelm@19081
   419
wenzelm@19363
   420
  abbreviation
wenzelm@21595
   421
    neq  (infix "=!=" 50) where
wenzelm@19363
   422
    "x =!= y == ~ (x === y)"
wenzelm@19081
   423
wenzelm@19083
   424
These specifications may be also used in a locale context.  Then the
wenzelm@19083
   425
constants being introduced depend on certain fixed parameters, and the
wenzelm@19083
   426
constant name is qualified by the locale base name.  An internal
wenzelm@19083
   427
abbreviation takes care for convenient input and output, making the
wenzelm@19088
   428
parameters implicit and using the original short name.  See also
wenzelm@25177
   429
src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
wenzelm@19083
   430
entities from a monomorphic theory.
wenzelm@19083
   431
wenzelm@19083
   432
Presently, abbreviations are only available 'in' a target locale, but
wenzelm@19363
   433
not inherited by general import expressions.  Also note that
wenzelm@19363
   434
'abbreviation' may be used as a type-safe replacement for 'syntax' +
wenzelm@24735
   435
'translations' in common applications.  The "no_abbrevs" print mode
wenzelm@24735
   436
prevents folding of abbreviations in term output.
wenzelm@19084
   437
wenzelm@19682
   438
Concrete syntax is attached to specified constants in internal form,
wenzelm@19682
   439
independently of name spaces.  The parse tree representation is
wenzelm@21209
   440
slightly different -- use 'notation' instead of raw 'syntax', and
wenzelm@19682
   441
'translations' with explicit "CONST" markup to accommodate this.
wenzelm@19665
   442
wenzelm@24800
   443
* Pure/Isar: unified syntax for new-style specification mechanisms
wenzelm@24800
   444
(e.g.  'definition', 'abbreviation', or 'inductive' in HOL) admits
wenzelm@24800
   445
full type inference and dummy patterns ("_").  For example:
wenzelm@24735
   446
wenzelm@24735
   447
  definition "K x _ = x"
wenzelm@24735
   448
wenzelm@24738
   449
  inductive conj for A B
wenzelm@24738
   450
  where "A ==> B ==> conj A B"
wenzelm@24738
   451
wenzelm@21735
   452
* Pure: command 'print_abbrevs' prints all constant abbreviations of
wenzelm@21735
   453
the current context.  Print mode "no_abbrevs" prevents inversion of
wenzelm@21735
   454
abbreviations on output.
wenzelm@21735
   455
wenzelm@24800
   456
* Isar/locales: improved parameter handling: use of locales "var" and
wenzelm@24800
   457
"struct" no longer necessary; - parameter renamings are no longer
wenzelm@24800
   458
required to be injective.  For example, this allows to define
wenzelm@24800
   459
endomorphisms as locale endom = homom mult mult h.
ballarin@19783
   460
ballarin@19931
   461
* Isar/locales: changed the way locales with predicates are defined.
ballarin@19931
   462
Instead of accumulating the specification, the imported expression is
wenzelm@22126
   463
now an interpretation.  INCOMPATIBILITY: different normal form of
wenzelm@22126
   464
locale expressions.  In particular, in interpretations of locales with
wenzelm@22126
   465
predicates, goals repesenting already interpreted fragments are not
wenzelm@22126
   466
removed automatically.  Use methods `intro_locales' and
wenzelm@22126
   467
`unfold_locales'; see below.
wenzelm@22126
   468
wenzelm@22126
   469
* Isar/locales: new methods `intro_locales' and `unfold_locales'
wenzelm@22126
   470
provide backward reasoning on locales predicates.  The methods are
wenzelm@22126
   471
aware of interpretations and discharge corresponding goals.
wenzelm@22126
   472
`intro_locales' is less aggressive then `unfold_locales' and does not
wenzelm@22126
   473
unfold predicates to assumptions.
ballarin@19931
   474
ballarin@19931
   475
* Isar/locales: the order in which locale fragments are accumulated
wenzelm@22126
   476
has changed.  This enables to override declarations from fragments due
wenzelm@22126
   477
to interpretations -- for example, unwanted simp rules.
ballarin@19931
   478
ballarin@23920
   479
* Isar/locales: interpretation in theories and proof contexts has been
ballarin@23920
   480
extended.  One may now specify (and prove) equations, which are
ballarin@23920
   481
unfolded in interpreted theorems.  This is useful for replacing
ballarin@23920
   482
defined concepts (constants depending on locale parameters) by
ballarin@23920
   483
concepts already existing in the target context.  Example:
ballarin@23920
   484
ballarin@23920
   485
  interpretation partial_order ["op <= :: [int, int] => bool"]
ballarin@23920
   486
    where "partial_order.less (op <=) (x::int) y = (x < y)"
ballarin@23920
   487
wenzelm@24800
   488
Typically, the constant `partial_order.less' is created by a
wenzelm@24800
   489
definition specification element in the context of locale
wenzelm@24800
   490
partial_order.
wenzelm@24800
   491
wenzelm@24859
   492
* Method "induct": improved internal context management to support
wenzelm@24800
   493
local fixes and defines on-the-fly. Thus explicit meta-level
wenzelm@24800
   494
connectives !!  and ==> are rarely required anymore in inductive goals
wenzelm@24800
   495
(using object-logic connectives for this purpose has been long
wenzelm@24800
   496
obsolete anyway). Common proof patterns are explained in
wenzelm@25177
   497
src/HOL/Induct/Common_Patterns.thy, see also
wenzelm@25177
   498
src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
wenzelm@25177
   499
examples.
wenzelm@24606
   500
wenzelm@24859
   501
* Method "induct": improved handling of simultaneous goals. Instead of
wenzelm@24606
   502
introducing object-level conjunction, the statement is now split into
wenzelm@24606
   503
several conclusions, while the corresponding symbolic cases are nested
wenzelm@24606
   504
accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
wenzelm@25177
   505
see src/HOL/Induct/Common_Patterns.thy, for example.
wenzelm@24606
   506
wenzelm@24859
   507
* Method "induct": mutual induction rules are now specified as a list
wenzelm@24800
   508
of rule sharing the same induction cases. HOL packages usually provide
wenzelm@24606
   509
foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
wenzelm@24859
   510
predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
wenzelm@24859
   511
mutual induction rules differently, i.e. like this:
wenzelm@18506
   512
wenzelm@18506
   513
  (induct rule: foo_bar.inducts)
wenzelm@18506
   514
  (induct set: foo bar)
wenzelm@24859
   515
  (induct pred: foo bar)
wenzelm@18506
   516
  (induct type: foo bar)
wenzelm@18506
   517
wenzelm@18506
   518
The ML function ProjectRule.projections turns old-style rules into the
wenzelm@18506
   519
new format.
wenzelm@18506
   520
wenzelm@24859
   521
* Method "coinduct": dual of induction, see
wenzelm@18399
   522
src/HOL/Library/Coinductive_List.thy for various examples.
wenzelm@18399
   523
wenzelm@24859
   524
* Method "cases", "induct", "coinduct": the ``(open)'' option is
wenzelm@24859
   525
considered a legacy feature.
wenzelm@24859
   526
wenzelm@20919
   527
* Attribute "symmetric" produces result with standardized schematic
wenzelm@20919
   528
variables (index 0).  Potential INCOMPATIBILITY.
wenzelm@20919
   529
wenzelm@22126
   530
* Simplifier: by default the simplifier trace only shows top level
wenzelm@22126
   531
rewrites now. That is, trace_simp_depth_limit is set to 1 by
wenzelm@22126
   532
default. Thus there is less danger of being flooded by the trace. The
wenzelm@22126
   533
trace indicates where parts have been suppressed.
nipkow@18674
   534
  
wenzelm@18536
   535
* Provers/classical: removed obsolete classical version of elim_format
wenzelm@18536
   536
attribute; classical elim/dest rules are now treated uniformly when
wenzelm@18536
   537
manipulating the claset.
wenzelm@18536
   538
wenzelm@18694
   539
* Provers/classical: stricter checks to ensure that supplied intro,
wenzelm@18694
   540
dest and elim rules are well-formed; dest and elim rules must have at
wenzelm@18694
   541
least one premise.
wenzelm@18694
   542
wenzelm@18694
   543
* Provers/classical: attributes dest/elim/intro take an optional
wenzelm@18695
   544
weight argument for the rule (just as the Pure versions).  Weights are
wenzelm@18696
   545
ignored by automated tools, but determine the search order of single
wenzelm@18694
   546
rule steps.
paulson@18557
   547
wenzelm@18536
   548
* Syntax: input syntax now supports dummy variable binding "%_. b",
wenzelm@18536
   549
where the body does not mention the bound variable.  Note that dummy
wenzelm@18536
   550
patterns implicitly depend on their context of bounds, which makes
wenzelm@18536
   551
"{_. _}" match any set comprehension as expected.  Potential
wenzelm@18536
   552
INCOMPATIBILITY -- parse translations need to cope with syntactic
wenzelm@18536
   553
constant "_idtdummy" in the binding position.
wenzelm@18536
   554
wenzelm@18536
   555
* Syntax: removed obsolete syntactic constant "_K" and its associated
wenzelm@18536
   556
parse translation.  INCOMPATIBILITY -- use dummy abstraction instead,
wenzelm@18536
   557
for example "A -> B" => "Pi A (%_. B)".
wenzelm@17779
   558
wenzelm@20582
   559
* Pure: 'class_deps' command visualizes the subclass relation, using
wenzelm@20582
   560
the graph browser tool.
wenzelm@20582
   561
wenzelm@24800
   562
* Pure: 'print_theory' now suppresses certain internal declarations by
wenzelm@24800
   563
default; use '!' option for full details.
wenzelm@20620
   564
wenzelm@17865
   565
nipkow@17806
   566
*** HOL ***
nipkow@17806
   567
wenzelm@25129
   568
* Method "metis" proves goals by applying the Metis general-purpose
wenzelm@25129
   569
resolution prover (see also http://gilith.com/software/metis/).
wenzelm@25129
   570
Examples are in the directory MetisExamples.  WARNING: the
wenzelm@25129
   571
Isabelle/HOL-Metis integration does not yet work properly with
wenzelm@25129
   572
multi-threading.
wenzelm@25129
   573
  
wenzelm@25129
   574
* Command 'sledgehammer' invokes external automatic theorem provers as
wenzelm@25129
   575
background processes.  It generates calls to the "metis" method if
wenzelm@25129
   576
successful. These can be pasted into the proof.  Users do not have to
wenzelm@25129
   577
wait for the automatic provers to return.  WARNING: does not really
wenzelm@25129
   578
work with multi-threading.
wenzelm@25129
   579
wenzelm@24804
   580
* New "auto_quickcheck" feature tests outermost goal statements for
wenzelm@24804
   581
potential counter-examples.  Controlled by ML references
wenzelm@24804
   582
auto_quickcheck (default true) and auto_quickcheck_time_limit (default
wenzelm@25129
   583
5000 milliseconds).  Fails silently if statements is outside of
wenzelm@25129
   584
executable fragment, or any other codgenerator problem occurs.
wenzelm@24804
   585
haftmann@25184
   586
* New constant "undefined" with axiom "undefined x = undefined".
haftmann@25184
   587
haftmann@25184
   588
* Added class "HOL.eq", allowing for code generation with polymorphic
haftmann@25184
   589
equality.
wenzelm@24800
   590
wenzelm@24800
   591
* Some renaming of class constants due to canonical name prefixing in
wenzelm@24800
   592
the new 'class' package:
haftmann@22997
   593
haftmann@25184
   594
    HOL.abs ~> HOL.abs_class.abs
haftmann@22997
   595
    HOL.divide ~> HOL.divide_class.divide
haftmann@25184
   596
    0 ~> HOL.zero_class.zero
haftmann@25184
   597
    1 ~> HOL.one_class.one
haftmann@25184
   598
    op + ~> HOL.plus_class.plus
haftmann@25184
   599
    op - ~> HOL.minus_class.minus
haftmann@25184
   600
    uminus ~> HOL.minus_class.uminus
haftmann@25184
   601
    op * ~> HOL.times_class.times
haftmann@25184
   602
    op < ~> HOL.ord_class.less
haftmann@25184
   603
    op <= > HOL.ord_class.less_eq
haftmann@24996
   604
    Nat.power ~> Power.power_class.power
haftmann@22997
   605
    Nat.size ~> Nat.size_class.size
haftmann@22997
   606
    Numeral.number_of ~> Numeral.number_class.number_of
haftmann@24996
   607
    FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
haftmann@24996
   608
    FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
haftmann@23129
   609
    Orderings.min ~> Orderings.ord_class.min
haftmann@23129
   610
    Orderings.max ~> Orderings.ord_class.max
haftmann@25184
   611
    Divides.op div ~> Divides.div_class.div
haftmann@25184
   612
    Divides.op mod ~> Divides.div_class.mod
haftmann@25184
   613
    Divides.op dvd ~> Divides.div_class.dvd
haftmann@25184
   614
haftmann@25184
   615
INCOMPATIBILITY.  Adaptions may be required in the following cases:
haftmann@25184
   616
haftmann@25184
   617
a) User-defined constants using any of the names "plus", "minus",
haftmann@25184
   618
"times", "less" or "less_eq". The standard syntax translations for
haftmann@25184
   619
"+", "-" and "*" may go wrong.  INCOMPATIBILITY: use more specific
haftmann@25184
   620
names.
haftmann@25184
   621
haftmann@25184
   622
b) Variables named "plus", "minus", "times", "less", "less_eq"
haftmann@25184
   623
INCOMPATIBILITY: use more specific names.
haftmann@25184
   624
haftmann@25184
   625
c) Permutative equations (e.g. "a + b = b + a")
haftmann@25184
   626
Since the change of names also changes the order of terms, permutative
haftmann@25184
   627
rewrite rules may get applied in a different order. Experience shows
haftmann@25184
   628
that this is rarely the case (only two adaptions in the whole Isabelle
haftmann@25184
   629
distribution).  INCOMPATIBILITY: rewrite proofs
haftmann@25184
   630
haftmann@25184
   631
d) ML code directly refering to constant names
haftmann@25184
   632
This in general only affects hand-written proof tactics, simprocs and
haftmann@25184
   633
so on.  INCOMPATIBILITY: grep your sourcecode and replace names.
haftmann@25184
   634
Consider using @{const_name} antiquotation.
haftmann@24996
   635
wenzelm@24800
   636
* New class "default" with associated constant "default".
wenzelm@24800
   637
wenzelm@24800
   638
* Function "sgn" is now overloaded and available on int, real, complex
wenzelm@24800
   639
(and other numeric types), using class "sgn".  Two possible defs of
wenzelm@24800
   640
sgn are given as equational assumptions in the classes sgn_if and
wenzelm@24800
   641
sgn_div_norm; ordered_idom now also inherits from sgn_if.
wenzelm@24800
   642
INCOMPATIBILITY.
wenzelm@24800
   643
haftmann@25184
   644
* Locale "partial_order" now unified with class "order" (cf. theory
haftmann@25184
   645
Orderings), added parameter "less".  INCOMPATIBILITY.
haftmann@25184
   646
haftmann@25184
   647
* Renamings in classes "order" and "linorder": facts "refl", "trans" and
haftmann@25184
   648
"cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
haftmann@25184
   649
clashes with HOL "refl" and "trans".  INCOMPATIBILITY.
haftmann@25184
   650
haftmann@25184
   651
* Classes "order" and "linorder": potential INCOMPATIBILITY due to
haftmann@25184
   652
changed order of proof goals in instance proofs.
haftmann@25184
   653
haftmann@25184
   654
* The transitivity reasoner for partial and linear orders is set up
haftmann@25184
   655
for classes "order" and "linorder".  Instances of the reasoner are available
haftmann@25184
   656
in all contexts importing or interpreting the corresponding locales.
haftmann@25184
   657
Method "order" invokes the reasoner separately; the reasoner
haftmann@25184
   658
is also integrated with the Simplifier as a solver.  Diagnostic
haftmann@25184
   659
command 'print_orders' shows the available instances of the reasoner
haftmann@25184
   660
in the current context.
haftmann@25184
   661
haftmann@25184
   662
* Localized monotonicity predicate in theory "Orderings"; integrated
haftmann@25184
   663
lemmas max_of_mono and min_of_mono with this predicate.
haftmann@25184
   664
INCOMPATIBILITY.
haftmann@25184
   665
haftmann@25184
   666
* Formulation of theorem "dense" changed slightly due to integration
haftmann@25184
   667
with new class dense_linear_order.
haftmann@25184
   668
haftmann@25184
   669
* Uniform lattice theory development in HOL.
haftmann@22422
   670
haftmann@22422
   671
    constants "meet" and "join" now named "inf" and "sup"
haftmann@22422
   672
    constant "Meet" now named "Inf"
haftmann@22422
   673
haftmann@22450
   674
    classes "meet_semilorder" and "join_semilorder" now named
haftmann@22450
   675
      "lower_semilattice" and "upper_semilattice"
haftmann@22450
   676
    class "lorder" now named "lattice"
haftmann@22450
   677
    class "comp_lat" now named "complete_lattice"
haftmann@22450
   678
haftmann@22450
   679
    Instantiation of lattice classes allows explicit definitions
haftmann@24342
   680
    for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
haftmann@22450
   681
haftmann@23129
   682
  INCOMPATIBILITY.  Theorem renames:
haftmann@22450
   683
haftmann@22422
   684
    meet_left_le            ~> inf_le1
haftmann@22422
   685
    meet_right_le           ~> inf_le2
haftmann@22422
   686
    join_left_le            ~> sup_ge1
haftmann@22422
   687
    join_right_le           ~> sup_ge2
haftmann@22422
   688
    meet_join_le            ~> inf_sup_ord
haftmann@22422
   689
    le_meetI                ~> le_infI
haftmann@22422
   690
    join_leI                ~> le_supI
haftmann@22422
   691
    le_meet                 ~> le_inf_iff
haftmann@22422
   692
    le_join                 ~> ge_sup_conv
haftmann@22422
   693
    meet_idempotent         ~> inf_idem
haftmann@22422
   694
    join_idempotent         ~> sup_idem
haftmann@22422
   695
    meet_comm               ~> inf_commute
haftmann@22422
   696
    join_comm               ~> sup_commute
haftmann@22422
   697
    meet_leI1               ~> le_infI1
haftmann@22422
   698
    meet_leI2               ~> le_infI2
haftmann@22422
   699
    le_joinI1               ~> le_supI1
haftmann@22422
   700
    le_joinI2               ~> le_supI2
haftmann@22422
   701
    meet_assoc              ~> inf_assoc
haftmann@22422
   702
    join_assoc              ~> sup_assoc
haftmann@22422
   703
    meet_left_comm          ~> inf_left_commute
haftmann@22422
   704
    meet_left_idempotent    ~> inf_left_idem
haftmann@22422
   705
    join_left_comm          ~> sup_left_commute
haftmann@22422
   706
    join_left_idempotent    ~> sup_left_idem
haftmann@22422
   707
    meet_aci                ~> inf_aci
haftmann@22422
   708
    join_aci                ~> sup_aci
haftmann@22422
   709
    le_def_meet             ~> le_iff_inf
haftmann@22422
   710
    le_def_join             ~> le_iff_sup
haftmann@22422
   711
    join_absorp2            ~> sup_absorb2
haftmann@22422
   712
    join_absorp1            ~> sup_absorb1
haftmann@22422
   713
    meet_absorp1            ~> inf_absorb1
haftmann@22422
   714
    meet_absorp2            ~> inf_absorb2
haftmann@22422
   715
    meet_join_absorp        ~> inf_sup_absorb
haftmann@22422
   716
    join_meet_absorp        ~> sup_inf_absorb
haftmann@22422
   717
    distrib_join_le         ~> distrib_sup_le
haftmann@22422
   718
    distrib_meet_le         ~> distrib_inf_le
haftmann@22422
   719
haftmann@22422
   720
    add_meet_distrib_left   ~> add_inf_distrib_left
haftmann@22422
   721
    add_join_distrib_left   ~> add_sup_distrib_left
haftmann@22422
   722
    is_join_neg_meet        ~> is_join_neg_inf
haftmann@22422
   723
    is_meet_neg_join        ~> is_meet_neg_sup
haftmann@22422
   724
    add_meet_distrib_right  ~> add_inf_distrib_right
haftmann@22422
   725
    add_join_distrib_right  ~> add_sup_distrib_right
haftmann@22422
   726
    add_meet_join_distribs  ~> add_sup_inf_distribs
haftmann@22422
   727
    join_eq_neg_meet        ~> sup_eq_neg_inf
haftmann@22422
   728
    meet_eq_neg_join        ~> inf_eq_neg_sup
haftmann@22422
   729
    add_eq_meet_join        ~> add_eq_inf_sup
haftmann@22422
   730
    meet_0_imp_0            ~> inf_0_imp_0
haftmann@22422
   731
    join_0_imp_0            ~> sup_0_imp_0
haftmann@22422
   732
    meet_0_eq_0             ~> inf_0_eq_0
haftmann@22422
   733
    join_0_eq_0             ~> sup_0_eq_0
haftmann@22422
   734
    neg_meet_eq_join        ~> neg_inf_eq_sup
haftmann@22422
   735
    neg_join_eq_meet        ~> neg_sup_eq_inf
haftmann@22422
   736
    join_eq_if              ~> sup_eq_if
haftmann@22422
   737
haftmann@22422
   738
    mono_meet               ~> mono_inf
haftmann@22422
   739
    mono_join               ~> mono_sup
haftmann@22422
   740
    meet_bool_eq            ~> inf_bool_eq
haftmann@22422
   741
    join_bool_eq            ~> sup_bool_eq
haftmann@22422
   742
    meet_fun_eq             ~> inf_fun_eq
haftmann@22422
   743
    join_fun_eq             ~> sup_fun_eq
haftmann@22422
   744
    meet_set_eq             ~> inf_set_eq
haftmann@22422
   745
    join_set_eq             ~> sup_set_eq
haftmann@22422
   746
    meet1_iff               ~> inf1_iff
haftmann@22422
   747
    meet2_iff               ~> inf2_iff
haftmann@22422
   748
    meet1I                  ~> inf1I
haftmann@22422
   749
    meet2I                  ~> inf2I
haftmann@22422
   750
    meet1D1                 ~> inf1D1
haftmann@22422
   751
    meet2D1                 ~> inf2D1
haftmann@22422
   752
    meet1D2                 ~> inf1D2
haftmann@22422
   753
    meet2D2                 ~> inf2D2
haftmann@22422
   754
    meet1E                  ~> inf1E
haftmann@22422
   755
    meet2E                  ~> inf2E
haftmann@22422
   756
    join1_iff               ~> sup1_iff
haftmann@22422
   757
    join2_iff               ~> sup2_iff
haftmann@22422
   758
    join1I1                 ~> sup1I1
haftmann@22422
   759
    join2I1                 ~> sup2I1
haftmann@22422
   760
    join1I1                 ~> sup1I1
haftmann@22422
   761
    join2I2                 ~> sup1I2
haftmann@22422
   762
    join1CI                 ~> sup1CI
haftmann@22422
   763
    join2CI                 ~> sup2CI
haftmann@22422
   764
    join1E                  ~> sup1E
haftmann@22422
   765
    join2E                  ~> sup2E
haftmann@22422
   766
haftmann@22422
   767
    is_meet_Meet            ~> is_meet_Inf
haftmann@22422
   768
    Meet_bool_def           ~> Inf_bool_def
haftmann@22422
   769
    Meet_fun_def            ~> Inf_fun_def
haftmann@22422
   770
    Meet_greatest           ~> Inf_greatest
haftmann@22422
   771
    Meet_lower              ~> Inf_lower
haftmann@22422
   772
    Meet_set_def            ~> Inf_set_def
haftmann@22422
   773
haftmann@24342
   774
    Sup_def                 ~> Sup_Inf
haftmann@24342
   775
    Sup_bool_eq             ~> Sup_bool_def
haftmann@24342
   776
    Sup_fun_eq              ~> Sup_fun_def
haftmann@24342
   777
    Sup_set_eq              ~> Sup_set_def
haftmann@24342
   778
haftmann@22422
   779
    listsp_meetI            ~> listsp_infI
haftmann@22422
   780
    listsp_meet_eq          ~> listsp_inf_eq
haftmann@22422
   781
haftmann@22450
   782
    meet_min                ~> inf_min
haftmann@22450
   783
    join_max                ~> sup_max
haftmann@22450
   784
haftmann@25184
   785
* Added syntactic class "size"; overloaded constant "size" now has
haftmann@25184
   786
type "'a::size ==> bool"
haftmann@25184
   787
haftmann@25184
   788
* Internal reorganisation of `size' of datatypes: size theorems
haftmann@25184
   789
"foo.size" are no longer subsumed by "foo.simps" (but are still
haftmann@25184
   790
simplification rules by default!); theorems "prod.size" now named
haftmann@25184
   791
"*.size".
haftmann@25184
   792
haftmann@25184
   793
* Class "div" now inherits from class "times" rather than "type".
haftmann@25184
   794
INCOMPATIBILITY.
haftmann@25184
   795
haftmann@25184
   796
* HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
haftmann@25184
   797
Linorder etc.  have disappeared; operations defined in terms of
haftmann@25184
   798
fold_set now are named Inf_fin, Sup_fin.  INCOMPATIBILITY.
haftmann@25184
   799
haftmann@25184
   800
* HOL/Nat: neq0_conv no longer declared as iff.  INCOMPATIBILITY.
haftmann@25184
   801
haftmann@25184
   802
* HOL-Word: New extensive library and type for generic, fixed size
haftmann@25184
   803
machine words, with arithemtic, bit-wise, shifting and rotating
haftmann@25184
   804
operations, reflection into int, nat, and bool lists, automation for
haftmann@25184
   805
linear arithmetic (by automatic reflection into nat or int), including
haftmann@25184
   806
lemmas on overflow and monotonicity.  Instantiated to all appropriate
haftmann@25184
   807
arithmetic type classes, supporting automatic simplification of
haftmann@25184
   808
numerals on all operations.
haftmann@25184
   809
haftmann@25184
   810
* Library/Boolean_Algebra: locales for abstract boolean algebras.
haftmann@25184
   811
haftmann@25184
   812
* Library/Numeral_Type: numbers as types, e.g. TYPE(32).
haftmann@25184
   813
haftmann@25184
   814
* Code generator library theories:
haftmann@25184
   815
  - Code_Integer represents HOL integers by big integer literals in target
haftmann@25184
   816
    languages.
haftmann@25184
   817
  - Code_Char represents HOL characters by character literals in target
haftmann@25184
   818
    languages.
haftmann@25184
   819
  - Code_Char_chr like Code_Char, but also offers treatment of character
haftmann@25184
   820
    codes; includes Code_Integer.
haftmann@25184
   821
  - Executable_Set allows to generate code for finite sets using lists.
haftmann@25184
   822
  - Executable_Rat implements rational numbers as triples (sign, enumerator,
haftmann@25184
   823
    denominator).
haftmann@25184
   824
  - Executable_Real implements a subset of real numbers, namly those
haftmann@25184
   825
    representable by rational numbers.
haftmann@25184
   826
  - Efficient_Nat implements natural numbers by integers, which in general will
haftmann@25184
   827
    result in higher efficency; pattern matching with 0/Suc is eliminated;
haftmann@25184
   828
    includes Code_Integer.
haftmann@25184
   829
  - Code_Index provides an additional datatype index which is mapped to
haftmann@25184
   830
    target-language built-in integers.
haftmann@25184
   831
  - Code_Message provides an additional datatype message_string} which is isomorphic to
haftmann@25184
   832
    strings; messages are mapped to target-language strings.
haftmann@25184
   833
haftmann@25184
   834
* New package for inductive predicates
haftmann@25184
   835
haftmann@25184
   836
  An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
haftmann@25184
   837
haftmann@25184
   838
    inductive
haftmann@25184
   839
      p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
haftmann@25184
   840
      for z_1 :: U_1 and ... and z_n :: U_m
haftmann@25184
   841
    where
haftmann@25184
   842
      rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
haftmann@25184
   843
    | ...
haftmann@25184
   844
haftmann@25184
   845
  with full support for type-inference, rather than
haftmann@25184
   846
haftmann@25184
   847
    consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
haftmann@25184
   848
haftmann@25184
   849
    abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
haftmann@25184
   850
    where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
haftmann@25184
   851
haftmann@25184
   852
    inductive "s z_1 ... z_m"
haftmann@25184
   853
    intros
haftmann@25184
   854
      rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
haftmann@25184
   855
      ...
haftmann@25184
   856
haftmann@25184
   857
  For backward compatibility, there is a wrapper allowing inductive
haftmann@25184
   858
  sets to be defined with the new package via
haftmann@25184
   859
haftmann@25184
   860
    inductive_set
haftmann@25184
   861
      s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
haftmann@25184
   862
      for z_1 :: U_1 and ... and z_n :: U_m
haftmann@25184
   863
    where
haftmann@25184
   864
      rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
haftmann@25184
   865
    | ...
haftmann@25184
   866
haftmann@25184
   867
  or
haftmann@25184
   868
haftmann@25184
   869
    inductive_set
haftmann@25184
   870
      s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
haftmann@25184
   871
      and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
haftmann@25184
   872
      for z_1 :: U_1 and ... and z_n :: U_m
haftmann@25184
   873
    where
haftmann@25184
   874
      "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
haftmann@25184
   875
    | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
haftmann@25184
   876
    | ...
haftmann@25184
   877
haftmann@25184
   878
  if the additional syntax "p ..." is required.
haftmann@25184
   879
haftmann@25184
   880
  Numerous examples can be found in the subdirectories src/HOL/Auth,
haftmann@25184
   881
  src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
haftmann@25184
   882
haftmann@25184
   883
  INCOMPATIBILITIES:
haftmann@25184
   884
haftmann@25184
   885
  - Since declaration and definition of inductive sets or predicates
haftmann@25184
   886
    is no longer separated, abbreviations involving the newly
haftmann@25184
   887
    introduced sets or predicates must be specified together with the
haftmann@25184
   888
    introduction rules after the 'where' keyword (see above), rather
haftmann@25184
   889
    than before the actual inductive definition.
haftmann@25184
   890
haftmann@25184
   891
  - The variables in induction and elimination rules are now
haftmann@25184
   892
    quantified in the order of their occurrence in the introduction
haftmann@25184
   893
    rules, rather than in alphabetical order. Since this may break
haftmann@25184
   894
    some proofs, these proofs either have to be repaired, e.g. by
haftmann@25184
   895
    reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
haftmann@25184
   896
    statements of the form
haftmann@25184
   897
haftmann@25184
   898
      case (rule_i a_i_1 ... a_i_{k_i})
haftmann@25184
   899
haftmann@25184
   900
    or the old order of quantification has to be restored by explicitly adding
haftmann@25184
   901
    meta-level quantifiers in the introduction rules, i.e.
haftmann@25184
   902
haftmann@25184
   903
      | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
haftmann@25184
   904
haftmann@25184
   905
  - The format of the elimination rules is now
haftmann@25184
   906
haftmann@25184
   907
      p z_1 ... z_m x_1 ... x_n ==>
haftmann@25184
   908
        (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
haftmann@25184
   909
        ==> ... ==> P
haftmann@25184
   910
haftmann@25184
   911
    for predicates and
haftmann@25184
   912
haftmann@25184
   913
      (x_1, ..., x_n) : s z_1 ... z_m ==>
haftmann@25184
   914
        (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
haftmann@25184
   915
        ==> ... ==> P
haftmann@25184
   916
haftmann@25184
   917
    for sets rather than
haftmann@25184
   918
haftmann@25184
   919
      x : s z_1 ... z_m ==>
haftmann@25184
   920
        (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
haftmann@25184
   921
        ==> ... ==> P
haftmann@25184
   922
haftmann@25184
   923
    This may require terms in goals to be expanded to n-tuples
haftmann@25184
   924
    (e.g. using case_tac or simplification with the split_paired_all
haftmann@25184
   925
    rule) before the above elimination rule is applicable.
haftmann@25184
   926
haftmann@25184
   927
  - The elimination or case analysis rules for (mutually) inductive
haftmann@25184
   928
    sets or predicates are now called "p_1.cases" ... "p_k.cases". The
haftmann@25184
   929
    list of rules "p_1_..._p_k.elims" is no longer available.
haftmann@25184
   930
krauss@25198
   931
* New package "function"/"fun" for general recursive functions,
krauss@25198
   932
supporting mutual and nested recursion, definitions in local contexts,
krauss@25198
   933
more general pattern matching and partiality. See HOL/ex/Fundefs.thy
krauss@25198
   934
for small examples, and the separate tutorial on the function
krauss@25198
   935
package. The old recdef "package" is still available as before, but
krauss@25198
   936
users are encouraged to use the new package.
krauss@25198
   937
krauss@25198
   938
* Method "lexicographic_order" automatically synthesizes termination
krauss@25198
   939
relations as lexicographic combinations of size measures. 
krauss@25198
   940
haftmann@25184
   941
* Case-expressions allow arbitrary constructor-patterns (including
haftmann@25184
   942
"_") and take their order into account, like in functional
haftmann@25184
   943
programming.  Internally, this is translated into nested
haftmann@25184
   944
case-expressions; missing cases are added and mapped to the predefined
haftmann@25184
   945
constant "undefined". In complicated cases printing may no longer show
haftmann@25184
   946
the original input but the internal form. Lambda-abstractions allow
haftmann@25184
   947
the same form of pattern matching: "% pat1 => e1 | ..." is an
haftmann@25184
   948
abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
haftmann@25184
   949
variable.
haftmann@25184
   950
haftmann@25184
   951
* IntDef: The constant "int :: nat => int" has been removed; now "int"
haftmann@25184
   952
is an abbreviation for "of_nat :: nat => int". The simplification
haftmann@25184
   953
rules for "of_nat" have been changed to work like "int" did
haftmann@25184
   954
previously.  Potential INCOMPATIBILITY:
haftmann@25184
   955
  - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
haftmann@25184
   956
  - of_nat_diff and of_nat_mult are no longer default simp rules
haftmann@25184
   957
haftmann@25184
   958
* Method "algebra" solves polynomial equations over (semi)rings using
haftmann@25184
   959
Groebner bases. The (semi)ring structure is defined by locales and the
haftmann@25184
   960
tool setup depends on that generic context. Installing the method for
haftmann@25184
   961
a specific type involves instantiating the locale and possibly adding
haftmann@25184
   962
declarations for computation on the coefficients.  The method is
haftmann@25184
   963
already instantiated for natural numbers and for the axiomatic class
haftmann@25184
   964
of idoms with numerals.  See also the paper by Chaieb and Wenzel at
haftmann@25184
   965
CALCULEMUS 2007 for the general principles underlying this
haftmann@25184
   966
architecture of context-aware proof-tools.
haftmann@25184
   967
haftmann@25184
   968
* Method "ferrack" implements quantifier elimination over
haftmann@25184
   969
special-purpose dense linear orders using locales (analogous to
haftmann@25184
   970
"algebra"). The method is already installed for class
haftmann@25184
   971
{ordered_field,recpower,number_ring} which subsumes real, hyperreal,
haftmann@25184
   972
rat, etc.
haftmann@25184
   973
haftmann@25184
   974
* Former constant "List.op @" now named "List.append".  Use ML
haftmann@25184
   975
antiquotations @{const_name List.append} or @{term " ... @ ... "} to
haftmann@25184
   976
circumvent possible incompatibilities when working on ML level.
haftmann@25184
   977
haftmann@25184
   978
* primrec: missing cases mapped to "undefined" instead of "arbitrary".
haftmann@25184
   979
haftmann@25184
   980
* New function listsum :: 'a list => 'a for arbitrary monoids.
haftmann@25184
   981
Special syntax: "SUM x <- xs. f x" (and latex variants)
haftmann@25184
   982
haftmann@25184
   983
* New syntax for Haskell-like list comprehension (input only), eg.
haftmann@25184
   984
[(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
haftmann@25184
   985
haftmann@25184
   986
* The special syntax for function "filter" has changed from [x :
haftmann@25184
   987
xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
haftmann@25184
   988
comprehension syntax, and for uniformity.  INCOMPATIBILITY.
haftmann@25184
   989
haftmann@25184
   990
* [a..b] is now defined for arbitrary linear orders.  It used to be
haftmann@25184
   991
defined on nat only, as an abbreviation for [a..<Suc b]
haftmann@25184
   992
INCOMPATIBILITY.
haftmann@25184
   993
haftmann@25184
   994
* Renamed lemma "set_take_whileD"  to "set_takeWhileD".
haftmann@25184
   995
haftmann@25184
   996
* New functions "sorted" and "sort" in src/HOL/List.thy.
haftmann@25184
   997
haftmann@25184
   998
* New lemma collection field_simps (an extension of ring_simps) for
haftmann@25184
   999
manipulating (in)equations involving division. Multiplies with all
haftmann@25184
  1000
denominators that can be proved to be non-zero (in equations) or
haftmann@25184
  1001
positive/negative (in inequations).
haftmann@25184
  1002
haftmann@25184
  1003
* Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
haftmann@25184
  1004
have been improved and renamed to ring_simps, group_simps and
haftmann@25184
  1005
ring_distribs.  Removed lemmas field_xyz in theory Ring_and_Field
haftmann@25184
  1006
because they were subsumed by lemmas xyz.  INCOMPATIBILITY.
haftmann@25184
  1007
haftmann@25184
  1008
* Theory Library/Commutative_Ring: switched from recdef to function
haftmann@25184
  1009
package; constants add, mul, pow now curried.  Infix syntax for
haftmann@25184
  1010
algebraic operations.
haftmann@25163
  1011
wenzelm@24800
  1012
* Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
haftmann@22218
  1013
INCOMPATIBILITY.
haftmann@22218
  1014
wenzelm@24800
  1015
* Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
haftmann@22218
  1016
INCOMPATIBILITY.
haftmann@22218
  1017
wenzelm@22126
  1018
* HOL/records: generalised field-update to take a function on the
wenzelm@22126
  1019
field rather than the new value: r(|A := x|) is translated to A_update
wenzelm@22126
  1020
(K x) r The K-combinator that is internally used is called K_record.
schirmer@21226
  1021
INCOMPATIBILITY: Usage of the plain update functions has to be
schirmer@21226
  1022
adapted.
schirmer@21226
  1023
 
wenzelm@24800
  1024
* Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
wenzelm@24800
  1025
* x = 0, which are required for a semiring.  Richer structures do not
wenzelm@24800
  1026
inherit from semiring_0 anymore, because this property is a theorem
wenzelm@24800
  1027
there, not an axiom.  INCOMPATIBILITY: In instances of semiring_0,
wenzelm@24800
  1028
there is more to prove, but this is mostly trivial.
wenzelm@24800
  1029
wenzelm@24800
  1030
* Class "recpower" is generalized to arbitrary monoids, not just
wenzelm@24800
  1031
commutative semirings.  INCOMPATIBILITY: may need to incorporate
haftmann@25163
  1032
commutativity or semiring properties additionally.
wenzelm@22126
  1033
wenzelm@22126
  1034
* Constant "List.list_all2" in List.thy now uses authentic syntax.
wenzelm@24800
  1035
INCOMPATIBILITY: translations containing list_all2 may go wrong,
wenzelm@24800
  1036
better use 'abbreviation'.
wenzelm@24800
  1037
wenzelm@24800
  1038
* Renamed constant "List.op mem" to "List.member".  INCOMPATIBILITY.
wenzelm@24800
  1039
wenzelm@22126
  1040
* Numeral syntax: type 'bin' which was a mere type copy of 'int' has
wenzelm@24800
  1041
been abandoned in favour of plain 'int'.  INCOMPATIBILITY --
wenzelm@22126
  1042
significant changes for setting up numeral syntax for types:
wenzelm@24800
  1043
  - New constants Numeral.pred and Numeral.succ instead
haftmann@20485
  1044
      of former Numeral.bin_pred and Numeral.bin_succ.
haftmann@20485
  1045
  - Use integer operations instead of bin_add, bin_mult and so on.
haftmann@20485
  1046
  - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
haftmann@20485
  1047
  - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
haftmann@20485
  1048
wenzelm@25177
  1049
See src/HOL/Integ/IntArith.thy for an example setup.
wenzelm@25177
  1050
wenzelm@25177
  1051
* Command 'normal_form' computes the normal form of a term that may
wenzelm@25177
  1052
contain free variables.  For example ``normal_form "rev [a, b, c]"''
wenzelm@25177
  1053
produces ``[b, c, a]'' (without proof).  This command is suitable for
wenzelm@25177
  1054
heavy-duty computations because the functions are compiled to ML
wenzelm@25177
  1055
first.  Correspondingly, a method "normalization" is provided.  See
wenzelm@25177
  1056
further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
nipkow@19895
  1057
wenzelm@17996
  1058
* Alternative iff syntax "A <-> B" for equality on bool (with priority
wenzelm@17996
  1059
25 like -->); output depends on the "iff" print_mode, the default is
wenzelm@17996
  1060
"A = B" (with priority 50).
wenzelm@17996
  1061
wenzelm@21265
  1062
* Relations less (<) and less_eq (<=) are also available on type bool.
wenzelm@21265
  1063
Modified syntax to disallow nesting without explicit parentheses,
wenzelm@24800
  1064
e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z".  Potential
wenzelm@24800
  1065
INCOMPATIBILITY.
wenzelm@21265
  1066
nipkow@18674
  1067
* "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
nipkow@18674
  1068
krauss@20716
  1069
* Relation composition operator "op O" now has precedence 75 and binds
krauss@20716
  1070
stronger than union and intersection. INCOMPATIBILITY.
krauss@20716
  1071
wenzelm@22126
  1072
* The old set interval syntax "{m..n(}" (and relatives) has been
wenzelm@22126
  1073
removed.  Use "{m..<n}" (and relatives) instead.
nipkow@19377
  1074
wenzelm@17865
  1075
* In the context of the assumption "~(s = t)" the Simplifier rewrites
wenzelm@24800
  1076
"t = s" to False (by simproc "neq").  INCOMPATIBILITY, consider using
wenzelm@24800
  1077
``declare [[simproc del: neq]]''.
wenzelm@24800
  1078
wenzelm@24800
  1079
* Simplifier: "m dvd n" where m and n are numbers is evaluated to
wenzelm@24800
  1080
True/False.
wenzelm@24800
  1081
wenzelm@24800
  1082
* Theorem Cons_eq_map_conv no longer declared as "simp".
nipkow@19211
  1083
ballarin@19279
  1084
* Theorem setsum_mult renamed to setsum_right_distrib.
ballarin@19279
  1085
nipkow@19211
  1086
* Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
wenzelm@22126
  1087
``rule'' method.
wenzelm@22126
  1088
wenzelm@24800
  1089
* Reimplemented methods "sat" and "satx", with several improvements:
wenzelm@24800
  1090
goals no longer need to be stated as "<prems> ==> False", equivalences
wenzelm@24800
  1091
(i.e. "=" on type bool) are handled, variable names of the form
wenzelm@24800
  1092
"lit_<n>" are no longer reserved, significant speedup.
wenzelm@24800
  1093
wenzelm@24800
  1094
* Methods "sat" and "satx" can now replay MiniSat proof traces.
wenzelm@22126
  1095
zChaff is still supported as well.
wenzelm@22126
  1096
wenzelm@22126
  1097
* 'inductive' and 'datatype': provide projections of mutual rules,
wenzelm@22126
  1098
bundled as foo_bar.inducts;
wenzelm@22126
  1099
wenzelm@22126
  1100
* Library: moved theories Parity, GCD, Binomial, Infinite_Set to
wenzelm@22126
  1101
Library.
wenzelm@21256
  1102
wenzelm@21256
  1103
* Library: moved theory Accessible_Part to main HOL.
wenzelm@19572
  1104
wenzelm@18446
  1105
* Library: added theory Coinductive_List of potentially infinite lists
wenzelm@18446
  1106
as greatest fixed-point.
wenzelm@18399
  1107
wenzelm@19254
  1108
* Library: added theory AssocList which implements (finite) maps as
schirmer@19252
  1109
association lists.
webertj@17809
  1110
wenzelm@24800
  1111
* Method "evaluation" solves goals (i.e. a boolean expression)
wenzelm@24800
  1112
efficiently by compiling it to ML.  The goal is "proved" (via an
wenzelm@24800
  1113
oracle) if it evaluates to True.
wenzelm@20807
  1114
wenzelm@20807
  1115
* Linear arithmetic now splits certain operators (e.g. min, max, abs)
wenzelm@24800
  1116
also when invoked by the simplifier.  This results in the Simplifier
wenzelm@24800
  1117
being more powerful on arithmetic goals.  INCOMPATIBILITY.
wenzelm@24800
  1118
Configuration option fast_arith_split_limit=0 recovers the old
wenzelm@24800
  1119
behavior.
webertj@20217
  1120
wenzelm@22126
  1121
* Support for hex (0x20) and binary (0b1001) numerals.
wenzelm@19254
  1122
wenzelm@20807
  1123
* New method: reify eqs (t), where eqs are equations for an
wenzelm@20807
  1124
interpretation I :: 'a list => 'b => 'c and t::'c is an optional
wenzelm@20807
  1125
parameter, computes a term s::'b and a list xs::'a list and proves the
wenzelm@20807
  1126
theorem I xs s = t. This is also known as reification or quoting. The
wenzelm@20807
  1127
resulting theorem is applied to the subgoal to substitute t with I xs
wenzelm@20807
  1128
s.  If t is omitted, the subgoal itself is reified.
wenzelm@20807
  1129
wenzelm@20807
  1130
* New method: reflection corr_thm eqs (t). The parameters eqs and (t)
wenzelm@20807
  1131
are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
wenzelm@20807
  1132
where f is supposed to be a computable function (in the sense of code
wenzelm@20807
  1133
generattion). The method uses reify to compute s and xs as above then
wenzelm@20807
  1134
applies corr_thm and uses normalization by evaluation to "prove" f s =
wenzelm@20807
  1135
r and finally gets the theorem t = r, which is again applied to the
wenzelm@25177
  1136
subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
wenzelm@25177
  1137
wenzelm@25177
  1138
* Reflection: Automatic reification now handels binding, an example is
wenzelm@25177
  1139
available in src/HOL/ex/ReflectionEx.thy
wenzelm@20807
  1140
wenzelm@25397
  1141
* HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
schirmer@25409
  1142
command 'statespace' that is similar to 'record', but introduces an
wenzelm@25397
  1143
abstract specification based on the locale infrastructure instead of
wenzelm@25397
  1144
HOL types.  This leads to extra flexibility in composing state spaces,
wenzelm@25397
  1145
in particular multiple inheritance and renaming of components.
wenzelm@25397
  1146
wenzelm@25397
  1147
wenzelm@19653
  1148
*** HOL-Complex ***
wenzelm@19653
  1149
huffman@22971
  1150
* Hyperreal: Functions root and sqrt are now defined on negative real
huffman@22971
  1151
inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
huffman@22971
  1152
Nonnegativity side conditions have been removed from many lemmas, so
huffman@22971
  1153
that more subgoals may now be solved by simplification; potential
huffman@22971
  1154
INCOMPATIBILITY.
huffman@22971
  1155
wenzelm@24800
  1156
* Real: new type classes formalize real normed vector spaces and
huffman@21791
  1157
algebras, using new overloaded constants scaleR :: real => 'a => 'a
huffman@21791
  1158
and norm :: 'a => real.
huffman@21791
  1159
wenzelm@24800
  1160
* Real: constant of_real :: real => 'a::real_algebra_1 injects from
wenzelm@24800
  1161
reals into other types. The overloaded constant Reals :: 'a set is now
wenzelm@24800
  1162
defined as range of_real; potential INCOMPATIBILITY.
wenzelm@24800
  1163
wenzelm@24800
  1164
* Real: proper support for ML code generation, including 'quickcheck'.
nipkow@23013
  1165
Reals are implemented as arbitrary precision rationals.
nipkow@23013
  1166
wenzelm@22126
  1167
* Hyperreal: Several constants that previously worked only for the
wenzelm@22126
  1168
reals have been generalized, so they now work over arbitrary vector
wenzelm@22126
  1169
spaces. Type annotations may need to be added in some cases; potential
wenzelm@22126
  1170
INCOMPATIBILITY.
huffman@21791
  1171
huffman@22972
  1172
  Infinitesimal  :: ('a::real_normed_vector) star set
huffman@22972
  1173
  HFinite        :: ('a::real_normed_vector) star set
huffman@22972
  1174
  HInfinite      :: ('a::real_normed_vector) star set
huffman@21791
  1175
  approx         :: ('a::real_normed_vector) star => 'a star => bool
huffman@21791
  1176
  monad          :: ('a::real_normed_vector) star => 'a star set
huffman@21791
  1177
  galaxy         :: ('a::real_normed_vector) star => 'a star set
huffman@22972
  1178
  (NS)LIMSEQ     :: [nat => 'a::real_normed_vector, 'a] => bool
huffman@21791
  1179
  (NS)convergent :: (nat => 'a::real_normed_vector) => bool
huffman@21791
  1180
  (NS)Bseq       :: (nat => 'a::real_normed_vector) => bool
huffman@21791
  1181
  (NS)Cauchy     :: (nat => 'a::real_normed_vector) => bool
huffman@21791
  1182
  (NS)LIM        :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
huffman@21791
  1183
  is(NS)Cont     :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
huffman@21791
  1184
  deriv          :: ['a::real_normed_field => 'a, 'a, 'a] => bool
huffman@22972
  1185
  sgn            :: 'a::real_normed_vector => 'a
huffman@23116
  1186
  exp            :: 'a::{recpower,real_normed_field,banach} => 'a
huffman@21791
  1187
huffman@21791
  1188
* Complex: Some complex-specific constants are now abbreviations for
wenzelm@22126
  1189
overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
wenzelm@22126
  1190
hnorm.  Other constants have been entirely removed in favor of the
wenzelm@22126
  1191
polymorphic versions (INCOMPATIBILITY):
huffman@21791
  1192
huffman@21791
  1193
  approx        <-- capprox
huffman@21791
  1194
  HFinite       <-- CFinite
huffman@21791
  1195
  HInfinite     <-- CInfinite
huffman@21791
  1196
  Infinitesimal <-- CInfinitesimal
huffman@21791
  1197
  monad         <-- cmonad
huffman@21791
  1198
  galaxy        <-- cgalaxy
huffman@21791
  1199
  (NS)LIM       <-- (NS)CLIM, (NS)CRLIM
huffman@21791
  1200
  is(NS)Cont    <-- is(NS)Contc, is(NS)contCR
huffman@21791
  1201
  (ns)deriv     <-- (ns)cderiv
huffman@21791
  1202
wenzelm@19653
  1203
wenzelm@24801
  1204
*** HOL-Algebra ***
wenzelm@24801
  1205
wenzelm@24801
  1206
* Formalisation of ideals and the quotient construction over rings.
wenzelm@24801
  1207
wenzelm@24801
  1208
* Order and lattice theory no longer based on records.
wenzelm@24801
  1209
INCOMPATIBILITY.
wenzelm@24801
  1210
wenzelm@24801
  1211
* Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
wenzelm@24801
  1212
greatest_closed.  INCOMPATIBILITY.
wenzelm@24801
  1213
wenzelm@24801
  1214
* Method algebra is now set up via an attribute.  For examples see
wenzelm@24801
  1215
Ring.thy.  INCOMPATIBILITY: the method is now weaker on combinations
wenzelm@24801
  1216
of algebraic structures.
wenzelm@24801
  1217
wenzelm@24801
  1218
* Renamed theory CRing to Ring.
wenzelm@24801
  1219
wenzelm@24801
  1220
wenzelm@24801
  1221
*** HOL-Nominal ***
wenzelm@24801
  1222
wenzelm@25148
  1223
* Substantial, yet incomplete support for nominal datatypes (binding
wenzelm@25177
  1224
structures) based on HOL-Nominal logic.  See src/HOL/Nominal and
wenzelm@25177
  1225
src/HOL/Nominal/Examples.  Prospective users should consult
wenzelm@25148
  1226
http://isabelle.in.tum.de/nominal/
wenzelm@25148
  1227
wenzelm@24801
  1228
wenzelm@17878
  1229
*** ML ***
wenzelm@17878
  1230
wenzelm@24643
  1231
* ML basics: just one true type int, which coincides with IntInf.int
wenzelm@24643
  1232
(even on SML/NJ).
wenzelm@24643
  1233
wenzelm@22138
  1234
* ML within Isar: antiquotations allow to embed statically-checked
wenzelm@22138
  1235
formal entities in the source, referring to the context available at
wenzelm@22138
  1236
compile-time.  For example:
wenzelm@22138
  1237
wenzelm@25142
  1238
ML {* @{sort "{zero,one}"} *}
wenzelm@22138
  1239
ML {* @{typ "'a => 'b"} *}
wenzelm@22138
  1240
ML {* @{term "%x. x"} *}
wenzelm@22138
  1241
ML {* @{prop "x == y"} *}
wenzelm@22138
  1242
ML {* @{ctyp "'a => 'b"} *}
wenzelm@22138
  1243
ML {* @{cterm "%x. x"} *}
wenzelm@22138
  1244
ML {* @{cprop "x == y"} *}
wenzelm@22138
  1245
ML {* @{thm asm_rl} *}
wenzelm@22138
  1246
ML {* @{thms asm_rl} *}
wenzelm@24692
  1247
ML {* @{type_name c} *}
wenzelm@25142
  1248
ML {* @{type_syntax c} *}
wenzelm@22376
  1249
ML {* @{const_name c} *}
wenzelm@22376
  1250
ML {* @{const_syntax c} *}
wenzelm@22138
  1251
ML {* @{context} *}
wenzelm@22138
  1252
ML {* @{theory} *}
wenzelm@22138
  1253
ML {* @{theory Pure} *}
wenzelm@24692
  1254
ML {* @{theory_ref} *}
wenzelm@24692
  1255
ML {* @{theory_ref Pure} *}
wenzelm@22138
  1256
ML {* @{simpset} *}
wenzelm@22138
  1257
ML {* @{claset} *}
wenzelm@22138
  1258
ML {* @{clasimpset} *}
wenzelm@22138
  1259
wenzelm@22151
  1260
The same works for sources being ``used'' within an Isar context.
wenzelm@22151
  1261
wenzelm@22152
  1262
* ML in Isar: improved error reporting; extra verbosity with
wenzelm@24706
  1263
ML_Context.trace enabled.
wenzelm@22152
  1264
wenzelm@19032
  1265
* Pure/General/table.ML: the join operations now works via exceptions
wenzelm@24706
  1266
DUP/SAME instead of type option. This is simpler in simple cases, and
wenzelm@19081
  1267
admits slightly more efficient complex applications.
wenzelm@18446
  1268
wenzelm@24800
  1269
* Pure: 'advanced' translation functions (parse_translation etc.) now
wenzelm@24800
  1270
use Context.generic instead of just theory.
wenzelm@24800
  1271
wenzelm@18642
  1272
* Pure: datatype Context.generic joins theory/Proof.context and
wenzelm@18644
  1273
provides some facilities for code that works in either kind of
wenzelm@18642
  1274
context, notably GenericDataFun for uniform theory and proof data.
wenzelm@18642
  1275
wenzelm@18737
  1276
* Pure: simplified internal attribute type, which is now always
wenzelm@24706
  1277
Context.generic * thm -> Context.generic * thm. Global (theory) vs.
wenzelm@24706
  1278
local (Proof.context) attributes have been discontinued, while
wenzelm@24706
  1279
minimizing code duplication. Thm.rule_attribute and
wenzelm@24706
  1280
Thm.declaration_attribute build canonical attributes; see also structure
wenzelm@24706
  1281
Context for further operations on Context.generic, notably
wenzelm@24706
  1282
GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
wenzelm@19006
  1283
declarations and definitions.
wenzelm@19006
  1284
wenzelm@24800
  1285
* Context data interfaces (Theory/Proof/GenericDataFun): removed
wenzelm@24800
  1286
name/print, uninitialized data defaults to ad-hoc copy of empty value,
wenzelm@24800
  1287
init only required for impure data. INCOMPATIBILITY: empty really need
wenzelm@24800
  1288
to be empty (no dependencies on theory content!)
wenzelm@24800
  1289
wenzelm@19508
  1290
* Pure/kernel: consts certification ignores sort constraints given in
wenzelm@24800
  1291
signature declarations. (This information is not relevant to the
wenzelm@24800
  1292
logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
wenzelm@24800
  1293
potential INCOMPATIBILITY.
wenzelm@19508
  1294
wenzelm@19508
  1295
* Pure: axiomatic type classes are now purely definitional, with
wenzelm@19508
  1296
explicit proofs of class axioms and super class relations performed
wenzelm@24706
  1297
internally. See Pure/axclass.ML for the main internal interfaces --
wenzelm@19508
  1298
notably AxClass.define_class supercedes AxClass.add_axclass, and
wenzelm@24706
  1299
AxClass.axiomatize_class/classrel/arity supersede
wenzelm@19508
  1300
Sign.add_classes/classrel/arities.
wenzelm@19508
  1301
wenzelm@19006
  1302
* Pure/Isar: Args/Attrib parsers operate on Context.generic --
wenzelm@19006
  1303
global/local versions on theory vs. Proof.context have been
wenzelm@19006
  1304
discontinued; Attrib.syntax and Method.syntax have been adapted
wenzelm@19006
  1305
accordingly.  INCOMPATIBILITY, need to adapt parser expressions for
wenzelm@19006
  1306
attributes, methods, etc.
wenzelm@18642
  1307
wenzelm@18446
  1308
* Pure: several functions of signature "... -> theory -> theory * ..."
wenzelm@18446
  1309
have been reoriented to "... -> theory -> ... * theory" in order to
wenzelm@18446
  1310
allow natural usage in combination with the ||>, ||>>, |-> and
wenzelm@18446
  1311
fold_map combinators.
haftmann@18051
  1312
wenzelm@21647
  1313
* Pure: official theorem names (closed derivations) and additional
wenzelm@21647
  1314
comments (tags) are now strictly separate.  Name hints -- which are
wenzelm@21647
  1315
maintained as tags -- may be attached any time without affecting the
wenzelm@21647
  1316
derivation.
wenzelm@21647
  1317
wenzelm@18020
  1318
* Pure: primitive rule lift_rule now takes goal cterm instead of an
wenzelm@18145
  1319
actual goal state (thm).  Use Thm.lift_rule (Thm.cprem_of st i) to
wenzelm@18020
  1320
achieve the old behaviour.
wenzelm@18020
  1321
wenzelm@18020
  1322
* Pure: the "Goal" constant is now called "prop", supporting a
wenzelm@18020
  1323
slightly more general idea of ``protecting'' meta-level rule
wenzelm@18020
  1324
statements.
wenzelm@18020
  1325
wenzelm@20040
  1326
* Pure: Logic.(un)varify only works in a global context, which is now
wenzelm@20040
  1327
enforced instead of silently assumed.  INCOMPATIBILITY, may use
wenzelm@20040
  1328
Logic.legacy_(un)varify as temporary workaround.
wenzelm@20040
  1329
wenzelm@20090
  1330
* Pure: structure Name provides scalable operations for generating
wenzelm@20090
  1331
internal variable names, notably Name.variants etc.  This replaces
wenzelm@20090
  1332
some popular functions from term.ML:
wenzelm@20090
  1333
wenzelm@20090
  1334
  Term.variant		->  Name.variant
wenzelm@24800
  1335
  Term.variantlist	->  Name.variant_list
wenzelm@20090
  1336
  Term.invent_names	->  Name.invent_list
wenzelm@20090
  1337
wenzelm@20090
  1338
Note that low-level renaming rarely occurs in new code -- operations
wenzelm@20090
  1339
from structure Variable are used instead (see below).
wenzelm@20090
  1340
wenzelm@20040
  1341
* Pure: structure Variable provides fundamental operations for proper
wenzelm@20040
  1342
treatment of fixed/schematic variables in a context.  For example,
wenzelm@20040
  1343
Variable.import introduces fixes for schematics of given facts and
wenzelm@20040
  1344
Variable.export reverses the effect (up to renaming) -- this replaces
wenzelm@20040
  1345
various freeze_thaw operations.
wenzelm@20040
  1346
wenzelm@18567
  1347
* Pure: structure Goal provides simple interfaces for
wenzelm@17981
  1348
init/conclude/finish and tactical prove operations (replacing former
wenzelm@20040
  1349
Tactic.prove).  Goal.prove is the canonical way to prove results
wenzelm@20040
  1350
within a given context; Goal.prove_global is a degraded version for
wenzelm@20040
  1351
theory level goals, including a global Drule.standard.  Note that
wenzelm@20040
  1352
OldGoals.prove_goalw_cterm has long been obsolete, since it is
wenzelm@20040
  1353
ill-behaved in a local proof context (e.g. with local fixes/assumes or
wenzelm@20040
  1354
in a locale context).
wenzelm@17981
  1355
wenzelm@24706
  1356
* Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
wenzelm@24706
  1357
and type checking (Syntax.check_term etc.), with common combinations
wenzelm@24706
  1358
(Syntax.read_term etc.). These supersede former Sign.read_term etc.
wenzelm@24706
  1359
which are considered legacy and await removal.
wenzelm@24706
  1360
wenzelm@24920
  1361
* Pure/Syntax: generic interfaces for type unchecking
wenzelm@24920
  1362
(Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
wenzelm@24920
  1363
with common combinations (Syntax.pretty_term, Syntax.string_of_term
wenzelm@24920
  1364
etc.).  Former Sign.pretty_term, Sign.string_of_term etc. are still
wenzelm@24924
  1365
available for convenience, but refer to the very same operations using
wenzelm@24924
  1366
a mere theory instead of a full context.
wenzelm@24920
  1367
wenzelm@18815
  1368
* Isar: simplified treatment of user-level errors, using exception
wenzelm@18687
  1369
ERROR of string uniformly.  Function error now merely raises ERROR,
wenzelm@18686
  1370
without any side effect on output channels.  The Isar toplevel takes
wenzelm@18686
  1371
care of proper display of ERROR exceptions.  ML code may use plain
wenzelm@18686
  1372
handle/can/try; cat_error may be used to concatenate errors like this:
wenzelm@18686
  1373
wenzelm@18686
  1374
  ... handle ERROR msg => cat_error msg "..."
wenzelm@18686
  1375
wenzelm@18686
  1376
Toplevel ML code (run directly or through the Isar toplevel) may be
wenzelm@18687
  1377
embedded into the Isar toplevel with exception display/debug like
wenzelm@18687
  1378
this:
wenzelm@18686
  1379
wenzelm@18686
  1380
  Isar.toplevel (fn () => ...)
wenzelm@18686
  1381
wenzelm@18686
  1382
INCOMPATIBILITY, removed special transform_error facilities, removed
wenzelm@18686
  1383
obsolete variants of user-level exceptions (ERROR_MESSAGE,
wenzelm@18686
  1384
Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
wenzelm@18686
  1385
-- use plain ERROR instead.
wenzelm@18686
  1386
wenzelm@18815
  1387
* Isar: theory setup now has type (theory -> theory), instead of a
wenzelm@18722
  1388
list.  INCOMPATIBILITY, may use #> to compose setup functions.
wenzelm@18722
  1389
wenzelm@24706
  1390
* Isar: ML toplevel pretty printer for type Proof.context, subject to
wenzelm@24706
  1391
ProofContext.debug/verbose flags.
wenzelm@18815
  1392
wenzelm@18815
  1393
* Isar: Toplevel.theory_to_proof admits transactions that modify the
wenzelm@18815
  1394
theory before entering a proof state.  Transactions now always see a
wenzelm@18815
  1395
quasi-functional intermediate checkpoint, both in interactive and
wenzelm@18590
  1396
batch mode.
wenzelm@18567
  1397
wenzelm@24867
  1398
* Isar: simplified interfaces for outer syntax.  Renamed
wenzelm@24867
  1399
OuterSyntax.add_keywords to OuterSyntax.keywords.  Removed
wenzelm@24867
  1400
OuterSyntax.add_parsers -- this functionality is now included in
wenzelm@24867
  1401
OuterSyntax.command etc.  INCOMPATIBILITY.
wenzelm@24867
  1402
wenzelm@17878
  1403
* Simplifier: the simpset of a running simplification process now
wenzelm@17878
  1404
contains a proof context (cf. Simplifier.the_context), which is the
wenzelm@17878
  1405
very context that the initial simpset has been retrieved from (by
wenzelm@17890
  1406
simpset_of/local_simpset_of).  Consequently, all plug-in components
wenzelm@17878
  1407
(solver, looper etc.) may depend on arbitrary proof data.
wenzelm@17878
  1408
wenzelm@17878
  1409
* Simplifier.inherit_context inherits the proof context (plus the
wenzelm@17878
  1410
local bounds) of the current simplification process; any simproc
wenzelm@17878
  1411
etc. that calls the Simplifier recursively should do this!  Removed
wenzelm@17878
  1412
former Simplifier.inherit_bounds, which is already included here --
wenzelm@17890
  1413
INCOMPATIBILITY.  Tools based on low-level rewriting may even have to
wenzelm@17890
  1414
specify an explicit context using Simplifier.context/theory_context.
wenzelm@17878
  1415
wenzelm@17878
  1416
* Simplifier/Classical Reasoner: more abstract interfaces
wenzelm@17878
  1417
change_simpset/claset for modifying the simpset/claset reference of a
wenzelm@17878
  1418
theory; raw versions simpset/claset_ref etc. have been discontinued --
wenzelm@17878
  1419
INCOMPATIBILITY.
wenzelm@17878
  1420
wenzelm@18540
  1421
* Provers: more generic wrt. syntax of object-logics, avoid hardwired
wenzelm@18540
  1422
"Trueprop" etc.
wenzelm@18540
  1423
wenzelm@17878
  1424
wenzelm@20988
  1425
*** System ***
wenzelm@20988
  1426
wenzelm@25433
  1427
* settings: the default heap location within ISABELLE_HOME_USER now
wenzelm@25433
  1428
includes ISABELLE_IDENTIFIER.  This simplifies use of multiple
wenzelm@25433
  1429
Isabelle installations.
wenzelm@21471
  1430
wenzelm@20988
  1431
* isabelle-process: option -S (secure mode) disables some critical
wenzelm@20988
  1432
operations, notably runtime compilation and evaluation of ML source
wenzelm@20988
  1433
code.
wenzelm@20988
  1434
wenzelm@24891
  1435
* Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
wenzelm@24891
  1436
wenzelm@24801
  1437
* Support for parallel execution, using native multicore support of
wenzelm@24800
  1438
Poly/ML 5.1.  The theory loader exploits parallelism when processing
wenzelm@24800
  1439
independent theories, according to the given theory header
wenzelm@24800
  1440
specifications. The maximum number of worker threads is specified via
wenzelm@24800
  1441
usedir option -M or the "max-threads" setting in Proof General. A
wenzelm@24800
  1442
speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
wenzelm@24800
  1443
to 6 on a 8-core machine.  User-code needs to observe certain
wenzelm@24800
  1444
guidelines for thread-safe programming, see appendix A in the Isar
wenzelm@24800
  1445
Implementation manual.
wenzelm@24210
  1446
wenzelm@17754
  1447
wenzelm@25448
  1448
wenzelm@17720
  1449
New in Isabelle2005 (October 2005)
wenzelm@17720
  1450
----------------------------------
wenzelm@14655
  1451
wenzelm@14655
  1452
*** General ***
wenzelm@14655
  1453
nipkow@15130
  1454
* Theory headers: the new header syntax for Isar theories is
nipkow@15130
  1455
nipkow@15130
  1456
  theory <name>
wenzelm@16234
  1457
  imports <theory1> ... <theoryN>
wenzelm@16234
  1458
  uses <file1> ... <fileM>
nipkow@15130
  1459
  begin
nipkow@15130
  1460
wenzelm@16234
  1461
where the 'uses' part is optional.  The previous syntax
wenzelm@16234
  1462
wenzelm@16234
  1463
  theory <name> = <theory1> + ... + <theoryN>:
wenzelm@16234
  1464
wenzelm@16717
  1465
will disappear in the next release.  Use isatool fixheaders to convert
wenzelm@16717
  1466
existing theory files.  Note that there is no change in ancient
wenzelm@17371
  1467
non-Isar theories now, but these will disappear soon.
nipkow@15130
  1468
berghofe@15475
  1469
* Theory loader: parent theories can now also be referred to via
wenzelm@16234
  1470
relative and absolute paths.
wenzelm@16234
  1471
wenzelm@17408
  1472
* Command 'find_theorems' searches for a list of criteria instead of a
wenzelm@17408
  1473
list of constants. Known criteria are: intro, elim, dest, name:string,
wenzelm@17408
  1474
simp:term, and any term. Criteria can be preceded by '-' to select
wenzelm@17408
  1475
theorems that do not match. Intro, elim, dest select theorems that
wenzelm@17408
  1476
match the current goal, name:s selects theorems whose fully qualified
wenzelm@17408
  1477
name contain s, and simp:term selects all simplification rules whose
wenzelm@17408
  1478
lhs match term.  Any other term is interpreted as pattern and selects
wenzelm@17408
  1479
all theorems matching the pattern. Available in ProofGeneral under
wenzelm@17408
  1480
'ProofGeneral -> Find Theorems' or C-c C-f.  Example:
wenzelm@16234
  1481
wenzelm@17275
  1482
  C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
wenzelm@16234
  1483
wenzelm@16234
  1484
prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
wenzelm@16234
  1485
matching the current goal as introduction rule and not having "HOL."
wenzelm@16234
  1486
in their name (i.e. not being defined in theory HOL).
wenzelm@16234
  1487
wenzelm@17408
  1488
* Command 'thms_containing' has been discontinued in favour of
wenzelm@17408
  1489
'find_theorems'; INCOMPATIBILITY.
wenzelm@17408
  1490
wenzelm@17385
  1491
* Communication with Proof General is now 8bit clean, which means that
wenzelm@17385
  1492
Unicode text in UTF-8 encoding may be used within theory texts (both
wenzelm@17408
  1493
formal and informal parts).  Cf. option -U of the Isabelle Proof
wenzelm@17538
  1494
General interface.  Here are some simple examples (cf. src/HOL/ex):
wenzelm@17538
  1495
wenzelm@17538
  1496
  http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
wenzelm@17538
  1497
  http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
wenzelm@17385
  1498
wenzelm@17425
  1499
* Improved efficiency of the Simplifier and, to a lesser degree, the
wenzelm@17425
  1500
Classical Reasoner.  Typical big applications run around 2 times
wenzelm@17425
  1501
faster.
wenzelm@17425
  1502
wenzelm@16234
  1503
wenzelm@16234
  1504
*** Document preparation ***
wenzelm@16234
  1505
wenzelm@16234
  1506
* Commands 'display_drafts' and 'print_drafts' perform simple output
wenzelm@16234
  1507
of raw sources.  Only those symbols that do not require additional
wenzelm@16234
  1508
LaTeX packages (depending on comments in isabellesym.sty) are
wenzelm@16234
  1509
displayed properly, everything else is left verbatim.  isatool display
wenzelm@16234
  1510
and isatool print are used as front ends (these are subject to the
wenzelm@16234
  1511
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
wenzelm@16234
  1512
wenzelm@17047
  1513
* Command tags control specific markup of certain regions of text,
wenzelm@17047
  1514
notably folding and hiding.  Predefined tags include "theory" (for
wenzelm@17047
  1515
theory begin and end), "proof" for proof commands, and "ML" for
wenzelm@17047
  1516
commands involving ML code; the additional tags "visible" and
wenzelm@17047
  1517
"invisible" are unused by default.  Users may give explicit tag
wenzelm@17047
  1518
specifications in the text, e.g. ''by %invisible (auto)''.  The
wenzelm@17047
  1519
interpretation of tags is determined by the LaTeX job during document
wenzelm@17047
  1520
preparation: see option -V of isatool usedir, or options -n and -t of
wenzelm@17047
  1521
isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
wenzelm@17047
  1522
\isadroptag.
wenzelm@17047
  1523
wenzelm@17047
  1524
Several document versions may be produced at the same time via isatool
wenzelm@17047
  1525
usedir (the generated index.html will link all of them).  Typical
wenzelm@17047
  1526
specifications include ''-V document=theory,proof,ML'' to present
wenzelm@17047
  1527
theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
wenzelm@17047
  1528
proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
wenzelm@17047
  1529
these parts without any formal replacement text.  The Isabelle site
wenzelm@17047
  1530
default settings produce ''document'' and ''outline'' versions as
wenzelm@17047
  1531
specified above.
wenzelm@16234
  1532
haftmann@17402
  1533
* Several new antiquotations:
wenzelm@16234
  1534
wenzelm@16234
  1535
  @{term_type term} prints a term with its type annotated;
wenzelm@16234
  1536
wenzelm@16234
  1537
  @{typeof term} prints the type of a term;
wenzelm@16234
  1538
wenzelm@16234
  1539
  @{const const} is the same as @{term const}, but checks that the
wenzelm@16234
  1540
  argument is a known logical constant;
wenzelm@16234
  1541
wenzelm@16234
  1542
  @{term_style style term} and @{thm_style style thm} print a term or
wenzelm@16234
  1543
  theorem applying a "style" to it
wenzelm@16234
  1544
wenzelm@17117
  1545
  @{ML text}
wenzelm@17117
  1546
wenzelm@16234
  1547
Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
wenzelm@16234
  1548
definitions, equations, inequations etc., 'concl' printing only the
schirmer@17393
  1549
conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
wenzelm@16234
  1550
to print the specified premise.  TermStyle.add_style provides an ML
wenzelm@16234
  1551
interface for introducing further styles.  See also the "LaTeX Sugar"
wenzelm@17117
  1552
document practical applications.  The ML antiquotation prints
wenzelm@17117
  1553
type-checked ML expressions verbatim.
wenzelm@16234
  1554
wenzelm@17259
  1555
* Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
wenzelm@17259
  1556
and 'text' support optional locale specification '(in loc)', which
wenzelm@17269
  1557
specifies the default context for interpreting antiquotations.  For
wenzelm@17269
  1558
example: 'text (in lattice) {* @{thm inf_assoc}*}'.
wenzelm@17259
  1559
wenzelm@17259
  1560
* Option 'locale=NAME' of antiquotations specifies an alternative
wenzelm@17259
  1561
context interpreting the subsequent argument.  For example: @{thm
wenzelm@17269
  1562
[locale=lattice] inf_assoc}.
wenzelm@17259
  1563
wenzelm@17097
  1564
* Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
wenzelm@17097
  1565
a proof context.
wenzelm@17097
  1566
wenzelm@17097
  1567
* Proper output of antiquotations for theory commands involving a
wenzelm@17097
  1568
proof context (such as 'locale' or 'theorem (in loc) ...').
wenzelm@17097
  1569
wenzelm@17193
  1570
* Delimiters of outer tokens (string etc.) now produce separate LaTeX
wenzelm@17193
  1571
macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
wenzelm@17193
  1572
wenzelm@17193
  1573
* isatool usedir: new option -C (default true) controls whether option
wenzelm@17193
  1574
-D should include a copy of the original document directory; -C false
wenzelm@17193
  1575
prevents unwanted effects such as copying of administrative CVS data.
wenzelm@17193
  1576
wenzelm@16234
  1577
wenzelm@16234
  1578
*** Pure ***
wenzelm@16234
  1579
wenzelm@16234
  1580
* Considerably improved version of 'constdefs' command.  Now performs
wenzelm@16234
  1581
automatic type-inference of declared constants; additional support for
wenzelm@16234
  1582
local structure declarations (cf. locales and HOL records), see also
wenzelm@16234
  1583
isar-ref manual.  Potential INCOMPATIBILITY: need to observe strictly
wenzelm@16234
  1584
sequential dependencies of definitions within a single 'constdefs'
wenzelm@16234
  1585
section; moreover, the declared name needs to be an identifier.  If
wenzelm@16234
  1586
all fails, consider to fall back on 'consts' and 'defs' separately.
wenzelm@16234
  1587
wenzelm@16234
  1588
* Improved indexed syntax and implicit structures.  First of all,
wenzelm@16234
  1589
indexed syntax provides a notational device for subscripted
wenzelm@16234
  1590
application, using the new syntax \<^bsub>term\<^esub> for arbitrary
wenzelm@16234
  1591
expressions.  Secondly, in a local context with structure
wenzelm@16234
  1592
declarations, number indexes \<^sub>n or the empty index (default
wenzelm@16234
  1593
number 1) refer to a certain fixed variable implicitly; option
wenzelm@16234
  1594
show_structs controls printing of implicit structures.  Typical
wenzelm@16234
  1595
applications of these concepts involve record types and locales.
wenzelm@16234
  1596
wenzelm@16234
  1597
* New command 'no_syntax' removes grammar declarations (and
wenzelm@16234
  1598
translations) resulting from the given syntax specification, which is
wenzelm@16234
  1599
interpreted in the same manner as for the 'syntax' command.
wenzelm@16234
  1600
wenzelm@16234
  1601
* 'Advanced' translation functions (parse_translation etc.) may depend
wenzelm@16234
  1602
on the signature of the theory context being presently used for
wenzelm@16234
  1603
parsing/printing, see also isar-ref manual.
wenzelm@16234
  1604
wenzelm@16856
  1605
* Improved 'oracle' command provides a type-safe interface to turn an
wenzelm@16856
  1606
ML expression of type theory -> T -> term into a primitive rule of
wenzelm@16856
  1607
type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
wenzelm@16856
  1608
is already included here); see also FOL/ex/IffExample.thy;
wenzelm@16856
  1609
INCOMPATIBILITY.
wenzelm@16856
  1610
wenzelm@17275
  1611
* axclass: name space prefix for class "c" is now "c_class" (was "c"
wenzelm@17275
  1612
before); "cI" is no longer bound, use "c.intro" instead.
wenzelm@17275
  1613
INCOMPATIBILITY.  This change avoids clashes of fact bindings for
wenzelm@17275
  1614
axclasses vs. locales.
wenzelm@17275
  1615
wenzelm@16234
  1616
* Improved internal renaming of symbolic identifiers -- attach primes
wenzelm@16234
  1617
instead of base 26 numbers.
wenzelm@16234
  1618
wenzelm@16234
  1619
* New flag show_question_marks controls printing of leading question
wenzelm@16234
  1620
marks in schematic variable names.
wenzelm@16234
  1621
wenzelm@16234
  1622
* In schematic variable names, *any* symbol following \<^isub> or
wenzelm@16234
  1623
\<^isup> is now treated as part of the base name.  For example, the
wenzelm@16234
  1624
following works without printing of awkward ".0" indexes:
wenzelm@16234
  1625
wenzelm@16234
  1626
  lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
wenzelm@16234
  1627
    by simp
wenzelm@16234
  1628
wenzelm@16234
  1629
* Inner syntax includes (*(*nested*) comments*).
wenzelm@16234
  1630
wenzelm@17548
  1631
* Pretty printer now supports unbreakable blocks, specified in mixfix
wenzelm@16234
  1632
annotations as "(00...)".
wenzelm@16234
  1633
wenzelm@16234
  1634
* Clear separation of logical types and nonterminals, where the latter
wenzelm@16234
  1635
may only occur in 'syntax' specifications or type abbreviations.
wenzelm@16234
  1636
Before that distinction was only partially implemented via type class
wenzelm@16234
  1637
"logic" vs. "{}".  Potential INCOMPATIBILITY in rare cases of improper
wenzelm@16234
  1638
use of 'types'/'consts' instead of 'nonterminals'/'syntax'.  Some very
wenzelm@16234
  1639
exotic syntax specifications may require further adaption
wenzelm@17691
  1640
(e.g. Cube/Cube.thy).
wenzelm@16234
  1641
wenzelm@16234
  1642
* Removed obsolete type class "logic", use the top sort {} instead.
wenzelm@16234
  1643
Note that non-logical types should be declared as 'nonterminals'
wenzelm@16234
  1644
rather than 'types'.  INCOMPATIBILITY for new object-logic
wenzelm@16234
  1645
specifications.
wenzelm@16234
  1646
ballarin@17095
  1647
* Attributes 'induct' and 'cases': type or set names may now be
ballarin@17095
  1648
locally fixed variables as well.
ballarin@17095
  1649
wenzelm@16234
  1650
* Simplifier: can now control the depth to which conditional rewriting
wenzelm@16234
  1651
is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
wenzelm@16234
  1652
Limit.
wenzelm@16234
  1653
wenzelm@16234
  1654
* Simplifier: simplification procedures may now take the current
wenzelm@16234
  1655
simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
wenzelm@16234
  1656
interface), which is very useful for calling the Simplifier
wenzelm@16234
  1657
recursively.  Minor INCOMPATIBILITY: the 'prems' argument of simprocs
wenzelm@16234
  1658
is gone -- use prems_of_ss on the simpset instead.  Moreover, the
wenzelm@16234
  1659
low-level mk_simproc no longer applies Logic.varify internally, to
wenzelm@16234
  1660
allow for use in a context of fixed variables.
wenzelm@16234
  1661
wenzelm@16234
  1662
* thin_tac now works even if the assumption being deleted contains !!
wenzelm@16234
  1663
or ==>.  More generally, erule now works even if the major premise of
wenzelm@16234
  1664
the elimination rule contains !! or ==>.
wenzelm@16234
  1665
wenzelm@17597
  1666
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
nipkow@17590
  1667
wenzelm@16234
  1668
* Reorganized bootstrapping of the Pure theories; CPure is now derived
wenzelm@16234
  1669
from Pure, which contains all common declarations already.  Both
wenzelm@16234
  1670
theories are defined via plain Isabelle/Isar .thy files.
wenzelm@16234
  1671
INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
wenzelm@16234
  1672
CPure.elim / CPure.dest attributes) now appear in the Pure name space;
wenzelm@16234
  1673
use isatool fixcpure to adapt your theory and ML sources.
wenzelm@16234
  1674
wenzelm@16234
  1675
* New syntax 'name(i-j, i-, i, ...)' for referring to specific
wenzelm@16234
  1676
selections of theorems in named facts via index ranges.
wenzelm@16234
  1677
wenzelm@17097
  1678
* 'print_theorems': in theory mode, really print the difference
wenzelm@17097
  1679
wrt. the last state (works for interactive theory development only),
wenzelm@17097
  1680
in proof mode print all local facts (cf. 'print_facts');
wenzelm@17097
  1681
wenzelm@17397
  1682
* 'hide': option '(open)' hides only base names.
wenzelm@17397
  1683
wenzelm@17275
  1684
* More efficient treatment of intermediate checkpoints in interactive
wenzelm@17275
  1685
theory development.
wenzelm@17275
  1686
berghofe@17663
  1687
* Code generator is now invoked via code_module (incremental code
wenzelm@17664
  1688
generation) and code_library (modular code generation, ML structures
wenzelm@17664
  1689
for each theory).  INCOMPATIBILITY: new keywords 'file' and 'contains'
wenzelm@17664
  1690
must be quoted when used as identifiers.
wenzelm@17664
  1691
wenzelm@17664
  1692
* New 'value' command for reading, evaluating and printing terms using
wenzelm@17664
  1693
the code generator.  INCOMPATIBILITY: command keyword 'value' must be
wenzelm@17664
  1694
quoted when used as identifier.
berghofe@17663
  1695
wenzelm@16234
  1696
wenzelm@16234
  1697
*** Locales ***
ballarin@17095
  1698
wenzelm@17385
  1699
* New commands for the interpretation of locale expressions in
wenzelm@17385
  1700
theories (1), locales (2) and proof contexts (3).  These generate
wenzelm@17385
  1701
proof obligations from the expression specification.  After the
wenzelm@17385
  1702
obligations have been discharged, theorems of the expression are added
wenzelm@17385
  1703
to the theory, target locale or proof context.  The synopsis of the
wenzelm@17385
  1704
commands is a follows:
wenzelm@17385
  1705
ballarin@17095
  1706
  (1) interpretation expr inst
ballarin@17095
  1707
  (2) interpretation target < expr
ballarin@17095
  1708
  (3) interpret expr inst
wenzelm@17385
  1709
ballarin@17095
  1710
Interpretation in theories and proof contexts require a parameter
ballarin@17095
  1711
instantiation of terms from the current context.  This is applied to
wenzelm@17385
  1712
specifications and theorems of the interpreted expression.
wenzelm@17385
  1713
Interpretation in locales only permits parameter renaming through the
wenzelm@17385
  1714
locale expression.  Interpretation is smart in that interpretations
wenzelm@17385
  1715
that are active already do not occur in proof obligations, neither are
wenzelm@17385
  1716
instantiated theorems stored in duplicate.  Use 'print_interps' to
wenzelm@17385
  1717
inspect active interpretations of a particular locale.  For details,
ballarin@17436
  1718
see the Isar Reference manual.  Examples can be found in
ballarin@17436
  1719
HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
wenzelm@16234
  1720
wenzelm@16234
  1721
INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
wenzelm@16234
  1722
'interpret' instead.
wenzelm@16234
  1723
wenzelm@17385
  1724
* New context element 'constrains' for adding type constraints to
wenzelm@17385
  1725
parameters.
wenzelm@17385
  1726
wenzelm@17385
  1727
* Context expressions: renaming of parameters with syntax
wenzelm@17385
  1728
redeclaration.
ballarin@17095
  1729
ballarin@17095
  1730
* Locale declaration: 'includes' disallowed.
ballarin@17095
  1731
wenzelm@16234
  1732
* Proper static binding of attribute syntax -- i.e. types / terms /
wenzelm@16234
  1733
facts mentioned as arguments are always those of the locale definition
wenzelm@16234
  1734
context, independently of the context of later invocations.  Moreover,
wenzelm@16234
  1735
locale operations (renaming and type / term instantiation) are applied
wenzelm@16234
  1736
to attribute arguments as expected.
wenzelm@16234
  1737
wenzelm@16234
  1738
INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
wenzelm@16234
  1739
actual attributes; rare situations may require Attrib.attribute to
wenzelm@16234
  1740
embed those attributes into Attrib.src that lack concrete syntax.
wenzelm@16234
  1741
Attribute implementations need to cooperate properly with the static
wenzelm@16234
  1742
binding mechanism.  Basic parsers Args.XXX_typ/term/prop and
wenzelm@16234
  1743
Attrib.XXX_thm etc. already do the right thing without further
wenzelm@16234
  1744
intervention.  Only unusual applications -- such as "where" or "of"
wenzelm@16234
  1745
(cf. src/Pure/Isar/attrib.ML), which process arguments depending both
wenzelm@16234
  1746
on the context and the facts involved -- may have to assign parsed
wenzelm@16234
  1747
values to argument tokens explicitly.
wenzelm@16234
  1748
wenzelm@16234
  1749
* Changed parameter management in theorem generation for long goal
wenzelm@16234
  1750
statements with 'includes'.  INCOMPATIBILITY: produces a different
wenzelm@16234
  1751
theorem statement in rare situations.
wenzelm@16234
  1752
ballarin@17228
  1753
* Locale inspection command 'print_locale' omits notes elements.  Use
ballarin@17228
  1754
'print_locale!' to have them included in the output.
ballarin@17228
  1755
wenzelm@16234
  1756
wenzelm@16234
  1757
*** Provers ***
wenzelm@16234
  1758
wenzelm@16234
  1759
* Provers/hypsubst.ML: improved version of the subst method, for
wenzelm@16234
  1760
single-step rewriting: it now works in bound variable contexts. New is
wenzelm@16234
  1761
'subst (asm)', for rewriting an assumption.  INCOMPATIBILITY: may
wenzelm@16234
  1762
rewrite a different subterm than the original subst method, which is
wenzelm@16234
  1763
still available as 'simplesubst'.
berghofe@15475
  1764
wenzelm@16013
  1765
* Provers/quasi.ML: new transitivity reasoners for transitivity only
wenzelm@16234
  1766
and quasi orders.
ballarin@15103
  1767
wenzelm@16013
  1768
* Provers/trancl.ML: new transitivity reasoner for transitive and
wenzelm@16234
  1769
reflexive-transitive closure of relations.
ballarin@15076
  1770
wenzelm@16013
  1771
* Provers/blast.ML: new reference depth_limit to make blast's depth
wenzelm@16234
  1772
limit (previously hard-coded with a value of 20) user-definable.
wenzelm@15801
  1773
wenzelm@16013
  1774
* Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
wenzelm@16234
  1775
is peformed already.  Object-logics merely need to finish their
wenzelm@16234
  1776
initial simpset configuration as before.  INCOMPATIBILITY.
berghofe@15436
  1777
wenzelm@15703
  1778
wenzelm@15703
  1779
*** HOL ***
wenzelm@15703
  1780
wenzelm@16234
  1781
* Symbolic syntax of Hilbert Choice Operator is now as follows:
wenzelm@15703
  1782
wenzelm@15703
  1783
  syntax (epsilon)
wenzelm@15703
  1784
    "_Eps" :: "[pttrn, bool] => 'a"    ("(3\<some>_./ _)" [0, 10] 10)
wenzelm@15703
  1785
wenzelm@16234
  1786
The symbol \<some> is displayed as the alternative epsilon of LaTeX
wenzelm@16234
  1787
and x-symbol; use option '-m epsilon' to get it actually printed.
wenzelm@16234
  1788
Moreover, the mathematically important symbolic identifier \<epsilon>
wenzelm@16234
  1789
becomes available as variable, constant etc.  INCOMPATIBILITY,
wenzelm@16234
  1790
wenzelm@16234
  1791
* "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
wenzelm@16234
  1792
Similarly for all quantifiers: "ALL x > y" etc.  The x-symbol for >=
wenzelm@17371
  1793
is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
avigad@17016
  1794
support corresponding Isar calculations.
wenzelm@16234
  1795
wenzelm@16234
  1796
* "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
wenzelm@16234
  1797
instead of ":".
wenzelm@16234
  1798
wenzelm@16234
  1799
* theory SetInterval: changed the syntax for open intervals:
wenzelm@16234
  1800
wenzelm@16234
  1801
  Old       New
wenzelm@16234
  1802
  {..n(}    {..<n}
wenzelm@16234
  1803
  {)n..}    {n<..}
wenzelm@16234
  1804
  {m..n(}   {m..<n}
wenzelm@16234
  1805
  {)m..n}   {m<..n}
wenzelm@16234
  1806
  {)m..n(}  {m<..<n}
wenzelm@16234
  1807
wenzelm@16234
  1808
The old syntax is still supported but will disappear in the next
wenzelm@16234
  1809
release.  For conversion use the following Emacs search and replace
wenzelm@16234
  1810
patterns (these are not perfect but work quite well):
wenzelm@15703
  1811
wenzelm@15703
  1812
  {)\([^\.]*\)\.\.  ->  {\1<\.\.}
wenzelm@15703
  1813
  \.\.\([^(}]*\)(}  ->  \.\.<\1}
wenzelm@15703
  1814
wenzelm@17533
  1815
* Theory Commutative_Ring (in Library): method comm_ring for proving
wenzelm@17533
  1816
equalities in commutative rings; method 'algebra' provides a generic
wenzelm@17533
  1817
interface.
wenzelm@17389
  1818
wenzelm@17389
  1819
* Theory Finite_Set: changed the syntax for 'setsum', summation over
wenzelm@16234
  1820
finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
wenzelm@17371
  1821
now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
paulson@17189
  1822
be a tuple pattern.
wenzelm@16234
  1823
wenzelm@16234
  1824
Some new syntax forms are available:
wenzelm@16234
  1825
wenzelm@16234
  1826
  "\<Sum>x | P. e"      for     "setsum (%x. e) {x. P}"
wenzelm@16234
  1827
  "\<Sum>x = a..b. e"   for     "setsum (%x. e) {a..b}"
wenzelm@16234
  1828
  "\<Sum>x = a..<b. e"  for     "setsum (%x. e) {a..<b}"
wenzelm@16234
  1829
  "\<Sum>x < k. e"      for     "setsum (%x. e) {..<k}"
wenzelm@16234
  1830
wenzelm@16234
  1831
The latter form "\<Sum>x < k. e" used to be based on a separate
wenzelm@16234
  1832
function "Summation", which has been discontinued.
wenzelm@16234
  1833
wenzelm@16234
  1834
* theory Finite_Set: in structured induction proofs, the insert case
wenzelm@16234
  1835
is now 'case (insert x F)' instead of the old counterintuitive 'case
wenzelm@16234
  1836
(insert F x)'.
wenzelm@16234
  1837
wenzelm@16234
  1838
* The 'refute' command has been extended to support a much larger
wenzelm@16234
  1839
fragment of HOL, including axiomatic type classes, constdefs and
wenzelm@16234
  1840
typedefs, inductive datatypes and recursion.
wenzelm@16234
  1841
webertj@17700
  1842
* New tactics 'sat' and 'satx' to prove propositional tautologies.
webertj@17700
  1843
Requires zChaff with proof generation to be installed.  See
webertj@17700
  1844
HOL/ex/SAT_Examples.thy for examples.
webertj@17619
  1845
wenzelm@16234
  1846
* Datatype induction via method 'induct' now preserves the name of the
wenzelm@16234
  1847
induction variable. For example, when proving P(xs::'a list) by
wenzelm@16234
  1848
induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
wenzelm@16234
  1849
than P(list) ==> P(a#list) as previously.  Potential INCOMPATIBILITY
wenzelm@16234
  1850
in unstructured proof scripts.
wenzelm@16234
  1851
wenzelm@16234
  1852
* Reworked implementation of records.  Improved scalability for
wenzelm@16234
  1853
records with many fields, avoiding performance problems for type
wenzelm@16234
  1854
inference. Records are no longer composed of nested field types, but
wenzelm@16234
  1855
of nested extension types. Therefore the record type only grows linear
wenzelm@16234
  1856
in the number of extensions and not in the number of fields.  The
wenzelm@16234
  1857
top-level (users) view on records is preserved.  Potential
wenzelm@16234
  1858
INCOMPATIBILITY only in strange cases, where the theory depends on the
wenzelm@16234
  1859
old record representation. The type generated for a record is called
wenzelm@16234
  1860
<record_name>_ext_type.
wenzelm@16234
  1861
wenzelm@16234
  1862
Flag record_quick_and_dirty_sensitive can be enabled to skip the
wenzelm@16234
  1863
proofs triggered by a record definition or a simproc (if
wenzelm@16234
  1864
quick_and_dirty is enabled).  Definitions of large records can take
wenzelm@16234
  1865
quite long.
wenzelm@16234
  1866
wenzelm@16234
  1867
New simproc record_upd_simproc for simplification of multiple record
wenzelm@16234
  1868
updates enabled by default.  Moreover, trivial updates are also
wenzelm@16234
  1869
removed: r(|x := x r|) = r.  INCOMPATIBILITY: old proofs break
wenzelm@16234
  1870
occasionally, since simplification is more powerful by default.
wenzelm@16234
  1871
wenzelm@17275
  1872
* typedef: proper support for polymorphic sets, which contain extra
wenzelm@17275
  1873
type-variables in the term.
wenzelm@17275
  1874
wenzelm@16234
  1875
* Simplifier: automatically reasons about transitivity chains
wenzelm@16234
  1876
involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
wenzelm@16234
  1877
provided by Provers/trancl.ML as additional solvers.  INCOMPATIBILITY:
wenzelm@16234
  1878
old proofs break occasionally as simplification may now solve more
wenzelm@16234
  1879
goals than previously.
wenzelm@16234
  1880
wenzelm@16234
  1881
* Simplifier: converts x <= y into x = y if assumption y <= x is
wenzelm@16234
  1882
present.  Works for all partial orders (class "order"), in particular
wenzelm@16234
  1883
numbers and sets.  For linear orders (e.g. numbers) it treats ~ x < y
wenzelm@16234
  1884
just like y <= x.
wenzelm@16234
  1885
wenzelm@16234
  1886
* Simplifier: new simproc for "let x = a in f x".  If a is a free or
wenzelm@16234
  1887
bound variable or a constant then the let is unfolded.  Otherwise
wenzelm@16234
  1888
first a is simplified to b, and then f b is simplified to g. If
wenzelm@16234
  1889
possible we abstract b from g arriving at "let x = b in h x",
wenzelm@16234
  1890
otherwise we unfold the let and arrive at g.  The simproc can be
wenzelm@16234
  1891
enabled/disabled by the reference use_let_simproc.  Potential
wenzelm@16234
  1892
INCOMPATIBILITY since simplification is more powerful by default.
webertj@15776
  1893
paulson@16563
  1894
* Classical reasoning: the meson method now accepts theorems as arguments.
paulson@16563
  1895
paulson@17595
  1896
* Prover support: pre-release of the Isabelle-ATP linkup, which runs background
paulson@17595
  1897
jobs to provide advice on the provability of subgoals.
paulson@17595
  1898
wenzelm@16891
  1899
* Theory OrderedGroup and Ring_and_Field: various additions and
wenzelm@16891
  1900
improvements to faciliate calculations involving equalities and
wenzelm@16891
  1901
inequalities.
wenzelm@16891
  1902
wenzelm@16891
  1903
The following theorems have been eliminated or modified
wenzelm@16891
  1904
(INCOMPATIBILITY):
avigad@16888
  1905
avigad@16888
  1906
  abs_eq             now named abs_of_nonneg
wenzelm@17371
  1907
  abs_of_ge_0        now named abs_of_nonneg
wenzelm@17371
  1908
  abs_minus_eq       now named abs_of_nonpos
avigad@16888
  1909
  imp_abs_id         now named abs_of_nonneg
avigad@16888
  1910
  imp_abs_neg_id     now named abs_of_nonpos
avigad@16888
  1911
  mult_pos           now named mult_pos_pos
avigad@16888
  1912
  mult_pos_le        now named mult_nonneg_nonneg
avigad@16888
  1913
  mult_pos_neg_le    now named mult_nonneg_nonpos
avigad@16888
  1914
  mult_pos_neg2_le   now named mult_nonneg_nonpos2
avigad@16888
  1915
  mult_neg           now named mult_neg_neg
avigad@16888
  1916
  mult_neg_le        now named mult_nonpos_nonpos
avigad@16888
  1917
obua@23495
  1918
* The following lemmas in Ring_and_Field have been added to the simplifier:
obua@23495
  1919
     
obua@23495
  1920
     zero_le_square
obua@23495
  1921
     not_square_less_zero 
obua@23495
  1922
obua@23495
  1923
  The following lemmas have been deleted from Real/RealPow:
obua@23495
  1924
  
obua@23495
  1925
     realpow_zero_zero
obua@23495
  1926
     realpow_two
obua@23495
  1927
     realpow_less
obua@23495
  1928
     zero_le_power
obua@23495
  1929
     realpow_two_le
obua@23495
  1930
     abs_realpow_two
obua@23495
  1931
     realpow_two_abs     
obua@23495
  1932
wenzelm@16891
  1933
* Theory Parity: added rules for simplifying exponents.
wenzelm@16891
  1934
nipkow@17092
  1935
* Theory List:
nipkow@17092
  1936
nipkow@17092
  1937
The following theorems have been eliminated or modified
nipkow@17092
  1938
(INCOMPATIBILITY):
nipkow@17092
  1939
nipkow@17092
  1940
  list_all_Nil       now named list_all.simps(1)
nipkow@17092
  1941
  list_all_Cons      now named list_all.simps(2)
nipkow@17092
  1942
  list_all_conv      now named list_all_iff
nipkow@17092
  1943
  set_mem_eq         now named mem_iff
nipkow@17092
  1944
wenzelm@16929
  1945
* Theories SetsAndFunctions and BigO (see HOL/Library) support
wenzelm@16929
  1946
asymptotic "big O" calculations.  See the notes in BigO.thy.
wenzelm@16929
  1947
avigad@16888
  1948
avigad@16888
  1949
*** HOL-Complex ***
avigad@16888
  1950
wenzelm@16891
  1951
* Theory RealDef: better support for embedding natural numbers and
wenzelm@16891
  1952
integers in the reals.
wenzelm@16891
  1953
wenzelm@16891
  1954
The following theorems have been eliminated or modified
wenzelm@16891
  1955
(INCOMPATIBILITY):
wenzelm@16891
  1956
avigad@17016
  1957
  exp_ge_add_one_self  now requires no hypotheses
avigad@17016
  1958
  real_of_int_add      reversed direction of equality (use [symmetric])
avigad@17016
  1959
  real_of_int_minus    reversed direction of equality (use [symmetric])
avigad@17016
  1960
  real_of_int_diff     reversed direction of equality (use [symmetric])
avigad@17016
  1961
  real_of_int_mult     reversed direction of equality (use [symmetric])
wenzelm@16891
  1962
wenzelm@16891
  1963
* Theory RComplete: expanded support for floor and ceiling functions.
avigad@16888
  1964
avigad@16962
  1965
* Theory Ln is new, with properties of the natural logarithm
avigad@16962
  1966
wenzelm@17423
  1967
* Hyperreal: There is a new type constructor "star" for making
wenzelm@17423
  1968
nonstandard types.  The old type names are now type synonyms:
wenzelm@17423
  1969
wenzelm@17423
  1970
  hypreal = real star
wenzelm@17423
  1971
  hypnat = nat star
wenzelm@17423
  1972
  hcomplex = complex star
wenzelm@17423
  1973
wenzelm@17423
  1974
* Hyperreal: Many groups of similarly-defined constants have been
huffman@17442
  1975
replaced by polymorphic versions (INCOMPATIBILITY):
wenzelm@17423
  1976
wenzelm@17423
  1977
  star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
wenzelm@17423
  1978
wenzelm@17423
  1979
  starset      <-- starsetNat, starsetC
wenzelm@17423
  1980
  *s*          <-- *sNat*, *sc*
wenzelm@17423
  1981
  starset_n    <-- starsetNat_n, starsetC_n
wenzelm@17423
  1982
  *sn*         <-- *sNatn*, *scn*
wenzelm@17423
  1983
  InternalSets <-- InternalNatSets, InternalCSets
wenzelm@17423
  1984
huffman@17442
  1985
  starfun      <-- starfun{Nat,Nat2,C,RC,CR}
wenzelm@17423
  1986
  *f*          <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
huffman@17442
  1987
  starfun_n    <-- starfun{Nat,Nat2,C,RC,CR}_n
wenzelm@17423
  1988
  *fn*         <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
huffman@17442
  1989
  InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
wenzelm@17423
  1990
wenzelm@17423
  1991
* Hyperreal: Many type-specific theorems have been removed in favor of
huffman@17442
  1992
theorems specific to various axiomatic type classes (INCOMPATIBILITY):
huffman@17442
  1993
huffman@17442
  1994
  add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
huffman@17442
  1995
  add_assoc   <-- {hypreal,hypnat,hcomplex}_add_assocs
huffman@17442
  1996
  OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
huffman@17442
  1997
  OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
wenzelm@17423
  1998
  right_minus <-- hypreal_add_minus
huffman@17442
  1999
  left_minus <-- {hypreal,hcomplex}_add_minus_left
huffman@17442
  2000
  mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
huffman@17442
  2001
  mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
huffman@17442
  2002
  mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
wenzelm@17423
  2003
  mult_1_right <-- hcomplex_mult_one_right
wenzelm@17423
  2004
  mult_zero_left <-- hcomplex_mult_zero_left
huffman@17442
  2005
  left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
wenzelm@17423
  2006
  right_distrib <-- hypnat_add_mult_distrib2
huffman@17442
  2007
  zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
wenzelm@17423
  2008
  right_inverse <-- hypreal_mult_inverse
wenzelm@17423
  2009
  left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
huffman@17442
  2010
  order_refl <-- {hypreal,hypnat}_le_refl
huffman@17442
  2011
  order_trans <-- {hypreal,hypnat}_le_trans
huffman@17442
  2012
  order_antisym <-- {hypreal,hypnat}_le_anti_sym
huffman@17442
  2013
  order_less_le <-- {hypreal,hypnat}_less_le
huffman@17442
  2014
  linorder_linear <-- {hypreal,hypnat}_le_linear
huffman@17442
  2015
  add_left_mono <-- {hypreal,hypnat}_add_left_mono
huffman@17442
  2016
  mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
wenzelm@17423
  2017
  add_nonneg_nonneg <-- hypreal_le_add_order
wenzelm@17423
  2018
wenzelm@17423
  2019
* Hyperreal: Separate theorems having to do with type-specific
wenzelm@17423
  2020
versions of constants have been merged into theorems that apply to the
huffman@17442
  2021
new polymorphic constants (INCOMPATIBILITY):
huffman@17442
  2022
huffman@17442
  2023
  STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
huffman@17442
  2024
  STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
huffman@17442
  2025
  STAR_Un <-- {STAR,NatStar,STARC}_Un
huffman@17442
  2026
  STAR_Int <-- {STAR,NatStar,STARC}_Int
huffman@17442
  2027
  STAR_Compl <-- {STAR,NatStar,STARC}_Compl
huffman@17442
  2028
  STAR_subset <-- {STAR,NatStar,STARC}_subset
huffman@17442
  2029
  STAR_mem <-- {STAR,NatStar,STARC}_mem
huffman@17442
  2030
  STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
huffman@17442
  2031
  STAR_diff <-- {STAR,STARC}_diff
huffman@17442
  2032
  STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
huffman@17442
  2033
    STARC_hcomplex_of_complex}_image_subset
huffman@17442
  2034
  starset_n_Un <-- starset{Nat,C}_n_Un
huffman@17442
  2035
  starset_n_Int <-- starset{Nat,C}_n_Int
huffman@17442
  2036
  starset_n_Compl <-- starset{Nat,C}_n_Compl
huffman@17442
  2037
  starset_n_diff <-- starset{Nat,C}_n_diff
huffman@17442
  2038
  InternalSets_Un <-- Internal{Nat,C}Sets_Un
huffman@17442
  2039
  InternalSets_Int <-- Internal{Nat,C}Sets_Int
huffman@17442
  2040
  InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
huffman@17442
  2041
  InternalSets_diff <-- Internal{Nat,C}Sets_diff
huffman@17442
  2042
  InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
huffman@17442
  2043
  InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
huffman@17442
  2044
  starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
huffman@17442
  2045
  starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
huffman@17442
  2046
  starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
huffman@17442
  2047
  starfun <-- starfun{Nat,Nat2,C,RC,CR}
huffman@17442
  2048
  starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
huffman@17442
  2049
  starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
huffman@17442
  2050
  starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
huffman@17442
  2051
  starfun_diff <-- starfun{C,RC,CR}_diff
huffman@17442
  2052
  starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
huffman@17442
  2053
  starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
huffman@17442
  2054
  starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
huffman@17442
  2055
  starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
huffman@17442
  2056
  starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
huffman@17442
  2057
  starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
wenzelm@17423
  2058
  starfun_Id <-- starfunC_Id
huffman@17442
  2059
  starfun_approx <-- starfun{Nat,CR}_approx
huffman@17442
  2060
  starfun_capprox <-- starfun{C,RC}_capprox
wenzelm@17423
  2061
  starfun_abs <-- starfunNat_rabs
huffman@17442
  2062
  starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
huffman@17442
  2063
  starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
wenzelm@17423
  2064
  starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
huffman@17442
  2065
  starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
huffman@17442
  2066
  starfun_add_capprox <-- starfun{C,RC}_add_capprox
wenzelm@17423
  2067
  starfun_add_approx <-- starfunCR_add_approx
wenzelm@17423
  2068
  starfun_inverse_inverse <-- starfunC_inverse_inverse
huffman@17442
  2069
  starfun_divide <-- starfun{C,CR,RC}_divide
huffman@17442
  2070
  starfun_n <-- starfun{Nat,C}_n
huffman@17442
  2071
  starfun_n_mult <-- starfun{Nat,C}_n_mult
huffman@17442
  2072
  starfun_n_add <-- starfun{Nat,C}_n_add
wenzelm@17423
  2073
  starfun_n_add_minus <-- starfunNat_n_add_minus
huffman@17442
  2074
  starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
huffman@17442
  2075
  starfun_n_minus <-- starfun{Nat,C}_n_minus
huffman@17442
  2076
  starfun_n_eq <-- starfun{Nat,C}_n_eq
huffman@17442
  2077
huffman@17442
  2078
  star_n_add <-- {hypreal,hypnat,hcomplex}_add
huffman@17442
  2079
  star_n_minus <-- {hypreal,hcomplex}_minus
huffman@17442
  2080
  star_n_diff <-- {hypreal,hcomplex}_diff
huffman@17442
  2081
  star_n_mult <-- {hypreal,hcomplex}_mult
huffman@17442
  2082
  star_n_inverse <-- {hypreal,hcomplex}_inverse
huffman@17442
  2083
  star_n_le <-- {hypreal,hypnat}_le
huffman@17442
  2084
  star_n_less <-- {hypreal,hypnat}_less
huffman@17442
  2085
  star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
huffman@17442
  2086
  star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
wenzelm@17423
  2087
  star_n_abs <-- hypreal_hrabs
wenzelm@17423
  2088
  star_n_divide <-- hcomplex_divide
wenzelm@17423
  2089
huffman@17442
  2090
  star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
huffman@17442
  2091
  star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
wenzelm@17423
  2092
  star_of_diff <-- hypreal_of_real_diff
huffman@17442
  2093
  star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
huffman@17442
  2094
  star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
huffman@17442
  2095
  star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
huffman@17442
  2096
  star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
huffman@17442
  2097
  star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
huffman@17442
  2098
  star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
huffman@17442
  2099
  star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
huffman@17442
  2100
  star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
huffman@17442
  2101
  star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
huffman@17442
  2102
  star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
huffman@17442
  2103
  star_of_number_of <-- {hypreal,hcomplex}_number_of
wenzelm@17423
  2104
  star_of_number_less <-- number_of_less_hypreal_of_real_iff
wenzelm@17423
  2105
  star_of_number_le <-- number_of_le_hypreal_of_real_iff
wenzelm@17423
  2106
  star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
wenzelm@17423
  2107
  star_of_less_number <-- hypreal_of_real_less_number_of_iff
wenzelm@17423
  2108
  star_of_le_number <-- hypreal_of_real_le_number_of_iff
wenzelm@17423
  2109
  star_of_power <-- hypreal_of_real_power
wenzelm@17423
  2110
  star_of_eq_0 <-- hcomplex_of_complex_zero_iff
wenzelm@17423
  2111
huffman@17442
  2112
* Hyperreal: new method "transfer" that implements the transfer
huffman@17442
  2113
principle of nonstandard analysis. With a subgoal that mentions
huffman@17442
  2114
nonstandard types like "'a star", the command "apply transfer"
huffman@17442
  2115
replaces it with an equivalent one that mentions only standard types.
huffman@17442
  2116
To be successful, all free variables must have standard types; non-
huffman@17442
  2117
standard variables must have explicit universal quantifiers.
huffman@17442
  2118
wenzelm@17641
  2119
* Hyperreal: A theory of Taylor series.
wenzelm@17641
  2120
wenzelm@15703
  2121
wenzelm@15703
  2122
*** HOLCF ***
wenzelm@15703
  2123
wenzelm@17533
  2124
* Discontinued special version of 'constdefs' (which used to support
wenzelm@17533
  2125
continuous functions) in favor of the general Pure one with full
wenzelm@17533
  2126
type-inference.
wenzelm@17533
  2127
wenzelm@17533
  2128
* New simplification procedure for solving continuity conditions; it
wenzelm@17533
  2129
is much faster on terms with many nested lambda abstractions (cubic
huffman@17442
  2130
instead of exponential time).
huffman@17442
  2131
wenzelm@17533
  2132
* New syntax for domain package: selector names are now optional.
huffman@17442
  2133
Parentheses should be omitted unless argument is lazy, for example:
huffman@17442
  2134
huffman@17442
  2135
  domain 'a stream = cons "'a" (lazy "'a stream")
huffman@17442
  2136
wenzelm@17533
  2137
* New command 'fixrec' for defining recursive functions with pattern
wenzelm@17533
  2138
matching; defining multiple functions with mutual recursion is also
wenzelm@17533
  2139
supported.  Patterns may include the constants cpair, spair, up, sinl,
wenzelm@17533
  2140
sinr, or any data constructor defined by the domain package. The given
wenzelm@17533
  2141
equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
wenzelm@17533
  2142
syntax and examples.
wenzelm@17533
  2143
wenzelm@17533
  2144
* New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
wenzelm@17533
  2145
of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
wenzelm@17533
  2146
but the proof obligation additionally includes an admissibility
wenzelm@17533
  2147
requirement. The packages generate instances of class cpo or pcpo,
wenzelm@17533
  2148
with continuity and strictness theorems for Rep and Abs.
huffman@17442
  2149
huffman@17584
  2150
* HOLCF: Many theorems have been renamed according to a more standard naming
huffman@17584
  2151
scheme (INCOMPATIBILITY):
huffman@17584
  2152
huffman@17584
  2153
  foo_inject:  "foo$x = foo$y ==> x = y"
huffman@17584
  2154
  foo_eq:      "(foo$x = foo$y) = (x = y)"
huffman@17584
  2155
  foo_less:    "(foo$x << foo$y) = (x << y)"
huffman@17584
  2156
  foo_strict:  "foo$UU = UU"
huffman@17584
  2157
  foo_defined: "... ==> foo$x ~= UU"
huffman@17584
  2158
  foo_defined_iff: "(foo$x = UU) = (x = UU)"
huffman@17584
  2159
wenzelm@15703
  2160
wenzelm@15703
  2161
*** ZF ***
wenzelm@15703
  2162
wenzelm@16234
  2163
* ZF/ex: theories Group and Ring provide examples in abstract algebra,
wenzelm@16234
  2164
including the First Isomorphism Theorem (on quotienting by the kernel
wenzelm@16234
  2165
of a homomorphism).
wenzelm@15703
  2166
wenzelm@15703
  2167
* ZF/Simplifier: install second copy of type solver that actually
wenzelm@16234
  2168
makes use of TC rules declared to Isar proof contexts (or locales);
wenzelm@16234
  2169
the old version is still required for ML proof scripts.
wenzelm@15703
  2170
wenzelm@15703
  2171
wenzelm@17445
  2172
*** Cube ***
wenzelm@17445
  2173
wenzelm@17445
  2174
* Converted to Isar theory format; use locales instead of axiomatic
wenzelm@17445
  2175
theories.
wenzelm@17445
  2176
wenzelm@17445
  2177
wenzelm@15703
  2178
*** ML ***
wenzelm@15703
  2179
haftmann@21339
  2180
* Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
haftmann@21339
  2181
for ||>, ||>>, |>>,
haftmann@21339
  2182
wenzelm@15973
  2183
* Pure/library.ML no longer defines its own option datatype, but uses
wenzelm@16234
  2184
that of the SML basis, which has constructors NONE and SOME instead of
wenzelm@16234
  2185
None and Some, as well as exception Option.Option instead of OPTION.
wenzelm@16234
  2186
The functions the, if_none, is_some, is_none have been adapted
wenzelm@16234
  2187
accordingly, while Option.map replaces apsome.
wenzelm@15973
  2188
wenzelm@16860
  2189
* Pure/library.ML: the exception LIST has been given up in favour of
wenzelm@16860
  2190
the standard exceptions Empty and Subscript, as well as
wenzelm@16860
  2191
Library.UnequalLengths.  Function like Library.hd and Library.tl are
wenzelm@16860
  2192
superceded by the standard hd and tl functions etc.
wenzelm@16860
  2193
wenzelm@16860
  2194
A number of basic list functions are no longer exported to the ML
wenzelm@16860
  2195
toplevel, as they are variants of predefined functions.  The following
wenzelm@16234
  2196
suggests how one can translate existing code:
wenzelm@15973
  2197
wenzelm@15973
  2198
    rev_append xs ys = List.revAppend (xs, ys)
wenzelm@15973
  2199
    nth_elem (i, xs) = List.nth (xs, i)
wenzelm@15973
  2200
    last_elem xs = List.last xs
wenzelm@15973
  2201
    flat xss = List.concat xss
wenzelm@16234
  2202
    seq fs = List.app fs
wenzelm@15973
  2203
    partition P xs = List.partition P xs
wenzelm@15973
  2204
    mapfilter f xs = List.mapPartial f xs
wenzelm@15973
  2205
wenzelm@16860
  2206
* Pure/library.ML: several combinators for linear functional
wenzelm@16860
  2207
transformations, notably reverse application and composition:
wenzelm@16860
  2208
wenzelm@17371
  2209
  x |> f                f #> g
wenzelm@17371
  2210
  (x, y) |-> f          f #-> g
wenzelm@16860
  2211
haftmann@17495
  2212
* Pure/library.ML: introduced/changed precedence of infix operators:
haftmann@17495
  2213
haftmann@17495
  2214
  infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
haftmann@17495
  2215
  infix 2 ?;
haftmann@17495
  2216
  infix 3 o oo ooo oooo;
haftmann@17495
  2217
  infix 4 ~~ upto downto;
haftmann@17495
  2218
haftmann@17495
  2219
Maybe INCOMPATIBILITY when any of those is used in conjunction with other
haftmann@17495
  2220
infix operators.
haftmann@17495
  2221
wenzelm@17408
  2222
* Pure/library.ML: natural list combinators fold, fold_rev, and
haftmann@16869
  2223
fold_map support linear functional transformations and nesting.  For
wenzelm@16860
  2224
example:
wenzelm@16860
  2225
wenzelm@16860
  2226
  fold f [x1, ..., xN] y =
wenzelm@16860
  2227
    y |> f x1 |> ... |> f xN
wenzelm@16860
  2228
wenzelm@16860
  2229
  (fold o fold) f [xs1, ..., xsN] y =
wenzelm@16860
  2230
    y |> fold f xs1 |> ... |> fold f xsN
wenzelm@16860
  2231
wenzelm@16860
  2232
  fold f [x1, ..., xN] =
wenzelm@16860
  2233
    f x1 #> ... #> f xN
wenzelm@16860
  2234
wenzelm@16860
  2235
  (fold o fold) f [xs1, ..., xsN] =
wenzelm@16860
  2236
    fold f xs1 #> ... #> fold f xsN
wenzelm@16860
  2237
wenzelm@17408
  2238
* Pure/library.ML: the following selectors on type 'a option are
wenzelm@17408
  2239
available:
wenzelm@17408
  2240
wenzelm@17408
  2241
  the:               'a option -> 'a  (*partial*)
wenzelm@17408
  2242
  these:             'a option -> 'a  where 'a = 'b list
haftmann@17402
  2243
  the_default: 'a -> 'a option -> 'a
haftmann@17402
  2244
  the_list:          'a option -> 'a list
haftmann@17402
  2245
wenzelm@17408
  2246
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides
wenzelm@17408
  2247
basic operations for association lists, following natural argument
haftmann@17564
  2248
order; moreover the explicit equality predicate passed here avoids
haftmann@17495
  2249
potentially expensive polymorphic runtime equality checks.
haftmann@17495
  2250
The old functions may be expressed as follows:
wenzelm@17408
  2251
wenzelm@17408
  2252
  assoc = uncurry (AList.lookup (op =))
wenzelm@17408
  2253
  assocs = these oo AList.lookup (op =)
wenzelm@17408
  2254
  overwrite = uncurry (AList.update (op =)) o swap
wenzelm@17408
  2255
haftmann@17564
  2256
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides
haftmann@17564
  2257
haftmann@17564
  2258
  val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
haftmann@17564
  2259
  val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
haftmann@17564
  2260
haftmann@17564
  2261
replacing make_keylist and keyfilter (occassionally used)
haftmann@17564
  2262
Naive rewrites:
haftmann@17564
  2263
haftmann@17564
  2264
  make_keylist = AList.make
haftmann@17564
  2265
  keyfilter = AList.find (op =)
haftmann@17564
  2266
haftmann@17564
  2267
* eq_fst and eq_snd now take explicit equality parameter, thus
haftmann@17564
  2268
  avoiding eqtypes. Naive rewrites:
haftmann@17564
  2269
haftmann@17564
  2270
    eq_fst = eq_fst (op =)
haftmann@17564
  2271
    eq_snd = eq_snd (op =)
haftmann@17564
  2272
haftmann@17564
  2273
* Removed deprecated apl and apr (rarely used).
haftmann@17564
  2274
  Naive rewrites:
haftmann@17564
  2275
haftmann@17564
  2276
    apl (n, op) =>>= curry op n
haftmann@17564
  2277
    apr (op, m) =>>= fn n => op (n, m)
haftmann@17564
  2278
wenzelm@17408
  2279
* Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
wenzelm@17408
  2280
provides a reasonably efficient light-weight implementation of sets as
wenzelm@17408
  2281
lists.
wenzelm@17408
  2282
wenzelm@17408
  2283
* Pure/General: generic tables (cf. Pure/General/table.ML) provide a
wenzelm@17408
  2284
few new operations; existing lookup and update are now curried to
wenzelm@17408
  2285
follow natural argument order (for use with fold etc.);
wenzelm@17408
  2286
INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
wenzelm@17408
  2287
wenzelm@17408
  2288
* Pure/General: output via the Isabelle channels of
wenzelm@17408
  2289
writeln/warning/error etc. is now passed through Output.output, with a
wenzelm@17408
  2290
hook for arbitrary transformations depending on the print_mode
wenzelm@17408
  2291
(cf. Output.add_mode -- the first active mode that provides a output
wenzelm@17408
  2292
function wins).  Already formatted output may be embedded into further
wenzelm@17408
  2293
text via Output.raw; the result of Pretty.string_of/str_of and derived
wenzelm@17408
  2294
functions (string_of_term/cterm/thm etc.) is already marked raw to
wenzelm@17408
  2295
accommodate easy composition of diagnostic messages etc.  Programmers
wenzelm@17408
  2296
rarely need to care about Output.output or Output.raw at all, with
wenzelm@17408
  2297
some notable exceptions: Output.output is required when bypassing the
wenzelm@17408
  2298
standard channels (writeln etc.), or in token translations to produce
wenzelm@17408
  2299
properly formatted results; Output.raw is required when capturing
wenzelm@17408
  2300
already output material that will eventually be presented to the user
wenzelm@17408
  2301
a second time.  For the default print mode, both Output.output and
wenzelm@17408
  2302
Output.raw have no effect.
wenzelm@17408
  2303
wenzelm@17408
  2304
* Pure/General: Output.time_accumulator NAME creates an operator ('a
wenzelm@17408
  2305
-> 'b) -> 'a -> 'b to measure runtime and count invocations; the
wenzelm@17408
  2306
cumulative results are displayed at the end of a batch session.
wenzelm@17408
  2307
wenzelm@17408
  2308
* Pure/General: File.sysify_path and File.quote_sysify path have been
wenzelm@17408
  2309
replaced by File.platform_path and File.shell_path (with appropriate
wenzelm@17408
  2310
hooks).  This provides a clean interface for unusual systems where the
wenzelm@17408
  2311
internal and external process view of file names are different.
wenzelm@17408
  2312
wenzelm@16689
  2313
* Pure: more efficient orders for basic syntactic entities: added
wenzelm@16689
  2314
fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
wenzelm@16689
  2315
and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
wenzelm@16689
  2316
NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
wenzelm@16689
  2317
orders now -- potential INCOMPATIBILITY for code that depends on a
wenzelm@16689
  2318
particular order for Symtab.keys, Symtab.dest, etc. (consider using
wenzelm@16689
  2319
Library.sort_strings on result).
wenzelm@16689
  2320
wenzelm@17408
  2321
* Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
wenzelm@17408
  2322
fold_types traverse types/terms from left to right, observing natural
wenzelm@17408
  2323
argument order.  Supercedes previous foldl_XXX versions, add_frees,
wenzelm@17408
  2324
add_vars etc. have been adapted as well: INCOMPATIBILITY.
wenzelm@17408
  2325
wenzelm@16151
  2326
* Pure: name spaces have been refined, with significant changes of the
wenzelm@16234
  2327
internal interfaces -- INCOMPATIBILITY.  Renamed cond_extern(_table)
wenzelm@16234
  2328
to extern(_table).  The plain name entry path is superceded by a
wenzelm@16234
  2329
general 'naming' context, which also includes the 'policy' to produce
wenzelm@16234
  2330
a fully qualified name and external accesses of a fully qualified
wenzelm@16234
  2331
name; NameSpace.extend is superceded by context dependent
wenzelm@16234
  2332
Sign.declare_name.  Several theory and proof context operations modify
wenzelm@16234
  2333
the naming context.  Especially note Theory.restore_naming and
wenzelm@16234
  2334
ProofContext.restore_naming to get back to a sane state; note that
wenzelm@16234
  2335
Theory.add_path is no longer sufficient to recover from
wenzelm@16234
  2336
Theory.absolute_path in particular.
wenzelm@16234
  2337
wenzelm@16234
  2338
* Pure: new flags short_names (default false) and unique_names
wenzelm@16234
  2339
(default true) for controlling output of qualified names.  If
wenzelm@16234
  2340
short_names is set, names are printed unqualified.  If unique_names is
wenzelm@16234
  2341
reset, the name prefix is reduced to the minimum required to achieve
wenzelm@16234
  2342
the original result when interning again, even if there is an overlap
wenzelm@16234
  2343
with earlier declarations.
wenzelm@16151
  2344
wenzelm@16456
  2345
* Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
wenzelm@16456
  2346
now 'extend', and 'merge' gets an additional Pretty.pp argument
wenzelm@16456
  2347
(useful for printing error messages).  INCOMPATIBILITY.
wenzelm@16456
  2348
wenzelm@16456
  2349
* Pure: major reorganization of the theory context.  Type Sign.sg and
wenzelm@16456
  2350
Theory.theory are now identified, referring to the universal
wenzelm@16456
  2351
Context.theory (see Pure/context.ML).  Actual signature and theory
wenzelm@16456
  2352
content is managed as theory data.  The old code and interfaces were
wenzelm@16456
  2353
spread over many files and structures; the new arrangement introduces
wenzelm@16456
  2354
considerable INCOMPATIBILITY to gain more clarity:
wenzelm@16456
  2355
wenzelm@16456
  2356
  Context -- theory management operations (name, identity, inclusion,
wenzelm@16456
  2357
    parents, ancestors, merge, etc.), plus generic theory data;
wenzelm@16456
  2358
wenzelm@16456
  2359
  Sign -- logical signature and syntax operations (declaring consts,
wenzelm@16456
  2360
    types, etc.), plus certify/read for common entities;
wenzelm@16456
  2361
wenzelm@16456
  2362
  Theory -- logical theory operations (stating axioms, definitions,
wenzelm@16456
  2363
    oracles), plus a copy of logical signature operations (consts,
wenzelm@16456
  2364
    types, etc.); also a few basic management operations (Theory.copy,
wenzelm@16456
  2365
    Theory.merge, etc.)
wenzelm@16456
  2366
wenzelm@16456
  2367
The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
wenzelm@16456
  2368
etc.) as well as the sign field in Thm.rep_thm etc. have been retained
wenzelm@16456
  2369
for convenience -- they merely return the theory.
wenzelm@16456
  2370
wenzelm@17193
  2371
* Pure: type Type.tsig is superceded by theory in most interfaces.
wenzelm@17193
  2372
wenzelm@16547
  2373
* Pure: the Isar proof context type is already defined early in Pure
wenzelm@16547
  2374
as Context.proof (note that ProofContext.context and Proof.context are
wenzelm@16547
  2375
aliases, where the latter is the preferred name).  This enables other
wenzelm@16547
  2376
Isabelle components to refer to that type even before Isar is present.
wenzelm@16547
  2377
wenzelm@16373
  2378
* Pure/sign/theory: discontinued named name spaces (i.e. classK,
wenzelm@16373
  2379
typeK, constK, axiomK, oracleK), but provide explicit operations for
wenzelm@16373
  2380
any of these kinds.  For example, Sign.intern typeK is now
wenzelm@16373
  2381
Sign.intern_type, Theory.hide_space Sign.typeK is now
wenzelm@16373
  2382
Theory.hide_types.  Also note that former
wenzelm@16373
  2383
Theory.hide_classes/types/consts are now
wenzelm@16373
  2384
Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
wenzelm@16373
  2385
internalize their arguments!  INCOMPATIBILITY.
wenzelm@16373
  2386
wenzelm@16506
  2387
* Pure: get_thm interface (of PureThy and ProofContext) expects
wenzelm@16506
  2388
datatype thmref (with constructors Name and NameSelection) instead of
wenzelm@16506
  2389
plain string -- INCOMPATIBILITY;
wenzelm@16506
  2390
wenzelm@16151
  2391
* Pure: cases produced by proof methods specify options, where NONE
wenzelm@16234
  2392
means to remove case bindings -- INCOMPATIBILITY in
wenzelm@16234
  2393
(RAW_)METHOD_CASES.
wenzelm@16151
  2394
wenzelm@16373
  2395
* Pure: the following operations retrieve axioms or theorems from a
wenzelm@16373
  2396
theory node or theory hierarchy, respectively:
wenzelm@16373
  2397
wenzelm@16373
  2398
  Theory.axioms_of: theory -> (string * term) list
wenzelm@16373
  2399
  Theory.all_axioms_of: theory -> (string * term) list
wenzelm@16373
  2400
  PureThy.thms_of: theory -> (string * thm) list
wenzelm@16373
  2401
  PureThy.all_thms_of: theory -> (string * thm) list
wenzelm@16373
  2402
wenzelm@16718
  2403
* Pure: print_tac now outputs the goal through the trace channel.
wenzelm@16718
  2404
wenzelm@17408
  2405
* Isar toplevel: improved diagnostics, mostly for Poly/ML only.
wenzelm@17408
  2406
Reference Toplevel.debug (default false) controls detailed printing
wenzelm@17408
  2407
and tracing of low-level exceptions; Toplevel.profiling (default 0)
wenzelm@17408
  2408
controls execution profiling -- set to 1 for time and 2 for space
wenzelm@17408
  2409
(both increase the runtime).
wenzelm@17408
  2410
wenzelm@17408
  2411
* Isar session: The initial use of ROOT.ML is now always timed,
wenzelm@17408
  2412
i.e. the log will show the actual process times, in contrast to the
wenzelm@17408
  2413
elapsed wall-clock time that the outer shell wrapper produces.
wenzelm@17408
  2414
wenzelm@17408
  2415
* Simplifier: improved handling of bound variables (nameless
wenzelm@16997
  2416
representation, avoid allocating new strings).  Simprocs that invoke
wenzelm@16997
  2417
the Simplifier recursively should use Simplifier.inherit_bounds to
wenzelm@17720
  2418
avoid local name clashes.  Failure to do so produces warnings
wenzelm@17720
  2419
"Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
wenzelm@17720
  2420
for further details.
wenzelm@16234
  2421
wenzelm@17166
  2422
* ML functions legacy_bindings and use_legacy_bindings produce ML fact
wenzelm@17166
  2423
bindings for all theorems stored within a given theory; this may help
wenzelm@17166
  2424
in porting non-Isar theories to Isar ones, while keeping ML proof
wenzelm@17166
  2425
scripts for the time being.
wenzelm@17166
  2426
wenzelm@17457
  2427
* ML operator HTML.with_charset specifies the charset begin used for
wenzelm@17457
  2428
generated HTML files.  For example:
wenzelm@17457
  2429
wenzelm@17457
  2430
  HTML.with_charset "utf-8" use_thy "Hebrew";
wenzelm@17538
  2431
  HTML.with_charset "utf-8" use_thy "Chinese";
wenzelm@17457
  2432
wenzelm@16234
  2433
wenzelm@16234
  2434
*** System ***
wenzelm@16234
  2435
wenzelm@16234
  2436
* Allow symlinks to all proper Isabelle executables (Isabelle,
wenzelm@16234
  2437
isabelle, isatool etc.).
wenzelm@16234
  2438
wenzelm@16234
  2439
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for
wenzelm@16234
  2440
isatool doc, isatool mkdir, display_drafts etc.).
wenzelm@16234
  2441
wenzelm@16234
  2442
* isatool usedir: option -f allows specification of the ML file to be
wenzelm@16234
  2443
used by Isabelle; default is ROOT.ML.
wenzelm@16234
  2444
wenzelm@16251
  2445
* New isatool version outputs the version identifier of the Isabelle
wenzelm@16251
  2446
distribution being used.
wenzelm@16251
  2447
wenzelm@16251
  2448
* HOL: new isatool dimacs2hol converts files in DIMACS CNF format
wenzelm@16234
  2449
(containing Boolean satisfiability problems) into Isabelle/HOL
wenzelm@16234
  2450
theories.
paulson@14885
  2451
paulson@14885
  2452
wenzelm@14655
  2453
wenzelm@14606
  2454
New in Isabelle2004 (April 2004)
wenzelm@14606
  2455
--------------------------------
wenzelm@13280
  2456
skalberg@14171
  2457
*** General ***
skalberg@14171
  2458
ballarin@14398
  2459
* Provers/order.ML:  new efficient reasoner for partial and linear orders.
ballarin@14398
  2460
  Replaces linorder.ML.
ballarin@14398
  2461
wenzelm@14606
  2462
* Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
wenzelm@14606
  2463
  (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
skalberg@14173
  2464
  (\<a>...\<z>), are now considered normal letters, and can therefore
skalberg@14173
  2465
  be used anywhere where an ASCII letter (a...zA...Z) has until
skalberg@14173
  2466
  now. COMPATIBILITY: This obviously changes the parsing of some
skalberg@14173
  2467
  terms, especially where a symbol has been used as a binder, say
skalberg@14173
  2468
  '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
skalberg@14173
  2469
  as an identifier.  Fix it by inserting a space around former
skalberg@14173
  2470
  symbols.  Call 'isatool fixgreek' to try to fix parsing errors in
skalberg@14173
  2471
  existing theory and ML files.
skalberg@14171
  2472
paulson@14237
  2473
* Pure: Macintosh and Windows line-breaks are now allowed in theory files.
paulson@14237
  2474
wenzelm@14731
  2475
* Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
wenzelm@14731
  2476
  allowed in identifiers. Similar to Greek letters \<^isub> is now considered
wenzelm@14731
  2477
  a normal (but invisible) letter. For multiple letter subscripts repeat
wenzelm@14731
  2478
  \<^isub> like this: x\<^isub>1\<^isub>2.
kleing@14233
  2479
kleing@14333
  2480
* Pure: There are now sub-/superscripts that can span more than one
kleing@14333
  2481
  character. Text between \<^bsub> and \<^esub> is set in subscript in
wenzelm@14606
  2482
  ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
wenzelm@14606
  2483
  superscript. The new control characters are not identifier parts.
kleing@14333
  2484
schirmer@14561
  2485
* Pure: Control-symbols of the form \<^raw:...> will literally print the
wenzelm@14606
  2486
  content of "..." to the latex file instead of \isacntrl... . The "..."
wenzelm@14606
  2487
  may consist of any printable characters excluding the end bracket >.
schirmer@14361
  2488
paulson@14237
  2489
* Pure: Using new Isar command "finalconsts" (or the ML functions
paulson@14237
  2490
  Theory.add_finals or Theory.add_finals_i) it is now possible to
paulson@14237
  2491
  declare constants "final", which prevents their being given a definition
paulson@14237
  2492
  later.  It is useful for constants whose behaviour is fixed axiomatically
skalberg@14224
  2493
  rather than definitionally, such as the meta-logic connectives.
skalberg@14224
  2494
wenzelm@14606
  2495
* Pure: 'instance' now handles general arities with general sorts
wenzelm@14606
  2496
  (i.e. intersections of classes),
skalberg@14503
  2497
kleing@14547
  2498
* Presentation: generated HTML now uses a CSS style sheet to make layout
wenzelm@14731
  2499
  (somewhat) independent of content. It is copied from lib/html/isabelle.css.
kleing@14547
  2500
  It can be changed to alter the colors/layout of generated pages.
kleing@14547
  2501
wenzelm@14556
  2502
ballarin@14175
  2503
*** Isar ***
ballarin@14175
  2504
ballarin@14508
  2505
* Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
ballarin@14508
  2506
  cut_tac, subgoal_tac and thin_tac:
ballarin@14175
  2507
  - Now understand static (Isar) contexts.  As a consequence, users of Isar
ballarin@14175
  2508
    locales are no longer forced to write Isar proof scripts.
ballarin@14175
  2509
    For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
ballarin@14175
  2510
    emulations.
ballarin@14175
  2511
  - INCOMPATIBILITY: names of variables to be instantiated may no
ballarin@14211
  2512
    longer be enclosed in quotes.  Instead, precede variable name with `?'.
ballarin@14211
  2513
    This is consistent with the instantiation attribute "where".
ballarin@14211
  2514
ballarin@14257
  2515
* Attributes "where" and "of":
ballarin@14285
  2516
  - Now take type variables of instantiated theorem into account when reading
ballarin@14285
  2517
    the instantiation string.  This fixes a bug that caused instantiated
ballarin@14285
  2518
    theorems to have too special types in some circumstances.
ballarin@14285
  2519
  - "where" permits explicit instantiations of type variables.
ballarin@14257
  2520
wenzelm@14556
  2521
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm@14556
  2522
  current facts ("this"), admitting arbitrary combinations with "then"
wenzelm@14556
  2523
  and derived forms.
kleing@14283
  2524
ballarin@14211
  2525
* Locales:
ballarin@14211
  2526
  - Goal statements involving the context element "includes" no longer
ballarin@14211
  2527
    generate theorems with internal delta predicates (those ending on
ballarin@14211
  2528
    "_axioms") in the premise.
ballarin@14211
  2529
    Resolve particular premise with <locale>.intro to obtain old form.
ballarin@14211
  2530
  - Fixed bug in type inference ("unify_frozen") that prevented mix of target
ballarin@14211
  2531
    specification and "includes" elements in goal statement.
ballarin@14254
  2532
  - Rule sets <locale>.intro and <locale>.axioms no longer declared as
ballarin@14254
  2533
    [intro?] and [elim?] (respectively) by default.
ballarin@14508
  2534
  - Experimental command for instantiation of locales in proof contexts:
ballarin@14551
  2535
        instantiate <label>[<attrs>]: <loc>
ballarin@14508
  2536
    Instantiates locale <loc> and adds all its theorems to the current context
ballarin@14551
  2537
    taking into account their attributes.  Label and attrs are optional
ballarin@14551
  2538
    modifiers, like in theorem declarations.  If present, names of
ballarin@14551
  2539
    instantiated theorems are qualified with <label>, and the attributes
ballarin@14551
  2540
    <attrs> are applied after any attributes these theorems might have already.
ballarin@14551
  2541
      If the locale has assumptions, a chained fact of the form
ballarin@14508
  2542
    "<loc> t1 ... tn" is expected from which instantiations of the parameters
ballarin@14551
  2543
    are derived.  The command does not support old-style locales declared
ballarin@14551
  2544
    with "locale (open)".
ballarin@14551
  2545
      A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
ballarin@14175
  2546
ballarin@14175
  2547
* HOL: Tactic emulation methods induct_tac and case_tac understand static
ballarin@14175
  2548
  (Isar) contexts.
ballarin@14175
  2549
wenzelm@14556
  2550
kleing@14136
  2551
*** HOL ***
kleing@14136
  2552
kleing@14624
  2553
* Proof import: new image HOL4 contains the imported library from
kleing@14624
  2554
  the HOL4 system with about 2500 theorems. It is imported by
kleing@14624
  2555
  replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
kleing@14624
  2556
  can be used like any other Isabelle image.  See
kleing@14624
  2557
  HOL/Import/HOL/README for more information.
kleing@14624
  2558
ballarin@14398
  2559
* Simplifier:
ballarin@14398
  2560
  - Much improved handling of linear and partial orders.
ballarin@14398
  2561
    Reasoners for linear and partial orders are set up for type classes
ballarin@14398
  2562
    "linorder" and "order" respectively, and are added to the default simpset
ballarin@14398
  2563
    as solvers.  This means that the simplifier can build transitivity chains
ballarin@14398
  2564
    to solve goals from the assumptions.
ballarin@14398
  2565
  - INCOMPATIBILITY: old proofs break occasionally.  Typically, applications
ballarin@14398
  2566
    of blast or auto after simplification become unnecessary because the goal
ballarin@14398
  2567
    is solved by simplification already.
ballarin@14398
  2568
wenzelm@14731
  2569
* Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
paulson@14389
  2570
    all proved in axiomatic type classes for semirings, rings and fields.
paulson@14389
  2571
paulson@14389
  2572
* Numerics:
paulson@14389
  2573
  - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
wenzelm@14731
  2574
    now formalized using the Ring_and_Field theory mentioned above.
paulson@14389
  2575
  - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
paulson@14389
  2576
    than before, because now they are set up once in a generic manner.
wenzelm@14731
  2577
  - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
paulson@14480
  2578
    Look for the general versions in Ring_and_Field (and Power if they concern
paulson@14480
  2579
    exponentiation).
paulson@14389
  2580
paulson@14401
  2581
* Type "rat" of the rational numbers is now available in HOL-Complex.
paulson@14389
  2582
schirmer@14255
  2583
* Records:
schirmer@14255
  2584
  - Record types are now by default printed with their type abbreviation
schirmer@14255
  2585
    instead of the list of all field types. This can be configured via
schirmer@14255
  2586
    the reference "print_record_type_abbr".
wenzelm@14731
  2587
  - Simproc "record_upd_simproc" for simplification of multiple updates added
schirmer@14255
  2588
    (not enabled by default).
schirmer@14427
  2589
  - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
schirmer@14427
  2590
    EX x. x = sel r to True (not enabled by default).
schirmer@14255
  2591
  - Tactic "record_split_simp_tac" to split and simplify records added.
wenzelm@14731
  2592
kleing@14136
  2593
* 'specification' command added, allowing for definition by
skalberg@14224
  2594
  specification.  There is also an 'ax_specification' command that
skalberg@14224
  2595
  introduces the new constants axiomatically.
kleing@14136
  2596
nipkow@14375
  2597
* arith(_tac) is now able to generate counterexamples for reals as well.
nipkow@14375
  2598
ballarin@14399
  2599
* HOL-Algebra: new locale "ring" for non-commutative rings.
ballarin@14399
  2600
paulson@14243
  2601
* HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
kleing@14610
  2602
  definitions, thanks to Sava Krsti\'{c} and John Matthews.
kleing@14610
  2603
wenzelm@14731
  2604
* HOL-Matrix: a first theory for matrices in HOL with an application of
kleing@14610
  2605
  matrix theory to linear programming.
kleing@14136
  2606
nipkow@14380
  2607
* Unions and Intersections:
nipkow@15119
  2608
  The latex output syntax of UN and INT has been changed
nipkow@15119
  2609
  from "\Union x \in A. B" to "\Union_{x \in A} B"
nipkow@15119
  2610
  i.e. the index formulae has become a subscript.
nipkow@15119
  2611
  Similarly for "\Union x. B", and for \Inter instead of \Union.
nipkow@14380
  2612
kleing@14418
  2613
* Unions and Intersections over Intervals:
wenzelm@14731
  2614
  There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
wenzelm@14731
  2615
  also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
kleing@14418
  2616
  like in normal math, and corresponding versions for < and for intersection.
kleing@14418
  2617
nipkow@15677
  2618
* HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
nipkow@15677
  2619
  lexicographic dictonary ordering has been added as "lexord".
nipkow@15677
  2620
paulson@14401
  2621
* ML: the legacy theory structures Int and List have been removed. They had
paulson@14401
  2622
  conflicted with ML Basis Library structures having the same names.
nipkow@14380
  2623
webertj@14464
  2624
* 'refute' command added to search for (finite) countermodels.  Only works
webertj@14464
  2625
  for a fragment of HOL.  The installation of an external SAT solver is
webertj@14464
  2626
  highly recommended.  See "HOL/Refute.thy" for details.
webertj@14464
  2627
berghofe@14602
  2628
* 'quickcheck' command: Allows to find counterexamples by evaluating
berghofe@14602
  2629
  formulae under an assignment of free variables to random values.
berghofe@14602
  2630
  In contrast to 'refute', it can deal with inductive datatypes,
berghofe@14602
  2631
  but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
berghofe@14602
  2632
  for examples.
webertj@14464
  2633
wenzelm@14606
  2634
oheimb@14536
  2635
*** HOLCF ***
oheimb@14536
  2636
oheimb@14536
  2637
* Streams now come with concatenation and are part of the HOLCF image
oheimb@14536
  2638
wenzelm@14572
  2639
wenzelm@14572
  2640
kleing@14136
  2641
New in Isabelle2003 (May 2003)
wenzelm@14606
  2642
------------------------------
kleing@14136
  2643
wenzelm@13280
  2644
*** General ***
wenzelm@13280
  2645
berghofe@13618
  2646
* Provers/simplifier:
berghofe@13618
  2647
nipkow@13781
  2648
  - Completely reimplemented method simp (ML: Asm_full_simp_tac):
berghofe@13618
  2649
    Assumptions are now subject to complete mutual simplification,
berghofe@13618
  2650
    not just from left to right. The simplifier now preserves
berghofe@13618
  2651
    the order of assumptions.
berghofe@13618
  2652
berghofe@13618
  2653
    Potential INCOMPATIBILITY:
berghofe@13618
  2654
nipkow@13781
  2655
    -- simp sometimes diverges where the old version did
nipkow@13781
  2656
       not, e.g. invoking simp on the goal
berghofe@13618
  2657
berghofe@13618
  2658
        [| P (f x); y = x; f x = f y |] ==> Q
berghofe@13618
  2659
nipkow@13781
  2660
       now gives rise to the infinite reduction sequence
nipkow@13781
  2661
nipkow@13781
  2662
        P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
nipkow@13781
  2663
nipkow@13781
  2664
       Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
nipkow@13781
  2665
       kind of problem.
nipkow@13781
  2666
nipkow@13781
  2667
    -- Tactics combining classical reasoner and simplification (such as auto)
nipkow@13781
  2668
       are also affected by this change, because many of them rely on
nipkow@13781
  2669
       simp. They may sometimes diverge as well or yield a different numbers
nipkow@13781
  2670
       of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
nipkow@13781
  2671
       in case of problems. Sometimes subsequent calls to the classical
nipkow@13781
  2672
       reasoner will fail because a preceeding call to the simplifier too
nipkow@13781
  2673
       eagerly simplified the goal, e.g. deleted redundant premises.
berghofe@13618
  2674
berghofe@13618
  2675
  - The simplifier trace now shows the names of the applied rewrite rules
berghofe@13618
  2676
nipkow@13829
  2677
  - You can limit the number of recursive invocations of the simplifier
nipkow@13829
  2678
    during conditional rewriting (where the simplifie tries to solve the
nipkow@13829
  2679
    conditions before applying the rewrite rule):
nipkow@13829
  2680
    ML "simp_depth_limit := n"
nipkow@13829
  2681
    where n is an integer. Thus you can force termination where previously
nipkow@13829
  2682
    the simplifier would diverge.
nipkow@13829
  2683
ballarin@13835
  2684
  - Accepts free variables as head terms in congruence rules.  Useful in Isar.
nipkow@13829
  2685
ballarin@13938
  2686
  - No longer aborts on failed congruence proof.  Instead, the
ballarin@13938
  2687
    congruence is ignored.
ballarin@13938
  2688
berghofe@14008
  2689
* Pure: New generic framework for extracting programs from constructive
berghofe@14008
  2690
  proofs. See HOL/Extraction.thy for an example instantiation, as well
berghofe@14008
  2691
  as HOL/Extraction for some case studies.
berghofe@14008
  2692
nipkow@13868
  2693
* Pure: The main goal of the proof state is no longer shown by default, only
nipkow@13868
  2694
the subgoals. This behaviour is controlled by a new flag.
ballarin@13835
  2695
   PG menu: Isabelle/Isar -> Settings -> Show Main Goal
nipkow@13815
  2696
(ML: Proof.show_main_goal).
nipkow@13815
  2697
nipkow@13815
  2698
* Pure: You can find all matching introduction rules for subgoal 1, i.e. all
nipkow@13815
  2699
rules whose conclusion matches subgoal 1:
nipkow@13815
  2700
      PG menu: Isabelle/Isar -> Show me -> matching rules
nipkow@13815
  2701
The rules are ordered by how closely they match the subgoal.
nipkow@13815
  2702
In particular, rules that solve a subgoal outright are displayed first
nipkow@13815
  2703
(or rather last, the way they are printed).
nipkow@13815
  2704
(ML: ProofGeneral.print_intros())
nipkow@13815
  2705
nipkow@13815
  2706
* Pure: New flag trace_unify_fail causes unification to print
nipkow@13781
  2707
diagnostic information (PG: in trace buffer) when it fails. This is
nipkow@13781
  2708
useful for figuring out why single step proofs like rule, erule or
nipkow@13781
  2709
assumption failed.
nipkow@13781
  2710
nipkow@13815
  2711
* Pure: Locale specifications now produce predicate definitions
wenzelm@13410
  2712
according to the body of text (covering assumptions modulo local
wenzelm@13410
  2713
definitions); predicate "loc_axioms" covers newly introduced text,
wenzelm@13410
  2714
while "loc" is cumulative wrt. all included locale expressions; the
wenzelm@13410
  2715
latter view is presented only on export into the global theory
wenzelm@13410
  2716
context; potential INCOMPATIBILITY, use "(open)" option to fall back
wenzelm@13410
  2717
on the old view without predicates;
wenzelm@13410
  2718
wenzelm@13459
  2719
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm@13459
  2720
parameters (as in CASL, for example); just specify something like
wenzelm@13459
  2721
``var x + var y + struct M'' as import;
wenzelm@13459
  2722
wenzelm@13463
  2723
* Pure: improved thms_containing: proper indexing of facts instead of
wenzelm@13463
  2724
raw theorems; check validity of results wrt. current name space;
wenzelm@13463
  2725
include local facts of proof configuration (also covers active
wenzelm@13541
  2726
locales), cover fixed variables in index; may use "_" in term
wenzelm@13541
  2727
specification; an optional limit for the number of printed facts may
wenzelm@13541
  2728
be given (the default is 40);
wenzelm@13541
  2729
wenzelm@13541
  2730
* Pure: disallow duplicate fact bindings within new-style theory files
wenzelm@13541
  2731
(batch-mode only);
wenzelm@13540
  2732
wenzelm@13463
  2733
* Provers: improved induct method: assumptions introduced by case
wenzelm@13463
  2734
"foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
wenzelm@13463
  2735
the goal statement); "foo" still refers to all facts collectively;
wenzelm@13463
  2736
paulson@13550
  2737
* Provers: the function blast.overloaded has been removed: all constants
paulson@13550
  2738
are regarded as potentially overloaded, which improves robustness in exchange
paulson@13550
  2739
for slight decrease in efficiency;
paulson@13550
  2740
nipkow@13781
  2741
* Provers/linorder: New generic prover for transitivity reasoning over
nipkow@13781
  2742
linear orders.  Note: this prover is not efficient!
nipkow@13781
  2743
wenzelm@13522
  2744
* Isar: preview of problems to finish 'show' now produce an error
wenzelm@13522
  2745
rather than just a warning (in interactive mode);
wenzelm@13522
  2746
wenzelm@13280
  2747
nipkow@13158
  2748
*** HOL ***
nipkow@13158
  2749
nipkow@13899
  2750
* arith(_tac)
nipkow@13899
  2751
nipkow@13899
  2752
 - Produces a counter example if it cannot prove a goal.
nipkow@13899
  2753
   Note that the counter example may be spurious if the goal is not a formula
nipkow@13899
  2754
   of quantifier-free linear arithmetic.
nipkow@13899
  2755
   In ProofGeneral the counter example appears in the trace buffer.
nipkow@13899
  2756
nipkow@13899
  2757
 - Knows about div k and mod k where k is a numeral of type nat or int.
nipkow@13899
  2758
nipkow@13899
  2759
 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
nipkow@13899
  2760
   linear arithmetic fails. This takes account of quantifiers and divisibility.
wenzelm@14731
  2761
   Presburger arithmetic can also be called explicitly via presburger(_tac).
nipkow@13899
  2762
nipkow@13899
  2763
* simp's arithmetic capabilities have been enhanced a bit: it now
nipkow@13899
  2764
takes ~= in premises into account (by performing a case split);
nipkow@13899
  2765
nipkow@13899
  2766
* simp reduces "m*(n div m) + n mod m" to n, even if the two summands
nipkow@13899
  2767
are distributed over a sum of terms;
nipkow@13899
  2768
ballarin@13735
  2769
* New tactic "trans_tac" and method "trans" instantiate
ballarin@13735
  2770
Provers/linorder.ML for axclasses "order" and "linorder" (predicates
wenzelm@14731
  2771
"<=", "<" and "=").
wenzelm@14731
  2772
wenzelm@14731
  2773
* function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
paulson@13587
  2774
HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
paulson@13587
  2775
wenzelm@13443
  2776
* 'typedef' command has new option "open" to suppress the set
wenzelm@13443
  2777
definition;
wenzelm@13443
  2778
wenzelm@13522
  2779
* functions Min and Max on finite sets have been introduced (theory
wenzelm@13522
  2780
Finite_Set);
nipkow@13492
  2781
wenzelm@13443
  2782
* attribute [symmetric] now works for relations as well; it turns
wenzelm@13443
  2783
(x,y) : R^-1 into (y,x) : R, and vice versa;
wenzelm@13443
  2784
nipkow@13613
  2785
* induct over a !!-quantified statement (say !!x1..xn):
nipkow@13613
  2786
  each "case" automatically performs "fix x1 .. xn" with exactly those names.
nipkow@13613
  2787
nipkow@13899
  2788
* Map: `empty' is no longer a constant but a syntactic abbreviation for
nipkow@13899
  2789
%x. None. Warning: empty_def now refers to the previously hidden definition
nipkow@13899
  2790
of the empty set.
nipkow@13899
  2791
ballarin@14018
  2792
* Algebra: formalization of classical algebra.  Intended as base for
ballarin@14018
  2793
any algebraic development in Isabelle.  Currently covers group theory
ballarin@14018
  2794
(up to Sylow's theorem) and ring theory (Universal Property of
ballarin@14018
  2795
Univariate Polynomials).  Contributions welcome;
paulson@13960
  2796
paulson@13960
  2797
* GroupTheory: deleted, since its material has been moved to Algebra;
paulson@13960
  2798
wenzelm@14731
  2799
* Complex: new directory of the complex numbers with numeric constants,
wenzelm@14731
  2800
nonstandard complex numbers, and some complex analysis, standard and
paulson@13966
  2801
nonstandard (Jacques Fleuriot);
paulson@13966
  2802
paulson@13966
  2803
* HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
paulson@13966
  2804
wenzelm@14731
  2805
* Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
paulson@13966
  2806
Fleuriot);
paulson@13960
  2807
wenzelm@13549
  2808
* Real/HahnBanach: updated and adapted to locales;
wenzelm@13549
  2809
ballarin@13995
  2810
* NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
ballarin@13995
  2811
Gray and Kramer);
paulson@13872
  2812
paulson@13872
  2813
* UNITY: added the Meier-Sanders theory of progress sets;
paulson@13872
  2814
kleing@14011
  2815
* MicroJava: bytecode verifier and lightweight bytecode verifier
kleing@14011
  2816
as abstract algorithms, instantiated to the JVM;
kleing@14011
  2817
schirmer@14010
  2818
* Bali: Java source language formalization. Type system, operational
schirmer@14010
  2819
semantics, axiomatic semantics. Supported language features:
schirmer@14010
  2820
classes, interfaces, objects,virtual methods, static methods,
schirmer@14010
  2821
static/instance fields, arrays, access modifiers, definite
schirmer@14010
  2822
assignment, exceptions.
wenzelm@13549
  2823
kleing@14011
  2824
wenzelm@13549
  2825
*** ZF ***
wenzelm@13549
  2826
webertj@15154
  2827
* ZF/Constructible: consistency proof for AC (Gdel's constructible
wenzelm@13549
  2828
universe, etc.);
wenzelm@13549
  2829
paulson@13872
  2830
* Main ZF: virtually all theories converted to new-style format;
nipkow@13518
  2831
wenzelm@13280
  2832
wenzelm@13478
  2833
*** ML ***
wenzelm@13478
  2834
wenzelm@13478
  2835
* Pure: Tactic.prove provides sane interface for internal proofs;
wenzelm@13478
  2836
omits the infamous "standard" operation, so this is more appropriate
wenzelm@13478
  2837
than prove_goalw_cterm in many situations (e.g. in simprocs);
wenzelm@13478
  2838
wenzelm@13478
  2839
* Pure: improved error reporting of simprocs;
wenzelm@13478
  2840
wenzelm@13478
  2841
* Provers: Simplifier.simproc(_i) provides sane interface for setting
wenzelm@13478
  2842
up simprocs;
wenzelm@13478
  2843
wenzelm@13478
  2844
kleing@13953
  2845
*** Document preparation ***
kleing@13953
  2846
kleing@13953
  2847
* uses \par instead of \\ for line breaks in theory text. This may
kleing@13953
  2848
shift some page breaks in large documents. To get the old behaviour
kleing@13953
  2849
use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
kleing@13953
  2850
wenzelm@14731
  2851
* minimized dependencies of isabelle.sty and isabellesym.sty on
kleing@13953
  2852
other packages
kleing@13953
  2853
kleing@13953
  2854
* \<euro> now needs package babel/greek instead of marvosym (which
kleing@13953
  2855
broke \Rightarrow)
kleing@13953
  2856
wenzelm@14731
  2857
* normal size for \<zero>...\<nine> (uses \mathbf instead of
kleing@13954
  2858
textcomp package)
kleing@13953
  2859
wenzelm@13280
  2860
wenzelm@14572
  2861
wenzelm@12984
  2862
New in Isabelle2002 (March 2002)
wenzelm@12984
  2863
--------------------------------
wenzelm@11474
  2864
wenzelm@11572
  2865
*** Document preparation ***
wenzelm@11572
  2866
wenzelm@11842
  2867
* greatly simplified document preparation setup, including more
wenzelm@11842
  2868
graceful interpretation of isatool usedir -i/-d/-D options, and more
wenzelm@11842
  2869
instructive isatool mkdir; users should basically be able to get
wenzelm@12899
  2870
started with "isatool mkdir HOL Test && isatool make"; alternatively,
wenzelm@12899
  2871
users may run a separate document processing stage manually like this:
wenzelm@12899
  2872
"isatool usedir -D output HOL Test && isatool document Test/output";
wenzelm@11842
  2873
wenzelm@11842
  2874
* theory dependency graph may now be incorporated into documents;
wenzelm@11842
  2875
isatool usedir -g true will produce session_graph.eps/.pdf for use
wenzelm@11842
  2876
with \includegraphics of LaTeX;
wenzelm@11842
  2877
wenzelm@11864
  2878
* proper spacing of consecutive markup elements, especially text
wenzelm@11864
  2879
blocks after section headings;
wenzelm@11864
  2880
wenzelm@11572
  2881
* support bold style (for single symbols only), input syntax is like
wenzelm@11572
  2882
this: "\<^bold>\<alpha>" or "\<^bold>A";
wenzelm@11572
  2883
wenzelm@11814
  2884
* \<bullet> is now output as bold \cdot by default, which looks much
wenzelm@11572
  2885
better in printed text;
wenzelm@11572
  2886
wenzelm@11712
  2887
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm@11712
  2888
note that these symbols are currently unavailable in Proof General /
wenzelm@12769
  2889
X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
wenzelm@12690
  2890
wenzelm@12690
  2891
* isatool latex no longer depends on changed TEXINPUTS, instead
wenzelm@12690
  2892
isatool document copies the Isabelle style files to the target
wenzelm@12690
  2893
location;
wenzelm@11712
  2894
wenzelm@11572
  2895
wenzelm@11633
  2896
*** Isar ***
wenzelm@11633
  2897
wenzelm@12312
  2898
* Pure/Provers: improved proof by cases and induction;
wenzelm@12280
  2899
  - 'case' command admits impromptu naming of parameters (such as
wenzelm@12280
  2900
    "case (Suc n)");
wenzelm@12280
  2901
  - 'induct' method divinates rule instantiation from the inductive
wenzelm@12280
  2902
    claim; no longer requires excessive ?P bindings for proper
wenzelm@12280
  2903
    instantiation of cases;
wenzelm@12280
  2904
  - 'induct' method properly enumerates all possibilities of set/type
wenzelm@12280
  2905
    rules; as a consequence facts may be also passed through *type*
wenzelm@12280
  2906
    rules without further ado;
wenzelm@12280
  2907
  - 'induct' method now derives symbolic cases from the *rulified*
wenzelm@12280
  2908
    rule (before it used to rulify cases stemming from the internal
wenzelm@12280
  2909
    atomized version); this means that the context of a non-atomic
wenzelm@12280
  2910
    statement becomes is included in the hypothesis, avoiding the
wenzelm@12280
  2911
    slightly cumbersome show "PROP ?case" form;
wenzelm@12280
  2912
  - 'induct' may now use elim-style induction rules without chaining
wenzelm@12280
  2913
    facts, using ``missing'' premises from the goal state; this allows
wenzelm@12280
  2914
    rules stemming from inductive sets to be applied in unstructured
wenzelm@12280
  2915
    scripts, while still benefitting from proper handling of non-atomic
wenzelm@12280
  2916
    statements; NB: major inductive premises need to be put first, all
wenzelm@12280
  2917
    the rest of the goal is passed through the induction;
wenzelm@12280
  2918
  - 'induct' proper support for mutual induction involving non-atomic
wenzelm@12280
  2919
    rule statements (uses the new concept of simultaneous goals, see
wenzelm@12280
  2920
    below);
wenzelm@12853
  2921
  - append all possible rule selections, but only use the first
wenzelm@12853
  2922
    success (no backtracking);
wenzelm@11995
  2923
  - removed obsolete "(simplified)" and "(stripped)" options of methods;
wenzelm@12754
  2924
  - undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm@12754
  2925
  - added 'print_induct_rules' (covered by help item in recent Proof
wenzelm@12754
  2926
    General versions);
wenzelm@11995
  2927
  - moved induct/cases attributes to Pure, methods to Provers;
wenzelm@11995
  2928
  - generic method setup instantiated for FOL and HOL;
wenzelm@11986
  2929
wenzelm@12163
  2930
* Pure: support multiple simultaneous goal statements, for example
wenzelm@12163
  2931
"have a: A and b: B" (same for 'theorem' etc.); being a pure
wenzelm@12163
  2932
meta-level mechanism, this acts as if several individual goals had
wenzelm@12163
  2933
been stated separately; in particular common proof methods need to be
wenzelm@12163
  2934
repeated in order to cover all claims; note that a single elimination
wenzelm@12163
  2935
step is *not* sufficient to establish the two conjunctions, so this
wenzelm@12163
  2936
fails:
wenzelm@12163
  2937
wenzelm@12163
  2938
  assume "A & B" then have A and B ..   (*".." fails*)
wenzelm@12163
  2939
wenzelm@12163
  2940
better use "obtain" in situations as above; alternative refer to
wenzelm@12163
  2941
multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
wenzelm@12163
  2942
wenzelm@12078
  2943
* Pure: proper integration with ``locales''; unlike the original
webertj@15154
  2944
version by Florian Kammller, Isar locales package high-level proof
wenzelm@12078
  2945
contexts rather than raw logical ones (e.g. we admit to include
wenzelm@12280
  2946
attributes everywhere); operations on locales include merge and
wenzelm@12964
  2947
rename; support for implicit arguments (``structures''); simultaneous
wenzelm@12964
  2948
type-inference over imports and text; see also HOL/ex/Locales.thy for
wenzelm@12964
  2949
some examples;
wenzelm@12078
  2950
wenzelm@12707
  2951
* Pure: the following commands have been ``localized'', supporting a
wenzelm@12707
  2952
target locale specification "(in name)": 'lemma', 'theorem',
wenzelm@12707
  2953
'corollary', 'lemmas', 'theorems', 'declare'; the results will be
wenzelm@12707
  2954
stored both within the locale and at the theory level (exported and
wenzelm@12707
  2955
qualified by the locale name);
wenzelm@12707
  2956
wenzelm@12964
  2957
* Pure: theory goals may now be specified in ``long'' form, with
wenzelm@12964
  2958
ad-hoc contexts consisting of arbitrary locale elements. for example
wenzelm@12964
  2959
``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
wenzelm@12964
  2960
definitions may be given, too); the result is a meta-level rule with
wenzelm@12964
  2961
the context elements being discharged in the obvious way;
wenzelm@12964
  2962
wenzelm@12964
  2963
* Pure: new proof command 'using' allows to augment currently used
wenzelm@12964
  2964
facts after a goal statement ('using' is syntactically analogous to
wenzelm@12964
  2965
'apply', but acts on the goal's facts only); this allows chained facts
wenzelm@12964
  2966
to be separated into parts given before and after a claim, as in
wenzelm@12964
  2967
``from a and b have C using d and e <proof>'';
wenzelm@12078
  2968
wenzelm@11722
  2969
* Pure: renamed "antecedent" case to "rule_context";
wenzelm@11722
  2970
wenzelm@12964
  2971
* Pure: new 'judgment' command records explicit information about the
wenzelm@12964
  2972
object-logic embedding (used by several tools internally); no longer
wenzelm@12964
  2973
use hard-wired "Trueprop";
wenzelm@12964
  2974
wenzelm@11738
  2975
* Pure: added 'corollary' command;
wenzelm@11738
  2976
wenzelm@11722
  2977
* Pure: fixed 'token_translation' command;
wenzelm@11722
  2978
wenzelm@11899
  2979
* Pure: removed obsolete 'exported' attribute;
wenzelm@11899
  2980
wenzelm@11933
  2981
* Pure: dummy pattern "_" in is/let is now automatically lifted over
wenzelm@11933
  2982
bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
wenzelm@11899
  2983
supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
wenzelm@11899
  2984
wenzelm@11952
  2985
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm@11952
  2986
statements (atomic meta-level propositions); setup controlled via
wenzelm@11952
  2987
rewrite rules declarations of 'atomize' attribute; example
wenzelm@11952
  2988
application: 'induct' method with proper rule statements in improper
wenzelm@11952
  2989
proof *scripts*;
wenzelm@11952
  2990
wenzelm@12106
  2991
* Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
wenzelm@12106
  2992
now consider the syntactic context of assumptions, giving a better
wenzelm@12106
  2993
chance to get type-inference of the arguments right (this is
wenzelm@12106
  2994
especially important for locales);
wenzelm@12106
  2995
wenzelm@12312
  2996
* Pure: "sorry" no longer requires quick_and_dirty in interactive
wenzelm@12312
  2997
mode;
wenzelm@12312
  2998
wenzelm@12405
  2999
* Pure/obtain: the formal conclusion "thesis", being marked as
wenzelm@12405
  3000
``internal'', may no longer be reference directly in the text;
wenzelm@12405
  3001
potential INCOMPATIBILITY, may need to use "?thesis" in rare
wenzelm@12405
  3002
situations;
wenzelm@12405
  3003
wenzelm@12405
  3004
* Pure: generic 'sym' attribute which declares a rule both as pure
wenzelm@12405
  3005
'elim?' and for the 'symmetric' operation;
wenzelm@12405
  3006
wenzelm@12877
  3007
* Pure: marginal comments ``--'' may now occur just anywhere in the
wenzelm@12877
  3008
text; the fixed correlation with particular command syntax has been
wenzelm@12877
  3009
discontinued;
wenzelm@12877
  3010
berghofe@13023
  3011
* Pure: new method 'rules' is particularly well-suited for proof
berghofe@13023
  3012
search in intuitionistic logic; a bit slower than 'blast' or 'fast',
berghofe@13023
  3013
but often produces more compact proof terms with less detours;
berghofe@13023
  3014
wenzelm@12364
  3015
* Pure/Provers/classical: simplified integration with pure rule
wenzelm@12364
  3016
attributes and methods; the classical "intro?/elim?/dest?"
wenzelm@12364
  3017
declarations coincide with the pure ones; the "rule" method no longer
wenzelm@12364
  3018
includes classically swapped intros; "intro" and "elim" methods no
wenzelm@12364
  3019
longer pick rules from the context; also got rid of ML declarations
wenzelm@12364
  3020
AddXIs/AddXEs/AddXDs; all of this has some potential for
wenzelm@12364
  3021
INCOMPATIBILITY;
wenzelm@12364
  3022
wenzelm@12405
  3023
* Provers/classical: attribute 'swapped' produces classical inversions
wenzelm@12405
  3024
of introduction rules;
wenzelm@12405
  3025
wenzelm@12364
  3026
* Provers/simplifier: 'simplified' attribute may refer to explicit
wenzelm@12364
  3027
rules instead of full simplifier context; 'iff' attribute handles
wenzelm@12364
  3028
conditional rules;
wenzelm@11936
  3029
wenzelm@11745
  3030
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm@11745
  3031
wenzelm@11690
  3032
* HOL: 'recdef' now fails on unfinished automated proofs, use
wenzelm@11633
  3033
"(permissive)" option to recover old behavior;
wenzelm@11633
  3034
wenzelm@11933
  3035
* HOL: 'inductive' no longer features separate (collective) attributes
wenzelm@11933
  3036
for 'intros' (was found too confusing);
wenzelm@11933
  3037
wenzelm@12405
  3038
* HOL: properly declared induction rules less_induct and
wenzelm@12405
  3039
wf_induct_rule;
wenzelm@12405
  3040
kleing@11788
  3041
wenzelm@11474
  3042
*** HOL ***
wenzelm@11474
  3043
wenzelm@11702
  3044
* HOL: moved over to sane numeral syntax; the new policy is as
wenzelm@11702
  3045
follows:
wenzelm@11702
  3046
wenzelm@11702
  3047
  - 0 and 1 are polymorphic constants, which are defined on any
wenzelm@11702
  3048
  numeric type (nat, int, real etc.);
wenzelm@11702
  3049
wenzelm@11702
  3050
  - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
wenzelm@11702
  3051
  binary representation internally;
wenzelm@11702
  3052
wenzelm@11702
  3053
  - type nat has special constructor Suc, and generally prefers Suc 0
wenzelm@11702
  3054
  over 1::nat and Suc (Suc 0) over 2::nat;
wenzelm@11702
  3055
wenzelm@12364
  3056
This change may cause significant problems of INCOMPATIBILITY; here
wenzelm@12364
  3057
are some hints on converting existing sources:
wenzelm@11702
  3058
wenzelm@11702
  3059
  - due to the new "num" token, "-0" and "-1" etc. are now atomic
wenzelm@11702
  3060
  entities, so expressions involving "-" (unary or binary minus) need
wenzelm@11702
  3061
  to be spaced properly;
wenzelm@11702
  3062
wenzelm@11702
  3063
  - existing occurrences of "1" may need to be constraint "1::nat" or
wenzelm@11702
  3064
  even replaced by Suc 0; similar for old "2";
wenzelm@11702
  3065
wenzelm@11702
  3066
  - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
wenzelm@11702
  3067
wenzelm@11702
  3068
  - remove all special provisions on numerals in proofs;
wenzelm@11702
  3069
wenzelm@13042
  3070
* HOL: simp rules nat_number expand numerals on nat to Suc/0
wenzelm@12837
  3071
representation (depends on bin_arith_simps in the default context);
wenzelm@12837
  3072
wenzelm@12736
  3073
* HOL: symbolic syntax for x^2 (numeral 2);
wenzelm@12736
  3074
wenzelm@12335
  3075
* HOL: the class of all HOL types is now called "type" rather than
wenzelm@12335
  3076
"term"; INCOMPATIBILITY, need to adapt references to this type class
wenzelm@12335
  3077
in axclass/classes, instance/arities, and (usually rare) occurrences
wenzelm@12335
  3078
in typings (of consts etc.); internally the class is called
wenzelm@12335
  3079
"HOL.type", ML programs should refer to HOLogic.typeS;
wenzelm@12335
  3080
wenzelm@12280
  3081
* HOL/record package improvements:
wenzelm@12280
  3082
  - new derived operations "fields" to build a partial record section,
wenzelm@12280
  3083
    "extend" to promote a fixed record to a record scheme, and
wenzelm@12280
  3084
    "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
wenzelm@12280
  3085
    declared as simp by default;
wenzelm@12587
  3086
  - shared operations ("more", "fields", etc.) now need to be always
wenzelm@12587
  3087
    qualified) --- potential INCOMPATIBILITY;
wenzelm@12280
  3088
  - removed "make_scheme" operations (use "make" with "extend") --
wenzelm@12280
  3089
    INCOMPATIBILITY;
wenzelm@11937
  3090
  - removed "more" class (simply use "term") -- INCOMPATIBILITY;
wenzelm@12253
  3091
  - provides cases/induct rules for use with corresponding Isar
wenzelm@12253
  3092
    methods (for concrete records, record schemes, concrete more
wenzelm@12280
  3093
    parts, and schematic more parts -- in that order);
wenzelm@11930
  3094
  - internal definitions directly based on a light-weight abstract
wenzelm@11930
  3095
    theory of product types over typedef rather than datatype;
wenzelm@11930
  3096
berghofe@13023
  3097
* HOL: generic code generator for generating executable ML code from
berghofe@13023
  3098
specifications; specific support for HOL constructs such as inductive
berghofe@13023
  3099
datatypes and sets, as well as recursive functions; can be invoked
berghofe@13023
  3100
via 'generate_code' theory section;
berghofe@13023
  3101
wenzelm@11933
  3102
* HOL: canonical cases/induct rules for n-tuples (n = 3..7);
wenzelm@11933
  3103
paulson@13824
  3104
* HOL: consolidated and renamed several theories.  In particular:
wenzelm@14731
  3105
        Ord.thy has been absorbed into HOL.thy
wenzelm@14731
  3106
        String.thy has been absorbed into List.thy
wenzelm@14731
  3107
wenzelm@11802
  3108
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm@11802
  3109
(beware of argument permutation!);
wenzelm@11802
  3110
wenzelm@11657
  3111
* HOL: linorder_less_split superseded by linorder_cases;
wenzelm@11657
  3112
wenzelm@12917
  3113
* HOL/List: "nodups" renamed to "distinct";
nipkow@12889
  3114
wenzelm@11633
  3115
* HOL: added "The" definite description operator; move Hilbert's "Eps"
paulson@13824
  3116
to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
paulson@13824
  3117
  - Ex_def has changed, now need to use some_eq_ex
wenzelm@11437
  3118
wenzelm@11572
  3119
* HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
wenzelm@11572
  3120
in this (rare) case use:
wenzelm@11572
  3121
wenzelm@11572
  3122
  delSWrapper "split_all_tac"
wenzelm@11572
  3123
  addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
wenzelm@11572
  3124
wenzelm@11572
  3125
* HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
wenzelm@11474
  3126
MAY FAIL;
nipkow@11361
  3127
wenzelm@11572
  3128
* HOL: introduced f^n = f o ... o f; warning: due to the limits of
wenzelm@11572
  3129
Isabelle's type classes, ^ on functions and relations has too general
wenzelm@11572
  3130
a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
wenzelm@11572
  3131
necessary to attach explicit type constraints;
nipkow@11307
  3132
wenzelm@12917
  3133
* HOL/Relation: the prefix name of the infix "O" has been changed from
wenzelm@12917
  3134
"comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
wenzelm@12917
  3135
renamed accordingly (eg "compI" -> "rel_compI").
nipkow@12489
  3136
wenzelm@11487
  3137
* HOL: syntax translations now work properly with numerals and records
wenzelm@11487
  3138
expressions;
wenzelm@11474
  3139
wenzelm@12457
  3140
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm@12457
  3141
of "lam" -- INCOMPATIBILITY;
wenzelm@11474
  3142
wenzelm@11933
  3143
* HOL: got rid of some global declarations (potential INCOMPATIBILITY
wenzelm@11933
  3144
for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
wenzelm@11933
  3145
renamed "Product_Type.unit";
wenzelm@11611
  3146
nipkow@12564
  3147
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
nipkow@12564
  3148
wenzelm@12924
  3149
* HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
wenzelm@12924
  3150
the "cases" method);
wenzelm@12924
  3151
wenzelm@12597
  3152
* HOL/GroupTheory: group theory examples including Sylow's theorem (by
webertj@15154
  3153
Florian Kammller);
wenzelm@12597
  3154
wenzelm@12608
  3155
* HOL/IMP: updated and converted to new-style theory format; several
wenzelm@12608
  3156
parts turned into readable document, with proper Isar proof texts and
wenzelm@12608
  3157
some explanations (by Gerwin Klein);
wenzelm@12597
  3158
wenzelm@12734
  3159
* HOL-Real: added Complex_Numbers (by Gertrud Bauer);
wenzelm@12734
  3160
wenzelm@12690
  3161
* HOL-Hyperreal is now a logic image;
wenzelm@12690
  3162
wenzelm@11611
  3163
wenzelm@12022
  3164
*** HOLCF ***
wenzelm@12022
  3165
wenzelm@12622
  3166
* Isar: consts/constdefs supports mixfix syntax for continuous
wenzelm@12622
  3167
operations;
wenzelm@12622
  3168
wenzelm@12622
  3169
* Isar: domain package adapted to new-style theory format, e.g. see
wenzelm@12622
  3170
HOLCF/ex/Dnat.thy;
wenzelm@12622
  3171
wenzelm@12622
  3172
* theory Lift: proper use of rep_datatype lift instead of ML hacks --
wenzelm@12280
  3173
potential INCOMPATIBILITY; now use plain induct_tac instead of former
wenzelm@12280
  3174
lift.induct_tac, always use UU instead of Undef;
wenzelm@12022
  3175
wenzelm@12597
  3176
* HOLCF/IMP: updated and converted to new-style theory;
wenzelm@12597
  3177
wenzelm@12022
  3178
wenzelm@11474
  3179
*** ZF ***
wenzelm@11474
  3180
wenzelm@12622
  3181
* Isar: proper integration of logic-specific tools and packages,
wenzelm@12622
  3182
including theory commands '(co)inductive', '(co)datatype',
wenzelm@12622
  3183
'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
wenzelm@12622
  3184
'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
wenzelm@12622
  3185
wenzelm@12622
  3186
* theory Main no longer includes AC; for the Axiom of Choice, base
wenzelm@12622
  3187
your theory on Main_ZFC;
wenzelm@12622
  3188
wenzelm@12622
  3189
* the integer library now covers quotients and remainders, with many
wenzelm@12622
  3190
laws relating division to addition, multiplication, etc.;
paulson@12563
  3191
wenzelm@12280
  3192
* ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
wenzelm@12280
  3193
typeless version of the formalism;
wenzelm@12280
  3194
wenzelm@13025
  3195
* ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
wenzelm@13025
  3196
format;
wenzelm@12608
  3197
wenzelm@12280
  3198
* ZF/Induct: new directory for examples of inductive definitions,
wenzelm@12608
  3199
including theory Multiset for multiset orderings; converted to
wenzelm@12608
  3200
new-style theory format;
wenzelm@12177
  3201
wenzelm@13025
  3202
* ZF: many new theorems about lists, ordinals, etc.;
paulson@12850
  3203
wenzelm@11474
  3204
wenzelm@11474
  3205
*** General ***
wenzelm@11474
  3206
wenzelm@12280
  3207
* Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
wenzelm@12280
  3208
variable proof controls level of detail: 0 = no proofs (only oracle
wenzelm@12280
  3209
dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
wenzelm@12280
  3210
also ref manual for further ML interfaces;
wenzelm@12280
  3211
wenzelm@12280
  3212
* Pure/axclass: removed obsolete ML interface
wenzelm@12280
  3213
goal_subclass/goal_arity;
wenzelm@12280
  3214
wenzelm@12280
  3215
* Pure/syntax: new token syntax "num" for plain numerals (without "#"
wenzelm@12280
  3216
of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
wenzelm@12280
  3217
separate tokens, so expressions involving minus need to be spaced
wenzelm@12280
  3218
properly;
wenzelm@12280
  3219
wenzelm@12312
  3220
* Pure/syntax: support non-oriented infixes, using keyword "infix"
wenzelm@12312
  3221
rather than "infixl" or "infixr";
wenzelm@12312
  3222
wenzelm@12312
  3223
* Pure/syntax: concrete syntax for dummy type variables admits genuine
wenzelm@12312
  3224
sort constraint specifications in type inference; e.g. "x::_::foo"
wenzelm@12312
  3225
ensures that the type of "x" is of sort "foo" (but not necessarily a
wenzelm@12312
  3226
type variable);
wenzelm@12280
  3227
wenzelm@12280
  3228
* Pure/syntax: print modes "type_brackets" and "no_type_brackets"
wenzelm@12280
  3229
control output of nested => (types); the default behavior is
wenzelm@12280
  3230
"type_brackets";
wenzelm@12280
  3231
wenzelm@12280
  3232
* Pure/syntax: builtin parse translation for "_constify" turns valued
wenzelm@11817
  3233
tokens into AST constants;
wenzelm@11474
  3234
wenzelm@12280
  3235
* Pure/syntax: prefer later declarations of translations and print
wenzelm@12280
  3236
translation functions; potential INCOMPATIBILITY: need to reverse
wenzelm@12280
  3237
multiple declarations for same syntax element constant;
wenzelm@12280
  3238
wenzelm@12832
  3239
* Pure/show_hyps reset by default (in accordance to existing Isar
wenzelm@12832
  3240
practice);
wenzelm@12832
  3241
wenzelm@12280
  3242
* Provers/classical: renamed addaltern to addafter, addSaltern to
wenzelm@12280
  3243
addSafter;
wenzelm@12280
  3244
wenzelm@12280
  3245
* Provers/clasimp: ``iff'' declarations now handle conditional rules
wenzelm@12280
  3246
as well;
wenzelm@12253
  3247
wenzelm@12538
  3248
* system: tested support for MacOS X; should be able to get Isabelle +
wenzelm@12538
  3249
Proof General to work in a plain Terminal after installing Poly/ML
wenzelm@12538
  3250
(e.g. from the Isabelle distribution area) and GNU bash alone
wenzelm@12538
  3251
(e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
wenzelm@12538
  3252
support requires further installations, e.g. from
wenzelm@12538
  3253
http://fink.sourceforge.net/);
wenzelm@12538
  3254
wenzelm@12280
  3255
* system: support Poly/ML 4.1.1 (able to manage larger heaps);
wenzelm@11551
  3256
wenzelm@12753
  3257
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm@12753
  3258
of 40 MB), cf. ML_OPTIONS;
wenzelm@12753
  3259
wenzelm@11633
  3260
* system: Proof General keywords specification is now part of the
wenzelm@11633
  3261
Isabelle distribution (see etc/isar-keywords.el);
wenzelm@11633
  3262
wenzelm@12728
  3263
* system: support for persistent Proof General sessions (refrain from
wenzelm@12728
  3264
outdating all loaded theories on startup); user may create writable
wenzelm@12728
  3265
logic images like this: ``isabelle -q HOL Test'';
wenzelm@12597
  3266
wenzelm@11551
  3267
* system: smart selection of Isabelle process versus Isabelle
wenzelm@11572
  3268
interface, accommodates case-insensitive file systems (e.g. HFS+); may
wenzelm@11572
  3269
run both "isabelle" and "Isabelle" even if file names are badly
wenzelm@11572
  3270
damaged (executable inspects the case of the first letter of its own
wenzelm@11572
  3271
name); added separate "isabelle-process" and "isabelle-interface";
wenzelm@11551
  3272
wenzelm@12472
  3273
* system: refrain from any attempt at filtering input streams; no
wenzelm@12472
  3274
longer support ``8bit'' encoding of old isabelle font, instead proper
wenzelm@12472
  3275
iso-latin characters may now be used; the related isatools
wenzelm@12472
  3276
"symbolinput" and "nonascii" have disappeared as well;
wenzelm@12472
  3277
wenzelm@12472
  3278
* system: removed old "xterm" interface (the print modes "xterm" and
wenzelm@12472
  3279
"xterm_color" are still available for direct use in a suitable
wenzelm@12472
  3280
terminal);
wenzelm@12472
  3281
paulson@11314
  3282
oheimb@11169
  3283
wenzelm@11062
  3284
New in Isabelle99-2 (February 2001)
wenzelm@11062
  3285
-----------------------------------
wenzelm@11062
  3286
nipkow@10224
  3287
*** Overview of INCOMPATIBILITIES ***
nipkow@10224
  3288
paulson@11241
  3289
* HOL: please note that theories in the Library and elsewhere often use the
paulson@11241
  3290
new-style (Isar) format; to refer to their theorems in an ML script you must
wenzelm@12622
  3291
bind them to ML identifers by e.g.      val thm_name = thm "thm_name";
paulson@11241
  3292
wenzelm@11043
  3293
* HOL: inductive package no longer splits induction rule aggressively,
wenzelm@11043
  3294
but only as far as specified by the introductions given; the old
oheimb@11130
  3295
format may be recovered via ML function complete_split_rule or attribute
wenzelm@11043
  3296
'split_rule (complete)';
wenzelm@11043
  3297
wenzelm@10998
  3298
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
wenzelm@10998
  3299
gfp_Tarski to gfp_unfold;
nipkow@10224
  3300
paulson@10288
  3301
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
paulson@10288
  3302
wenzelm@10858
  3303
* HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
wenzelm@10858
  3304
relation); infix "^^" has been renamed "``"; infix "``" has been
wenzelm@10858
  3305
renamed "`"; "univalent" has been renamed "single_valued";
nipkow@10793
  3306
wenzelm@10998
  3307
* HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
wenzelm@10998
  3308
operation;
wenzelm@10998
  3309
nipkow@10868
  3310
* HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
nipkow@10856
  3311
wenzelm@10391
  3312
* Isar: 'obtain' no longer declares "that" fact as simp/intro;
wenzelm@10391
  3313
wenzelm@10401
  3314
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm@10401
  3315
consequence, it is no longer monotonic wrt. the local goal context
wenzelm@10401
  3316
(which is now passed through the inductive cases);
wenzelm@10401
  3317
wenzelm@10976
  3318
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm@10976
  3319
\<gg> to \<ggreater>;
wenzelm@10976
  3320
nipkow@10224
  3321
wenzelm@10245
  3322
*** Document preparation ***
wenzelm@10245
  3323
wenzelm@10858
  3324
* \isabellestyle{NAME} selects version of Isabelle output (currently
wenzelm@10858
  3325
available: are "it" for near math-mode best-style output, "sl" for
wenzelm@10858
  3326
slanted text style, and "tt" for plain type-writer; if no
wenzelm@10858
  3327
\isabellestyle command is given, output is according to slanted
wenzelm@10858
  3328
type-writer);
wenzelm@10858
  3329
wenzelm@10322
  3330
* support sub/super scripts (for single symbols only), input syntax is
wenzelm@10322
  3331
like this: "A\<^sup>*" or "A\<^sup>\<star>";
wenzelm@10322
  3332
wenzelm@10858
  3333
* some more standard symbols; see Appendix A of the system manual for
wenzelm@11062
  3334
the complete list of symbols defined in isabellesym.sty;
wenzelm@10858
  3335
wenzelm@10998
  3336
* improved isabelle style files; more abstract symbol implementation
wenzelm@10998
  3337
(should now use \isamath{...} and \isatext{...} in custom symbol
wenzelm@10998
  3338
definitions);
wenzelm@10998
  3339
wenzelm@10634
  3340
* antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
wenzelm@10634
  3341
state; Note that presentation of goal states does not conform to
wenzelm@10634
  3342
actual human-readable proof documents.  Please do not include goal
wenzelm@10634
  3343
states into document output unless you really know what you are doing!
wenzelm@10322
  3344
wenzelm@11062
  3345
* proper indentation of antiquoted output with proportional LaTeX
wenzelm@11062
  3346
fonts;
wenzelm@10862
  3347
wenzelm@11050
  3348
* no_document ML operator temporarily disables LaTeX document
wenzelm@11050
  3349
generation;
wenzelm@11050
  3350
wenzelm@11062
  3351
* isatool unsymbolize tunes sources for plain ASCII communication;
wenzelm@11062
  3352
wenzelm@10322
  3353
wenzelm@10306
  3354
*** Isar ***
wenzelm@10306
  3355
wenzelm@10547
  3356
* Pure: Isar now suffers initial goal statements to contain unbound
wenzelm@10547
  3357
schematic variables (this does not conform to actual readable proof
wenzelm@10547
  3358
documents, due to unpredictable outcome and non-compositional proof
wenzelm@10547
  3359
checking); users who know what they are doing may use schematic goals
wenzelm@10547
  3360
for Prolog-style synthesis of proven results;
wenzelm@10547
  3361
wenzelm@10391
  3362
* Pure: assumption method (an implicit finishing) now handles actual
wenzelm@10391
  3363
rules as well;
wenzelm@10391
  3364
wenzelm@10391
  3365
* Pure: improved 'obtain' --- moved to Pure, insert "that" into
wenzelm@10391
  3366
initial goal, declare "that" only as Pure intro (only for single
wenzelm@10391
  3367
steps); the "that" rule assumption may now be involved in implicit
wenzelm@10391
  3368
finishing, thus ".." becomes a feasible for trivial obtains;
wenzelm@10391
  3369
wenzelm@10391
  3370
* Pure: default proof step now includes 'intro_classes'; thus trivial
wenzelm@10391
  3371
instance proofs may be performed by "..";
wenzelm@10391
  3372
wenzelm@10391
  3373
* Pure: ?thesis / ?this / "..." now work for pure meta-level
wenzelm@10391
  3374
statements as well;
wenzelm@10306
  3375
wenzelm@11097
  3376
* Pure: more robust selection of calculational rules;
wenzelm@11097
  3377
wenzelm@10858
  3378
* Pure: the builtin notion of 'finished' goal now includes the ==-refl
wenzelm@10858
  3379
rule (as well as the assumption rule);
wenzelm@10858
  3380
wenzelm@10858
  3381
* Pure: 'thm_deps' command visualizes dependencies of theorems and
wenzelm@10858
  3382
lemmas, using the graph browser tool;
wenzelm@10858
  3383
wenzelm@10944
  3384
* Pure: predict failure of "show" in interactive mode;
wenzelm@10944
  3385
wenzelm@11016
  3386
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm@11016
  3387
wenzelm@10401
  3388
* HOL: improved method 'induct' --- now handles non-atomic goals
wenzelm@10401
  3389
(potential INCOMPATIBILITY); tuned error handling;
wenzelm@10401
  3390
wenzelm@10557
  3391
* HOL: cases and induct rules now provide explicit hints about the
wenzelm@10547
  3392
number of facts to be consumed (0 for "type" and 1 for "set" rules);
wenzelm@10547
  3393
any remaining facts are inserted into the goal verbatim;
wenzelm@10547
  3394
wenzelm@10858
  3395
* HOL: local contexts (aka cases) may now contain term bindings as
wenzelm@10858
  3396
well; the 'cases' and 'induct' methods new provide a ?case binding for
wenzelm@10858
  3397
the result to be shown in each case;
wenzelm@10858
  3398
wenzelm@10770
  3399
* HOL: added 'recdef_tc' command;
wenzelm@10770
  3400
wenzelm@11016
  3401
* isatool convert assists in eliminating legacy ML scripts;
wenzelm@11016
  3402
wenzelm@10306
  3403
wenzelm@10245
  3404
*** HOL ***
wenzelm@10245
  3405
wenzelm@10245
  3406
* HOL/Library: a collection of generic theories to be used together
wenzelm@10245
  3407
with main HOL; the theory loader path already includes this directory
wenzelm@10245
  3408
by default; the following existing theories have been moved here:
wenzelm@10245
  3409
HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
wenzelm@10337
  3410
(as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
wenzelm@10245
  3411
wenzelm@10966
  3412
* HOL/Unix: "Some aspects of Unix file-system security", a typical
wenzelm@10966
  3413
modelling and verification task performed in Isabelle/HOL +
wenzelm@10966
  3414
Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
wenzelm@10966
  3415
wenzelm@11094
  3416
* HOL/Algebra: special summation operator SUM no longer exists, it has
wenzelm@11094
  3417
been replaced by setsum; infix 'assoc' now has priority 50 (like
wenzelm@11094
  3418
'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
wenzelm@11094
  3419
'domain', this makes the theory consistent with mathematical
wenzelm@11094
  3420
literature;
wenzelm@11094
  3421
wenzelm@10514
  3422
* HOL basics: added overloaded operations "inverse" and "divide"
wenzelm@10726
  3423
(infix "/"), syntax for generic "abs" operation, generic summation
wenzelm@11094
  3424
operator \<Sum>;
wenzelm@10452
  3425
wenzelm@10391
  3426
* HOL/typedef: simplified package, provide more useful rules (see also
wenzelm@10391
  3427
HOL/subset.thy);
wenzelm@10391
  3428
wenzelm@10915
  3429
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm@10915
  3430
now expressed as a proper nested rule (old-style tactic scripts may
wenzelm@10915
  3431
require atomize_strip_tac to cope with non-atomic premises);
wenzelm@10915
  3432
wenzelm@10915
  3433
* HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
wenzelm@10915
  3434
to "split_conv" (old name still available for compatibility);
wenzelm@10915
  3435
wenzelm@10915
  3436
* HOL: improved concrete syntax for strings (e.g. allows translation
wenzelm@10915
  3437
rules with string literals);
wenzelm@10915
  3438
paulson@12245
  3439
* HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
paulson@12245
  3440
 and Fleuriot's mechanization of analysis, including the transcendental
paulson@12245
  3441
 functions for the reals;
paulson@10756
  3442
wenzelm@11094
  3443
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
wenzelm@10391
  3444
wenzelm@10858
  3445
paulson@10474
  3446
*** CTT ***
paulson@10474
  3447
wenzelm@10547
  3448
* CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
wenzelm@10547
  3449
"lam" is displayed as TWO lambda-symbols
paulson@10474
  3450
wenzelm@10547
  3451
* CTT: theory Main now available, containing everything (that is, Bool
wenzelm@10547
  3452
and Arith);
wenzelm@10547
  3453
paulson@10474
  3454
wenzelm@10391
  3455
*** General ***
wenzelm@10391
  3456
wenzelm@10547
  3457
* Pure: the Simplifier has been implemented properly as a derived rule
wenzelm@10547
  3458
outside of the actual kernel (at last!); the overall performance
wenzelm@10547
  3459
penalty in practical applications is about 50%, while reliability of
wenzelm@10547
  3460
the Isabelle inference kernel has been greatly improved;
wenzelm@10547
  3461
wenzelm@11112
  3462
* print modes "brackets" and "no_brackets" control output of nested =>
wenzelm@11112
  3463
(types) and ==> (props); the default behaviour is "brackets";
wenzelm@11112
  3464
wenzelm@10391
  3465
* Provers: fast_tac (and friends) now handle actual object-logic rules
wenzelm@10391
  3466
as assumptions as well;
wenzelm@10391
  3467
wenzelm@11124
  3468
* system: support Poly/ML 4.0;
wenzelm@11124
  3469
wenzelm@11124
  3470
* system: isatool install handles KDE version 1 or 2;
wenzelm@11124
  3471
wenzelm@10391
  3472
wenzelm@10245
  3473
wenzelm@10103
  3474
New in Isabelle99-1 (October 2000)
wenzelm@10103
  3475
----------------------------------
wenzelm@8015
  3476
wenzelm@10003
  3477
*** Overview of INCOMPATIBILITIES ***
paulson@8014
  3478
wenzelm@8848
  3479
* HOL: simplification of natural numbers is much changed; to partly
wenzelm@8848
  3480
recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
wenzelm@8848
  3481
issue the following ML commands:
wenzelm@8848
  3482
wenzelm@8848
  3483
  Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
wenzelm@8848
  3484
  Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
paulson@8788
  3485
wenzelm@10129
  3486
* HOL: simplification no longer dives into case-expressions; this is
wenzelm@10129
  3487
controlled by "t.weak_case_cong" for each datatype t;
paulson@8967
  3488
wenzelm@10003
  3489
* HOL: nat_less_induct renamed to less_induct;
wenzelm@10003
  3490
wenzelm@10003
  3491
* HOL: systematic renaming of the SOME (Eps) rules, may use isatool
wenzelm@10003
  3492
fixsome to patch .thy and .ML sources automatically;
wenzelm@10003
  3493
wenzelm@10003
  3494
  select_equality  -> some_equality
wenzelm@10003
  3495
  select_eq_Ex     -> some_eq_ex
wenzelm@10003
  3496
  selectI2EX       -> someI2_ex
wenzelm@10003
  3497
  selectI2         -> someI2
wenzelm@10003
  3498
  selectI          -> someI
wenzelm@10003
  3499
  select1_equality -> some1_equality
wenzelm@10003
  3500
  Eps_sym_eq       -> some_sym_eq_trivial
wenzelm@10003
  3501
  Eps_eq           -> some_eq_trivial
wenzelm@10003
  3502
wenzelm@10003
  3503
* HOL: exhaust_tac on datatypes superceded by new generic case_tac;
wenzelm@10003
  3504
wenzelm@10003
  3505
* HOL: removed obsolete theorem binding expand_if (refer to split_if
wenzelm@10003
  3506
instead);
wenzelm@10003
  3507
wenzelm@10003
  3508
* HOL: the recursion equations generated by 'recdef' are now called
wenzelm@10003
  3509
f.simps instead of f.rules;
wenzelm@10003
  3510
wenzelm@10003
  3511
* HOL: qed_spec_mp now also handles bounded ALL as well;
wenzelm@10003
  3512
wenzelm@10003
  3513
* HOL: 0 is now overloaded, so the type constraint ":: nat" may
wenzelm@10003
  3514
sometimes be needed;
wenzelm@10003
  3515
wenzelm@10003
  3516
* HOL: the constant for "f``x" is now "image" rather than "op ``";
paulson@8014
  3517
paulson@10065
  3518
* HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
paulson@10065
  3519
wenzelm@9330
  3520
* HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
wenzelm@9330
  3521
product is now "<*>" instead of "Times"; the lexicographic product is
wenzelm@9330
  3522
now "<*lex*>" instead of "**";
nipkow@8705
  3523
wenzelm@10003
  3524
* HOL: theory Sexp is now in HOL/Induct examples (it used to be part
wenzelm@10003
  3525
of main HOL, but was unused); better use HOL's datatype package;
paulson@9971
  3526
wenzelm@10137
  3527
* HOL: removed "symbols" syntax for constant "override" of theory Map;
wenzelm@10137
  3528
the old syntax may be recovered as follows:
wenzelm@10137
  3529
wenzelm@10137
  3530
  syntax (symbols)
wenzelm@10137
  3531
    override  :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
wenzelm@10137
  3532
      (infixl "\\<oplus>" 100)
wenzelm@10137
  3533
wenzelm@8848
  3534
* HOL/Real: "rabs" replaced by overloaded "abs" function;
wenzelm@8848
  3535
wenzelm@8887
  3536
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm@8887
  3537
Lfp, Gfp, WF); this only affects ML packages that refer to const names
wenzelm@8887
  3538
internally;
wenzelm@8887
  3539
wenzelm@10003
  3540
* HOL and ZF: syntax for quotienting wrt an equivalence relation
wenzelm@10003
  3541
changed from A/r to A//r;
wenzelm@9908
  3542
wenzelm@10003
  3543
* ZF: new treatment of arithmetic (nat & int) may break some old
wenzelm@10003
  3544
proofs;
paulson@9388
  3545
wenzelm@10003
  3546
* Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
wenzelm@10003
  3547
rulify -> rule_format, elimify -> elim_format, ...);
paulson@9542
  3548
wenzelm@9941
  3549
* Isar/Provers: intro/elim/dest attributes changed; renamed
wenzelm@9941
  3550
intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
wenzelm@9937
  3551
should have to change intro!! to intro? only); replaced "delrule" by
wenzelm@9937
  3552
"rule del";
wenzelm@9437
  3553
wenzelm@9612
  3554
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
wenzelm@9612
  3555
wenzelm@9437
  3556
* Provers: strengthened force_tac by using new first_best_tac;
oheimb@9402
  3557
wenzelm@10003
  3558
* LaTeX document preparation: several changes of isabelle.sty (see
wenzelm@10003
  3559
lib/texinputs);
wenzelm@8729
  3560
paulson@8014
  3561
wenzelm@8487
  3562
*** Document preparation ***
wenzelm@8358
  3563
wenzelm@9198
  3564
* formal comments (text blocks etc.) in new-style theories may now
wenzelm@9753
  3565
contain antiquotations of thm/prop/term/typ/text to be presented
wenzelm@9753
  3566
according to latex print mode; concrete syntax is like this:
wenzelm@9753
  3567
@{term[show_types] "f(x) = a + x"};
wenzelm@9198
  3568
wenzelm@8358
  3569
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm@8518
  3570
including proper document sources;
wenzelm@8358
  3571
wenzelm@8358
  3572
* generated LaTeX sources are now deleted after successful run
wenzelm@8358
  3573
(isatool document -c); may retain a copy somewhere else via -D option
wenzelm@8358
  3574
of isatool usedir;
wenzelm@8358
  3575
wenzelm@8566
  3576
* isatool usedir -D now lets isatool latex -o sty update the Isabelle
wenzelm@10003
  3577
style files, achieving self-contained LaTeX sources and simplifying
wenzelm@10003
  3578
LaTeX debugging;
wenzelm@8566
  3579
wenzelm@8518
  3580
* old-style theories now produce (crude) LaTeX output as well;
wenzelm@8358
  3581
wenzelm@9057
  3582
* browser info session directories are now self-contained (may be put
wenzelm@9437
  3583
on WWW server seperately); improved graphs of nested sessions; removed
wenzelm@9437
  3584
graph for 'all sessions';
wenzelm@9057
  3585
wenzelm@10003
  3586
* several improvements in isabelle style files; \isabellestyle{it}
wenzelm@10003
  3587
produces fake math mode output; \isamarkupheader is now \section by
wenzelm@10003
  3588
default; see lib/texinputs/isabelle.sty etc.;
wenzelm@9489
  3589
wenzelm@8358
  3590
wenzelm@8184
  3591
*** Isar ***
wenzelm@8184
  3592
wenzelm@10003
  3593
* Isar/Pure: local results and corresponding term bindings are now
wenzelm@10003
  3594
subject to Hindley-Milner polymorphism (similar to ML); this
wenzelm@10003
  3595
accommodates incremental type-inference very nicely;
wenzelm@8283
  3596
wenzelm@10003
  3597
* Isar/Pure: new derived language element 'obtain' supports
wenzelm@10003
  3598
generalized existence reasoning;
wenzelm@8621
  3599
wenzelm@10003
  3600
* Isar/Pure: new calculational elements 'moreover' and 'ultimately'
wenzelm@10003
  3601
support accumulation of results, without applying any rules yet;
wenzelm@10003
  3602
useful to collect intermediate results without explicit name
wenzelm@10003
  3603
references, and for use with transitivity rules with more than 2
wenzelm@10003
  3604
premises;
wenzelm@8184
  3605
wenzelm@10003
  3606
* Isar/Pure: scalable support for case-analysis type proofs: new
wenzelm@10003
  3607
'case' language element refers to local contexts symbolically, as
wenzelm@10003
  3608
produced by certain proof methods; internally, case names are attached
wenzelm@10003
  3609
to theorems as "tags";
wenzelm@8440
  3610
wenzelm@10003
  3611
* Isar/Pure: theory command 'hide' removes declarations from
wenzelm@9330
  3612
class/type/const name spaces;
wenzelm@9330
  3613
wenzelm@10003
  3614
* Isar/Pure: theory command 'defs' supports option "(overloaded)" to
wenzelm@9330
  3615
indicate potential overloading;
wenzelm@9330
  3616
wenzelm@10003
  3617
* Isar/Pure: changed syntax of local blocks from {{ }} to { };
wenzelm@8921
  3618
wenzelm@10003
  3619
* Isar/Pure: syntax of sorts made 'inner', i.e. have to write
wenzelm@10003
  3620
"{a,b,c}" instead of {a,b,c};
wenzelm@9612
  3621
wenzelm@10003
  3622
* Isar/Pure now provides its own version of intro/elim/dest
wenzelm@10003
  3623
attributes; useful for building new logics, but beware of confusion
wenzelm@10003
  3624
with the version in Provers/classical;
wenzelm@8921
  3625
wenzelm@10003
  3626
* Isar/Pure: the local context of (non-atomic) goals is provided via
wenzelm@10003
  3627
case name 'antecedent';
wenzelm@8621
  3628
wenzelm@10003
  3629
* Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
wenzelm@10003
  3630
to the current context is now done automatically);
wenzelm@8991
  3631
wenzelm@10003
  3632
* Isar/Pure: theory command 'method_setup' provides a simple interface
wenzelm@10003
  3633
for definining proof methods in ML;
wenzelm@9011
  3634
wenzelm@10003
  3635
* Isar/Provers: intro/elim/dest attributes changed; renamed
wenzelm@9941
  3636
intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
wenzelm@9941
  3637
most cases, one should have to change intro!! to intro? only);
wenzelm@9941
  3638
replaced "delrule" by "rule del";
wenzelm@8283
  3639
wenzelm@10003
  3640
* Isar/Provers: new 'hypsubst' method, plain 'subst' method and
wenzelm@10003
  3641
'symmetric' attribute (the latter supercedes [RS sym]);
wenzelm@9612
  3642
wenzelm@10003
  3643
* Isar/Provers: splitter support (via 'split' attribute and 'simp'
wenzelm@10003
  3644
method modifier); 'simp' method: 'only:' modifier removes loopers as
wenzelm@10003
  3645
well (including splits);
wenzelm@10003
  3646
wenzelm@10003
  3647
* Isar/Provers: Simplifier and Classical methods now support all kind
wenzelm@10003
  3648
of modifiers used in the past, including 'cong', 'iff', etc.
wenzelm@10003
  3649
wenzelm@10003
  3650
* Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
wenzelm@10003
  3651
of Simplifier and Classical reasoner);
wenzelm@10003
  3652
wenzelm@10003
  3653
* Isar/HOL: new proof method 'cases' and improved version of 'induct'
wenzelm@10003
  3654
now support named cases; major packages (inductive, datatype, primrec,
wenzelm@10003
  3655
recdef) support case names and properly name parameters;
wenzelm@10003
  3656
wenzelm@10003
  3657
* Isar/HOL: new transitivity rules for substitution in inequalities --
wenzelm@10003
  3658
monotonicity conditions are extracted to be proven at end of
wenzelm@10003
  3659
calculations;
wenzelm@10003
  3660
wenzelm@10003
  3661
* Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
wenzelm@10003
  3662
method anyway;
wenzelm@10003
  3663
wenzelm@10003
  3664
* Isar/HOL: removed old expand_if = split_if; theorems if_splits =
wenzelm@10003
  3665
split_if split_if_asm; datatype package provides theorems foo.splits =
wenzelm@10003
  3666
foo.split foo.split_asm for each datatype;
wenzelm@10003
  3667
wenzelm@10003
  3668
* Isar/HOL: tuned inductive package, rename "intrs" to "intros"
wenzelm@10003
  3669
(potential INCOMPATIBILITY), emulation of mk_cases feature for proof
wenzelm@10003
  3670
scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
wenzelm@10003
  3671
use "(cases (simplified))" method in proper proof texts);
wenzelm@10003
  3672
wenzelm@10003
  3673
* Isar/HOL: added global 'arith_split' attribute for 'arith' method;
wenzelm@10003
  3674
wenzelm@10003
  3675
* Isar: names of theorems etc. may be natural numbers as well;
wenzelm@10003
  3676
wenzelm@10003
  3677
* Isar: 'pr' command: optional arguments for goals_limit and
wenzelm@9724
  3678
ProofContext.prems_limit; no longer prints theory contexts, but only
wenzelm@9724
  3679
proof states;
wenzelm@8487
  3680
wenzelm@10003
  3681
* Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
wenzelm@8518
  3682
additional print modes to be specified; e.g. "pr(latex)" will print
wenzelm@8518
  3683
proof state according to the Isabelle LaTeX style;
wenzelm@8487
  3684
wenzelm@10003
  3685
* Isar: improved support for emulating tactic scripts, including proof
wenzelm@9612
  3686
methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
wenzelm@9612
  3687
'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
wenzelm@9612
  3688
(for HOL datatypes);
wenzelm@8534
  3689
wenzelm@10003
  3690
* Isar: simplified (more robust) goal selection of proof methods: 1st
wenzelm@10003
  3691
goal, all goals, or explicit goal specifier (tactic emulation); thus
wenzelm@10003
  3692
'proof method scripts' have to be in depth-first order;
wenzelm@8673
  3693
wenzelm@10003
  3694
* Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
wenzelm@8729
  3695
wenzelm@10003
  3696
* Isar: removed 'help' command, which hasn't been too helpful anyway;
wenzelm@10003
  3697
should instead use individual commands for printing items
wenzelm@10003
  3698
(print_commands, print_methods etc.);
wenzelm@9224
  3699
wenzelm@10003
  3700
* Isar: added 'nothing' --- the empty list of theorems;
wenzelm@9239
  3701
wenzelm@8184
  3702
paulson@8014
  3703
*** HOL ***
paulson@8014
  3704
wenzelm@10080
  3705
* HOL/MicroJava: formalization of a fragment of Java, together with a
wenzelm@10080
  3706
corresponding virtual machine and a specification of its bytecode
wenzelm@10080
  3707
verifier and a lightweight bytecode verifier, including proofs of
wenzelm@10080
  3708
type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
wenzelm@10080
  3709
Cornelia Pusch (see also the homepage of project Bali at
wenzelm@10080
  3710
http://isabelle.in.tum.de/Bali/);
wenzelm@10080
  3711
wenzelm@8518
  3712
* HOL/Algebra: new theory of rings and univariate polynomials, by
wenzelm@8518
  3713
Clemens Ballarin;
paulson@8014
  3714
wenzelm@10157
  3715
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
wenzelm@10003
  3716
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
wenzelm@10003
  3717
Rasmussen;
wenzelm@8007
  3718
wenzelm@10157
  3719
* HOL/Lattice: fundamental concepts of lattice theory and order
wenzelm@10157
  3720
structures, including duals, properties of bounds versus algebraic
wenzelm@10157
  3721
laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
wenzelm@10157
  3722
Theorem for complete lattices etc.; may also serve as a demonstration
wenzelm@10157
  3723
for abstract algebraic reasoning using axiomatic type classes, and
wenzelm@10157
  3724
mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
wenzelm@10157
  3725
wenzelm@10003
  3726
* HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
wenzelm@10003
  3727
von Oheimb;
wenzelm@8570
  3728
wenzelm@10164
  3729
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm@10164
  3730
recursive procedures, by David von Oheimb;
wenzelm@10164
  3731
wenzelm@10003
  3732
* HOL/Lambda: converted into new-style theory and document;
paulson@9542
  3733
wenzelm@10003
  3734
* HOL/ex/Multiquote: example of multiple nested quotations and
wenzelm@10003
  3735
anti-quotations -- basically a generalized version of de-Bruijn
wenzelm@10003
  3736
representation; very useful in avoiding lifting of operations;
wenzelm@8848
  3737
wenzelm@9612
  3738
* HOL/record: added general record equality rule to simpset; fixed
wenzelm@9612
  3739
select-update simplification procedure to handle extended records as
wenzelm@9612
  3740
well; admit "r" as field name;
paulson@9542
  3741
paulson@8967
  3742
* HOL: 0 is now overloaded over the new sort "zero", allowing its use with
paulson@8967
  3743
other numeric types and also as the identity of groups, rings, etc.;
paulson@8967
  3744
paulson@8967
  3745
* HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
paulson@8967
  3746
Types nat and int belong to this axclass;
paulson@8967
  3747
wenzelm@10003
  3748
* HOL: greatly improved simplification involving numerals of type nat, int, real:
paulson@8788
  3749
   (i + #8 + j) = Suc k simplifies to  #7 + (i + j) = k
paulson@8832
  3750
   i*j + k + j*#3*i     simplifies to  #4*(i*j) + k
paulson@8832
  3751
  two terms #m*u and #n*u are replaced by #(m+n)*u
paulson@8832
  3752
    (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
paulson@8832
  3753
  and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
paulson@8832
  3754
    or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
paulson@8736
  3755
wenzelm@10003
  3756
* HOL: meson_tac is available (previously in ex/meson.ML); it is a
wenzelm@10003
  3757
powerful prover for predicate logic but knows nothing of clasets; see
wenzelm@10003
  3758
ex/mesontest.ML and ex/mesontest2.ML for example applications;
paulson@9835
  3759
wenzelm@8848
  3760
* HOL: new version of "case_tac" subsumes both boolean case split and
wenzelm@8440
  3761
"exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
wenzelm@8518
  3762
exists, may define val exhaust_tac = case_tac for ad-hoc portability;
wenzelm@8440
  3763
wenzelm@8848
  3764
* HOL: simplification no longer dives into case-expressions: only the
wenzelm@10129
  3765
selector expression is simplified, but not the remaining arms; to
wenzelm@10129
  3766
enable full simplification of case-expressions for datatype t, you may
wenzelm@10129
  3767
remove t.weak_case_cong from the simpset, either globally (Delcongs
wenzelm@10129
  3768
[thm"t.weak_case_cong"];) or locally (delcongs [...]).
nipkow@8603
  3769
wenzelm@8848
  3770
* HOL/recdef: the recursion equations generated by 'recdef' for
wenzelm@8848
  3771
function 'f' are now called f.simps instead of f.rules; if all
wenzelm@8848
  3772
termination conditions are proved automatically, these simplification
wenzelm@8848
  3773
rules are added to the simpset, as in primrec; rules may be named
wenzelm@8848
  3774
individually as well, resulting in a separate list of theorems for
wenzelm@8848
  3775
each equation;
wenzelm@8848
  3776
wenzelm@9489
  3777
* HOL/While is a new theory that provides a while-combinator. It
wenzelm@9489
  3778
permits the definition of tail-recursive functions without the
wenzelm@9489
  3779
provision of a termination measure. The latter is necessary once the
wenzelm@9489
  3780
invariant proof rule for while is applied.
nipkow@9457
  3781
wenzelm@10003
  3782
* HOL: new (overloaded) notation for the set of elements below/above
wenzelm@10003
  3783
some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
nipkow@8925
  3784
wenzelm@8848
  3785
* HOL: theorems impI, allI, ballI bound as "strip";
wenzelm@8848
  3786
wenzelm@10003
  3787
* HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
nipkow@9746
  3788
induct_tac th "x1 ... xn" expects th to have a conclusion of the form
nipkow@9746
  3789
P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
nipkow@9746
  3790
wenzelm@10003
  3791
* HOL/Real: "rabs" replaced by overloaded "abs" function;
nipkow@9737
  3792
wenzelm@10003
  3793
* HOL: theory Sexp now in HOL/Induct examples (it used to be part of
wenzelm@10003
  3794
main HOL, but was unused);
nipkow@8626
  3795
wenzelm@10003
  3796
* HOL: fewer consts declared as global (e.g. have to refer to
wenzelm@10003
  3797
"Lfp.lfp" instead of "lfp" internally; affects ML packages only);
wenzelm@8887
  3798
wenzelm@10003
  3799
* HOL: tuned AST representation of nested pairs, avoiding bogus output
wenzelm@10003
  3800
in case of overlap with user translations (e.g. judgements over
wenzelm@10003
  3801
tuples); (note that the underlying logical represenation is still
wenzelm@10003
  3802
bogus);
wenzelm@9349
  3803
nipkow@8412
  3804
paulson@9542
  3805
*** ZF ***
paulson@9542
  3806
wenzelm@10003
  3807
* ZF: simplification automatically cancels common terms in arithmetic
wenzelm@10003
  3808
expressions over nat and int;
paulson@9542
  3809
wenzelm@10003
  3810
* ZF: new treatment of nat to minimize type-checking: all operators
wenzelm@10003
  3811
coerce their operands to a natural number using the function natify,
wenzelm@10003
  3812
making the algebraic laws unconditional;
paulson@9542
  3813
wenzelm@10003
  3814
* ZF: as above, for int: operators coerce their operands to an integer
wenzelm@10003
  3815
using the function intify;
paulson@9542
  3816
wenzelm@10003
  3817
* ZF: the integer library now contains many of the usual laws for the
wenzelm@10003
  3818
orderings, including $<=, and monotonicity laws for $+ and $*;
paulson@9542
  3819
wenzelm@10003
  3820
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
wenzelm@10003
  3821
simplification;
paulson@9542
  3822
wenzelm@10003
  3823
* FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
wenzelm@10003
  3824
to the simplifier and classical reasoner simultaneously;
paulson@9388
  3825
paulson@9388
  3826
wenzelm@8358
  3827
*** General ***
wenzelm@8358
  3828
wenzelm@10003
  3829
* Provers: blast_tac now handles actual object-logic rules as
wenzelm@10003
  3830
assumptions; note that auto_tac uses blast_tac internally as well;
wenzelm@10003
  3831
wenzelm@10003
  3832
* Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
wenzelm@10003
  3833
outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
wenzelm@10003
  3834
wenzelm@9941
  3835
* Provers: delrules now handles destruct rules as well (no longer need
wenzelm@9941
  3836
explicit make_elim);
wenzelm@9941
  3837
wenzelm@10003
  3838
* Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
wenzelm@10003
  3839
  [| inj ?f;          ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
wenzelm@10003
  3840
use instead the strong form,
wenzelm@10003
  3841
  [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
wenzelm@10003
  3842
in HOL, FOL and ZF the function cla_make_elim will create such rules
wenzelm@10003
  3843
from destruct-rules;
wenzelm@9489
  3844
wenzelm@9709
  3845
* Provers: Simplifier.easy_setup provides a fast path to basic
wenzelm@9709
  3846
Simplifier setup for new object-logics;
wenzelm@9349
  3847
wenzelm@9709
  3848
* Pure: AST translation rules no longer require constant head on LHS;
wenzelm@8729
  3849
wenzelm@9709
  3850
* Pure: improved name spaces: ambiguous output is qualified; support
wenzelm@9709
  3851
for hiding of names;
wenzelm@8358
  3852
wenzelm@10003
  3853
* system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
wenzelm@10003
  3854
XSYMBOL_HOME; no longer need to do manual configuration in most
wenzelm@10003
  3855
situations;
wenzelm@10003
  3856
wenzelm@9709
  3857
* system: compression of ML heaps images may now be controlled via -c
wenzelm@9709
  3858
option of isabelle and isatool usedir (currently only observed by
wenzelm@9709
  3859
Poly/ML);
wenzelm@9709
  3860
wenzelm@9981
  3861
* system: isatool installfonts may handle X-Symbol fonts as well (very
wenzelm@9981
  3862
useful for remote X11);
wenzelm@9981
  3863
wenzelm@9709
  3864
* system: provide TAGS file for Isabelle sources;
wenzelm@9052
  3865
wenzelm@9288
  3866
* ML: infix 'OF' is a version of 'MRS' with more appropriate argument
wenzelm@9288
  3867
order;
wenzelm@9288
  3868
wenzelm@8994
  3869
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
wenzelm@8994
  3870
timing flag supersedes proof_timing and Toplevel.trace;
wenzelm@8994
  3871
wenzelm@10003
  3872
* ML: new combinators |>> and |>>> for incremental transformations
wenzelm@10003
  3873
with secondary results (e.g. certain theory extensions):
wenzelm@10003
  3874
wenzelm@9330
  3875
* ML: PureThy.add_defs gets additional argument to indicate potential
wenzelm@9330
  3876
overloading (usually false);
wenzelm@9330
  3877
wenzelm@10003
  3878
* ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
wenzelm@10003
  3879
results;
wenzelm@8440
  3880
wenzelm@8358
  3881
wenzelm@8015
  3882
wenzelm@7986
  3883
New in Isabelle99 (October 1999)
wenzelm@7986
  3884
--------------------------------
oheimb@4649
  3885
paulson@5931
  3886
*** Overview of INCOMPATIBILITIES (see below for more details) ***
paulson@5931
  3887
paulson@6922
  3888
* HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
paulson@6922
  3889
are no longer simplified.  (This allows the simplifier to unfold recursive
paulson@6922
  3890
functional programs.)  To restore the old behaviour, declare
wenzelm@7215
  3891
wenzelm@7215
  3892
    Delcongs [if_weak_cong];
paulson@6922
  3893
wenzelm@6269
  3894
* HOL: Removed the obsolete syntax "Compl A"; use -A for set
wenzelm@6269
  3895
complement;
paulson@5931
  3896
wenzelm@6269
  3897
* HOL: the predicate "inj" is now defined by translation to "inj_on";
paulson@6174
  3898
berghofe@7847
  3899
* HOL/datatype: mutual_induct_tac no longer exists --
berghofe@7847
  3900
  use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
berghofe@7847
  3901
wenzelm@6386
  3902
* HOL/typedef: fixed type inference for representing set; type
wenzelm@6386
  3903
arguments now have to occur explicitly on the rhs as type constraints;
wenzelm@6386
  3904
wenzelm@6269
  3905
* ZF: The con_defs part of an inductive definition may no longer refer
wenzelm@6269
  3906
to constants declared in the same theory;
nipkow@6057
  3907
wenzelm@6269
  3908
* HOL, ZF: the function mk_cases, generated by the inductive
wenzelm@6269
  3909
definition package, has lost an argument.  To simplify its result, it
wenzelm@6269
  3910
uses the default simpset instead of a supplied list of theorems.
paulson@6141
  3911
wenzelm@7215
  3912
* HOL/List: the constructors of type list are now Nil and Cons;
wenzelm@7215
  3913
nipkow@7619
  3914
* Simplifier: the type of the infix ML functions
wenzelm@8729
  3915
        setSSolver addSSolver setSolver addSolver
nipkow@7619
  3916
is now  simpset * solver -> simpset  where `solver' is a new abstract type
nipkow@7619
  3917
for packaging solvers. A solver is created via
wenzelm@8729
  3918
        mk_solver: string -> (thm list -> int -> tactic) -> solver
nipkow@7619
  3919
where the string argument is only a comment.
nipkow@6057
  3920
wenzelm@7647
  3921
paulson@6069
  3922
*** Proof tools ***
paulson@6069
  3923
wenzelm@6343
  3924
* Provers/Arith/fast_lin_arith.ML contains a functor for creating a
wenzelm@6343
  3925
decision procedure for linear arithmetic. Currently it is used for
wenzelm@7593
  3926
types `nat', `int', and `real' in HOL (see below); it can, should and
wenzelm@7593
  3927
will be instantiated for other types and logics as well.
paulson@6069
  3928
nipkow@7324
  3929
* The simplifier now accepts rewrite rules with flexible heads, eg
nipkow@7324
  3930
     hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
nipkow@7324
  3931
  They are applied like any rule with a non-pattern lhs, i.e. by first-order
nipkow@7324
  3932
  matching.
paulson@6069
  3933
wenzelm@7593
  3934
paulson@6014
  3935
*** General ***
paulson@6014
  3936
wenzelm@7986
  3937
* New Isabelle/Isar subsystem provides an alternative to traditional
wenzelm@7215
  3938
tactical theorem proving; together with the ProofGeneral/isar user
wenzelm@7215
  3939
interface it offers an interactive environment for developing human
wenzelm@7215
  3940
readable proof documents (Isar == Intelligible semi-automated
wenzelm@7886
  3941
reasoning); for further information see isatool doc isar-ref,
wenzelm@7986
  3942
src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
wenzelm@7886
  3943
wenzelm@9612
  3944
* improved and simplified presentation of theories: better HTML markup
wenzelm@9612
  3945
(including colors), graph views in several sizes; isatool usedir now
wenzelm@9612
  3946
provides a proper interface for user theories (via -P option); actual
wenzelm@9612
  3947
document preparation based on (PDF)LaTeX is available as well (for
wenzelm@9612
  3948
new-style theories only); see isatool doc system for more information;
wenzelm@7215
  3949
wenzelm@7252
  3950
* native support for Proof General, both for classic Isabelle and
wenzelm@7986
  3951
Isabelle/Isar;
wenzelm@7215
  3952
wenzelm@7791
  3953
* ML function thm_deps visualizes dependencies of theorems and lemmas,
wenzelm@7791
  3954
using the graph browser tool;
wenzelm@7791
  3955
wenzelm@6751
  3956
* Isabelle manuals now also available as PDF;
wenzelm@6751
  3957
wenzelm@6449
  3958
* theory loader rewritten from scratch (may not be fully
wenzelm@6449
  3959
bug-compatible); old loadpath variable has been replaced by show_path,
wenzelm@6671
  3960
add_path, del_path, reset_path functions; new operations such as
wenzelm@7593
  3961
update_thy, touch_thy, remove_thy, use/update_thy_only (see also
wenzelm@7593
  3962
isatool doc ref);
wenzelm@6449
  3963
wenzelm@7215
  3964
* improved isatool install: option -k creates KDE application icon,
wenzelm@7215
  3965
option -p DIR installs standalone binaries;
wenzelm@7215
  3966
wenzelm@7215
  3967
* added ML_PLATFORM setting (useful for cross-platform installations);
wenzelm@7215
  3968
more robust handling of platform specific ML images for SML/NJ;
wenzelm@7215
  3969
wenzelm@7886
  3970
* the settings environment is now statically scoped, i.e. it is never
wenzelm@7986
  3971
created again in sub-processes invoked from isabelle, isatool, or
wenzelm@7886
  3972
Isabelle;
wenzelm@7886
  3973
wenzelm@7215
  3974
* path element specification '~~' refers to '$ISABELLE_HOME';
wenzelm@7215
  3975
wenzelm@6343
  3976
* in locales, the "assumes" and "defines" parts may be omitted if
wenzelm@6343
  3977
empty;
wenzelm@5973
  3978
wenzelm@6269
  3979
* new print_mode "xsymbols" for extended symbol support (e.g. genuine
wenzelm@6269
  3980
long arrows);
wenzelm@6259
  3981
wenzelm@6343
  3982
* new print_mode "HTML";
wenzelm@6343
  3983
wenzelm@6343
  3984
* new flag show_tags controls display of tags of theorems (which are
wenzelm@6343
  3985
basically just comments that may be attached by some tools);
wenzelm@6343
  3986
wenzelm@6461
  3987
* Isamode 2.6 requires patch to accomodate change of Isabelle font
wenzelm@6461
  3988
mode and goal output format:
wenzelm@6461
  3989
wenzelm@6461
  3990
diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
wenzelm@6461
  3991
244c244
wenzelm@6461
  3992
<       (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
wenzelm@6461
  3993
---
wenzelm@6533
  3994
>       (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
wenzelm@6461
  3995
diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
wenzelm@6461
  3996
181c181
wenzelm@6461
  3997
< (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
wenzelm@6461
  3998
---
wenzelm@6461
  3999
> (defconst proofstate-proofstart-regexp "^Level [0-9]+"
wenzelm@6461
  4000
wenzelm@7450
  4001
* function bind_thms stores lists of theorems (cf. bind_thm);
wenzelm@7450
  4002
wenzelm@7593
  4003
* new shorthand tactics ftac, eatac, datac, fatac;
wenzelm@7593
  4004
wenzelm@7593
  4005
* qed (and friends) now accept "" as result name; in that case the
wenzelm@7986
  4006
theorem is not stored, but proper checks and presentation of the
wenzelm@7986
  4007
result still apply;
wenzelm@7593
  4008
wenzelm@7805
  4009
* theorem database now also indexes constants "Trueprop", "all",
wenzelm@7805
  4010
"==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
wenzelm@7805
  4011
oheimb@6028
  4012
nipkow@6057
  4013
*** HOL ***
nipkow@6057
  4014
wenzelm@7215
  4015
** HOL arithmetic **
wenzelm@7215
  4016
wenzelm@6343
  4017
* There are now decision procedures for linear arithmetic over nat and
wenzelm@6343
  4018
int:
nipkow@6131
  4019
wenzelm@6343
  4020
1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
wenzelm@6343
  4021
`+', `-', `Suc', `min', `max' and numerical constants; other subterms
wenzelm@6343
  4022
are treated as atomic; subformulae not involving type `nat' or `int'
wenzelm@6343
  4023
are ignored; quantified subformulae are ignored unless they are
wenzelm@6343
  4024
positive universal or negative existential. The tactic has to be
wenzelm@6343
  4025
invoked by hand and can be a little bit slow. In particular, the
wenzelm@6343
  4026
running time is exponential in the number of occurrences of `min' and
wenzelm@6343
  4027
`max', and `-' on `nat'.
nipkow@6131
  4028
wenzelm@6343
  4029
2. fast_arith_tac is a cut-down version of arith_tac: it only takes
wenzelm@6343
  4030
(negated) (in)equalities among the premises and the conclusion into
wenzelm@6343
  4031
account (i.e. no compound formulae) and does not know about `min' and
wenzelm@6343
  4032
`max', and `-' on `nat'. It is fast and is used automatically by the
wenzelm@6343
  4033
simplifier.
nipkow@6131
  4034
wenzelm@6343
  4035
NB: At the moment, these decision procedures do not cope with mixed
wenzelm@6343
  4036
nat/int formulae where the two parts interact, such as `m < n ==>
wenzelm@6343
  4037
int(m) < int(n)'.
oheimb@6028
  4038
wenzelm@7215
  4039
* HOL/Numeral provides a generic theory of numerals (encoded
wenzelm@7313
  4040
efficiently as bit strings); setup for types nat/int/real is in place;
wenzelm@7215
  4041
INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
wenzelm@7215
  4042
int, existing theories and proof scripts may require a few additional
wenzelm@7215
  4043
type constraints;
paulson@7157
  4044
wenzelm@7215
  4045
* integer division and remainder can now be performed on constant
wenzelm@7215
  4046
arguments;
paulson@6922
  4047
wenzelm@7215
  4048
* many properties of integer multiplication, division and remainder
wenzelm@7215
  4049
are now available;
wenzelm@7215
  4050
paulson@7287
  4051
* An interface to the Stanford Validity Checker (SVC) is available through the
paulson@7287
  4052
tactic svc_tac.  Propositional tautologies and theorems of linear arithmetic
paulson@7287
  4053
are proved automatically.  SVC must be installed separately, and its results
paulson@7287
  4054
must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
paulson@7287
  4055
invocation of the underlying oracle).  For SVC see
paulson@7444
  4056
  http://verify.stanford.edu/SVC
paulson@6922
  4057
wenzelm@7125
  4058
* IsaMakefile: the HOL-Real target now builds an actual image;
wenzelm@7125
  4059
wenzelm@7215
  4060
wenzelm@7215
  4061
** HOL misc **
wenzelm@7215
  4062
wenzelm@7595
  4063
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
wenzelm@7595
  4064
(in Isabelle/Isar) -- by Gertrud Bauer;
wenzelm@7595
  4065
wenzelm@7691
  4066
* HOL/BCV: generic model of bytecode verification, i.e. data-flow
wenzelm@7691
  4067
analysis for assembly languages with subtypes;
wenzelm@7691
  4068
wenzelm@6278
  4069
* HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
wenzelm@6278
  4070
-- avoids syntactic ambiguities and treats state, transition, and
wenzelm@6278
  4071
temporal levels more uniformly; introduces INCOMPATIBILITIES due to
wenzelm@6278
  4072
changed syntax and (many) tactics;
wenzelm@6278
  4073
wenzelm@7791
  4074
* HOL/inductive: Now also handles more general introduction rules such
wenzelm@7791
  4075
  as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
wenzelm@7791
  4076
  theorems are now maintained within the theory (maintained via the
wenzelm@7791
  4077
  "mono" attribute);
berghofe@7780
  4078
wenzelm@7238
  4079
* HOL/datatype: Now also handles arbitrarily branching datatypes
wenzelm@7238
  4080
  (using function types) such as
wenzelm@7238
  4081
wenzelm@7238
  4082
  datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
berghofe@7047
  4083
wenzelm@7326
  4084
* HOL/record: record_simproc (part of the default simpset) takes care
wenzelm@7326
  4085
of selectors applied to updated records; record_split_tac is no longer
wenzelm@7327
  4086
part of the default claset; update_defs may now be removed from the
wenzelm@7327
  4087
simpset in many cases; COMPATIBILITY: old behavior achieved by
wenzelm@7326
  4088
wenzelm@7326
  4089
  claset_ref () := claset() addSWrapper record_split_wrapper;
wenzelm@7326
  4090
  Delsimprocs [record_simproc]
wenzelm@7326
  4091
wenzelm@6386
  4092
* HOL/typedef: fixed type inference for representing set; type
wenzelm@6386
  4093
arguments now have to occur explicitly on the rhs as type constraints;
wenzelm@6386
  4094
paulson@7287
  4095
* HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
paulson@7287
  4096
names rather than an ML expression;
paulson@7287
  4097
paulson@7287
  4098
* HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
paulson@7287
  4099
supplied later.  Program schemes can be defined, such as
paulson@7287
  4100
    "While B C s = (if B s then While B C (C s) else s)"
paulson@7287
  4101
where the well-founded relation can be chosen after B and C have been given.
wenzelm@6563
  4102
wenzelm@7215
  4103
* HOL/List: the constructors of type list are now Nil and Cons;
wenzelm@7215
  4104
INCOMPATIBILITY: while [] and infix # syntax is still there, of
wenzelm@7215
  4105
course, ML tools referring to List.list.op # etc. have to be adapted;
wenzelm@7215
  4106
wenzelm@7238
  4107
* HOL_quantifiers flag superseded by "HOL" print mode, which is
wenzelm@7238
  4108
disabled by default; run isabelle with option -m HOL to get back to
wenzelm@7238
  4109
the original Gordon/HOL-style output;
wenzelm@7238
  4110
wenzelm@7238
  4111
* HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
wenzelm@7238
  4112
ALL x<=y. P, EX x<y. P, EX x<=y. P;
wenzelm@7238
  4113
wenzelm@7238
  4114
* HOL basic syntax simplified (more orthogonal): all variants of
wenzelm@7238
  4115
All/Ex now support plain / symbolic / HOL notation; plain syntax for
wenzelm@7238
  4116
Eps operator is provided as well: "SOME x. P[x]";
wenzelm@7238
  4117
berghofe@7320
  4118
* HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
wenzelm@7261
  4119
wenzelm@7280
  4120
* HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
wenzelm@7280
  4121
thus available for user theories;
wenzelm@7280
  4122
wenzelm@7300
  4123
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
wenzelm@7300
  4124
HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
wenzelm@7300
  4125
time;
wenzelm@7300
  4126
wenzelm@7986
  4127
* HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
wenzelm@7986
  4128
several times and then mp;
oheimb@7492
  4129
wenzelm@7215
  4130
paulson@7113
  4131
*** LK ***
paulson@7113
  4132
wenzelm@7215
  4133
* the notation <<...>> is now available as a notation for sequences of
wenzelm@7215
  4134
formulas;
paulson@7113
  4135
paulson@7113
  4136
* the simplifier is now installed
paulson@7113
  4137
wenzelm@8729
  4138
* the axiom system has been generalized (thanks to Soren Heilmann)
paulson@7113
  4139
paulson@7113
  4140
* the classical reasoner now has a default rule database
paulson@7113
  4141
paulson@7113
  4142
paulson@6064
  4143
*** ZF ***
paulson@6064
  4144
paulson@6064
  4145
* new primrec section allows primitive recursive functions to be given
wenzelm@6269
  4146
directly (as in HOL) over datatypes and the natural numbers;
paulson@6064
  4147
wenzelm@6269
  4148
* new tactics induct_tac and exhaust_tac for induction (or case
wenzelm@6269
  4149
analysis) over datatypes and the natural numbers;
paulson@6064
  4150
paulson@6064
  4151
* the datatype declaration of type T now defines the recursor T_rec;
paulson@6064
  4152
paulson@6141
  4153
* simplification automatically does freeness reasoning for datatype
wenzelm@6269
  4154
constructors;
paulson@6141
  4155
wenzelm@6269
  4156
* automatic type-inference, with AddTCs command to insert new
wenzelm@6269
  4157
type-checking rules;
paulson@6155
  4158
wenzelm@6269
  4159
* datatype introduction rules are now added as Safe Introduction rules
wenzelm@6269
  4160
to the claset;
paulson@6155
  4161
wenzelm@6269
  4162
* the syntax "if P then x else y" is now available in addition to
wenzelm@6269
  4163
if(P,x,y);
wenzelm@6269
  4164
paulson@6069
  4165
wenzelm@6343
  4166
*** Internal programming interfaces ***
wenzelm@6343
  4167
wenzelm@7919
  4168
* tuned simplifier trace output; new flag debug_simp;
wenzelm@7919
  4169
wenzelm@7420
  4170
* structures Vartab / Termtab (instances of TableFun) offer efficient
wenzelm@7420
  4171
tables indexed by indexname_ord / term_ord (compatible with aconv);
wenzelm@7420
  4172
wenzelm@6386
  4173
* AxClass.axclass_tac lost the theory argument;
wenzelm@6386
  4174
wenzelm@6343
  4175
* tuned current_goals_markers semantics: begin / end goal avoids
wenzelm@6343
  4176
printing empty lines;
wenzelm@6343
  4177
wenzelm@6343
  4178
* removed prs and prs_fn hook, which was broken because it did not
wenzelm@6343
  4179
include \n in its semantics, forcing writeln to add one
wenzelm@6343
  4180
uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
wenzelm@6343
  4181
string -> unit if you really want to output text without newline;
wenzelm@6343
  4182
wenzelm@6343
  4183
* Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
wenzelm@6343
  4184
plain output, interface builders may have to enable 'isabelle_font'
wenzelm@6343
  4185
mode to get Isabelle font glyphs as before;
wenzelm@6343
  4186
wenzelm@6343
  4187
* refined token_translation interface; INCOMPATIBILITY: output length
wenzelm@6343
  4188
now of type real instead of int;
wenzelm@6343
  4189
wenzelm@7196
  4190
* theory loader actions may be traced via new ThyInfo.add_hook
wenzelm@7196
  4191
interface (see src/Pure/Thy/thy_info.ML); example application: keep
wenzelm@7196
  4192
your own database of information attached to *whole* theories -- as
wenzelm@7196
  4193
opposed to intra-theory data slots offered via TheoryDataFun;
wenzelm@7196
  4194
wenzelm@7647
  4195
* proper handling of dangling sort hypotheses (at last!);
wenzelm@7647
  4196
Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
wenzelm@7647
  4197
extra sort hypotheses that can be witnessed from the type signature;
wenzelm@7986
  4198
the force_strip_shyps flag is gone, any remaining shyps are simply
wenzelm@7986
  4199
left in the theorem (with a warning issued by strip_shyps_warning);
wenzelm@7647
  4200
wenzelm@6343
  4201
paulson@6064
  4202
wenzelm@5781
  4203
New in Isabelle98-1 (October 1998)
wenzelm@5781
  4204
----------------------------------
wenzelm@5781
  4205
wenzelm@5127
  4206
*** Overview of INCOMPATIBILITIES (see below for more details) ***
wenzelm@4842
  4207
wenzelm@5726
  4208
* several changes of automated proof tools;
wenzelm@5207
  4209
wenzelm@5726
  4210
* HOL: major changes to the inductive and datatype packages, including
wenzelm@5726
  4211
some minor incompatibilities of theory syntax;
wenzelm@5373
  4212
wenzelm@5726
  4213
* HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
wenzelm@5217
  4214
called `inj_on';
paulson@5160
  4215
nipkow@5275
  4216
* HOL: removed duplicate thms in Arith:
nipkow@5275
  4217
  less_imp_add_less  should be replaced by  trans_less_add1
nipkow@5275
  4218
  le_imp_add_le      should be replaced by  trans_le_add1
paulson@5160
  4219
wenzelm@5726
  4220
* HOL: unary minus is now overloaded (new type constraints may be
wenzelm@5726
  4221
required);
paulson@5490
  4222
wenzelm@5726
  4223
* HOL and ZF: unary minus for integers is now #- instead of #~.  In
wenzelm@5726
  4224
ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
wenzelm@5726
  4225
now taken as an integer constant.
paulson@5541
  4226
wenzelm@5726
  4227
* Pure: ML function 'theory_of' renamed to 'theory';
wenzelm@5397
  4228
wenzelm@5363
  4229
wenzelm@5127
  4230
*** Proof tools ***
nipkow@4880
  4231
nipkow@5657
  4232
* Simplifier:
nipkow@5657
  4233
  1. Asm_full_simp_tac is now more aggressive.
nipkow@5657
  4234
     1. It will sometimes reorient premises if that increases their power to
nipkow@5657
  4235
        simplify.
nipkow@5657
  4236
     2. It does no longer proceed strictly from left to right but may also
nipkow@5657
  4237
        rotate premises to achieve further simplification.
nipkow@5657
  4238
     For compatibility reasons there is now Asm_lr_simp_tac which is like the
nipkow@5657
  4239
     old Asm_full_simp_tac in that it does not rotate premises.
nipkow@5657
  4240
  2. The simplifier now knows a little bit about nat-arithmetic.
nipkow@4880
  4241
wenzelm@5127
  4242
* Classical reasoner: wrapper mechanism for the classical reasoner now
wenzelm@5127
  4243
allows for selected deletion of wrappers, by introduction of names for
wenzelm@5127
  4244
wrapper functionals.  This implies that addbefore, addSbefore,
wenzelm@5127
  4245
addaltern, and addSaltern now take a pair (name, tactic) as argument,
wenzelm@5127
  4246
and that adding two tactics with the same name overwrites the first
wenzelm@5127
  4247
one (emitting a warning).
oheimb@4824
  4248
  type wrapper = (int -> tactic) -> (int -> tactic)
oheimb@4649
  4249
  setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
oheimb@4824
  4250
  addWrapper, addSWrapper: claset * (string * wrapper) -> claset
oheimb@4824
  4251
  delWrapper, delSWrapper: claset *  string            -> claset
oheimb@4649
  4252
  getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
oheimb@4649
  4253
wenzelm@5705
  4254
* Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
wenzelm@5726
  4255
semantics; addbefore now affects only the unsafe part of step_tac
wenzelm@5726
  4256
etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
wenzelm@5726
  4257
FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
wenzelm@5726
  4258
by Force_tac;
oheimb@5524
  4259
wenzelm@5726
  4260
* Classical reasoner: setwrapper to setWrapper and compwrapper to
wenzelm@5726
  4261
compWrapper; added safe wrapper (and access functions for it);
oheimb@5524
  4262
wenzelm@5127
  4263
* HOL/split_all_tac is now much faster and fails if there is nothing
wenzelm@5726
  4264
to split.  Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
wenzelm@5726
  4265
and the names of the automatically generated variables have changed.
wenzelm@5726
  4266
split_all_tac has moved within claset() from unsafe wrappers to safe
wenzelm@5726
  4267
wrappers, which means that !!-bound variables are split much more
wenzelm@5726
  4268
aggressively, and safe_tac and clarify_tac now split such variables.
wenzelm@5726
  4269
If this splitting is not appropriate, use delSWrapper "split_all_tac".
wenzelm@5726
  4270
Note: the same holds for record_split_tac, which does the job of
wenzelm@5726
  4271
split_all_tac for record fields.
wenzelm@5127
  4272
wenzelm@5726
  4273
* HOL/Simplifier: Rewrite rules for case distinctions can now be added
wenzelm@5726
  4274
permanently to the default simpset using Addsplits just like
wenzelm@5726
  4275
Addsimps. They can be removed via Delsplits just like
wenzelm@5726
  4276
Delsimps. Lower-case versions are also available.
wenzelm@5127
  4277
wenzelm@5726
  4278
* HOL/Simplifier: The rule split_if is now part of the default
wenzelm@5726
  4279
simpset. This means that the simplifier will eliminate all occurrences
wenzelm@5726
  4280
of if-then-else in the conclusion of a goal. To prevent this, you can
wenzelm@5726
  4281
either remove split_if completely from the default simpset by
wenzelm@5726
  4282
`Delsplits [split_if]' or remove it in a specific call of the
wenzelm@5726
  4283
simplifier using `... delsplits [split_if]'.  You can also add/delete
wenzelm@5726
  4284
other case splitting rules to/from the default simpset: every datatype
wenzelm@5726
  4285
generates suitable rules `split_t_case' and `split_t_case_asm' (where
wenzelm@5726
  4286
t is the name of the datatype).
wenzelm@5127
  4287
wenzelm@5726
  4288
* Classical reasoner / Simplifier combination: new force_tac (and
wenzelm@5127
  4289
derivatives Force_tac, force) combines rewriting and classical
wenzelm@5127
  4290
reasoning (and whatever other tools) similarly to auto_tac, but is
wenzelm@5726
  4291
aimed to solve the given subgoal completely.
wenzelm@5127
  4292
wenzelm@5127
  4293
wenzelm@5127
  4294
*** General ***
wenzelm@5127
  4295
wenzelm@5217
  4296
* new top-level commands `Goal' and `Goalw' that improve upon `goal'
wenzelm@5127
  4297
and `goalw': the theory is no longer needed as an explicit argument -
wenzelm@5127
  4298
the current theory context is used; assumptions are no longer returned
wenzelm@5127
  4299
at the ML-level unless one of them starts with ==> or !!; it is
wenzelm@5217
  4300
recommended to convert to these new commands using isatool fixgoal
wenzelm@5217
  4301
(backup your sources first!);
wenzelm@4842
  4302
wenzelm@5217
  4303
* new top-level commands 'thm' and 'thms' for retrieving theorems from
wenzelm@5207
  4304
the current theory context, and 'theory' to lookup stored theories;
paulson@4806
  4305
paulson@5722
  4306
* new theory section 'locale' for declaring constants, assumptions and
paulson@5722
  4307
definitions that have local scope;
paulson@5722
  4308
wenzelm@5127
  4309
* new theory section 'nonterminals' for purely syntactic types;
wenzelm@4858
  4310
wenzelm@5127
  4311
* new theory section 'setup' for generic ML setup functions
wenzelm@5127
  4312
(e.g. package initialization);
wenzelm@4869
  4313
wenzelm@5131
  4314
* the distribution now includes Isabelle icons: see
wenzelm@5131
  4315
lib/logo/isabelle-{small,tiny}.xpm;
wenzelm@5131
  4316
wenzelm@5363
  4317
* isatool install - install binaries with absolute references to
wenzelm@5363
  4318
ISABELLE_HOME/bin;
wenzelm@5363
  4319
wenzelm@5572
  4320
* isatool logo -- create instances of the Isabelle logo (as EPS);
wenzelm@5572
  4321
wenzelm@5407
  4322
* print mode 'emacs' reserved for Isamode;
wenzelm@5407
  4323
wenzelm@5726
  4324
* support multiple print (ast) translations per constant name;
wenzelm@5726
  4325
wenzelm@6925
  4326
* theorems involving oracles are now printed with a suffixed [!];
wenzelm@6925
  4327
wenzelm@4711
  4328
paulson@4661
  4329
*** HOL ***
paulson@4661
  4330
wenzelm@5710
  4331
* there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
nipkow@5709
  4332
wenzelm@5217
  4333
* HOL/inductive package reorganized and improved: now supports mutual
paulson@5267
  4334
definitions such as
berghofe@5214
  4335
wenzelm@5217
  4336
  inductive EVEN ODD
wenzelm@5217
  4337
    intrs
wenzelm@5217
  4338
      null "0 : EVEN"
wenzelm@5217
  4339
      oddI "n : EVEN ==> Suc n : ODD"
wenzelm@5217
  4340
      evenI "n : ODD ==> Suc n : EVEN"
berghofe@5214
  4341
wenzelm@5217
  4342
new theorem list "elims" contains an elimination rule for each of the
wenzelm@5217
  4343
recursive sets; inductive definitions now handle disjunctive premises
wenzelm@5217
  4344
correctly (also ZF);
berghofe@5214
  4345
wenzelm@5217
  4346
INCOMPATIBILITIES: requires Inductive as an ancestor; component
wenzelm@5217
  4347
"mutual_induct" no longer exists - the induction rule is always
wenzelm@5217
  4348
contained in "induct";
berghofe@5214
  4349
berghofe@5214
  4350
wenzelm@5217
  4351
* HOL/datatype package re-implemented and greatly improved: now
paulson@5267
  4352
supports mutually recursive datatypes such as
berghofe@5214
  4353
wenzelm@5217
  4354
  datatype
wenzelm@5217
  4355
    'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
wenzelm@5217
  4356
            | SUM ('a aexp) ('a aexp)
wenzelm@5217
  4357
            | DIFF ('a aexp) ('a aexp)
wenzelm@5217
  4358
            | NUM 'a
wenzelm@5217
  4359
  and
wenzelm@5217
  4360
    'a bexp = LESS ('a aexp) ('a aexp)
wenzelm@5217
  4361
            | AND ('a bexp) ('a bexp)
wenzelm@5217
  4362
            | OR ('a bexp) ('a bexp)
wenzelm@5217
  4363
paulson@5267
  4364
as well as indirectly recursive datatypes such as
wenzelm@5217
  4365
wenzelm@5217
  4366
  datatype
wenzelm@5217
  4367
    ('a, 'b) term = Var 'a
wenzelm@5217
  4368
                  | App 'b ((('a, 'b) term) list)
wenzelm@5217
  4369
wenzelm@5217
  4370
The new tactic  mutual_induct_tac [<var_1>, ..., <var_n>] i  performs
wenzelm@5217
  4371
induction on mutually / indirectly recursive datatypes.
wenzelm@5217
  4372
wenzelm@5217
  4373
Primrec equations are now stored in theory and can be accessed via
wenzelm@5217
  4374
<function_name>.simps.
wenzelm@5217
  4375
wenzelm@5217
  4376
INCOMPATIBILITIES:
wenzelm@5217
  4377
wenzelm@5217
  4378
  - Theories using datatypes must now have theory Datatype as an
wenzelm@5217
  4379
    ancestor.
wenzelm@5217
  4380
  - The specific <typename>.induct_tac no longer exists - use the
wenzelm@5217
  4381
    generic induct_tac instead.
berghofe@5226
  4382
  - natE has been renamed to nat.exhaust - use exhaust_tac
wenzelm@5217
  4383
    instead of res_inst_tac ... natE. Note that the variable
berghofe@5226
  4384
    names in nat.exhaust differ from the names in natE, this
wenzelm@5217
  4385
    may cause some "fragile" proofs to fail.
wenzelm@5217
  4386
  - The theorems split_<typename>_case and split_<typename>_case_asm
wenzelm@5217
  4387
    have been renamed to <typename>.split and <typename>.split_asm.
wenzelm@5217
  4388
  - Since default sorts of type variables are now handled correctly,
wenzelm@5217
  4389
    some datatype definitions may have to be annotated with explicit
wenzelm@5217
  4390
    sort constraints.
wenzelm@5217
  4391
  - Primrec definitions no longer require function name and type
wenzelm@5217
  4392
    of recursive argument.
wenzelm@5217
  4393
wenzelm@5217
  4394
Consider using isatool fixdatatype to adapt your theories and proof
wenzelm@5217
  4395
scripts to the new package (backup your sources first!).
wenzelm@5217
  4396
wenzelm@5217
  4397
wenzelm@5726
  4398
* HOL/record package: considerably improved implementation; now
wenzelm@5726
  4399
includes concrete syntax for record types, terms, updates; theorems
wenzelm@5726
  4400
for surjective pairing and splitting !!-bound record variables; proof
wenzelm@5726
  4401
support is as follows:
wenzelm@5726
  4402
wenzelm@5726
  4403
  1) standard conversions (selectors or updates applied to record
wenzelm@5726
  4404
constructor terms) are part of the standard simpset;
wenzelm@5726
  4405
wenzelm@5726
  4406
  2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
wenzelm@5726
  4407
made part of standard simpset and claset via addIffs;
wenzelm@5726
  4408
wenzelm@5726
  4409
  3) a tactic for record field splitting (record_split_tac) is part of
wenzelm@5726
  4410
the standard claset (addSWrapper);
wenzelm@5726
  4411
wenzelm@5726
  4412
To get a better idea about these rules you may retrieve them via
wenzelm@5726
  4413
something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
wenzelm@5726
  4414
the name of your record type.
wenzelm@5726
  4415
wenzelm@5726
  4416
The split tactic 3) conceptually simplifies by the following rule:
wenzelm@5726
  4417
wenzelm@5726
  4418
  "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
wenzelm@5726
  4419
wenzelm@5726
  4420
Thus any record variable that is bound by meta-all will automatically
wenzelm@5726
  4421
blow up into some record constructor term, consequently the
wenzelm@5726
  4422
simplifications of 1), 2) apply.  Thus force_tac, auto_tac etc. shall
wenzelm@5726
  4423
solve record problems automatically.
wenzelm@5726
  4424
berghofe@5214
  4425
wenzelm@5125
  4426
* reorganized the main HOL image: HOL/Integ and String loaded by
wenzelm@5125
  4427
default; theory Main includes everything;
wenzelm@5125
  4428
paulson@5650
  4429
* automatic simplification of integer sums and comparisons, using cancellation;
paulson@5650
  4430
oheimb@5526
  4431
* added option_map_eq_Some and not_Some_eq to the default simpset and claset;
wenzelm@5125
  4432
wenzelm@5127
  4433
* added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
wenzelm@5125
  4434
wenzelm@5127
  4435
* many new identities for unions, intersections, set difference, etc.;
wenzelm@5127
  4436
wenzelm@5127
  4437
* expand_if, expand_split, expand_sum_case and expand_nat_case are now
wenzelm@5127
  4438
called split_if, split_split, split_sum_case and split_nat_case (to go
wenzelm@5127
  4439
with add/delsplits);
wenzelm@5127
  4440
wenzelm@5127
  4441
* HOL/Prod introduces simplification procedure unit_eq_proc rewriting
wenzelm@5127
  4442
(?x::unit) = (); this is made part of the default simpset, which COULD
wenzelm@5127
  4443
MAKE EXISTING PROOFS FAIL under rare circumstances (consider
wenzelm@5207
  4444
'Delsimprocs [unit_eq_proc];' as last resort); also note that
wenzelm@5207
  4445
unit_abs_eta_conv is added in order to counter the effect of
wenzelm@5207
  4446
unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
wenzelm@5207
  4447
%u.f();
wenzelm@5127
  4448
wenzelm@5217
  4449
* HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
wenzelm@5217
  4450
makes more sense);
wenzelm@5127
  4451
paulson@5475
  4452
* HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
paulson@5475
  4453
  It and 'sym RS equals0D' are now in the default  claset, giving automatic
paulson@5475
  4454
  disjointness reasoning but breaking a few old proofs.
paulson@5267
  4455
wenzelm@5217
  4456
* HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
wenzelm@5217
  4457
to 'converse' from 'inverse' (for compatibility with ZF and some
wenzelm@5217
  4458
literature);
berghofe@5109
  4459
wenzelm@5127
  4460
* HOL/recdef can now declare non-recursive functions, with {} supplied as
wenzelm@5127
  4461
the well-founded relation;
wenzelm@5085
  4462
paulson@5490
  4463
* HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
paulson@5490
  4464
    Compl A.  The "Compl" syntax remains available as input syntax for this
paulson@5490
  4465
    release ONLY.
paulson@5490
  4466
wenzelm@5127
  4467
* HOL/Update: new theory of function updates:
wenzelm@5127
  4468
    f(a:=b) == %x. if x=a then b else f x
wenzelm@5127
  4469
may also be iterated as in f(a:=b,c:=d,...);
oheimb@4824
  4470
wenzelm@5127
  4471
* HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
paulson@4899
  4472
nipkow@5282
  4473
* HOL/List:
nipkow@5282
  4474
  - new function list_update written xs[i:=v] that updates the i-th
nipkow@5282
  4475
    list position. May also be iterated as in xs[i:=a,j:=b,...].
nipkow@5428
  4476
  - new function `upt' written [i..j(] which generates the list
nipkow@5428
  4477
    [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
nipkow@5428
  4478
    bound write [i..j], which is a shorthand for [i..j+1(].
nipkow@5282
  4479
  - new lexicographic orderings and corresponding wellfoundedness theorems.
paulson@4779
  4480
wenzelm@5127
  4481
* HOL/Arith:
wenzelm@5127
  4482
  - removed 'pred' (predecessor) function;
wenzelm@5127
  4483
  - generalized some theorems about n-1;
wenzelm@5127
  4484
  - many new laws about "div" and "mod";
wenzelm@5127
  4485
  - new laws about greatest common divisors (see theory ex/Primes);
oheimb@4766
  4486
wenzelm@5127
  4487
* HOL/Relation: renamed the relational operator r^-1 "converse"
wenzelm@4842
  4488
instead of "inverse";
wenzelm@4711
  4489
nipkow@5651
  4490
* HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
nipkow@5651
  4491
  of the multiset ordering;
nipkow@5651
  4492
wenzelm@5127
  4493
* directory HOL/Real: a construction of the reals using Dedekind cuts
nipkow@5651
  4494
  (not included by default);
paulson@4806
  4495
wenzelm@5127
  4496
* directory HOL/UNITY: Chandy and Misra's UNITY formalism;
wenzelm@4711
  4497
nipkow@5651
  4498
* directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
nipkow@5651
  4499
  programs, i.e. different program variables may have different types.
nipkow@5651
  4500
paulson@5142
  4501
* calling (stac rew i) now fails if "rew" has no effect on the goal
paulson@5142
  4502
  [previously, this check worked only if the rewrite rule was unconditional]
paulson@5308
  4503
  Now rew can involve either definitions or equalities (either == or =).
wenzelm@5002
  4504
wenzelm@5363
  4505
paulson@4879
  4506
*** ZF ***
paulson@4879
  4507
paulson@5332
  4508
* theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
paulson@5332
  4509
  only the theorems proved on ZF.ML;
paulson@5160
  4510
paulson@5475
  4511
* ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
paulson@5475
  4512
  It and 'sym RS equals0D' are now in the default  claset, giving automatic
paulson@5475
  4513
  disjointness reasoning but breaking a few old proofs.
paulson@5267
  4514
paulson@5160
  4515
* ZF/Update: new theory of function updates
paulson@5160
  4516
    with default rewrite rule  f(x:=y) ` z = if(z=x, y, f`z)
paulson@5160
  4517
  may also be iterated as in f(a:=b,c:=d,...);
paulson@5160
  4518
paulson@4879
  4519
* in  let x=t in u(x), neither t nor u(x) has to be an FOL term.
oheimb@4649
  4520
paulson@5142
  4521
* calling (stac rew i) now fails if "rew" has no effect on the goal
paulson@5142
  4522
  [previously, this check worked only if the rewrite rule was unconditional]
paulson@5308
  4523
  Now rew can involve either definitions or equalities (either == or =).
paulson@5142
  4524
paulson@5160
  4525
* case_tac provided for compatibility with HOL
paulson@5160
  4526
    (like the old excluded_middle_tac, but with subgoals swapped)
paulson@5160
  4527
wenzelm@4842
  4528
wenzelm@5127
  4529
*** Internal programming interfaces ***
wenzelm@5002
  4530
wenzelm@5251
  4531
* Pure: several new basic modules made available for general use, see
wenzelm@5251
  4532
also src/Pure/README;
wenzelm@5207
  4533
wenzelm@5008
  4534
* improved the theory data mechanism to support encapsulation (data
wenzelm@5008
  4535
kind name replaced by private Object.kind, acting as authorization
wenzelm@5373
  4536
key); new type-safe user interface via functor TheoryDataFun; generic
wenzelm@5373
  4537
print_data function becomes basically useless;
wenzelm@5002
  4538
wenzelm@5251
  4539
* removed global_names compatibility flag -- all theory declarations
wenzelm@5251
  4540
are qualified by default;
wenzelm@5251
  4541
wenzelm@5085
  4542
* module Pure/Syntax now offers quote / antiquote translation
wenzelm@5085
  4543
functions (useful for Hoare logic etc. with implicit dependencies);
wenzelm@5373
  4544
see HOL/ex/Antiquote for an example use;
wenzelm@5085
  4545
wenzelm@5127
  4546
* Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
wenzelm@5127
  4547
cterm -> thm;
wenzelm@5127
  4548
wenzelm@5207
  4549
* new tactical CHANGED_GOAL for checking that a tactic modifies a
wenzelm@5207
  4550
subgoal;
paulson@5142
  4551
wenzelm@5251
  4552
* Display.print_goals function moved to Locale.print_goals;
wenzelm@5251
  4553
wenzelm@5731
  4554
* standard print function for goals supports current_goals_markers
wenzelm@5731
  4555
variable for marking begin of proof, end of proof, start of goal; the
wenzelm@5731
  4556
default is ("", "", ""); setting current_goals_markers := ("<proof>",
wenzelm@5731
  4557
"</proof>", "<goal>") causes SGML like tagged proof state printing,
wenzelm@5731
  4558
for example;
wenzelm@5731
  4559
wenzelm@5002
  4560
wenzelm@5002
  4561
wenzelm@4410
  4562
New in Isabelle98 (January 1998)
wenzelm@4410
  4563
--------------------------------
wenzelm@4410
  4564
wenzelm@4410
  4565
*** Overview of INCOMPATIBILITIES (see below for more details) ***
wenzelm@4410
  4566
wenzelm@4410
  4567
* changed lexical syntax of terms / types: dots made part of long
wenzelm@4410
  4568
identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
wenzelm@4410
  4569
wenzelm@4410
  4570
* simpset (and claset) reference variable replaced by functions
wenzelm@4410
  4571
simpset / simpset_ref;
wenzelm@4410
  4572
wenzelm@4410
  4573
* no longer supports theory aliases (via merge) and non-trivial
wenzelm@4410
  4574
implicit merge of thms' signatures;
wenzelm@4410
  4575
wenzelm@4410
  4576
* most internal names of constants changed due to qualified names;
wenzelm@4410
  4577
wenzelm@4410
  4578
* changed Pure/Sequence interface (see Pure/seq.ML);
wenzelm@4410
  4579
wenzelm@3454
  4580
paulson@3715
  4581
*** General Changes ***
wenzelm@3697
  4582
wenzelm@4174
  4583
* hierachically structured name spaces (for consts, types, axms, thms
wenzelm@3943
  4584
etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
wenzelm@4108
  4585
old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
wenzelm@4108
  4586
isatool fixdots ensures space after dots (e.g. "%x. x"); set
wenzelm@4174
  4587
long_names for fully qualified output names; NOTE: ML programs
wenzelm@4174
  4588
(special tactics, packages etc.) referring to internal names may have
wenzelm@4174
  4589
to be adapted to cope with fully qualified names; in case of severe
wenzelm@4174
  4590
backward campatibility problems try setting 'global_names' at compile
wenzelm@4174
  4591
time to have enrything declared within a flat name space; one may also
wenzelm@4174
  4592
fine tune name declarations in theories via the 'global' and 'local'
wenzelm@4174
  4593
section;
wenzelm@4108
  4594
wenzelm@4108
  4595
* reimplemented the implicit simpset and claset using the new anytype
wenzelm@4108
  4596
data filed in signatures; references simpset:simpset ref etc. are
wenzelm@4108
  4597
replaced by functions simpset:unit->simpset and
wenzelm@4108
  4598
simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
wenzelm@4108
  4599
to patch your ML files accordingly;
paulson@3856
  4600
wenzelm@3857
  4601
* HTML output now includes theory graph data for display with Java
wenzelm@3857
  4602
applet or isatool browser; data generated automatically via isatool
wenzelm@3901
  4603
usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
wenzelm@3857
  4604
paulson@3856
  4605
* defs may now be conditional; improved rewrite_goals_tac to handle
paulson@3856
  4606
conditional equations;
paulson@3856
  4607
wenzelm@4174
  4608
* defs now admits additional type arguments, using TYPE('a) syntax;
wenzelm@4174
  4609
wenzelm@3901
  4610
* theory aliases via merge (e.g. M=A+B+C) no longer supported, always
wenzelm@3901
  4611
creates a new theory node; implicit merge of thms' signatures is
wenzelm@4112
  4612
restricted to 'trivial' ones; COMPATIBILITY: one may have to use
wenzelm@3901
  4613
transfer:theory->thm->thm in (rare) cases;
wenzelm@3901
  4614
wenzelm@3968
  4615
* improved handling of draft signatures / theories; draft thms (and
wenzelm@3968
  4616
ctyps, cterms) are automatically promoted to real ones;
wenzelm@3968
  4617
wenzelm@3901
  4618
* slightly changed interfaces for oracles: admit many per theory, named
wenzelm@3901
  4619
(e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
wenzelm@3901
  4620
wenzelm@3901
  4621
* print_goals: optional output of const types (set show_consts and
wenzelm@3901
  4622
show_types);
wenzelm@3851
  4623
wenzelm@4388
  4624
* improved output of warnings (###) and errors (***);
wenzelm@3697
  4625
paulson@4178
  4626
* subgoal_tac displays a warning if the new subgoal has type variables;
paulson@4178
  4627
paulson@3715
  4628
* removed old README and Makefiles;
paulson@3715
  4629
paulson@3856
  4630
* replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
wenzelm@3670
  4631
paulson@3715
  4632
* removed obsolete init_pps and init_database;
paulson@3715
  4633
paulson@3715
  4634
* deleted the obsolete tactical STATE, which was declared by
paulson@3715
  4635
    fun STATE tacfun st = tacfun st st;
paulson@3715
  4636
wenzelm@4388
  4637
* cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
wenzelm@4388
  4638
(which abbreviates $HOME);
wenzelm@4269
  4639
wenzelm@4269
  4640
* changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
wenzelm@4269
  4641
use isatool fixseq to adapt your ML programs (this works for fully
wenzelm@4269
  4642
qualified references to the Sequence structure only!);
wenzelm@4269
  4643
wenzelm@4381
  4644
* use_thy no longer requires writable current directory; it always
wenzelm@4381
  4645
reloads .ML *and* .thy file, if either one is out of date;
wenzelm@4269
  4646
paulson@3715
  4647
paulson@3715
  4648
*** Classical Reasoner ***
paulson@3715
  4649
wenzelm@3744
  4650
* Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
wenzelm@3744
  4651
tactics that use classical reasoning to simplify a subgoal without
wenzelm@3744
  4652
splitting it into several subgoals;
paulson@3715
  4653
paulson@3719
  4654
* Safe_tac: like safe_tac but uses the default claset;
paulson@3719
  4655
paulson@3715
  4656
paulson@3715
  4657
*** Simplifier ***
paulson@3715
  4658
paulson@3715
  4659
* added simplification meta rules:
paulson@3715
  4660
    (asm_)(full_)simplify: simpset -> thm -> thm;
paulson@3715
  4661
paulson@3715
  4662
* simplifier.ML no longer part of Pure -- has to be loaded by object
paulson@3715
  4663
logics (again);
paulson@3715
  4664
paulson@3715
  4665
* added prems argument to simplification procedures;
paulson@3715
  4666
paulson@4325
  4667
* HOL, FOL, ZF: added infix function `addsplits':
paulson@4325
  4668
  instead of `<simpset> setloop (split_tac <thms>)'
paulson@4325
  4669
  you can simply write `<simpset> addsplits <thms>'
paulson@4325
  4670
paulson@3715
  4671
paulson@3715
  4672
*** Syntax ***
paulson@3715
  4673
wenzelm@4174
  4674
* TYPE('a) syntax for type reflection terms;
wenzelm@4174
  4675
wenzelm@3985
  4676
* no longer handles consts with name "" -- declare as 'syntax' instead;
paulson@3856
  4677
paulson@3856
  4678
* pretty printer: changed order of mixfix annotation preference (again!);
wenzelm@3846
  4679
paulson@3715
  4680
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
paulson@3715
  4681
paulson@3715
  4682
paulson@3715
  4683
*** HOL ***
paulson@3715
  4684
wenzelm@5726
  4685
* HOL: there is a new splitter `split_asm_tac' that can be used e.g.
oheimb@4189
  4686
  with `addloop' of the simplifier to faciliate case splitting in premises.
oheimb@4189
  4687
nipkow@4035
  4688
* HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
wenzelm@3985
  4689
wenzelm@3985
  4690
* HOL/Auth: new protocol proofs including some for the Internet
nipkow@4035
  4691
  protocol TLS;
wenzelm@3985
  4692
wenzelm@4125
  4693
* HOL/Map: new theory of `maps' a la VDM;
nipkow@3982
  4694
wenzelm@4335
  4695
* HOL/simplifier: simplification procedures nat_cancel_sums for
wenzelm@4335
  4696
cancelling out common nat summands from =, <, <= (in)equalities, or
wenzelm@4335
  4697
differences; simplification procedures nat_cancel_factor for
wenzelm@4335
  4698
cancelling common factor from =, <, <= (in)equalities over natural
wenzelm@4373
  4699
sums; nat_cancel contains both kinds of procedures, it is installed by
wenzelm@4373
  4700
default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
wenzelm@4335
  4701
nipkow@3580
  4702
* HOL/simplifier: terms of the form
paulson@4325
  4703
  `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)'  (or t=x)
nipkow@3580
  4704
  are rewritten to
nipkow@4035
  4705
  `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
nipkow@4035
  4706
  and those of the form
paulson@4325
  4707
  `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)'  (or t=x)
nipkow@4035
  4708
  are rewritten to
nipkow@4035
  4709
  `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
nipkow@3580
  4710
nipkow@4035
  4711
* HOL/datatype
nipkow@4035
  4712
  Each datatype `t' now comes with a theorem `split_t_case' of the form
nipkow@4035
  4713
nipkow@4035
  4714
  P(t_case f1 ... fn x) =
nipkow@4035
  4715
     ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
nipkow@4035
  4716
        ...
oheimb@4189
  4717
       (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
nipkow@4035
  4718
     )
nipkow@4035
  4719
oheimb@4930
  4720
  and a theorem `split_t_case_asm' of the form
oheimb@4189
  4721
oheimb@4189
  4722
  P(t_case f1 ... fn x) =
oheimb@4189
  4723
    ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
oheimb@4189
  4724
        ...
oheimb@4189
  4725
       (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
oheimb@4189
  4726
     )
oheimb@4930
  4727
  which can be added to a simpset via `addsplits'. The existing theorems
oheimb@4930
  4728
  expand_list_case and expand_option_case have been renamed to
oheimb@4930
  4729
  split_list_case and split_option_case.
oheimb@4189
  4730
nipkow@4361
  4731
* HOL/Arithmetic:
nipkow@4361
  4732
  - `pred n' is automatically converted to `n-1'.
nipkow@4361
  4733
    Users are strongly encouraged not to use `pred' any longer,
nipkow@4361
  4734
    because it will disappear altogether at some point.
nipkow@4361
  4735
  - Users are strongly encouraged to write "0 < n" rather than
nipkow@4361
  4736
    "n ~= 0". Theorems and proof tools have been modified towards this
nipkow@4361
  4737
    `standard'.
nipkow@4357
  4738
nipkow@4502
  4739
* HOL/Lists:
nipkow@4502
  4740
  the function "set_of_list" has been renamed "set" (and its theorems too);
nipkow@4502
  4741
  the function "nth" now takes its arguments in the reverse order and
nipkow@4502
  4742
  has acquired the infix notation "!" as in "xs!n".
paulson@3570
  4743
paulson@4154
  4744
* HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
paulson@4154
  4745
paulson@4154
  4746
* HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
paulson@4154
  4747
  specialist theorems (like UN1_I) are gone.  Similarly for (INT x.B x);
paulson@4154
  4748
wenzelm@4575
  4749
* HOL/record: extensible records with schematic structural subtyping
wenzelm@4575
  4750
(single inheritance); EXPERIMENTAL version demonstrating the encoding,
wenzelm@4575
  4751
still lacks various theorems and concrete record syntax;
wenzelm@4575
  4752
wenzelm@4125
  4753
paulson@3715
  4754
*** HOLCF ***
wenzelm@3511
  4755
wenzelm@4125
  4756
* removed "axioms" and "generated by" sections;
wenzelm@4125
  4757
oheimb@4123
  4758
* replaced "ops" section by extended "consts" section, which is capable of
wenzelm@4125
  4759
  handling the continuous function space "->" directly;
wenzelm@4125
  4760
wenzelm@4125
  4761
* domain package:
wenzelm@4125
  4762
  . proves theorems immediately and stores them in the theory,
wenzelm@4125
  4763
  . creates hierachical name space,
wenzelm@4125
  4764
  . now uses normal mixfix annotations (instead of cinfix...),
wenzelm@4125
  4765
  . minor changes to some names and values (for consistency),
wenzelm@4125
  4766
  . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
wenzelm@4125
  4767
  . separator between mutual domain defs: changed "," to "and",
wenzelm@4125
  4768
  . improved handling of sort constraints;  now they have to
wenzelm@4125
  4769
    appear on the left-hand side of the equations only;
oheimb@4123
  4770
oheimb@4123
  4771
* fixed LAM <x,y,zs>.b syntax;
wenzelm@3535
  4772
wenzelm@3744
  4773
* added extended adm_tac to simplifier in HOLCF -- can now discharge
wenzelm@3744
  4774
adm (%x. P (t x)), where P is chainfinite and t continuous;
wenzelm@3579
  4775
wenzelm@3579
  4776
paulson@3719
  4777
*** FOL and ZF ***
paulson@3719
  4778
wenzelm@5726
  4779
* FOL: there is a new splitter `split_asm_tac' that can be used e.g.
oheimb@4189
  4780
  with `addloop' of the simplifier to faciliate case splitting in premises.
oheimb@4189
  4781
wenzelm@3744
  4782
* qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
wenzelm@3744
  4783
in HOL, they strip ALL and --> from proved theorems;
wenzelm@3744
  4784
paulson@3719
  4785
wenzelm@3579
  4786
wenzelm@3006
  4787
New in Isabelle94-8 (May 1997)
wenzelm@3006
  4788
------------------------------
wenzelm@2654
  4789
paulson@3002
  4790
*** General Changes ***
paulson@3002
  4791
paulson@3002
  4792
* new utilities to build / run / maintain Isabelle etc. (in parts
paulson@3002
  4793
still somewhat experimental); old Makefiles etc. still functional;
wenzelm@2971
  4794
wenzelm@3205
  4795
* new 'Isabelle System Manual';
wenzelm@3205
  4796
wenzelm@2825
  4797
* INSTALL text, together with ./configure and ./build scripts;
wenzelm@2773
  4798
wenzelm@3006
  4799
* reimplemented type inference for greater efficiency, better error
wenzelm@3006
  4800
messages and clean internal interface;
paulson@3002
  4801
paulson@3002
  4802
* prlim command for dealing with lots of subgoals (an easier way of
paulson@3002
  4803
setting goals_limit);
paulson@3002
  4804
wenzelm@3006
  4805
wenzelm@3006
  4806
*** Syntax ***
paulson@3002
  4807
wenzelm@3116
  4808
* supports alternative (named) syntax tables (parser and pretty
wenzelm@3116
  4809
printer); internal interface is provided by add_modesyntax(_i);
wenzelm@3116
  4810
paulson@3002
  4811
* Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
paulson@3002
  4812
be used in conjunction with the Isabelle symbol font; uses the
paulson@3002
  4813
"symbols" syntax table;
paulson@3002
  4814
wenzelm@2705
  4815
* added token_translation interface (may translate name tokens in
wenzelm@2756
  4816
arbitrary ways, dependent on their type (free, bound, tfree, ...) and
wenzelm@3116
  4817
the current print_mode); IMPORTANT: user print translation functions
wenzelm@3116
  4818
are responsible for marking newly introduced bounds
wenzelm@3116
  4819
(Syntax.mark_boundT);
wenzelm@2705
  4820
wenzelm@2730
  4821
* token translations for modes "xterm" and "xterm_color" that display
wenzelm@3006
  4822
names in bold, underline etc. or colors (which requires a color
wenzelm@3006
  4823
version of xterm);
wenzelm@2730
  4824
paulson@3002
  4825
* infixes may now be declared with names independent of their syntax;
paulson@3002
  4826
paulson@3002
  4827
* added typed_print_translation (like print_translation, but may
paulson@3002
  4828
access type of constant);
paulson@3002
  4829
wenzelm@3006
  4830
paulson@3002
  4831
*** Classical Reasoner ***
paulson@3002
  4832
paulson@3002
  4833
Blast_tac: a new tactic!  It is often more powerful than fast_tac, but has
paulson@3002
  4834
some limitations.  Blast_tac...
paulson@3002
  4835
  + ignores addss, addbefore, addafter; this restriction is intrinsic
paulson@3002
  4836
  + ignores elimination rules that don't have the correct format
wenzelm@5726
  4837
        (the conclusion MUST be a formula variable)
paulson@3002
  4838
  + ignores types, which can make HOL proofs fail
paulson@3002
  4839
  + rules must not require higher-order unification, e.g. apply_type in ZF
paulson@3002
  4840
    [message "Function Var's argument not a bound variable" relates to this]
paulson@3002
  4841
  + its proof strategy is more general but can actually be slower
paulson@3002
  4842
wenzelm@3107
  4843
* substitution with equality assumptions no longer permutes other
wenzelm@3107
  4844
assumptions;
paulson@3002
  4845
paulson@3002
  4846
* minor changes in semantics of addafter (now called addaltern); renamed
paulson@3002
  4847
setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
wenzelm@3107
  4848
(and access functions for it);
paulson@3002
  4849
wenzelm@5726
  4850
* improved combination of classical reasoner and simplifier:
oheimb@3317
  4851
  + functions for handling clasimpsets
oheimb@3317
  4852
  + improvement of addss: now the simplifier is called _after_ the
oheimb@3317
  4853
    safe steps.
oheimb@3317
  4854
  + safe variant of addss called addSss: uses safe simplifications
wenzelm@5726
  4855
    _during_ the safe steps. It is more complete as it allows multiple
oheimb@3317
  4856
    instantiations of unknowns (e.g. with slow_tac).
wenzelm@3006
  4857
paulson@3002
  4858
*** Simplifier ***
paulson@3002
  4859
wenzelm@3006
  4860
* added interface for simplification procedures (functions that
wenzelm@3006
  4861
produce *proven* rewrite rules on the fly, depending on current
wenzelm@3006
  4862
redex);
wenzelm@3006
  4863
wenzelm@3006
  4864
* ordering on terms as parameter (used for ordered rewriting);
wenzelm@3006
  4865
wenzelm@3107
  4866
* new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
paulson@3002
  4867
paulson@3002
  4868
* the solver is now split into a safe and an unsafe part.
paulson@3002
  4869
This should be invisible for the normal user, except that the
paulson@3002
  4870
functions setsolver and addsolver have been renamed to setSolver and
wenzelm@3107
  4871
addSolver; added safe_asm_full_simp_tac;
paulson@3002
  4872
paulson@3002
  4873
paulson@3002
  4874
*** HOL ***
paulson@3002
  4875
nipkow@3042
  4876
* a generic induction tactic `induct_tac' which works for all datatypes and
wenzelm@3107
  4877
also for type `nat';
nipkow@3042
  4878
nipkow@3316
  4879
* a generic case distinction tactic `exhaust_tac' which works for all
nipkow@3316
  4880
datatypes and also for type `nat';
nipkow@3316
  4881
nipkow@3316
  4882
* each datatype comes with a function `size';
nipkow@3316
  4883
paulson@3002
  4884
* patterns in case expressions allow tuple patterns as arguments to
wenzelm@3107
  4885
constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
paulson@3002
  4886
paulson@3002
  4887
* primrec now also works with type nat;
paulson@3002
  4888
paulson@3338
  4889
* recdef: a new declaration form, allows general recursive functions to be
paulson@3338
  4890
defined in theory files.  See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
paulson@3338
  4891
paulson@3002
  4892
* the constant for negation has been renamed from "not" to "Not" to
wenzelm@3107
  4893
harmonize with FOL, ZF, LK, etc.;
paulson@3002
  4894
wenzelm@3107
  4895
* HOL/ex/LFilter theory of a corecursive "filter" functional for
wenzelm@3107
  4896
infinite lists;
paulson@3002
  4897
wenzelm@3227
  4898
* HOL/Modelcheck demonstrates invocation of model checker oracle;
wenzelm@3227
  4899
paulson@3002
  4900
* HOL/ex/Ring.thy declares cring_simp, which solves equational
paulson@3002
  4901
problems in commutative rings, using axiomatic type classes for + and *;
paulson@3002
  4902
paulson@3002
  4903
* more examples in HOL/MiniML and HOL/Auth;
paulson@3002
  4904
paulson@3002
  4905
* more default rewrite rules for quantifiers, union/intersection;
paulson@3002
  4906
nipkow@3321
  4907
* a new constant `arbitrary == @x.False';
nipkow@3321
  4908
wenzelm@3107
  4909
* HOLCF/IOA replaces old HOL/IOA;
wenzelm@3107
  4910
wenzelm@5726
  4911
* HOLCF changes: derived all rules and arities
wenzelm@5726
  4912
  + axiomatic type classes instead of classes
slotosch@2653
  4913
  + typedef instead of faking type definitions
paulson@2747
  4914
  + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
wenzelm@2730
  4915
  + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
slotosch@2653
  4916
  + eliminated the types void, one, tr
slotosch@2653
  4917
  + use unit lift and bool lift (with translations) instead of one and tr
slotosch@2653
  4918
  + eliminated blift from Lift3.thy (use Def instead of blift)
wenzelm@3107
  4919
  all eliminated rules are derived as theorems --> no visible changes ;
oheimb@2649
  4920
wenzelm@3006
  4921
paulson@3002
  4922
*** ZF ***
wenzelm@2553
  4923
paulson@2865
  4924
* ZF now has Fast_tac, Simp_tac and Auto_tac.  Union_iff is a now a default
paulson@2865
  4925
rewrite rule; this may affect some proofs.  eq_cs is gone but can be put back
paulson@2865
  4926
as ZF_cs addSIs [equalityI];
wenzelm@2553
  4927
wenzelm@2554
  4928
wenzelm@2732
  4929
wenzelm@2553
  4930
New in Isabelle94-7 (November 96)
wenzelm@2553
  4931
---------------------------------
wenzelm@2553
  4932
wenzelm@2553
  4933
* allowing negative levels (as offsets) in prlev and choplev;
wenzelm@2553
  4934
wenzelm@2554
  4935
* super-linear speedup for large simplifications;
wenzelm@2554
  4936
wenzelm@2554
  4937
* FOL, ZF and HOL now use miniscoping: rewriting pushes
wenzelm@2554
  4938
quantifications in as far as possible (COULD MAKE EXISTING PROOFS
wenzelm@2554
  4939
FAIL); can suppress it using the command Delsimps (ex_simps @
wenzelm@2554
  4940
all_simps); De Morgan laws are also now included, by default;
wenzelm@2554
  4941
wenzelm@2554
  4942
* improved printing of ==>  :  ~:
wenzelm@2554
  4943
wenzelm@2554
  4944
* new object-logic "Sequents" adds linear logic, while replacing LK
wenzelm@2554
  4945
and Modal (thanks to Sara Kalvala);
wenzelm@2554
  4946
wenzelm@2554
  4947
* HOL/Auth: correctness proofs for authentication protocols;
wenzelm@2554
  4948
wenzelm@2554
  4949
* HOL: new auto_tac combines rewriting and classical reasoning (many
wenzelm@2554
  4950
examples on HOL/Auth);
wenzelm@2554
  4951
wenzelm@2554
  4952
* HOL: new command AddIffs for declaring theorems of the form P=Q to
wenzelm@2554
  4953
the rewriter and classical reasoner simultaneously;
wenzelm@2554
  4954
wenzelm@2554
  4955
* function uresult no longer returns theorems in "standard" format;
wenzelm@2554
  4956
regain previous version by: val uresult = standard o uresult;
wenzelm@2554
  4957
wenzelm@2554
  4958
wenzelm@2554
  4959
wenzelm@2554
  4960
New in Isabelle94-6
wenzelm@2554
  4961
-------------------
wenzelm@2554
  4962
wenzelm@2554
  4963
* oracles -- these establish an interface between Isabelle and trusted
wenzelm@2554
  4964
external reasoners, which may deliver results as theorems;
wenzelm@2554
  4965
wenzelm@2554
  4966
* proof objects (in particular record all uses of oracles);
wenzelm@2554
  4967
wenzelm@2554
  4968
* Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
wenzelm@2554
  4969
wenzelm@2554
  4970
* "constdefs" section in theory files;
wenzelm@2554
  4971
wenzelm@2554
  4972
* "primrec" section (HOL) no longer requires names;
wenzelm@2554
  4973
wenzelm@2554
  4974
* internal type "tactic" now simply "thm -> thm Sequence.seq";
wenzelm@2554
  4975
wenzelm@2554
  4976
wenzelm@2554
  4977
wenzelm@2554
  4978
New in Isabelle94-5
wenzelm@2554
  4979
-------------------
wenzelm@2554
  4980
wenzelm@2554
  4981
* reduced space requirements;
wenzelm@2554
  4982
wenzelm@2554
  4983
* automatic HTML generation from theories;
wenzelm@2554
  4984
wenzelm@2554
  4985
* theory files no longer require "..." (quotes) around most types;
wenzelm@2554
  4986
wenzelm@2554
  4987
* new examples, including two proofs of the Church-Rosser theorem;
wenzelm@2554
  4988
wenzelm@2554
  4989
* non-curried (1994) version of HOL is no longer distributed;
wenzelm@2554
  4990
wenzelm@2553
  4991
paulson@2557
  4992
paulson@2557
  4993
New in Isabelle94-4
paulson@2557
  4994
-------------------
paulson@2557
  4995
paulson@2747
  4996
* greatly reduced space requirements;
paulson@2557
  4997
paulson@2557
  4998
* theory files (.thy) no longer require \...\ escapes at line breaks;
paulson@2557
  4999
wenzelm@5726
  5000
* searchable theorem database (see the section "Retrieving theorems" on
paulson@2557
  5001
page 8 of the Reference Manual);
paulson@2557
  5002
paulson@2557
  5003
* new examples, including Grabczewski's monumental case study of the
paulson@2557
  5004
Axiom of Choice;
paulson@2557
  5005
paulson@2557
  5006
* The previous version of HOL renamed to Old_HOL;
paulson@2557
  5007
wenzelm@5726
  5008
* The new version of HOL (previously called CHOL) uses a curried syntax
paulson@2557
  5009
for functions.  Application looks like f a b instead of f(a,b);
paulson@2557
  5010
paulson@2557
  5011
* Mutually recursive inductive definitions finally work in HOL;
paulson@2557
  5012
paulson@2557
  5013
* In ZF, pattern-matching on tuples is now available in all abstractions and
paulson@2557
  5014
translates to the operator "split";
paulson@2557
  5015
paulson@2557
  5016
paulson@2557
  5017
paulson@2557
  5018
New in Isabelle94-3
paulson@2557
  5019
-------------------
paulson@2557
  5020
wenzelm@5726
  5021
* new infix operator, addss, allowing the classical reasoner to
paulson@2557
  5022
perform simplification at each step of its search.  Example:
wenzelm@5726
  5023
        fast_tac (cs addss ss)
paulson@2557
  5024
wenzelm@5726
  5025
* a new logic, CHOL, the same as HOL, but with a curried syntax
wenzelm@5726
  5026
for functions.  Application looks like f a b instead of f(a,b).  Also pairs
paulson@2557
  5027
look like (a,b) instead of <a,b>;
paulson@2557
  5028
paulson@2557
  5029
* PLEASE NOTE: CHOL will eventually replace HOL!
paulson@2557
  5030
paulson@2557
  5031
* In CHOL, pattern-matching on tuples is now available in all abstractions.
paulson@2557
  5032
It translates to the operator "split".  A new theory of integers is available;
paulson@2557
  5033
paulson@2557
  5034
* In ZF, integer numerals now denote two's-complement binary integers.
paulson@2557
  5035
Arithmetic operations can be performed by rewriting.  See ZF/ex/Bin.ML;
paulson@2557
  5036
wenzelm@5726
  5037
* Many new examples: I/O automata, Church-Rosser theorem, equivalents
paulson@2557
  5038
of the Axiom of Choice;
paulson@2557
  5039
paulson@2557
  5040
paulson@2557
  5041
paulson@2557
  5042
New in Isabelle94-2
paulson@2557
  5043
-------------------
paulson@2557
  5044
wenzelm@5726
  5045
* Significantly faster resolution;
paulson@2557
  5046
paulson@2557
  5047
* the different sections in a .thy file can now be mixed and repeated
paulson@2557
  5048
freely;
paulson@2557
  5049
paulson@2557
  5050
* Database of theorems for FOL, HOL and ZF.  New
paulson@2557
  5051
commands including qed, qed_goal and bind_thm store theorems in the database.
paulson@2557
  5052
paulson@2557
  5053
* Simple database queries: return a named theorem (get_thm) or all theorems of
paulson@2557
  5054
a given theory (thms_of), or find out what theory a theorem was proved in
paulson@2557
  5055
(theory_of_thm);
paulson@2557
  5056
paulson@2557
  5057
* Bugs fixed in the inductive definition and datatype packages;
paulson@2557
  5058
paulson@2557
  5059
* The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
paulson@2557
  5060
and HOL_dup_cs obsolete;
paulson@2557
  5061
paulson@2557
  5062
* Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
paulson@2557
  5063
have been removed;
paulson@2557
  5064
paulson@2557
  5065
* Simpler definition of function space in ZF;
paulson@2557
  5066
paulson@2557
  5067
* new results about cardinal and ordinal arithmetic in ZF;
paulson@2557
  5068
paulson@2557
  5069
* 'subtype' facility in HOL for introducing new types as subsets of existing
paulson@2557
  5070
types;
paulson@2557
  5071
wenzelm@24213
  5072
:mode=text:wrap=hard:maxLineLen=72:
wenzelm@2553
  5073
$Id$