NEWS
author boehmes
Tue Oct 26 11:45:12 2010 +0200 (2010-10-26)
changeset 40162 7f58a9a843c2
parent 40128 ac0935cfcbc4
child 40183 0ea94d19af08
permissions -rw-r--r--
joined setup of SMT solvers in one place; turned Z3-specific options into SMT options (renamed configuration options from z3_* to smt_*); more detailed SMT exception; improved SMT filter interface
wenzelm@5363
     1
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     2
==============================================
wenzelm@2553
     3
wenzelm@37383
     4
New in this Isabelle version
wenzelm@37383
     5
----------------------------
wenzelm@37383
     6
wenzelm@37536
     7
*** General ***
wenzelm@37536
     8
wenzelm@40127
     9
* Significantly improved Isabelle/Isar implementation manual.
wenzelm@40127
    10
wenzelm@37536
    11
* Explicit treatment of UTF8 sequences as Isabelle symbols, such that
wenzelm@37536
    12
a Unicode character is treated as a single symbol, not a sequence of
wenzelm@37536
    13
non-ASCII bytes as before.  Since Isabelle/ML string literals may
wenzelm@37536
    14
contain symbols without further backslash escapes, Unicode can now be
wenzelm@37536
    15
used here as well.  Recall that Symbol.explode in ML provides a
wenzelm@37536
    16
consistent view on symbols, while raw explode (or String.explode)
wenzelm@37536
    17
merely give a byte-oriented representation.
wenzelm@37536
    18
wenzelm@38135
    19
* Theory loading: only the master source file is looked-up in the
wenzelm@38135
    20
implicit load path, all other files are addressed relatively to its
wenzelm@38135
    21
directory.  Minor INCOMPATIBILITY, subtle change in semantics.
wenzelm@38135
    22
wenzelm@37939
    23
* Special treatment of ML file names has been discontinued.
wenzelm@37939
    24
Historically, optional extensions .ML or .sml were added on demand --
wenzelm@37939
    25
at the cost of clarity of file dependencies.  Recall that Isabelle/ML
wenzelm@37939
    26
files exclusively use the .ML extension.  Minor INCOMPATIBILTY.
wenzelm@37939
    27
wenzelm@38980
    28
* Various options that affect pretty printing etc. are now properly
wenzelm@38767
    29
handled within the context via configuration options, instead of
wenzelm@38767
    30
unsynchronized references.  There are both ML Config.T entities and
wenzelm@38767
    31
Isar declaration attributes to access these.
wenzelm@38767
    32
wenzelm@39125
    33
  ML (Config.T)                 Isar (attribute)
wenzelm@39125
    34
wenzelm@39128
    35
  eta_contract                  eta_contract
wenzelm@39137
    36
  show_brackets                 show_brackets
wenzelm@39134
    37
  show_sorts                    show_sorts
wenzelm@39134
    38
  show_types                    show_types
wenzelm@39126
    39
  show_question_marks           show_question_marks
wenzelm@39126
    40
  show_consts                   show_consts
wenzelm@39126
    41
wenzelm@39126
    42
  Syntax.ambiguity_level        syntax_ambiguity_level
wenzelm@39126
    43
wenzelm@39126
    44
  Goal_Display.goals_limit      goals_limit
wenzelm@39126
    45
  Goal_Display.show_main_goal   show_main_goal
wenzelm@39126
    46
wenzelm@39125
    47
  Thy_Output.display            thy_output_display
wenzelm@39125
    48
  Thy_Output.quotes             thy_output_quotes
wenzelm@39125
    49
  Thy_Output.indent             thy_output_indent
wenzelm@39125
    50
  Thy_Output.source             thy_output_source
wenzelm@39125
    51
  Thy_Output.break              thy_output_break
wenzelm@39125
    52
wenzelm@39125
    53
Note that corresponding "..._default" references in ML may be only
wenzelm@38767
    54
changed globally at the ROOT session setup, but *not* within a theory.
wenzelm@38767
    55
wenzelm@37536
    56
ballarin@38110
    57
*** Pure ***
ballarin@38110
    58
ballarin@38110
    59
* Interpretation command 'interpret' accepts a list of equations like
ballarin@38110
    60
'interpretation' does.
ballarin@38110
    61
ballarin@38110
    62
* Diagnostic command 'print_interps' prints interpretations in proofs
ballarin@38110
    63
in addition to interpretations in theories.
ballarin@38110
    64
wenzelm@38708
    65
* Discontinued obsolete 'global' and 'local' commands to manipulate
wenzelm@38708
    66
the theory name space.  Rare INCOMPATIBILITY.  The ML functions
wenzelm@38708
    67
Sign.root_path and Sign.local_path may be applied directly where this
wenzelm@38708
    68
feature is still required for historical reasons.
wenzelm@38708
    69
haftmann@39215
    70
* Discontinued ancient 'constdefs' command.  INCOMPATIBILITY, use
haftmann@39215
    71
'definition' instead.
haftmann@39215
    72
wenzelm@39689
    73
* Document antiquotations @{class} and @{type} for printing classes
haftmann@39305
    74
and type constructors.
haftmann@39305
    75
ballarin@38110
    76
haftmann@37387
    77
*** HOL ***
haftmann@37387
    78
haftmann@39916
    79
* Predicates `distinct` and `sorted` now defined inductively, with nice
haftmann@39916
    80
induction rules.  INCOMPATIBILITY: former distinct.simps and sorted.simps
haftmann@39916
    81
now named distinct_simps and sorted_simps.
haftmann@39916
    82
haftmann@39910
    83
* Constant `contents` renamed to `the_elem`, to free the generic name
haftmann@39910
    84
contents for other uses.  INCOMPATIBILITY.
haftmann@39910
    85
haftmann@39771
    86
* Dropped old primrec package.  INCOMPATIBILITY.
haftmann@39771
    87
haftmann@39644
    88
* Improved infrastructure for term evaluation using code generator
haftmann@39644
    89
techniques, in particular static evaluation conversions.
haftmann@39644
    90
haftmann@39771
    91
* String.literal is a type, but not a datatype.  INCOMPATIBILITY.
bulwahn@39250
    92
 
nipkow@39302
    93
* Renamed lemmas:
nipkow@39302
    94
  expand_fun_eq -> fun_eq_iff
nipkow@39302
    95
  expand_set_eq -> set_eq_iff
nipkow@39302
    96
  set_ext -> set_eqI
haftmann@39644
    97
 INCOMPATIBILITY.
nipkow@39199
    98
nipkow@40078
    99
* Renamed lemma list: nat_number -> eval_nat_numeral
nipkow@40078
   100
haftmann@38857
   101
* Renamed class eq and constant eq (for code generation) to class equal
haftmann@38857
   102
and constant equal, plus renaming of related facts and various tuning.
haftmann@38857
   103
INCOMPATIBILITY.
haftmann@38857
   104
haftmann@38814
   105
* Scala (2.8 or higher) has been added to the target languages of
haftmann@38814
   106
the code generator.
haftmann@38814
   107
haftmann@38642
   108
* Dropped type classes mult_mono and mult_mono1.  INCOMPATIBILITY.
haftmann@38642
   109
krauss@39993
   110
* Removed output syntax "'a ~=> 'b" for "'a => 'b option". INCOMPATIBILITY.
krauss@39993
   111
haftmann@38622
   112
* Theory SetsAndFunctions has been split into Function_Algebras and Set_Algebras;
haftmann@38622
   113
canonical names for instance definitions for functions; various improvements.
haftmann@38622
   114
INCOMPATIBILITY.
haftmann@38622
   115
haftmann@38545
   116
* Records: logical foundation type for records do not carry a '_type' suffix
haftmann@38545
   117
any longer.  INCOMPATIBILITY.
haftmann@38545
   118
haftmann@38535
   119
* Code generation for records: more idiomatic representation of record types.
haftmann@38535
   120
Warning: records are not covered by ancient SML code generation any longer.
haftmann@38537
   121
INCOMPATIBILITY.  In cases of need, a suitable rep_datatype declaration
haftmann@38537
   122
helps to succeed then:
haftmann@38537
   123
haftmann@38537
   124
  record 'a foo = ...
haftmann@38537
   125
  ...
haftmann@38537
   126
  rep_datatype foo_ext ...
haftmann@38535
   127
haftmann@38461
   128
* Session Imperative_HOL: revamped, corrected dozens of inadequacies.
haftmann@38461
   129
INCOMPATIBILITY.
haftmann@38461
   130
haftmann@38461
   131
* Quickcheck in locales considers interpretations of that locale for
haftmann@38461
   132
counter example search.
haftmann@38461
   133
haftmann@38347
   134
* Theory Library/Monad_Syntax provides do-syntax for monad types.  Syntax
haftmann@38347
   135
in Library/State_Monad has been changed to avoid ambiguities.
haftmann@38347
   136
INCOMPATIBILITY.
haftmann@38347
   137
haftmann@38461
   138
* Code generator: export_code without explicit file declaration prints
haftmann@37820
   139
to standard output.  INCOMPATIBILITY.
haftmann@37820
   140
haftmann@37679
   141
* Abolished symbol type names:  "prod" and "sum" replace "*" and "+"
haftmann@37681
   142
respectively.  INCOMPATIBILITY.
haftmann@37679
   143
haftmann@37591
   144
* Constant "split" has been merged with constant "prod_case";  names
haftmann@37591
   145
of ML functions, facts etc. involving split have been retained so far,
haftmann@37591
   146
though.  INCOMPATIBILITY.
haftmann@37591
   147
haftmann@37595
   148
* Dropped old infix syntax "mem" for List.member;  use "in set"
haftmann@37595
   149
instead.  INCOMPATIBILITY.
haftmann@37595
   150
haftmann@37595
   151
* Refactoring of code-generation specific operations in List.thy
haftmann@37595
   152
haftmann@37595
   153
  constants
haftmann@37595
   154
    null ~> List.null
haftmann@37595
   155
haftmann@37595
   156
  facts
haftmann@37595
   157
    mem_iff ~> member_def
haftmann@37595
   158
    null_empty ~> null_def
haftmann@37595
   159
haftmann@37595
   160
INCOMPATIBILITY.  Note that these were not suppossed to be used
haftmann@37595
   161
regularly unless for striking reasons;  their main purpose was code
haftmann@37595
   162
generation.
haftmann@37595
   163
haftmann@37387
   164
* Some previously unqualified names have been qualified:
haftmann@37387
   165
haftmann@37387
   166
  types
haftmann@38556
   167
    bool ~> HOL.bool
haftmann@37387
   168
    nat ~> Nat.nat
haftmann@37387
   169
haftmann@37387
   170
  constants
haftmann@38556
   171
    Trueprop ~> HOL.Trueprop
haftmann@38556
   172
    True ~> HOL.True
haftmann@38556
   173
    False ~> HOL.False
haftmann@38795
   174
    op & ~> HOL.conj
haftmann@38795
   175
    op | ~> HOL.disj
haftmann@38788
   176
    op --> ~> HOL.implies
haftmann@38864
   177
    op = ~> HOL.eq
haftmann@38556
   178
    Not ~> HOL.Not
haftmann@38556
   179
    The ~> HOL.The
haftmann@38556
   180
    All ~> HOL.All
haftmann@38556
   181
    Ex ~> HOL.Ex
haftmann@38556
   182
    Ex1 ~> HOL.Ex1
haftmann@38524
   183
    Let ~> HOL.Let
haftmann@38524
   184
    If ~> HOL.If
haftmann@37387
   185
    Ball ~> Set.Ball
haftmann@37387
   186
    Bex ~> Set.Bex
haftmann@37387
   187
    Suc ~> Nat.Suc
haftmann@37389
   188
    Pair ~> Product_Type.Pair
haftmann@37389
   189
    fst ~> Product_Type.fst
haftmann@37389
   190
    snd ~> Product_Type.snd
haftmann@37387
   191
    curry ~> Product_Type.curry
haftmann@37679
   192
    op : ~> Set.member
haftmann@37679
   193
    Collect ~> Set.Collect
haftmann@37387
   194
haftmann@37387
   195
INCOMPATIBILITY.
wenzelm@37383
   196
haftmann@37411
   197
* Removed simplifier congruence rule of "prod_case", as has for long
haftmann@38524
   198
been the case with "split".  INCOMPATIBILITY.
haftmann@37411
   199
haftmann@37423
   200
* Datatype package: theorems generated for executable equality
haftmann@37423
   201
(class eq) carry proper names and are treated as default code
haftmann@37423
   202
equations.
haftmann@37423
   203
krauss@39150
   204
* Removed lemma Option.is_none_none (Duplicate of is_none_def).
krauss@39150
   205
INCOMPATIBILITY.
krauss@39150
   206
haftmann@37423
   207
* List.thy: use various operations from the Haskell prelude when
haftmann@37423
   208
generating Haskell code.
haftmann@37423
   209
nipkow@39301
   210
* Multiset.thy: renamed empty_idemp -> empty_neutral
nipkow@39301
   211
haftmann@38524
   212
* code_simp.ML and method code_simp: simplification with rules determined
haftmann@38524
   213
by code generator.
haftmann@37442
   214
haftmann@37442
   215
* code generator: do not print function definitions for case
haftmann@37442
   216
combinators any longer.
haftmann@37442
   217
hoelzl@37666
   218
* Multivariate Analysis: Introduced a type class for euclidean space. Most
hoelzl@37666
   219
theorems are now stated in terms of euclidean spaces instead of finite
hoelzl@37666
   220
cartesian products.
hoelzl@37666
   221
hoelzl@37666
   222
  types
hoelzl@37666
   223
    real ^ 'n ~>  'a::real_vector
hoelzl@37666
   224
              ~>  'a::euclidean_space
hoelzl@37666
   225
              ~>  'a::ordered_euclidean_space
hoelzl@37666
   226
        (depends on your needs)
hoelzl@37666
   227
hoelzl@37666
   228
  constants
hoelzl@37666
   229
     _ $ _        ~> _ $$ _
hoelzl@37666
   230
     \<chi> x. _  ~> \<chi>\<chi> x. _
hoelzl@37666
   231
     CARD('n)     ~> DIM('a)
hoelzl@37666
   232
hoelzl@37666
   233
Also note that the indices are now natural numbers and not from some finite
hoelzl@37666
   234
type. Finite cartesian products of euclidean spaces, products of euclidean
hoelzl@37666
   235
spaces the real and complex numbers are instantiated to be euclidean_spaces.
hoelzl@37666
   236
hoelzl@37666
   237
INCOMPATIBILITY.
wenzelm@37383
   238
hoelzl@38656
   239
* Probability: Introduced pinfreal as real numbers with infinity. Use pinfreal
hoelzl@38656
   240
as value for measures. Introduces Lebesgue Measure based on the integral in
hoelzl@38656
   241
Multivariate Analysis. Proved Radon Nikodym for arbitrary sigma finite measure
hoelzl@38656
   242
spaces.
hoelzl@38656
   243
hoelzl@38656
   244
 INCOMPATIBILITY.
hoelzl@38656
   245
bulwahn@37735
   246
* Inductive package: offers new command "inductive_simps" to automatically
haftmann@38461
   247
derive instantiated and simplified equations for inductive predicates,
haftmann@38461
   248
similar to inductive_cases.
bulwahn@37735
   249
hoelzl@39077
   250
* "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". surj_on is a
hoelzl@39077
   251
generalization of surj, and "surj f" is now a abbreviation of "surj_on f UNIV".
hoelzl@39077
   252
The theorems bij_def and surj_def are unchanged.
wenzelm@37383
   253
krauss@39754
   254
* Function package: .psimps rules are no longer implicitly declared [simp].
krauss@39754
   255
INCOMPATIBILITY.
krauss@39754
   256
blanchet@39957
   257
* Weaker versions of the "meson" and "metis" proof methods are now available in
blanchet@39957
   258
  "HOL-Plain", without dependency on "Hilbert_Choice". The proof methods become
blanchet@39957
   259
  more powerful after "Hilbert_Choice" is loaded in "HOL-Main".
blanchet@39957
   260
blanchet@39957
   261
* MESON: Renamed lemmas:
blanchet@39957
   262
  meson_not_conjD ~> Meson.not_conjD
blanchet@39957
   263
  meson_not_disjD ~> Meson.not_disjD
blanchet@39957
   264
  meson_not_notD ~> Meson.not_notD
blanchet@39957
   265
  meson_not_allD ~> Meson.not_allD
blanchet@39957
   266
  meson_not_exD ~> Meson.not_exD
blanchet@39957
   267
  meson_imp_to_disjD ~> Meson.imp_to_disjD
blanchet@39957
   268
  meson_not_impD ~> Meson.not_impD
blanchet@39957
   269
  meson_iff_to_disjD ~> Meson.iff_to_disjD
blanchet@39957
   270
  meson_not_iffD ~> Meson.not_iffD
blanchet@39957
   271
  meson_not_refl_disj_D ~> Meson.not_refl_disj_D
blanchet@39957
   272
  meson_conj_exD1 ~> Meson.conj_exD1
blanchet@39957
   273
  meson_conj_exD2 ~> Meson.conj_exD2
blanchet@39957
   274
  meson_disj_exD ~> Meson.disj_exD
blanchet@39957
   275
  meson_disj_exD1 ~> Meson.disj_exD1
blanchet@39957
   276
  meson_disj_exD2 ~> Meson.disj_exD2
blanchet@39957
   277
  meson_disj_assoc ~> Meson.disj_assoc
blanchet@39957
   278
  meson_disj_comm ~> Meson.disj_comm
blanchet@39957
   279
  meson_disj_FalseD1 ~> Meson.disj_FalseD1
blanchet@39957
   280
  meson_disj_FalseD2 ~> Meson.disj_FalseD2
blanchet@39957
   281
INCOMPATIBILITY.
blanchet@39957
   282
blanchet@40116
   283
* Auto Solve: Renamed "Auto Solve Direct". The tool is now available manually as
blanchet@40116
   284
  "solve_direct".
blanchet@40116
   285
blanchet@40059
   286
* Sledgehammer:
blanchet@40059
   287
  - Renamed lemmas:
blanchet@40059
   288
    COMBI_def ~> Meson.COMBI_def
blanchet@40059
   289
    COMBK_def ~> Meson.COMBK_def
blanchet@40059
   290
    COMBB_def ~> Meson.COMBB_def
blanchet@40059
   291
    COMBC_def ~> Meson.COMBC_def
blanchet@40059
   292
    COMBS_def ~> Meson.COMBS_def
blanchet@40059
   293
    abs_I ~> Meson.abs_I
blanchet@40059
   294
    abs_K ~> Meson.abs_K
blanchet@40059
   295
    abs_B ~> Meson.abs_B
blanchet@40059
   296
    abs_C ~> Meson.abs_C
blanchet@40059
   297
    abs_S ~> Meson.abs_S
blanchet@40059
   298
    INCOMPATIBILITY.
blanchet@40059
   299
  - Renamed commands:
blanchet@40059
   300
    sledgehammer atp_info ~> sledgehammer running_provers
blanchet@40059
   301
    sledgehammer atp_kill ~> sledgehammer kill_provers
blanchet@40059
   302
    sledgehammer available_atps ~> sledgehammer available_provers
blanchet@40059
   303
    INCOMPATIBILITY.
blanchet@40059
   304
  - Renamed options:
blanchet@40059
   305
    sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
blanchet@40062
   306
    sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
blanchet@40059
   307
    INCOMPATIBILITY.
blanchet@39957
   308
boehmes@40162
   309
* Changed SMT configuration options:
boehmes@40162
   310
  - Renamed:
boehmes@40162
   311
    z3_proofs ~> smt_oracle (with swapped semantics)
boehmes@40162
   312
    z3_trace_assms ~> smt_trace_used_facts
boehmes@40162
   313
    INCOMPATIBILITY.
boehmes@40162
   314
  - Added:
boehmes@40162
   315
    cvc3_options
boehmes@40162
   316
    yices_options
boehmes@40162
   317
    smt_datatypes
blanchet@39957
   318
haftmann@38522
   319
*** FOL ***
haftmann@38522
   320
haftmann@38522
   321
* All constant names are now qualified.  INCOMPATIBILITY.
haftmann@38522
   322
haftmann@38522
   323
haftmann@38522
   324
*** ZF ***
haftmann@38522
   325
haftmann@38522
   326
* All constant names are now qualified.  INCOMPATIBILITY.
haftmann@38522
   327
haftmann@38522
   328
wenzelm@37868
   329
*** ML ***
wenzelm@37868
   330
wenzelm@40110
   331
* Antiquotation @{assert} inlines a function bool -> unit that raises
wenzelm@40110
   332
Fail if the argument is false.  Due to inlining the source position of
wenzelm@40110
   333
failed assertions is included in the error output.
wenzelm@40110
   334
wenzelm@39616
   335
* Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
wenzelm@39616
   336
meaning.
wenzelm@39616
   337
wenzelm@39557
   338
* Renamed structure PureThy to Pure_Thy and moved most of its
wenzelm@39557
   339
operations to structure Global_Theory, to emphasize that this is
wenzelm@39557
   340
rarely-used global-only stuff.
wenzelm@39557
   341
wenzelm@39513
   342
* Discontinued Output.debug.  Minor INCOMPATIBILITY, use plain writeln
wenzelm@39513
   343
instead (or tracing for high-volume output).
wenzelm@39513
   344
wenzelm@38980
   345
* Configuration option show_question_marks only affects regular pretty
wenzelm@38980
   346
printing of types and terms, not raw Term.string_of_vname.
wenzelm@38980
   347
wenzelm@39164
   348
* ML_Context.thm and ML_Context.thms are no longer pervasive.  Rare
wenzelm@39164
   349
INCOMPATIBILITY, superseded by static antiquotations @{thm} and
wenzelm@39164
   350
@{thms} for most purposes.
wenzelm@39164
   351
wenzelm@38980
   352
* ML structure Unsynchronized never opened, not even in Isar
wenzelm@38980
   353
