NEWS
author berghofe
Thu Jan 27 12:37:02 2005 +0100 (2005-01-27)
changeset 15475 fdf9434b04ea
parent 15454 4b339d3907a0
child 15477 5058984779b9
permissions -rw-r--r--
- Proofs are now hidden by default when generating documents
- New syntax for referring to theorems in lists
- Improvements to theory loader (relative and absolute paths)
wenzelm@5363
     1
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     2
==============================================
wenzelm@2553
     3
wenzelm@14655
     4
New in this Isabelle release
wenzelm@14655
     5
----------------------------
wenzelm@14655
     6
wenzelm@14655
     7
*** General ***
wenzelm@14655
     8
kleing@15350
     9
* Document preparation: new antiquotations @{lhs thm} and @{rhs thm}
kleing@15350
    10
  printing the lhs/rhs of definitions, equations, inequations etc. 
kleing@15350
    11
webertj@15287
    12
* isatool usedir: new option -f that allows specification of the ML
webertj@15287
    13
  file to be used by Isabelle; default is ROOT.ML.
webertj@15277
    14
nipkow@15130
    15
* Theory headers: the new header syntax for Isar theories is
nipkow@15130
    16
nipkow@15130
    17
  theory <name>
nipkow@15148
    18
  imports <theory1> ... <theoryn>
nipkow@15130
    19
  begin
nipkow@15130
    20
nipkow@15148
    21
  optionally also with a "files" section. The syntax
nipkow@15130
    22
nipkow@15130
    23
  theory <name> = <theory1> + ... + <theoryn>:
nipkow@15130
    24
nipkow@15130
    25
  will still be supported for some time but will eventually disappear.
nipkow@15130
    26
  The syntax of old-style theories has not changed.
nipkow@15130
    27
berghofe@15475
    28
* Theory loader: parent theories can now also be referred to via
berghofe@15475
    29
  relative and absolute paths.
berghofe@15475
    30
ballarin@15103
    31
* Provers/quasi.ML:  new transitivity reasoners for transitivity only
ballarin@15103
    32
  and quasi orders.
ballarin@15103
    33
ballarin@15076
    34
* Provers/trancl.ML:  new transitivity reasoner for transitive and
ballarin@15076
    35
  reflexive-transitive closure of relations.
ballarin@15076
    36
webertj@15163
    37
* Provers/blast.ML:  new reference depth_limit to make blast's depth
webertj@15163
    38
  limit (previously hard-coded with a value of 20) user-definable.
webertj@15163
    39
paulson@15454
    40
* Pure: thin_tac now works even if the assumption being deleted contains !! or ==>. 
paulson@15454
    41
  More generally, erule now works even if the major premise of the elimination rule
paulson@15454
    42
  contains !! or ==>.
paulson@15454
    43
wenzelm@14655
    44
* Pure: considerably improved version of 'constdefs' command.  Now
wenzelm@14731
    45
  performs automatic type-inference of declared constants; additional
wenzelm@14731
    46
  support for local structure declarations (cf. locales and HOL
wenzelm@14731
    47
  records), see also isar-ref manual.  Potential INCOMPATIBILITY: need
wenzelm@14731
    48
  to observe strictly sequential dependencies of definitions within a
wenzelm@14731
    49
  single 'constdefs' section; moreover, the declared name needs to be
wenzelm@14731
    50
  an identifier.  If all fails, consider to fall back on 'consts' and
wenzelm@14731
    51
  'defs' separately.
wenzelm@14655
    52
wenzelm@14698
    53
* Pure: improved indexed syntax and implicit structures.  First of
wenzelm@14731
    54
  all, indexed syntax provides a notational device for subscripted
wenzelm@14731
    55
  application, using the new syntax \<^bsub>term\<^esub> for arbitrary
wenzelm@14731
    56
  expressions.  Secondly, in a local context with structure
wenzelm@14731
    57
  declarations, number indexes \<^sub>n or the empty index (default
wenzelm@14731
    58
  number 1) refer to a certain fixed variable implicitly; option
wenzelm@14731
    59
  show_structs controls printing of implicit structures.  Typical
wenzelm@14731
    60
  applications of these concepts involve record types and locales.
wenzelm@14731
    61
wenzelm@14795
    62
* Pure: clear separation of logical types and nonterminals, where the
wenzelm@14795
    63
  latter may only occur in 'syntax' specifications or type
wenzelm@14795
    64
  abbreviations.  Before that distinction was only partially
wenzelm@14795
    65
  implemented via type class "logic" vs. "{}".  Potential
wenzelm@14795
    66
  INCOMPATIBILITY in rare cases of improper use of 'types'/'consts'
wenzelm@14795
    67
  instead of 'nonterminals'/'syntax'.  Some very exotic syntax
wenzelm@14816
    68
  specifications may require further adaption (e.g. Cube/Base.thy).
wenzelm@14816
    69
wenzelm@14854
    70
* Pure: removed obsolete type class "logic", use the top sort {}
wenzelm@14854
    71
  instead.  Note that non-logical types should be declared as
wenzelm@14854
    72
  'nonterminals' rather than 'types'.  INCOMPATIBILITY for new
wenzelm@14854
    73
  object-logic specifications.
wenzelm@14854
    74
wenzelm@15022
    75
* Pure: print_tac now outputs the goal through the trace channel.
wenzelm@15022
    76
wenzelm@15022
    77
* Pure: reference Namespace.unique_names included.  If true the
wenzelm@15022
    78
  (shortest) namespace-prefix is printed to disambiguate conflicts (as
wenzelm@15022
    79
  yet). If false the first entry wins (as during parsing). Default
wenzelm@15022
    80
  value is true.
schirmer@15018
    81
wenzelm@15033
    82
* Pure: tuned internal renaming of symbolic identifiers -- attach
wenzelm@15033
    83
  primes instead of base 26 numbers.
wenzelm@15033
    84
berghofe@15475
    85
* Pure: new flag show_var_qmarks to control printing of leading
berghofe@15475
    86
  question marks of variable names.
berghofe@15475
    87
wenzelm@14816
    88
* Pure/Syntax: inner syntax includes (*(*nested*) comments*).
wenzelm@14816
    89
wenzelm@14816
    90
* Pure/Syntax: pretty pinter now supports unbreakable blocks,
wenzelm@14816
    91
  specified in mixfix annotations as "(00...)".
wenzelm@14816
    92
wenzelm@14816
    93
* Pure/Syntax: 'advanced' translation functions (parse_translation
wenzelm@14816
    94
  etc.) may depend on the signature of the theory context being
wenzelm@14816
    95
  presently used for parsing/printing, see also isar-ref manual.
wenzelm@14816
    96
wenzelm@15033
    97
* Pure/Simplifier: simplification procedures may now take the current
wenzelm@15033
    98
  simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
wenzelm@15033
    99
  interface), which is very useful for calling the Simplifier
wenzelm@15033
   100
  recursively.  Minor INCOMPATIBILITY: the 'prems' argument of
wenzelm@15033
   101
  simprocs is gone -- use prems_of_ss on the simpset instead.
wenzelm@15033
   102
  Moreover, the low-level mk_simproc no longer applies Logic.varify
wenzelm@15033
   103
  internally, to allow for use in a context of fixed variables.
wenzelm@15033
   104
nipkow@15406
   105
* Pure/Simplifier: Command "find_rewrites" takes a string and lists all
nipkow@15406
   106
  equality theorems (not just those with attribute simp!) whose left-hand
nipkow@15406
   107
  side matches the term given via the string. In PG the command can be
nipkow@15406
   108
  activated via Isabelle -> Show me -> matching rewrites.
nipkow@15406
   109
wenzelm@15033
   110
* Provers: Simplifier and Classical Reasoner now support proof context
wenzelm@15033
   111
  dependent plug-ins (simprocs, solvers, wrappers etc.).  These extra
wenzelm@15033
   112
  components are stored in the theory and patched into the
wenzelm@15033
   113
  simpset/claset when used in an Isar proof context.  Context
wenzelm@15033
   114
  dependent components are maintained by the following theory
wenzelm@15033
   115
  operations:
wenzelm@15033
   116
wenzelm@15033
   117
    Simplifier.add_context_simprocs
wenzelm@15033
   118
    Simplifier.del_context_simprocs
wenzelm@15033
   119
    Simplifier.set_context_subgoaler
wenzelm@15033
   120
    Simplifier.reset_context_subgoaler
wenzelm@15033
   121
    Simplifier.add_context_looper
wenzelm@15033
   122
    Simplifier.del_context_looper
wenzelm@15033
   123
    Simplifier.add_context_unsafe_solver
wenzelm@15033
   124
    Simplifier.add_context_safe_solver
wenzelm@15033
   125
wenzelm@15033
   126
    Classical.add_context_safe_wrapper
wenzelm@15033
   127
    Classical.del_context_safe_wrapper
wenzelm@15033
   128
    Classical.add_context_unsafe_wrapper
wenzelm@15033
   129
    Classical.del_context_unsafe_wrapper
wenzelm@15033
   130
wenzelm@15033
   131
  IMPORTANT NOTE: proof tools (methods etc.) need to use
wenzelm@15033
   132
  local_simpset_of and local_claset_of to instead of the primitive
wenzelm@15033
   133
  Simplifier.get_local_simpset and Classical.get_local_claset,
wenzelm@15033
   134
  respectively, in order to see the context dependent fields!
wenzelm@14816
   135
wenzelm@14897
   136
* Document preparation: antiquotations now provide the option
wenzelm@14897
   137
  'locale=NAME' to specify an alternative context used for evaluating
wenzelm@14897
   138
  and printing the subsequent argument, as in @{thm [locale=LC]
wenzelm@14919
   139
  fold_commute}, for example.
wenzelm@14897
   140
wenzelm@14934
   141
* Document preparation: commands 'display_drafts' and 'print_drafts'
wenzelm@14934
   142
  perform simple output of raw sources.  Only those symbols that do
wenzelm@14934
   143
  not require additional LaTeX packages (depending on comments in
wenzelm@14934
   144
  isabellesym.sty) are displayed properly, everything else is left
wenzelm@14934
   145
  verbatim.  We use isatool display and isatool print as front ends;
wenzelm@14934
   146
  these are subject to the DVI_VIEWER and PRINT_COMMAND settings,
wenzelm@14934
   147
  respectively.
wenzelm@14934
   148
berghofe@15436
   149
* Document preparation: Proof scripts as well as some other commands
berghofe@15436
   150
  such as ML or parse/print_translation can now be hidden in the document.
berghofe@15475
   151
  Hiding is enabled by default, and can be disabled either via the option
berghofe@15475
   152
  '-H true' of isatool usedir or by resetting the reference variable
berghofe@15475
   153
  IsarOutput.hide_commands. Additional commands to be hidden may be
berghofe@15475
   154
  declared using IsarOutput.add_hidden_commands.
berghofe@15436
   155
wenzelm@14917
   156
* ML: output via the Isabelle channels of writeln/warning/error
wenzelm@14917
   157
  etc. is now passed through Output.output, with a hook for arbitrary
wenzelm@14917
   158
  transformations depending on the print_mode (cf. Output.add_mode --
wenzelm@14917
   159
  the first active mode that provides a output function wins).
wenzelm@14917
   160
  Already formatted output may be embedded into further text via
wenzelm@14917
   161
  Output.raw; the result of Pretty.string_of/str_of and derived
wenzelm@14917
   162
  functions (string_of_term/cterm/thm etc.) is already marked raw to
wenzelm@14917
   163
  accommodate easy composition of diagnostic messages etc.
wenzelm@14917
   164
  Programmers rarely need to care about Output.output or Output.raw at
wenzelm@14917
   165
  all, with some notable exceptions: Output.output is required when
wenzelm@14917
   166
  bypassing the standard channels (writeln etc.), or in token
wenzelm@14917
   167
  translations to produce properly formatted results; Output.raw is
wenzelm@14917
   168
  required when capturing already output material that will eventually
wenzelm@14972
   169
  be presented to the user a second time.  For the default print mode,
wenzelm@14972
   170
  both Output.output and Output.raw have no effect.
wenzelm@14795
   171
wenzelm@14707
   172
ballarin@15127
   173
*** Isar ***
ballarin@15127
   174
ballarin@15127
   175
* Locales:
ballarin@15127
   176
  - "includes" disallowed in declaration of named locales (command "locale").
ballarin@15206
   177
  - Fixed parameter management in theorem generation for goals with "includes".
ballarin@15206
   178
    INCOMPATIBILITY: rarely, the generated theorem statement is different.
berghofe@15475
   179
berghofe@15475
   180
* New syntax
berghofe@15475
   181
berghofe@15475
   182
    <theorem_name> (<index>, ..., <index>-<index>, ...)
berghofe@15475
   183
berghofe@15475
   184
  for referring to specific theorems in a named list of theorems via
berghofe@15475
   185
  indices.
berghofe@15475
   186
schirmer@14700
   187
*** HOL ***
schirmer@14700
   188
nipkow@15242
   189
* Datatype induction via method `induct' now preserves the name of the
nipkow@15242
   190
  induction variable. For example, when proving P(xs::'a list) by induction
nipkow@15242
   191
  on xs, the induction step is now P(xs) ==> P(a#xs) rather than
nipkow@15242
   192
  P(list) ==> P(a#list) as previously.
nipkow@15242
   193
wenzelm@14731
   194
* HOL/record: reimplementation of records. Improved scalability for
wenzelm@14731
   195
  records with many fields, avoiding performance problems for type
wenzelm@14731
   196
  inference. Records are no longer composed of nested field types, but
wenzelm@14731
   197
  of nested extension types. Therefore the record type only grows
wenzelm@14731
   198
  linear in the number of extensions and not in the number of fields.
wenzelm@14731
   199
  The top-level (users) view on records is preserved.  Potential
wenzelm@14731
   200
  INCOMPATIBILITY only in strange cases, where the theory depends on
wenzelm@14731
   201
  the old record representation. The type generated for a record is
wenzelm@14731
   202
  called <record_name>_ext_type.
wenzelm@14731
   203
wenzelm@15022
   204
* HOL/record: Reference record_quick_and_dirty_sensitive can be
wenzelm@15022
   205
  enabled to skip the proofs triggered by a record definition or a
wenzelm@15022
   206
  simproc (if quick_and_dirty is enabled). Definitions of large
wenzelm@15022
   207
  records can take quite long.
wenzelm@15022
   208
wenzelm@15022
   209
* HOL/record: "record_upd_simproc" for simplification of multiple
wenzelm@15022
   210
  record updates enabled by default.  Moreover, trivial updates are
wenzelm@15022
   211
  also removed: r(|x := x r|) = r.  INCOMPATIBILITY: old proofs break
wenzelm@15022
   212
  occasionally, since simplification is more powerful by default.
schirmer@15012
   213
wenzelm@14878
   214
* HOL: symbolic syntax of Hilbert Choice Operator is now as follows:
wenzelm@14878
   215
wenzelm@14878
   216
  syntax (epsilon)
wenzelm@14878
   217
    "_Eps" :: "[pttrn, bool] => 'a"    ("(3\<some>_./ _)" [0, 10] 10)
wenzelm@14878
   218
wenzelm@14878
   219
  The symbol \<some> is displayed as the alternative epsilon of LaTeX
wenzelm@14878
   220
  and x-symbol; use option '-m epsilon' to get it actually printed.
wenzelm@14878
   221
  Moreover, the mathematically important symbolic identifier
wenzelm@14878
   222
  \<epsilon> becomes available as variable, constant etc.
wenzelm@14878
   223
nipkow@15361
   224
* HOL: "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
nipkow@15361
   225
  Similarly for all quantifiers: "ALL x > y" etc.
nipkow@15361
   226
  The x-symbol for >= is \<ge>.
nipkow@15356
   227
nipkow@15046
   228
* HOL/SetInterval: The syntax for open intervals has changed:
nipkow@15046
   229
nipkow@15046
   230
  Old         New
nipkow@15046
   231
  {..n(}   -> {..<n}
nipkow@15046
   232
  {)n..}   -> {n<..}
nipkow@15046
   233
  {m..n(}  -> {m..<n}
nipkow@15046
   234
  {)m..n}  -> {m<..n}
nipkow@15046
   235
  {)m..n(} -> {m<..<n}
nipkow@15046
   236
nipkow@15046
   237
  The old syntax is still supported but will disappear in the future.
nipkow@15046
   238
  For conversion use the following emacs search and replace patterns:
nipkow@15046
   239
nipkow@15046
   240
  {)\([^\.]*\)\.\.  ->  {\1<\.\.}
nipkow@15046
   241
  \.\.\([^(}]*\)(}  ->  \.\.<\1}
nipkow@15046
   242
nipkow@15046
   243
  They are not perfect but work quite well.
nipkow@15046
   244
nipkow@15073
   245
* HOL: The syntax for 'setsum', summation over finite sets, has changed:
nipkow@15073
   246
nipkow@15073
   247
  The syntax for 'setsum (%x. e) A' used to be '\<Sum>x:A. e'
nipkow@15073
   248
  and is now either 'SUM x:A. e' or '\<Sum>x\<in>A. e'.
nipkow@15073
   249
nipkow@15073
   250
  There is new syntax for summation over finite sets:
nipkow@15046
   251
nipkow@15050
   252
  '\<Sum>x | P. e'    is the same as  'setsum (%x. e) {x. P}'
nipkow@15050
   253
  '\<Sum>x=a..b. e'   is the same as  'setsum (%x. e) {a..b}'
nipkow@15050
   254
  '\<Sum>x=a..<b. e'  is the same as  'setsum (%x. e) {a..<b}'
nipkow@15050
   255
  '\<Sum>x<k. e'      is the same as  'setsum (%x. e) {..<k}'
nipkow@15046
   256
nipkow@15046
   257
  Function 'Summation' over nat is gone, its syntax '\<Sum>i<k. e'
nipkow@15046
   258
  now translates into 'setsum' as above.
nipkow@15046
   259
nipkow@15319
   260
* HOL: Finite set induction: In Isar proofs, the insert case is now
nipkow@15319
   261
  "case (insert x F)" instead of the old counterintuitive "case (insert F x)".
nipkow@15319
   262
nipkow@15200
   263
* HOL/Simplifier:
nipkow@15200
   264
nipkow@15200
   265
  - Is now set up to reason about transitivity chains involving "trancl"
nipkow@15200
   266
  (r^+) and "rtrancl" (r^*) by setting up tactics provided by
nipkow@15200
   267
  Provers/trancl.ML as additional solvers.  INCOMPATIBILITY: old proofs break
nipkow@15200
   268
  occasionally as simplification may now solve more goals than previously.
nipkow@15200
   269
nipkow@15200
   270
  - Converts x <= y into x = y if assumption y <= x is present.  Works for
nipkow@15200
   271
  all partial orders (class "order"), in particular numbers and sets. For
nipkow@15200
   272
  linear orders (e.g. numbers) it treats ~ x < y just like y <= x.
wenzelm@15089
   273
schirmer@15423
   274
  - Simproc for "let x = a in f x"
schirmer@15423
   275
  If a is a free or bound variable or a constant then the let is unfolded.
schirmer@15423
   276
  Otherwise first a is simplified to a', and then f a' is simplified to
schirmer@15423
   277
  g. If possible we abstract a' from g arriving at "let x = a' in g' x",
schirmer@15423
   278
  otherwise we unfold the let and arrive at g. The simproc can be 
schirmer@15423
   279
  enabled/disabled by the reference use_let_simproc. Potential
schirmer@15423
   280
  INCOMPATIBILITY since simplification is more powerful by default.
schirmer@15423
   281
 
webertj@15154
   282
* HOL: new 'isatool dimacs2hol' to convert files in DIMACS CNF format
webertj@15154
   283
  (containing Boolean satisfiability problems) into Isabelle/HOL theories.
webertj@15154
   284
wenzelm@14655
   285
wenzelm@14682
   286
*** HOLCF ***
wenzelm@14682
   287
wenzelm@14682
   288
* HOLCF: discontinued special version of 'constdefs' (which used to
wenzelm@14731
   289
  support continuous functions) in favor of the general Pure one with
wenzelm@14731
   290
  full type-inference.
wenzelm@14682
   291
wenzelm@14682
   292
paulson@14885
   293
*** ZF ***
paulson@14885
   294
wenzelm@15089
   295
* ZF/ex/{Group,Ring}: examples in abstract algebra, including the
wenzelm@15089
   296
  First Isomorphism Theorem (on quotienting by the kernel of a
wenzelm@15089
   297
  homomorphism).
wenzelm@15089
   298
wenzelm@15089
   299
* ZF/Simplifier: install second copy of type solver that actually
wenzelm@15089
   300
  makes use of TC rules declared to Isar proof contexts (or locales);
wenzelm@15089
   301
  the old version is still required for ML proof scripts.
paulson@14885
   302
paulson@14885
   303
wenzelm@14655
   304
wenzelm@14606
   305
New in Isabelle2004 (April 2004)
wenzelm@14606
   306
--------------------------------
wenzelm@13280
   307
skalberg@14171
   308
*** General ***
skalberg@14171
   309
ballarin@14398
   310
* Provers/order.ML:  new efficient reasoner for partial and linear orders.
ballarin@14398
   311
  Replaces linorder.ML.
ballarin@14398
   312
wenzelm@14606
   313
* Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
wenzelm@14606
   314
  (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
skalberg@14173
   315
  (\<a>...\<z>), are now considered normal letters, and can therefore
skalberg@14173
   316
  be used anywhere where an ASCII letter (a...zA...Z) has until
skalberg@14173
   317
  now. COMPATIBILITY: This obviously changes the parsing of some
skalberg@14173
   318
  terms, especially where a symbol has been used as a binder, say
skalberg@14173
   319
  '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
skalberg@14173
   320
  as an identifier.  Fix it by inserting a space around former
skalberg@14173
   321
  symbols.  Call 'isatool fixgreek' to try to fix parsing errors in
skalberg@14173
   322
  existing theory and ML files.
skalberg@14171
   323
paulson@14237
   324
* Pure: Macintosh and Windows line-breaks are now allowed in theory files.
paulson@14237
   325
wenzelm@14731
   326
* Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
wenzelm@14731
   327
  allowed in identifiers. Similar to Greek letters \<^isub> is now considered
wenzelm@14731
   328
  a normal (but invisible) letter. For multiple letter subscripts repeat
wenzelm@14731
   329
  \<^isub> like this: x\<^isub>1\<^isub>2.
kleing@14233
   330
kleing@14333
   331
* Pure: There are now sub-/superscripts that can span more than one
kleing@14333
   332
  character. Text between \<^bsub> and \<^esub> is set in subscript in
wenzelm@14606
   333
  ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
wenzelm@14606
   334
  superscript. The new control characters are not identifier parts.
kleing@14333
   335
schirmer@14561
   336
* Pure: Control-symbols of the form \<^raw:...> will literally print the
wenzelm@14606
   337
  content of "..." to the latex file instead of \isacntrl... . The "..."
wenzelm@14606
   338
  may consist of any printable characters excluding the end bracket >.
schirmer@14361
   339
paulson@14237
   340
* Pure: Using new Isar command "finalconsts" (or the ML functions
paulson@14237
   341
  Theory.add_finals or Theory.add_finals_i) it is now possible to
paulson@14237
   342
  declare constants "final", which prevents their being given a definition
paulson@14237
   343
  later.  It is useful for constants whose behaviour is fixed axiomatically
skalberg@14224
   344
  rather than definitionally, such as the meta-logic connectives.
skalberg@14224
   345
wenzelm@14606
   346
* Pure: 'instance' now handles general arities with general sorts
wenzelm@14606
   347
  (i.e. intersections of classes),
skalberg@14503
   348
kleing@14547
   349
* Presentation: generated HTML now uses a CSS style sheet to make layout
wenzelm@14731
   350
  (somewhat) independent of content. It is copied from lib/html/isabelle.css.
kleing@14547
   351
  It can be changed to alter the colors/layout of generated pages.
kleing@14547
   352
wenzelm@14556
   353
ballarin@14175
   354
*** Isar ***
ballarin@14175
   355
ballarin@14508
   356
* Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
ballarin@14508
   357
  cut_tac, subgoal_tac and thin_tac:
ballarin@14175
   358
  - Now understand static (Isar) contexts.  As a consequence, users of Isar
ballarin@14175
   359
    locales are no longer forced to write Isar proof scripts.
ballarin@14175
   360
    For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
ballarin@14175
   361
    emulations.
ballarin@14175
   362
  - INCOMPATIBILITY: names of variables to be instantiated may no
ballarin@14211
   363
    longer be enclosed in quotes.  Instead, precede variable name with `?'.
