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