interaction mode as before.  Old Unsynchronized.set etc. have been
wenzelm@38980
   354
discontinued -- use plain := instead.  This should be *rare* anyway,
wenzelm@38980
   355
since modern tools always work via official context data, notably
wenzelm@38980
   356
configuration options.
wenzelm@38980
   357
wenzelm@37868
   358
* ML antiquotations @{theory} and @{theory_ref} refer to named
wenzelm@37868
   359
theories from the ancestry of the current context, not any accidental
wenzelm@37868
   360
theory loader state as before.  Potential INCOMPATIBILITY, subtle
wenzelm@37868
   361
change in semantics.
wenzelm@37868
   362
wenzelm@39239
   363
* Parallel and asynchronous execution requires special care concerning
wenzelm@39239
   364
interrupts.  Structure Exn provides some convenience functions that
wenzelm@39239
   365
avoid working directly with raw Interrupt.  User code must not absorb
wenzelm@39239
   366
interrupts -- intermediate handling (for cleanup etc.) needs to be
wenzelm@39239
   367
followed by re-raising of the original exception.  Another common
wenzelm@39239
   368
source of mistakes are "handle _" patterns, which make the meaning of
wenzelm@39239
   369
the program subject to physical effects of the environment.
wenzelm@39239
   370
wenzelm@37868
   371
wenzelm@38470
   372
*** System ***
wenzelm@38470
   373
wenzelm@38470
   374
* Discontinued support for Poly/ML 5.0 and 5.1 versions.
wenzelm@38470
   375
wenzelm@38470
   376
wenzelm@37868
   377
wenzelm@37144
   378
New in Isabelle2009-2 (June 2010)
wenzelm@37144
   379
---------------------------------
haftmann@33993
   380
wenzelm@35260
   381
*** General ***
wenzelm@35260
   382
wenzelm@35436
   383
* Authentic syntax for *all* logical entities (type classes, type
wenzelm@35436
   384
constructors, term constants): provides simple and robust
wenzelm@35436
   385
correspondence between formal entities and concrete syntax.  Within
wenzelm@35436
   386
the parse tree / AST representations, "constants" are decorated by
wenzelm@35436
   387
their category (class, type, const) and spelled out explicitly with
wenzelm@35436
   388
their full internal name.
wenzelm@35436
   389
wenzelm@35436
   390
Substantial INCOMPATIBILITY concerning low-level syntax declarations
wenzelm@35436
   391
and translations (translation rules and translation functions in ML).
wenzelm@35436
   392
Some hints on upgrading:
wenzelm@35260
   393
wenzelm@35260
   394
  - Many existing uses of 'syntax' and 'translations' can be replaced
wenzelm@35436
   395
    by more modern 'type_notation', 'notation' and 'abbreviation',
wenzelm@35436
   396
    which are independent of this issue.
wenzelm@35260
   397
wenzelm@35260
   398
  - 'translations' require markup within the AST; the term syntax
wenzelm@35260
   399
    provides the following special forms:
wenzelm@35260
   400
wenzelm@35260
   401
      CONST c   -- produces syntax version of constant c from context
wenzelm@35261
   402
      XCONST c  -- literally c, checked as constant from context
wenzelm@35261
   403
      c         -- literally c, if declared by 'syntax'
wenzelm@35261
   404
wenzelm@35261
   405
    Plain identifiers are treated as AST variables -- occasionally the
wenzelm@35261
   406
    system indicates accidental variables via the error "rhs contains
wenzelm@35261
   407
    extra variables".
wenzelm@35260
   408
wenzelm@35436
   409
    Type classes and type constructors are marked according to their
wenzelm@35436
   410
    concrete syntax.  Some old translations rules need to be written
wenzelm@35436
   411
    for the "type" category, using type constructor application
wenzelm@35436
   412
    instead of pseudo-term application of the default category
wenzelm@35436
   413
    "logic".
wenzelm@35436
   414
wenzelm@35260
   415
  - 'parse_translation' etc. in ML may use the following
wenzelm@35260
   416
    antiquotations:
wenzelm@35260
   417
wenzelm@35436
   418
      @{class_syntax c}   -- type class c within parse tree / AST
wenzelm@35436
   419
      @{term_syntax c}    -- type constructor c within parse tree / AST
wenzelm@35260
   420
      @{const_syntax c}   -- ML version of "CONST c" above
wenzelm@35260
   421
      @{syntax_const c}   -- literally c (checked wrt. 'syntax' declarations)
wenzelm@35260
   422
wenzelm@35436
   423
  - Literal types within 'typed_print_translations', i.e. those *not*
wenzelm@35436
   424
    represented as pseudo-terms are represented verbatim.  Use @{class
wenzelm@35436
   425
    c} or @{type_name c} here instead of the above syntax
wenzelm@35436
   426
    antiquotations.
wenzelm@35436
   427
wenzelm@35260
   428
Note that old non-authentic syntax was based on unqualified base
wenzelm@35436
   429
names, so all of the above "constant" names would coincide.  Recall
wenzelm@35436
   430
that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
wenzelm@35436
   431
diagnose syntax problems.
wenzelm@35260
   432
wenzelm@35351
   433
* Type constructors admit general mixfix syntax, not just infix.
wenzelm@35351
   434
wenzelm@36508
   435
* Concrete syntax may be attached to local entities without a proof
wenzelm@36508
   436
body, too.  This works via regular mixfix annotations for 'fix',
wenzelm@36508
   437
'def', 'obtain' etc. or via the explicit 'write' command, which is
wenzelm@36508
   438
similar to the 'notation' command in theory specifications.
wenzelm@36508
   439
wenzelm@37351
   440
* Discontinued unnamed infix syntax (legacy feature for many years) --
wenzelm@37351
   441
need to specify constant name and syntax separately.  Internal ML
wenzelm@37351
   442
datatype constructors have been renamed from InfixName to Infix etc.
wenzelm@37351
   443
Minor INCOMPATIBILITY.
wenzelm@37351
   444
wenzelm@37351
   445
* Schematic theorem statements need to be explicitly markup as such,
wenzelm@37351
   446
via commands 'schematic_lemma', 'schematic_theorem',
wenzelm@37351
   447
'schematic_corollary'.  Thus the relevance of the proof is made
wenzelm@37351
   448
syntactically clear, which impacts performance in a parallel or
wenzelm@37351
   449
asynchronous interactive environment.  Minor INCOMPATIBILITY.
wenzelm@37351
   450
wenzelm@35613
   451
* Use of cumulative prems via "!" in some proof methods has been
wenzelm@37351
   452
discontinued (old legacy feature).
wenzelm@35613
   453
boehmes@35979
   454
* References 'trace_simp' and 'debug_simp' have been replaced by
wenzelm@36857
   455
configuration options stored in the context. Enabling tracing (the
wenzelm@36857
   456
case of debugging is similar) in proofs works via
wenzelm@36857
   457
wenzelm@36857
   458
  using [[trace_simp = true]]
wenzelm@36857
   459
wenzelm@36857
   460
Tracing is then active for all invocations of the simplifier in
wenzelm@36857
   461
subsequent goal refinement steps. Tracing may also still be enabled or
wenzelm@36857
   462
disabled via the ProofGeneral settings menu.
boehmes@35979
   463
wenzelm@36177
   464
* Separate commands 'hide_class', 'hide_type', 'hide_const',
wenzelm@36177
   465
'hide_fact' replace the former 'hide' KIND command.  Minor
wenzelm@36177
   466
INCOMPATIBILITY.
wenzelm@36177
   467
wenzelm@37298
   468
* Improved parallelism of proof term normalization: usedir -p2 -q0 is
wenzelm@37298
   469
more efficient than combinations with -q1 or -q2.
wenzelm@37298
   470
wenzelm@35260
   471
haftmann@34170
   472
*** Pure ***
haftmann@34170
   473
wenzelm@37351
   474
* Proofterms record type-class reasoning explicitly, using the
wenzelm@37351
   475
"unconstrain" operation internally.  This eliminates all sort
wenzelm@37351
   476
constraints from a theorem and proof, introducing explicit
wenzelm@37351
   477
OFCLASS-premises.  On the proof term level, this operation is
wenzelm@37351
   478
automatically applied at theorem boundaries, such that closed proofs
wenzelm@37351
   479
are always free of sort constraints.  INCOMPATIBILITY for tools that
wenzelm@37351
   480
inspect proof terms.
haftmann@36147
   481
wenzelm@35765
   482
* Local theory specifications may depend on extra type variables that
wenzelm@35765
   483