ballarin@14211
   364
    This is consistent with the instantiation attribute "where".
ballarin@14211
   365
ballarin@14257
   366
* Attributes "where" and "of":
ballarin@14285
   367
  - Now take type variables of instantiated theorem into account when reading
ballarin@14285
   368
    the instantiation string.  This fixes a bug that caused instantiated
ballarin@14285
   369
    theorems to have too special types in some circumstances.
ballarin@14285
   370
  - "where" permits explicit instantiations of type variables.
ballarin@14257
   371
wenzelm@14556
   372
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm@14556
   373
  current facts ("this"), admitting arbitrary combinations with "then"
wenzelm@14556
   374
  and derived forms.
kleing@14283
   375
ballarin@14211
   376
* Locales:
ballarin@14211
   377
  - Goal statements involving the context element "includes" no longer
ballarin@14211
   378
    generate theorems with internal delta predicates (those ending on
ballarin@14211
   379
    "_axioms") in the premise.
ballarin@14211
   380
    Resolve particular premise with <locale>.intro to obtain old form.
ballarin@14211
   381
  - Fixed bug in type inference ("unify_frozen") that prevented mix of target
ballarin@14211
   382
    specification and "includes" elements in goal statement.
ballarin@14254
   383
  - Rule sets <locale>.intro and <locale>.axioms no longer declared as
ballarin@14254
   384
    [intro?] and [elim?] (respectively) by default.
ballarin@14508
   385
  - Experimental command for instantiation of locales in proof contexts:
ballarin@14551
   386
        instantiate <label>[<attrs>]: <loc>
ballarin@14508
   387
    Instantiates locale <loc> and adds all its theorems to the current context
ballarin@14551
   388
    taking into account their attributes.  Label and attrs are optional
ballarin@14551
   389
    modifiers, like in theorem declarations.  If present, names of
ballarin@14551
   390
    instantiated theorems are qualified with <label>, and the attributes
ballarin@14551
   391
    <attrs> are applied after any attributes these theorems might have already.
ballarin@14551
   392
      If the locale has assumptions, a chained fact of the form
ballarin@14508
   393
    "<loc> t1 ... tn" is expected from which instantiations of the parameters
ballarin@14551
   394
    are derived.  The command does not support old-style locales declared
ballarin@14551
   395
    with "locale (open)".
ballarin@14551
   396
      A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
ballarin@14175
   397
ballarin@14175
   398
* HOL: Tactic emulation methods induct_tac and case_tac understand static
ballarin@14175
   399
  (Isar) contexts.
ballarin@14175
   400
wenzelm@14556
   401
kleing@14136
   402
*** HOL ***
kleing@14136
   403
kleing@14624
   404
* Proof import: new image HOL4 contains the imported library from
kleing@14624
   405
  the HOL4 system with about 2500 theorems. It is imported by
kleing@14624
   406
  replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
kleing@14624
   407
  can be used like any other Isabelle image.  See
kleing@14624
   408
  HOL/Import/HOL/README for more information.
kleing@14624
   409
ballarin@14398
   410
* Simplifier:
ballarin@14398
   411
  - Much improved handling of linear and partial orders.
ballarin@14398
   412
    Reasoners for linear and partial orders are set up for type classes
ballarin@14398
   413
    "linorder" and "order" respectively, and are added to the default simpset
ballarin@14398
   414
    as solvers.  This means that the simplifier can build transitivity chains
ballarin@14398
   415
    to solve goals from the assumptions.
ballarin@14398
   416
  - INCOMPATIBILITY: old proofs break occasionally.  Typically, applications
ballarin@14398
   417
    of blast or auto after simplification become unnecessary because the goal
ballarin@14398
   418
    is solved by simplification already.
ballarin@14398
   419
wenzelm@14731
   420
* Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
paulson@14389
   421
    all proved in axiomatic type classes for semirings, rings and fields.
paulson@14389
   422
paulson@14389
   423
* Numerics:
paulson@14389
   424
  - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
wenzelm@14731
   425
    now formalized using the Ring_and_Field theory mentioned above.
paulson@14389
   426
  - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
paulson@14389
   427
    than before, because now they are set up once in a generic manner.
wenzelm@14731
   428
  - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
paulson@14480
   429
    Look for the general versions in Ring_and_Field (and Power if they concern
paulson@14480
   430
    exponentiation).
paulson@14389
   431
paulson@14401
   432
* Type "rat" of the rational numbers is now available in HOL-Complex.
paulson@14389
   433
schirmer@14255
   434
* Records:
schirmer@14255
   435
  - Record types are now by default printed with their type abbreviation
schirmer@14255
   436
    instead of the list of all field types. This can be configured via
schirmer@14255
   437
    the reference "print_record_type_abbr".
wenzelm@14731
   438
  - Simproc "record_upd_simproc" for simplification of multiple updates added
schirmer@14255
   439
    (not enabled by default).
schirmer@14427
   440
  - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
schirmer@14427
   441
    EX x. x = sel r to True (not enabled by default).
schirmer@14255
   442
  - Tactic "record_split_simp_tac" to split and simplify records added.
wenzelm@14731
   443
kleing@14136
   444
* 'specification' command added, allowing for definition by
skalberg@14224
   445
  specification.  There is also an 'ax_specification' command that
skalberg@14224
   446
  introduces the new constants axiomatically.
kleing@14136
   447
nipkow@14375
   448
* arith(_tac) is now able to generate counterexamples for reals as well.
nipkow@14375
   449
ballarin@14399
   450
* HOL-Algebra: new locale "ring" for non-commutative rings.
ballarin@14399
   451
paulson@14243
   452
* HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
kleing@14610
   453
  definitions, thanks to Sava Krsti\'{c} and John Matthews.
kleing@14610
   454
wenzelm@14731
   455
* HOL-Matrix: a first theory for matrices in HOL with an application of
kleing@14610
   456
  matrix theory to linear programming.
kleing@14136
   457
nipkow@14380
   458
* Unions and Intersections:
nipkow@15119
   459
  The latex output syntax of UN and INT has been changed
nipkow@15119
   460
  from "\Union x \in A. B" to "\Union_{x \in A} B"
nipkow@15119
   461
  i.e. the index formulae has become a subscript.
nipkow@15119
   462
  Similarly for "\Union x. B", and for \Inter instead of \Union.
nipkow@14380
   463
kleing@14418
   464
* Unions and Intersections over Intervals:
wenzelm@14731
   465
  There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
wenzelm@14731
   466
  also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
kleing@14418
   467
  like in normal math, and corresponding versions for < and for intersection.
kleing@14418
   468
paulson@14401
   469
* ML: the legacy theory structures Int and List have been removed. They had
paulson@14401
   470
  conflicted with ML Basis Library structures having the same names.
nipkow@14380
   471
webertj@14464
   472
* 'refute' command added to search for (finite) countermodels.  Only works
webertj@14464
   473
  for a fragment of HOL.  The installation of an external SAT solver is
webertj@14464
   474
  highly recommended.  See "HOL/Refute.thy" for details.
webertj@14464
   475
berghofe@14602
   476
* 'quickcheck' command: Allows to find counterexamples by evaluating
berghofe@14602
   477
  formulae under an assignment of free variables to random values.
berghofe@14602
   478
  In contrast to 'refute', it can deal with inductive datatypes,
berghofe@14602
   479
  but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
berghofe@14602
   480
  for examples.
webertj@14464
   481
wenzelm@14606
   482
oheimb@14536
   483
*** HOLCF ***
oheimb@14536
   484
oheimb@14536
   485
* Streams now come with concatenation and are part of the HOLCF image
oheimb@14536
   486
wenzelm@14572
   487
wenzelm@14572
   488
kleing@14136
   489
New in Isabelle2003 (May 2003)
wenzelm@14606
   490
------------------------------
kleing@14136
   491
wenzelm@13280
   492
*** General ***
wenzelm@13280
   493
berghofe@13618
   494
* Provers/simplifier:
berghofe@13618
   495
nipkow@13781
   496
  - Completely reimplemented method simp (ML: Asm_full_simp_tac):
berghofe@13618
   497
    Assumptions are now subject to complete mutual simplification,
berghofe@13618
   498
    not just from left to right. The simplifier now preserves
berghofe@13618
   499
    the order of assumptions.
berghofe@13618
   500
berghofe@13618
   501
    Potential INCOMPATIBILITY:
berghofe@13618
   502
nipkow@13781
   503
    -- simp sometimes diverges where the old version did
nipkow@13781
   504
       not, e.g. invoking simp on the goal
berghofe@13618
   505
berghofe@13618
   506
        [| P (f x); y = x; f x = f y |] ==> Q
berghofe@13618
   507
nipkow@13781
   508
       now gives rise to the infinite reduction sequence
nipkow@13781
   509
nipkow@13781
   510
        P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
nipkow@13781
   511
nipkow@13781
   512
       Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
nipkow@13781
   513
       kind of problem.
nipkow@13781
   514
nipkow@13781
   515
    -- Tactics combining classical reasoner and simplification (such as auto)
nipkow@13781
   516
       are also affected by this change, because many of them rely on
nipkow@13781
   517
       simp. They may sometimes diverge as well or yield a different numbers
nipkow@13781
   518
       of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
nipkow@13781
   519
       in case of problems. Sometimes subsequent calls to the classical
nipkow@13781
   520
       reasoner will fail because a preceeding call to the simplifier too
nipkow@13781
   521
       eagerly simplified the goal, e.g. deleted redundant premises.
berghofe@13618
   522
berghofe@13618
   523
  - The simplifier trace now shows the names of the applied rewrite rules
berghofe@13618
   524
nipkow@13829
   525
  - You can limit the number of recursive invocations of the simplifier
nipkow@13829
   526
    during conditional rewriting (where the simplifie tries to solve the
nipkow@13829
   527
    conditions before applying the rewrite rule):
nipkow@13829
   528
    ML "simp_depth_limit := n"
nipkow@13829
   529
    where n is an integer. Thus you can force termination where previously
nipkow@13829
   530
    the simplifier would diverge.
nipkow@13829
   531
ballarin@13835
   532
  - Accepts free variables as head terms in congruence rules.  Useful in Isar.
nipkow@13829
   533
ballarin@13938
   534
  - No longer aborts on failed congruence proof.  Instead, the
ballarin@13938
   535
    congruence is ignored.
ballarin@13938
   536
berghofe@14008
   537
* Pure: New generic framework for extracting programs from constructive
berghofe@14008
   538
  proofs. See HOL/Extraction.thy for an example instantiation, as well
berghofe@14008
   539
  as HOL/Extraction for some case studies.
berghofe@14008
   540
nipkow@13868
   541
* Pure: The main goal of the proof state is no longer shown by default, only
nipkow@13868
   542
the subgoals. This behaviour is controlled by a new flag.
ballarin@13835
   543
   PG menu: Isabelle/Isar -> Settings -> Show Main Goal
nipkow@13815
   544
(ML: Proof.show_main_goal).
nipkow@13815
   545
nipkow@13815
   546
* Pure: You can find all matching introduction rules for subgoal 1, i.e. all
nipkow@13815
   547
rules whose conclusion matches subgoal 1:
nipkow@13815
   548
      PG menu: Isabelle/Isar -> Show me -> matching rules
nipkow@13815
   549
The rules are ordered by how closely they match the subgoal.
nipkow@13815
   550
In particular, rules that solve a subgoal outright are displayed first
nipkow@13815
   551
(or rather last, the way they are printed).
nipkow@13815
   552
(ML: ProofGeneral.print_intros())
nipkow@13815
   553
nipkow@13815
   554
* Pure: New flag trace_unify_fail causes unification to print
nipkow@13781
   555
diagnostic information (PG: in trace buffer) when it fails. This is
nipkow@13781
   556
useful for figuring out why single step proofs like rule, erule or
nipkow@13781
   557
assumption failed.
nipkow@13781
   558
nipkow@13815
   559
* Pure: Locale specifications now produce predicate definitions
wenzelm@13410
   560
according to the body of text (covering assumptions modulo local
wenzelm@13410
   561
definitions); predicate "loc_axioms" covers newly introduced text,
wenzelm@13410
   562
while "loc" is cumulative wrt. all included locale expressions; the
wenzelm@13410
   563
latter view is presented only on export into the global theory
wenzelm@13410
   564
context; potential INCOMPATIBILITY, use "(open)" option to fall back
wenzelm@13410
   565
on the old view without predicates;
wenzelm@13410
   566
wenzelm@13459
   567
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm@13459
   568
parameters (as in CASL, for example); just specify something like
wenzelm@13459
   569
``var x + var y + struct M'' as import;
wenzelm@13459
   570
wenzelm@13463
   571
* Pure: improved thms_containing: proper indexing of facts instead of
wenzelm@13463
   572
raw theorems; check validity of results wrt. current name space;
wenzelm@13463
   573
include local facts of proof configuration (also covers active
wenzelm@13541
   574
locales), cover fixed variables in index; may use "_" in term
wenzelm@13541
   575
specification; an optional limit for the number of printed facts may
wenzelm@13541
   576
be given (the default is 40);
wenzelm@13541
   577
wenzelm@13541
   578
* Pure: disallow duplicate fact bindings within new-style theory files
wenzelm@13541
   579
(batch-mode only);
wenzelm@13540
   580
wenzelm@13463
   581
* Provers: improved induct method: assumptions introduced by case
wenzelm@13463
   582
"foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
wenzelm@13463
   583
the goal statement); "foo" still refers to all facts collectively;
wenzelm@13463
   584
paulson@13550
   585
* Provers: the function blast.overloaded has been removed: all constants
paulson@13550
   586
are regarded as potentially overloaded, which improves robustness in exchange
paulson@13550
   587
for slight decrease in efficiency;
paulson@13550
   588
nipkow@13781
   589
* Provers/linorder: New generic prover for transitivity reasoning over
nipkow@13781
   590
linear orders.  Note: this prover is not efficient!
nipkow@13781
   591
wenzelm@13522
   592
* Isar: preview of problems to finish 'show' now produce an error
wenzelm@13522
   593
rather than just a warning (in interactive mode);
wenzelm@13522
   594
wenzelm@13280
   595
nipkow@13158
   596
*** HOL ***
nipkow@13158
   597
nipkow@13899
   598
* arith(_tac)
nipkow@13899
   599
nipkow@13899
   600
 - Produces a counter example if it cannot prove a goal.
nipkow@13899
   601
   Note that the counter example may be spurious if the goal is not a formula
nipkow@13899
   602
   of quantifier-free linear arithmetic.
nipkow@13899
   603
   In ProofGeneral the counter example appears in the trace buffer.
nipkow@13899
   604
nipkow@13899
   605
 - Knows about div k and mod k where k is a numeral of type nat or int.
nipkow@13899
   606
nipkow@13899
   607
 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
nipkow@13899
   608
   linear arithmetic fails. This takes account of quantifiers and divisibility.
wenzelm@14731
   609
   Presburger arithmetic can also be called explicitly via presburger(_tac).
nipkow@13899
   610
nipkow@13899
   611
* simp's arithmetic capabilities have been enhanced a bit: it now
nipkow@13899
   612
takes ~= in premises into account (by performing a case split);
nipkow@13899
   613
nipkow@13899
   614
* simp reduces "m*(n div m) + n mod m" to n, even if the two summands
nipkow@13899
   615
are distributed over a sum of terms;
nipkow@13899
   616
ballarin@13735
   617
* New tactic "trans_tac" and method "trans" instantiate
ballarin@13735
   618
Provers/linorder.ML for axclasses "order" and "linorder" (predicates
wenzelm@14731
   619
"<=", "<" and "=").
wenzelm@14731
   620
wenzelm@14731
   621
* function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
paulson@13587
   622
HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
paulson@13587
   623
wenzelm@13443
   624
