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