are not present in the result type -- arguments TYPE('a) :: 'a itself
wenzelm@35765
   484
are added internally.  For example:
wenzelm@35765
   485
wenzelm@35765
   486
  definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
wenzelm@35765
   487
wenzelm@37351
   488
* Predicates of locales introduced by classes carry a mandatory
wenzelm@37351
   489
"class" prefix.  INCOMPATIBILITY.
wenzelm@37351
   490
wenzelm@37351
   491
* Vacuous class specifications observe default sort.  INCOMPATIBILITY.
wenzelm@37351
   492
wenzelm@37351
   493
* Old 'axclass' command has been discontinued.  INCOMPATIBILITY, use
wenzelm@37351
   494
'class' instead.
wenzelm@37351
   495
wenzelm@37351
   496
* Command 'code_reflect' allows to incorporate generated ML code into
wenzelm@37351
   497
runtime environment; replaces immature code_datatype antiquotation.
wenzelm@37351
   498
INCOMPATIBILITY.
wenzelm@37351
   499
wenzelm@37351
   500
* Code generator: simple concept for abstract datatypes obeying
wenzelm@37351
   501
invariants.
wenzelm@37351
   502
wenzelm@36857
   503
* Code generator: details of internal data cache have no impact on the
wenzelm@36857
   504
user space functionality any longer.
wenzelm@36857
   505
wenzelm@37351
   506
* Methods "unfold_locales" and "intro_locales" ignore non-locale
wenzelm@37351
   507
subgoals.  This is more appropriate for interpretations with 'where'.
wenzelm@36857
   508
INCOMPATIBILITY.
haftmann@34170
   509
wenzelm@36356
   510
* Command 'example_proof' opens an empty proof body.  This allows to
wenzelm@36356
   511
experiment with Isar, without producing any persistent result.
wenzelm@36356
   512
wenzelm@35413
   513
* Commands 'type_notation' and 'no_type_notation' declare type syntax
wenzelm@35413
   514
within a local theory context, with explicit checking of the
wenzelm@35413
   515
constructors involved (in contrast to the raw 'syntax' versions).
wenzelm@35413
   516
wenzelm@36178
   517
* Commands 'types' and 'typedecl' now work within a local theory
wenzelm@36178
   518
context -- without introducing dependencies on parameters or
wenzelm@36178
   519
assumptions, which is not possible in Isabelle/Pure.
wenzelm@35681
   520
wenzelm@36857
   521
* Command 'defaultsort' has been renamed to 'default_sort', it works
wenzelm@36857
   522
within a local theory context.  Minor INCOMPATIBILITY.
wenzelm@36454
   523
haftmann@34170
   524
haftmann@33993
   525
*** HOL ***
haftmann@33993
   526
wenzelm@37351
   527
* Command 'typedef' now works within a local theory context -- without
wenzelm@37351
   528
introducing dependencies on parameters or assumptions, which is not
wenzelm@37351
   529
possible in Isabelle/Pure/HOL.  Note that the logical environment may
wenzelm@37351
   530
contain multiple interpretations of local typedefs (with different
wenzelm@37351
   531
non-emptiness proofs), even in a global theory context.
wenzelm@37351
   532
wenzelm@37351
   533
* New package for quotient types.  Commands 'quotient_type' and
wenzelm@37351
   534
'quotient_definition' may be used for defining types and constants by
wenzelm@37351
   535
quotient constructions.  An example is the type of integers created by
wenzelm@37351
   536
quotienting pairs of natural numbers:
wenzelm@37380
   537
wenzelm@37351
   538
  fun
wenzelm@37380
   539
    intrel :: "(nat * nat) => (nat * nat) => bool"
wenzelm@37351
   540
  where
wenzelm@37351
   541
    "intrel (x, y) (u, v) = (x + v = u + y)"
wenzelm@37351
   542
wenzelm@37380
   543
  quotient_type int = "nat * nat" / intrel
wenzelm@37351
   544
    by (auto simp add: equivp_def expand_fun_eq)
wenzelm@37380
   545
wenzelm@37351
   546
  quotient_definition
wenzelm@37351
   547
    "0::int" is "(0::nat, 0::nat)"
wenzelm@37351
   548
wenzelm@37351
   549
The method "lifting" can be used to lift of theorems from the
wenzelm@37351
   550
underlying "raw" type to the quotient type.  The example
wenzelm@37351
   551
src/HOL/Quotient_Examples/FSet.thy includes such a quotient
wenzelm@37351
   552
construction and provides a reasoning infrastructure for finite sets.
wenzelm@37351
   553
wenzelm@37351
   554
* Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
wenzelm@37351
   555
clash with new theory Quotient in Main HOL.
wenzelm@37351
   556
wenzelm@37351
   557
* Moved the SMT binding into the main HOL session, eliminating
wenzelm@37351
   558
separate HOL-SMT session.
wenzelm@37351
   559
haftmann@37020
   560
* List membership infix mem operation is only an input abbreviation.
haftmann@37020
   561
INCOMPATIBILITY.
haftmann@37020
   562
wenzelm@37144
   563
* Theory Library/Word.thy has been removed.  Use library Word/Word.thy
wenzelm@37144
   564
for future developements; former Library/Word.thy is still present in
wenzelm@37144
   565
the AFP entry RSAPPS.
haftmann@36963
   566
wenzelm@36857
   567
* Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
wenzelm@36857
   568
longer shadowed.  INCOMPATIBILITY.
haftmann@36808
   569
huffman@36836
   570
* Dropped theorem duplicate comp_arith; use semiring_norm instead.
huffman@36836
   571
INCOMPATIBILITY.
huffman@36836
   572
huffman@36836
   573
* Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
huffman@36836
   574
INCOMPATIBILITY.
haftmann@36714
   575
wenzelm@36857
   576
* Dropped normalizing_semiring etc; use the facts in semiring classes
wenzelm@36857
   577
instead.  INCOMPATIBILITY.
wenzelm@36857
   578
huffman@36979
   579
* Dropped several real-specific versions of lemmas about floor and
wenzelm@37351
   580
ceiling; use the generic lemmas from theory "Archimedean_Field"
wenzelm@37351
   581
instead.  INCOMPATIBILITY.
huffman@36979
   582
huffman@36979
   583
  floor_number_of_eq         ~> floor_number_of
huffman@36979
   584
  le_floor_eq_number_of      ~> number_of_le_floor
huffman@36979
   585
  le_floor_eq_zero           ~> zero_le_floor
huffman@36979
   586
  le_floor_eq_one            ~> one_le_floor
huffman@36979
   587
  floor_less_eq_number_of    ~> floor_less_number_of
huffman@36979
   588
  floor_less_eq_zero         ~> floor_less_zero
huffman@36979
   589
  floor_less_eq_one          ~> floor_less_one
huffman@36979
   590
  less_floor_eq_number_of    ~> number_of_less_floor
huffman@36979
   591
  less_floor_eq_zero         ~> zero_less_floor
huffman@36979
   592
  less_floor_eq_one          ~> one_less_floor
huffman@36979
   593
  floor_le_eq_number_of      ~> floor_le_number_of
huffman@36979
   594
  floor_le_eq_zero           ~> floor_le_zero
huffman@36979
   595
  floor_le_eq_one            ~> floor_le_one
huffman@36979
   596
  floor_subtract_number_of   ~> floor_diff_number_of
huffman@36979
   597
  floor_subtract_one         ~> floor_diff_one
huffman@36979
   598
  ceiling_number_of_eq       ~> ceiling_number_of
huffman@36979
   599
  ceiling_le_eq_number_of    ~> ceiling_le_number_of
huffman@36979
   600
  ceiling_le_zero_eq         ~> ceiling_le_zero
huffman@36979
   601
  ceiling_le_eq_one          ~> ceiling_le_one
huffman@36979
   602
  less_ceiling_eq_number_of  ~> number_of_less_ceiling
huffman@36979
   603
  less_ceiling_eq_zero       ~> zero_less_ceiling
huffman@36979
   604
  less_ceiling_eq_one        ~> one_less_ceiling
huffman@36979
   605
  ceiling_less_eq_number_of  ~> ceiling_less_number_of
huffman@36979
   606
  ceiling_less_eq_zero       ~> ceiling_less_zero
huffman@36979
   607
  ceiling_less_eq_one        ~> ceiling_less_one
huffman@36979
   608
  le_ceiling_eq_number_of    ~> number_of_le_ceiling
huffman@36979
   609
  le_ceiling_eq_zero         ~> zero_le_ceiling
huffman@36979
   610
  le_ceiling_eq_one          ~> one_le_ceiling
huffman@36979
   611
  ceiling_subtract_number_of ~> ceiling_diff_number_of
huffman@36979
   612
  ceiling_subtract_one       ~> ceiling_diff_one
huffman@36979
   613
wenzelm@37144
   614
* Theory "Finite_Set": various folding_XXX locales facilitate the
wenzelm@36857
   615
application of the various fold combinators on finite sets.
wenzelm@36857
   616
wenzelm@36857
   617
* Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
wenzelm@36857
   618
provides abstract red-black tree type which is backed by "RBT_Impl" as
wenzelm@36857
   619
implementation.  INCOMPATIBILTY.
haftmann@36147
   620
huffman@36830
   621
* Theory Library/Coinductive_List has been removed -- superseded by
wenzelm@35763
   622
AFP/thys/Coinductive.
wenzelm@35763
   623
huffman@36829
   624
* Theory PReal, including the type "preal" and related operations, has
huffman@36829
   625
been removed.  INCOMPATIBILITY.
huffman@36829
   626
wenzelm@37380
   627
* Real: new development using Cauchy Sequences.
wenzelm@37380
   628
wenzelm@37351
   629
* Split off theory "Big_Operators" containing setsum, setprod,
wenzelm@37351
   630
Inf_fin, Sup_fin, Min, Max from theory Finite_Set.  INCOMPATIBILITY.
wenzelm@36857
   631
wenzelm@36857
   632
* Theory "Rational" renamed to "Rat", for consistency with "Nat",
wenzelm@36857
   633
"Int" etc.  INCOMPATIBILITY.
wenzelm@36857
   634
wenzelm@37351
   635
* Constant Rat.normalize needs to be qualified.  INCOMPATIBILITY.
wenzelm@37143
   636
wenzelm@36857
   637
* New set of rules "ac_simps" provides combined assoc / commute
wenzelm@36857
   638
rewrites for all interpretations of the appropriate generic locales.
wenzelm@36857
   639
wenzelm@36857
   640
* Renamed theory "OrderedGroup" to "Groups" and split theory
wenzelm@36857
   641
"Ring_and_Field" into theories "Rings" and "Fields"; for more
wenzelm@36857
   642
appropriate and more consistent names suitable for name prefixes
wenzelm@36857
   643
within the HOL theories.  INCOMPATIBILITY.
haftmann@35050
   644
haftmann@35084
   645
* Some generic constants have been put to appropriate theories:
wenzelm@36857
   646
  - less_eq, less: Orderings
wenzelm@36857
   647
  - zero, one, plus, minus, uminus, times, abs, sgn: Groups
wenzelm@36857
   648
  - inverse, divide: Rings
haftmann@35084
   649
INCOMPATIBILITY.
haftmann@35084
   650
wenzelm@36857
   651
* More consistent naming of type classes involving orderings (and
wenzelm@36857
   652
lattices):
haftmann@35027
   653
haftmann@35027
   654
    lower_semilattice                   ~> semilattice_inf
haftmann@35027
   655
    upper_semilattice                   ~> semilattice_sup
haftmann@35027
   656
haftmann@35027
   657
    dense_linear_order                  ~> dense_linorder
haftmann@35027
   658
haftmann@35027
   659
    pordered_ab_group_add               ~> ordered_ab_group_add
haftmann@35027
   660
    pordered_ab_group_add_abs           ~> ordered_ab_group_add_abs
haftmann@35027
   661
    pordered_ab_semigroup_add           ~> ordered_ab_semigroup_add
haftmann@35027
   662
    pordered_ab_semigroup_add_imp_le    ~> ordered_ab_semigroup_add_imp_le
haftmann@35027
   663
    pordered_cancel_ab_semigroup_add    ~> ordered_cancel_ab_semigroup_add
haftmann@35027
   664
    pordered_cancel_comm_semiring       ~> ordered_cancel_comm_semiring
haftmann@35027
   665
    pordered_cancel_semiring            ~> ordered_cancel_semiring
haftmann@35027
   666
    pordered_comm_monoid_add            ~> ordered_comm_monoid_add
haftmann@35027
   667
    pordered_comm_ring                  ~> ordered_comm_ring
haftmann@35027
   668
    pordered_comm_semiring              ~> ordered_comm_semiring
haftmann@35027
   669
    pordered_ring                       ~> ordered_ring
haftmann@35027
   670
    pordered_ring_abs                   ~> ordered_ring_abs
haftmann@35027
   671
    pordered_semiring                   ~> ordered_semiring
haftmann@35027
   672
haftmann@35027
   673
    ordered_ab_group_add                ~> linordered_ab_group_add
haftmann@35027
   674
    ordered_ab_semigroup_add            ~> linordered_ab_semigroup_add
haftmann@35027
   675
    ordered_cancel_ab_semigroup_add     ~> linordered_cancel_ab_semigroup_add
haftmann@35027
   676
    ordered_comm_semiring_strict        ~> linordered_comm_semiring_strict
haftmann@35027
   677
    ordered_field                       ~> linordered_field
haftmann@35027
   678
    ordered_field_no_lb                 ~> linordered_field_no_lb
haftmann@35027
   679
    ordered_field_no_ub                 ~> linordered_field_no_ub
haftmann@35027
   680
    ordered_field_dense_linear_order    ~> dense_linordered_field
haftmann@35027
   681
    ordered_idom                        ~> linordered_idom
haftmann@35027
   682
    ordered_ring                        ~> linordered_ring
haftmann@35027
   683
    ordered_ring_le_cancel_factor       ~> linordered_ring_le_cancel_factor
haftmann@35027
   684
    ordered_ring_less_cancel_factor     ~> linordered_ring_less_cancel_factor
haftmann@35027
   685
    ordered_ring_strict                 ~> linordered_ring_strict
haftmann@35027
   686
    ordered_semidom                     ~> linordered_semidom
haftmann@35027
   687
    ordered_semiring                    ~> linordered_semiring
haftmann@35027
   688
    ordered_semiring_1                  ~> linordered_semiring_1
haftmann@35027
   689
    ordered_semiring_1_strict           ~> linordered_semiring_1_strict
haftmann@35027
   690
    ordered_semiring_strict             ~> linordered_semiring_strict
haftmann@35027
   691
wenzelm@36857
   692
  The following slightly odd type classes have been moved to a
wenzelm@37351
   693
  separate theory Library/Lattice_Algebras:
haftmann@35032
   694
haftmann@35032
   695
    lordered_ab_group_add               ~> lattice_ab_group_add
haftmann@35032
   696
    lordered_ab_group_add_abs           ~> lattice_ab_group_add_abs
haftmann@35032
   697
    lordered_ab_group_add_meet          ~> semilattice_inf_ab_group_add
haftmann@35032
   698
    lordered_ab_group_add_join          ~> semilattice_sup_ab_group_add
haftmann@35032
   699
    lordered_ring                       ~> lattice_ring
haftmann@35032
   700
haftmann@35027
   701
INCOMPATIBILITY.
haftmann@35027
   702
haftmann@36416
   703
* Refined field classes:
wenzelm@36857
   704
  - classes division_ring_inverse_zero, field_inverse_zero,
wenzelm@36857
   705
    linordered_field_inverse_zero include rule inverse 0 = 0 --
wenzelm@36857
   706
    subsumes former division_by_zero class;
wenzelm@36857
   707
  - numerous lemmas have been ported from field to division_ring.
wenzelm@36857
   708
INCOMPATIBILITY.
haftmann@36416
   709
haftmann@36416
   710
* Refined algebra theorem collections:
wenzelm@36857
   711
  - dropped theorem group group_simps, use algebra_simps instead;
wenzelm@36857
   712
  - dropped theorem group ring_simps, use field_simps instead;
wenzelm@36857
   713
  - proper theorem collection field_simps subsumes former theorem
wenzelm@36857
   714
    groups field_eq_simps and field_simps;
wenzelm@36857
   715
  - dropped lemma eq_minus_self_iff which is a duplicate for
wenzelm@36857
   716
    equal_neg_zero.
wenzelm@36857
   717
INCOMPATIBILITY.
wenzelm@35009
   718
wenzelm@35009
   719
* Theory Finite_Set and List: some lemmas have been generalized from
wenzelm@34076
   720
sets to lattices:
wenzelm@34076
   721
haftmann@34007
   722
  fun_left_comm_idem_inter      ~> fun_left_comm_idem_inf
haftmann@34007
   723
  fun_left_comm_idem_union      ~> fun_left_comm_idem_sup
haftmann@34007
   724
  inter_Inter_fold_inter        ~> inf_Inf_fold_inf
haftmann@34007
   725
  union_Union_fold_union        ~> sup_Sup_fold_sup
haftmann@34007
   726
  Inter_fold_inter              ~> Inf_fold_inf
haftmann@34007
   727
  Union_fold_union              ~> Sup_fold_sup
haftmann@34007
   728
  inter_INTER_fold_inter        ~> inf_INFI_fold_inf
haftmann@34007
   729
  union_UNION_fold_union        ~> sup_SUPR_fold_sup
haftmann@34007
   730
  INTER_fold_inter              ~> INFI_fold_inf
haftmann@34007
   731
  UNION_fold_union              ~> SUPR_fold_sup
haftmann@34007
   732
wenzelm@37351
   733
* Theory "Complete_Lattice": lemmas top_def and bot_def have been
haftmann@36416
   734
replaced by the more convenient lemmas Inf_empty and Sup_empty.
haftmann@36416
   735
Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
haftmann@36416
   736
by Inf_insert and Sup_insert.  Lemmas Inf_UNIV and Sup_UNIV replace
haftmann@36416
   737
former Inf_Univ and Sup_Univ.  Lemmas inf_top_right and sup_bot_right
haftmann@36416
   738
subsume inf_top and sup_bot respectively.  INCOMPATIBILITY.
haftmann@36416
   739
wenzelm@36857
   740
* Reorganized theory Multiset: swapped notation of pointwise and
wenzelm@36857
   741
multiset order:
wenzelm@37351
   742
wenzelm@36857
   743
  - pointwise ordering is instance of class order with standard syntax
wenzelm@36857
   744
    <= and <;
wenzelm@36857
   745
  - multiset ordering has syntax <=# and <#; partial order properties
wenzelm@36857
   746
    are provided by means of interpretation with prefix
wenzelm@36857
   747
    multiset_order;
wenzelm@36857
   748
  - less duplication, less historical organization of sections,
wenzelm@36857
   749
    conversion from associations lists to multisets, rudimentary code
wenzelm@36857
   750
    generation;
wenzelm@36857
   751
  - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
wenzelm@36857
   752
    if needed.
wenzelm@37351
   753
nipkow@36903
   754
Renamed:
wenzelm@37351
   755
wenzelm@37351
   756
  multiset_eq_conv_count_eq  ~>  multiset_ext_iff
wenzelm@37351
   757
  multi_count_ext  ~>  multiset_ext
wenzelm@37351
   758
  diff_union_inverse2  ~>  diff_union_cancelR
wenzelm@37351
   759
wenzelm@36857
   760
INCOMPATIBILITY.
haftmann@36416
   761
nipkow@36903
   762
* Theory Permutation: replaced local "remove" by List.remove1.
nipkow@36903
   763
haftmann@36416
   764
* Code generation: ML and OCaml code is decorated with signatures.
haftmann@36416
   765
wenzelm@35009
   766
* Theory List: added transpose.
wenzelm@35009
   767
huffman@35810
   768
* Library/Nat_Bijection.thy is a collection of bijective functions
huffman@35810
   769
between nat and other types, which supersedes the older libraries
huffman@35810
   770
Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy.  INCOMPATIBILITY.
huffman@35810
   771
huffman@35810
   772
  Constants:
huffman@35810
   773
  Nat_Int_Bij.nat2_to_nat         ~> prod_encode
huffman@35810
   774
  Nat_Int_Bij.nat_to_nat2         ~> prod_decode
huffman@35810
   775
  Nat_Int_Bij.int_to_nat_bij      ~> int_encode
huffman@35810
   776
  Nat_Int_Bij.nat_to_int_bij      ~> int_decode
huffman@35810
   777
  Countable.pair_encode           ~> prod_encode
huffman@35810
   778
  NatIso.prod2nat                 ~> prod_encode
huffman@35810
   779
  NatIso.nat2prod                 ~> prod_decode
huffman@35810
   780
  NatIso.sum2nat                  ~> sum_encode
huffman@35810
   781
  NatIso.nat2sum                  ~> sum_decode
huffman@35810
   782
  NatIso.list2nat                 ~> list_encode
huffman@35810
   783
  NatIso.nat2list                 ~> list_decode
huffman@35810
   784
  NatIso.set2nat                  ~> set_encode
huffman@35810
   785
  NatIso.nat2set                  ~> set_decode
huffman@35810
   786
huffman@35810
   787
  Lemmas:
huffman@35810
   788
  Nat_Int_Bij.bij_nat_to_int_bij  ~> bij_int_decode
huffman@35810
   789
  Nat_Int_Bij.nat2_to_nat_inj     ~> inj_prod_encode
huffman@35810
   790
  Nat_Int_Bij.nat2_to_nat_surj    ~> surj_prod_encode
huffman@35810
   791
  Nat_Int_Bij.nat_to_nat2_inj     ~> inj_prod_decode
huffman@35810
   792
  Nat_Int_Bij.nat_to_nat2_surj    ~> surj_prod_decode
huffman@35810
   793
  Nat_Int_Bij.i2n_n2i_id          ~> int_encode_inverse
huffman@35810
   794
  Nat_Int_Bij.n2i_i2n_id          ~> int_decode_inverse
huffman@35810
   795
  Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
huffman@35810
   796
  Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
huffman@35810
   797
  Nat_Int_Bij.inj_nat_to_int_bij  ~> inj_int_encode
huffman@35810
   798
  Nat_Int_Bij.inj_int_to_nat_bij  ~> inj_int_decode
huffman@35810
   799
  Nat_Int_Bij.bij_nat_to_int_bij  ~> bij_int_encode
huffman@35810
   800
  Nat_Int_Bij.bij_int_to_nat_bij  ~> bij_int_decode
huffman@35810
   801
blanchet@36929
   802
* Sledgehammer:
blanchet@36929
   803
  - Renamed ATP commands:
blanchet@36929
   804
    atp_info     ~> sledgehammer running_atps
blanchet@36929
   805
    atp_kill     ~> sledgehammer kill_atps
blanchet@36929
   806
    atp_messages ~> sledgehammer messages
blanchet@36929
   807
    atp_minimize ~> sledgehammer minimize
blanchet@36929
   808
    print_atps   ~> sledgehammer available_atps
blanchet@36929
   809
    INCOMPATIBILITY.
blanchet@36929
   810
  - Added user's manual ("isabelle doc sledgehammer").
blanchet@36929
   811
  - Added option syntax and "sledgehammer_params" to customize
blanchet@36929
   812
    Sledgehammer's behavior.  See the manual for details.
blanchet@36929
   813
  - Modified the Isar proof reconstruction code so that it produces
blanchet@36929
   814
    direct proofs rather than proofs by contradiction.  (This feature
blanchet@36929
   815
    is still experimental.)
blanchet@36929
   816
  - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
blanchet@36929
   817
    full-typed mode.
blanchet@36929
   818
  - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
blanchet@36929
   819
blanchet@36928
   820
* Nitpick:
blanchet@36928
   821
  - Added and implemented "binary_ints" and "bits" options.
blanchet@36928
   822
  - Added "std" option and implemented support for nonstandard models.
blanchet@36928
   823
  - Added and implemented "finitize" option to improve the precision
blanchet@36928
   824
    of infinite datatypes based on a monotonicity analysis.
blanchet@36928
   825
  - Added support for quotient types.
blanchet@36928
   826
  - Added support for "specification" and "ax_specification"
blanchet@36928
   827
    constructs.
blanchet@36928
   828
  - Added support for local definitions (for "function" and
blanchet@36928
   829
    "termination" proofs).
blanchet@36928
   830
  - Added support for term postprocessors.
blanchet@36928
   831
  - Optimized "Multiset.multiset" and "FinFun.finfun".
blanchet@36928
   832
  - Improved efficiency of "destroy_constrs" optimization.
blanchet@36928
   833
  - Fixed soundness bugs related to "destroy_constrs" optimization and
blanchet@36928
   834
    record getters.
blanchet@37272
   835
  - Fixed soundness bug related to higher-order constructors.
blanchet@37272
   836
  - Fixed soundness bug when "full_descrs" is enabled.
blanchet@36928
   837
  - Improved precision of set constructs.
blanchet@37260
   838
  - Added "atoms" option.
blanchet@36928
   839
  - Added cache to speed up repeated Kodkod invocations on the same
blanchet@36928
   840
    problems.
blanchet@36928
   841
  - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
blanchet@36928
   842
    "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
blanchet@36928
   843
    "SAT4J_Light".  INCOMPATIBILITY.
blanchet@36928
   844
  - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
blanchet@36928
   845
    "sharing_depth", and "show_skolems" options.  INCOMPATIBILITY.
blanchet@37264
   846
  - Removed "nitpick_intro" attribute.  INCOMPATIBILITY.
blanchet@36928
   847
berghofe@37361
   848
* Method "induct" now takes instantiations of the form t, where t is not
berghofe@37361
   849
  a variable, as a shorthand for "x == t", where x is a fresh variable.
berghofe@37361
   850
  If this is not intended, t has to be enclosed in parentheses.
berghofe@37361
   851
  By default, the equalities generated by definitional instantiations
berghofe@37361
   852
  are pre-simplified, which may cause parameters of inductive cases
berghofe@37361
   853
  to disappear, or may even delete some of the inductive cases.
berghofe@37361
   854
  Use "induct (no_simp)" instead of "induct" to restore the old
berghofe@37361
   855
  behaviour. The (no_simp) option is also understood by the "cases"
berghofe@37361
   856
  and "nominal_induct" methods, which now perform pre-simplification, too.
berghofe@37361
   857
  INCOMPATIBILITY.
berghofe@37361
   858
haftmann@33993
   859
huffman@36828
   860
*** HOLCF ***
huffman@36828
   861
huffman@36828
   862
* Variable names in lemmas generated by the domain package have
huffman@36828
   863
changed; the naming scheme is now consistent with the HOL datatype
huffman@36828
   864
package.  Some proof scripts may be affected, INCOMPATIBILITY.
huffman@36828
   865
huffman@36828
   866
* The domain package no longer defines the function "foo_copy" for
huffman@36828
   867
recursive domain "foo".  The reach lemma is now stated directly in
huffman@36828
   868
terms of "foo_take".  Lemmas and proofs that mention "foo_copy" must
huffman@36828
   869
be reformulated in terms of "foo_take", INCOMPATIBILITY.
huffman@36828
   870
huffman@36828
   871
* Most definedness lemmas generated by the domain package (previously
huffman@36828
   872
of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
huffman@36828
   873
like "foo$x = UU <-> x = UU", which works better as a simp rule.
wenzelm@37351
   874
Proofs that used definedness lemmas as intro rules may break,
huffman@36828
   875
potential INCOMPATIBILITY.
huffman@36828
   876
huffman@36828
   877
* Induction and casedist rules generated by the domain package now
huffman@36828
   878
declare proper case_names (one called "bottom", and one named for each
huffman@36828
   879
constructor).  INCOMPATIBILITY.
huffman@36828
   880
huffman@36828
   881
* For mutually-recursive domains, separate "reach" and "take_lemma"
huffman@36828
   882
rules are generated for each domain, INCOMPATIBILITY.
huffman@36828
   883
huffman@36828
   884
  foo_bar.reach       ~> foo.reach  bar.reach
huffman@36828
   885
  foo_bar.take_lemmas ~> foo.take_lemma  bar.take_lemma
huffman@36828
   886
huffman@36828
   887
* Some lemmas generated by the domain package have been renamed for
huffman@36828
   888
consistency with the datatype package, INCOMPATIBILITY.
huffman@36828
   889
huffman@36828
   890
  foo.ind        ~> foo.induct
huffman@36828
   891
  foo.finite_ind ~> foo.finite_induct
huffman@36828
   892
  foo.coind      ~> foo.coinduct
huffman@36828
   893
  foo.casedist   ~> foo.exhaust
huffman@36828
   894
  foo.exhaust    ~> foo.nchotomy
huffman@36828
   895
huffman@36828
   896
* For consistency with other definition packages, the fixrec package
huffman@36828
   897
now generates qualified theorem names, INCOMPATIBILITY.
huffman@36828
   898
huffman@36828
   899
  foo_simps  ~> foo.simps
huffman@36828
   900
  foo_unfold ~> foo.unfold
huffman@36828
   901
  foo_induct ~> foo.induct
huffman@36828
   902
huffman@37087
   903
* The "fixrec_simp" attribute has been removed.  The "fixrec_simp"
huffman@37087
   904
method and internal fixrec proofs now use the default simpset instead.
huffman@37087
   905
INCOMPATIBILITY.
huffman@37087
   906
huffman@36828
   907
* The "contlub" predicate has been removed.  Proof scripts should use
huffman@36828
   908
lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
huffman@36828
   909
huffman@36828
   910
* The "admw" predicate has been removed, INCOMPATIBILITY.
huffman@36828
   911
huffman@36828
   912
* The constants cpair, cfst, and csnd have been removed in favor of
huffman@36828
   913
Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
huffman@36828
   914
huffman@36828
   915
haftmann@33993
   916
*** ML ***
haftmann@33993
   917
wenzelm@37351
   918
* Antiquotations for basic formal entities:
wenzelm@37351
   919
wenzelm@37351
   920
    @{class NAME}         -- type class
wenzelm@37351
   921
    @{class_syntax NAME}  -- syntax representation of the above
wenzelm@37351
   922
wenzelm@37351
   923
    @{type_name NAME}     -- logical type
wenzelm@37351
   924
    @{type_abbrev NAME}   -- type abbreviation
wenzelm@37351
   925
    @{nonterminal NAME}   -- type of concrete syntactic category
wenzelm@37351
   926
    @{type_syntax NAME}   -- syntax representation of any of the above
wenzelm@37351
   927
wenzelm@37351
   928
    @{const_name NAME}    -- logical constant (INCOMPATIBILITY)
wenzelm@37351
   929
    @{const_abbrev NAME}  -- abbreviated constant
wenzelm@37351
   930
    @{const_syntax NAME}  -- syntax representation of any of the above
wenzelm@37351
   931
wenzelm@37351
   932
* Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
wenzelm@37351
   933
syntax constant (cf. 'syntax' command).
wenzelm@37351
   934
wenzelm@37351
   935
* Antiquotation @{make_string} inlines a function to print arbitrary
wenzelm@37351
   936
values similar to the ML toplevel.  The result is compiler dependent
wenzelm@37351
   937
and may fall back on "?" in certain situations.
wenzelm@37351
   938
wenzelm@37351
   939
* Diagnostic commands 'ML_val' and 'ML_command' may refer to
wenzelm@37351
   940
antiquotations @{Isar.state} and @{Isar.goal}.  This replaces impure
wenzelm@37351
   941
Isar.state() and Isar.goal(), which belong to the old TTY loop and do
wenzelm@37351
   942
not work with the asynchronous Isar document model.
wenzelm@37351
   943
wenzelm@37351
   944
* Configuration options now admit dynamic default values, depending on
wenzelm@37351
   945
the context or even global references.
wenzelm@37351
   946
wenzelm@37351
   947
* SHA1.digest digests strings according to SHA-1 (see RFC 3174).  It
wenzelm@37351
   948
uses an efficient external library if available (for Poly/ML).
wenzelm@37351
   949
wenzelm@37144
   950
* Renamed some important ML structures, while keeping the old names
wenzelm@37144
   951
for some time as aliases within the structure Legacy:
wenzelm@37144
   952
wenzelm@37144
   953
  OuterKeyword  ~>  Keyword
wenzelm@37144
   954
  OuterLex      ~>  Token
wenzelm@37144
   955
  OuterParse    ~>  Parse
wenzelm@37144
   956
  OuterSyntax   ~>  Outer_Syntax
wenzelm@37216
   957
  PrintMode     ~>  Print_Mode
wenzelm@37144
   958
  SpecParse     ~>  Parse_Spec
wenzelm@37216
   959
  ThyInfo       ~>  Thy_Info
wenzelm@37216
   960
  ThyLoad       ~>  Thy_Load
wenzelm@37216
   961
  ThyOutput     ~>  Thy_Output
wenzelm@37145
   962
  TypeInfer     ~>  Type_Infer
wenzelm@37144
   963
wenzelm@37144
   964
Note that "open Legacy" simplifies porting of sources, but forgetting
wenzelm@37144
   965
to remove it again will complicate porting again in the future.
wenzelm@37144
   966
wenzelm@37144
   967
* Most operations that refer to a global context are named
wenzelm@37144
   968
accordingly, e.g. Simplifier.global_context or
wenzelm@37144
   969
ProofContext.init_global.  There are some situations where a global
wenzelm@37144
   970
context actually works, but under normal circumstances one needs to
wenzelm@37144
   971
pass the proper local context through the code!
wenzelm@37144
   972
wenzelm@37144
   973
* Discontinued old TheoryDataFun with its copy/init operation -- data
wenzelm@37144
   974
needs to be pure.  Functor Theory_Data_PP retains the traditional
wenzelm@37144
   975
Pretty.pp argument to merge, which is absent in the standard
wenzelm@37144
   976
Theory_Data version.
wenzelm@36429
   977
wenzelm@37144
   978
* Sorts.certify_sort and derived "cert" operations for types and terms
wenzelm@37144
   979
no longer minimize sorts.  Thus certification at the boundary of the
wenzelm@37144
   980
inference kernel becomes invariant under addition of class relations,
wenzelm@37144
   981
which is an important monotonicity principle.  Sorts are now minimized
wenzelm@37144
   982
in the syntax layer only, at the boundary between the end-user and the
wenzelm@37144
   983
system.  Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
wenzelm@37144
   984
explicitly in rare situations.
wenzelm@37144
   985
wenzelm@35021
   986
* Renamed old-style Drule.standard to Drule.export_without_context, to
wenzelm@35021
   987
emphasize that this is in no way a standard operation.
wenzelm@35021
   988
INCOMPATIBILITY.
wenzelm@35021
   989
wenzelm@34076
   990
* Subgoal.FOCUS (and variants): resulting goal state is normalized as
wenzelm@34076
   991
usual for resolution.  Rare INCOMPATIBILITY.
wenzelm@34076
   992
wenzelm@35845
   993
* Renamed varify/unvarify operations to varify_global/unvarify_global
wenzelm@35845
   994
to emphasize that these only work in a global situation (which is
wenzelm@35845
   995
quite rare).
wenzelm@35845
   996
wenzelm@37144
   997
* Curried take and drop in library.ML; negative length is interpreted
wenzelm@37144
   998
as infinity (as in chop).  Subtle INCOMPATIBILITY.
wenzelm@36961
   999
wenzelm@37351
  1000
* Proof terms: type substitutions on proof constants now use canonical
wenzelm@37351
  1001
order of type variables.  INCOMPATIBILITY for tools working with proof
wenzelm@37351
  1002
terms.
wenzelm@37351
  1003
wenzelm@37351
  1004
* Raw axioms/defs may no longer carry sort constraints, and raw defs
wenzelm@37351
  1005
may no longer carry premises.  User-level specifications are
wenzelm@37351
  1006
transformed accordingly by Thm.add_axiom/add_def.
wenzelm@37351
  1007
haftmann@33993
  1008
wenzelm@34238
  1009
*** System ***
wenzelm@34238
  1010
wenzelm@34238
  1011
* Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
wenzelm@34238
  1012
ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions.  Note that
wenzelm@34238
  1013
proof terms are enabled unconditionally in the new HOL-Proofs image.
wenzelm@34238
  1014
wenzelm@34255
  1015
* Discontinued old ISABELLE and ISATOOL environment settings (legacy
wenzelm@34255
  1016
feature since Isabelle2009).  Use ISABELLE_PROCESS and ISABELLE_TOOL,
wenzelm@34255
  1017
respectively.
wenzelm@34255
  1018
wenzelm@36201
  1019
* Old lib/scripts/polyml-platform is superseded by the
wenzelm@36201
  1020
ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
wenzelm@36201
  1021
variant, even on a 64 bit machine.  The following example setting
wenzelm@36201
  1022
prefers 64 bit if available:
wenzelm@36201
  1023
wenzelm@36201
  1024
  ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
wenzelm@36201
  1025
wenzelm@37218
  1026
* The preliminary Isabelle/jEdit application demonstrates the emerging
wenzelm@37218
  1027
Isabelle/Scala layer for advanced prover interaction and integration.
wenzelm@37218
  1028
See src/Tools/jEdit or "isabelle jedit" provided by the properly built
wenzelm@37218
  1029
component.
wenzelm@37218
  1030
wenzelm@37375
  1031
* "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
wenzelm@37375
  1032
and Bluesky TeX fonts.  It provides the usual Isabelle symbols,
wenzelm@37375
  1033
similar to the default assignment of the document preparation system
wenzelm@37375
  1034
(cf. isabellesym.sty).  The Isabelle/Scala class Isabelle_System
wenzelm@37375
  1035
provides some operations for direct access to the font without asking
wenzelm@37375
  1036
the user for manual installation.
wenzelm@37375
  1037
wenzelm@34238
  1038
haftmann@33993
  1039
wenzelm@33842
  1040
New in Isabelle2009-1 (December 2009)
wenzelm@33842
  1041
-------------------------------------
wenzelm@30904
  1042
wenzelm@31547
  1043
*** General ***
wenzelm@31547
  1044
wenzelm@31547
  1045
* Discontinued old form of "escaped symbols" such as \\<forall>.  Only
wenzelm@31547
  1046
one backslash should be used, even in ML sources.
wenzelm@31547
  1047
wenzelm@31547
  1048
haftmann@30951
  1049
*** Pure ***
haftmann@30951
  1050
ballarin@32846
  1051
* Locale interpretation propagates mixins along the locale hierarchy.
ballarin@32846
  1052
The currently only available mixins are the equations used to map
ballarin@32846
  1053
local definitions to terms of the target domain of an interpretation.
ballarin@32846
  1054
wenzelm@33842
  1055
* Reactivated diagnostic command 'print_interps'.  Use "print_interps
wenzelm@33842
  1056
loc" to print all interpretations of locale "loc" in the theory.
wenzelm@33842
  1057
Interpretations in proofs are not shown.
ballarin@32846
  1058
ballarin@32983
  1059
* Thoroughly revised locales tutorial.  New section on conditional
ballarin@32983
  1060
interpretation.
ballarin@32983
  1061
wenzelm@33843
  1062
* On instantiation of classes, remaining undefined class parameters
wenzelm@33843
  1063
are formally declared.  INCOMPATIBILITY.
wenzelm@33843
  1064
haftmann@30951
  1065
wenzelm@33842
  1066
*** Document preparation ***
wenzelm@33842
  1067
wenzelm@33842
  1068
* New generalized style concept for printing terms: @{foo (style) ...}
wenzelm@33842
  1069
instead of @{foo_style style ...}  (old form is still retained for
wenzelm@33842
  1070
backward compatibility).  Styles can be also applied for
wenzelm@33842
  1071
antiquotations prop, term_type and typeof.
haftmann@32891
  1072
haftmann@32891
  1073
haftmann@30930
  1074
*** HOL ***
haftmann@30930
  1075
wenzelm@33842
  1076
* New proof method "smt" for a combination of first-order logic with
wenzelm@33842
  1077
equality, linear and nonlinear (natural/integer/real) arithmetic, and
wenzelm@33842
  1078
fixed-size bitvectors; there is also basic support for higher-order
wenzelm@33842
  1079
features (esp. lambda abstractions).  It is an incomplete decision
wenzelm@33842
  1080
procedure based on external SMT solvers using the oracle mechanism;
wenzelm@33842
  1081
for the SMT solver Z3, this method is proof-producing.  Certificates
wenzelm@33842
  1082
are provided to avoid calling the external solvers solely for
wenzelm@33842
  1083
re-checking proofs.  Due to a remote SMT service there is no need for
wenzelm@33842
  1084
installing SMT solvers locally.  See src/HOL/SMT.
wenzelm@33842
  1085
wenzelm@33842
  1086
* New commands to load and prove verification conditions generated by
wenzelm@33842
  1087
the Boogie program verifier or derived systems (e.g. the Verifying C
wenzelm@33842
  1088
Compiler (VCC) or Spec#).  See src/HOL/Boogie.
wenzelm@33842
  1089
wenzelm@33842
  1090
* New counterexample generator tool 'nitpick' based on the Kodkod
wenzelm@33842
  1091
relational model finder.  See src/HOL/Tools/Nitpick and
wenzelm@33842
  1092
src/HOL/Nitpick_Examples.
wenzelm@33842
  1093
haftmann@33860
  1094
* New commands 'code_pred' and 'values' to invoke the predicate
haftmann@33860
  1095
compiler and to enumerate values of inductive predicates.
haftmann@33860
  1096
haftmann@33860
  1097
* A tabled implementation of the reflexive transitive closure.
haftmann@33860
  1098
haftmann@33860
  1099
* New implementation of quickcheck uses generic code generator;
haftmann@33860
  1100
default generators are provided for all suitable HOL types, records
haftmann@33860
  1101
and datatypes.  Old quickcheck can be re-activated importing theory
haftmann@33860
  1102
Library/SML_Quickcheck.
haftmann@33860
  1103
wenzelm@33843
  1104
* New testing tool Mirabelle for automated proof tools.  Applies
wenzelm@33843
  1105
several tools and tactics like sledgehammer, metis, or quickcheck, to
wenzelm@33843
  1106
every proof step in a theory.  To be used in batch mode via the
wenzelm@33843
  1107
"mirabelle" utility.
wenzelm@33843
  1108
wenzelm@33843
  1109
* New proof method "sos" (sum of squares) for nonlinear real
wenzelm@33843
  1110
arithmetic (originally due to John Harison). It requires theory
wenzelm@33843
  1111
Library/Sum_Of_Squares.  It is not a complete decision procedure but
wenzelm@33843
  1112
works well in practice on quantifier-free real arithmetic with +, -,
wenzelm@33843
  1113
*, ^, =, <= and <, i.e. boolean combinations of equalities and
wenzelm@33843
  1114
inequalities between polynomials.  It makes use of external
wenzelm@33843
  1115
semidefinite programming solvers.  Method "sos" generates a
wenzelm@33843
  1116
certificate that can be pasted into the proof thus avoiding the need
wenzelm@33843
  1117
to call an external tool every time the proof is checked.  See
wenzelm@33843
  1118
src/HOL/Library/Sum_Of_Squares.
wenzelm@33843
  1119
wenzelm@33843
  1120
* New method "linarith" invokes existing linear arithmetic decision
wenzelm@33843
  1121
procedure only.
wenzelm@33843
  1122
wenzelm@33843
  1123
* New command 'atp_minimal' reduces result produced by Sledgehammer.
wenzelm@33843
  1124
wenzelm@33843
  1125
* New Sledgehammer option "Full Types" in Proof General settings menu.
wenzelm@33843
  1126
Causes full type information to be output to the ATPs.  This slows
wenzelm@33843
  1127
ATPs down considerably but eliminates a source of unsound "proofs"
wenzelm@33843
  1128
that fail later.
wenzelm@33843
  1129
wenzelm@33843
  1130
* New method "metisFT": A version of metis that uses full type
wenzelm@33843
  1131
information in order to avoid failures of proof reconstruction.
wenzelm@33843
  1132
wenzelm@33843
  1133
* New evaluator "approximate" approximates an real valued term using
wenzelm@33843
  1134
the same method as the approximation method.
wenzelm@33843
  1135
wenzelm@33843
  1136
* Method "approximate" now supports arithmetic expressions as
wenzelm@33843
  1137
boundaries of intervals and implements interval splitting and Taylor
wenzelm@33843
  1138
series expansion.
wenzelm@33843
  1139
wenzelm@33843
  1140
* ML antiquotation @{code_datatype} inserts definition of a datatype
wenzelm@33843
  1141
generated by the code generator; e.g. see src/HOL/Predicate.thy.
wenzelm@33843
  1142
haftmann@33860
  1143
* New theory SupInf of the supremum and infimum operators for sets of
haftmann@33860
  1144
reals.
haftmann@33860
  1145
haftmann@33860
  1146
* New theory Probability, which contains a development of measure
haftmann@33860
  1147
theory, eventually leading to Lebesgue integration and probability.
haftmann@33860
  1148
haftmann@33860
  1149
* Extended Multivariate Analysis to include derivation and Brouwer's
haftmann@33860
  1150
fixpoint theorem.
wenzelm@33843
  1151
wenzelm@33842
  1152
* Reorganization of number theory, INCOMPATIBILITY:
wenzelm@33873
  1153
  - new number theory development for nat and int, in theories Divides
wenzelm@33873
  1154
    and GCD as well as in new session Number_Theory
wenzelm@33873
  1155
  - some constants and facts now suffixed with _nat and _int
wenzelm@33873
  1156
    accordingly
wenzelm@33873
  1157
  - former session NumberTheory now named Old_Number_Theory, including
wenzelm@33873
  1158
    theories Legacy_GCD and Primes (prefer Number_Theory if possible)
wenzelm@33842
  1159
  - moved theory Pocklington from src/HOL/Library to
wenzelm@33842
  1160
    src/HOL/Old_Number_Theory
haftmann@32479
  1161
wenzelm@33873
  1162
* Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
wenzelm@33873
  1163
lcm of finite and infinite sets. It is shown that they form a complete
haftmann@32600
  1164
lattice.
haftmann@32600
  1165
haftmann@32600
  1166
* Class semiring_div requires superclass no_zero_divisors and proof of
haftmann@32600
  1167
div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
haftmann@32600
  1168
div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
haftmann@32600
  1169
generalized to class semiring_div, subsuming former theorems
haftmann@32600
  1170
zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
haftmann@32600
  1171
zdiv_zmult_zmult2.  div_mult_mult1 is now [simp] by default.
haftmann@32600
  1172
INCOMPATIBILITY.
haftmann@32600
  1173
haftmann@32588
  1174
* Refinements to lattice classes and sets:
haftmann@32064
  1175
  - less default intro/elim rules in locale variant, more default
haftmann@32064
  1176
    intro/elim rules in class variant: more uniformity
wenzelm@33842
  1177
  - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
wenzelm@33842
  1178
    le_inf_iff
wenzelm@33842
  1179
  - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
wenzelm@33842
  1180
    sup_aci)
haftmann@32064
  1181
  - renamed ACI to inf_sup_aci
haftmann@32600
  1182
  - new class "boolean_algebra"
wenzelm@33842
  1183
  - class "complete_lattice" moved to separate theory
haftmann@33860
  1184
    "Complete_Lattice"; corresponding constants (and abbreviations)
wenzelm@33842
  1185
    renamed and with authentic syntax:
haftmann@33860
  1186
    Set.Inf ~>    Complete_Lattice.Inf
haftmann@33860
  1187
    Set.Sup ~>    Complete_Lattice.Sup
haftmann@33860
  1188
    Set.INFI ~>   Complete_Lattice.INFI
haftmann@33860
  1189
    Set.SUPR ~>   Complete_Lattice.SUPR
haftmann@33860
  1190
    Set.Inter ~>  Complete_Lattice.Inter
haftmann@33860
  1191
    Set.Union ~>  Complete_Lattice.Union
haftmann@33860
  1192
    Set.INTER ~>  Complete_Lattice.INTER
haftmann@33860
  1193
    Set.UNION ~>  Complete_Lattice.UNION
haftmann@32600
  1194
  - authentic syntax for
haftmann@32600
  1195
    Set.Pow
haftmann@32600
  1196
    Set.image
haftmann@32588
  1197
  - mere abbreviations:
haftmann@32588
  1198
    Set.empty               (for bot)
haftmann@32588
  1199
    Set.UNIV                (for top)
haftmann@33860
  1200
    Set.inter               (for inf, formerly Set.Int)
haftmann@33860
  1201
    Set.union               (for sup, formerly Set.Un)
haftmann@32588
  1202
    Complete_Lattice.Inter  (for Inf)
haftmann@32588
  1203
    Complete_Lattice.Union  (for Sup)
haftmann@32606
  1204
    Complete_Lattice.INTER  (for INFI)
haftmann@32606
  1205
    Complete_Lattice.UNION  (for SUPR)
haftmann@32600
  1206
  - object-logic definitions as far as appropriate
haftmann@32217
  1207
haftmann@32691
  1208
INCOMPATIBILITY.  Care is required when theorems Int_subset_iff or
wenzelm@33842
  1209
Un_subset_iff are explicitly deleted as default simp rules; then also
wenzelm@33842
  1210
their lattice counterparts le_inf_iff and le_sup_iff have to be
haftmann@32691
  1211
deleted to achieve the desired effect.
haftmann@32064
  1212
wenzelm@33842
  1213
* Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
wenzelm@33842
  1214
rules by default any longer; the same applies to min_max.inf_absorb1
wenzelm@33842
  1215
etc.  INCOMPATIBILITY.
wenzelm@33842
  1216
wenzelm@33842
  1217
* Rules sup_Int_eq and sup_Un_eq are no longer declared as
wenzelm@33842
  1218
pred_set_conv by default.  INCOMPATIBILITY.
wenzelm@33842
  1219
wenzelm@33842
  1220
* Power operations on relations and functions are now one dedicated
haftmann@32706
  1221
constant "compow" with infix syntax "^^".  Power operation on
wenzelm@31547
  1222
multiplicative monoids retains syntax "^" and is now defined generic
wenzelm@31547
  1223
in class power.  INCOMPATIBILITY.
wenzelm@31547
  1224
wenzelm@33842
  1225
* Relation composition "R O S" now has a more standard argument order:
wenzelm@33842
  1226
"R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}".  INCOMPATIBILITY,
wenzelm@33842
  1227
rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
wenzelm@33842
  1228
break, since the O_assoc rule was not rewritten like this.  Fix using
wenzelm@33842
  1229
O_assoc[symmetric].  The same applies to the curried version "R OO S".
wenzelm@32427
  1230
nipkow@33057
  1231
* Function "Inv" is renamed to "inv_into" and function "inv" is now an
wenzelm@33842
  1232
abbreviation for "inv_into UNIV".  Lemmas are renamed accordingly.
nipkow@32988
  1233
INCOMPATIBILITY.
nipkow@32988
  1234
haftmann@33860
  1235
* Most rules produced by inductive and datatype package have mandatory
haftmann@33860
  1236
prefixes.  INCOMPATIBILITY.
nipkow@31790
  1237
wenzelm@33842
  1238
* Changed "DERIV_intros" to a dynamic fact, which can be augmented by
wenzelm@33842
  1239
the attribute of the same name.  Each of the theorems in the list
wenzelm@33842
  1240
DERIV_intros assumes composition with an additional function and
wenzelm@33842
  1241
matches a variable to the derivative, which has to be solved by the
wenzelm@33842
  1242
Simplifier.  Hence (auto intro!: DERIV_intros) computes the derivative
wenzelm@33873
  1243
of most elementary terms.  Former Maclauren.DERIV_tac and
wenzelm@33873
  1244
Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
wenzelm@33873
  1245
INCOMPATIBILITY.
haftmann@33860
  1246
haftmann@33860
  1247
* Code generator attributes follow the usual underscore convention:
haftmann@33860
  1248
    code_unfold     replaces    code unfold
haftmann@33860
  1249
    code_post       replaces    code post
haftmann@33860
  1250
    etc.
haftmann@33860
  1251
  INCOMPATIBILITY.
wenzelm@31900
  1252
krauss@33471
  1253
* Renamed methods:
krauss@33471
  1254
    sizechange -> size_change
krauss@33471
  1255
    induct_scheme -> induction_schema
haftmann@33860
  1256
  INCOMPATIBILITY.
nipkow@33673
  1257
wenzelm@33843
  1258
* Discontinued abbreviation "arbitrary" of constant "undefined".
wenzelm@33843
  1259
INCOMPATIBILITY, use "undefined" directly.
wenzelm@33843
  1260
haftmann@33860
  1261
* Renamed theorems:
haftmann@33860
  1262
    Suc_eq_add_numeral_1 -> Suc_eq_plus1
haftmann@33860
  1263
    Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
haftmann@33860
  1264
    Suc_plus1 -> Suc_eq_plus1
haftmann@33860
  1265
    *anti_sym -> *antisym*
haftmann@33860
  1266
    vector_less_eq_def -> vector_le_def
haftmann@33860
  1267
  INCOMPATIBILITY.
haftmann@33860
  1268
haftmann@33860
  1269
* Added theorem List.map_map as [simp].  Removed List.map_compose.
haftmann@33860
  1270
INCOMPATIBILITY.
haftmann@33860
  1271
haftmann@33860
  1272
* Removed predicate "M hassize n" (<--> card M = n & finite M).
haftmann@33860
  1273
INCOMPATIBILITY.
haftmann@33860
  1274
hoelzl@31812
  1275
huffman@33825
  1276
*** HOLCF ***
huffman@33825
  1277
wenzelm@33842
  1278
* Theory Representable defines a class "rep" of domains that are
wenzelm@33842
  1279
representable (via an ep-pair) in the universal domain type "udom".
huffman@33825
  1280
Instances are provided for all type constructors defined in HOLCF.
huffman@33825
  1281
huffman@33825
  1282
* The 'new_domain' command is a purely definitional version of the
huffman@33825
  1283
domain package, for representable domains.  Syntax is identical to the
huffman@33825
  1284
old domain package.  The 'new_domain' package also supports indirect
huffman@33825
  1285
recursion using previously-defined type constructors.  See
wenzelm@33842
  1286
src/HOLCF/ex/New_Domain.thy for examples.
wenzelm@33842
  1287
wenzelm@33842
  1288
* Method "fixrec_simp" unfolds one step of a fixrec-defined constant
huffman@33825
  1289
on the left-hand side of an equation, and then performs
huffman@33825
  1290
simplification.  Rewriting is done using rules declared with the
wenzelm@33842
  1291
"fixrec_simp" attribute.  The "fixrec_simp" method is intended as a
wenzelm@33842
  1292
replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
huffman@33825
  1293
huffman@33825
  1294
* The pattern-match compiler in 'fixrec' can now handle constructors
huffman@33825
  1295
with HOL function types.  Pattern-match combinators for the Pair
huffman@33825
  1296
constructor are pre-configured.
huffman@33825
  1297
huffman@33825
  1298
* The 'fixrec' package now produces better fixed-point induction rules
huffman@33825
  1299
for mutually-recursive definitions:  Induction rules have conclusions
huffman@33825
  1300
of the form "P foo bar" instead of "P <foo, bar>".
huffman@33825
  1301
huffman@33825
  1302
* The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
huffman@33825
  1303
been renamed to "below".  The name "below" now replaces "less" in many
wenzelm@33842
  1304
theorem names.  (Legacy theorem names using "less" are still supported
wenzelm@33842
  1305
as well.)
huffman@33825
  1306
huffman@33825
  1307
* The 'fixrec' package now supports "bottom patterns".  Bottom
huffman@33825
  1308
patterns can be used to generate strictness rules, or to make
huffman@33825
  1309
functions more strict (much like the bang-patterns supported by the
wenzelm@33873
  1310
Glasgow Haskell Compiler).  See src/HOLCF/ex/Fixrec_ex.thy for
wenzelm@33873
  1311
examples.
huffman@33825
  1312
huffman@33825
  1313
wenzelm@31304
  1314
*** ML ***
wenzelm@31304
  1315
wenzelm@33843
  1316
* Support for Poly/ML 5.3.0, with improved reporting of compiler
wenzelm@33843
  1317
errors and run-time exceptions, including detailed source positions.
wenzelm@33843
  1318
wenzelm@33843
  1319
* Structure Name_Space (formerly NameSpace) now manages uniquely
wenzelm@33843
  1320
identified entries, with some additional information such as source
wenzelm@33843
  1321
position, logical grouping etc.
wenzelm@33843
  1322
wenzelm@33524
  1323
* Theory and context data is now introduced by the simplified and
wenzelm@33524
  1324
modernized functors Theory_Data, Proof_Data, Generic_Data.  Data needs
wenzelm@33524
  1325
to be pure, but the old TheoryDataFun for mutable data (with explicit
wenzelm@33524
  1326
copy operation) is still available for some time.
wenzelm@33524
  1327
wenzelm@32742
  1328
* Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
wenzelm@32742
  1329
provides a high-level programming interface to synchronized state
wenzelm@32742
  1330
variables with atomic update.  This works via pure function
wenzelm@32742
  1331
application within a critical section -- its runtime should be as
wenzelm@32742
  1332
short as possible; beware of deadlocks if critical code is nested,
wenzelm@32742
  1333
either directly or indirectly via other synchronized variables!
wenzelm@32742
  1334
wenzelm@32742
  1335
* Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
wenzelm@32742
  1336
wraps raw ML references, explicitly indicating their non-thread-safe
wenzelm@32742
  1337
behaviour.  The Isar toplevel keeps this structure open, to
wenzelm@32742
  1338
accommodate Proof General as well as quick and dirty interactive
wenzelm@32742
  1339
experiments with references.
wenzelm@32742
  1340
wenzelm@32365
  1341
* PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
wenzelm@32365
  1342
parallel tactical reasoning.
wenzelm@32365
  1343
wenzelm@32427
  1344
* Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
wenzelm@32427
  1345
are similar to SUBPROOF, but are slightly more flexible: only the
wenzelm@32427
  1346
specified parts of the subgoal are imported into the context, and the
wenzelm@32427
  1347
body tactic may introduce new subgoals and schematic variables.
wenzelm@32427
  1348
wenzelm@32427
  1349
* Old tactical METAHYPS, which does not observe the proof context, has
wenzelm@32427
  1350
been renamed to Old_Goals.METAHYPS and awaits deletion.  Use SUBPROOF
wenzelm@32427
  1351
or Subgoal.FOCUS etc.
wenzelm@32216
  1352
wenzelm@31971
  1353
* Renamed functor TableFun to Table, and GraphFun to Graph.  (Since
wenzelm@31971
  1354
functors have their own ML name space there is no point to mark them
wenzelm@31971
  1355
separately.)  Minor INCOMPATIBILITY.
wenzelm@31971
  1356
wenzelm@31901
  1357
* Renamed NamedThmsFun to Named_Thms.  INCOMPATIBILITY.
wenzelm@31901
  1358
wenzelm@33842
  1359
* Renamed several structures FooBar to Foo_Bar.  Occasional,
wenzelm@33842
  1360
INCOMPATIBILITY.
wenzelm@33842
  1361
wenzelm@33843
  1362
* Operations of structure Skip_Proof no longer require quick_and_dirty
wenzelm@33843
  1363
mode, which avoids critical setmp.
wenzelm@33843
  1364
wenzelm@31306
  1365
* Eliminated old Attrib.add_attributes, Method.add_methods and related
wenzelm@33842
  1366
combinators for "args".  INCOMPATIBILITY, need to use simplified
wenzelm@31306
  1367
Attrib/Method.setup introduced in Isabelle2009.
wenzelm@31304
  1368
wenzelm@32151
  1369
* Proper context for simpset_of, claset_of, clasimpset_of.  May fall
wenzelm@32151
  1370
back on global_simpset_of, global_claset_of, global_clasimpset_of as
wenzelm@32151
  1371
last resort.  INCOMPATIBILITY.
wenzelm@32151
  1372
wenzelm@32092
  1373
* Display.pretty_thm now requires a proper context (cf. former
wenzelm@32092
  1374
ProofContext.pretty_thm).  May fall back on Display.pretty_thm_global
wenzelm@32092
  1375
or even Display.pretty_thm_without_context as last resort.
wenzelm@32092
  1376
INCOMPATIBILITY.
wenzelm@32092
  1377
wenzelm@32433
  1378
* Discontinued Display.pretty_ctyp/cterm etc.  INCOMPATIBILITY, use
wenzelm@32433
  1379
Syntax.pretty_typ/term directly, preferably with proper context
wenzelm@32433
  1380
instead of global theory.
wenzelm@32433
  1381
wenzelm@31304
  1382
wenzelm@31308
  1383
*** System ***
wenzelm@31308
  1384
wenzelm@33842
  1385
* Further fine tuning of parallel proof checking, scales up to 8 cores
wenzelm@33842
  1386
(max. speedup factor 5.0).  See also Goal.parallel_proofs in ML and
wenzelm@33842
  1387
usedir option -q.
wenzelm@33842
  1388
wenzelm@32326
  1389
* Support for additional "Isabelle components" via etc/components, see
wenzelm@32326
  1390
also the system manual.
wenzelm@32326
  1391
wenzelm@32326
  1392
* The isabelle makeall tool now operates on all components with
wenzelm@32326
  1393
IsaMakefile, not just hardwired "logics".
wenzelm@32326
  1394
wenzelm@33842
  1395
* Removed "compress" option from isabelle-process and isabelle usedir;
wenzelm@33842
  1396
this is always enabled.
kleing@33818
  1397
wenzelm@31308
  1398
* Discontinued support for Poly/ML 4.x versions.
wenzelm@31308
  1399
wenzelm@33842
  1400
* Isabelle tool "wwwfind" provides web interface for 'find_theorems'
wenzelm@33842
  1401
on a given logic image.  This requires the lighttpd webserver and is
wenzelm@33842
  1402
currently supported on Linux only.
wenzelm@32061
  1403
wenzelm@31308
  1404
wenzelm@31304
  1405
wenzelm@30845
  1406
New in Isabelle2009 (April 2009)
wenzelm@30845
  1407
--------------------------------
haftmann@27104
  1408
wenzelm@27599
  1409
*** General ***
wenzelm@27599
  1410
wenzelm@28504
  1411
* Simplified main Isabelle executables, with less surprises on
wenzelm@28504
  1412
case-insensitive file-systems (such as Mac OS).
wenzelm@28504
  1413
wenzelm@28504
  1414
  - The main Isabelle tool wrapper is now called "isabelle" instead of
wenzelm@28504
  1415
    "isatool."
wenzelm@28504
  1416
wenzelm@28504
  1417
  - The former "isabelle" alias for "isabelle-process" has been
wenzelm@28504
  1418
    removed (should rarely occur to regular users).
wenzelm@28504
  1419
wenzelm@28915
  1420
  - The former "isabelle-interface" and its alias "Isabelle" have been
wenzelm@28915
  1421
    removed (interfaces are now regular Isabelle tools).
wenzelm@28504
  1422
wenzelm@28504
  1423
Within scripts and make files, the Isabelle environment variables
wenzelm@28504
  1424
ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
wenzelm@28504
  1425
respectively.  (The latter are still available as legacy feature.)
wenzelm@28504
  1426
wenzelm@28915
  1427
The old isabelle-interface wrapper could react in confusing ways if
wenzelm@28915
  1428
the interface was uninstalled or changed otherwise.  Individual
wenzelm@28915
  1429
interface tool configuration is now more explicit, see also the
wenzelm@28915
  1430
Isabelle system manual.  In particular, Proof General is now available
wenzelm@28915
  1431
via "isabelle emacs".
wenzelm@28504
  1432
wenzelm@28504
  1433
INCOMPATIBILITY, need to adapt derivative scripts.  Users may need to
wenzelm@28504
  1434
purge installed copies of Isabelle executables and re-run "isabelle
wenzelm@28504
  1435
install -p ...", or use symlinks.
wenzelm@28504
  1436
wenzelm@28914
  1437
* The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
wenzelm@30845
  1438
old ~/isabelle, which was slightly non-standard and apt to cause
wenzelm@30845
  1439
surprises on case-insensitive file-systems (such as Mac OS).
wenzelm@28914
  1440
wenzelm@28914
  1441
INCOMPATIBILITY, need to move existing ~/isabelle/etc,
wenzelm@28914
  1442
~/isabelle/heaps, ~/isabelle/browser_info to the new place.  Special
wenzelm@28914
  1443
care is required when using older releases of Isabelle.  Note that
wenzelm@28914
  1444
ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
wenzelm@30845
  1445
Isabelle distribution, in order to use the new ~/.isabelle uniformly.
wenzelm@28914
  1446
wenzelm@29161
  1447
* Proofs of fully specified statements are run in parallel on
wenzelm@30845
  1448
multi-core systems.  A speedup factor of 2.5 to 3.2 can be expected on
wenzelm@30845
  1449
a regular 4-core machine, if the initial heap space is made reasonably
wenzelm@30845
  1450
large (cf. Poly/ML option -H).  (Requires Poly/ML 5.2.1 or later.)
wenzelm@30845
  1451
wenzelm@30845
  1452
* The main reference manuals ("isar-ref", "implementation", and
wenzelm@30845
  1453
"system") have been updated and extended.  Formally checked references
wenzelm@30845
  1454
as hyperlinks are now available uniformly.
wenzelm@30845
  1455
wenzelm@30163
  1456
wenzelm@27599
  1457
*** Pure ***
wenzelm@27599
  1458
wenzelm@30845
  1459
* Complete re-implementation of locales.  INCOMPATIBILITY in several
wenzelm@30845
  1460
respects.  The most important changes are listed below.  See the
wenzelm@30845
  1461
Tutorial on Locales ("locales" manual) for details.
ballarin@29253
  1462
ballarin@29253
  1463
- In locale expressions, instantiation replaces renaming.  Parameters
ballarin@29253
  1464
must be declared in a for clause.  To aid compatibility with previous
ballarin@29253
  1465
parameter inheritance, in locale declarations, parameters that are not
ballarin@29253
  1466
'touched' (instantiation position "_" or omitted) are implicitly added
ballarin@29253
  1467
with their syntax at the beginning of the for clause.
ballarin@29253
  1468
ballarin@29253
  1469
- Syntax from abbreviations and definitions in locales is available in
ballarin@29253
  1470
locale expressions and context elements.  The latter is particularly
ballarin@29253
  1471
useful in locale declarations.
ballarin@29253
  1472
ballarin@29253
  1473
- More flexible mechanisms to qualify names generated by locale
ballarin@29253
  1474
expressions.  Qualifiers (prefixes) may be specified in locale
wenzelm@30728
  1475
expressions, and can be marked as mandatory (syntax: "name!:") or
wenzelm@30728
  1476
optional (syntax "name?:").  The default depends for plain "name:"
wenzelm@30728
  1477
depends on the situation where a locale expression is used: in
wenzelm@30728
  1478
commands 'locale' and 'sublocale' prefixes are optional, in
wenzelm@30845
  1479
'interpretation' and 'interpret' prefixes are mandatory.  The old
wenzelm@30728
  1480
implicit qualifiers derived from the parameter names of a locale are
wenzelm@30728
  1481
no longer generated.
wenzelm@30106
  1482
wenzelm@30845
  1483
- Command "sublocale l < e" replaces "interpretation l < e".  The
wenzelm@30106
  1484
instantiation clause in "interpretation" and "interpret" (square
wenzelm@30106
  1485
brackets) is no longer available.  Use locale expressions.
ballarin@29253
  1486
wenzelm@30845
  1487
- When converting proof scripts, mandatory qualifiers in
wenzelm@30728
  1488
'interpretation' and 'interpret' should be retained by default, even
wenzelm@30845
  1489
if this is an INCOMPATIBILITY compared to former behavior.  In the
wenzelm@30845
  1490
worst case, use the "name?:" form for non-mandatory ones.  Qualifiers
wenzelm@30845
  1491
in locale expressions range over a single locale instance only.
wenzelm@30845
  1492
wenzelm@30845
  1493
- Dropped locale element "includes".  This is a major INCOMPATIBILITY.
wenzelm@30845
  1494
In existing theorem specifications replace the includes element by the
wenzelm@30845
  1495
respective context elements of the included locale, omitting those
wenzelm@30845
  1496
that are already present in the theorem specification.  Multiple
wenzelm@30845
  1497
assume elements of a locale should be replaced by a single one
wenzelm@30845
  1498
involving the locale predicate.  In the proof body, declarations (most
wenzelm@30845
  1499
notably theorems) may be regained by interpreting the respective
wenzelm@30845
  1500
locales in the proof context as required (command "interpret").
wenzelm@30845
  1501
wenzelm@30845
  1502
If using "includes" in replacement of a target solely because the
wenzelm@30845
  1503
parameter types in the theorem are not as general as in the target,
wenzelm@30845
  1504
consider declaring a new locale with additional type constraints on
wenzelm@30845
  1505
the parameters (context element "constrains").
wenzelm@30845
  1506
wenzelm@30845
  1507
- Discontinued "locale (open)".  INCOMPATIBILITY.
wenzelm@30845
  1508
wenzelm@30845
  1509
- Locale interpretation commands no longer attempt to simplify goal.
wenzelm@30845
  1510
INCOMPATIBILITY: in rare situations the generated goal differs.  Use
wenzelm@30845
  1511
methods intro_locales and unfold_locales to clarify.
wenzelm@30845
  1512
wenzelm@30845
  1513
- Locale interpretation commands no longer accept interpretation
wenzelm@30845
  1514
attributes.  INCOMPATIBILITY.
wenzelm@30845
  1515
wenzelm@30845
  1516
* Class declaration: so-called "base sort" must not be given in import
wenzelm@30845
  1517
list any longer, but is inferred from the specification.  Particularly
wenzelm@30845
  1518
in HOL, write
wenzelm@30845
  1519
wenzelm@30845
  1520
    class foo = ...
wenzelm@30845
  1521
wenzelm@30845
  1522
instead of
wenzelm@30845
  1523
wenzelm@30845
  1524
    class foo = type + ...
wenzelm@30845
  1525
wenzelm@30845
  1526
* Class target: global versions of theorems stemming do not carry a
wenzelm@30845
  1527
parameter prefix any longer.  INCOMPATIBILITY.
wenzelm@30845
  1528
wenzelm@30845
  1529
* Class 'instance' command no longer accepts attached definitions.
wenzelm@30845
  1530
INCOMPATIBILITY, use proper 'instantiation' target instead.
wenzelm@30845
  1531
wenzelm@30845
  1532
* Recovered hiding of consts, which was accidentally broken in
wenzelm@30845
  1533
Isabelle2007.  Potential INCOMPATIBILITY, ``hide const c'' really
wenzelm@30845
  1534
makes c inaccessible; consider using ``hide (open) const c'' instead.
wenzelm@30845
  1535
wenzelm@30845
  1536
* Slightly more coherent Pure syntax, with updated documentation in
wenzelm@30845
  1537
isar-ref manual.  Removed locales meta_term_syntax and
wenzelm@30845
  1538
meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
wenzelm@30845
  1539
INCOMPATIBILITY in rare situations.  Note that &&& should not be used
wenzelm@30845
  1540
directly in regular applications.
wenzelm@30845
  1541
wenzelm@30845
  1542
* There is a new syntactic category "float_const" for signed decimal
wenzelm@30845
  1543
fractions (e.g. 123.45 or -123.45).
wenzelm@30845
  1544
wenzelm@30845
  1545
* Removed exotic 'token_translation' command.  INCOMPATIBILITY, use ML
wenzelm@30845
  1546
interface with 'setup' command instead.
wenzelm@30845
  1547
wenzelm@30845
  1548
* Command 'local_setup' is similar to 'setup', but operates on a local
wenzelm@30845
  1549
theory context.
haftmann@27104
  1550
wenzelm@28114
  1551
* The 'axiomatization' command now only works within a global theory
wenzelm@28114
  1552
context.  INCOMPATIBILITY.
wenzelm@28114
  1553
wenzelm@30845
  1554
* Goal-directed proof now enforces strict proof irrelevance wrt. sort
wenzelm@30845
  1555
hypotheses.  Sorts required in the course of reasoning need to be
wenzelm@30845
  1556
covered by the constraints in the initial statement, completed by the
wenzelm@30845
  1557
type instance information of the background theory.  Non-trivial sort
wenzelm@30845
  1558
hypotheses, which rarely occur in practice, may be specified via
wenzelm@30845
  1559
vacuous propositions of the form SORT_CONSTRAINT('a::c).  For example:
wenzelm@30845
  1560
wenzelm@30845
  1561
  lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
wenzelm@30845
  1562
wenzelm@30845
  1563
The result contains an implicit sort hypotheses as before --
wenzelm@30845
  1564
SORT_CONSTRAINT premises are eliminated as part of the canonical rule
wenzelm@30845
  1565
normalization.
wenzelm@30845
  1566
wenzelm@30845
  1567
* Generalized Isar history, with support for linear undo, direct state
wenzelm@30845
  1568
addressing etc.
wenzelm@30845
  1569
wenzelm@30845
  1570
* Changed defaults for unify configuration options:
wenzelm@30845
  1571
wenzelm@30845
  1572
  unify_trace_bound = 50 (formerly 25)
wenzelm@30845
  1573
  unify_search_bound = 60 (formerly 30)
wenzelm@30845
  1574
wenzelm@30845
  1575
* Different bookkeeping for code equations (INCOMPATIBILITY):
wenzelm@30845
  1576
wenzelm@30845
  1577
  a) On theory merge, the last set of code equations for a particular
wenzelm@30845
  1578
     constant is taken (in accordance with the policy applied by other
wenzelm@30845
  1579
     parts of the code generator framework).
wenzelm@30845
  1580
wenzelm@30845
  1581
  b) Code equations stemming from explicit declarations (e.g. code
wenzelm@30845
  1582
     attribute) gain priority over default code equations stemming
wenzelm@30845
  1583
     from definition, primrec, fun etc.
wenzelm@30845
  1584
wenzelm@30845
  1585
* Keyword 'code_exception' now named 'code_abort'.  INCOMPATIBILITY.
wenzelm@30845
  1586
haftmann@30965
  1587
* Unified theorem tables for both code generators.  Thus [code
wenzelm@30845
  1588
func] has disappeared and only [code] remains.  INCOMPATIBILITY.
wenzelm@30577
  1589
wenzelm@30577
  1590
* Command 'find_consts' searches for constants based on type and name
wenzelm@30577
  1591
patterns, e.g.
kleing@29883
  1592
kleing@29883
  1593
    find_consts "_ => bool"
kleing@29883
  1594
wenzelm@30106
  1595
By default, matching is against subtypes, but it may be restricted to
wenzelm@30728
  1596
the whole type.  Searching by name is possible.  Multiple queries are
wenzelm@30106
  1597
conjunctive and queries may be negated by prefixing them with a
wenzelm@30106
  1598
hyphen:
kleing@29883
  1599
kleing@29883
  1600
    find_consts strict: "_ => bool" name: "Int" -"int => int"
kleing@29861
  1601
wenzelm@30845
  1602
* New 'find_theorems' criterion "solves" matches theorems that
wenzelm@30845
  1603
directly solve the current goal (modulo higher-order unification).
wenzelm@30845
  1604
wenzelm@30845
  1605
* Auto solve feature for main theorem statements: whenever a new goal
wenzelm@30845
  1606
is stated, "find_theorems solves" is called; any theorems that could
wenzelm@30845
  1607
solve the lemma directly are listed as part of the goal state.
wenzelm@30845
  1608
Cf. associated options in Proof General Isabelle settings menu,
wenzelm@30845
  1609
enabled by default, with reasonable timeout for pathological cases of
wenzelm@30845
  1610
higher-order unification.
webertj@30415
  1611
haftmann@27104
  1612
wenzelm@27381
  1613
*** Document preparation ***
wenzelm@27381
  1614
wenzelm@27381
  1615
* Antiquotation @{lemma} now imitates a regular terminal proof,
wenzelm@27392
  1616
demanding keyword 'by' and supporting the full method expression
wenzelm@27519
  1617
syntax just like the Isar command 'by'.
wenzelm@27381
  1618
wenzelm@27381
  1619
haftmann@27104
  1620
*** HOL ***
haftmann@27104
  1621
wenzelm@30845
  1622
* Integrated main parts of former image HOL-Complex with HOL.  Entry
wenzelm@30845
  1623
points Main and Complex_Main remain as before.
wenzelm@30845
  1624
wenzelm@30845
  1625
* Logic image HOL-Plain provides a minimal HOL with the most important
wenzelm@30845
  1626
tools available (inductive, datatype, primrec, ...).  This facilitates
wenzelm@30845
  1627
experimentation and tool development.  Note that user applications
wenzelm@30845
  1628
(and library theories) should never refer to anything below theory
wenzelm@30845
  1629
Main, as before.
wenzelm@30845
  1630
wenzelm@30845
  1631
* Logic image HOL-Main stops at theory Main, and thus facilitates
wenzelm@30845
  1632
experimentation due to shorter build times.
wenzelm@30845
  1633
wenzelm@30845
  1634
* Logic image HOL-NSA contains theories of nonstandard analysis which
wenzelm@30845
  1635
were previously part of former HOL-Complex.  Entry point Hyperreal
wenzelm@30845
  1636
remains valid, but theories formerly using Complex_Main should now use
wenzelm@30845
  1637
new entry point Hypercomplex.
wenzelm@30845
  1638
wenzelm@30845
  1639
* Generic ATP manager for Sledgehammer, based on ML threads instead of
wenzelm@30845
  1640
Posix processes.  Avoids potentially expensive forking of the ML
wenzelm@30845
  1641
process.  New thread-based implementation also works on non-Unix
wenzelm@30845
  1642
platforms (Cygwin).  Provers are no longer hardwired, but defined
wenzelm@30845
  1643
within the theory via plain ML wrapper functions.  Basic Sledgehammer
wenzelm@30845
  1644
commands are covered in the isar-ref manual.
wenzelm@30845
  1645
wenzelm@30845
  1646
* Wrapper scripts for remote SystemOnTPTP service allows to use
wenzelm@30845
  1647
sledgehammer without local ATP installation (Vampire etc.). Other
wenzelm@30845
  1648
provers may be included via suitable ML wrappers, see also
wenzelm@30845
  1649
src/HOL/ATP_Linkup.thy.
wenzelm@30845
  1650
wenzelm@30845
  1651
* ATP selection (E/Vampire/Spass) is now via Proof General's settings
wenzelm@30845
  1652
menu.
wenzelm@30845
  1653
wenzelm@30845
  1654
* The metis method no longer fails because the theorem is too trivial
wenzelm@30845
  1655
(contains the empty clause).
wenzelm@30845
  1656
wenzelm@30845
  1657
* The metis method now fails in the usual manner, rather than raising
wenzelm@30845
  1658
an exception, if it determines that it cannot prove the theorem.
wenzelm@30845
  1659
wenzelm@30845
  1660
* Method "coherent" implements a prover for coherent logic (see also
wenzelm@30845
  1661
src/Tools/coherent.ML).
wenzelm@30845
  1662
wenzelm@30845
  1663
* Constants "undefined" and "default" replace "arbitrary".  Usually
wenzelm@30845
  1664
"undefined" is the right choice to replace "arbitrary", though
wenzelm@30845
  1665
logically there is no difference.  INCOMPATIBILITY.
wenzelm@30845
  1666
wenzelm@30845
  1667
* Command "value" now integrates different evaluation mechanisms.  The
wenzelm@30845
  1668
result of the first successful evaluation mechanism is printed.  In
wenzelm@30845
  1669
square brackets a particular named evaluation mechanisms may be
wenzelm@30845
  1670
specified (currently, [SML], [code] or [nbe]).  See further
wenzelm@30845
  1671
src/HOL/ex/Eval_Examples.thy.
wenzelm@30845
  1672
wenzelm@30845
  1673
* Normalization by evaluation now allows non-leftlinear equations.
wenzelm@30845
  1674
Declare with attribute [code nbe].
wenzelm@30845
  1675
wenzelm@30845
  1676
* Methods "case_tac" and "induct_tac" now refer to the very same rules
wenzelm@30845
  1677
as the structured Isar versions "cases" and "induct", cf. the
wenzelm@30845
  1678
corresponding "cases" and "induct" attributes.  Mutual induction rules
wenzelm@30845
  1679
are now presented as a list of individual projections
wenzelm@30845
  1680
(e.g. foo_bar.inducts for types foo and bar); the old format with
wenzelm@30845
  1681
explicit HOL conjunction is no longer supported.  INCOMPATIBILITY, in
wenzelm@30845
  1682
rare situations a different rule is selected --- notably nested tuple
wenzelm@30845
  1683
elimination instead of former prod.exhaust: use explicit (case_tac t
wenzelm@30845
  1684
rule: prod.exhaust) here.
wenzelm@30845
  1685
wenzelm@30845
  1686
* Attributes "cases", "induct", "coinduct" support "del" option.
wenzelm@30845
  1687
wenzelm@30845
  1688
* Removed fact "case_split_thm", which duplicates "case_split".
wenzelm@30845
  1689
wenzelm@30845
  1690
* The option datatype has been moved to a new theory Option.  Renamed
wenzelm@30845
  1691
option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
wenzelm@30845
  1692
wenzelm@30845
  1693
* New predicate "strict_mono" classifies strict functions on partial
wenzelm@30845
  1694
orders.  With strict functions on linear orders, reasoning about
wenzelm@30845
  1695
(in)equalities is facilitated by theorems "strict_mono_eq",
wenzelm@30845
  1696
"strict_mono_less_eq" and "strict_mono_less".
wenzelm@30845
  1697
wenzelm@30845
  1698
* Some set operations are now proper qualified constants with
wenzelm@30845
  1699
authentic syntax.  INCOMPATIBILITY:
haftmann@30304
  1700
haftmann@30304
  1701
    op Int ~>   Set.Int
haftmann@30304
  1702
    op Un ~>    Set.Un
haftmann@30304
  1703
    INTER ~>    Set.INTER
haftmann@30304
  1704
    UNION ~>    Set.UNION
haftmann@30304
  1705
    Inter ~>    Set.Inter
haftmann@30304
  1706
    Union ~>    Set.Union
haftmann@30304
  1707
    {} ~>       Set.empty
haftmann@30304
  1708
    UNIV ~>     Set.UNIV
haftmann@30304
  1709
wenzelm@30845
  1710
* Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
wenzelm@30845
  1711
theory Set.
wenzelm@30845
  1712
wenzelm@30845
  1713
* Auxiliary class "itself" has disappeared -- classes without any
wenzelm@30845
  1714
parameter are treated as expected by the 'class' command.
haftmann@29797
  1715
haftmann@29823
  1716
* Leibnitz's Series for Pi and the arcus tangens and logarithm series.
haftmann@29823
  1717
wenzelm@30845
  1718
* Common decision procedures (Cooper, MIR, Ferrack, Approximation,
wenzelm@30845
  1719
Dense_Linear_Order) are now in directory HOL/Decision_Procs.
wenzelm@30845
  1720
wenzelm@30845
  1721
* Theory src/HOL/Decision_Procs/Approximation provides the new proof
wenzelm@30845
  1722
method "approximation".  It proves formulas on real values by using
wenzelm@30845
  1723
interval arithmetic.  In the formulas are also the transcendental
wenzelm@30845
  1724
functions sin, cos, tan, atan, ln, exp and the constant pi are
wenzelm@30845
  1725
allowed. For examples see
wenzelm@30845
  1726
src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
haftmann@29823
  1727
haftmann@29823
  1728
* Theory "Reflection" now resides in HOL/Library.
haftmann@29650
  1729
wenzelm@30845
  1730
* Entry point to Word library now simply named "Word".
wenzelm@30845
  1731
INCOMPATIBILITY.
haftmann@29628
  1732
haftmann@29197
  1733
* Made source layout more coherent with logical distribution
haftmann@29197
  1734
structure:
haftmann@28952
  1735
haftmann@28952
  1736
    src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
haftmann@28952
  1737
    src/HOL/Library/Code_Message.thy ~> src/HOL/
haftmann@28952
  1738
    src/HOL/Library/GCD.thy ~> src/HOL/
haftmann@28952
  1739
    src/HOL/Library/Order_Relation.thy ~> src/HOL/
haftmann@28952
  1740
    src/HOL/Library/Parity.thy ~> src/HOL/
haftmann@28952
  1741
    src/HOL/Library/Univ_Poly.thy ~> src/HOL/
huffman@30176
  1742
    src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
haftmann@28952
  1743
    src/HOL/Real/Lubs.thy ~> src/HOL/
haftmann@28952
  1744
    src/HOL/Real/PReal.thy ~> src/HOL/
haftmann@28952
  1745
    src/HOL/Real/Rational.thy ~> src/HOL/
haftmann@28952
  1746
    src/HOL/Real/RComplete.thy ~> src/HOL/
haftmann@28952
  1747
    src/HOL/Real/RealDef.thy ~> src/HOL/
haftmann@28952
  1748
    src/HOL/Real/RealPow.thy ~> src/HOL/
haftmann@28952
  1749
    src/HOL/Real/Real.thy ~> src/HOL/
haftmann@28952
  1750
    src/HOL/Complex/Complex_Main.thy ~> src/HOL/
haftmann@28952
  1751
    src/HOL/Complex/Complex.thy ~> src/HOL/
huffman@30176
  1752
    src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
huffman@30176
  1753
    src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
haftmann@28952
  1754
    src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
haftmann@28952
  1755
    src/HOL/Hyperreal/Fact.thy ~> src/HOL/
haftmann@28952
  1756
    src/HOL/Hyperreal/Integration.thy ~> src/HOL/
haftmann@28952
  1757
    src/HOL/Hyperreal/Lim.thy ~> src/HOL/
haftmann@28952
  1758
    src/HOL/Hyperreal/Ln.thy ~> src/HOL/
haftmann@28952
  1759
    src/HOL/Hyperreal/Log.thy ~> src/HOL/
haftmann@28952
  1760
    src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
haftmann@28952
  1761
    src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
haftmann@28952
  1762
    src/HOL/Hyperreal/Series.thy ~> src/HOL/
haftmann@29197
  1763
    src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
haftmann@28952
  1764
    src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
haftmann@28952
  1765
    src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
haftmann@28952
  1766
    src/HOL/Real/Float ~> src/HOL/Library/
haftmann@29197
  1767
    src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
haftmann@29197
  1768
    src/HOL/Real/RealVector.thy ~> src/HOL/
haftmann@28952
  1769
haftmann@28952
  1770
    src/HOL/arith_data.ML ~> src/HOL/Tools
haftmann@28952
  1771
    src/HOL/hologic.ML ~> src/HOL/Tools
haftmann@28952
  1772
    src/HOL/simpdata.ML ~> src/HOL/Tools
haftmann@28952
  1773
    src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
haftmann@28952
  1774
    src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
haftmann@28952
  1775
    src/HOL/nat_simprocs.ML ~> src/HOL/Tools
haftmann@28952
  1776
    src/HOL/Real/float_arith.ML ~> src/HOL/Tools
haftmann@28952
  1777
    src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
haftmann@28952
  1778
    src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
haftmann@28952
  1779
    src/HOL/Real/real_arith.ML ~> src/HOL/Tools
haftmann@28952
  1780
haftmann@29398
  1781
    src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  1782
    src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  1783
    src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  1784
    src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  1785
    src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  1786
    src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  1787
wenzelm@30845
  1788
* If methods "eval" and "evaluation" encounter a structured proof
wenzelm@30845
  1789
state with !!/==>, only the conclusion is evaluated to True (if
wenzelm@30845
  1790
possible), avoiding strange error messages.
wenzelm@30845
  1791
wenzelm@30845
  1792
* Method "sizechange" automates termination proofs using (a
wenzelm@30845
  1793
modification of) the size-change principle.  Requires SAT solver.  See
wenzelm@30845
  1794
src/HOL/ex/Termination.thy for examples.
wenzelm@30845
  1795
wenzelm@30845
  1796
* Simplifier: simproc for let expressions now unfolds if bound
wenzelm@30845
  1797
variable occurs at most once in let expression body.  INCOMPATIBILITY.
wenzelm@30845
  1798
wenzelm@30845
  1799
* Method "arith": Linear arithmetic now ignores all inequalities when
wenzelm@30845
  1800
fast_arith_neq_limit is exceeded, instead of giving up entirely.
wenzelm@30845
  1801
wenzelm@30845
  1802
* New attribute "arith" for facts that should always be used
wenzelm@30845
  1803
automatically by arithmetic. It is intended to be used locally in
wenzelm@30845
  1804
proofs, e.g.
wenzelm@30845
  1805
wenzelm@30845
  1806
  assumes [arith]: "x > 0"
wenzelm@30845
  1807
nipkow@30706
  1808
Global usage is discouraged because of possible performance impact.
nipkow@30706
  1809
wenzelm@30845
  1810
* New classes "top" and "bot" with corresponding operations "top" and
wenzelm@30845
  1811
"bot" in theory Orderings; instantiation of class "complete_lattice"
wenzelm@30845
  1812
requires instantiation of classes "top" and "bot".  INCOMPATIBILITY.
wenzelm@30845
  1813
wenzelm@30845
  1814
* Changed definition lemma "less_fun_def" in order to provide an
wenzelm@30845
  1815
instance for preorders on functions; use lemma "less_le" instead.
wenzelm@30845
  1816
INCOMPATIBILITY.
wenzelm@30845
  1817
wenzelm@30845
  1818
* Theory Orderings: class "wellorder" moved here, with explicit
wenzelm@30845
  1819
induction rule "less_induct" as assumption.  For instantiation of
wenzelm@30845
  1820
"wellorder" by means of predicate "wf", use rule wf_wellorderI.
wenzelm@30845
  1821
INCOMPATIBILITY.
wenzelm@30845
  1822
wenzelm@30845
  1823
* Theory Orderings: added class "preorder" as superclass of "order".
wenzelm@27793
  1824
INCOMPATIBILITY: Instantiation proofs for order, linorder
wenzelm@27793
  1825
etc. slightly changed.  Some theorems named order_class.* now named
wenzelm@27793
  1826
preorder_class.*.
wenzelm@27793
  1827
wenzelm@30845
  1828
* Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
wenzelm@30845
  1829
"diag" to "Id_on".
wenzelm@30845
  1830
wenzelm@30845
  1831
* Theory Finite_Set: added a new fold combinator of type
wenzelm@30845
  1832
nipkow@28855
  1833
  ('a => 'b => 'b) => 'b => 'a set => 'b
wenzelm@30845
  1834
wenzelm@30845
  1835
Occasionally this is more convenient than the old fold combinator
wenzelm@30845
  1836
which is now defined in terms of the new one and renamed to
wenzelm@30845
  1837
fold_image.
wenzelm@30845
  1838
wenzelm@30845
  1839
* Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
wenzelm@30845
  1840
and "ring_simps" have been replaced by "algebra_simps" (which can be
wenzelm@30845
  1841
extended with further lemmas!).  At the moment both still exist but
wenzelm@30845
  1842
the former will disappear at some point.
wenzelm@30845
  1843
wenzelm@30845
  1844
* Theory Power: Lemma power_Suc is now declared as a simp rule in
wenzelm@30845
  1845
class recpower.  Type-specific simp rules for various recpower types
wenzelm@30845
  1846
have been removed.  INCOMPATIBILITY, rename old lemmas as follows:
huffman@30273
  1847
huffman@30273
  1848
rat_power_0    -> power_0
huffman@30273
  1849
rat_power_Suc  -> power_Suc
huffman@30273
  1850
realpow_0      -> power_0
huffman@30273
  1851
realpow_Suc    -> power_Suc
huffman@30273
  1852
complexpow_0   -> power_0
huffman@30273
  1853
complexpow_Suc -> power_Suc
huffman@30273
  1854
power_poly_0   -> power_0
huffman@30273
  1855
power_poly_Suc -> power_Suc
huffman@30273
  1856
wenzelm@30845
  1857
* Theories Ring_and_Field and Divides: Definition of "op dvd" has been
wenzelm@27793
  1858
moved to separate class dvd in Ring_and_Field; a couple of lemmas on
wenzelm@27793
  1859
dvd has been generalized to class comm_semiring_1.  Likewise a bunch
wenzelm@27793
  1860
of lemmas from Divides has been generalized from nat to class
wenzelm@27793
  1861
semiring_div.  INCOMPATIBILITY.  This involves the following theorem
wenzelm@27793
  1862
renames resulting from duplicate elimination:
haftmann@27651
  1863
haftmann@27651
  1864
    dvd_def_mod ~>          dvd_eq_mod_eq_0
haftmann@27651
  1865
    zero_dvd_iff ~>         dvd_0_left_iff
haftmann@28559
  1866
    dvd_0 ~>                dvd_0_right
haftmann@27651
  1867
    DIVISION_BY_ZERO_DIV ~> div_by_0
haftmann@27651
  1868
    DIVISION_BY_ZERO_MOD ~> mod_by_0
haftmann@27651
  1869
    mult_div ~>             div_mult_self2_is_id
haftmann@27651
  1870
    mult_mod ~>             mod_mult_self2_is_0
haftmann@27651
  1871
wenzelm@30845
  1872
* Theory IntDiv: removed many lemmas that are instances of class-based
wenzelm@30845
  1873
generalizations (from Divides and Ring_and_Field).  INCOMPATIBILITY,
wenzelm@30845
  1874
rename old lemmas as follows:
nipkow@30044
  1875
nipkow@30044
  1876
dvd_diff               -> nat_dvd_diff
nipkow@30044
  1877
dvd_zminus_iff         -> dvd_minus_iff
nipkow@30224
  1878
mod_add1_eq            -> mod_add_eq
nipkow@30224
  1879
mod_mult1_eq           -> mod_mult_right_eq
nipkow@30224
  1880
mod_mult1_eq'          -> mod_mult_left_eq
nipkow@30224
  1881
mod_mult_distrib_mod   -> mod_mult_eq
nipkow@30044
  1882
nat_mod_add_left_eq    -> mod_add_left_eq
nipkow@30044
  1883
nat_mod_add_right_eq   -> mod_add_right_eq
nipkow@30044
  1884
nat_mod_div_trivial    -> mod_div_trivial
nipkow@30044
  1885
nat_mod_mod_trivial    -> mod_mod_trivial
nipkow@30044
  1886
zdiv_zadd_self1        -> div_add_self1
nipkow@30044
  1887
zdiv_zadd_self2        -> div_add_self2
nipkow@30181
  1888
zdiv_zmult_self1       -> div_mult_self2_is_id
nipkow@30044
  1889
zdiv_zmult_self2       -> div_mult_self1_is_id
nipkow@30044
  1890
zdvd_triv_left         -> dvd_triv_left
nipkow@30044
  1891
zdvd_triv_right        -> dvd_triv_right
nipkow@30044
  1892
zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
nipkow@30085
  1893
zmod_eq0_zdvd_iff      -> dvd_eq_mod_eq_0[symmetric]
nipkow@30044
  1894
zmod_zadd_left_eq      -> mod_add_left_eq
nipkow@30044
  1895
zmod_zadd_right_eq     -> mod_add_right_eq
nipkow@30044
  1896
zmod_zadd_self1        -> mod_add_self1
nipkow@30044
  1897
zmod_zadd_self2        -> mod_add_self2
nipkow@30224
  1898
zmod_zadd1_eq          -> mod_add_eq
nipkow@30044
  1899
zmod_zdiff1_eq         -> mod_diff_eq
nipkow@30044
  1900
zmod_zdvd_zmod         -> mod_mod_cancel
nipkow@30044
  1901
zmod_zmod_cancel       -> mod_mod_cancel
nipkow@30044
  1902
zmod_zmult_self1       -> mod_mult_self2_is_0
nipkow@30044
  1903
zmod_zmult_self2       -> mod_mult_self1_is_0
nipkow@30044
  1904
zmod_1                 -> mod_by_1
nipkow@30044
  1905
zdiv_1                 -> div_by_1
nipkow@30044
  1906
zdvd_abs1              -> abs_dvd_iff
nipkow@30044
  1907
zdvd_abs2              -> dvd_abs_iff
nipkow@30044
  1908
zdvd_refl              -> dvd_refl
nipkow@30044
  1909
zdvd_trans             -> dvd_trans
nipkow@30044
  1910
zdvd_zadd              -> dvd_add
nipkow@30044
  1911
zdvd_zdiff             -> dvd_diff
nipkow@30044
  1912
zdvd_zminus_iff        -> dvd_minus_iff
nipkow@30044
  1913
zdvd_zminus2_iff       -> minus_dvd_iff
nipkow@30044
  1914
zdvd_zmultD            -> dvd_mult_right
nipkow@30044
  1915
zdvd_zmultD2           -> dvd_mult_left
nipkow@30044
  1916
zdvd_zmult_mono        -> mult_dvd_mono
nipkow@30044
  1917
zdvd_0_right           -> dvd_0_right
nipkow@30044
  1918
zdvd_0_left            -> dvd_0_left_iff
nipkow@30044
  1919
zdvd_1_left            -> one_dvd
nipkow@30044
  1920
zminus_dvd_iff         -> minus_dvd_iff
nipkow@30044
  1921
wenzelm@30845
  1922
* Theory Rational: 'Fract k 0' now equals '0'.  INCOMPATIBILITY.
wenzelm@30845
  1923
wenzelm@30845
  1924
* The real numbers offer decimal input syntax: 12.34 is translated
wenzelm@30845
  1925
into 1234/10^2. This translation is not reversed upon output.
wenzelm@30845
  1926
wenzelm@30845
  1927
* Theory Library/Polynomial defines an abstract type 'a poly of
wenzelm@30845
  1928
univariate polynomials with coefficients of type 'a.  In addition to
wenzelm@30845
  1929
the standard ring operations, it also supports div and mod.  Code
wenzelm@30845
  1930
generation is also supported, using list-style constructors.
wenzelm@30845
  1931
wenzelm@30845
  1932
* Theory Library/Inner_Product defines a class of real_inner for real
wenzelm@30845
  1933
inner product spaces, with an overloaded operation inner :: 'a => 'a
wenzelm@30845
  1934
=> real.  Class real_inner is a subclass of real_normed_vector from
wenzelm@30845
  1935
theory RealVector.
wenzelm@30845
  1936
wenzelm@30845
  1937
* Theory Library/Product_Vector provides instances for the product
wenzelm@30845
  1938
type 'a * 'b of several classes from RealVector and Inner_Product.
wenzelm@30845
  1939
Definitions of addition, subtraction, scalar multiplication, norms,
wenzelm@30845
  1940
and inner products are included.
wenzelm@30845
  1941
wenzelm@30845
  1942
* Theory Library/Bit defines the field "bit" of integers modulo 2.  In
wenzelm@30845
  1943
addition to the field operations, numerals and case syntax are also
wenzelm@30845
  1944
supported.
wenzelm@30845
  1945
wenzelm@30845
  1946
* Theory Library/Diagonalize provides constructive version of Cantor's
wenzelm@30845
  1947
first diagonalization argument.
wenzelm@30845
  1948
wenzelm@30845
  1949
* Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
wenzelm@27599
  1950
zlcm (for int); carried together from various gcd/lcm developements in
wenzelm@30845
  1951
the HOL Distribution.  Constants zgcd and zlcm replace former igcd and
wenzelm@30845
  1952
ilcm; corresponding theorems renamed accordingly.  INCOMPATIBILITY,
wenzelm@30845
  1953
may recover tupled syntax as follows:
haftmann@27556
  1954
haftmann@27556
  1955
    hide (open) const gcd
haftmann@27556
  1956
    abbreviation gcd where
haftmann@27556
  1957
      "gcd == (%(a, b). GCD.gcd a b)"
haftmann@27556
  1958
    notation (output)
haftmann@27556
  1959
      GCD.gcd ("gcd '(_, _')")
haftmann@27556
  1960
wenzelm@30845
  1961
The same works for lcm, zgcd, zlcm.
wenzelm@30845
  1962
wenzelm@30845
  1963
* Theory Library/Nat_Infinity: added addition, numeral syntax and more
wenzelm@30845
  1964
instantiations for algebraic structures.  Removed some duplicate
wenzelm@30845
  1965
theorems.  Changes in simp rules.  INCOMPATIBILITY.
wenzelm@30845
  1966
wenzelm@30845
  1967
* ML antiquotation @{code} takes a constant as argument and generates
haftmann@27651
  1968
corresponding code in background and inserts name of the corresponding
haftmann@27651
  1969
resulting ML value/function/datatype constructor binding in place.
haftmann@27651
  1970
All occurrences of @{code} with a single ML block are generated
haftmann@27651
  1971
simultaneously.  Provides a generic and safe interface for
wenzelm@30845
  1972
instrumentalizing code generation.  See
wenzelm@30845
  1973
src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
wenzelm@30845
  1974
In future you ought to refrain from ad-hoc compiling generated SML
wenzelm@30845
  1975
code on the ML toplevel.  Note that (for technical reasons) @{code}
wenzelm@30845
  1976
cannot refer to constants for which user-defined serializations are
wenzelm@30845
  1977
set.  Refer to the corresponding ML counterpart directly in that
wenzelm@30845
  1978
cases.
wenzelm@27122
  1979
wenzelm@27122
  1980
* Command 'rep_datatype': instead of theorem names the command now
wenzelm@27122
  1981
takes a list of terms denoting the constructors of the type to be
wenzelm@27122
  1982
represented as datatype.  The characteristic theorems have to be
wenzelm@27122
  1983
proven.  INCOMPATIBILITY.  Also observe that the following theorems
wenzelm@27122
  1984
have disappeared in favour of existing ones:
wenzelm@27122
  1985
haftmann@27104
  1986
    unit_induct                 ~> unit.induct
haftmann@27104
  1987
    prod_induct                 ~> prod.induct
haftmann@27104
  1988
    sum_induct                  ~> sum.induct
haftmann@27104
  1989
    Suc_Suc_eq                  ~> nat.inject
haftmann@27104
  1990
    Suc_not_Zero Zero_not_Suc   ~> nat.distinct
haftmann@27104
  1991
haftmann@27104
  1992
ballarin@27696
  1993
*** HOL-Algebra ***
ballarin@27696
  1994
ballarin@27713
  1995
* New locales for orders and lattices where the equivalence relation
wenzelm@30106
  1996
is not restricted to equality.  INCOMPATIBILITY: all order and lattice
wenzelm@30106
  1997
locales use a record structure with field eq for the equivalence.
ballarin@27713
  1998
ballarin@27713
  1999
* New theory of factorial domains.
ballarin@27713
  2000
wenzelm@30845
  2001
* Units_l_inv and Units_r_inv are now simp rules by default.
ballarin@27696
  2002
INCOMPATIBILITY.  Simplifier proof that require deletion of l_inv
ballarin@27696
  2003
and/or r_inv will now also require deletion of these lemmas.
ballarin@27696
  2004
wenzelm@30845
  2005
* Renamed the following theorems, INCOMPATIBILITY:
wenzelm@30845
  2006
ballarin@27696
  2007
UpperD ~> Upper_memD
ballarin@27696
  2008
LowerD ~> Lower_memD
ballarin@27696
  2009
least_carrier ~> least_closed
ballarin@27696
  2010
greatest_carrier ~> greatest_closed
ballarin@27696
  2011
greatest_Lower_above ~> greatest_Lower_below
ballarin@27717
  2012
one_zero ~> carrier_one_zero
ballarin@27717
  2013
one_not_zero ~> carrier_one_not_zero  (collision with assumption)
ballarin@27696
  2014
wenzelm@27793
  2015
wenzelm@30849
  2016
*** HOL-Nominal ***
wenzelm@30849
  2017
wenzelm@30855
  2018
* Nominal datatypes can now contain type-variables.
wenzelm@30855
  2019
wenzelm@30855
  2020
* Commands 'nominal_inductive' and 'equivariance' work with local
wenzelm@30855
  2021
theory targets.
wenzelm@30855
  2022
wenzelm@30855
  2023
* Nominal primrec can now works with local theory targets and its
wenzelm@30855
  2024
specification syntax now conforms to the general format as seen in
wenzelm@30855
  2025
'inductive' etc.
wenzelm@30855
  2026
wenzelm@30855
  2027
* Method "perm_simp" honours the standard simplifier attributes
wenzelm@30855
  2028
(no_asm), (no_asm_use) etc.
wenzelm@30855
  2029
wenzelm@30855
  2030
* The new predicate #* is defined like freshness, except that on the
wenzelm@30855
  2031
left hand side can be a set or list of atoms.
wenzelm@30855
  2032
wenzelm@30855
  2033
* Experimental command 'nominal_inductive2' derives strong induction
wenzelm@30855
  2034
principles for inductive definitions.  In contrast to
wenzelm@30855
  2035
'nominal_inductive', which can only deal with a fixed number of
wenzelm@30855
  2036
binders, it can deal with arbitrary expressions standing for sets of
wenzelm@30855
  2037
atoms to be avoided.  The only inductive definition we have at the
wenzelm@30855
  2038
moment that needs this generalisation is the typing rule for Lets in
wenzelm@30855
  2039
the algorithm W:
wenzelm@30855
  2040
wenzelm@30855
  2041
 Gamma |- t1 : T1   (x,close Gamma T1)::Gamma |- t2 : T2   x#Gamma
wenzelm@30855
  2042
 -----------------------------------------------------------------
wenzelm@30855
  2043
         Gamma |- Let x be t1 in t2 : T2
wenzelm@30855
  2044
wenzelm@30855
  2045
In this rule one wants to avoid all the binders that are introduced by
wenzelm@30855
  2046
"close Gamma T1".  We are looking for other examples where this
wenzelm@30855
  2047
feature might be useful.  Please let us know.
wenzelm@30849
  2048
wenzelm@30849
  2049
huffman@30176
  2050
*** HOLCF ***
huffman@30176
  2051
huffman@30176
  2052
* Reimplemented the simplification procedure for proving continuity
huffman@30176
  2053
subgoals.  The new simproc is extensible; users can declare additional
huffman@30176
  2054
continuity introduction rules with the attribute [cont2cont].
huffman@30176
  2055
huffman@30176
  2056
* The continuity simproc now uses a different introduction rule for
huffman@30176
  2057
solving continuity subgoals on terms with lambda abstractions.  In
huffman@30176
  2058
some rare cases the new simproc may fail to solve subgoals that the
huffman@30176
  2059
old one could solve, and "simp add: cont2cont_LAM" may be necessary.
huffman@30176
  2060
Potential INCOMPATIBILITY.
huffman@30176
  2061
wenzelm@30847
  2062
* Command 'fixrec': specification syntax now conforms to the general
wenzelm@30855
  2063
format as seen in 'inductive' etc.  See src/HOLCF/ex/Fixrec_ex.thy for
wenzelm@30855
  2064
examples.  INCOMPATIBILITY.
wenzelm@30845
  2065
wenzelm@30845
  2066
wenzelm@30845
  2067
*** ZF ***
wenzelm@30845
  2068
wenzelm@30845
  2069
* Proof of Zorn's Lemma for partial orders.
huffman@30176
  2070
huffman@30176
  2071
wenzelm@27246
  2072
*** ML ***
wenzelm@28088
  2073
wenzelm@30845
  2074
* Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
wenzelm@30845
  2075
Poly/ML 5.2.1 or later.  Important note: the TimeLimit facility
wenzelm@30845
  2076
depends on multithreading, so timouts will not work before Poly/ML
wenzelm@30845
  2077
5.2.1!
wenzelm@30845
  2078
wenzelm@29161
  2079
* High-level support for concurrent ML programming, see
wenzelm@29161
  2080
src/Pure/Cuncurrent.  The data-oriented model of "future values" is
wenzelm@29161
  2081
particularly convenient to organize independent functional
wenzelm@29161
  2082
computations.  The concept of "synchronized variables" provides a
wenzelm@29161
  2083
higher-order interface for components with shared state, avoiding the
wenzelm@30845
  2084
delicate details of mutexes and condition variables.  (Requires
wenzelm@30845
  2085
Poly/ML 5.2.1 or later.)
wenzelm@30845
  2086
wenzelm@30845
  2087
* ML bindings produced via Isar commands are stored within the Isar
wenzelm@30845
  2088
context (theory or proof).  Consequently, commands like 'use' and 'ML'
wenzelm@30845
  2089
become thread-safe and work with undo as expected (concerning
wenzelm@30845
  2090
top-level bindings, not side-effects on global references).
wenzelm@30845
  2091
INCOMPATIBILITY, need to provide proper Isar context when invoking the
wenzelm@30845
  2092
compiler at runtime; really global bindings need to be given outside a
wenzelm@30845
  2093
theory.  (Requires Poly/ML 5.2 or later.)
wenzelm@30845
  2094
wenzelm@30845
  2095
* Command 'ML_prf' is analogous to 'ML' but works within a proof
wenzelm@30845
  2096
context.  Top-level ML bindings are stored within the proof context in
wenzelm@30845
  2097
a purely sequential fashion, disregarding the nested proof structure.
wenzelm@30845
  2098
ML bindings introduced by 'ML_prf' are discarded at the end of the
wenzelm@30845
  2099
proof.  (Requires Poly/ML 5.2 or later.)
wenzelm@29161
  2100
wenzelm@30530
  2101
* Simplified ML attribute and method setup, cf. functions Attrib.setup
wenzelm@30845
  2102
and Method.setup, as well as Isar commands 'attribute_setup' and
wenzelm@30547
  2103
'method_setup'.  INCOMPATIBILITY for 'method_setup', need to simplify
wenzelm@30547
  2104
existing code accordingly, or use plain 'setup' together with old
wenzelm@30547
  2105
Method.add_method.
wenzelm@30530
  2106
wenzelm@28294
  2107
* Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
wenzelm@28294
  2108
to 'a -> thm, while results are always tagged with an authentic oracle
wenzelm@28294
  2109
name.  The Isar command 'oracle' is now polymorphic, no argument type
wenzelm@28294
  2110
is specified.  INCOMPATIBILITY, need to simplify existing oracle code
wenzelm@28294
  2111
accordingly.  Note that extra performance may be gained by producing
wenzelm@28294
  2112
the cterm carefully, avoiding slow Thm.cterm_of.
wenzelm@28294
  2113
wenzelm@30845
  2114
* Simplified interface for defining document antiquotations via
wenzelm@30845
  2115
ThyOutput.antiquotation, ThyOutput.output, and optionally
wenzelm@30845
  2116
ThyOutput.maybe_pretty_source.  INCOMPATIBILITY, need to simplify user
wenzelm@30845
  2117
antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
wenzelm@30845
  2118
examples.
wenzelm@28099
  2119
wenzelm@30395
  2120
* More systematic treatment of long names, abstract name bindings, and
wenzelm@30395
  2121
name space operations.  Basic operations on qualified names have been
wenzelm@30399
  2122
move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
wenzelm@30395
  2123
Long_Name.append.  Old type bstring has been mostly replaced by
wenzelm@30395
  2124
abstract type binding (see structure Binding), which supports precise
wenzelm@30845
  2125
qualification by packages and local theory targets, as well as proper
wenzelm@30845
  2126
tracking of source positions.  INCOMPATIBILITY, need to wrap old
wenzelm@30845
  2127
bstring values into Binding.name, or better pass through abstract
wenzelm@30399
  2128
bindings everywhere.  See further src/Pure/General/long_name.ML,
wenzelm@30395
  2129
src/Pure/General/binding.ML and src/Pure/General/name_space.ML
wenzelm@30395
  2130
wenzelm@28089
  2131
* Result facts (from PureThy.note_thms, ProofContext.note_thms,
wenzelm@28089
  2132
LocalTheory.note etc.) now refer to the *full* internal name, not the
wenzelm@28089
  2133
bstring as before.  INCOMPATIBILITY, not detected by ML type-checking!
wenzelm@28089
  2134
wenzelm@27287
  2135
* Disposed old type and term read functions (Sign.read_def_typ,
wenzelm@27287
  2136
Sign.read_typ, Sign.read_def_terms, Sign.read_term,
wenzelm@27287
  2137
Thm.read_def_cterms, Thm.read_cterm etc.).  INCOMPATIBILITY, should
wenzelm@27287
  2138
use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
wenzelm@27269
  2139
Syntax.read_term_global etc.; see also OldGoals.read_term as last
wenzelm@27269
  2140
resort for legacy applications.
wenzelm@27269
  2141
wenzelm@30609
  2142
* Disposed old declarations, tactics, tactic combinators that refer to
wenzelm@30609
  2143
the simpset or claset of an implicit theory (such as Addsimps,
wenzelm@30609
  2144
Simp_tac, SIMPSET).  INCOMPATIBILITY, should use @{simpset} etc. in
wenzelm@30609
  2145
embedded ML text, or local_simpset_of with a proper context passed as
wenzelm@30609
  2146
explicit runtime argument.
wenzelm@30609
  2147
wenzelm@30845
  2148
* Rules and tactics that read instantiations (read_instantiate,
wenzelm@30845
  2149
res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
wenzelm@30845
  2150
context, which is required for parsing and type-checking.  Moreover,
wenzelm@30845
  2151
the variables are specified as plain indexnames, not string encodings
wenzelm@30845
  2152
thereof.  INCOMPATIBILITY.
wenzelm@30845
  2153
wenzelm@30845
  2154
* Generic Toplevel.add_hook interface allows to analyze the result of
wenzelm@30845
  2155
transactions.  E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
wenzelm@30845
  2156
for theorem dependency output of transactions resulting in a new
wenzelm@30845
  2157
theory state.
wenzelm@30845
  2158
wenzelm@30845
  2159
* ML antiquotations: block-structured compilation context indicated by
wenzelm@27391
  2160
\<lbrace> ... \<rbrace>; additional antiquotation forms:
wenzelm@27391
  2161
wenzelm@30845
  2162
  @{binding name}                         - basic name binding
wenzelm@27519
  2163
  @{let ?pat = term}                      - term abbreviation (HO matching)
wenzelm@27519
  2164
  @{note name = fact}                     - fact abbreviation
wenzelm@27519
  2165
  @{thm fact}                             - singleton fact (with attributes)
wenzelm@27519
  2166
  @{thms fact}                            - general fact (with attributes)
wenzelm@27519
  2167
  @{lemma prop by method}                 - singleton goal
wenzelm@27519
  2168
  @{lemma prop by meth1 meth2}            - singleton goal
wenzelm@27519
  2169
  @{lemma prop1 ... propN by method}      - general goal
wenzelm@27519
  2170
  @{lemma prop1 ... propN by meth1 meth2} - general goal
wenzelm@27519
  2171
  @{lemma (open) ...}                     - open derivation
wenzelm@27380
  2172
wenzelm@27246
  2173
wenzelm@27979
  2174
*** System ***
wenzelm@27979
  2175
wenzelm@28248
  2176
* The Isabelle "emacs" tool provides a specific interface to invoke
wenzelm@28248
  2177
Proof General / Emacs, with more explicit failure if that is not
wenzelm@28248
  2178
installed (the old isabelle-interface script silently falls back on
wenzelm@28248
  2179
isabelle-process).  The PROOFGENERAL_HOME setting determines the
wenzelm@28248
  2180
installation location of the Proof General distribution.
wenzelm@28248
  2181
wenzelm@27979
  2182
* Isabelle/lib/classes/Pure.jar provides basic support to integrate
wenzelm@27979
  2183
the Isabelle process into a JVM/Scala application.  See
wenzelm@27979
  2184
Isabelle/lib/jedit/plugin for a minimal example.  (The obsolete Java
wenzelm@27979
  2185
process wrapper has been discontinued.)
wenzelm@27979
  2186
wenzelm@30845
  2187
* Added homegrown Isabelle font with unicode layout, see lib/fonts.
wenzelm@30845
  2188
wenzelm@30845
  2189
* Various status messages (with exact source position information) are
wenzelm@27979
  2190
emitted, if proper markup print mode is enabled.  This allows
wenzelm@27979
  2191
user-interface components to provide detailed feedback on internal
wenzelm@27979
  2192
prover operations.
wenzelm@27979
  2193
wenzelm@27979
  2194
wenzelm@27143
  2195
wenzelm@27008
  2196
New in Isabelle2008 (June 2008)
wenzelm@27008
  2197
-------------------------------
wenzelm@25464
  2198
wenzelm@25522
  2199
*** General ***
wenzelm@25522
  2200
wenzelm@27061
  2201
* The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
wenzelm@27061
  2202
and updated, with formally checked references as hyperlinks.
wenzelm@27061
  2203
wenzelm@25994
  2204
* Theory loader: use_thy (and similar operations) no longer set the
wenzelm@25994
  2205
implicit ML context, which was occasionally hard to predict and in
wenzelm@25994
  2206
conflict with concurrency.  INCOMPATIBILITY, use ML within Isar which
wenzelm@25994
  2207
provides a proper context already.
wenzelm@25994
  2208
wenzelm@26323
  2209
* Theory loader: old-style ML proof scripts being *attached* to a thy
wenzelm@26323
  2210
file are no longer supported.  INCOMPATIBILITY, regular 'uses' and
wenzelm@26323
  2211
'use' within a theory file will do the job.
wenzelm@26323
  2212
wenzelm@26650
  2213
* Name space merge now observes canonical order, i.e. the second space
wenzelm@26650
  2214
is inserted into the first one, while existing entries in the first
wenzelm@26659
  2215
space take precedence.  INCOMPATIBILITY in rare situations, may try to
wenzelm@26650
  2216
swap theory imports.
wenzelm@26650
  2217
wenzelm@27067
  2218
* Syntax: symbol \<chi> is now considered a letter.  Potential
wenzelm@27067
  2219
INCOMPATIBILITY in identifier syntax etc.
wenzelm@27067
  2220
wenzelm@27067
  2221
* Outer syntax: string tokens no longer admit escaped white space,
wenzelm@27067
  2222
which was an accidental (undocumented) feature.  INCOMPATIBILITY, use
wenzelm@27067
  2223
white space without escapes.
wenzelm@27067
  2224
wenzelm@27067
  2225
* Outer syntax: string tokens may contain arbitrary character codes
wenzelm@27067
  2226
specified via 3 decimal digits (as in SML).  E.g. "foo\095bar" for
wenzelm@27067
  2227
"foo_bar".
wenzelm@27067
  2228
wenzelm@25522
  2229
haftmann@25502
  2230
*** Pure ***
haftmann@25502
  2231
wenzelm@26718
  2232
* Context-dependent token translations.  Default setup reverts locally
wenzelm@26718
  2233
fixed variables, and adds hilite markup for undeclared frees.
wenzelm@26718
  2234
berghofe@26681
  2235
* Unused theorems can be found using the new command 'unused_thms'.
berghofe@26681
  2236
There are three ways of invoking it:
berghofe@26681
  2237
berghofe@26681
  2238
(1) unused_thms
berghofe@26681
  2239
     Only finds unused theorems in the current theory.
berghofe@26681
  2240
berghofe@26681
  2241
(2) unused_thms thy_1 ... thy_n -
berghofe@26681
  2242
     Finds unused theorems in the current theory and all of its ancestors,
berghofe@26681
  2243
     excluding the theories thy_1 ... thy_n and all of their ancestors.
berghofe@26681
  2244
berghofe@26681
  2245
(3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
berghofe@26681
  2246
     Finds unused theorems in the theories thy'_1 ... thy'_m and all of
berghofe@26681
  2247
     their ancestors, excluding the theories thy_1 ... thy_n and all of
berghofe@26681
  2248
     their ancestors.
berghofe@26681
  2249
wenzelm@26718
  2250
In order to increase the readability of the list produced by
wenzelm@26718
  2251
unused_thms, theorems that have been created by a particular instance
wenzelm@26874
  2252
of a theory command such as 'inductive' or 'function' are considered
wenzelm@26874
  2253
to belong to the same "group", meaning that if at least one theorem in
wenzelm@26718
  2254
this group is used, the other theorems in the same group are no longer
wenzelm@26718
  2255
reported as unused.  Moreover, if all theorems in the group are
wenzelm@26718
  2256
unused, only one theorem in the group is displayed.
wenzelm@26718
  2257
wenzelm@26718
  2258
Note that proof objects have to be switched on in order for
wenzelm@26718
  2259
unused_thms to work properly (i.e. !proofs must be >= 1, which is
wenzelm@26874
  2260
usually the case when using Proof General with the default settings).
berghofe@26681
  2261
wenzelm@26650
  2262
* Authentic naming of facts disallows ad-hoc overwriting of previous
wenzelm@26650
  2263
theorems within the same name space.  INCOMPATIBILITY, need to remove
wenzelm@26650
  2264
duplicate fact bindings, or even accidental fact duplications.  Note
wenzelm@26650
  2265
that tools may maintain dynamically scoped facts systematically, using
wenzelm@26650
  2266
PureThy.add_thms_dynamic.
wenzelm@26650
  2267
wenzelm@26660
  2268
* Command 'hide' now allows to hide from "fact" name space as well.
wenzelm@26660
  2269
wenzelm@26496
  2270
* Eliminated destructive theorem database, simpset, claset, and
wenzelm@26496
  2271
clasimpset.  Potential INCOMPATIBILITY, really need to observe linear
wenzelm@26496
  2272
update of theories within ML code.
wenzelm@26479
  2273
wenzelm@26955
  2274
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
wenzelm@26955
  2275
INCOMPATIBILITY, object-logics depending on former Pure require
wenzelm@26955
  2276
additional setup PureThy.old_appl_syntax_setup; object-logics
wenzelm@26955
  2277
depending on former CPure need to refer to Pure.
wenzelm@26650
  2278
wenzelm@26495
  2279
* Commands 'use' and 'ML' are now purely functional, operating on
wenzelm@26479
  2280
theory/local_theory.  Removed former 'ML_setup' (on theory), use 'ML'
wenzelm@26479
  2281
instead.  Added 'ML_val' as mere diagnostic replacement for 'ML'.
wenzelm@26479
  2282
INCOMPATIBILITY.
wenzelm@26479
  2283
wenzelm@26874
  2284
* Command 'setup': discontinued implicit version with ML reference.
wenzelm@26434
  2285
wenzelm@25970
  2286
* Instantiation target allows for simultaneous specification of class
wenzelm@25970
  2287
instance operations together with an instantiation proof.
wenzelm@25970
  2288
Type-checking phase allows to refer to class operations uniformly.
wenzelm@27067
  2289
See src/HOL/Complex/Complex.thy for an Isar example and
wenzelm@27067
  2290
src/HOL/Library/Eval.thy for an ML example.
haftmann@25502
  2291
wenzelm@26201
  2292
* Indexing of literal facts: be more serious about including only
wenzelm@26201
  2293
facts from the visible specification/proof context, but not the
wenzelm@26201
  2294
background context (locale etc.).  Affects `prop` notation and method
wenzelm@26201
  2295
"fact".  INCOMPATIBILITY: need to name facts explicitly in rare
wenzelm@26201
  2296
situations.
wenzelm@26201
  2297
wenzelm@26925
  2298
* Method "cases", "induct", "coinduct": removed obsolete/undocumented
wenzelm@26925
  2299
"(open)" option, which used to expose internal bound variables to the
wenzelm@26925
  2300
proof text.
wenzelm@26925
  2301
wenzelm@26925
  2302
* Isar statements: removed obsolete case "rule_context".
wenzelm@26925
  2303
INCOMPATIBILITY, better use explicit fixes/assumes.
wenzelm@26925
  2304
wenzelm@26874
  2305
* Locale proofs: default proof step now includes 'unfold_locales';
wenzelm@26874
  2306
hence 'proof' without argument may be used to unfold locale
wenzelm@26874
  2307
predicates.
ballarin@26765
  2308
ballarin@26765
  2309
haftmann@26762
  2310
*** Document preparation ***
haftmann@26762
  2311
wenzelm@26914
  2312
* Simplified pdfsetup.sty: color/hyperref is used unconditionally for
wenzelm@26914
  2313
both pdf and dvi (hyperlinks usually work in xdvi as well); removed
wenzelm@26914
  2314
obsolete thumbpdf setup (contemporary PDF viewers do this on the
wenzelm@26914
  2315
spot); renamed link color from "darkblue" to "linkcolor" (default
wenzelm@26920
  2316
value unchanged, can be redefined via \definecolor); no longer sets
wenzelm@26920
  2317
"a4paper" option (unnecessary or even intrusive).
wenzelm@26914
  2318
wenzelm@27008
  2319
* Antiquotation @{lemma A method} proves proposition A by the given
wenzelm@27008
  2320
method (either a method name or a method name plus (optional) method
wenzelm@27008
  2321
arguments in parentheses) and prints A just like @{prop A}.
haftmann@26762
  2322
haftmann@26762
  2323
wenzelm@25464
  2324
*** HOL ***
wenzelm@25464
  2325
wenzelm@27067
  2326
* New primrec package.  Specification syntax conforms in style to
wenzelm@27067
  2327
definition/function/....  No separate induction rule is provided.  The
wenzelm@27067
  2328
"primrec" command distinguishes old-style and new-style specifications
wenzelm@27067
  2329
by syntax.  The former primrec package is now named OldPrimrecPackage.
wenzelm@27067
  2330
When adjusting theories, beware: constants stemming from new-style
wenzelm@27067
  2331
primrec specifications have authentic syntax.
wenzelm@27067
  2332
wenzelm@27067
  2333
* Metis prover is now an order of magnitude faster, and also works
wenzelm@27067
  2334
with multithreading.
wenzelm@27067
  2335
wenzelm@27067
  2336
* Metis: the maximum number of clauses that can be produced from a
wenzelm@27067
  2337
theorem is now given by the attribute max_clauses.  Theorems that
wenzelm@27067
  2338
exceed this number are ignored, with a warning printed.
wenzelm@27067
  2339
wenzelm@27067
  2340
* Sledgehammer no longer produces structured proofs by default. To
wenzelm@27067
  2341
enable, declare [[sledgehammer_full = true]].  Attributes
wenzelm@27067
  2342
reconstruction_modulus, reconstruction_sorts renamed
wenzelm@27067
  2343
sledgehammer_modulus, sledgehammer_sorts.  INCOMPATIBILITY.
wenzelm@27067
  2344
haftmann@27104
  2345
* Method "induct_scheme" derives user-specified induction rules
wenzelm@27067
  2346
from well-founded induction and completeness of patterns. This factors
wenzelm@27067
  2347
out some operations that are done internally by the function package
wenzelm@27067
  2348
and makes them available separately.  See
wenzelm@27067
  2349
src/HOL/ex/Induction_Scheme.thy for examples.
wenzelm@27067
  2350
wenzelm@27067
  2351
* More flexible generation of measure functions for termination
wenzelm@27067
  2352
proofs: Measure functions can be declared by proving a rule of the
wenzelm@27067
  2353
form "is_measure f" and giving it the [measure_function] attribute.
wenzelm@27067
  2354
The "is_measure" predicate is logically meaningless (always true), and
wenzelm@27067
  2355
just guides the heuristic.  To find suitable measure functions, the
wenzelm@27067
  2356
termination prover sets up the goal "is_measure ?f" of the appropriate
wenzelm@27067
  2357
type and generates all solutions by prolog-style backwards proof using
wenzelm@27067
  2358
the declared rules.
wenzelm@27067
  2359
wenzelm@27067
  2360
This setup also deals with rules like 
wenzelm@27067
  2361
wenzelm@27067
  2362
  "is_measure f ==> is_measure (list_size f)"
wenzelm@27067
  2363
wenzelm@27067
  2364
which accommodates nested datatypes that recurse through lists.
wenzelm@27067
  2365
Similar rules are predeclared for products and option types.
wenzelm@27067
  2366
berghofe@26964
  2367
* Turned the type of sets "'a set" into an abbreviation for "'a => bool"
berghofe@26964
  2368
berghofe@26964
  2369
  INCOMPATIBILITIES:
berghofe@26964
  2370
wenzelm@27008
  2371
  - Definitions of overloaded constants on sets have to be replaced by
wenzelm@27008
  2372
    definitions on => and bool.
berghofe@26964
  2373
berghofe@26964
  2374
  - Some definitions of overloaded operators on sets can now be proved
wenzelm@27008
  2375
    using the definitions of the operators on => and bool.  Therefore,
wenzelm@27008
  2376
    the following theorems have been renamed:
berghofe@26964
  2377
berghofe@26964
  2378
      subset_def   -> subset_eq
berghofe@26964
  2379
      psubset_def  -> psubset_eq
berghofe@26964
  2380
      set_diff_def -> set_diff_eq
berghofe@26964
  2381
      Compl_def    -> Compl_eq
berghofe@26964
  2382
      Sup_set_def  -> Sup_set_eq
berghofe@26964
  2383
      Inf_set_def  -> Inf_set_eq
berghofe@26964
  2384
      sup_set_def  -> sup_set_eq
berghofe@26964
  2385
      inf_set_def  -> inf_set_eq
berghofe@26964
  2386
berghofe@26964
  2387
  - Due to the incompleteness of the HO unification algorithm, some
berghofe@26964
  2388
    rules such as subst may require manual instantiation, if some of
berghofe@26964
  2389
    the unknowns in the rule is a set.
berghofe@26964
  2390
berghofe@26964
  2391
  - Higher order unification and forward proofs:
berghofe@26964
  2392
    The proof pattern
berghofe@26964
  2393
berghofe@26964
  2394
      have "P (S::'a set)" <...>
berghofe@26964
  2395
      then have "EX S. P S" ..
berghofe@26964
  2396
wenzelm@27008
  2397
    no longer works (due to the incompleteness of the HO unification
wenzelm@27008
  2398
    algorithm) and must be replaced by the pattern
berghofe@26964
  2399
berghofe@26964
  2400
      have "EX S. P S"
berghofe@26964
  2401
      proof
berghofe@26964
  2402
        show "P S" <...>
berghofe@26964
  2403
      qed
berghofe@26964
  2404
berghofe@26964
  2405
  - Calculational reasoning with subst (or similar rules):
berghofe@26964
  2406
    The proof pattern
berghofe@26964
  2407
berghofe@26964
  2408
      have "P (S::'a set)" <...>
berghofe@26964
  2409
      also have "S = T" <...>
berghofe@26964
  2410
      finally have "P T" .
berghofe@26964
  2411
wenzelm@27008
  2412
    no longer works (for similar reasons as the previous example) and
wenzelm@27008
  2413
    must be replaced by something like
berghofe@26964
  2414
berghofe@26964
  2415
      have "P (S::'a set)" <...>
berghofe@26964
  2416
      moreover have "S = T" <...>
berghofe@26964
  2417
      ultimately have "P T" by simp
berghofe@26964
  2418
berghofe@26964
  2419
  - Tactics or packages written in ML code:
berghofe@26964
  2420
    Code performing pattern matching on types via
berghofe@26964
  2421
berghofe@26964
  2422
      Type ("set", [T]) => ...
berghofe@26964
  2423
wenzelm@27008
  2424
    must be rewritten. Moreover, functions like strip_type or
wenzelm@27008
  2425
    binder_types no longer return the right value when applied to a
wenzelm@27008
  2426
    type of the form
berghofe@26964
  2427
berghofe@26964
  2428
      T1 => ... => Tn => U => bool
berghofe@26964
  2429
berghofe@26964
  2430
    rather than
berghofe@26964
  2431
berghofe@26964
  2432
      T1 => ... => Tn => U set
berghofe@26964
  2433
wenzelm@26874
  2434
* Merged theories Wellfounded_Recursion, Accessible_Part and
wenzelm@27067
  2435
Wellfounded_Relations to theory Wellfounded.
krauss@26748
  2436
haftmann@26513
  2437
* Explicit class "eq" for executable equality.  INCOMPATIBILITY.
haftmann@26513
  2438
wenzelm@26874
  2439
* Class finite no longer treats UNIV as class parameter.  Use class
wenzelm@26874
  2440
enum from theory Library/Enum instead to achieve a similar effect.
haftmann@26445
  2441
INCOMPATIBILITY.
haftmann@26445
  2442
wenzelm@26874
  2443
* Theory List: rule list_induct2 now has explicitly named cases "Nil"
wenzelm@26874
  2444
and "Cons".  INCOMPATIBILITY.
wenzelm@26874
  2445
wenzelm@26422
  2446
* HOL (and FOL): renamed variables in rules imp_elim and swap.
wenzelm@26422
  2447
Potential INCOMPATIBILITY.
wenzelm@26422
  2448
wenzelm@26874
  2449
* Theory Product_Type: duplicated lemmas split_Pair_apply and
wenzelm@26874
  2450
injective_fst_snd removed, use split_eta and prod_eqI instead.
wenzelm@26874
  2451
Renamed upd_fst to apfst and upd_snd to apsnd.  INCOMPATIBILITY.
haftmann@26355
  2452
wenzelm@26335
  2453
* Theory Nat: removed redundant lemmas that merely duplicate lemmas of
wenzelm@26335
  2454
the same name in theory Orderings:
wenzelm@26335
  2455
wenzelm@26335
  2456
  less_trans
wenzelm@26335
  2457
  less_linear
wenzelm@26335
  2458
  le_imp_less_or_eq
wenzelm@26335
  2459
  le_less_trans
wenzelm@26335
  2460
  less_le_trans
wenzelm@26335
  2461
  less_not_sym
wenzelm@26335
  2462
  less_asym
wenzelm@26335
  2463
wenzelm@26335
  2464
Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
wenzelm@26335
  2465
less_irrefl_nat.  Potential INCOMPATIBILITY due to more general types
wenzelm@26335
  2466
and different variable names.
wenzelm@26315
  2467
haftmann@26231
  2468
* Library/Option_ord.thy: Canonical order on option type.
haftmann@26231
  2469
wenzelm@27008
  2470
* Library/RBT.thy: Red-black trees, an efficient implementation of
wenzelm@27008
  2471
finite maps.
krauss@26197
  2472
haftmann@26231
  2473
* Library/Countable.thy: Type class for countable types.
haftmann@26231
  2474
wenzelm@26180
  2475
* Theory Int: The representation of numerals has changed.  The infix
wenzelm@26180
  2476
operator BIT and the bit datatype with constructors B0 and B1 have
wenzelm@26180
  2477
disappeared.  INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
wenzelm@26180
  2478
place of "x BIT bit.B0" and "y BIT bit.B1", respectively.  Theorems
wenzelm@26180
  2479
involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
wenzelm@26180
  2480
accordingly.
wenzelm@26180
  2481
wenzelm@26180
  2482
* Theory Nat: definition of <= and < on natural numbers no longer
wenzelm@26180
  2483
depend on well-founded relations.  INCOMPATIBILITY.  Definitions
wenzelm@26180
  2484
le_def and less_def have disappeared.  Consider lemmas not_less
wenzelm@26180
  2485
[symmetric, where ?'a = nat] and less_eq [symmetric] instead.
wenzelm@26180
  2486
wenzelm@26180
  2487
* Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
wenzelm@26180
  2488
(whose purpose mainly is for various fold_set functionals) have been
wenzelm@26874
  2489
abandoned in favor of the existing algebraic classes
wenzelm@26180
  2490
ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
wenzelm@26180
  2491
lower_semilattice (resp. upper_semilattice) and linorder.
haftmann@26139
  2492
INCOMPATIBILITY.
haftmann@26041
  2493
wenzelm@26180
  2494
* Theory Transitive_Closure: induct and cases rules now declare proper
wenzelm@26180
  2495
case_names ("base" and "step").  INCOMPATIBILITY.
wenzelm@26180
  2496
wenzelm@26180
  2497
* Theorem Inductive.lfp_ordinal_induct generalized to complete
wenzelm@26180
  2498
lattices.  The form set-specific version is available as
wenzelm@26180
  2499
Inductive.lfp_ordinal_induct_set.
haftmann@26013
  2500
wenzelm@26874
  2501
* Renamed theorems "power.simps" to "power_int.simps".
wenzelm@27067
  2502
INCOMPATIBILITY.
haftmann@25961
  2503
wenzelm@26180
  2504
* Class semiring_div provides basic abstract properties of semirings
haftmann@25942
  2505
with division and modulo operations.  Subsumes former class dvd_mod.
haftmann@25942
  2506
wenzelm@26180
  2507
* Merged theories IntDef, Numeral and IntArith into unified theory
wenzelm@26180
  2508
Int.  INCOMPATIBILITY.
wenzelm@26180
  2509
wenzelm@26180
  2510
* Theory Library/Code_Index: type "index" now represents natural
wenzelm@26180
  2511
numbers rather than integers.  INCOMPATIBILITY.
wenzelm@26180
  2512
wenzelm@26180
  2513
* New class "uminus" with operation "uminus" (split of from class
wenzelm@26180
  2514
"minus" which now only has operation "minus", binary).
haftmann@25919
  2515
INCOMPATIBILITY.
haftmann@25919
  2516
wenzelm@25522
  2517
* Constants "card", "internal_split", "option_map" now with authentic
haftmann@25919
  2518
syntax.  INCOMPATIBILITY.
wenzelm@25522
  2519
wenzelm@25522
  2520
* Definitions subset_def, psubset_def, set_diff_def, Compl_def,
wenzelm@25522
  2521
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
wenzelm@25522
  2522
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
wenzelm@25522
  2523
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
wenzelm@25522
  2524
Sup_set_def, le_def, less_def, option_map_def now with object
haftmann@25919
  2525
equality.  INCOMPATIBILITY.
wenzelm@25464
  2526
schirmer@25705
  2527
* Records. Removed K_record, and replaced it by pure lambda term
wenzelm@25726
  2528
%x. c. The simplifier setup is now more robust against eta expansion.
schirmer@25705
  2529
INCOMPATIBILITY: in cases explicitly referring to K_record.
wenzelm@25464
  2530
wenzelm@27067
  2531
* Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
wenzelm@27067
  2532
wenzelm@27067
  2533
* Library/ListVector: new theory of arithmetic vector operations.
wenzelm@27067
  2534
wenzelm@27067
  2535
* Library/Order_Relation: new theory of various orderings as sets of
wenzelm@27067
  2536
pairs.  Defines preorders, partial orders, linear orders and
wenzelm@27067
  2537
well-orders on sets and on types.
krauss@26877
  2538
wenzelm@25726
  2539
krauss@26197
  2540
*** ZF ***
krauss@26197
  2541
wenzelm@26874
  2542
* Renamed some theories to allow to loading both ZF and HOL in the
wenzelm@26874
  2543
same session:
wenzelm@26874
  2544
wenzelm@26874
  2545
  Datatype  -> Datatype_ZF
wenzelm@26874
  2546
  Inductive -> Inductive_ZF
wenzelm@26874
  2547
  Int       -> Int_ZF
wenzelm@26874
  2548
  IntDiv    -> IntDiv_ZF
wenzelm@26874
  2549
  Nat       -> Nat_ZF
wenzelm@26874
  2550
  List      -> List_ZF
wenzelm@26874
  2551
  Main      -> Main_ZF
wenzelm@26874
  2552
wenzelm@26874
  2553
INCOMPATIBILITY: ZF theories that import individual theories below
wenzelm@26874
  2554
Main might need to be adapted.  Regular theory Main is still
wenzelm@26874
  2555
available, as trivial extension of Main_ZF.
krauss@26197
  2556
krauss@26197
  2557
wenzelm@25737
  2558
*** ML ***
wenzelm@25737
  2559
wenzelm@27067
  2560
* ML within Isar: antiquotation @{const name} or @{const
wenzelm@27067
  2561
name(typargs)} produces statically-checked Const term.
wenzelm@27067
  2562
wenzelm@26401
  2563
* Functor NamedThmsFun: data is available to the user as dynamic fact
wenzelm@26724
  2564
(of the same name).  Removed obsolete print command.
wenzelm@26401
  2565
wenzelm@27067
  2566
* Removed obsolete "use_legacy_bindings" function.
wenzelm@26188
  2567
wenzelm@25737
  2568
* The ``print mode'' is now a thread-local value derived from a global
wenzelm@25737
  2569
template (the former print_mode reference), thus access becomes
wenzelm@25737
  2570
non-critical.  The global print_mode reference is for session
wenzelm@25737
  2571
management only; user-code should use print_mode_value,
wenzelm@25737
  2572
print_mode_active, PrintMode.setmp etc.  INCOMPATIBILITY.
wenzelm@25737
  2573
wenzelm@26874
  2574
* Functions system/system_out provide a robust way to invoke external
wenzelm@29161
  2575
shell commands, with propagation of interrupts (requires Poly/ML
wenzelm@29161
  2576
5.2.1).  Do not use OS.Process.system etc. from the basis library!
wenzelm@26222
  2577
wenzelm@25737
  2578
wenzelm@25626
  2579
*** System ***
wenzelm@25626
  2580
wenzelm@25971
  2581
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
wenzelm@25971
  2582
in accordance with Proof General 3.7, which prefers GNU emacs.
wenzelm@25970
  2583
wenzelm@25626
  2584
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm@25626
  2585
optional line editor may be specified via ISABELLE_LINE_EDITOR
wenzelm@25626
  2586
setting, the default settings attempt to locate "ledit" and "rlwrap".
wenzelm@25626
  2587
wenzelm@25651
  2588
* isatool browser now works with Cygwin as well, using general
wenzelm@25651
  2589
"javapath" function defined in Isabelle process environment.
wenzelm@25651
  2590
wenzelm@27067
  2591
* YXML notation provides a simple and efficient alternative to
wenzelm@27067
  2592
standard XML transfer syntax.  See src/Pure/General/yxml.ML and
wenzelm@27067
  2593
isatool yxml as described in the Isabelle system manual.
wenzelm@25651
  2594
wenzelm@25652
  2595
* JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
wenzelm@25651
  2596
provides general wrapper for managing an Isabelle process in a robust
wenzelm@25651
  2597
fashion, with ``cooked'' output from stdin/stderr.
wenzelm@25651
  2598
wenzelm@25855
  2599
* Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
wenzelm@25855
  2600
based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
wenzelm@25855
  2601
wenzelm@27067
  2602
* Removed obsolete THIS_IS_ISABELLE_BUILD feature.  NB: the documented
wenzelm@27067
  2603
way of changing the user's settings is via
wenzelm@27067
  2604
ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
wenzelm@27067
  2605
script.
wenzelm@27067
  2606
wenzelm@27067
  2607
* Multithreading.max_threads := 0 refers to the number of actual CPU
wenzelm@27067
  2608
cores of the underlying machine, which is a good starting point for
wenzelm@27067
  2609
optimal performance tuning.  The corresponding usedir option -M allows
wenzelm@27067
  2610
"max" as an alias for "0".  WARNING: does not work on certain versions
wenzelm@27067
  2611
of Mac OS (with Poly/ML 5.1).
wenzelm@27067
  2612
wenzelm@27067
  2613
* isabelle-process: non-ML sessions are run with "nice", to reduce the
wenzelm@27067
  2614
adverse effect of Isabelle flooding interactive front-ends (notably
wenzelm@27067
  2615
ProofGeneral / XEmacs).
wenzelm@27067
  2616
wenzelm@25626
  2617
wenzelm@25464
  2618
wenzelm@25429
  2619
New in Isabelle2007 (November 2007)
wenzelm@25429
  2620
-----------------------------------
wenzelm@17754
  2621
wenzelm@17754
  2622
*** General ***
wenzelm@17754
  2623
wenzelm@22826
  2624
* More uniform information about legacy features, notably a
wenzelm@22826
  2625
warning/error of "Legacy feature: ...", depending on the state of the
wenzelm@23367
  2626
tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
wenzelm@23367
  2627
legacy features will disappear eventually.
wenzelm@22826
  2628
wenzelm@17918
  2629
* Theory syntax: the header format ``theory A = B + C:'' has been
wenzelm@17918
  2630
discontinued in favour of ``theory A imports B C begin''.  Use isatool
wenzelm@17918
  2631
fixheaders to convert existing theory files.  INCOMPATIBILITY.
wenzelm@17918
  2632
wenzelm@17918
  2633
* Theory syntax: the old non-Isar theory file format has been
wenzelm@17918
  2634
discontinued altogether.  Note that ML proof scripts may still be used