* 'typedef' command has new option "open" to suppress the set
wenzelm@13443
   625
definition;
wenzelm@13443
   626
wenzelm@13522
   627
* functions Min and Max on finite sets have been introduced (theory
wenzelm@13522
   628
Finite_Set);
nipkow@13492
   629
wenzelm@13443
   630
* attribute [symmetric] now works for relations as well; it turns
wenzelm@13443
   631
(x,y) : R^-1 into (y,x) : R, and vice versa;
wenzelm@13443
   632
nipkow@13613
   633
* induct over a !!-quantified statement (say !!x1..xn):
nipkow@13613
   634
  each "case" automatically performs "fix x1 .. xn" with exactly those names.
nipkow@13613
   635
nipkow@13899
   636
* Map: `empty' is no longer a constant but a syntactic abbreviation for
nipkow@13899
   637
%x. None. Warning: empty_def now refers to the previously hidden definition
nipkow@13899
   638
of the empty set.
nipkow@13899
   639
ballarin@14018
   640
* Algebra: formalization of classical algebra.  Intended as base for
ballarin@14018
   641
any algebraic development in Isabelle.  Currently covers group theory
ballarin@14018
   642
(up to Sylow's theorem) and ring theory (Universal Property of
ballarin@14018
   643
Univariate Polynomials).  Contributions welcome;
paulson@13960
   644
paulson@13960
   645
* GroupTheory: deleted, since its material has been moved to Algebra;
paulson@13960
   646
wenzelm@14731
   647
* Complex: new directory of the complex numbers with numeric constants,
wenzelm@14731
   648
nonstandard complex numbers, and some complex analysis, standard and
paulson@13966
   649
nonstandard (Jacques Fleuriot);
paulson@13966
   650
paulson@13966
   651
* HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
paulson@13966
   652
wenzelm@14731
   653
* Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
paulson@13966
   654
Fleuriot);
paulson@13960
   655
wenzelm@13549
   656
* Real/HahnBanach: updated and adapted to locales;
wenzelm@13549
   657
ballarin@13995
   658
* NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
ballarin@13995
   659
Gray and Kramer);
paulson@13872
   660
paulson@13872
   661
* UNITY: added the Meier-Sanders theory of progress sets;
paulson@13872
   662
kleing@14011
   663
* MicroJava: bytecode verifier and lightweight bytecode verifier
kleing@14011
   664
as abstract algorithms, instantiated to the JVM;
kleing@14011
   665
schirmer@14010
   666
* Bali: Java source language formalization. Type system, operational
schirmer@14010
   667
semantics, axiomatic semantics. Supported language features:
schirmer@14010
   668
classes, interfaces, objects,virtual methods, static methods,
schirmer@14010
   669
static/instance fields, arrays, access modifiers, definite
schirmer@14010
   670
assignment, exceptions.
wenzelm@13549
   671
kleing@14011
   672
wenzelm@13549
   673
*** ZF ***
wenzelm@13549
   674
webertj@15154
   675
* ZF/Constructible: consistency proof for AC (Gdel's constructible
wenzelm@13549
   676
universe, etc.);
wenzelm@13549
   677
paulson@13872
   678
* Main ZF: virtually all theories converted to new-style format;
nipkow@13518
   679
wenzelm@13280
   680
wenzelm@13478
   681
*** ML ***
wenzelm@13478
   682
wenzelm@13478
   683
* Pure: Tactic.prove provides sane interface for internal proofs;
wenzelm@13478
   684
omits the infamous "standard" operation, so this is more appropriate
wenzelm@13478
   685
than prove_goalw_cterm in many situations (e.g. in simprocs);
wenzelm@13478
   686
wenzelm@13478
   687
* Pure: improved error reporting of simprocs;
wenzelm@13478
   688
wenzelm@13478
   689
* Provers: Simplifier.simproc(_i) provides sane interface for setting
wenzelm@13478
   690
up simprocs;
wenzelm@13478
   691
wenzelm@13478
   692
kleing@13953
   693
*** Document preparation ***
kleing@13953
   694
kleing@13953
   695
* uses \par instead of \\ for line breaks in theory text. This may
kleing@13953
   696
shift some page breaks in large documents. To get the old behaviour
kleing@13953
   697
use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
kleing@13953
   698
wenzelm@14731
   699
* minimized dependencies of isabelle.sty and isabellesym.sty on
kleing@13953
   700
other packages
kleing@13953
   701
kleing@13953
   702
* \<euro> now needs package babel/greek instead of marvosym (which
kleing@13953
   703
broke \Rightarrow)
kleing@13953
   704
wenzelm@14731
   705
* normal size for \<zero>...\<nine> (uses \mathbf instead of
kleing@13954
   706
textcomp package)
kleing@13953
   707
wenzelm@13280
   708
wenzelm@14572
   709
wenzelm@12984
   710
New in Isabelle2002 (March 2002)
wenzelm@12984
   711
--------------------------------
wenzelm@11474
   712
wenzelm@11572
   713
*** Document preparation ***
wenzelm@11572
   714
wenzelm@11842
   715
* greatly simplified document preparation setup, including more
wenzelm@11842
   716
graceful interpretation of isatool usedir -i/-d/-D options, and more
wenzelm@11842
   717
instructive isatool mkdir; users should basically be able to get
wenzelm@12899
   718
started with "isatool mkdir HOL Test && isatool make"; alternatively,
wenzelm@12899
   719
users may run a separate document processing stage manually like this:
wenzelm@12899
   720
"isatool usedir -D output HOL Test && isatool document Test/output";
wenzelm@11842
   721
wenzelm@11842
   722
* theory dependency graph may now be incorporated into documents;
wenzelm@11842
   723
isatool usedir -g true will produce session_graph.eps/.pdf for use
wenzelm@11842
   724
with \includegraphics of LaTeX;
wenzelm@11842
   725
wenzelm@11864
   726
* proper spacing of consecutive markup elements, especially text
wenzelm@11864
   727
blocks after section headings;
wenzelm@11864
   728
wenzelm@11572
   729
* support bold style (for single symbols only), input syntax is like
wenzelm@11572
   730
this: "\<^bold>\<alpha>" or "\<^bold>A";
wenzelm@11572
   731
wenzelm@11814
   732
* \<bullet> is now output as bold \cdot by default, which looks much
wenzelm@11572
   733
better in printed text;
wenzelm@11572
   734
wenzelm@11712
   735
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm@11712
   736
note that these symbols are currently unavailable in Proof General /
wenzelm@12769
   737
X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
wenzelm@12690
   738
wenzelm@12690
   739
* isatool latex no longer depends on changed TEXINPUTS, instead
wenzelm@12690
   740
isatool document copies the Isabelle style files to the target
wenzelm@12690
   741
location;
wenzelm@11712
   742
wenzelm@11572
   743
wenzelm@11633
   744
*** Isar ***
wenzelm@11633
   745
wenzelm@12312
   746
* Pure/Provers: improved proof by cases and induction;
wenzelm@12280
   747
  - 'case' command admits impromptu naming of parameters (such as
wenzelm@12280
   748
    "case (Suc n)");
wenzelm@12280
   749
  - 'induct' method divinates rule instantiation from the inductive
wenzelm@12280
   750
    claim; no longer requires excessive ?P bindings for proper
wenzelm@12280
   751
    instantiation of cases;
wenzelm@12280
   752
  - 'induct' method properly enumerates all possibilities of set/type
wenzelm@12280
   753
    rules; as a consequence facts may be also passed through *type*
wenzelm@12280
   754
    rules without further ado;
wenzelm@12280
   755
  - 'induct' method now derives symbolic cases from the *rulified*
wenzelm@12280
   756
    rule (before it used to rulify cases stemming from the internal
wenzelm@12280
   757
    atomized version); this means that the context of a non-atomic
wenzelm@12280
   758
    statement becomes is included in the hypothesis, avoiding the
wenzelm@12280
   759
    slightly cumbersome show "PROP ?case" form;
wenzelm@12280
   760
  - 'induct' may now use elim-style induction rules without chaining
wenzelm@12280
   761
    facts, using ``missing'' premises from the goal state; this allows
wenzelm@12280
   762
    rules stemming from inductive sets to be applied in unstructured
wenzelm@12280
   763
    scripts, while still benefitting from proper handling of non-atomic
wenzelm@12280
   764
    statements; NB: major inductive premises need to be put first, all
wenzelm@12280
   765
    the rest of the goal is passed through the induction;
wenzelm@12280
   766
  - 'induct' proper support for mutual induction involving non-atomic
wenzelm@12280
   767
    rule statements (uses the new concept of simultaneous goals, see
wenzelm@12280
   768
    below);
wenzelm@12853
   769
  - append all possible rule selections, but only use the first
wenzelm@12853
   770
    success (no backtracking);
wenzelm@11995
   771
  - removed obsolete "(simplified)" and "(stripped)" options of methods;
wenzelm@12754
   772
  - undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm@12754
   773
  - added 'print_induct_rules' (covered by help item in recent Proof
wenzelm@12754
   774
    General versions);
wenzelm@11995
   775
  - moved induct/cases attributes to Pure, methods to Provers;
wenzelm@11995
   776
  - generic method setup instantiated for FOL and HOL;
wenzelm@11986
   777
wenzelm@12163
   778
* Pure: support multiple simultaneous goal statements, for example
wenzelm@12163
   779
"have a: A and b: B" (same for 'theorem' etc.); being a pure
wenzelm@12163
   780
meta-level mechanism, this acts as if several individual goals had
wenzelm@12163
   781
been stated separately; in particular common proof methods need to be
wenzelm@12163
   782
repeated in order to cover all claims; note that a single elimination
wenzelm@12163
   783
step is *not* sufficient to establish the two conjunctions, so this
wenzelm@12163
   784
fails:
wenzelm@12163
   785
wenzelm@12163
   786
  assume "A & B" then have A and B ..   (*".." fails*)
wenzelm@12163
   787
wenzelm@12163
   788
better use "obtain" in situations as above; alternative refer to
wenzelm@12163
   789
multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
wenzelm@12163
   790
wenzelm@12078
   791
* Pure: proper integration with ``locales''; unlike the original
webertj@15154
   792
version by Florian Kammller, Isar locales package high-level proof
wenzelm@12078
   793
contexts rather than raw logical ones (e.g. we admit to include
wenzelm@12280
   794
attributes everywhere); operations on locales include merge and
wenzelm@12964
   795
rename; support for implicit arguments (``structures''); simultaneous
wenzelm@12964
   796
type-inference over imports and text; see also HOL/ex/Locales.thy for
wenzelm@12964
   797
some examples;
wenzelm@12078
   798
wenzelm@12707
   799
* Pure: the following commands have been ``localized'', supporting a
wenzelm@12707
   800
target locale specification "(in name)": 'lemma', 'theorem',
wenzelm@12707
   801
'corollary', 'lemmas', 'theorems', 'declare'; the results will be
wenzelm@12707
   802
stored both within the locale and at the theory level (exported and
wenzelm@12707
   803
qualified by the locale name);
wenzelm@12707
   804
wenzelm@12964
   805
* Pure: theory goals may now be specified in ``long'' form, with
wenzelm@12964
   806
ad-hoc contexts consisting of arbitrary locale elements. for example
wenzelm@12964
   807
``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
wenzelm@12964
   808
definitions may be given, too); the result is a meta-level rule with
wenzelm@12964
   809
the context elements being discharged in the obvious way;
wenzelm@12964
   810
wenzelm@12964
   811
* Pure: new proof command 'using' allows to augment currently used
wenzelm@12964
   812
facts after a goal statement ('using' is syntactically analogous to
wenzelm@12964
   813
'apply', but acts on the goal's facts only); this allows chained facts
wenzelm@12964
   814
to be separated into parts given before and after a claim, as in
wenzelm@12964
   815
``from a and b have C using d and e <proof>'';
wenzelm@12078
   816
wenzelm@11722
   817
* Pure: renamed "antecedent" case to "rule_context";
wenzelm@11722
   818
wenzelm@12964
   819
* Pure: new 'judgment' command records explicit information about the
wenzelm@12964
   820
object-logic embedding (used by several tools internally); no longer
wenzelm@12964
   821
use hard-wired "Trueprop";
wenzelm@12964
   822
wenzelm@11738
   823
* Pure: added 'corollary' command;
wenzelm@11738
   824
wenzelm@11722
   825
* Pure: fixed 'token_translation' command;
wenzelm@11722
   826
wenzelm@11899
   827
* Pure: removed obsolete 'exported' attribute;
wenzelm@11899
   828
wenzelm@11933
   829
* Pure: dummy pattern "_" in is/let is now automatically lifted over
wenzelm@11933
   830
bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
wenzelm@11899
   831
supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
wenzelm@11899
   832
wenzelm@11952
   833
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm@11952
   834
statements (atomic meta-level propositions); setup controlled via
wenzelm@11952
   835
rewrite rules declarations of 'atomize' attribute; example
wenzelm@11952
   836
application: 'induct' method with proper rule statements in improper
wenzelm@11952
   837
proof *scripts*;
wenzelm@11952
   838
wenzelm@12106
   839
* Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
wenzelm@12106
   840
now consider the syntactic context of assumptions, giving a better
wenzelm@12106
   841
chance to get type-inference of the arguments right (this is
wenzelm@12106
   842
especially important for locales);
wenzelm@12106
   843
wenzelm@12312
   844
* Pure: "sorry" no longer requires quick_and_dirty in interactive
wenzelm@12312
   845
mode;
wenzelm@12312
   846
wenzelm@12405
   847
* Pure/obtain: the formal conclusion "thesis", being marked as
wenzelm@12405
   848
``internal'', may no longer be reference directly in the text;
wenzelm@12405
   849
potential INCOMPATIBILITY, may need to use "?thesis" in rare
wenzelm@12405
   850
situations;
wenzelm@12405
   851
wenzelm@12405
   852
* Pure: generic 'sym' attribute which declares a rule both as pure
wenzelm@12405
   853
'elim?' and for the 'symmetric' operation;
wenzelm@12405
   854
wenzelm@12877
   855
* Pure: marginal comments ``--'' may now occur just anywhere in the
wenzelm@12877
   856
text; the fixed correlation with particular command syntax has been
wenzelm@12877
   857
discontinued;
wenzelm@12877
   858
berghofe@13023
   859
* Pure: new method 'rules' is particularly well-suited for proof
berghofe@13023
   860
search in intuitionistic logic; a bit slower than 'blast' or 'fast',
berghofe@13023
   861
but often produces more compact proof terms with less detours;
berghofe@13023
   862
wenzelm@12364
   863
* Pure/Provers/classical: simplified integration with pure rule
wenzelm@12364
   864
attributes and methods; the classical "intro?/elim?/dest?"
wenzelm@12364
   865
declarations coincide with the pure ones; the "rule" method no longer
wenzelm@12364
   866
includes classically swapped intros; "intro" and "elim" methods no
wenzelm@12364
   867
longer pick rules from the context; also got rid of ML declarations
wenzelm@12364
   868
AddXIs/AddXEs/AddXDs; all of this has some potential for
wenzelm@12364
   869
INCOMPATIBILITY;
wenzelm@12364
   870
wenzelm@12405
   871
* Provers/classical: attribute 'swapped' produces classical inversions
wenzelm@12405
   872
of introduction rules;
wenzelm@12405
   873
wenzelm@12364
   874
* Provers/simplifier: 'simplified' attribute may refer to explicit
wenzelm@12364
   875
rules instead of full simplifier context; 'iff' attribute handles
wenzelm@12364
   876
conditional rules;
wenzelm@11936
   877
wenzelm@11745
   878
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm@11745
   879
wenzelm@11690
   880
* HOL: 'recdef' now fails on unfinished automated proofs, use
wenzelm@11633
   881
"(permissive)" option to recover old behavior;
wenzelm@11633
   882
wenzelm@11933
   883
* HOL: 'inductive' no longer features separate (collective) attributes
wenzelm@11933
   884
for 'intros' (was found too confusing);
wenzelm@11933
   885
wenzelm@12405
   886
* HOL: properly declared induction rules less_induct and
wenzelm@12405
   887
wf_induct_rule;
wenzelm@12405
   888
kleing@11788
   889
wenzelm@11474
   890
*** HOL ***
wenzelm@11474
   891
wenzelm@11702
   892
* HOL: moved over to sane numeral syntax; the new policy is as
wenzelm@11702
   893
follows:
wenzelm@11702
   894
wenzelm@11702
   895
  - 0 and 1 are polymorphic constants, which are defined on any
wenzelm@11702
   896
  numeric type (nat, int, real etc.);
wenzelm@11702
   897
wenzelm@11702
   898
  - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
wenzelm@11702
   899
  binary representation internally;
wenzelm@11702
   900
wenzelm@11702
   901
  - type nat has special constructor Suc, and generally prefers Suc 0
wenzelm@11702
   902
  over 1::nat and Suc (Suc 0) over 2::nat;
wenzelm@11702
   903
wenzelm@12364
   904
This change may cause significant problems of INCOMPATIBILITY; here
wenzelm@12364
   905
are some hints on converting existing sources:
wenzelm@11702
   906
wenzelm@11702
   907
  - due to the new "num" token, "-0" and "-1" etc. are now atomic
wenzelm@11702
   908
  entities, so expressions involving "-" (unary or binary minus) need
wenzelm@11702
   909
  to be spaced properly;
wenzelm@11702
   910
wenzelm@11702
   911
  - existing occurrences of "1" may need to be constraint "1::nat" or
wenzelm@11702
   912
  even replaced by Suc 0; similar for old "2";
wenzelm@11702
   913
wenzelm@11702
   914
  - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
wenzelm@11702
   915
wenzelm@11702
   916
  - remove all special provisions on numerals in proofs;
wenzelm@11702
   917
wenzelm@13042
   918
* HOL: simp rules nat_number expand numerals on nat to Suc/0
wenzelm@12837
   919
representation (depends on bin_arith_simps in the default context);
wenzelm@12837
   920
wenzelm@12736
   921
* HOL: symbolic syntax for x^2 (numeral 2);
wenzelm@12736
   922
wenzelm@12335
   923
* HOL: the class of all HOL types is now called "type" rather than
wenzelm@12335
   924
"term"; INCOMPATIBILITY, need to adapt references to this type class
wenzelm@12335
   925
in axclass/classes, instance/arities, and (usually rare) occurrences
wenzelm@12335
   926
in typings (of consts etc.); internally the class is called
wenzelm@12335
   927
"HOL.type", ML programs should refer to HOLogic.typeS;
wenzelm@12335
   928
wenzelm@12280
   929
* HOL/record package improvements:
wenzelm@12280
   930
  - new derived operations "fields" to build a partial record section,
wenzelm@12280
   931
    "extend" to promote a fixed record to a record scheme, and
wenzelm@12280
   932
    "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
wenzelm@12280
   933
    declared as simp by default;
wenzelm@12587
   934
  - shared operations ("more", "fields", etc.) now need to be always
wenzelm@12587
   935
    qualified) --- potential INCOMPATIBILITY;
wenzelm@12280
   936
  - removed "make_scheme" operations (use "make" with "extend") --
wenzelm@12280
   937
    INCOMPATIBILITY;
wenzelm@11937
   938
  - removed "more" class (simply use "term") -- INCOMPATIBILITY;
wenzelm@12253
   939
  - provides cases/induct rules for use with corresponding Isar
wenzelm@12253
   940
    methods (for concrete records, record schemes, concrete more
wenzelm@12280
   941
    parts, and schematic more parts -- in that order);
wenzelm@11930
   942
  - internal definitions directly based on a light-weight abstract
wenzelm@11930
   943
    theory of product types over typedef rather than datatype;
wenzelm@11930
   944
berghofe@13023
   945
* HOL: generic code generator for generating executable ML code from
berghofe@13023
   946
specifications; specific support for HOL constructs such as inductive
berghofe@13023
   947
datatypes and sets, as well as recursive functions; can be invoked
berghofe@13023
   948
via 'generate_code' theory section;
berghofe@13023
   949
wenzelm@11933
   950
* HOL: canonical cases/induct rules for n-tuples (n = 3..7);
wenzelm@11933
   951
paulson@13824
   952
* HOL: consolidated and renamed several theories.  In particular:
wenzelm@14731
   953
        Ord.thy has been absorbed into HOL.thy
wenzelm@14731
   954
        String.thy has been absorbed into List.thy
wenzelm@14731
   955
wenzelm@11802
   956
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm@11802
   957
(beware of argument permutation!);
wenzelm@11802
   958
wenzelm@11657
   959
* HOL: linorder_less_split superseded by linorder_cases;
wenzelm@11657
   960
wenzelm@12917
   961
* HOL/List: "nodups" renamed to "distinct";
nipkow@12889
   962
wenzelm@11633
   963
* HOL: added "The" definite description operator; move Hilbert's "Eps"
paulson@13824
   964
to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
paulson@13824
   965
  - Ex_def has changed, now need to use some_eq_ex
wenzelm@11437
   966
wenzelm@11572
   967
* HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
wenzelm@11572
   968
in this (rare) case use:
wenzelm@11572
   969
wenzelm@11572
   970
  delSWrapper "split_all_tac"
wenzelm@11572
   971
  addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
wenzelm@11572
   972
wenzelm@11572
   973
* HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
wenzelm@11474
   974
MAY FAIL;
nipkow@11361
   975
wenzelm@11572
   976
* HOL: introduced f^n = f o ... o f; warning: due to the limits of
wenzelm@11572
   977
Isabelle's type classes, ^ on functions and relations has too general
wenzelm@11572
   978
a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
wenzelm@11572
   979
necessary to attach explicit type constraints;
nipkow@11307
   980
wenzelm@12917
   981
* HOL/Relation: the prefix name of the infix "O" has been changed from
wenzelm@12917
   982
"comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
wenzelm@12917
   983
renamed accordingly (eg "compI" -> "rel_compI").
nipkow@12489
   984
wenzelm@11487
   985
* HOL: syntax translations now work properly with numerals and records
wenzelm@11487
   986
expressions;
wenzelm@11474
   987
wenzelm@12457
   988
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm@12457
   989
of "lam" -- INCOMPATIBILITY;
wenzelm@11474
   990
wenzelm@11933
   991
* HOL: got rid of some global declarations (potential INCOMPATIBILITY
wenzelm@11933
   992
for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
wenzelm@11933
   993
renamed "Product_Type.unit";
wenzelm@11611
   994
nipkow@12564
   995
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
nipkow@12564
   996
wenzelm@12924
   997
* HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
wenzelm@12924
   998
the "cases" method);
wenzelm@12924
   999
wenzelm@12597
  1000
* HOL/GroupTheory: group theory examples including Sylow's theorem (by
webertj@15154
  1001
Florian Kammller);
wenzelm@12597
  1002
wenzelm@12608
  1003
* HOL/IMP: updated and converted to new-style theory format; several
wenzelm@12608
  1004
parts turned into readable document, with proper Isar proof texts and
wenzelm@12608
  1005
some explanations (by Gerwin Klein);
wenzelm@12597
  1006
wenzelm@12734
  1007
* HOL-Real: added Complex_Numbers (by Gertrud Bauer);
wenzelm@12734
  1008
wenzelm@12690
  1009
* HOL-Hyperreal is now a logic image;
wenzelm@12690
  1010
wenzelm@11611
  1011
wenzelm@12022
  1012
*** HOLCF ***
wenzelm@12022
  1013
wenzelm@12622
  1014
* Isar: consts/constdefs supports mixfix syntax for continuous
wenzelm@12622
  1015
operations;
wenzelm@12622
  1016
wenzelm@12622
  1017
* Isar: domain package adapted to new-style theory format, e.g. see
wenzelm@12622
  1018
HOLCF/ex/Dnat.thy;
wenzelm@12622
  1019
wenzelm@12622
  1020
* theory Lift: proper use of rep_datatype lift instead of ML hacks --
wenzelm@12280
  1021
potential INCOMPATIBILITY; now use plain induct_tac instead of former
wenzelm@12280
  1022
lift.induct_tac, always use UU instead of Undef;
wenzelm@12022
  1023
wenzelm@12597
  1024
* HOLCF/IMP: updated and converted to new-style theory;
wenzelm@12597
  1025
wenzelm@12022
  1026
wenzelm@11474
  1027
*** ZF ***
wenzelm@11474
  1028
wenzelm@12622
  1029
* Isar: proper integration of logic-specific tools and packages,
wenzelm@12622
  1030
including theory commands '(co)inductive', '(co)datatype',
wenzelm@12622
  1031
'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
wenzelm@12622
  1032
'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
wenzelm@12622
  1033
wenzelm@12622
  1034
* theory Main no longer includes AC; for the Axiom of Choice, base
wenzelm@12622
  1035
your theory on Main_ZFC;
wenzelm@12622
  1036
wenzelm@12622
  1037
* the integer library now covers quotients and remainders, with many
wenzelm@12622
  1038
laws relating division to addition, multiplication, etc.;
paulson@12563
  1039
wenzelm@12280
  1040
* ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
wenzelm@12280
  1041
typeless version of the formalism;
wenzelm@12280
  1042
wenzelm@13025
  1043
* ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
wenzelm@13025
  1044
format;
wenzelm@12608
  1045
wenzelm@12280
  1046
* ZF/Induct: new directory for examples of inductive definitions,
wenzelm@12608
  1047
including theory Multiset for multiset orderings; converted to
wenzelm@12608
  1048
new-style theory format;
wenzelm@12177
  1049
wenzelm@13025
  1050
* ZF: many new theorems about lists, ordinals, etc.;
paulson@12850
  1051
wenzelm@11474
  1052
wenzelm@11474
  1053
*** General ***
wenzelm@11474
  1054
wenzelm@12280
  1055
* Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
wenzelm@12280
  1056
variable proof controls level of detail: 0 = no proofs (only oracle
wenzelm@12280
  1057
dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
wenzelm@12280
  1058
also ref manual for further ML interfaces;
wenzelm@12280
  1059
wenzelm@12280
  1060
* Pure/axclass: removed obsolete ML interface
wenzelm@12280
  1061
goal_subclass/goal_arity;
wenzelm@12280
  1062
wenzelm@12280
  1063
* Pure/syntax: new token syntax "num" for plain numerals (without "#"
wenzelm@12280
  1064
of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
wenzelm@12280
  1065
separate tokens, so expressions involving minus need to be spaced
wenzelm@12280
  1066
properly;
wenzelm@12280
  1067
wenzelm@12312
  1068
* Pure/syntax: support non-oriented infixes, using keyword "infix"
wenzelm@12312
  1069
rather than "infixl" or "infixr";
wenzelm@12312
  1070
wenzelm@12312
  1071
* Pure/syntax: concrete syntax for dummy type variables admits genuine
wenzelm@12312
  1072
sort constraint specifications in type inference; e.g. "x::_::foo"
wenzelm@12312
  1073
ensures that the type of "x" is of sort "foo" (but not necessarily a
wenzelm@12312
  1074
type variable);
wenzelm@12280
  1075
wenzelm@12280
  1076
* Pure/syntax: print modes "type_brackets" and "no_type_brackets"
wenzelm@12280
  1077
control output of nested => (types); the default behavior is
wenzelm@12280
  1078
"type_brackets";
wenzelm@12280
  1079
wenzelm@12280
  1080
* Pure/syntax: builtin parse translation for "_constify" turns valued
wenzelm@11817
  1081
tokens into AST constants;
wenzelm@11474
  1082
wenzelm@12280
  1083
* Pure/syntax: prefer later declarations of translations and print
wenzelm@12280
  1084
translation functions; potential INCOMPATIBILITY: need to reverse
wenzelm@12280
  1085
multiple declarations for same syntax element constant;
wenzelm@12280
  1086
wenzelm@12832
  1087
* Pure/show_hyps reset by default (in accordance to existing Isar
wenzelm@12832
  1088
practice);
wenzelm@12832
  1089
wenzelm@12280
  1090
* Provers/classical: renamed addaltern to addafter, addSaltern to
wenzelm@12280
  1091
addSafter;
wenzelm@12280
  1092
wenzelm@12280
  1093
* Provers/clasimp: ``iff'' declarations now handle conditional rules
wenzelm@12280
  1094
as well;
wenzelm@12253
  1095
wenzelm@12538
  1096
* system: tested support for MacOS X; should be able to get Isabelle +
wenzelm@12538
  1097
Proof General to work in a plain Terminal after installing Poly/ML
wenzelm@12538
  1098
(e.g. from the Isabelle distribution area) and GNU bash alone
wenzelm@12538
  1099
(e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
wenzelm@12538
  1100
support requires further installations, e.g. from
wenzelm@12538
  1101
http://fink.sourceforge.net/);
wenzelm@12538
  1102
wenzelm@12280
  1103
* system: support Poly/ML 4.1.1 (able to manage larger heaps);
wenzelm@11551
  1104
wenzelm@12753
  1105
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm@12753
  1106
of 40 MB), cf. ML_OPTIONS;
wenzelm@12753
  1107
wenzelm@11633
  1108
* system: Proof General keywords specification is now part of the
wenzelm@11633
  1109
Isabelle distribution (see etc/isar-keywords.el);
wenzelm@11633
  1110
wenzelm@12728
  1111
* system: support for persistent Proof General sessions (refrain from
wenzelm@12728
  1112
outdating all loaded theories on startup); user may create writable
wenzelm@12728
  1113
logic images like this: ``isabelle -q HOL Test'';
wenzelm@12597
  1114
wenzelm@11551
  1115
* system: smart selection of Isabelle process versus Isabelle
wenzelm@11572
  1116
interface, accommodates case-insensitive file systems (e.g. HFS+); may
wenzelm@11572
  1117
run both "isabelle" and "Isabelle" even if file names are badly
wenzelm@11572
  1118
damaged (executable inspects the case of the first letter of its own
wenzelm@11572
  1119
name); added separate "isabelle-process" and "isabelle-interface";
wenzelm@11551
  1120
wenzelm@12472
  1121
* system: refrain from any attempt at filtering input streams; no
wenzelm@12472
  1122
longer support ``8bit'' encoding of old isabelle font, instead proper
wenzelm@12472
  1123
iso-latin characters may now be used; the related isatools
wenzelm@12472
  1124
"symbolinput" and "nonascii" have disappeared as well;
wenzelm@12472
  1125
wenzelm@12472
  1126
* system: removed old "xterm" interface (the print modes "xterm" and
wenzelm@12472
  1127
"xterm_color" are still available for direct use in a suitable
wenzelm@12472
  1128
terminal);
wenzelm@12472
  1129
paulson@11314
  1130
oheimb@11169
  1131
wenzelm@11062
  1132
New in Isabelle99-2 (February 2001)
wenzelm@11062
  1133
-----------------------------------
wenzelm@11062
  1134
nipkow@10224
  1135
*** Overview of INCOMPATIBILITIES ***
nipkow@10224
  1136
paulson@11241
  1137
* HOL: please note that theories in the Library and elsewhere often use the
paulson@11241
  1138
new-style (Isar) format; to refer to their theorems in an ML script you must
wenzelm@12622
  1139
bind them to ML identifers by e.g.      val thm_name = thm "thm_name";
paulson@11241
  1140
wenzelm@11043
  1141
* HOL: inductive package no longer splits induction rule aggressively,
wenzelm@11043
  1142
but only as far as specified by the introductions given; the old
oheimb@11130
  1143
format may be recovered via ML function complete_split_rule or attribute
wenzelm@11043
  1144
'split_rule (complete)';
wenzelm@11043
  1145
wenzelm@10998
  1146
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
wenzelm@10998
  1147
gfp_Tarski to gfp_unfold;
nipkow@10224
  1148
paulson@10288
  1149
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
paulson@10288
  1150
wenzelm@10858
  1151
* HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
wenzelm@10858
  1152
relation); infix "^^" has been renamed "``"; infix "``" has been
wenzelm@10858
  1153
renamed "`"; "univalent" has been renamed "single_valued";
nipkow@10793
  1154
