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