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