wenzelm@10998
  1155
* HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
wenzelm@10998
  1156
operation;
wenzelm@10998
  1157
nipkow@10868
  1158
* HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
nipkow@10856
  1159
wenzelm@10391
  1160
* Isar: 'obtain' no longer declares "that" fact as simp/intro;
wenzelm@10391
  1161
wenzelm@10401
  1162
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm@10401
  1163
consequence, it is no longer monotonic wrt. the local goal context
wenzelm@10401
  1164
(which is now passed through the inductive cases);
wenzelm@10401
  1165
wenzelm@10976
  1166
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm@10976
  1167
\<gg> to \<ggreater>;
wenzelm@10976
  1168
nipkow@10224
  1169
wenzelm@10245
  1170
*** Document preparation ***
wenzelm@10245
  1171
wenzelm@10858
  1172
* \isabellestyle{NAME} selects version of Isabelle output (currently
wenzelm@10858
  1173
available: are "it" for near math-mode best-style output, "sl" for
wenzelm@10858
  1174
slanted text style, and "tt" for plain type-writer; if no
wenzelm@10858
  1175
\isabellestyle command is given, output is according to slanted
wenzelm@10858
  1176
type-writer);
wenzelm@10858
  1177
wenzelm@10322
  1178
* support sub/super scripts (for single symbols only), input syntax is
wenzelm@10322
  1179
like this: "A\<^sup>*" or "A\<^sup>\<star>";
wenzelm@10322
  1180
wenzelm@10858
  1181
* some more standard symbols; see Appendix A of the system manual for
wenzelm@11062
  1182
the complete list of symbols defined in isabellesym.sty;
wenzelm@10858
  1183
wenzelm@10998
  1184
* improved isabelle style files; more abstract symbol implementation
wenzelm@10998
  1185
(should now use \isamath{...} and \isatext{...} in custom symbol
wenzelm@10998
  1186
definitions);
wenzelm@10998
  1187
wenzelm@10634
  1188
* antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
wenzelm@10634
  1189
state; Note that presentation of goal states does not conform to
wenzelm@10634
  1190
actual human-readable proof documents.  Please do not include goal
wenzelm@10634
  1191
states into document output unless you really know what you are doing!
wenzelm@10322
  1192
wenzelm@11062
  1193
* proper indentation of antiquoted output with proportional LaTeX
wenzelm@11062
  1194
fonts;
wenzelm@10862
  1195
wenzelm@11050
  1196
* no_document ML operator temporarily disables LaTeX document
wenzelm@11050
  1197
generation;
wenzelm@11050
  1198
wenzelm@11062
  1199
* isatool unsymbolize tunes sources for plain ASCII communication;
wenzelm@11062
  1200
wenzelm@10322
  1201
wenzelm@10306
  1202
*** Isar ***
wenzelm@10306
  1203
wenzelm@10547
  1204
* Pure: Isar now suffers initial goal statements to contain unbound
wenzelm@10547
  1205
schematic variables (this does not conform to actual readable proof
wenzelm@10547
  1206
documents, due to unpredictable outcome and non-compositional proof
wenzelm@10547
  1207
checking); users who know what they are doing may use schematic goals
wenzelm@10547
  1208
for Prolog-style synthesis of proven results;
wenzelm@10547
  1209
wenzelm@10391
  1210
* Pure: assumption method (an implicit finishing) now handles actual
wenzelm@10391
  1211
rules as well;
wenzelm@10391
  1212
wenzelm@10391
  1213
* Pure: improved 'obtain' --- moved to Pure, insert "that" into
wenzelm@10391
  1214
initial goal, declare "that" only as Pure intro (only for single
wenzelm@10391
  1215
steps); the "that" rule assumption may now be involved in implicit
wenzelm@10391
  1216
finishing, thus ".." becomes a feasible for trivial obtains;
wenzelm@10391
  1217
wenzelm@10391
  1218
* Pure: default proof step now includes 'intro_classes'; thus trivial
wenzelm@10391
  1219
instance proofs may be performed by "..";
wenzelm@10391
  1220
wenzelm@10391
  1221
* Pure: ?thesis / ?this / "..." now work for pure meta-level
wenzelm@10391
  1222
statements as well;
wenzelm@10306
  1223
wenzelm@11097
  1224
* Pure: more robust selection of calculational rules;
wenzelm@11097
  1225
wenzelm@10858
  1226
* Pure: the builtin notion of 'finished' goal now includes the ==-refl
wenzelm@10858
  1227
rule (as well as the assumption rule);
wenzelm@10858
  1228
wenzelm@10858
  1229
* Pure: 'thm_deps' command visualizes dependencies of theorems and
wenzelm@10858
  1230
lemmas, using the graph browser tool;
wenzelm@10858
  1231
wenzelm@10944
  1232
* Pure: predict failure of "show" in interactive mode;
wenzelm@10944
  1233
wenzelm@11016
  1234
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm@11016
  1235
wenzelm@10401
  1236
* HOL: improved method 'induct' --- now handles non-atomic goals
wenzelm@10401
  1237
(potential INCOMPATIBILITY); tuned error handling;
wenzelm@10401
  1238
wenzelm@10557
  1239
* HOL: cases and induct rules now provide explicit hints about the
wenzelm@10547
  1240
number of facts to be consumed (0 for "type" and 1 for "set" rules);
wenzelm@10547
  1241
any remaining facts are inserted into the goal verbatim;
wenzelm@10547
  1242
wenzelm@10858
  1243
* HOL: local contexts (aka cases) may now contain term bindings as
wenzelm@10858
  1244
well; the 'cases' and 'induct' methods new provide a ?case binding for
wenzelm@10858
  1245
the result to be shown in each case;
wenzelm@10858
  1246
wenzelm@10770
  1247
* HOL: added 'recdef_tc' command;
wenzelm@10770
  1248
wenzelm@11016
  1249
* isatool convert assists in eliminating legacy ML scripts;
wenzelm@11016
  1250
wenzelm@10306
  1251
wenzelm@10245
  1252
*** HOL ***
wenzelm@10245
  1253
wenzelm@10245
  1254
* HOL/Library: a collection of generic theories to be used together
wenzelm@10245
  1255
with main HOL; the theory loader path already includes this directory
wenzelm@10245
  1256
by default; the following existing theories have been moved here:
wenzelm@10245
  1257
HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
wenzelm@10337
  1258
