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