(as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
wenzelm@10245
  1259
wenzelm@10966
  1260
* HOL/Unix: "Some aspects of Unix file-system security", a typical
wenzelm@10966
  1261
modelling and verification task performed in Isabelle/HOL +
wenzelm@10966
  1262
Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
wenzelm@10966
  1263
wenzelm@11094
  1264
* HOL/Algebra: special summation operator SUM no longer exists, it has
wenzelm@11094
  1265
been replaced by setsum; infix 'assoc' now has priority 50 (like
wenzelm@11094
  1266
'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
wenzelm@11094
  1267
'domain', this makes the theory consistent with mathematical
wenzelm@11094
  1268
literature;
wenzelm@11094
  1269
wenzelm@10514
  1270
* HOL basics: added overloaded operations "inverse" and "divide"
wenzelm@10726
  1271
(infix "/"), syntax for generic "abs" operation, generic summation
wenzelm@11094
  1272
operator \<Sum>;
wenzelm@10452
  1273
wenzelm@10391
  1274
* HOL/typedef: simplified package, provide more useful rules (see also
wenzelm@10391
  1275
HOL/subset.thy);
wenzelm@10391
  1276
wenzelm@10915
  1277
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm@10915
  1278
now expressed as a proper nested rule (old-style tactic scripts may
wenzelm@10915
  1279
require atomize_strip_tac to cope with non-atomic premises);
wenzelm@10915
  1280
wenzelm@10915
  1281
* HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
wenzelm@10915
  1282
to "split_conv" (old name still available for compatibility);
wenzelm@10915
  1283
wenzelm@10915
  1284
* HOL: improved concrete syntax for strings (e.g. allows translation
wenzelm@10915
  1285
rules with string literals);
wenzelm@10915
  1286
paulson@12245
  1287
* HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
paulson@12245
  1288
 and Fleuriot's mechanization of analysis, including the transcendental
paulson@12245
  1289
 functions for the reals;
paulson@10756
  1290
wenzelm@11094
  1291
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
wenzelm@10391
  1292
wenzelm@10858
  1293
paulson@10474
  1294
*** CTT ***
paulson@10474
  1295
wenzelm@10547
  1296
* CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
wenzelm@10547
  1297
"lam" is displayed as TWO lambda-symbols
paulson@10474
  1298
wenzelm@10547
  1299
* CTT: theory Main now available, containing everything (that is, Bool
wenzelm@10547
  1300
and Arith);
wenzelm@10547
  1301
paulson@10474
  1302
wenzelm@10391
  1303
*** General ***
wenzelm@10391
  1304
wenzelm@10547
  1305
* Pure: the Simplifier has been implemented properly as a derived rule
wenzelm@10547
  1306
outside of the actual kernel (at last!); the overall performance
wenzelm@10547
  1307
penalty in practical applications is about 50%, while reliability of
wenzelm@10547
  1308
the Isabelle inference kernel has been greatly improved;
wenzelm@10547
  1309
wenzelm@11112
  1310
* print modes "brackets" and "no_brackets" control output of nested =>
wenzelm@11112
  1311
(types) and ==> (props); the default behaviour is "brackets";
wenzelm@11112
  1312
wenzelm@10391
  1313
* Provers: fast_tac (and friends) now handle actual object-logic rules
wenzelm@10391
  1314
as assumptions as well;
wenzelm@10391
  1315
wenzelm@11124
  1316
* system: support Poly/ML 4.0;
wenzelm@11124
  1317
wenzelm@11124
  1318
* system: isatool install handles KDE version 1 or 2;
wenzelm@11124
  1319
wenzelm@10391
  1320
wenzelm@10245
  1321
wenzelm@10103
  1322
New in Isabelle99-1 (October 2000)
wenzelm@10103
  1323
----------------------------------
wenzelm@8015
  1324
wenzelm@10003
  1325
*** Overview of INCOMPATIBILITIES ***
paulson@8014
  1326
wenzelm@8848
  1327
* HOL: simplification of natural numbers is much changed; to partly
wenzelm@8848
  1328
recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
wenzelm@8848
  1329
issue the following ML commands:
wenzelm@8848
  1330
wenzelm@8848
  1331
  Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
wenzelm@8848
  1332
  Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
paulson@8788
  1333
wenzelm@10129
  1334
* HOL: simplification no longer dives into case-expressions; this is
wenzelm@10129
  1335
controlled by "t.weak_case_cong" for each datatype t;
wenzelm@10003
  1336
wenzelm@10003
  1337
* HOL: nat_less_induct renamed to less_induct;
wenzelm@10003
  1338
wenzelm@10003
  1339
* HOL: systematic renaming of the SOME (Eps) rules, may use isatool
wenzelm@10003
  1340
fixsome to patch .thy and .ML sources automatically;
paulson@8967
  1341
wenzelm@10003
  1342
  select_equality  -> some_equality
wenzelm@10003
  1343
  select_eq_Ex     -> some_eq_ex
wenzelm@10003
  1344
  selectI2EX       -> someI2_ex
wenzelm@10003
  1345
  selectI2         -> someI2
wenzelm@10003
  1346
  selectI          -> someI
wenzelm@10003
  1347
  select1_equality -> some1_equality
wenzelm@10003
  1348
  Eps_sym_eq       -> some_sym_eq_trivial
wenzelm@10003
  1349
  Eps_eq           -> some_eq_trivial
wenzelm@10003
  1350
wenzelm@10003
  1351
* HOL: exhaust_tac on datatypes superceded by new generic case_tac;
wenzelm@10003
  1352
wenzelm@10003
  1353
* HOL: removed obsolete theorem binding expand_if (refer to split_if
wenzelm@10003
  1354
instead);
wenzelm@10003
  1355
wenzelm@10003
  1356
* HOL: the recursion equations generated by 'recdef' are now called
wenzelm@10003
  1357
f.simps instead of f.rules;
wenzelm@10003
  1358
wenzelm@10003
  1359
* HOL: qed_spec_mp now also handles bounded ALL as well;
wenzelm@10003
  1360
wenzelm@10003
  1361
* HOL: 0 is now overloaded, so the type constraint ":: nat" may
wenzelm@10003
  1362
sometimes be needed;
wenzelm@10003
  1363
wenzelm@10003
  1364
* HOL: the constant for "f``x" is now "image" rather than "op ``";
paulson@8014
  1365
paulson@10065
  1366
* HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
paulson@10065
  1367
wenzelm@9330
  1368
* HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
wenzelm@9330
  1369
product is now "<*>" instead of "Times"; the lexicographic product is
wenzelm@9330
  1370
now "<*lex*>" instead of "**";
nipkow@8705
  1371
wenzelm@10003
  1372
* HOL: theory Sexp is now in HOL/Induct examples (it used to be part
wenzelm@10003
  1373
of main HOL, but was unused); better use HOL's datatype package;
paulson@9971
  1374
wenzelm@10137
  1375
* HOL: removed "symbols" syntax for constant "override" of theory Map;
wenzelm@10137
  1376
the old syntax may be recovered as follows:
wenzelm@10137
  1377
wenzelm@10137
  1378
  syntax (symbols)
wenzelm@10137
  1379
    override  :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
wenzelm@10137
  1380
      (infixl "\\<oplus>" 100)
wenzelm@10137
  1381
wenzelm@8848
  1382
* HOL/Real: "rabs" replaced by overloaded "abs" function;
wenzelm@8848
  1383
wenzelm@8887
  1384
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm@8887
  1385
Lfp, Gfp, WF); this only affects ML packages that refer to const names
wenzelm@8887
  1386
internally;
wenzelm@8887
  1387
wenzelm@10003
  1388
* HOL and ZF: syntax for quotienting wrt an equivalence relation
wenzelm@10003
  1389
changed from A/r to A//r;
wenzelm@9908
  1390
wenzelm@10003
  1391
* ZF: new treatment of arithmetic (nat & int) may break some old
wenzelm@10003
  1392
proofs;
wenzelm@8921
  1393
wenzelm@10003
  1394
* Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
wenzelm@10003
  1395
rulify -> rule_format, elimify -> elim_format, ...);
paulson@9542
  1396
wenzelm@9941
  1397
* Isar/Provers: intro/elim/dest attributes changed; renamed
wenzelm@9941
  1398
intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
wenzelm@9937
  1399
should have to change intro!! to intro? only); replaced "delrule" by
wenzelm@9937
  1400
"rule del";
wenzelm@9437
  1401
wenzelm@9612
  1402
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
wenzelm@9612
  1403
wenzelm@9437
  1404
* Provers: strengthened force_tac by using new first_best_tac;
oheimb@9402
  1405
wenzelm@10003
  1406
* LaTeX document preparation: several changes of isabelle.sty (see
wenzelm@10003
  1407
lib/texinputs);
wenzelm@8729
  1408
paulson@8014
  1409
wenzelm@8487
  1410
*** Document preparation ***
wenzelm@8358
  1411
wenzelm@9198
  1412
* formal comments (text blocks etc.) in new-style theories may now
wenzelm@9753
  1413
contain antiquotations of thm/prop/term/typ/text to be presented
wenzelm@9753
  1414
according to latex print mode; concrete syntax is like this:
wenzelm@9753
  1415
@{term[show_types] "f(x) = a + x"};
wenzelm@9198
  1416
wenzelm@8358
  1417
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm@8518
  1418
including proper document sources;
wenzelm@8358
  1419
wenzelm@8358
  1420
* generated LaTeX sources are now deleted after successful run
wenzelm@8358
  1421
(isatool document -c); may retain a copy somewhere else via -D option
wenzelm@8358
  1422
of isatool usedir;
wenzelm@8358
  1423
wenzelm@8566
  1424
* isatool usedir -D now lets isatool latex -o sty update the Isabelle
wenzelm@10003
  1425
style files, achieving self-contained LaTeX sources and simplifying
wenzelm@10003
  1426
LaTeX debugging;
wenzelm@8566
  1427
wenzelm@8518
  1428
* old-style theories now produce (crude) LaTeX output as well;
wenzelm@8358
  1429
wenzelm@9057
  1430
* browser info session directories are now self-contained (may be put
wenzelm@9437
  1431
on WWW server seperately); improved graphs of nested sessions; removed
wenzelm@9437
  1432
graph for 'all sessions';
wenzelm@9057
  1433
wenzelm@10003
  1434
* several improvements in isabelle style files; \isabellestyle{it}
wenzelm@10003
  1435
produces fake math mode output; \isamarkupheader is now \section by
wenzelm@10003
  1436
default; see lib/texinputs/isabelle.sty etc.;
wenzelm@9489
  1437
wenzelm@8358
  1438
wenzelm@8184
  1439
*** Isar ***
wenzelm@8184
  1440
wenzelm@10003
  1441
* Isar/Pure: local results and corresponding term bindings are now
wenzelm@10003
  1442
subject to Hindley-Milner polymorphism (similar to ML); this
wenzelm@10003
  1443
accommodates incremental type-inference very nicely;
wenzelm@8283
  1444
wenzelm@10003
  1445
* Isar/Pure: new derived language element 'obtain' supports
wenzelm@10003
  1446
generalized existence reasoning;
wenzelm@8621
  1447
wenzelm@10003
  1448
* Isar/Pure: new calculational elements 'moreover' and 'ultimately'
wenzelm@10003
  1449
support accumulation of results, without applying any rules yet;
wenzelm@10003
  1450
useful to collect intermediate results without explicit name
wenzelm@10003
  1451
references, and for use with transitivity rules with more than 2
wenzelm@10003
  1452
premises;
wenzelm@8184
  1453
wenzelm@10003
  1454
* Isar/Pure: scalable support for case-analysis type proofs: new
wenzelm@10003
  1455
'case' language element refers to local contexts symbolically, as
wenzelm@10003
  1456
produced by certain proof methods; internally, case names are attached
wenzelm@10003
  1457
to theorems as "tags";
wenzelm@8440
  1458
wenzelm@10003
  1459
* Isar/Pure: theory command 'hide' removes declarations from
wenzelm@9330
  1460
class/type/const name spaces;
wenzelm@9330
  1461
wenzelm@10003
  1462
* Isar/Pure: theory command 'defs' supports option "(overloaded)" to
wenzelm@9330
  1463
indicate potential overloading;
wenzelm@9330
  1464
wenzelm@10003
  1465
* Isar/Pure: changed syntax of local blocks from {{ }} to { };
wenzelm@8621
  1466
wenzelm@10003
  1467
* Isar/Pure: syntax of sorts made 'inner', i.e. have to write
wenzelm@10003
  1468
"{a,b,c}" instead of {a,b,c};
wenzelm@9011
  1469
wenzelm@10003
  1470
* Isar/Pure now provides its own version of intro/elim/dest
wenzelm@10003
  1471
attributes; useful for building new logics, but beware of confusion
wenzelm@10003
  1472
with the version in Provers/classical;
wenzelm@9612
  1473
wenzelm@10003
  1474
* Isar/Pure: the local context of (non-atomic) goals is provided via
wenzelm@10003
  1475
case name 'antecedent';
wenzelm@8440
  1476
wenzelm@10003
  1477
* Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
wenzelm@10003
  1478
to the current context is now done automatically);
wenzelm@9383
  1479
wenzelm@10003
  1480
* Isar/Pure: theory command 'method_setup' provides a simple interface
wenzelm@10003
  1481
for definining proof methods in ML;
wenzelm@9612
  1482
wenzelm@10003
  1483
* Isar/Provers: intro/elim/dest attributes changed; renamed
wenzelm@9941
  1484
intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
wenzelm@9941
  1485
most cases, one should have to change intro!! to intro? only);
wenzelm@9941
  1486
replaced "delrule" by "rule del";
wenzelm@8283
  1487
wenzelm@10003
  1488
* Isar/Provers: new 'hypsubst' method, plain 'subst' method and
wenzelm@10003
  1489
'symmetric' attribute (the latter supercedes [RS sym]);
wenzelm@10003
  1490
wenzelm@10003
  1491
* Isar/Provers: splitter support (via 'split' attribute and 'simp'
wenzelm@10003
  1492
method modifier); 'simp' method: 'only:' modifier removes loopers as
wenzelm@10003
  1493
well (including splits);
wenzelm@10003
  1494
wenzelm@10003
  1495
* Isar/Provers: Simplifier and Classical methods now support all kind
wenzelm@10003
  1496
of modifiers used in the past, including 'cong', 'iff', etc.
wenzelm@10003
  1497
wenzelm@10003
  1498
* Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
wenzelm@10003
  1499
of Simplifier and Classical reasoner);
wenzelm@10003
  1500
wenzelm@10003
  1501
* Isar/HOL: new proof method 'cases' and improved version of 'induct'
wenzelm@10003
  1502
now support named cases; major packages (inductive, datatype, primrec,
wenzelm@10003
  1503
recdef) support case names and properly name parameters;
wenzelm@9612
  1504
wenzelm@10003
  1505
* Isar/HOL: new transitivity rules for substitution in inequalities --
wenzelm@10003
  1506
monotonicity conditions are extracted to be proven at end of
wenzelm@10003
  1507
calculations;
wenzelm@10003
  1508
wenzelm@10003
  1509
* Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
wenzelm@10003
  1510
method anyway;
wenzelm@10003
  1511
wenzelm@10003
  1512
* Isar/HOL: removed old expand_if = split_if; theorems if_splits =
wenzelm@10003
  1513
split_if split_if_asm; datatype package provides theorems foo.splits =
wenzelm@10003
  1514
foo.split foo.split_asm for each datatype;
wenzelm@10003
  1515
wenzelm@10003
  1516
* Isar/HOL: tuned inductive package, rename "intrs" to "intros"
wenzelm@10003
  1517
(potential INCOMPATIBILITY), emulation of mk_cases feature for proof
wenzelm@10003
  1518
scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
wenzelm@10003
  1519
use "(cases (simplified))" method in proper proof texts);
wenzelm@10003
  1520
wenzelm@10003
  1521
* Isar/HOL: added global 'arith_split' attribute for 'arith' method;
wenzelm@10003
  1522
wenzelm@10003
  1523
* Isar: names of theorems etc. may be natural numbers as well;
wenzelm@10003
  1524
wenzelm@10003
  1525
* Isar: 'pr' command: optional arguments for goals_limit and
wenzelm@9724
  1526
ProofContext.prems_limit; no longer prints theory contexts, but only
wenzelm@9724
  1527
proof states;
wenzelm@8487
  1528
wenzelm@10003
  1529
* Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
wenzelm@8518
  1530
additional print modes to be specified; e.g. "pr(latex)" will print
wenzelm@8518
  1531
proof state according to the Isabelle LaTeX style;
wenzelm@8487
  1532
wenzelm@10003
  1533
* Isar: improved support for emulating tactic scripts, including proof
wenzelm@9612
  1534
methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
wenzelm@9612
  1535
'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
wenzelm@9612
  1536
(for HOL datatypes);
wenzelm@8534
  1537
wenzelm@10003
  1538
* Isar: simplified (more robust) goal selection of proof methods: 1st
wenzelm@10003
  1539
goal, all goals, or explicit goal specifier (tactic emulation); thus
wenzelm@10003
  1540
'proof method scripts' have to be in depth-first order;
wenzelm@8673
  1541
wenzelm@10003
  1542
* Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
wenzelm@8729
  1543
wenzelm@10003
  1544
* Isar: removed 'help' command, which hasn't been too helpful anyway;
wenzelm@10003
  1545
should instead use individual commands for printing items
wenzelm@10003
  1546
(print_commands, print_methods etc.);
wenzelm@9224
  1547
wenzelm@10003
  1548
* Isar: added 'nothing' --- the empty list of theorems;
wenzelm@9239
  1549
wenzelm@8184
  1550
paulson@8014
  1551
*** HOL ***
paulson@8014
  1552
wenzelm@10080
  1553
* HOL/MicroJava: formalization of a fragment of Java, together with a
wenzelm@10080
  1554
corresponding virtual machine and a specification of its bytecode
wenzelm@10080
  1555
verifier and a lightweight bytecode verifier, including proofs of
wenzelm@10080
  1556
type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
wenzelm@10080
  1557
Cornelia Pusch (see also the homepage of project Bali at
wenzelm@10080
  1558
http://isabelle.in.tum.de/Bali/);
wenzelm@10080
  1559
wenzelm@8518
  1560
* HOL/Algebra: new theory of rings and univariate polynomials, by
wenzelm@8518
  1561
Clemens Ballarin;
paulson@8014
  1562
wenzelm@10157
  1563
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
wenzelm@10003
  1564
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
wenzelm@10003
  1565
Rasmussen;
wenzelm@8570
  1566
wenzelm@10157
  1567
* HOL/Lattice: fundamental concepts of lattice theory and order
wenzelm@10157
  1568
structures, including duals, properties of bounds versus algebraic
wenzelm@10157
  1569
laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
wenzelm@10157
  1570
Theorem for complete lattices etc.; may also serve as a demonstration
wenzelm@10157
  1571
for abstract algebraic reasoning using axiomatic type classes, and
wenzelm@10157
  1572
mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
wenzelm@10157
  1573
wenzelm@10003
  1574
* HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
wenzelm@10003
  1575
von Oheimb;
paulson@9542
  1576
wenzelm@10164
  1577
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm@10164
  1578
recursive procedures, by David von Oheimb;
wenzelm@10164
  1579
wenzelm@10003
  1580
* HOL/Lambda: converted into new-style theory and document;
paulson@9542
  1581
wenzelm@10003
  1582
* HOL/ex/Multiquote: example of multiple nested quotations and
wenzelm@10003
  1583
anti-quotations -- basically a generalized version of de-Bruijn
wenzelm@10003
  1584
representation; very useful in avoiding lifting of operations;
wenzelm@8848
  1585
wenzelm@9612
  1586
* HOL/record: added general record equality rule to simpset; fixed
wenzelm@9612
  1587
select-update simplification procedure to handle extended records as
wenzelm@9612
  1588
well; admit "r" as field name;
paulson@9542
  1589
paulson@8967
  1590
* HOL: 0 is now overloaded over the new sort "zero", allowing its use with
paulson@8967
  1591
other numeric types and also as the identity of groups, rings, etc.;
paulson@8967
  1592
paulson@8967
  1593
* HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
paulson@8967
  1594
Types nat and int belong to this axclass;
paulson@8967
  1595
wenzelm@10003
  1596
* HOL: greatly improved simplification involving numerals of type nat, int, real:
paulson@8788
  1597
   (i + #8 + j) = Suc k simplifies to  #7 + (i + j) = k
paulson@8832
  1598
   i*j + k + j*#3*i     simplifies to  #4*(i*j) + k
paulson@8832
  1599
  two terms #m*u and #n*u are replaced by #(m+n)*u
paulson@8832
  1600
    (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
paulson@8832
  1601
  and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
paulson@8832
  1602
    or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
paulson@8736
  1603
wenzelm@10003
  1604
* HOL: meson_tac is available (previously in ex/meson.ML); it is a
wenzelm@10003
  1605
powerful prover for predicate logic but knows nothing of clasets; see
wenzelm@10003
  1606
ex/mesontest.ML and ex/mesontest2.ML for example applications;
paulson@9835
  1607
wenzelm@8848
  1608
* HOL: new version of "case_tac" subsumes both boolean case split and
wenzelm@8440
  1609
"exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
wenzelm@8518
  1610
exists, may define val exhaust_tac = case_tac for ad-hoc portability;
wenzelm@8440
  1611
wenzelm@8848
  1612
* HOL: simplification no longer dives into case-expressions: only the
wenzelm@10129
  1613
selector expression is simplified, but not the remaining arms; to
wenzelm@10129
  1614
enable full simplification of case-expressions for datatype t, you may
wenzelm@10129
  1615
remove t.weak_case_cong from the simpset, either globally (Delcongs
wenzelm@10129
  1616
[thm"t.weak_case_cong"];) or locally (delcongs [...]).
nipkow@8603
  1617
wenzelm@8848
  1618
* HOL/recdef: the recursion equations generated by 'recdef' for
wenzelm@8848
  1619
function 'f' are now called f.simps instead of f.rules; if all
wenzelm@8848
  1620
termination conditions are proved automatically, these simplification
wenzelm@8848
  1621
rules are added to the simpset, as in primrec; rules may be named
wenzelm@8848
  1622
individually as well, resulting in a separate list of theorems for
wenzelm@8848
  1623
each equation;
wenzelm@8848
  1624
wenzelm@9489
  1625
* HOL/While is a new theory that provides a while-combinator. It
wenzelm@9489
  1626
permits the definition of tail-recursive functions without the
wenzelm@9489
  1627
provision of a termination measure. The latter is necessary once the
wenzelm@9489
  1628
invariant proof rule for while is applied.
nipkow@9457
  1629
wenzelm@10003
  1630
* HOL: new (overloaded) notation for the set of elements below/above
wenzelm@10003
  1631
some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
nipkow@8925
  1632
wenzelm@8848
  1633
* HOL: theorems impI, allI, ballI bound as "strip";
wenzelm@8848
  1634
wenzelm@10003
  1635
* HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
nipkow@9746
  1636
induct_tac th "x1 ... xn" expects th to have a conclusion of the form
nipkow@9746
  1637
P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
nipkow@9746
  1638
wenzelm@10003
  1639
* HOL/Real: "rabs" replaced by overloaded "abs" function;
nipkow@9737
  1640
wenzelm@10003
  1641
* HOL: theory Sexp now in HOL/Induct examples (it used to be part of
wenzelm@10003
  1642
main HOL, but was unused);
nipkow@8626
  1643
wenzelm@10003
  1644
* HOL: fewer consts declared as global (e.g. have to refer to
wenzelm@10003
  1645
"Lfp.lfp" instead of "lfp" internally; affects ML packages only);
wenzelm@8887
  1646
wenzelm@10003
  1647
* HOL: tuned AST representation of nested pairs, avoiding bogus output
wenzelm@10003
  1648
in case of overlap with user translations (e.g. judgements over
wenzelm@10003
  1649
tuples); (note that the underlying logical represenation is still
wenzelm@10003
  1650
bogus);
wenzelm@9349
  1651
nipkow@8412
  1652
paulson@9542
  1653
*** ZF ***
paulson@9542
  1654
wenzelm@10003
  1655
* ZF: simplification automatically cancels common terms in arithmetic
wenzelm@10003
  1656
expressions over nat and int;
paulson@9542
  1657
wenzelm@10003
  1658
* ZF: new treatment of nat to minimize type-checking: all operators
wenzelm@10003
  1659
coerce their operands to a natural number using the function natify,
wenzelm@10003
  1660
making the algebraic laws unconditional;
paulson@9542
  1661
wenzelm@10003
  1662
* ZF: as above, for int: operators coerce their operands to an integer
wenzelm@10003
  1663
using the function intify;
paulson@9542
  1664
wenzelm@10003
  1665
* ZF: the integer library now contains many of the usual laws for the
wenzelm@10003
  1666
orderings, including $<=, and monotonicity laws for $+ and $*;
paulson@9542
  1667
wenzelm@10003
  1668
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
wenzelm@10003
  1669
simplification;
paulson@9388
  1670
wenzelm@10003
  1671
* FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
wenzelm@10003
  1672
to the simplifier and classical reasoner simultaneously;
paulson@9388
  1673
paulson@9388
  1674
wenzelm@8358
  1675
*** General ***
wenzelm@8358
  1676
wenzelm@10003
  1677
* Provers: blast_tac now handles actual object-logic rules as
wenzelm@10003
  1678
assumptions; note that auto_tac uses blast_tac internally as well;
wenzelm@10003
  1679
wenzelm@10003
  1680
* Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
wenzelm@10003
  1681
outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
wenzelm@10003
  1682
wenzelm@9941
  1683
* Provers: delrules now handles destruct rules as well (no longer need
wenzelm@9941
  1684
explicit make_elim);
wenzelm@9941
  1685
wenzelm@10003
  1686
* Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
wenzelm@10003
  1687
  [| inj ?f;          ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
wenzelm@10003
  1688
use instead the strong form,
wenzelm@10003
  1689
  [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
wenzelm@10003
  1690
in HOL, FOL and ZF the function cla_make_elim will create such rules
wenzelm@10003
  1691
from destruct-rules;
wenzelm@9489
  1692
wenzelm@9709
  1693
* Provers: Simplifier.easy_setup provides a fast path to basic
wenzelm@9709
  1694
Simplifier setup for new object-logics;
wenzelm@9709
  1695
wenzelm@9709
  1696
* Pure: AST translation rules no longer require constant head on LHS;
wenzelm@9349
  1697
wenzelm@9709
  1698
* Pure: improved name spaces: ambiguous output is qualified; support
wenzelm@9709
  1699
for hiding of names;
wenzelm@8729
  1700
wenzelm@10003
  1701
* system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
wenzelm@10003
  1702
XSYMBOL_HOME; no longer need to do manual configuration in most
wenzelm@10003
  1703
situations;
wenzelm@10003
  1704
wenzelm@9709
  1705
* system: compression of ML heaps images may now be controlled via -c
wenzelm@9709
  1706
option of isabelle and isatool usedir (currently only observed by
wenzelm@9709
  1707
Poly/ML);
wenzelm@8358
  1708
wenzelm@9981
  1709
* system: isatool installfonts may handle X-Symbol fonts as well (very
wenzelm@9981
  1710
useful for remote X11);
wenzelm@9981
  1711
wenzelm@9709
  1712
* system: provide TAGS file for Isabelle sources;
wenzelm@9052
  1713
wenzelm@9288
  1714
* ML: infix 'OF' is a version of 'MRS' with more appropriate argument
wenzelm@9288
  1715
order;
wenzelm@9288
  1716
wenzelm@8994
  1717
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
wenzelm@8994
  1718
timing flag supersedes proof_timing and Toplevel.trace;
wenzelm@8994
  1719
wenzelm@10003
  1720
* ML: new combinators |>> and |>>> for incremental transformations
wenzelm@10003
  1721
with secondary results (e.g. certain theory extensions):
wenzelm@10003
  1722
wenzelm@9330
  1723
* ML: PureThy.add_defs gets additional argument to indicate potential
wenzelm@9330
  1724
overloading (usually false);
wenzelm@9330
  1725
wenzelm@10003
  1726
* ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
wenzelm@10003
  1727
results;
wenzelm@8440
  1728
wenzelm@8358
  1729
wenzelm@8015
  1730
wenzelm@7986
  1731
New in Isabelle99 (October 1999)
wenzelm@7986
  1732
--------------------------------
oheimb@4649
  1733
paulson@5931
  1734
*** Overview of INCOMPATIBILITIES (see below for more details) ***
paulson@5931
  1735
paulson@6922
  1736
* HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
paulson@6922
  1737
are no longer simplified.  (This allows the simplifier to unfold recursive
paulson@6922
  1738
functional programs.)  To restore the old behaviour, declare
wenzelm@7215
  1739
wenzelm@7215
  1740
    Delcongs [if_weak_cong];
paulson@6922
  1741
wenzelm@6269
  1742
* HOL: Removed the obsolete syntax "Compl A"; use -A for set
wenzelm@6269
  1743
complement;
paulson@5931
  1744
wenzelm@6269
  1745
* HOL: the predicate "inj" is now defined by translation to "inj_on";
paulson@6174
  1746
berghofe@7847
  1747
* HOL/datatype: mutual_induct_tac no longer exists --
berghofe@7847
  1748
  use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
berghofe@7847
  1749
wenzelm@6386
  1750
* HOL/typedef: fixed type inference for representing set; type
wenzelm@6386
  1751
arguments now have to occur explicitly on the rhs as type constraints;
wenzelm@6386
  1752
wenzelm@6269
  1753
* ZF: The con_defs part of an inductive definition may no longer refer
wenzelm@6269
  1754
to constants declared in the same theory;
nipkow@6057
  1755
wenzelm@6269
  1756
* HOL, ZF: the function mk_cases, generated by the inductive
wenzelm@6269
  1757
definition package, has lost an argument.  To simplify its result, it
wenzelm@6269
  1758
uses the default simpset instead of a supplied list of theorems.
paulson@6141
  1759
wenzelm@7215
  1760
* HOL/List: the constructors of type list are now Nil and Cons;
wenzelm@7215
  1761
nipkow@7619
  1762
* Simplifier: the type of the infix ML functions
wenzelm@8729
  1763
        setSSolver addSSolver setSolver addSolver
nipkow@7619
  1764
is now  simpset * solver -> simpset  where `solver' is a new abstract type
nipkow@7619
  1765
for packaging solvers. A solver is created via
wenzelm@8729
  1766
        mk_solver: string -> (thm list -> int -> tactic) -> solver
nipkow@7619
  1767
where the string argument is only a comment.
nipkow@6057
  1768
wenzelm@7647
  1769
paulson@6069
  1770
*** Proof tools ***
paulson@6069
  1771
wenzelm@6343
  1772
* Provers/Arith/fast_lin_arith.ML contains a functor for creating a
wenzelm@6343
  1773
decision procedure for linear arithmetic. Currently it is used for
wenzelm@7593
  1774
types `nat', `int', and `real' in HOL (see below); it can, should and
wenzelm@7593
  1775
will be instantiated for other types and logics as well.
paulson@6069
  1776
nipkow@7324
  1777
* The simplifier now accepts rewrite rules with flexible heads, eg
nipkow@7324
  1778
     hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
nipkow@7324
  1779
  They are applied like any rule with a non-pattern lhs, i.e. by first-order
nipkow@7324
  1780
  matching.
paulson@6069
  1781
wenzelm@7593
  1782
paulson@6014
  1783
*** General ***
paulson@6014
  1784
wenzelm@7986
  1785
* New Isabelle/Isar subsystem provides an alternative to traditional
wenzelm@7215
  1786
tactical theorem proving; together with the ProofGeneral/isar user
wenzelm@7215
  1787
interface it offers an interactive environment for developing human
wenzelm@7215
  1788
readable proof documents (Isar == Intelligible semi-automated
wenzelm@7886
  1789
reasoning); for further information see isatool doc isar-ref,
wenzelm@7986
  1790
src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
wenzelm@7886
  1791
wenzelm@9612
  1792
* improved and simplified presentation of theories: better HTML markup
wenzelm@9612
  1793
(including colors), graph views in several sizes; isatool usedir now
wenzelm@9612
  1794
provides a proper interface for user theories (via -P option); actual
wenzelm@9612
  1795
document preparation based on (PDF)LaTeX is available as well (for
wenzelm@9612
  1796
new-style theories only); see isatool doc system for more information;
wenzelm@7215
  1797
wenzelm@7252
  1798
* native support for Proof General, both for classic Isabelle and
wenzelm@7986
  1799
Isabelle/Isar;
wenzelm@7215
  1800
wenzelm@7791
  1801
* ML function thm_deps visualizes dependencies of theorems and lemmas,
wenzelm@7791
  1802
using the graph browser tool;
wenzelm@7791
  1803
wenzelm@6751
  1804
* Isabelle manuals now also available as PDF;
wenzelm@6751
  1805
wenzelm@6449
  1806
* theory loader rewritten from scratch (may not be fully
wenzelm@6449
  1807
bug-compatible); old loadpath variable has been replaced by show_path,
wenzelm@6671
  1808
add_path, del_path, reset_path functions; new operations such as
wenzelm@7593
  1809
update_thy, touch_thy, remove_thy, use/update_thy_only (see also
wenzelm@7593
  1810
isatool doc ref);
wenzelm@6449
  1811
wenzelm@7215
  1812
* improved isatool install: option -k creates KDE application icon,
wenzelm@7215
  1813
option -p DIR installs standalone binaries;
wenzelm@7215
  1814
wenzelm@7215
  1815
* added ML_PLATFORM setting (useful for cross-platform installations);
wenzelm@7215
  1816
more robust handling of platform specific ML images for SML/NJ;
wenzelm@7215
  1817
wenzelm@7886
  1818
* the settings environment is now statically scoped, i.e. it is never
wenzelm@7986
  1819
created again in sub-processes invoked from isabelle, isatool, or
wenzelm@7886
  1820
Isabelle;
wenzelm@7886
  1821
wenzelm@7215
  1822
* path element specification '~~' refers to '$ISABELLE_HOME';
wenzelm@7215
  1823
wenzelm@6343
  1824
* in locales, the "assumes" and "defines" parts may be omitted if
wenzelm@6343
  1825
empty;
wenzelm@5973
  1826
wenzelm@6269
  1827
* new print_mode "xsymbols" for extended symbol support (e.g. genuine
wenzelm@6269
  1828
long arrows);
wenzelm@6259
  1829
wenzelm@6343
  1830
* new print_mode "HTML";
wenzelm@6343
  1831
wenzelm@6343
  1832
* new flag show_tags controls display of tags of theorems (which are
wenzelm@6343
  1833
basically just comments that may be attached by some tools);
wenzelm@6343
  1834
wenzelm@6461
  1835
* Isamode 2.6 requires patch to accomodate change of Isabelle font
wenzelm@6461
  1836
mode and goal output format:
wenzelm@6461
  1837
wenzelm@6461
  1838
diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
wenzelm@6461
  1839
244c244
wenzelm@6461
  1840
<       (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
wenzelm@6461
  1841
---
wenzelm@6533
  1842
>       (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
wenzelm@6461
  1843
diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
wenzelm@6461
  1844
181c181
wenzelm@6461
  1845
< (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
wenzelm@6461
  1846
---
wenzelm@6461
  1847
> (defconst proofstate-proofstart-regexp "^Level [0-9]+"
wenzelm@6461
  1848
wenzelm@7450
  1849
* function bind_thms stores lists of theorems (cf. bind_thm);
wenzelm@7450
  1850
wenzelm@7593
  1851
* new shorthand tactics ftac, eatac, datac, fatac;
wenzelm@7593
  1852
wenzelm@7593
  1853
* qed (and friends) now accept "" as result name; in that case the
wenzelm@7986
  1854
theorem is not stored, but proper checks and presentation of the
wenzelm@7986
  1855
result still apply;
wenzelm@7593
  1856
wenzelm@7805
  1857
* theorem database now also indexes constants "Trueprop", "all",
wenzelm@7805
  1858
"==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
wenzelm@7805
  1859
oheimb@6028
  1860
nipkow@6057
  1861
*** HOL ***
nipkow@6057
  1862
wenzelm@7215
  1863
** HOL arithmetic **
wenzelm@7215
  1864
wenzelm@6343
  1865
* There are now decision procedures for linear arithmetic over nat and
wenzelm@6343
  1866
int:
nipkow@6131
  1867
wenzelm@6343
  1868
1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
wenzelm@6343
  1869
`+', `-', `Suc', `min', `max' and numerical constants; other subterms
wenzelm@6343
  1870
are treated as atomic; subformulae not involving type `nat' or `int'
wenzelm@6343
  1871
are ignored; quantified subformulae are ignored unless they are
wenzelm@6343
  1872
positive universal or negative existential. The tactic has to be
wenzelm@6343
  1873
invoked by hand and can be a little bit slow. In particular, the
wenzelm@6343
  1874
running time is exponential in the number of occurrences of `min' and
wenzelm@6343
  1875
`max', and `-' on `nat'.
nipkow@6131
  1876
wenzelm@6343
  1877
2. fast_arith_tac is a cut-down version of arith_tac: it only takes
wenzelm@6343
  1878
(negated) (in)equalities among the premises and the conclusion into
wenzelm@6343
  1879
account (i.e. no compound formulae) and does not know about `min' and
wenzelm@6343
  1880
`max', and `-' on `nat'. It is fast and is used automatically by the
wenzelm@6343
  1881
simplifier.
nipkow@6131
  1882
wenzelm@6343
  1883
NB: At the moment, these decision procedures do not cope with mixed
wenzelm@6343
  1884
nat/int formulae where the two parts interact, such as `m < n ==>
wenzelm@6343
  1885
int(m) < int(n)'.
oheimb@6028
  1886
wenzelm@7215
  1887
* HOL/Numeral provides a generic theory of numerals (encoded
wenzelm@7313
  1888
efficiently as bit strings); setup for types nat/int/real is in place;
wenzelm@7215
  1889
INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
wenzelm@7215
  1890
int, existing theories and proof scripts may require a few additional
wenzelm@7215
  1891
type constraints;
wenzelm@7215
  1892
wenzelm@7215
  1893
* integer division and remainder can now be performed on constant
wenzelm@7215
  1894
arguments;
paulson@7157
  1895
wenzelm@7215
  1896
* many properties of integer multiplication, division and remainder
wenzelm@7215
  1897
are now available;
paulson@6922
  1898
paulson@7287
  1899
* An interface to the Stanford Validity Checker (SVC) is available through the
paulson@7287
  1900
tactic svc_tac.  Propositional tautologies and theorems of linear arithmetic
paulson@7287
  1901
are proved automatically.  SVC must be installed separately, and its results
paulson@7287
  1902
must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
paulson@7287
  1903
invocation of the underlying oracle).  For SVC see
paulson@7444
  1904
  http://verify.stanford.edu/SVC
paulson@6922
  1905
wenzelm@7125
  1906
* IsaMakefile: the HOL-Real target now builds an actual image;
wenzelm@7125
  1907
wenzelm@7215
  1908
wenzelm@7215
  1909
** HOL misc **
wenzelm@7215
  1910
wenzelm@7595
  1911
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
wenzelm@7595
  1912
(in Isabelle/Isar) -- by Gertrud Bauer;
wenzelm@7595
  1913
wenzelm@7691
  1914
* HOL/BCV: generic model of bytecode verification, i.e. data-flow
wenzelm@7691
  1915
analysis for assembly languages with subtypes;
wenzelm@7691
  1916
wenzelm@6278
  1917
* HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
wenzelm@6278
  1918
-- avoids syntactic ambiguities and treats state, transition, and
wenzelm@6278
  1919
temporal levels more uniformly; introduces INCOMPATIBILITIES due to
wenzelm@6278
  1920
changed syntax and (many) tactics;
wenzelm@6278
  1921
wenzelm@7791
  1922
* HOL/inductive: Now also handles more general introduction rules such
wenzelm@7791
  1923
  as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
wenzelm@7791
  1924
  theorems are now maintained within the theory (maintained via the
wenzelm@7791
  1925
  "mono" attribute);
berghofe@7780
  1926
wenzelm@7238
  1927
* HOL/datatype: Now also handles arbitrarily branching datatypes
wenzelm@7238
  1928
  (using function types) such as
wenzelm@7238
  1929
wenzelm@7238
  1930
  datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
berghofe@7047
  1931
wenzelm@7326
  1932
* HOL/record: record_simproc (part of the default simpset) takes care
wenzelm@7326
  1933
of selectors applied to updated records; record_split_tac is no longer
wenzelm@7327
  1934
part of the default claset; update_defs may now be removed from the
wenzelm@7327
  1935
simpset in many cases; COMPATIBILITY: old behavior achieved by
wenzelm@7326
  1936
wenzelm@7326
  1937
  claset_ref () := claset() addSWrapper record_split_wrapper;
wenzelm@7326
  1938
  Delsimprocs [record_simproc]
wenzelm@7326
  1939
wenzelm@6386
  1940
* HOL/typedef: fixed type inference for representing set; type
wenzelm@6386
  1941
arguments now have to occur explicitly on the rhs as type constraints;
wenzelm@6386
  1942
paulson@7287
  1943
* HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
paulson@7287
  1944
names rather than an ML expression;
paulson@7287
  1945
paulson@7287
  1946
* HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
paulson@7287
  1947
supplied later.  Program schemes can be defined, such as
paulson@7287
  1948
    "While B C s = (if B s then While B C (C s) else s)"
paulson@7287
  1949
where the well-founded relation can be chosen after B and C have been given.
wenzelm@6563
  1950
wenzelm@7215
  1951
* HOL/List: the constructors of type list are now Nil and Cons;
wenzelm@7215
  1952
INCOMPATIBILITY: while [] and infix # syntax is still there, of
wenzelm@7215
  1953
course, ML tools referring to List.list.op # etc. have to be adapted;
wenzelm@7215
  1954
wenzelm@7238
  1955
* HOL_quantifiers flag superseded by "HOL" print mode, which is
wenzelm@7238
  1956
disabled by default; run isabelle with option -m HOL to get back to
wenzelm@7238
  1957
the original Gordon/HOL-style output;
wenzelm@7238
  1958
wenzelm@7238
  1959
* HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
wenzelm@7238
  1960
ALL x<=y. P, EX x<y. P, EX x<=y. P;
wenzelm@7238
  1961
wenzelm@7238
  1962
* HOL basic syntax simplified (more orthogonal): all variants of
wenzelm@7238
  1963
All/Ex now support plain / symbolic / HOL notation; plain syntax for
wenzelm@7238
  1964
Eps operator is provided as well: "SOME x. P[x]";
wenzelm@7238
  1965
berghofe@7320
  1966
* HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
wenzelm@7261
  1967
wenzelm@7280
  1968
* HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
wenzelm@7280
  1969
thus available for user theories;
wenzelm@7280
  1970
wenzelm@7300
  1971
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
wenzelm@7300
  1972
HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
wenzelm@7300
  1973
time;
wenzelm@7300
  1974
wenzelm@7986
  1975
* HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
wenzelm@7986
  1976
several times and then mp;
oheimb@7492
  1977
wenzelm@7215
  1978
paulson@7113
  1979
*** LK ***
paulson@7113
  1980
wenzelm@7215
  1981
* the notation <<...>> is now available as a notation for sequences of
wenzelm@7215
  1982
formulas;
paulson@7113
  1983
paulson@7113
  1984
* the simplifier is now installed
paulson@7113
  1985
wenzelm@8729
  1986
* the axiom system has been generalized (thanks to Soren Heilmann)
paulson@7113
  1987
paulson@7113
  1988
* the classical reasoner now has a default rule database
paulson@7113
  1989
paulson@7113
  1990
paulson@6064
  1991
*** ZF ***
paulson@6064
  1992
paulson@6064
  1993
* new primrec section allows primitive recursive functions to be given
wenzelm@6269
  1994
directly (as in HOL) over datatypes and the natural numbers;
paulson@6064
  1995
wenzelm@6269
  1996
* new tactics induct_tac and exhaust_tac for induction (or case
wenzelm@6269
  1997
analysis) over datatypes and the natural numbers;
paulson@6064
  1998
paulson@6064
  1999
* the datatype declaration of type T now defines the recursor T_rec;
paulson@6064
  2000
paulson@6141
  2001
* simplification automatically does freeness reasoning for datatype
wenzelm@6269
  2002
constructors;
paulson@6141
  2003
wenzelm@6269
  2004
* automatic type-inference, with AddTCs command to insert new
wenzelm@6269
  2005
type-checking rules;
paulson@6155
  2006
wenzelm@6269
  2007
* datatype introduction rules are now added as Safe Introduction rules
wenzelm@6269
  2008
to the claset;
paulson@6155
  2009
wenzelm@6269
  2010
* the syntax "if P then x else y" is now available in addition to
wenzelm@6269
  2011
if(P,x,y);
wenzelm@6269
  2012
paulson@6069
  2013
wenzelm@6343
  2014
*** Internal programming interfaces ***
wenzelm@6343
  2015
wenzelm@7919
  2016
* tuned simplifier trace output; new flag debug_simp;
wenzelm@7919
  2017
wenzelm@7420
  2018
* structures Vartab / Termtab (instances of TableFun) offer efficient
wenzelm@7420
  2019
tables indexed by indexname_ord / term_ord (compatible with aconv);
wenzelm@7420
  2020
wenzelm@6386
  2021
* AxClass.axclass_tac lost the theory argument;
wenzelm@6386
  2022
wenzelm@6343
  2023
* tuned current_goals_markers semantics: begin / end goal avoids
wenzelm@6343
  2024
printing empty lines;
wenzelm@6343
  2025
wenzelm@6343
  2026
* removed prs and prs_fn hook, which was broken because it did not
wenzelm@6343
  2027
include \n in its semantics, forcing writeln to add one
wenzelm@6343
  2028
uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
wenzelm@6343
  2029
string -> unit if you really want to output text without newline;
wenzelm@6343
  2030
wenzelm@6343
  2031
* Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
wenzelm@6343
  2032
plain output, interface builders may have to enable 'isabelle_font'
wenzelm@6343
  2033
mode to get Isabelle font glyphs as before;
wenzelm@6343
  2034
wenzelm@6343
  2035
* refined token_translation interface; INCOMPATIBILITY: output length
wenzelm@6343
  2036
now of type real instead of int;
wenzelm@6343
  2037
wenzelm@7196
  2038
* theory loader actions may be traced via new ThyInfo.add_hook
wenzelm@7196
  2039
interface (see src/Pure/Thy/thy_info.ML); example application: keep
wenzelm@7196
  2040
your own database of information attached to *whole* theories -- as
wenzelm@7196
  2041
opposed to intra-theory data slots offered via TheoryDataFun;
wenzelm@7196
  2042
wenzelm@7647
  2043
* proper handling of dangling sort hypotheses (at last!);
wenzelm@7647
  2044
Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
wenzelm@7647
  2045
extra sort hypotheses that can be witnessed from the type signature;
wenzelm@7986
  2046
the force_strip_shyps flag is gone, any remaining shyps are simply
wenzelm@7986
  2047
left in the theorem (with a warning issued by strip_shyps_warning);
wenzelm@7647
  2048
wenzelm@6343
  2049
paulson@6064
  2050
wenzelm@5781
  2051
New in Isabelle98-1 (October 1998)
wenzelm@5781
  2052
----------------------------------
wenzelm@5781
  2053
wenzelm@5127
  2054
*** Overview of INCOMPATIBILITIES (see below for more details) ***
wenzelm@4842
  2055
wenzelm@5726
  2056
* several changes of automated proof tools;
wenzelm@5373
  2057
wenzelm@5726
  2058
* HOL: major changes to the inductive and datatype packages, including
wenzelm@5726
  2059
some minor incompatibilities of theory syntax;
berghofe@5214
  2060
wenzelm@5726
  2061
* HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
wenzelm@5217
  2062
called `inj_on';
paulson@5160
  2063
nipkow@5275
  2064
* HOL: removed duplicate thms in Arith:
nipkow@5275
  2065
  less_imp_add_less  should be replaced by  trans_less_add1
nipkow@5275
  2066
  le_imp_add_le      should be replaced by  trans_le_add1
paulson@5160
  2067
wenzelm@5726
  2068
* HOL: unary minus is now overloaded (new type constraints may be
wenzelm@5726
  2069
required);
paulson@5490
  2070
wenzelm@5726
  2071
* HOL and ZF: unary minus for integers is now #- instead of #~.  In
wenzelm@5726
  2072
ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
wenzelm@5726
  2073
now taken as an integer constant.
paulson@5541
  2074
wenzelm@5726
  2075
* Pure: ML function 'theory_of' renamed to 'theory';
wenzelm@5397
  2076
wenzelm@5363
  2077
wenzelm@5127
  2078
*** Proof tools ***
nipkow@4880
  2079
nipkow@5657
  2080
* Simplifier:
nipkow@5657
  2081
  1. Asm_full_simp_tac is now more aggressive.
nipkow@5657
  2082
     1. It will sometimes reorient premises if that increases their power to
nipkow@5657
  2083
        simplify.
nipkow@5657
  2084
     2. It does no longer proceed strictly from left to right but may also
nipkow@5657
  2085
        rotate premises to achieve further simplification.
nipkow@5657
  2086
     For compatibility reasons there is now Asm_lr_simp_tac which is like the
nipkow@5657
  2087
     old Asm_full_simp_tac in that it does not rotate premises.
nipkow@5657
  2088
  2. The simplifier now knows a little bit about nat-arithmetic.
nipkow@4880
  2089
wenzelm@5127
  2090
* Classical reasoner: wrapper mechanism for the classical reasoner now
wenzelm@5127
  2091
allows for selected deletion of wrappers, by introduction of names for
wenzelm@5127
  2092
wrapper functionals.  This implies that addbefore, addSbefore,
wenzelm@5127
  2093
addaltern, and addSaltern now take a pair (name, tactic) as argument,
wenzelm@5127
  2094
and that adding two tactics with the same name overwrites the first
wenzelm@5127
  2095
one (emitting a warning).
oheimb@4824
  2096
  type wrapper = (int -> tactic) -> (int -> tactic)
oheimb@4649
  2097
  setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
oheimb@4824
  2098
  addWrapper, addSWrapper: claset * (string * wrapper) -> claset
oheimb@4824
  2099
  delWrapper, delSWrapper: claset *  string            -> claset
oheimb@4649
  2100
  getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
oheimb@4649
  2101
wenzelm@5705
  2102
* Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
wenzelm@5726
  2103
semantics; addbefore now affects only the unsafe part of step_tac
wenzelm@5726
  2104
etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
wenzelm@5726
  2105
FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
wenzelm@5726
  2106
by Force_tac;
oheimb@5524
  2107
wenzelm@5726
  2108
* Classical reasoner: setwrapper to setWrapper and compwrapper to
wenzelm@5726
  2109
compWrapper; added safe wrapper (and access functions for it);
oheimb@5524
  2110
wenzelm@5127
  2111
* HOL/split_all_tac is now much faster and fails if there is nothing
wenzelm@5726
  2112
to split.  Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
wenzelm@5726
  2113
and the names of the automatically generated variables have changed.
wenzelm@5726
  2114
split_all_tac has moved within claset() from unsafe wrappers to safe
wenzelm@5726
  2115
wrappers, which means that !!-bound variables are split much more
wenzelm@5726
  2116
aggressively, and safe_tac and clarify_tac now split such variables.
wenzelm@5726
  2117
If this splitting is not appropriate, use delSWrapper "split_all_tac".
wenzelm@5726
  2118
Note: the same holds for record_split_tac, which does the job of
wenzelm@5726
  2119
split_all_tac for record fields.
wenzelm@5127
  2120
wenzelm@5726
  2121
* HOL/Simplifier: Rewrite rules for case distinctions can now be added
wenzelm@5726
  2122
permanently to the default simpset using Addsplits just like
wenzelm@5726
  2123
Addsimps. They can be removed via Delsplits just like
wenzelm@5726
  2124
Delsimps. Lower-case versions are also available.
wenzelm@5127
  2125
wenzelm@5726
  2126
* HOL/Simplifier: The rule split_if is now part of the default
wenzelm@5726
  2127
simpset. This means that the simplifier will eliminate all occurrences
wenzelm@5726
  2128
of if-then-else in the conclusion of a goal. To prevent this, you can
wenzelm@5726
  2129
either remove split_if completely from the default simpset by
wenzelm@5726
  2130
`Delsplits [split_if]' or remove it in a specific call of the
wenzelm@5726
  2131
simplifier using `... delsplits [split_if]'.  You can also add/delete
wenzelm@5726
  2132
other case splitting rules to/from the default simpset: every datatype
wenzelm@5726
  2133
generates suitable rules `split_t_case' and `split_t_case_asm' (where
wenzelm@5726
  2134
t is the name of the datatype).
wenzelm@5127
  2135
wenzelm@5726
  2136
* Classical reasoner / Simplifier combination: new force_tac (and
wenzelm@5127
  2137
derivatives Force_tac, force) combines rewriting and classical
wenzelm@5127
  2138
reasoning (and whatever other tools) similarly to auto_tac, but is
wenzelm@5726
  2139
aimed to solve the given subgoal completely.
wenzelm@5127
  2140
wenzelm@5127
  2141
wenzelm@5127
  2142
*** General ***
wenzelm@5127
  2143
wenzelm@5217
  2144
* new top-level commands `Goal' and `Goalw' that improve upon `goal'
wenzelm@5127
  2145
and `goalw': the theory is no longer needed as an explicit argument -
wenzelm@5127
  2146
the current theory context is used; assumptions are no longer returned
wenzelm@5127
  2147
at the ML-level unless one of them starts with ==> or !!; it is
wenzelm@5217
  2148
recommended to convert to these new commands using isatool fixgoal
wenzelm@5217
  2149
(backup your sources first!);
wenzelm@4842
  2150
wenzelm@5217
  2151
* new top-level commands 'thm' and 'thms' for retrieving theorems from
wenzelm@5207
  2152
the current theory context, and 'theory' to lookup stored theories;
paulson@4806
  2153
paulson@5722
  2154
* new theory section 'locale' for declaring constants, assumptions and
paulson@5722
  2155
definitions that have local scope;
paulson@5722
  2156
wenzelm@5127
  2157
* new theory section 'nonterminals' for purely syntactic types;
wenzelm@4858
  2158
wenzelm@5127
  2159
* new theory section 'setup' for generic ML setup functions
wenzelm@5127
  2160
(e.g. package initialization);
wenzelm@4869
  2161
wenzelm@5131
  2162
* the distribution now includes Isabelle icons: see
wenzelm@5131
  2163
lib/logo/isabelle-{small,tiny}.xpm;
wenzelm@5131
  2164
wenzelm@5363
  2165
* isatool install - install binaries with absolute references to
wenzelm@5363
  2166
ISABELLE_HOME/bin;
wenzelm@5363
  2167
wenzelm@5572
  2168
* isatool logo -- create instances of the Isabelle logo (as EPS);
wenzelm@5572
  2169
wenzelm@5407
  2170
* print mode 'emacs' reserved for Isamode;
wenzelm@5407
  2171
wenzelm@5726
  2172
* support multiple print (ast) translations per constant name;
wenzelm@5726
  2173
wenzelm@6925
  2174
* theorems involving oracles are now printed with a suffixed [!];
wenzelm@6925
  2175
wenzelm@4711
  2176
paulson@4661
  2177
*** HOL ***
paulson@4661
  2178
wenzelm@5710
  2179
* there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
nipkow@5709
  2180
wenzelm@5217
  2181
* HOL/inductive package reorganized and improved: now supports mutual
paulson@5267
  2182
definitions such as
wenzelm@5217
  2183
wenzelm@5217
  2184
  inductive EVEN ODD
wenzelm@5217
  2185
    intrs
wenzelm@5217
  2186
      null "0 : EVEN"
wenzelm@5217
  2187
      oddI "n : EVEN ==> Suc n : ODD"
wenzelm@5217
  2188
      evenI "n : ODD ==> Suc n : EVEN"
wenzelm@5217
  2189
wenzelm@5217
  2190
new theorem list "elims" contains an elimination rule for each of the
wenzelm@5217
  2191
recursive sets; inductive definitions now handle disjunctive premises
wenzelm@5217
  2192
correctly (also ZF);
berghofe@5214
  2193
wenzelm@5217
  2194
INCOMPATIBILITIES: requires Inductive as an ancestor; component
wenzelm@5217
  2195
"mutual_induct" no longer exists - the induction rule is always
wenzelm@5217
  2196
contained in "induct";
wenzelm@5217
  2197
wenzelm@5217
  2198
wenzelm@5217
  2199
* HOL/datatype package re-implemented and greatly improved: now
paulson@5267
  2200
supports mutually recursive datatypes such as
wenzelm@5217
  2201
wenzelm@5217
  2202
  datatype
wenzelm@5217
  2203
    'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
wenzelm@5217
  2204
            | SUM ('a aexp) ('a aexp)
wenzelm@5217
  2205
            | DIFF ('a aexp) ('a aexp)
wenzelm@5217
  2206
            | NUM 'a
wenzelm@5217
  2207
  and
wenzelm@5217
  2208
    'a bexp = LESS ('a aexp) ('a aexp)
wenzelm@5217
  2209
            | AND ('a bexp) ('a bexp)
wenzelm@5217
  2210
            | OR ('a bexp) ('a bexp)
wenzelm@5217
  2211
paulson@5267
  2212
as well as indirectly recursive datatypes such as
berghofe@5214
  2213
wenzelm@5217
  2214
  datatype
wenzelm@5217
  2215
    ('a, 'b) term = Var 'a
wenzelm@5217
  2216
                  | App 'b ((('a, 'b) term) list)
berghofe@5214
  2217
wenzelm@5217
  2218
The new tactic  mutual_induct_tac [<var_1>, ..., <var_n>] i  performs
wenzelm@5217
  2219
induction on mutually / indirectly recursive datatypes.
wenzelm@5217
  2220
wenzelm@5217
  2221
Primrec equations are now stored in theory and can be accessed via
wenzelm@5217
  2222
<function_name>.simps.
wenzelm@5217
  2223
wenzelm@5217
  2224
INCOMPATIBILITIES:
berghofe@5214
  2225
wenzelm@5217
  2226
  - Theories using datatypes must now have theory Datatype as an
wenzelm@5217
  2227
    ancestor.
wenzelm@5217
  2228
  - The specific <typename>.induct_tac no longer exists - use the
wenzelm@5217
  2229
    generic induct_tac instead.
berghofe@5226
  2230
  - natE has been renamed to nat.exhaust - use exhaust_tac
wenzelm@5217
  2231
    instead of res_inst_tac ... natE. Note that the variable
berghofe@5226
  2232
    names in nat.exhaust differ from the names in natE, this
wenzelm@5217
  2233
    may cause some "fragile" proofs to fail.
wenzelm@5217
  2234
  - The theorems split_<typename>_case and split_<typename>_case_asm
wenzelm@5217
  2235
    have been renamed to <typename>.split and <typename>.split_asm.
wenzelm@5217
  2236
  - Since default sorts of type variables are now handled correctly,
wenzelm@5217
  2237
    some datatype definitions may have to be annotated with explicit
wenzelm@5217
  2238
    sort constraints.
wenzelm@5217
  2239
  - Primrec definitions no longer require function name and type
wenzelm@5217
  2240
    of recursive argument.
berghofe@5214
  2241
wenzelm@5217
  2242
Consider using isatool fixdatatype to adapt your theories and proof
wenzelm@5217
  2243
scripts to the new package (backup your sources first!).
wenzelm@5217
  2244
wenzelm@5217
  2245
wenzelm@5726
  2246
* HOL/record package: considerably improved implementation; now
wenzelm@5726
  2247
includes concrete syntax for record types, terms, updates; theorems
wenzelm@5726
  2248
for surjective pairing and splitting !!-bound record variables; proof
wenzelm@5726
  2249
support is as follows:
wenzelm@5726
  2250
wenzelm@5726
  2251
  1) standard conversions (selectors or updates applied to record
wenzelm@5726
  2252
constructor terms) are part of the standard simpset;
wenzelm@5726
  2253
wenzelm@5726
  2254
  2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
wenzelm@5726
  2255
made part of standard simpset and claset via addIffs;
wenzelm@5726
  2256
wenzelm@5726
  2257
  3) a tactic for record field splitting (record_split_tac) is part of
wenzelm@5726
  2258
the standard claset (addSWrapper);
wenzelm@5726
  2259
wenzelm@5726
  2260
To get a better idea about these rules you may retrieve them via
wenzelm@5726
  2261
something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
wenzelm@5726
  2262
the name of your record type.
wenzelm@5726
  2263
wenzelm@5726
  2264
The split tactic 3) conceptually simplifies by the following rule:
wenzelm@5726
  2265
wenzelm@5726
  2266
  "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
wenzelm@5726
  2267
wenzelm@5726
  2268
Thus any record variable that is bound by meta-all will automatically
wenzelm@5726
  2269
blow up into some record constructor term, consequently the
wenzelm@5726
  2270
simplifications of 1), 2) apply.  Thus force_tac, auto_tac etc. shall
wenzelm@5726
  2271
solve record problems automatically.
wenzelm@5726
  2272
berghofe@5214
  2273
wenzelm@5125
  2274
* reorganized the main HOL image: HOL/Integ and String loaded by
wenzelm@5125
  2275
default; theory Main includes everything;
wenzelm@5125
  2276
paulson@5650
  2277
* automatic simplification of integer sums and comparisons, using cancellation;
paulson@5650
  2278
oheimb@5526
  2279
* added option_map_eq_Some and not_Some_eq to the default simpset and claset;
wenzelm@5127
  2280
wenzelm@5127
  2281
* added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
wenzelm@5127
  2282
wenzelm@5127
  2283
* many new identities for unions, intersections, set difference, etc.;
wenzelm@5127
  2284
wenzelm@5127
  2285
* expand_if, expand_split, expand_sum_case and expand_nat_case are now
wenzelm@5127
  2286
called split_if, split_split, split_sum_case and split_nat_case (to go
wenzelm@5127
  2287
with add/delsplits);
wenzelm@5125
  2288
wenzelm@5127
  2289
* HOL/Prod introduces simplification procedure unit_eq_proc rewriting
wenzelm@5127
  2290
(?x::unit) = (); this is made part of the default simpset, which COULD
wenzelm@5127
  2291
MAKE EXISTING PROOFS FAIL under rare circumstances (consider
wenzelm@5207
  2292
'Delsimprocs [unit_eq_proc];' as last resort); also note that
wenzelm@5207
  2293
unit_abs_eta_conv is added in order to counter the effect of
wenzelm@5207
  2294
unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
wenzelm@5207
  2295
%u.f();
wenzelm@5125
  2296
wenzelm@5217
  2297
* HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
wenzelm@5217
  2298
makes more sense);
berghofe@5109
  2299
paulson@5475
  2300
* HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
paulson@5475
  2301
  It and 'sym RS equals0D' are now in the default  claset, giving automatic
paulson@5475
  2302
  disjointness reasoning but breaking a few old proofs.
paulson@5267
  2303
wenzelm@5217
  2304
* HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
wenzelm@5217
  2305
to 'converse' from 'inverse' (for compatibility with ZF and some
wenzelm@5217
  2306
literature);
wenzelm@5085
  2307
wenzelm@5127
  2308
* HOL/recdef can now declare non-recursive functions, with {} supplied as
wenzelm@5127
  2309
the well-founded relation;
oheimb@4838
  2310
paulson@5490
  2311
* HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
paulson@5490
  2312
    Compl A.  The "Compl" syntax remains available as input syntax for this
paulson@5490
  2313
    release ONLY.
paulson@5490
  2314
wenzelm@5127
  2315
* HOL/Update: new theory of function updates:
wenzelm@5127
  2316
    f(a:=b) == %x. if x=a then b else f x
wenzelm@5127
  2317
may also be iterated as in f(a:=b,c:=d,...);
nipkow@5077
  2318
wenzelm@5127
  2319
* HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
paulson@4899
  2320
nipkow@5282
  2321
* HOL/List:
nipkow@5282
  2322
  - new function list_update written xs[i:=v] that updates the i-th
nipkow@5282
  2323
    list position. May also be iterated as in xs[i:=a,j:=b,...].
nipkow@5428
  2324
  - new function `upt' written [i..j(] which generates the list
nipkow@5428
  2325
    [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
nipkow@5428
  2326
    bound write [i..j], which is a shorthand for [i..j+1(].
nipkow@5282
  2327
  - new lexicographic orderings and corresponding wellfoundedness theorems.
paulson@4779
  2328
wenzelm@5127
  2329
* HOL/Arith:
wenzelm@5127
  2330
  - removed 'pred' (predecessor) function;
wenzelm@5127
  2331
  - generalized some theorems about n-1;
wenzelm@5127
  2332
  - many new laws about "div" and "mod";
wenzelm@5127
  2333
  - new laws about greatest common divisors (see theory ex/Primes);
oheimb@4766
  2334
wenzelm@5127
  2335
* HOL/Relation: renamed the relational operator r^-1 "converse"
wenzelm@4842
  2336
instead of "inverse";
wenzelm@4711
  2337
nipkow@5651
  2338
* HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
nipkow@5651
  2339
  of the multiset ordering;
nipkow@5651
  2340
wenzelm@5127
  2341
* directory HOL/Real: a construction of the reals using Dedekind cuts
nipkow@5651
  2342
  (not included by default);
nipkow@4835
  2343
wenzelm@5127
  2344
* directory HOL/UNITY: Chandy and Misra's UNITY formalism;
wenzelm@4711
  2345
nipkow@5651
  2346
* directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
nipkow@5651
  2347
  programs, i.e. different program variables may have different types.
nipkow@5651
  2348
paulson@5142
  2349
* calling (stac rew i) now fails if "rew" has no effect on the goal
paulson@5142
  2350
  [previously, this check worked only if the rewrite rule was unconditional]
paulson@5308
  2351
  Now rew can involve either definitions or equalities (either == or =).
wenzelm@5002
  2352
wenzelm@5363
  2353
paulson@4879
  2354
*** ZF ***
paulson@4879
  2355
paulson@5332
  2356
* theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
paulson@5332
  2357
  only the theorems proved on ZF.ML;
paulson@5160
  2358
paulson@5475
  2359
* ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
paulson@5475
  2360
  It and 'sym RS equals0D' are now in the default  claset, giving automatic
paulson@5475
  2361
  disjointness reasoning but breaking a few old proofs.
paulson@5267
  2362
paulson@5160
  2363
* ZF/Update: new theory of function updates
paulson@5160
  2364
    with default rewrite rule  f(x:=y) ` z = if(z=x, y, f`z)
paulson@5160
  2365
  may also be iterated as in f(a:=b,c:=d,...);
paulson@5160
  2366
paulson@4879
  2367
* in  let x=t in u(x), neither t nor u(x) has to be an FOL term.
oheimb@4649
  2368
paulson@5142
  2369
* calling (stac rew i) now fails if "rew" has no effect on the goal
paulson@5142
  2370
  [previously, this check worked only if the rewrite rule was unconditional]
paulson@5308
  2371
  Now rew can involve either definitions or equalities (either == or =).
paulson@5142
  2372
paulson@5160
  2373
* case_tac provided for compatibility with HOL
paulson@5160
  2374
    (like the old excluded_middle_tac, but with subgoals swapped)
paulson@5160
  2375
wenzelm@4842
  2376
wenzelm@5127
  2377
*** Internal programming interfaces ***
wenzelm@5002
  2378
wenzelm@5251
  2379
* Pure: several new basic modules made available for general use, see
wenzelm@5251
  2380
also src/Pure/README;
wenzelm@5207
  2381
wenzelm@5008
  2382
* improved the theory data mechanism to support encapsulation (data
wenzelm@5008
  2383
kind name replaced by private Object.kind, acting as authorization
wenzelm@5373
  2384
key); new type-safe user interface via functor TheoryDataFun; generic
wenzelm@5373
  2385
print_data function becomes basically useless;
wenzelm@5002
  2386
wenzelm@5251
  2387
* removed global_names compatibility flag -- all theory declarations
wenzelm@5251
  2388
are qualified by default;
wenzelm@5251
  2389
wenzelm@5085
  2390
* module Pure/Syntax now offers quote / antiquote translation
wenzelm@5085
  2391
functions (useful for Hoare logic etc. with implicit dependencies);
wenzelm@5373
  2392
see HOL/ex/Antiquote for an example use;
wenzelm@5085
  2393
wenzelm@5127
  2394
* Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
wenzelm@5127
  2395
cterm -> thm;
wenzelm@5127
  2396
wenzelm@5207
  2397
* new tactical CHANGED_GOAL for checking that a tactic modifies a
wenzelm@5207
  2398
subgoal;
paulson@5142
  2399
wenzelm@5251
  2400
* Display.print_goals function moved to Locale.print_goals;
wenzelm@5251
  2401
wenzelm@5731
  2402
* standard print function for goals supports current_goals_markers
wenzelm@5731
  2403
variable for marking begin of proof, end of proof, start of goal; the
wenzelm@5731
  2404
default is ("", "", ""); setting current_goals_markers := ("<proof>",
wenzelm@5731
  2405
"</proof>", "<goal>") causes SGML like tagged proof state printing,
wenzelm@5731
  2406
for example;
wenzelm@5731
  2407
wenzelm@5002
  2408
wenzelm@5002
  2409
wenzelm@4410
  2410
New in Isabelle98 (January 1998)
wenzelm@4410
  2411
--------------------------------
wenzelm@4410
  2412
wenzelm@4410
  2413
*** Overview of INCOMPATIBILITIES (see below for more details) ***
wenzelm@4410
  2414
wenzelm@4410
  2415
* changed lexical syntax of terms / types: dots made part of long
wenzelm@4410
  2416
identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
wenzelm@4410
  2417
wenzelm@4410
  2418
* simpset (and claset) reference variable replaced by functions
wenzelm@4410
  2419
simpset / simpset_ref;
wenzelm@4410
  2420
wenzelm@4410
  2421
* no longer supports theory aliases (via merge) and non-trivial
wenzelm@4410
  2422
implicit merge of thms' signatures;
wenzelm@4410
  2423
wenzelm@4410
  2424
* most internal names of constants changed due to qualified names;
wenzelm@4410
  2425
wenzelm@4410
  2426
* changed Pure/Sequence interface (see Pure/seq.ML);
wenzelm@4410
  2427
wenzelm@3454
  2428
paulson@3715
  2429
*** General Changes ***
paulson@3715
  2430
wenzelm@4174
  2431
* hierachically structured name spaces (for consts, types, axms, thms
wenzelm@3943
  2432
etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
wenzelm@4108
  2433
old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
wenzelm@4108
  2434
isatool fixdots ensures space after dots (e.g. "%x. x"); set
wenzelm@4174
  2435
long_names for fully qualified output names; NOTE: ML programs
wenzelm@4174
  2436
(special tactics, packages etc.) referring to internal names may have
wenzelm@4174
  2437
to be adapted to cope with fully qualified names; in case of severe
wenzelm@4174
  2438
backward campatibility problems try setting 'global_names' at compile
wenzelm@4174
  2439
time to have enrything declared within a flat name space; one may also
wenzelm@4174
  2440
fine tune name declarations in theories via the 'global' and 'local'
wenzelm@4174
  2441
section;
wenzelm@4108
  2442
wenzelm@4108
  2443
* reimplemented the implicit simpset and claset using the new anytype
wenzelm@4108
  2444
data filed in signatures; references simpset:simpset ref etc. are
wenzelm@4108
  2445
replaced by functions simpset:unit->simpset and
wenzelm@4108
  2446
simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
wenzelm@4108
  2447
to patch your ML files accordingly;
paulson@3856
  2448
wenzelm@3857
  2449
* HTML output now includes theory graph data for display with Java
wenzelm@3857
  2450
applet or isatool browser; data generated automatically via isatool
wenzelm@3901
  2451
usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
wenzelm@3857
  2452
paulson@3856
  2453
* defs may now be conditional; improved rewrite_goals_tac to handle
paulson@3856
  2454
conditional equations;
paulson@3856
  2455
wenzelm@4174
  2456
* defs now admits additional type arguments, using TYPE('a) syntax;
wenzelm@4174
  2457
wenzelm@3901
  2458
* theory aliases via merge (e.g. M=A+B+C) no longer supported, always
wenzelm@3901
  2459
creates a new theory node; implicit merge of thms' signatures is
wenzelm@4112
  2460
restricted to 'trivial' ones; COMPATIBILITY: one may have to use
wenzelm@3901
  2461
transfer:theory->thm->thm in (rare) cases;
wenzelm@3901
  2462
wenzelm@3968
  2463
* improved handling of draft signatures / theories; draft thms (and
wenzelm@3968
  2464
ctyps, cterms) are automatically promoted to real ones;
wenzelm@3968
  2465
wenzelm@3901
  2466
* slightly changed interfaces for oracles: admit many per theory, named
wenzelm@3901
  2467
(e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
wenzelm@3901
  2468
wenzelm@3901
  2469
* print_goals: optional output of const types (set show_consts and
wenzelm@3901
  2470
show_types);
wenzelm@3851
  2471
wenzelm@4388
  2472
* improved output of warnings (###) and errors (***);
wenzelm@3697
  2473
paulson@4178
  2474
* subgoal_tac displays a warning if the new subgoal has type variables;
paulson@4178
  2475
paulson@3715
  2476
* removed old README and Makefiles;
wenzelm@3697
  2477
paulson@3856
  2478
* replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
wenzelm@3670
  2479
paulson@3715
  2480
* removed obsolete init_pps and init_database;
paulson@3715
  2481
paulson@3715
  2482
* deleted the obsolete tactical STATE, which was declared by
paulson@3715
  2483
    fun STATE tacfun st = tacfun st st;
paulson@3715
  2484
wenzelm@4388
  2485
* cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
wenzelm@4388
  2486
(which abbreviates $HOME);
wenzelm@4269
  2487
wenzelm@4269
  2488
* changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
wenzelm@4269
  2489
use isatool fixseq to adapt your ML programs (this works for fully
wenzelm@4269
  2490
qualified references to the Sequence structure only!);
wenzelm@4269
  2491
wenzelm@4381
  2492
* use_thy no longer requires writable current directory; it always
wenzelm@4381
  2493
reloads .ML *and* .thy file, if either one is out of date;
wenzelm@4269
  2494
paulson@3715
  2495
paulson@3715
  2496
*** Classical Reasoner ***
paulson@3715
  2497
wenzelm@3744
  2498
* Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
wenzelm@3744
  2499
tactics that use classical reasoning to simplify a subgoal without
wenzelm@3744
  2500
splitting it into several subgoals;
paulson@3715
  2501
paulson@3719
  2502
* Safe_tac: like safe_tac but uses the default claset;
paulson@3719
  2503
paulson@3715
  2504
paulson@3715
  2505
*** Simplifier ***
paulson@3715
  2506
paulson@3715
  2507
* added simplification meta rules:
paulson@3715
  2508
    (asm_)(full_)simplify: simpset -> thm -> thm;
paulson@3715
  2509
paulson@3715
  2510
* simplifier.ML no longer part of Pure -- has to be loaded by object
paulson@3715
  2511
logics (again);
paulson@3715
  2512
paulson@3715
  2513
* added prems argument to simplification procedures;
paulson@3715
  2514
paulson@4325
  2515
* HOL, FOL, ZF: added infix function `addsplits':
paulson@4325
  2516
  instead of `<simpset> setloop (split_tac <thms>)'
paulson@4325
  2517
  you can simply write `<simpset> addsplits <thms>'
paulson@4325
  2518
paulson@3715
  2519
paulson@3715
  2520
*** Syntax ***
paulson@3715
  2521
wenzelm@4174
  2522
* TYPE('a) syntax for type reflection terms;
wenzelm@4174
  2523
wenzelm@3985
  2524
* no longer handles consts with name "" -- declare as 'syntax' instead;
paulson@3856
  2525
paulson@3856
  2526
* pretty printer: changed order of mixfix annotation preference (again!);
wenzelm@3846
  2527
paulson@3715
  2528
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
paulson@3715
  2529
paulson@3715
  2530
paulson@3715
  2531
*** HOL ***
paulson@3715
  2532
wenzelm@5726
  2533
* HOL: there is a new splitter `split_asm_tac' that can be used e.g.
oheimb@4189
  2534
  with `addloop' of the simplifier to faciliate case splitting in premises.
oheimb@4189
  2535
nipkow@4035
  2536
* HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
wenzelm@3985
  2537
wenzelm@3985
  2538
* HOL/Auth: new protocol proofs including some for the Internet
nipkow@4035
  2539
  protocol TLS;
wenzelm@3985
  2540
wenzelm@4125
  2541
* HOL/Map: new theory of `maps' a la VDM;
nipkow@3982
  2542
wenzelm@4335
  2543
* HOL/simplifier: simplification procedures nat_cancel_sums for
wenzelm@4335
  2544
cancelling out common nat summands from =, <, <= (in)equalities, or
wenzelm@4335
  2545
differences; simplification procedures nat_cancel_factor for
wenzelm@4335
  2546
cancelling common factor from =, <, <= (in)equalities over natural
wenzelm@4373
  2547
sums; nat_cancel contains both kinds of procedures, it is installed by
wenzelm@4373
  2548
default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
wenzelm@4335
  2549
nipkow@3580
  2550
* HOL/simplifier: terms of the form
paulson@4325
  2551
  `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)'  (or t=x)
nipkow@3580
  2552
  are rewritten to
nipkow@4035
  2553
  `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
nipkow@4035
  2554
  and those of the form
paulson@4325
  2555
  `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)'  (or t=x)
nipkow@4035
  2556
  are rewritten to
nipkow@4035
  2557
  `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
nipkow@4035
  2558
nipkow@4035
  2559
* HOL/datatype
nipkow@4035
  2560
  Each datatype `t' now comes with a theorem `split_t_case' of the form
nipkow@3580
  2561
nipkow@4035
  2562
  P(t_case f1 ... fn x) =
nipkow@4035
  2563
     ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
nipkow@4035
  2564
        ...
oheimb@4189
  2565
       (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
nipkow@4035
  2566
     )
nipkow@4035
  2567
oheimb@4930
  2568
  and a theorem `split_t_case_asm' of the form
oheimb@4189
  2569
oheimb@4189
  2570
  P(t_case f1 ... fn x) =
oheimb@4189
  2571
    ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
oheimb@4189
  2572
        ...
oheimb@4189
  2573
       (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
oheimb@4189
  2574
     )
oheimb@4930
  2575
  which can be added to a simpset via `addsplits'. The existing theorems
oheimb@4930
  2576
  expand_list_case and expand_option_case have been renamed to
oheimb@4930
  2577
  split_list_case and split_option_case.
oheimb@4189
  2578
nipkow@4361
  2579
* HOL/Arithmetic:
nipkow@4361
  2580
  - `pred n' is automatically converted to `n-1'.
nipkow@4361
  2581
    Users are strongly encouraged not to use `pred' any longer,
nipkow@4361
  2582
    because it will disappear altogether at some point.
nipkow@4361
  2583
  - Users are strongly encouraged to write "0 < n" rather than
nipkow@4361
  2584
    "n ~= 0". Theorems and proof tools have been modified towards this
nipkow@4361
  2585
    `standard'.
nipkow@4357
  2586
nipkow@4502
  2587
* HOL/Lists:
nipkow@4502
  2588
  the function "set_of_list" has been renamed "set" (and its theorems too);
nipkow@4502
  2589
  the function "nth" now takes its arguments in the reverse order and
nipkow@4502
  2590
  has acquired the infix notation "!" as in "xs!n".
paulson@3570
  2591
paulson@4154
  2592
* HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
paulson@4154
  2593
paulson@4154
  2594
* HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
paulson@4154
  2595
  specialist theorems (like UN1_I) are gone.  Similarly for (INT x.B x);
paulson@4154
  2596
wenzelm@4575
  2597
* HOL/record: extensible records with schematic structural subtyping
wenzelm@4575
  2598
(single inheritance); EXPERIMENTAL version demonstrating the encoding,
wenzelm@4575
  2599
still lacks various theorems and concrete record syntax;
wenzelm@4575
  2600
wenzelm@4125
  2601
paulson@3715
  2602
*** HOLCF ***
wenzelm@3535
  2603
wenzelm@4125
  2604
* removed "axioms" and "generated by" sections;
wenzelm@4125
  2605
oheimb@4123
  2606
* replaced "ops" section by extended "consts" section, which is capable of
wenzelm@4125
  2607
  handling the continuous function space "->" directly;
wenzelm@4125
  2608
wenzelm@4125
  2609
* domain package:
wenzelm@4125
  2610
  . proves theorems immediately and stores them in the theory,
wenzelm@4125
  2611
  . creates hierachical name space,
wenzelm@4125
  2612
  . now uses normal mixfix annotations (instead of cinfix...),
wenzelm@4125
  2613
  . minor changes to some names and values (for consistency),
wenzelm@4125
  2614
  . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
wenzelm@4125
  2615
  . separator between mutual domain defs: changed "," to "and",
wenzelm@4125
  2616
  . improved handling of sort constraints;  now they have to
wenzelm@4125
  2617
    appear on the left-hand side of the equations only;
oheimb@4123
  2618
oheimb@4123
  2619
* fixed LAM <x,y,zs>.b syntax;
wenzelm@3567
  2620
wenzelm@3744
  2621
* added extended adm_tac to simplifier in HOLCF -- can now discharge
wenzelm@3744
  2622
adm (%x. P (t x)), where P is chainfinite and t continuous;
wenzelm@3579
  2623
wenzelm@3579
  2624
paulson@3719
  2625
*** FOL and ZF ***
paulson@3719
  2626
wenzelm@5726
  2627
* FOL: there is a new splitter `split_asm_tac' that can be used e.g.
oheimb@4189
  2628
  with `addloop' of the simplifier to faciliate case splitting in premises.
oheimb@4189
  2629
wenzelm@3744
  2630
* qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
wenzelm@3744
  2631
in HOL, they strip ALL and --> from proved theorems;
wenzelm@3744
  2632
paulson@3719
  2633
wenzelm@3579
  2634