NEWS
author haftmann
Wed Feb 10 14:12:30 2010 +0100 (2010-02-10)
changeset 35093 5acba118b02a
parent 35084 e25eedfc15ce
child 35100 53754ec7360b
permissions -rw-r--r--
NEWS
wenzelm@5363
     1
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     2
==============================================
wenzelm@2553
     3
haftmann@33993
     4
New in this Isabelle version
haftmann@33993
     5
----------------------------
haftmann@33993
     6
haftmann@34170
     7
*** Pure ***
haftmann@34170
     8
haftmann@34170
     9
* Code generator: details of internal data cache have no impact on
haftmann@34170
    10
the user space functionality any longer.
haftmann@34170
    11
haftmann@34170
    12
haftmann@33993
    13
*** HOL ***
haftmann@33993
    14
haftmann@35042
    15
* New set of rules "ac_simps" provides combined assoc / commute rewrites
haftmann@35042
    16
for all interpretations of the appropriate generic locales.
haftmann@35042
    17
haftmann@35050
    18
* Renamed theory "OrderedGroup" to "Groups" and split theory "Ring_and_Field"
haftmann@35050
    19
into theories "Rings" and "Fields";  for more appropriate and more
haftmann@35050
    20
consistent names suitable for name prefixes within the HOL theories.
haftmann@35050
    21
INCOMPATIBILITY.
haftmann@35050
    22
haftmann@35084
    23
* Some generic constants have been put to appropriate theories:
haftmann@35084
    24
haftmann@35093
    25
    less_eq, less: Orderings
haftmann@35093
    26
    abs, sgn: Groups
haftmann@35084
    27
    inverse, divide: Rings
haftmann@35084
    28
haftmann@35084
    29
INCOMPATIBILITY.
haftmann@35084
    30
haftmann@35084
    31
* Class division ring also requires proof of fact divide_inverse.  However instantiation
haftmann@35084
    32
of parameter divide has also been required previously.  INCOMPATIBILITY.
haftmann@35084
    33
haftmann@35032
    34
* More consistent naming of type classes involving orderings (and lattices):
haftmann@35027
    35
haftmann@35027
    36
    lower_semilattice                   ~> semilattice_inf
haftmann@35027
    37
    upper_semilattice                   ~> semilattice_sup
haftmann@35027
    38
haftmann@35027
    39
    dense_linear_order                  ~> dense_linorder
haftmann@35027
    40
haftmann@35027
    41
    pordered_ab_group_add               ~> ordered_ab_group_add
haftmann@35027
    42
    pordered_ab_group_add_abs           ~> ordered_ab_group_add_abs
haftmann@35027
    43
    pordered_ab_semigroup_add           ~> ordered_ab_semigroup_add
haftmann@35027
    44
    pordered_ab_semigroup_add_imp_le    ~> ordered_ab_semigroup_add_imp_le
haftmann@35027
    45
    pordered_cancel_ab_semigroup_add    ~> ordered_cancel_ab_semigroup_add
haftmann@35027
    46
    pordered_cancel_comm_semiring       ~> ordered_cancel_comm_semiring
haftmann@35027
    47
    pordered_cancel_semiring            ~> ordered_cancel_semiring
haftmann@35027
    48
    pordered_comm_monoid_add            ~> ordered_comm_monoid_add
haftmann@35027
    49
    pordered_comm_ring                  ~> ordered_comm_ring
haftmann@35027
    50
    pordered_comm_semiring              ~> ordered_comm_semiring
haftmann@35027
    51
    pordered_ring                       ~> ordered_ring
haftmann@35027
    52
    pordered_ring_abs                   ~> ordered_ring_abs
haftmann@35027
    53
    pordered_semiring                   ~> ordered_semiring
haftmann@35027
    54
haftmann@35027
    55
    ordered_ab_group_add                ~> linordered_ab_group_add
haftmann@35027
    56
    ordered_ab_semigroup_add            ~> linordered_ab_semigroup_add
haftmann@35027
    57
    ordered_cancel_ab_semigroup_add     ~> linordered_cancel_ab_semigroup_add
haftmann@35027
    58
    ordered_comm_semiring_strict        ~> linordered_comm_semiring_strict
haftmann@35027
    59
    ordered_field                       ~> linordered_field
haftmann@35027
    60
    ordered_field_no_lb                 ~> linordered_field_no_lb
haftmann@35027
    61
    ordered_field_no_ub                 ~> linordered_field_no_ub
haftmann@35027
    62
    ordered_field_dense_linear_order    ~> dense_linordered_field
haftmann@35027
    63
    ordered_idom                        ~> linordered_idom
haftmann@35027
    64
    ordered_ring                        ~> linordered_ring
haftmann@35027
    65
    ordered_ring_le_cancel_factor       ~> linordered_ring_le_cancel_factor
haftmann@35027
    66
    ordered_ring_less_cancel_factor     ~> linordered_ring_less_cancel_factor
haftmann@35027
    67
    ordered_ring_strict                 ~> linordered_ring_strict
haftmann@35027
    68
    ordered_semidom                     ~> linordered_semidom
haftmann@35027
    69
    ordered_semiring                    ~> linordered_semiring
haftmann@35027
    70
    ordered_semiring_1                  ~> linordered_semiring_1
haftmann@35027
    71
    ordered_semiring_1_strict           ~> linordered_semiring_1_strict
haftmann@35027
    72
    ordered_semiring_strict             ~> linordered_semiring_strict
haftmann@35027
    73
haftmann@35032
    74
  The following slightly odd type classes have been moved to
haftmann@35032
    75
  a separate theory Library/Lattice_Algebras.thy:
haftmann@35032
    76
haftmann@35032
    77
    lordered_ab_group_add               ~> lattice_ab_group_add
haftmann@35032
    78
    lordered_ab_group_add_abs           ~> lattice_ab_group_add_abs
haftmann@35032
    79
    lordered_ab_group_add_meet          ~> semilattice_inf_ab_group_add
haftmann@35032
    80
    lordered_ab_group_add_join          ~> semilattice_sup_ab_group_add
haftmann@35032
    81
    lordered_ring                       ~> lattice_ring
haftmann@35032
    82
haftmann@35027
    83
INCOMPATIBILITY.
haftmann@35027
    84
wenzelm@35009
    85
* New theory Algebras contains generic algebraic structures and
haftmann@34974
    86
generic algebraic operations.  INCOMPATIBILTY: constants zero, one,
haftmann@35093
    87
plus, minus, uminus and times have been moved from HOL.thy to Algebras.thy.
haftmann@34974
    88
haftmann@34962
    89
* HOLogic.strip_psplit: types are returned in syntactic order, similar
haftmann@34962
    90
to other strip and tuple operations.  INCOMPATIBILITY.
haftmann@34962
    91
haftmann@34946
    92
* Various old-style primrec specifications in the HOL theories have been
haftmann@34946
    93
replaced by new-style primrec, especially in theory List.  The corresponding
haftmann@34946
    94
constants now have authentic syntax.  INCOMPATIBILITY.
haftmann@34946
    95
wenzelm@35009
    96
* Reorganized theory Multiset: less duplication, less historical
haftmann@34946
    97
organization of sections, conversion from associations lists to
haftmann@34946
    98
multisets, rudimentary code generation.  Use insert_DiffM2 [symmetric]
haftmann@34946
    99
instead of elem_imp_eq_diff_union, if needed.  INCOMPATIBILITY.
haftmann@34946
   100
wenzelm@35009
   101
* Reorganized theory Sum_Type; Inl and Inr now have authentic syntax.
wenzelm@35009
   102
INCOMPATIBILITY.
haftmann@33993
   103
haftmann@33993
   104
* Code generation: ML and OCaml code is decorated with signatures.
haftmann@33993
   105
wenzelm@35009
   106
* Theory Complete_Lattice: lemmas top_def and bot_def have been
wenzelm@35009
   107
replaced by the more convenient lemmas Inf_empty and Sup_empty.
wenzelm@35009
   108
Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
wenzelm@35009
   109
by Inf_insert and Sup_insert.  Lemmas Inf_UNIV and Sup_UNIV replace
wenzelm@35009
   110
former Inf_Univ and Sup_Univ.  Lemmas inf_top_right and sup_bot_right
wenzelm@35009
   111
subsume inf_top and sup_bot respectively.  INCOMPATIBILITY.
wenzelm@35009
   112
wenzelm@35009
   113
* Theory Finite_Set and List: some lemmas have been generalized from
wenzelm@34076
   114
sets to lattices:
wenzelm@34076
   115
haftmann@34007
   116
  fun_left_comm_idem_inter      ~> fun_left_comm_idem_inf
haftmann@34007
   117
  fun_left_comm_idem_union      ~> fun_left_comm_idem_sup
haftmann@34007
   118
  inter_Inter_fold_inter        ~> inf_Inf_fold_inf
haftmann@34007
   119
  union_Union_fold_union        ~> sup_Sup_fold_sup
haftmann@34007
   120
  Inter_fold_inter              ~> Inf_fold_inf
haftmann@34007
   121
  Union_fold_union              ~> Sup_fold_sup
haftmann@34007
   122
  inter_INTER_fold_inter        ~> inf_INFI_fold_inf
haftmann@34007
   123
  union_UNION_fold_union        ~> sup_SUPR_fold_sup
haftmann@34007
   124
  INTER_fold_inter              ~> INFI_fold_inf
haftmann@34007
   125
  UNION_fold_union              ~> SUPR_fold_sup
haftmann@34007
   126
wenzelm@35009
   127
* Theory List: added transpose.
wenzelm@35009
   128
haftmann@33993
   129
haftmann@33993
   130
*** ML ***
haftmann@33993
   131
wenzelm@35021
   132
* Renamed old-style Drule.standard to Drule.export_without_context, to
wenzelm@35021
   133
emphasize that this is in no way a standard operation.
wenzelm@35021
   134
INCOMPATIBILITY.
wenzelm@35021
   135
wenzelm@34076
   136
* Curried take and drop in library.ML; negative length is interpreted
wenzelm@34076
   137
as infinity (as in chop).  INCOMPATIBILITY.
wenzelm@34076
   138
wenzelm@34076
   139
* Subgoal.FOCUS (and variants): resulting goal state is normalized as
wenzelm@34076
   140
usual for resolution.  Rare INCOMPATIBILITY.
wenzelm@34076
   141
wenzelm@34259
   142
* Discontinued old TheoryDataFun with its copy/init operation -- data
wenzelm@34259
   143
needs to be pure.  Functor Theory_Data_PP retains the traditional
wenzelm@34259
   144
Pretty.pp argument to merge, which is absent in the standard
wenzelm@34259
   145
Theory_Data version.
wenzelm@34259
   146
haftmann@33993
   147
wenzelm@34238
   148
*** System ***
wenzelm@34238
   149
wenzelm@34238
   150
* Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
wenzelm@34238
   151
ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions.  Note that
wenzelm@34238
   152
proof terms are enabled unconditionally in the new HOL-Proofs image.
wenzelm@34238
   153
wenzelm@34255
   154
* Discontinued old ISABELLE and ISATOOL environment settings (legacy
wenzelm@34255
   155
feature since Isabelle2009).  Use ISABELLE_PROCESS and ISABELLE_TOOL,
wenzelm@34255
   156
respectively.
wenzelm@34255
   157
wenzelm@34238
   158
haftmann@33993
   159
wenzelm@33842
   160
New in Isabelle2009-1 (December 2009)
wenzelm@33842
   161
-------------------------------------
wenzelm@30904
   162
wenzelm@31547
   163
*** General ***
wenzelm@31547
   164
wenzelm@31547
   165
* Discontinued old form of "escaped symbols" such as \\<forall>.  Only
wenzelm@31547
   166
one backslash should be used, even in ML sources.
wenzelm@31547
   167
wenzelm@31547
   168
haftmann@30951
   169
*** Pure ***
haftmann@30951
   170
ballarin@32846
   171
* Locale interpretation propagates mixins along the locale hierarchy.
ballarin@32846
   172
The currently only available mixins are the equations used to map
ballarin@32846
   173
local definitions to terms of the target domain of an interpretation.
ballarin@32846
   174
wenzelm@33842
   175
* Reactivated diagnostic command 'print_interps'.  Use "print_interps
wenzelm@33842
   176
loc" to print all interpretations of locale "loc" in the theory.
wenzelm@33842
   177
Interpretations in proofs are not shown.
ballarin@32846
   178
ballarin@32983
   179
* Thoroughly revised locales tutorial.  New section on conditional
ballarin@32983
   180
interpretation.
ballarin@32983
   181
wenzelm@33843
   182
* On instantiation of classes, remaining undefined class parameters
wenzelm@33843
   183
are formally declared.  INCOMPATIBILITY.
wenzelm@33843
   184
haftmann@30951
   185
wenzelm@33842
   186
*** Document preparation ***
wenzelm@33842
   187
wenzelm@33842
   188
* New generalized style concept for printing terms: @{foo (style) ...}
wenzelm@33842
   189
instead of @{foo_style style ...}  (old form is still retained for
wenzelm@33842
   190
backward compatibility).  Styles can be also applied for
wenzelm@33842
   191
antiquotations prop, term_type and typeof.
haftmann@32891
   192
haftmann@32891
   193
haftmann@30930
   194
*** HOL ***
haftmann@30930
   195
wenzelm@33842
   196
* New proof method "smt" for a combination of first-order logic with
wenzelm@33842
   197
equality, linear and nonlinear (natural/integer/real) arithmetic, and
wenzelm@33842
   198
fixed-size bitvectors; there is also basic support for higher-order
wenzelm@33842
   199
features (esp. lambda abstractions).  It is an incomplete decision
wenzelm@33842
   200
procedure based on external SMT solvers using the oracle mechanism;
wenzelm@33842
   201
for the SMT solver Z3, this method is proof-producing.  Certificates
wenzelm@33842
   202
are provided to avoid calling the external solvers solely for
wenzelm@33842
   203
re-checking proofs.  Due to a remote SMT service there is no need for
wenzelm@33842
   204
installing SMT solvers locally.  See src/HOL/SMT.
wenzelm@33842
   205
wenzelm@33842
   206
* New commands to load and prove verification conditions generated by
wenzelm@33842
   207
the Boogie program verifier or derived systems (e.g. the Verifying C
wenzelm@33842
   208
Compiler (VCC) or Spec#).  See src/HOL/Boogie.
wenzelm@33842
   209
wenzelm@33842
   210
* New counterexample generator tool 'nitpick' based on the Kodkod
wenzelm@33842
   211
relational model finder.  See src/HOL/Tools/Nitpick and
wenzelm@33842
   212
src/HOL/Nitpick_Examples.
wenzelm@33842
   213
haftmann@33860
   214
* New commands 'code_pred' and 'values' to invoke the predicate
haftmann@33860
   215
compiler and to enumerate values of inductive predicates.
haftmann@33860
   216
haftmann@33860
   217
* A tabled implementation of the reflexive transitive closure.
haftmann@33860
   218
haftmann@33860
   219
* New implementation of quickcheck uses generic code generator;
haftmann@33860
   220
default generators are provided for all suitable HOL types, records
haftmann@33860
   221
and datatypes.  Old quickcheck can be re-activated importing theory
haftmann@33860
   222
Library/SML_Quickcheck.
haftmann@33860
   223
wenzelm@33843
   224
* New testing tool Mirabelle for automated proof tools.  Applies
wenzelm@33843
   225
several tools and tactics like sledgehammer, metis, or quickcheck, to
wenzelm@33843
   226
every proof step in a theory.  To be used in batch mode via the
wenzelm@33843
   227
"mirabelle" utility.
wenzelm@33843
   228
wenzelm@33843
   229
* New proof method "sos" (sum of squares) for nonlinear real
wenzelm@33843
   230
arithmetic (originally due to John Harison). It requires theory
wenzelm@33843
   231
Library/Sum_Of_Squares.  It is not a complete decision procedure but
wenzelm@33843
   232
works well in practice on quantifier-free real arithmetic with +, -,
wenzelm@33843
   233
*, ^, =, <= and <, i.e. boolean combinations of equalities and
wenzelm@33843
   234
inequalities between polynomials.  It makes use of external
wenzelm@33843
   235
semidefinite programming solvers.  Method "sos" generates a
wenzelm@33843
   236
certificate that can be pasted into the proof thus avoiding the need
wenzelm@33843
   237
to call an external tool every time the proof is checked.  See
wenzelm@33843
   238
src/HOL/Library/Sum_Of_Squares.
wenzelm@33843
   239
wenzelm@33843
   240
* New method "linarith" invokes existing linear arithmetic decision
wenzelm@33843
   241
procedure only.
wenzelm@33843
   242
wenzelm@33843
   243
* New command 'atp_minimal' reduces result produced by Sledgehammer.
wenzelm@33843
   244
wenzelm@33843
   245
* New Sledgehammer option "Full Types" in Proof General settings menu.
wenzelm@33843
   246
Causes full type information to be output to the ATPs.  This slows
wenzelm@33843
   247
ATPs down considerably but eliminates a source of unsound "proofs"
wenzelm@33843
   248
that fail later.
wenzelm@33843
   249
wenzelm@33843
   250
* New method "metisFT": A version of metis that uses full type
wenzelm@33843
   251
information in order to avoid failures of proof reconstruction.
wenzelm@33843
   252
wenzelm@33843
   253
* New evaluator "approximate" approximates an real valued term using
wenzelm@33843
   254
the same method as the approximation method.
wenzelm@33843
   255
wenzelm@33843
   256
* Method "approximate" now supports arithmetic expressions as
wenzelm@33843
   257
boundaries of intervals and implements interval splitting and Taylor
wenzelm@33843
   258
series expansion.
wenzelm@33843
   259
wenzelm@33843
   260
* ML antiquotation @{code_datatype} inserts definition of a datatype
wenzelm@33843
   261
generated by the code generator; e.g. see src/HOL/Predicate.thy.
wenzelm@33843
   262
haftmann@33860
   263
* New theory SupInf of the supremum and infimum operators for sets of
haftmann@33860
   264
reals.
haftmann@33860
   265
haftmann@33860
   266
* New theory Probability, which contains a development of measure
haftmann@33860
   267
theory, eventually leading to Lebesgue integration and probability.
haftmann@33860
   268
haftmann@33860
   269
* Extended Multivariate Analysis to include derivation and Brouwer's
haftmann@33860
   270
fixpoint theorem.
wenzelm@33843
   271
wenzelm@33842
   272
* Reorganization of number theory, INCOMPATIBILITY:
wenzelm@33873
   273
  - new number theory development for nat and int, in theories Divides
wenzelm@33873
   274
    and GCD as well as in new session Number_Theory
wenzelm@33873
   275
  - some constants and facts now suffixed with _nat and _int
wenzelm@33873
   276
    accordingly
wenzelm@33873
   277
  - former session NumberTheory now named Old_Number_Theory, including
wenzelm@33873
   278
    theories Legacy_GCD and Primes (prefer Number_Theory if possible)
wenzelm@33842
   279
  - moved theory Pocklington from src/HOL/Library to
wenzelm@33842
   280
    src/HOL/Old_Number_Theory
haftmann@32479
   281
wenzelm@33873
   282
* Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
wenzelm@33873
   283
lcm of finite and infinite sets. It is shown that they form a complete
haftmann@32600
   284
lattice.
haftmann@32600
   285
haftmann@32600
   286
* Class semiring_div requires superclass no_zero_divisors and proof of
haftmann@32600
   287
div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
haftmann@32600
   288
div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
haftmann@32600
   289
generalized to class semiring_div, subsuming former theorems
haftmann@32600
   290
zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
haftmann@32600
   291
zdiv_zmult_zmult2.  div_mult_mult1 is now [simp] by default.
haftmann@32600
   292
INCOMPATIBILITY.
haftmann@32600
   293
haftmann@32588
   294
* Refinements to lattice classes and sets:
haftmann@32064
   295
  - less default intro/elim rules in locale variant, more default
haftmann@32064
   296
    intro/elim rules in class variant: more uniformity
wenzelm@33842
   297
  - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
wenzelm@33842
   298
    le_inf_iff
wenzelm@33842
   299
  - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
wenzelm@33842
   300
    sup_aci)
haftmann@32064
   301
  - renamed ACI to inf_sup_aci
haftmann@32600
   302
  - new class "boolean_algebra"
wenzelm@33842
   303
  - class "complete_lattice" moved to separate theory
haftmann@33860
   304
    "Complete_Lattice"; corresponding constants (and abbreviations)
wenzelm@33842
   305
    renamed and with authentic syntax:
haftmann@33860
   306
    Set.Inf ~>    Complete_Lattice.Inf
haftmann@33860
   307
    Set.Sup ~>    Complete_Lattice.Sup
haftmann@33860
   308
    Set.INFI ~>   Complete_Lattice.INFI
haftmann@33860
   309
    Set.SUPR ~>   Complete_Lattice.SUPR
haftmann@33860
   310
    Set.Inter ~>  Complete_Lattice.Inter
haftmann@33860
   311
    Set.Union ~>  Complete_Lattice.Union
haftmann@33860
   312
    Set.INTER ~>  Complete_Lattice.INTER
haftmann@33860
   313
    Set.UNION ~>  Complete_Lattice.UNION
haftmann@32600
   314
  - authentic syntax for
haftmann@32600
   315
    Set.Pow
haftmann@32600
   316
    Set.image
haftmann@32588
   317
  - mere abbreviations:
haftmann@32588
   318
    Set.empty               (for bot)
haftmann@32588
   319
    Set.UNIV                (for top)
haftmann@33860
   320
    Set.inter               (for inf, formerly Set.Int)
haftmann@33860
   321
    Set.union               (for sup, formerly Set.Un)
haftmann@32588
   322
    Complete_Lattice.Inter  (for Inf)
haftmann@32588
   323
    Complete_Lattice.Union  (for Sup)
haftmann@32606
   324
    Complete_Lattice.INTER  (for INFI)
haftmann@32606
   325
    Complete_Lattice.UNION  (for SUPR)
haftmann@32600
   326
  - object-logic definitions as far as appropriate
haftmann@32217
   327
haftmann@32691
   328
INCOMPATIBILITY.  Care is required when theorems Int_subset_iff or
wenzelm@33842
   329
Un_subset_iff are explicitly deleted as default simp rules; then also
wenzelm@33842
   330
their lattice counterparts le_inf_iff and le_sup_iff have to be
haftmann@32691
   331
deleted to achieve the desired effect.
haftmann@32064
   332
wenzelm@33842
   333
* Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
wenzelm@33842
   334
rules by default any longer; the same applies to min_max.inf_absorb1
wenzelm@33842
   335
etc.  INCOMPATIBILITY.
wenzelm@33842
   336
wenzelm@33842
   337
* Rules sup_Int_eq and sup_Un_eq are no longer declared as
wenzelm@33842
   338
pred_set_conv by default.  INCOMPATIBILITY.
wenzelm@33842
   339
wenzelm@33842
   340
* Power operations on relations and functions are now one dedicated
haftmann@32706
   341
constant "compow" with infix syntax "^^".  Power operation on
wenzelm@31547
   342
multiplicative monoids retains syntax "^" and is now defined generic
wenzelm@31547
   343
in class power.  INCOMPATIBILITY.
wenzelm@31547
   344
wenzelm@33842
   345
* Relation composition "R O S" now has a more standard argument order:
wenzelm@33842
   346
"R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}".  INCOMPATIBILITY,
wenzelm@33842
   347
rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
wenzelm@33842
   348
break, since the O_assoc rule was not rewritten like this.  Fix using
wenzelm@33842
   349
O_assoc[symmetric].  The same applies to the curried version "R OO S".
wenzelm@32427
   350
nipkow@33057
   351
* Function "Inv" is renamed to "inv_into" and function "inv" is now an
wenzelm@33842
   352
abbreviation for "inv_into UNIV".  Lemmas are renamed accordingly.
nipkow@32988
   353
INCOMPATIBILITY.
nipkow@32988
   354
haftmann@33860
   355
* Most rules produced by inductive and datatype package have mandatory
haftmann@33860
   356
prefixes.  INCOMPATIBILITY.
nipkow@31790
   357
wenzelm@33842
   358
* Changed "DERIV_intros" to a dynamic fact, which can be augmented by
wenzelm@33842
   359
the attribute of the same name.  Each of the theorems in the list
wenzelm@33842
   360
DERIV_intros assumes composition with an additional function and
wenzelm@33842
   361
matches a variable to the derivative, which has to be solved by the
wenzelm@33842
   362
Simplifier.  Hence (auto intro!: DERIV_intros) computes the derivative
wenzelm@33873
   363
of most elementary terms.  Former Maclauren.DERIV_tac and
wenzelm@33873
   364
Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
wenzelm@33873
   365
INCOMPATIBILITY.
haftmann@33860
   366
haftmann@33860
   367
* Code generator attributes follow the usual underscore convention:
haftmann@33860
   368
    code_unfold     replaces    code unfold
haftmann@33860
   369
    code_post       replaces    code post
haftmann@33860
   370
    etc.
haftmann@33860
   371
  INCOMPATIBILITY.
wenzelm@31900
   372
krauss@33471
   373
* Renamed methods:
krauss@33471
   374
    sizechange -> size_change
krauss@33471
   375
    induct_scheme -> induction_schema
haftmann@33860
   376
  INCOMPATIBILITY.
nipkow@33673
   377
wenzelm@33843
   378
* Discontinued abbreviation "arbitrary" of constant "undefined".
wenzelm@33843
   379
INCOMPATIBILITY, use "undefined" directly.
wenzelm@33843
   380
haftmann@33860
   381
* Renamed theorems:
haftmann@33860
   382
    Suc_eq_add_numeral_1 -> Suc_eq_plus1
haftmann@33860
   383
    Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
haftmann@33860
   384
    Suc_plus1 -> Suc_eq_plus1
haftmann@33860
   385
    *anti_sym -> *antisym*
haftmann@33860
   386
    vector_less_eq_def -> vector_le_def
haftmann@33860
   387
  INCOMPATIBILITY.
haftmann@33860
   388
haftmann@33860
   389
* Added theorem List.map_map as [simp].  Removed List.map_compose.
haftmann@33860
   390
INCOMPATIBILITY.
haftmann@33860
   391
haftmann@33860
   392
* Removed predicate "M hassize n" (<--> card M = n & finite M).
haftmann@33860
   393
INCOMPATIBILITY.
haftmann@33860
   394
hoelzl@31812
   395
huffman@33825
   396
*** HOLCF ***
huffman@33825
   397
wenzelm@33842
   398
* Theory Representable defines a class "rep" of domains that are
wenzelm@33842
   399
representable (via an ep-pair) in the universal domain type "udom".
huffman@33825
   400
Instances are provided for all type constructors defined in HOLCF.
huffman@33825
   401
huffman@33825
   402
* The 'new_domain' command is a purely definitional version of the
huffman@33825
   403
domain package, for representable domains.  Syntax is identical to the
huffman@33825
   404
old domain package.  The 'new_domain' package also supports indirect
huffman@33825
   405
recursion using previously-defined type constructors.  See
wenzelm@33842
   406
src/HOLCF/ex/New_Domain.thy for examples.
wenzelm@33842
   407
wenzelm@33842
   408
* Method "fixrec_simp" unfolds one step of a fixrec-defined constant
huffman@33825
   409
on the left-hand side of an equation, and then performs
huffman@33825
   410
simplification.  Rewriting is done using rules declared with the
wenzelm@33842
   411
"fixrec_simp" attribute.  The "fixrec_simp" method is intended as a
wenzelm@33842
   412
replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
huffman@33825
   413
huffman@33825
   414
* The pattern-match compiler in 'fixrec' can now handle constructors
huffman@33825
   415
with HOL function types.  Pattern-match combinators for the Pair
huffman@33825
   416
constructor are pre-configured.
huffman@33825
   417
huffman@33825
   418
* The 'fixrec' package now produces better fixed-point induction rules
huffman@33825
   419
for mutually-recursive definitions:  Induction rules have conclusions
huffman@33825
   420
of the form "P foo bar" instead of "P <foo, bar>".
huffman@33825
   421
huffman@33825
   422
* The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
huffman@33825
   423
been renamed to "below".  The name "below" now replaces "less" in many
wenzelm@33842
   424
theorem names.  (Legacy theorem names using "less" are still supported
wenzelm@33842
   425
as well.)
huffman@33825
   426
huffman@33825
   427
* The 'fixrec' package now supports "bottom patterns".  Bottom
huffman@33825
   428
patterns can be used to generate strictness rules, or to make
huffman@33825
   429
functions more strict (much like the bang-patterns supported by the
wenzelm@33873
   430
Glasgow Haskell Compiler).  See src/HOLCF/ex/Fixrec_ex.thy for
wenzelm@33873
   431
examples.
huffman@33825
   432
huffman@33825
   433
wenzelm@31304
   434
*** ML ***
wenzelm@31304
   435
wenzelm@33843
   436
* Support for Poly/ML 5.3.0, with improved reporting of compiler
wenzelm@33843
   437
errors and run-time exceptions, including detailed source positions.
wenzelm@33843
   438
wenzelm@33843
   439
* Structure Name_Space (formerly NameSpace) now manages uniquely
wenzelm@33843
   440
identified entries, with some additional information such as source
wenzelm@33843
   441
position, logical grouping etc.
wenzelm@33843
   442
wenzelm@33524
   443
* Theory and context data is now introduced by the simplified and
wenzelm@33524
   444
modernized functors Theory_Data, Proof_Data, Generic_Data.  Data needs
wenzelm@33524
   445
to be pure, but the old TheoryDataFun for mutable data (with explicit
wenzelm@33524
   446
copy operation) is still available for some time.
wenzelm@33524
   447
wenzelm@32742
   448
* Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
wenzelm@32742
   449
provides a high-level programming interface to synchronized state
wenzelm@32742
   450
variables with atomic update.  This works via pure function
wenzelm@32742
   451
application within a critical section -- its runtime should be as
wenzelm@32742
   452
short as possible; beware of deadlocks if critical code is nested,
wenzelm@32742
   453
either directly or indirectly via other synchronized variables!
wenzelm@32742
   454
wenzelm@32742
   455
* Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
wenzelm@32742
   456
wraps raw ML references, explicitly indicating their non-thread-safe
wenzelm@32742
   457
behaviour.  The Isar toplevel keeps this structure open, to
wenzelm@32742
   458
accommodate Proof General as well as quick and dirty interactive
wenzelm@32742
   459
experiments with references.
wenzelm@32742
   460
wenzelm@32365
   461
* PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
wenzelm@32365
   462
parallel tactical reasoning.
wenzelm@32365
   463
wenzelm@32427
   464
* Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
wenzelm@32427
   465
are similar to SUBPROOF, but are slightly more flexible: only the
wenzelm@32427
   466
specified parts of the subgoal are imported into the context, and the
wenzelm@32427
   467
body tactic may introduce new subgoals and schematic variables.
wenzelm@32427
   468
wenzelm@32427
   469
* Old tactical METAHYPS, which does not observe the proof context, has
wenzelm@32427
   470
been renamed to Old_Goals.METAHYPS and awaits deletion.  Use SUBPROOF
wenzelm@32427
   471
or Subgoal.FOCUS etc.
wenzelm@32216
   472
wenzelm@31971
   473
* Renamed functor TableFun to Table, and GraphFun to Graph.  (Since
wenzelm@31971
   474
functors have their own ML name space there is no point to mark them
wenzelm@31971
   475
separately.)  Minor INCOMPATIBILITY.
wenzelm@31971
   476
wenzelm@31901
   477
* Renamed NamedThmsFun to Named_Thms.  INCOMPATIBILITY.
wenzelm@31901
   478
wenzelm@33842
   479
* Renamed several structures FooBar to Foo_Bar.  Occasional,
wenzelm@33842
   480
INCOMPATIBILITY.
wenzelm@33842
   481
wenzelm@33843
   482
* Operations of structure Skip_Proof no longer require quick_and_dirty
wenzelm@33843
   483
mode, which avoids critical setmp.
wenzelm@33843
   484
wenzelm@31306
   485
* Eliminated old Attrib.add_attributes, Method.add_methods and related
wenzelm@33842
   486
combinators for "args".  INCOMPATIBILITY, need to use simplified
wenzelm@31306
   487
Attrib/Method.setup introduced in Isabelle2009.
wenzelm@31304
   488
wenzelm@32151
   489
* Proper context for simpset_of, claset_of, clasimpset_of.  May fall
wenzelm@32151
   490
back on global_simpset_of, global_claset_of, global_clasimpset_of as
wenzelm@32151
   491
last resort.  INCOMPATIBILITY.
wenzelm@32151
   492
wenzelm@32092
   493
* Display.pretty_thm now requires a proper context (cf. former
wenzelm@32092
   494
ProofContext.pretty_thm).  May fall back on Display.pretty_thm_global
wenzelm@32092
   495
or even Display.pretty_thm_without_context as last resort.
wenzelm@32092
   496
INCOMPATIBILITY.
wenzelm@32092
   497
wenzelm@32433
   498
* Discontinued Display.pretty_ctyp/cterm etc.  INCOMPATIBILITY, use
wenzelm@32433
   499
Syntax.pretty_typ/term directly, preferably with proper context
wenzelm@32433
   500
instead of global theory.
wenzelm@32433
   501
wenzelm@31304
   502
wenzelm@31308
   503
*** System ***
wenzelm@31308
   504
wenzelm@33842
   505
* Further fine tuning of parallel proof checking, scales up to 8 cores
wenzelm@33842
   506
(max. speedup factor 5.0).  See also Goal.parallel_proofs in ML and
wenzelm@33842
   507
usedir option -q.
wenzelm@33842
   508
wenzelm@32326
   509
* Support for additional "Isabelle components" via etc/components, see
wenzelm@32326
   510
also the system manual.
wenzelm@32326
   511
wenzelm@32326
   512
* The isabelle makeall tool now operates on all components with
wenzelm@32326
   513
IsaMakefile, not just hardwired "logics".
wenzelm@32326
   514
wenzelm@33842
   515
* Removed "compress" option from isabelle-process and isabelle usedir;
wenzelm@33842
   516
this is always enabled.
kleing@33818
   517
wenzelm@31308
   518
* Discontinued support for Poly/ML 4.x versions.
wenzelm@31308
   519
wenzelm@33842
   520
* Isabelle tool "wwwfind" provides web interface for 'find_theorems'
wenzelm@33842
   521
on a given logic image.  This requires the lighttpd webserver and is
wenzelm@33842
   522
currently supported on Linux only.
wenzelm@32061
   523
wenzelm@31308
   524
wenzelm@31304
   525
wenzelm@30845
   526
New in Isabelle2009 (April 2009)
wenzelm@30845
   527
--------------------------------
haftmann@27104
   528
wenzelm@27599
   529
*** General ***
wenzelm@27599
   530
wenzelm@28504
   531
* Simplified main Isabelle executables, with less surprises on
wenzelm@28504
   532
case-insensitive file-systems (such as Mac OS).
wenzelm@28504
   533
wenzelm@28504
   534
  - The main Isabelle tool wrapper is now called "isabelle" instead of
wenzelm@28504
   535
    "isatool."
wenzelm@28504
   536
wenzelm@28504
   537
  - The former "isabelle" alias for "isabelle-process" has been
wenzelm@28504
   538
    removed (should rarely occur to regular users).
wenzelm@28504
   539
wenzelm@28915
   540
  - The former "isabelle-interface" and its alias "Isabelle" have been
wenzelm@28915
   541
    removed (interfaces are now regular Isabelle tools).
wenzelm@28504
   542
wenzelm@28504
   543
Within scripts and make files, the Isabelle environment variables
wenzelm@28504
   544
ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
wenzelm@28504
   545
respectively.  (The latter are still available as legacy feature.)
wenzelm@28504
   546
wenzelm@28915
   547
The old isabelle-interface wrapper could react in confusing ways if
wenzelm@28915
   548
the interface was uninstalled or changed otherwise.  Individual
wenzelm@28915
   549
interface tool configuration is now more explicit, see also the
wenzelm@28915
   550
Isabelle system manual.  In particular, Proof General is now available
wenzelm@28915
   551
via "isabelle emacs".
wenzelm@28504
   552
wenzelm@28504
   553
INCOMPATIBILITY, need to adapt derivative scripts.  Users may need to
wenzelm@28504
   554
purge installed copies of Isabelle executables and re-run "isabelle
wenzelm@28504
   555
install -p ...", or use symlinks.
wenzelm@28504
   556
wenzelm@28914
   557
* The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
wenzelm@30845
   558
old ~/isabelle, which was slightly non-standard and apt to cause
wenzelm@30845
   559
surprises on case-insensitive file-systems (such as Mac OS).
wenzelm@28914
   560
wenzelm@28914
   561
INCOMPATIBILITY, need to move existing ~/isabelle/etc,
wenzelm@28914
   562
~/isabelle/heaps, ~/isabelle/browser_info to the new place.  Special
wenzelm@28914
   563
care is required when using older releases of Isabelle.  Note that
wenzelm@28914
   564
ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
wenzelm@30845
   565
Isabelle distribution, in order to use the new ~/.isabelle uniformly.
wenzelm@28914
   566
wenzelm@29161
   567
* Proofs of fully specified statements are run in parallel on
wenzelm@30845
   568
multi-core systems.  A speedup factor of 2.5 to 3.2 can be expected on
wenzelm@30845
   569
a regular 4-core machine, if the initial heap space is made reasonably
wenzelm@30845
   570
large (cf. Poly/ML option -H).  (Requires Poly/ML 5.2.1 or later.)
wenzelm@30845
   571
wenzelm@30845
   572
* The main reference manuals ("isar-ref", "implementation", and
wenzelm@30845
   573
"system") have been updated and extended.  Formally checked references
wenzelm@30845
   574
as hyperlinks are now available uniformly.
wenzelm@30845
   575
wenzelm@30163
   576
wenzelm@27599
   577
*** Pure ***
wenzelm@27599
   578
wenzelm@30845
   579
* Complete re-implementation of locales.  INCOMPATIBILITY in several
wenzelm@30845
   580
respects.  The most important changes are listed below.  See the
wenzelm@30845
   581
Tutorial on Locales ("locales" manual) for details.
ballarin@29253
   582
ballarin@29253
   583
- In locale expressions, instantiation replaces renaming.  Parameters
ballarin@29253
   584
must be declared in a for clause.  To aid compatibility with previous
ballarin@29253
   585
parameter inheritance, in locale declarations, parameters that are not
ballarin@29253
   586
'touched' (instantiation position "_" or omitted) are implicitly added
ballarin@29253
   587
with their syntax at the beginning of the for clause.
ballarin@29253
   588
ballarin@29253
   589
- Syntax from abbreviations and definitions in locales is available in
ballarin@29253
   590
locale expressions and context elements.  The latter is particularly
ballarin@29253
   591
useful in locale declarations.
ballarin@29253
   592
ballarin@29253
   593
- More flexible mechanisms to qualify names generated by locale
ballarin@29253
   594
expressions.  Qualifiers (prefixes) may be specified in locale
wenzelm@30728
   595
expressions, and can be marked as mandatory (syntax: "name!:") or
wenzelm@30728
   596
optional (syntax "name?:").  The default depends for plain "name:"
wenzelm@30728
   597
depends on the situation where a locale expression is used: in
wenzelm@30728
   598
commands 'locale' and 'sublocale' prefixes are optional, in
wenzelm@30845
   599
'interpretation' and 'interpret' prefixes are mandatory.  The old
wenzelm@30728
   600
implicit qualifiers derived from the parameter names of a locale are
wenzelm@30728
   601
no longer generated.
wenzelm@30106
   602
wenzelm@30845
   603
- Command "sublocale l < e" replaces "interpretation l < e".  The
wenzelm@30106
   604
instantiation clause in "interpretation" and "interpret" (square
wenzelm@30106
   605
brackets) is no longer available.  Use locale expressions.
ballarin@29253
   606
wenzelm@30845
   607
- When converting proof scripts, mandatory qualifiers in
wenzelm@30728
   608
'interpretation' and 'interpret' should be retained by default, even
wenzelm@30845
   609
if this is an INCOMPATIBILITY compared to former behavior.  In the
wenzelm@30845
   610
worst case, use the "name?:" form for non-mandatory ones.  Qualifiers
wenzelm@30845
   611
in locale expressions range over a single locale instance only.
wenzelm@30845
   612
wenzelm@30845
   613
- Dropped locale element "includes".  This is a major INCOMPATIBILITY.
wenzelm@30845
   614
In existing theorem specifications replace the includes element by the
wenzelm@30845
   615
respective context elements of the included locale, omitting those
wenzelm@30845
   616
that are already present in the theorem specification.  Multiple
wenzelm@30845
   617
assume elements of a locale should be replaced by a single one
wenzelm@30845
   618
involving the locale predicate.  In the proof body, declarations (most
wenzelm@30845
   619
notably theorems) may be regained by interpreting the respective
wenzelm@30845
   620
locales in the proof context as required (command "interpret").
wenzelm@30845
   621
wenzelm@30845
   622
If using "includes" in replacement of a target solely because the
wenzelm@30845
   623
parameter types in the theorem are not as general as in the target,
wenzelm@30845
   624
consider declaring a new locale with additional type constraints on
wenzelm@30845
   625
the parameters (context element "constrains").
wenzelm@30845
   626
wenzelm@30845
   627
- Discontinued "locale (open)".  INCOMPATIBILITY.
wenzelm@30845
   628
wenzelm@30845
   629
- Locale interpretation commands no longer attempt to simplify goal.
wenzelm@30845
   630
INCOMPATIBILITY: in rare situations the generated goal differs.  Use
wenzelm@30845
   631
methods intro_locales and unfold_locales to clarify.
wenzelm@30845
   632
wenzelm@30845
   633
- Locale interpretation commands no longer accept interpretation
wenzelm@30845
   634
attributes.  INCOMPATIBILITY.
wenzelm@30845
   635
wenzelm@30845
   636
* Class declaration: so-called "base sort" must not be given in import
wenzelm@30845
   637
list any longer, but is inferred from the specification.  Particularly
wenzelm@30845
   638
in HOL, write
wenzelm@30845
   639
wenzelm@30845
   640
    class foo = ...
wenzelm@30845
   641
wenzelm@30845
   642
instead of
wenzelm@30845
   643
wenzelm@30845
   644
    class foo = type + ...
wenzelm@30845
   645
wenzelm@30845
   646
* Class target: global versions of theorems stemming do not carry a
wenzelm@30845
   647
parameter prefix any longer.  INCOMPATIBILITY.
wenzelm@30845
   648
wenzelm@30845
   649
* Class 'instance' command no longer accepts attached definitions.
wenzelm@30845
   650
INCOMPATIBILITY, use proper 'instantiation' target instead.
wenzelm@30845
   651
wenzelm@30845
   652
* Recovered hiding of consts, which was accidentally broken in
wenzelm@30845
   653
Isabelle2007.  Potential INCOMPATIBILITY, ``hide const c'' really
wenzelm@30845
   654
makes c inaccessible; consider using ``hide (open) const c'' instead.
wenzelm@30845
   655
wenzelm@30845
   656
* Slightly more coherent Pure syntax, with updated documentation in
wenzelm@30845
   657
isar-ref manual.  Removed locales meta_term_syntax and
wenzelm@30845
   658
meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
wenzelm@30845
   659
INCOMPATIBILITY in rare situations.  Note that &&& should not be used
wenzelm@30845
   660
directly in regular applications.
wenzelm@30845
   661
wenzelm@30845
   662
* There is a new syntactic category "float_const" for signed decimal
wenzelm@30845
   663
fractions (e.g. 123.45 or -123.45).
wenzelm@30845
   664
wenzelm@30845
   665
* Removed exotic 'token_translation' command.  INCOMPATIBILITY, use ML
wenzelm@30845
   666
interface with 'setup' command instead.
wenzelm@30845
   667
wenzelm@30845
   668
* Command 'local_setup' is similar to 'setup', but operates on a local
wenzelm@30845
   669
theory context.
haftmann@27104
   670
wenzelm@28114
   671
* The 'axiomatization' command now only works within a global theory
wenzelm@28114
   672
context.  INCOMPATIBILITY.
wenzelm@28114
   673
wenzelm@30845
   674
* Goal-directed proof now enforces strict proof irrelevance wrt. sort
wenzelm@30845
   675
hypotheses.  Sorts required in the course of reasoning need to be
wenzelm@30845
   676
covered by the constraints in the initial statement, completed by the
wenzelm@30845
   677
type instance information of the background theory.  Non-trivial sort
wenzelm@30845
   678
hypotheses, which rarely occur in practice, may be specified via
wenzelm@30845
   679
vacuous propositions of the form SORT_CONSTRAINT('a::c).  For example:
wenzelm@30845
   680
wenzelm@30845
   681
  lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
wenzelm@30845
   682
wenzelm@30845
   683
The result contains an implicit sort hypotheses as before --
wenzelm@30845
   684
SORT_CONSTRAINT premises are eliminated as part of the canonical rule
wenzelm@30845
   685
normalization.
wenzelm@30845
   686
wenzelm@30845
   687
* Generalized Isar history, with support for linear undo, direct state
wenzelm@30845
   688
addressing etc.
wenzelm@30845
   689
wenzelm@30845
   690
* Changed defaults for unify configuration options:
wenzelm@30845
   691
wenzelm@30845
   692
  unify_trace_bound = 50 (formerly 25)
wenzelm@30845
   693
  unify_search_bound = 60 (formerly 30)
wenzelm@30845
   694
wenzelm@30845
   695
* Different bookkeeping for code equations (INCOMPATIBILITY):
wenzelm@30845
   696
wenzelm@30845
   697
  a) On theory merge, the last set of code equations for a particular
wenzelm@30845
   698
     constant is taken (in accordance with the policy applied by other
wenzelm@30845
   699
     parts of the code generator framework).
wenzelm@30845
   700
wenzelm@30845
   701
  b) Code equations stemming from explicit declarations (e.g. code
wenzelm@30845
   702
     attribute) gain priority over default code equations stemming
wenzelm@30845
   703
     from definition, primrec, fun etc.
wenzelm@30845
   704
wenzelm@30845
   705
* Keyword 'code_exception' now named 'code_abort'.  INCOMPATIBILITY.
wenzelm@30845
   706
haftmann@30965
   707
* Unified theorem tables for both code generators.  Thus [code
wenzelm@30845
   708
func] has disappeared and only [code] remains.  INCOMPATIBILITY.
wenzelm@30577
   709
wenzelm@30577
   710
* Command 'find_consts' searches for constants based on type and name
wenzelm@30577
   711
patterns, e.g.
kleing@29883
   712
kleing@29883
   713
    find_consts "_ => bool"
kleing@29883
   714
wenzelm@30106
   715
By default, matching is against subtypes, but it may be restricted to
wenzelm@30728
   716
the whole type.  Searching by name is possible.  Multiple queries are
wenzelm@30106
   717
conjunctive and queries may be negated by prefixing them with a
wenzelm@30106
   718
hyphen:
kleing@29883
   719
kleing@29883
   720
    find_consts strict: "_ => bool" name: "Int" -"int => int"
kleing@29861
   721
wenzelm@30845
   722
* New 'find_theorems' criterion "solves" matches theorems that
wenzelm@30845
   723
directly solve the current goal (modulo higher-order unification).
wenzelm@30845
   724
wenzelm@30845
   725
* Auto solve feature for main theorem statements: whenever a new goal
wenzelm@30845
   726
is stated, "find_theorems solves" is called; any theorems that could
wenzelm@30845
   727
solve the lemma directly are listed as part of the goal state.
wenzelm@30845
   728
Cf. associated options in Proof General Isabelle settings menu,
wenzelm@30845
   729
enabled by default, with reasonable timeout for pathological cases of
wenzelm@30845
   730
higher-order unification.
webertj@30415
   731
haftmann@27104
   732
wenzelm@27381
   733
*** Document preparation ***
wenzelm@27381
   734
wenzelm@27381
   735
* Antiquotation @{lemma} now imitates a regular terminal proof,
wenzelm@27392
   736
demanding keyword 'by' and supporting the full method expression
wenzelm@27519
   737
syntax just like the Isar command 'by'.
wenzelm@27381
   738
wenzelm@27381
   739
haftmann@27104
   740
*** HOL ***
haftmann@27104
   741
wenzelm@30845
   742
* Integrated main parts of former image HOL-Complex with HOL.  Entry
wenzelm@30845
   743
points Main and Complex_Main remain as before.
wenzelm@30845
   744
wenzelm@30845
   745
* Logic image HOL-Plain provides a minimal HOL with the most important
wenzelm@30845
   746
tools available (inductive, datatype, primrec, ...).  This facilitates
wenzelm@30845
   747
experimentation and tool development.  Note that user applications
wenzelm@30845
   748
(and library theories) should never refer to anything below theory
wenzelm@30845
   749
Main, as before.
wenzelm@30845
   750
wenzelm@30845
   751
* Logic image HOL-Main stops at theory Main, and thus facilitates
wenzelm@30845
   752
experimentation due to shorter build times.
wenzelm@30845
   753
wenzelm@30845
   754
* Logic image HOL-NSA contains theories of nonstandard analysis which
wenzelm@30845
   755
were previously part of former HOL-Complex.  Entry point Hyperreal
wenzelm@30845
   756
remains valid, but theories formerly using Complex_Main should now use
wenzelm@30845
   757
new entry point Hypercomplex.
wenzelm@30845
   758
wenzelm@30845
   759
* Generic ATP manager for Sledgehammer, based on ML threads instead of
wenzelm@30845
   760
Posix processes.  Avoids potentially expensive forking of the ML
wenzelm@30845
   761
process.  New thread-based implementation also works on non-Unix
wenzelm@30845
   762
platforms (Cygwin).  Provers are no longer hardwired, but defined
wenzelm@30845
   763
within the theory via plain ML wrapper functions.  Basic Sledgehammer
wenzelm@30845
   764
commands are covered in the isar-ref manual.
wenzelm@30845
   765
wenzelm@30845
   766
* Wrapper scripts for remote SystemOnTPTP service allows to use
wenzelm@30845
   767
sledgehammer without local ATP installation (Vampire etc.). Other
wenzelm@30845
   768
provers may be included via suitable ML wrappers, see also
wenzelm@30845
   769
src/HOL/ATP_Linkup.thy.
wenzelm@30845
   770
wenzelm@30845
   771
* ATP selection (E/Vampire/Spass) is now via Proof General's settings
wenzelm@30845
   772
menu.
wenzelm@30845
   773
wenzelm@30845
   774
* The metis method no longer fails because the theorem is too trivial
wenzelm@30845
   775
(contains the empty clause).
wenzelm@30845
   776
wenzelm@30845
   777
* The metis method now fails in the usual manner, rather than raising
wenzelm@30845
   778
an exception, if it determines that it cannot prove the theorem.
wenzelm@30845
   779
wenzelm@30845
   780
* Method "coherent" implements a prover for coherent logic (see also
wenzelm@30845
   781
src/Tools/coherent.ML).
wenzelm@30845
   782
wenzelm@30845
   783
* Constants "undefined" and "default" replace "arbitrary".  Usually
wenzelm@30845
   784
"undefined" is the right choice to replace "arbitrary", though
wenzelm@30845
   785
logically there is no difference.  INCOMPATIBILITY.
wenzelm@30845
   786
wenzelm@30845
   787
* Command "value" now integrates different evaluation mechanisms.  The
wenzelm@30845
   788
result of the first successful evaluation mechanism is printed.  In
wenzelm@30845
   789
square brackets a particular named evaluation mechanisms may be
wenzelm@30845
   790
specified (currently, [SML], [code] or [nbe]).  See further
wenzelm@30845
   791
src/HOL/ex/Eval_Examples.thy.
wenzelm@30845
   792
wenzelm@30845
   793
* Normalization by evaluation now allows non-leftlinear equations.
wenzelm@30845
   794
Declare with attribute [code nbe].
wenzelm@30845
   795
wenzelm@30845
   796
* Methods "case_tac" and "induct_tac" now refer to the very same rules
wenzelm@30845
   797
as the structured Isar versions "cases" and "induct", cf. the
wenzelm@30845
   798
corresponding "cases" and "induct" attributes.  Mutual induction rules
wenzelm@30845
   799
are now presented as a list of individual projections
wenzelm@30845
   800
(e.g. foo_bar.inducts for types foo and bar); the old format with
wenzelm@30845
   801
explicit HOL conjunction is no longer supported.  INCOMPATIBILITY, in
wenzelm@30845
   802
rare situations a different rule is selected --- notably nested tuple
wenzelm@30845
   803
elimination instead of former prod.exhaust: use explicit (case_tac t
wenzelm@30845
   804
rule: prod.exhaust) here.
wenzelm@30845
   805
wenzelm@30845
   806
* Attributes "cases", "induct", "coinduct" support "del" option.
wenzelm@30845
   807
wenzelm@30845
   808
* Removed fact "case_split_thm", which duplicates "case_split".
wenzelm@30845
   809
wenzelm@30845
   810
* The option datatype has been moved to a new theory Option.  Renamed
wenzelm@30845
   811
option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
wenzelm@30845
   812
wenzelm@30845
   813
* New predicate "strict_mono" classifies strict functions on partial
wenzelm@30845
   814
orders.  With strict functions on linear orders, reasoning about
wenzelm@30845
   815
(in)equalities is facilitated by theorems "strict_mono_eq",
wenzelm@30845
   816
"strict_mono_less_eq" and "strict_mono_less".
wenzelm@30845
   817
wenzelm@30845
   818
* Some set operations are now proper qualified constants with
wenzelm@30845
   819
authentic syntax.  INCOMPATIBILITY:
haftmann@30304
   820
haftmann@30304
   821
    op Int ~>   Set.Int
haftmann@30304
   822
    op Un ~>    Set.Un
haftmann@30304
   823
    INTER ~>    Set.INTER
haftmann@30304
   824
    UNION ~>    Set.UNION
haftmann@30304
   825
    Inter ~>    Set.Inter
haftmann@30304
   826
    Union ~>    Set.Union
haftmann@30304
   827
    {} ~>       Set.empty
haftmann@30304
   828
    UNIV ~>     Set.UNIV
haftmann@30304
   829
wenzelm@30845
   830
* Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
wenzelm@30845
   831
theory Set.
wenzelm@30845
   832
wenzelm@30845
   833
* Auxiliary class "itself" has disappeared -- classes without any
wenzelm@30845
   834
parameter are treated as expected by the 'class' command.
haftmann@29797
   835
haftmann@29823
   836
* Leibnitz's Series for Pi and the arcus tangens and logarithm series.
haftmann@29823
   837
wenzelm@30845
   838
* Common decision procedures (Cooper, MIR, Ferrack, Approximation,
wenzelm@30845
   839
Dense_Linear_Order) are now in directory HOL/Decision_Procs.
wenzelm@30845
   840
wenzelm@30845
   841
* Theory src/HOL/Decision_Procs/Approximation provides the new proof
wenzelm@30845
   842
method "approximation".  It proves formulas on real values by using
wenzelm@30845
   843
interval arithmetic.  In the formulas are also the transcendental
wenzelm@30845
   844
functions sin, cos, tan, atan, ln, exp and the constant pi are
wenzelm@30845
   845
allowed. For examples see
wenzelm@30845
   846
src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
haftmann@29823
   847
haftmann@29823
   848
* Theory "Reflection" now resides in HOL/Library.
haftmann@29650
   849
wenzelm@30845
   850
* Entry point to Word library now simply named "Word".
wenzelm@30845
   851
INCOMPATIBILITY.
haftmann@29628
   852
haftmann@29197
   853
* Made source layout more coherent with logical distribution
haftmann@29197
   854
structure:
haftmann@28952
   855
haftmann@28952
   856
    src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
haftmann@28952
   857
    src/HOL/Library/Code_Message.thy ~> src/HOL/
haftmann@28952
   858
    src/HOL/Library/GCD.thy ~> src/HOL/
haftmann@28952
   859
    src/HOL/Library/Order_Relation.thy ~> src/HOL/
haftmann@28952
   860
    src/HOL/Library/Parity.thy ~> src/HOL/
haftmann@28952
   861
    src/HOL/Library/Univ_Poly.thy ~> src/HOL/
huffman@30176
   862
    src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
haftmann@28952
   863
    src/HOL/Real/Lubs.thy ~> src/HOL/
haftmann@28952
   864
    src/HOL/Real/PReal.thy ~> src/HOL/
haftmann@28952
   865
    src/HOL/Real/Rational.thy ~> src/HOL/
haftmann@28952
   866
    src/HOL/Real/RComplete.thy ~> src/HOL/
haftmann@28952
   867
    src/HOL/Real/RealDef.thy ~> src/HOL/
haftmann@28952
   868
    src/HOL/Real/RealPow.thy ~> src/HOL/
haftmann@28952
   869
    src/HOL/Real/Real.thy ~> src/HOL/
haftmann@28952
   870
    src/HOL/Complex/Complex_Main.thy ~> src/HOL/
haftmann@28952
   871
    src/HOL/Complex/Complex.thy ~> src/HOL/
huffman@30176
   872
    src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
huffman@30176
   873
    src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
haftmann@28952
   874
    src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
haftmann@28952
   875
    src/HOL/Hyperreal/Fact.thy ~> src/HOL/
haftmann@28952
   876
    src/HOL/Hyperreal/Integration.thy ~> src/HOL/
haftmann@28952
   877
    src/HOL/Hyperreal/Lim.thy ~> src/HOL/
haftmann@28952
   878
    src/HOL/Hyperreal/Ln.thy ~> src/HOL/
haftmann@28952
   879
    src/HOL/Hyperreal/Log.thy ~> src/HOL/
haftmann@28952
   880
    src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
haftmann@28952
   881
    src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
haftmann@28952
   882
    src/HOL/Hyperreal/Series.thy ~> src/HOL/
haftmann@29197
   883
    src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
haftmann@28952
   884
    src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
haftmann@28952
   885
    src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
haftmann@28952
   886
    src/HOL/Real/Float ~> src/HOL/Library/
haftmann@29197
   887
    src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
haftmann@29197
   888
    src/HOL/Real/RealVector.thy ~> src/HOL/
haftmann@28952
   889
haftmann@28952
   890
    src/HOL/arith_data.ML ~> src/HOL/Tools
haftmann@28952
   891
    src/HOL/hologic.ML ~> src/HOL/Tools
haftmann@28952
   892
    src/HOL/simpdata.ML ~> src/HOL/Tools
haftmann@28952
   893
    src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
haftmann@28952
   894
    src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
haftmann@28952
   895
    src/HOL/nat_simprocs.ML ~> src/HOL/Tools
haftmann@28952
   896
    src/HOL/Real/float_arith.ML ~> src/HOL/Tools
haftmann@28952
   897
    src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
haftmann@28952
   898
    src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
haftmann@28952
   899
    src/HOL/Real/real_arith.ML ~> src/HOL/Tools
haftmann@28952
   900
haftmann@29398
   901
    src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
haftmann@29398
   902
    src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
haftmann@29398
   903
    src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
haftmann@29398
   904
    src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
haftmann@29398
   905
    src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
haftmann@29398
   906
    src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
haftmann@29398
   907
wenzelm@30845
   908
* If methods "eval" and "evaluation" encounter a structured proof
wenzelm@30845
   909
state with !!/==>, only the conclusion is evaluated to True (if
wenzelm@30845
   910
possible), avoiding strange error messages.
wenzelm@30845
   911
wenzelm@30845
   912
* Method "sizechange" automates termination proofs using (a
wenzelm@30845
   913
modification of) the size-change principle.  Requires SAT solver.  See
wenzelm@30845
   914
src/HOL/ex/Termination.thy for examples.
wenzelm@30845
   915
wenzelm@30845
   916
* Simplifier: simproc for let expressions now unfolds if bound
wenzelm@30845
   917
variable occurs at most once in let expression body.  INCOMPATIBILITY.
wenzelm@30845
   918
wenzelm@30845
   919
* Method "arith": Linear arithmetic now ignores all inequalities when
wenzelm@30845
   920
fast_arith_neq_limit is exceeded, instead of giving up entirely.
wenzelm@30845
   921
wenzelm@30845
   922
* New attribute "arith" for facts that should always be used
wenzelm@30845
   923
automatically by arithmetic. It is intended to be used locally in
wenzelm@30845
   924
proofs, e.g.
wenzelm@30845
   925
wenzelm@30845
   926
  assumes [arith]: "x > 0"
wenzelm@30845
   927
nipkow@30706
   928
Global usage is discouraged because of possible performance impact.
nipkow@30706
   929
wenzelm@30845
   930
* New classes "top" and "bot" with corresponding operations "top" and
wenzelm@30845
   931
"bot" in theory Orderings; instantiation of class "complete_lattice"
wenzelm@30845
   932
requires instantiation of classes "top" and "bot".  INCOMPATIBILITY.
wenzelm@30845
   933
wenzelm@30845
   934
* Changed definition lemma "less_fun_def" in order to provide an
wenzelm@30845
   935
instance for preorders on functions; use lemma "less_le" instead.
wenzelm@30845
   936
INCOMPATIBILITY.
wenzelm@30845
   937
wenzelm@30845
   938
* Theory Orderings: class "wellorder" moved here, with explicit
wenzelm@30845
   939
induction rule "less_induct" as assumption.  For instantiation of
wenzelm@30845
   940
"wellorder" by means of predicate "wf", use rule wf_wellorderI.
wenzelm@30845
   941
INCOMPATIBILITY.
wenzelm@30845
   942
wenzelm@30845
   943
* Theory Orderings: added class "preorder" as superclass of "order".
wenzelm@27793
   944
INCOMPATIBILITY: Instantiation proofs for order, linorder
wenzelm@27793
   945
etc. slightly changed.  Some theorems named order_class.* now named
wenzelm@27793
   946
preorder_class.*.
wenzelm@27793
   947
wenzelm@30845
   948
* Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
wenzelm@30845
   949
"diag" to "Id_on".
wenzelm@30845
   950
wenzelm@30845
   951
* Theory Finite_Set: added a new fold combinator of type
wenzelm@30845
   952
nipkow@28855
   953
  ('a => 'b => 'b) => 'b => 'a set => 'b
wenzelm@30845
   954
wenzelm@30845
   955
Occasionally this is more convenient than the old fold combinator
wenzelm@30845
   956
which is now defined in terms of the new one and renamed to
wenzelm@30845
   957
fold_image.
wenzelm@30845
   958
wenzelm@30845
   959
* Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
wenzelm@30845
   960
and "ring_simps" have been replaced by "algebra_simps" (which can be
wenzelm@30845
   961
extended with further lemmas!).  At the moment both still exist but
wenzelm@30845
   962
the former will disappear at some point.
wenzelm@30845
   963
wenzelm@30845
   964
* Theory Power: Lemma power_Suc is now declared as a simp rule in
wenzelm@30845
   965
class recpower.  Type-specific simp rules for various recpower types
wenzelm@30845
   966
have been removed.  INCOMPATIBILITY, rename old lemmas as follows:
huffman@30273
   967
huffman@30273
   968
rat_power_0    -> power_0
huffman@30273
   969
rat_power_Suc  -> power_Suc
huffman@30273
   970
realpow_0      -> power_0
huffman@30273
   971
realpow_Suc    -> power_Suc
huffman@30273
   972
complexpow_0   -> power_0
huffman@30273
   973
complexpow_Suc -> power_Suc
huffman@30273
   974
power_poly_0   -> power_0
huffman@30273
   975
power_poly_Suc -> power_Suc
huffman@30273
   976
wenzelm@30845
   977
* Theories Ring_and_Field and Divides: Definition of "op dvd" has been
wenzelm@27793
   978
moved to separate class dvd in Ring_and_Field; a couple of lemmas on
wenzelm@27793
   979
dvd has been generalized to class comm_semiring_1.  Likewise a bunch
wenzelm@27793
   980
of lemmas from Divides has been generalized from nat to class
wenzelm@27793
   981
semiring_div.  INCOMPATIBILITY.  This involves the following theorem
wenzelm@27793
   982
renames resulting from duplicate elimination:
haftmann@27651
   983
haftmann@27651
   984
    dvd_def_mod ~>          dvd_eq_mod_eq_0
haftmann@27651
   985
    zero_dvd_iff ~>         dvd_0_left_iff
haftmann@28559
   986
    dvd_0 ~>                dvd_0_right
haftmann@27651
   987
    DIVISION_BY_ZERO_DIV ~> div_by_0
haftmann@27651
   988
    DIVISION_BY_ZERO_MOD ~> mod_by_0
haftmann@27651
   989
    mult_div ~>             div_mult_self2_is_id
haftmann@27651
   990
    mult_mod ~>             mod_mult_self2_is_0
haftmann@27651
   991
wenzelm@30845
   992
* Theory IntDiv: removed many lemmas that are instances of class-based
wenzelm@30845
   993
generalizations (from Divides and Ring_and_Field).  INCOMPATIBILITY,
wenzelm@30845
   994
rename old lemmas as follows:
nipkow@30044
   995
nipkow@30044
   996
dvd_diff               -> nat_dvd_diff
nipkow@30044
   997
dvd_zminus_iff         -> dvd_minus_iff
nipkow@30224
   998
mod_add1_eq            -> mod_add_eq
nipkow@30224
   999
mod_mult1_eq           -> mod_mult_right_eq
nipkow@30224
  1000
mod_mult1_eq'          -> mod_mult_left_eq
nipkow@30224
  1001
mod_mult_distrib_mod   -> mod_mult_eq
nipkow@30044
  1002
nat_mod_add_left_eq    -> mod_add_left_eq
nipkow@30044
  1003
nat_mod_add_right_eq   -> mod_add_right_eq
nipkow@30044
  1004
nat_mod_div_trivial    -> mod_div_trivial
nipkow@30044
  1005
nat_mod_mod_trivial    -> mod_mod_trivial
nipkow@30044
  1006
zdiv_zadd_self1        -> div_add_self1
nipkow@30044
  1007
zdiv_zadd_self2        -> div_add_self2
nipkow@30181
  1008
zdiv_zmult_self1       -> div_mult_self2_is_id
nipkow@30044
  1009
zdiv_zmult_self2       -> div_mult_self1_is_id
nipkow@30044
  1010
zdvd_triv_left         -> dvd_triv_left
nipkow@30044
  1011
zdvd_triv_right        -> dvd_triv_right
nipkow@30044
  1012
zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
nipkow@30085
  1013
zmod_eq0_zdvd_iff      -> dvd_eq_mod_eq_0[symmetric]
nipkow@30044
  1014
zmod_zadd_left_eq      -> mod_add_left_eq
nipkow@30044
  1015
zmod_zadd_right_eq     -> mod_add_right_eq
nipkow@30044
  1016
zmod_zadd_self1        -> mod_add_self1
nipkow@30044
  1017
zmod_zadd_self2        -> mod_add_self2
nipkow@30224
  1018
zmod_zadd1_eq          -> mod_add_eq
nipkow@30044
  1019
zmod_zdiff1_eq         -> mod_diff_eq
nipkow@30044
  1020
zmod_zdvd_zmod         -> mod_mod_cancel
nipkow@30044
  1021
zmod_zmod_cancel       -> mod_mod_cancel
nipkow@30044
  1022
zmod_zmult_self1       -> mod_mult_self2_is_0
nipkow@30044
  1023
zmod_zmult_self2       -> mod_mult_self1_is_0
nipkow@30044
  1024
zmod_1                 -> mod_by_1
nipkow@30044
  1025
zdiv_1                 -> div_by_1
nipkow@30044
  1026
zdvd_abs1              -> abs_dvd_iff
nipkow@30044
  1027
zdvd_abs2              -> dvd_abs_iff
nipkow@30044
  1028
zdvd_refl              -> dvd_refl
nipkow@30044
  1029
zdvd_trans             -> dvd_trans
nipkow@30044
  1030
zdvd_zadd              -> dvd_add
nipkow@30044
  1031
zdvd_zdiff             -> dvd_diff
nipkow@30044
  1032
zdvd_zminus_iff        -> dvd_minus_iff
nipkow@30044
  1033
zdvd_zminus2_iff       -> minus_dvd_iff
nipkow@30044
  1034
zdvd_zmultD            -> dvd_mult_right
nipkow@30044
  1035
zdvd_zmultD2           -> dvd_mult_left
nipkow@30044
  1036
zdvd_zmult_mono        -> mult_dvd_mono
nipkow@30044
  1037
zdvd_0_right           -> dvd_0_right
nipkow@30044
  1038
zdvd_0_left            -> dvd_0_left_iff
nipkow@30044
  1039
zdvd_1_left            -> one_dvd
nipkow@30044
  1040
zminus_dvd_iff         -> minus_dvd_iff
nipkow@30044
  1041
wenzelm@30845
  1042
* Theory Rational: 'Fract k 0' now equals '0'.  INCOMPATIBILITY.
wenzelm@30845
  1043
wenzelm@30845
  1044
* The real numbers offer decimal input syntax: 12.34 is translated
wenzelm@30845
  1045
into 1234/10^2. This translation is not reversed upon output.
wenzelm@30845
  1046
wenzelm@30845
  1047
* Theory Library/Polynomial defines an abstract type 'a poly of
wenzelm@30845
  1048
univariate polynomials with coefficients of type 'a.  In addition to
wenzelm@30845
  1049
the standard ring operations, it also supports div and mod.  Code
wenzelm@30845
  1050
generation is also supported, using list-style constructors.
wenzelm@30845
  1051
wenzelm@30845
  1052
* Theory Library/Inner_Product defines a class of real_inner for real
wenzelm@30845
  1053
inner product spaces, with an overloaded operation inner :: 'a => 'a
wenzelm@30845
  1054
=> real.  Class real_inner is a subclass of real_normed_vector from
wenzelm@30845
  1055
theory RealVector.
wenzelm@30845
  1056
wenzelm@30845
  1057
* Theory Library/Product_Vector provides instances for the product
wenzelm@30845
  1058
type 'a * 'b of several classes from RealVector and Inner_Product.
wenzelm@30845
  1059
Definitions of addition, subtraction, scalar multiplication, norms,
wenzelm@30845
  1060
and inner products are included.
wenzelm@30845
  1061
wenzelm@30845
  1062
* Theory Library/Bit defines the field "bit" of integers modulo 2.  In
wenzelm@30845
  1063
addition to the field operations, numerals and case syntax are also
wenzelm@30845
  1064
supported.
wenzelm@30845
  1065
wenzelm@30845
  1066
* Theory Library/Diagonalize provides constructive version of Cantor's
wenzelm@30845
  1067
first diagonalization argument.
wenzelm@30845
  1068
wenzelm@30845
  1069
* Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
wenzelm@27599
  1070
zlcm (for int); carried together from various gcd/lcm developements in
wenzelm@30845
  1071
the HOL Distribution.  Constants zgcd and zlcm replace former igcd and
wenzelm@30845
  1072
ilcm; corresponding theorems renamed accordingly.  INCOMPATIBILITY,
wenzelm@30845
  1073
may recover tupled syntax as follows:
haftmann@27556
  1074
haftmann@27556
  1075
    hide (open) const gcd
haftmann@27556
  1076
    abbreviation gcd where
haftmann@27556
  1077
      "gcd == (%(a, b). GCD.gcd a b)"
haftmann@27556
  1078
    notation (output)
haftmann@27556
  1079
      GCD.gcd ("gcd '(_, _')")
haftmann@27556
  1080
wenzelm@30845
  1081
The same works for lcm, zgcd, zlcm.
wenzelm@30845
  1082
wenzelm@30845
  1083
* Theory Library/Nat_Infinity: added addition, numeral syntax and more
wenzelm@30845
  1084
instantiations for algebraic structures.  Removed some duplicate
wenzelm@30845
  1085
theorems.  Changes in simp rules.  INCOMPATIBILITY.
wenzelm@30845
  1086
wenzelm@30845
  1087
* ML antiquotation @{code} takes a constant as argument and generates
haftmann@27651
  1088
corresponding code in background and inserts name of the corresponding
haftmann@27651
  1089
resulting ML value/function/datatype constructor binding in place.
haftmann@27651
  1090
All occurrences of @{code} with a single ML block are generated
haftmann@27651
  1091
simultaneously.  Provides a generic and safe interface for
wenzelm@30845
  1092
instrumentalizing code generation.  See
wenzelm@30845
  1093
src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
wenzelm@30845
  1094
In future you ought to refrain from ad-hoc compiling generated SML
wenzelm@30845
  1095
code on the ML toplevel.  Note that (for technical reasons) @{code}
wenzelm@30845
  1096
cannot refer to constants for which user-defined serializations are
wenzelm@30845
  1097
set.  Refer to the corresponding ML counterpart directly in that
wenzelm@30845
  1098
cases.
wenzelm@27122
  1099
wenzelm@27122
  1100
* Command 'rep_datatype': instead of theorem names the command now
wenzelm@27122
  1101
takes a list of terms denoting the constructors of the type to be
wenzelm@27122
  1102
represented as datatype.  The characteristic theorems have to be
wenzelm@27122
  1103
proven.  INCOMPATIBILITY.  Also observe that the following theorems
wenzelm@27122
  1104
have disappeared in favour of existing ones:
wenzelm@27122
  1105
haftmann@27104
  1106
    unit_induct                 ~> unit.induct
haftmann@27104
  1107
    prod_induct                 ~> prod.induct
haftmann@27104
  1108
    sum_induct                  ~> sum.induct
haftmann@27104
  1109
    Suc_Suc_eq                  ~> nat.inject
haftmann@27104
  1110
    Suc_not_Zero Zero_not_Suc   ~> nat.distinct
haftmann@27104
  1111
haftmann@27104
  1112
ballarin@27696
  1113
*** HOL-Algebra ***
ballarin@27696
  1114
ballarin@27713
  1115
* New locales for orders and lattices where the equivalence relation
wenzelm@30106
  1116
is not restricted to equality.  INCOMPATIBILITY: all order and lattice
wenzelm@30106
  1117
locales use a record structure with field eq for the equivalence.
ballarin@27713
  1118
ballarin@27713
  1119
* New theory of factorial domains.
ballarin@27713
  1120
wenzelm@30845
  1121
* Units_l_inv and Units_r_inv are now simp rules by default.
ballarin@27696
  1122
INCOMPATIBILITY.  Simplifier proof that require deletion of l_inv
ballarin@27696
  1123
and/or r_inv will now also require deletion of these lemmas.
ballarin@27696
  1124
wenzelm@30845
  1125
* Renamed the following theorems, INCOMPATIBILITY:
wenzelm@30845
  1126
ballarin@27696
  1127
UpperD ~> Upper_memD
ballarin@27696
  1128
LowerD ~> Lower_memD
ballarin@27696
  1129
least_carrier ~> least_closed
ballarin@27696
  1130
greatest_carrier ~> greatest_closed
ballarin@27696
  1131
greatest_Lower_above ~> greatest_Lower_below
ballarin@27717
  1132
one_zero ~> carrier_one_zero
ballarin@27717
  1133
one_not_zero ~> carrier_one_not_zero  (collision with assumption)
ballarin@27696
  1134
wenzelm@27793
  1135
wenzelm@30849
  1136
*** HOL-Nominal ***
wenzelm@30849
  1137
wenzelm@30855
  1138
* Nominal datatypes can now contain type-variables.
wenzelm@30855
  1139
wenzelm@30855
  1140
* Commands 'nominal_inductive' and 'equivariance' work with local
wenzelm@30855
  1141
theory targets.
wenzelm@30855
  1142
wenzelm@30855
  1143
* Nominal primrec can now works with local theory targets and its
wenzelm@30855
  1144
specification syntax now conforms to the general format as seen in
wenzelm@30855
  1145
'inductive' etc.
wenzelm@30855
  1146
wenzelm@30855
  1147
* Method "perm_simp" honours the standard simplifier attributes
wenzelm@30855
  1148
(no_asm), (no_asm_use) etc.
wenzelm@30855
  1149
wenzelm@30855
  1150
* The new predicate #* is defined like freshness, except that on the
wenzelm@30855
  1151
left hand side can be a set or list of atoms.
wenzelm@30855
  1152
wenzelm@30855
  1153
* Experimental command 'nominal_inductive2' derives strong induction
wenzelm@30855
  1154
principles for inductive definitions.  In contrast to
wenzelm@30855
  1155
'nominal_inductive', which can only deal with a fixed number of
wenzelm@30855
  1156
binders, it can deal with arbitrary expressions standing for sets of
wenzelm@30855
  1157
atoms to be avoided.  The only inductive definition we have at the
wenzelm@30855
  1158
moment that needs this generalisation is the typing rule for Lets in
wenzelm@30855
  1159
the algorithm W:
wenzelm@30855
  1160
wenzelm@30855
  1161
 Gamma |- t1 : T1   (x,close Gamma T1)::Gamma |- t2 : T2   x#Gamma
wenzelm@30855
  1162
 -----------------------------------------------------------------
wenzelm@30855
  1163
         Gamma |- Let x be t1 in t2 : T2
wenzelm@30855
  1164
wenzelm@30855
  1165
In this rule one wants to avoid all the binders that are introduced by
wenzelm@30855
  1166
"close Gamma T1".  We are looking for other examples where this
wenzelm@30855
  1167
feature might be useful.  Please let us know.
wenzelm@30849
  1168
wenzelm@30849
  1169
huffman@30176
  1170
*** HOLCF ***
huffman@30176
  1171
huffman@30176
  1172
* Reimplemented the simplification procedure for proving continuity
huffman@30176
  1173
subgoals.  The new simproc is extensible; users can declare additional
huffman@30176
  1174
continuity introduction rules with the attribute [cont2cont].
huffman@30176
  1175
huffman@30176
  1176
* The continuity simproc now uses a different introduction rule for
huffman@30176
  1177
solving continuity subgoals on terms with lambda abstractions.  In
huffman@30176
  1178
some rare cases the new simproc may fail to solve subgoals that the
huffman@30176
  1179
old one could solve, and "simp add: cont2cont_LAM" may be necessary.
huffman@30176
  1180
Potential INCOMPATIBILITY.
huffman@30176
  1181
wenzelm@30847
  1182
* Command 'fixrec': specification syntax now conforms to the general
wenzelm@30855
  1183
format as seen in 'inductive' etc.  See src/HOLCF/ex/Fixrec_ex.thy for
wenzelm@30855
  1184
examples.  INCOMPATIBILITY.
wenzelm@30845
  1185
wenzelm@30845
  1186
wenzelm@30845
  1187
*** ZF ***
wenzelm@30845
  1188
wenzelm@30845
  1189
* Proof of Zorn's Lemma for partial orders.
huffman@30176
  1190
huffman@30176
  1191
wenzelm@27246
  1192
*** ML ***
wenzelm@28088
  1193
wenzelm@30845
  1194
* Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
wenzelm@30845
  1195
Poly/ML 5.2.1 or later.  Important note: the TimeLimit facility
wenzelm@30845
  1196
depends on multithreading, so timouts will not work before Poly/ML
wenzelm@30845
  1197
5.2.1!
wenzelm@30845
  1198
wenzelm@29161
  1199
* High-level support for concurrent ML programming, see
wenzelm@29161
  1200
src/Pure/Cuncurrent.  The data-oriented model of "future values" is
wenzelm@29161
  1201
particularly convenient to organize independent functional
wenzelm@29161
  1202
computations.  The concept of "synchronized variables" provides a
wenzelm@29161
  1203
higher-order interface for components with shared state, avoiding the
wenzelm@30845
  1204
delicate details of mutexes and condition variables.  (Requires
wenzelm@30845
  1205
Poly/ML 5.2.1 or later.)
wenzelm@30845
  1206
wenzelm@30845
  1207
* ML bindings produced via Isar commands are stored within the Isar
wenzelm@30845
  1208
context (theory or proof).  Consequently, commands like 'use' and 'ML'
wenzelm@30845
  1209
become thread-safe and work with undo as expected (concerning
wenzelm@30845
  1210
top-level bindings, not side-effects on global references).
wenzelm@30845
  1211
INCOMPATIBILITY, need to provide proper Isar context when invoking the
wenzelm@30845
  1212
compiler at runtime; really global bindings need to be given outside a
wenzelm@30845
  1213
theory.  (Requires Poly/ML 5.2 or later.)
wenzelm@30845
  1214
wenzelm@30845
  1215
* Command 'ML_prf' is analogous to 'ML' but works within a proof
wenzelm@30845
  1216
context.  Top-level ML bindings are stored within the proof context in
wenzelm@30845
  1217
a purely sequential fashion, disregarding the nested proof structure.
wenzelm@30845
  1218
ML bindings introduced by 'ML_prf' are discarded at the end of the
wenzelm@30845
  1219
proof.  (Requires Poly/ML 5.2 or later.)
wenzelm@29161
  1220
wenzelm@30530
  1221
* Simplified ML attribute and method setup, cf. functions Attrib.setup
wenzelm@30845
  1222
and Method.setup, as well as Isar commands 'attribute_setup' and
wenzelm@30547
  1223
'method_setup'.  INCOMPATIBILITY for 'method_setup', need to simplify
wenzelm@30547
  1224
existing code accordingly, or use plain 'setup' together with old
wenzelm@30547
  1225
Method.add_method.
wenzelm@30530
  1226
wenzelm@28294
  1227
* Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
wenzelm@28294
  1228
to 'a -> thm, while results are always tagged with an authentic oracle
wenzelm@28294
  1229
name.  The Isar command 'oracle' is now polymorphic, no argument type
wenzelm@28294
  1230
is specified.  INCOMPATIBILITY, need to simplify existing oracle code
wenzelm@28294
  1231
accordingly.  Note that extra performance may be gained by producing
wenzelm@28294
  1232
the cterm carefully, avoiding slow Thm.cterm_of.
wenzelm@28294
  1233
wenzelm@30845
  1234
* Simplified interface for defining document antiquotations via
wenzelm@30845
  1235
ThyOutput.antiquotation, ThyOutput.output, and optionally
wenzelm@30845
  1236
ThyOutput.maybe_pretty_source.  INCOMPATIBILITY, need to simplify user
wenzelm@30845
  1237
antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
wenzelm@30845
  1238
examples.
wenzelm@28099
  1239
wenzelm@30395
  1240
* More systematic treatment of long names, abstract name bindings, and
wenzelm@30395
  1241
name space operations.  Basic operations on qualified names have been
wenzelm@30399
  1242
move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
wenzelm@30395
  1243
Long_Name.append.  Old type bstring has been mostly replaced by
wenzelm@30395
  1244
abstract type binding (see structure Binding), which supports precise
wenzelm@30845
  1245
qualification by packages and local theory targets, as well as proper
wenzelm@30845
  1246
tracking of source positions.  INCOMPATIBILITY, need to wrap old
wenzelm@30845
  1247
bstring values into Binding.name, or better pass through abstract
wenzelm@30399
  1248
bindings everywhere.  See further src/Pure/General/long_name.ML,
wenzelm@30395
  1249
src/Pure/General/binding.ML and src/Pure/General/name_space.ML
wenzelm@30395
  1250
wenzelm@28089
  1251
* Result facts (from PureThy.note_thms, ProofContext.note_thms,
wenzelm@28089
  1252
LocalTheory.note etc.) now refer to the *full* internal name, not the
wenzelm@28089
  1253
bstring as before.  INCOMPATIBILITY, not detected by ML type-checking!
wenzelm@28089
  1254
wenzelm@27287
  1255
* Disposed old type and term read functions (Sign.read_def_typ,
wenzelm@27287
  1256
Sign.read_typ, Sign.read_def_terms, Sign.read_term,
wenzelm@27287
  1257
Thm.read_def_cterms, Thm.read_cterm etc.).  INCOMPATIBILITY, should
wenzelm@27287
  1258
use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
wenzelm@27269
  1259
Syntax.read_term_global etc.; see also OldGoals.read_term as last
wenzelm@27269
  1260
resort for legacy applications.
wenzelm@27269
  1261
wenzelm@30609
  1262
* Disposed old declarations, tactics, tactic combinators that refer to
wenzelm@30609
  1263
the simpset or claset of an implicit theory (such as Addsimps,
wenzelm@30609
  1264
Simp_tac, SIMPSET).  INCOMPATIBILITY, should use @{simpset} etc. in
wenzelm@30609
  1265
embedded ML text, or local_simpset_of with a proper context passed as
wenzelm@30609
  1266
explicit runtime argument.
wenzelm@30609
  1267
wenzelm@30845
  1268
* Rules and tactics that read instantiations (read_instantiate,
wenzelm@30845
  1269
res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
wenzelm@30845
  1270
context, which is required for parsing and type-checking.  Moreover,
wenzelm@30845
  1271
the variables are specified as plain indexnames, not string encodings
wenzelm@30845
  1272
thereof.  INCOMPATIBILITY.
wenzelm@30845
  1273
wenzelm@30845
  1274
* Generic Toplevel.add_hook interface allows to analyze the result of
wenzelm@30845
  1275
transactions.  E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
wenzelm@30845
  1276
for theorem dependency output of transactions resulting in a new
wenzelm@30845
  1277
theory state.
wenzelm@30845
  1278
wenzelm@30845
  1279
* ML antiquotations: block-structured compilation context indicated by
wenzelm@27391
  1280
\<lbrace> ... \<rbrace>; additional antiquotation forms:
wenzelm@27391
  1281
wenzelm@30845
  1282
  @{binding name}                         - basic name binding
wenzelm@27519
  1283
  @{let ?pat = term}                      - term abbreviation (HO matching)
wenzelm@27519
  1284
  @{note name = fact}                     - fact abbreviation
wenzelm@27519
  1285
  @{thm fact}                             - singleton fact (with attributes)
wenzelm@27519
  1286
  @{thms fact}                            - general fact (with attributes)
wenzelm@27519
  1287
  @{lemma prop by method}                 - singleton goal
wenzelm@27519
  1288
  @{lemma prop by meth1 meth2}            - singleton goal
wenzelm@27519
  1289
  @{lemma prop1 ... propN by method}      - general goal
wenzelm@27519
  1290
  @{lemma prop1 ... propN by meth1 meth2} - general goal
wenzelm@27519
  1291
  @{lemma (open) ...}                     - open derivation
wenzelm@27380
  1292
wenzelm@27246
  1293
wenzelm@27979
  1294
*** System ***
wenzelm@27979
  1295
wenzelm@28248
  1296
* The Isabelle "emacs" tool provides a specific interface to invoke
wenzelm@28248
  1297
Proof General / Emacs, with more explicit failure if that is not
wenzelm@28248
  1298
installed (the old isabelle-interface script silently falls back on
wenzelm@28248
  1299
isabelle-process).  The PROOFGENERAL_HOME setting determines the
wenzelm@28248
  1300
installation location of the Proof General distribution.
wenzelm@28248
  1301
wenzelm@27979
  1302
* Isabelle/lib/classes/Pure.jar provides basic support to integrate
wenzelm@27979
  1303
the Isabelle process into a JVM/Scala application.  See
wenzelm@27979
  1304
Isabelle/lib/jedit/plugin for a minimal example.  (The obsolete Java
wenzelm@27979
  1305
process wrapper has been discontinued.)
wenzelm@27979
  1306
wenzelm@30845
  1307
* Added homegrown Isabelle font with unicode layout, see lib/fonts.
wenzelm@30845
  1308
wenzelm@30845
  1309
* Various status messages (with exact source position information) are
wenzelm@27979
  1310
emitted, if proper markup print mode is enabled.  This allows
wenzelm@27979
  1311
user-interface components to provide detailed feedback on internal
wenzelm@27979
  1312
prover operations.
wenzelm@27979
  1313
wenzelm@27979
  1314
wenzelm@27143
  1315
wenzelm@27008
  1316
New in Isabelle2008 (June 2008)
wenzelm@27008
  1317
-------------------------------
wenzelm@25464
  1318
wenzelm@25522
  1319
*** General ***
wenzelm@25522
  1320
wenzelm@27061
  1321
* The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
wenzelm@27061
  1322
and updated, with formally checked references as hyperlinks.
wenzelm@27061
  1323
wenzelm@25994
  1324
* Theory loader: use_thy (and similar operations) no longer set the
wenzelm@25994
  1325
implicit ML context, which was occasionally hard to predict and in
wenzelm@25994
  1326
conflict with concurrency.  INCOMPATIBILITY, use ML within Isar which
wenzelm@25994
  1327
provides a proper context already.
wenzelm@25994
  1328
wenzelm@26323
  1329
* Theory loader: old-style ML proof scripts being *attached* to a thy
wenzelm@26323
  1330
file are no longer supported.  INCOMPATIBILITY, regular 'uses' and
wenzelm@26323
  1331
'use' within a theory file will do the job.
wenzelm@26323
  1332
wenzelm@26650
  1333
* Name space merge now observes canonical order, i.e. the second space
wenzelm@26650
  1334
is inserted into the first one, while existing entries in the first
wenzelm@26659
  1335
space take precedence.  INCOMPATIBILITY in rare situations, may try to
wenzelm@26650
  1336
swap theory imports.
wenzelm@26650
  1337
wenzelm@27067
  1338
* Syntax: symbol \<chi> is now considered a letter.  Potential
wenzelm@27067
  1339
INCOMPATIBILITY in identifier syntax etc.
wenzelm@27067
  1340
wenzelm@27067
  1341
* Outer syntax: string tokens no longer admit escaped white space,
wenzelm@27067
  1342
which was an accidental (undocumented) feature.  INCOMPATIBILITY, use
wenzelm@27067
  1343
white space without escapes.
wenzelm@27067
  1344
wenzelm@27067
  1345
* Outer syntax: string tokens may contain arbitrary character codes
wenzelm@27067
  1346
specified via 3 decimal digits (as in SML).  E.g. "foo\095bar" for
wenzelm@27067
  1347
"foo_bar".
wenzelm@27067
  1348
wenzelm@25522
  1349
haftmann@25502
  1350
*** Pure ***
haftmann@25502
  1351
wenzelm@26718
  1352
* Context-dependent token translations.  Default setup reverts locally
wenzelm@26718
  1353
fixed variables, and adds hilite markup for undeclared frees.
wenzelm@26718
  1354
berghofe@26681
  1355
* Unused theorems can be found using the new command 'unused_thms'.
berghofe@26681
  1356
There are three ways of invoking it:
berghofe@26681
  1357
berghofe@26681
  1358
(1) unused_thms
berghofe@26681
  1359
     Only finds unused theorems in the current theory.
berghofe@26681
  1360
berghofe@26681
  1361
(2) unused_thms thy_1 ... thy_n -
berghofe@26681
  1362
     Finds unused theorems in the current theory and all of its ancestors,
berghofe@26681
  1363
     excluding the theories thy_1 ... thy_n and all of their ancestors.
berghofe@26681
  1364
berghofe@26681
  1365
(3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
berghofe@26681
  1366
     Finds unused theorems in the theories thy'_1 ... thy'_m and all of
berghofe@26681
  1367
     their ancestors, excluding the theories thy_1 ... thy_n and all of
berghofe@26681
  1368
     their ancestors.
berghofe@26681
  1369
wenzelm@26718
  1370
In order to increase the readability of the list produced by
wenzelm@26718
  1371
unused_thms, theorems that have been created by a particular instance
wenzelm@26874
  1372
of a theory command such as 'inductive' or 'function' are considered
wenzelm@26874
  1373
to belong to the same "group", meaning that if at least one theorem in
wenzelm@26718
  1374
this group is used, the other theorems in the same group are no longer
wenzelm@26718
  1375
reported as unused.  Moreover, if all theorems in the group are
wenzelm@26718
  1376
unused, only one theorem in the group is displayed.
wenzelm@26718
  1377
wenzelm@26718
  1378
Note that proof objects have to be switched on in order for
wenzelm@26718
  1379
unused_thms to work properly (i.e. !proofs must be >= 1, which is
wenzelm@26874
  1380
usually the case when using Proof General with the default settings).
berghofe@26681
  1381
wenzelm@26650
  1382
* Authentic naming of facts disallows ad-hoc overwriting of previous
wenzelm@26650
  1383
theorems within the same name space.  INCOMPATIBILITY, need to remove
wenzelm@26650
  1384
duplicate fact bindings, or even accidental fact duplications.  Note
wenzelm@26650
  1385
that tools may maintain dynamically scoped facts systematically, using
wenzelm@26650
  1386
PureThy.add_thms_dynamic.
wenzelm@26650
  1387
wenzelm@26660
  1388
* Command 'hide' now allows to hide from "fact" name space as well.
wenzelm@26660
  1389
wenzelm@26496
  1390
* Eliminated destructive theorem database, simpset, claset, and
wenzelm@26496
  1391
clasimpset.  Potential INCOMPATIBILITY, really need to observe linear
wenzelm@26496
  1392
update of theories within ML code.
wenzelm@26479
  1393
wenzelm@26955
  1394
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
wenzelm@26955
  1395
INCOMPATIBILITY, object-logics depending on former Pure require
wenzelm@26955
  1396
additional setup PureThy.old_appl_syntax_setup; object-logics
wenzelm@26955
  1397
depending on former CPure need to refer to Pure.
wenzelm@26650
  1398
wenzelm@26495
  1399
* Commands 'use' and 'ML' are now purely functional, operating on
wenzelm@26479
  1400
theory/local_theory.  Removed former 'ML_setup' (on theory), use 'ML'
wenzelm@26479
  1401
instead.  Added 'ML_val' as mere diagnostic replacement for 'ML'.
wenzelm@26479
  1402
INCOMPATIBILITY.
wenzelm@26479
  1403
wenzelm@26874
  1404
* Command 'setup': discontinued implicit version with ML reference.
wenzelm@26434
  1405
wenzelm@25970
  1406
* Instantiation target allows for simultaneous specification of class
wenzelm@25970
  1407
instance operations together with an instantiation proof.
wenzelm@25970
  1408
Type-checking phase allows to refer to class operations uniformly.
wenzelm@27067
  1409
See src/HOL/Complex/Complex.thy for an Isar example and
wenzelm@27067
  1410
src/HOL/Library/Eval.thy for an ML example.
haftmann@25502
  1411
wenzelm@26201
  1412
* Indexing of literal facts: be more serious about including only
wenzelm@26201
  1413
facts from the visible specification/proof context, but not the
wenzelm@26201
  1414
background context (locale etc.).  Affects `prop` notation and method
wenzelm@26201
  1415
"fact".  INCOMPATIBILITY: need to name facts explicitly in rare
wenzelm@26201
  1416
situations.
wenzelm@26201
  1417
wenzelm@26925
  1418
* Method "cases", "induct", "coinduct": removed obsolete/undocumented
wenzelm@26925
  1419
"(open)" option, which used to expose internal bound variables to the
wenzelm@26925
  1420
proof text.
wenzelm@26925
  1421
wenzelm@26925
  1422
* Isar statements: removed obsolete case "rule_context".
wenzelm@26925
  1423
INCOMPATIBILITY, better use explicit fixes/assumes.
wenzelm@26925
  1424
wenzelm@26874
  1425
* Locale proofs: default proof step now includes 'unfold_locales';
wenzelm@26874
  1426
hence 'proof' without argument may be used to unfold locale
wenzelm@26874
  1427
predicates.
ballarin@26765
  1428
ballarin@26765
  1429
haftmann@26762
  1430
*** Document preparation ***
haftmann@26762
  1431
wenzelm@26914
  1432
* Simplified pdfsetup.sty: color/hyperref is used unconditionally for
wenzelm@26914
  1433
both pdf and dvi (hyperlinks usually work in xdvi as well); removed
wenzelm@26914
  1434
obsolete thumbpdf setup (contemporary PDF viewers do this on the
wenzelm@26914
  1435
spot); renamed link color from "darkblue" to "linkcolor" (default
wenzelm@26920
  1436
value unchanged, can be redefined via \definecolor); no longer sets
wenzelm@26920
  1437
"a4paper" option (unnecessary or even intrusive).
wenzelm@26914
  1438
wenzelm@27008
  1439
* Antiquotation @{lemma A method} proves proposition A by the given
wenzelm@27008
  1440
method (either a method name or a method name plus (optional) method
wenzelm@27008
  1441
arguments in parentheses) and prints A just like @{prop A}.
haftmann@26762
  1442
haftmann@26762
  1443
wenzelm@25464
  1444
*** HOL ***
wenzelm@25464
  1445
wenzelm@27067
  1446
* New primrec package.  Specification syntax conforms in style to
wenzelm@27067
  1447
definition/function/....  No separate induction rule is provided.  The
wenzelm@27067
  1448
"primrec" command distinguishes old-style and new-style specifications
wenzelm@27067
  1449
by syntax.  The former primrec package is now named OldPrimrecPackage.
wenzelm@27067
  1450
When adjusting theories, beware: constants stemming from new-style
wenzelm@27067
  1451
primrec specifications have authentic syntax.
wenzelm@27067
  1452
wenzelm@27067
  1453
* Metis prover is now an order of magnitude faster, and also works
wenzelm@27067
  1454
with multithreading.
wenzelm@27067
  1455
wenzelm@27067
  1456
* Metis: the maximum number of clauses that can be produced from a
wenzelm@27067
  1457
theorem is now given by the attribute max_clauses.  Theorems that
wenzelm@27067
  1458
exceed this number are ignored, with a warning printed.
wenzelm@27067
  1459
wenzelm@27067
  1460
* Sledgehammer no longer produces structured proofs by default. To
wenzelm@27067
  1461
enable, declare [[sledgehammer_full = true]].  Attributes
wenzelm@27067
  1462
reconstruction_modulus, reconstruction_sorts renamed
wenzelm@27067
  1463
sledgehammer_modulus, sledgehammer_sorts.  INCOMPATIBILITY.
wenzelm@27067
  1464
haftmann@27104
  1465
* Method "induct_scheme" derives user-specified induction rules
wenzelm@27067
  1466
from well-founded induction and completeness of patterns. This factors
wenzelm@27067
  1467
out some operations that are done internally by the function package
wenzelm@27067
  1468
and makes them available separately.  See
wenzelm@27067
  1469
src/HOL/ex/Induction_Scheme.thy for examples.
wenzelm@27067
  1470
wenzelm@27067
  1471
* More flexible generation of measure functions for termination
wenzelm@27067
  1472
proofs: Measure functions can be declared by proving a rule of the
wenzelm@27067
  1473
form "is_measure f" and giving it the [measure_function] attribute.
wenzelm@27067
  1474
The "is_measure" predicate is logically meaningless (always true), and
wenzelm@27067
  1475
just guides the heuristic.  To find suitable measure functions, the
wenzelm@27067
  1476
termination prover sets up the goal "is_measure ?f" of the appropriate
wenzelm@27067
  1477
type and generates all solutions by prolog-style backwards proof using
wenzelm@27067
  1478
the declared rules.
wenzelm@27067
  1479
wenzelm@27067
  1480
This setup also deals with rules like 
wenzelm@27067
  1481
wenzelm@27067
  1482
  "is_measure f ==> is_measure (list_size f)"
wenzelm@27067
  1483
wenzelm@27067
  1484
which accommodates nested datatypes that recurse through lists.
wenzelm@27067
  1485
Similar rules are predeclared for products and option types.
wenzelm@27067
  1486
berghofe@26964
  1487
* Turned the type of sets "'a set" into an abbreviation for "'a => bool"
berghofe@26964
  1488
berghofe@26964
  1489
  INCOMPATIBILITIES:
berghofe@26964
  1490
wenzelm@27008
  1491
  - Definitions of overloaded constants on sets have to be replaced by
wenzelm@27008
  1492
    definitions on => and bool.
berghofe@26964
  1493
berghofe@26964
  1494
  - Some definitions of overloaded operators on sets can now be proved
wenzelm@27008
  1495
    using the definitions of the operators on => and bool.  Therefore,
wenzelm@27008
  1496
    the following theorems have been renamed:
berghofe@26964
  1497
berghofe@26964
  1498
      subset_def   -> subset_eq
berghofe@26964
  1499
      psubset_def  -> psubset_eq
berghofe@26964
  1500
      set_diff_def -> set_diff_eq
berghofe@26964
  1501
      Compl_def    -> Compl_eq
berghofe@26964
  1502
      Sup_set_def  -> Sup_set_eq
berghofe@26964
  1503
      Inf_set_def  -> Inf_set_eq
berghofe@26964
  1504
      sup_set_def  -> sup_set_eq
berghofe@26964
  1505
      inf_set_def  -> inf_set_eq
berghofe@26964
  1506
berghofe@26964
  1507
  - Due to the incompleteness of the HO unification algorithm, some
berghofe@26964
  1508
    rules such as subst may require manual instantiation, if some of
berghofe@26964
  1509
    the unknowns in the rule is a set.
berghofe@26964
  1510
berghofe@26964
  1511
  - Higher order unification and forward proofs:
berghofe@26964
  1512
    The proof pattern
berghofe@26964
  1513
berghofe@26964
  1514
      have "P (S::'a set)" <...>
berghofe@26964
  1515
      then have "EX S. P S" ..
berghofe@26964
  1516
wenzelm@27008
  1517
    no longer works (due to the incompleteness of the HO unification
wenzelm@27008
  1518
    algorithm) and must be replaced by the pattern
berghofe@26964
  1519
berghofe@26964
  1520
      have "EX S. P S"
berghofe@26964
  1521
      proof
berghofe@26964
  1522
        show "P S" <...>
berghofe@26964
  1523
      qed
berghofe@26964
  1524
berghofe@26964
  1525
  - Calculational reasoning with subst (or similar rules):
berghofe@26964
  1526
    The proof pattern
berghofe@26964
  1527
berghofe@26964
  1528
      have "P (S::'a set)" <...>
berghofe@26964
  1529
      also have "S = T" <...>
berghofe@26964
  1530
      finally have "P T" .
berghofe@26964
  1531
wenzelm@27008
  1532
    no longer works (for similar reasons as the previous example) and
wenzelm@27008
  1533
    must be replaced by something like
berghofe@26964
  1534
berghofe@26964
  1535
      have "P (S::'a set)" <...>
berghofe@26964
  1536
      moreover have "S = T" <...>
berghofe@26964
  1537
      ultimately have "P T" by simp
berghofe@26964
  1538
berghofe@26964
  1539
  - Tactics or packages written in ML code:
berghofe@26964
  1540
    Code performing pattern matching on types via
berghofe@26964
  1541
berghofe@26964
  1542
      Type ("set", [T]) => ...
berghofe@26964
  1543
wenzelm@27008
  1544
    must be rewritten. Moreover, functions like strip_type or
wenzelm@27008
  1545
    binder_types no longer return the right value when applied to a
wenzelm@27008
  1546
    type of the form
berghofe@26964
  1547
berghofe@26964
  1548
      T1 => ... => Tn => U => bool
berghofe@26964
  1549
berghofe@26964
  1550
    rather than
berghofe@26964
  1551
berghofe@26964
  1552
      T1 => ... => Tn => U set
berghofe@26964
  1553
wenzelm@26874
  1554
* Merged theories Wellfounded_Recursion, Accessible_Part and
wenzelm@27067
  1555
Wellfounded_Relations to theory Wellfounded.
krauss@26748
  1556
haftmann@26513
  1557
* Explicit class "eq" for executable equality.  INCOMPATIBILITY.
haftmann@26513
  1558
wenzelm@26874
  1559
* Class finite no longer treats UNIV as class parameter.  Use class
wenzelm@26874
  1560
enum from theory Library/Enum instead to achieve a similar effect.
haftmann@26445
  1561
INCOMPATIBILITY.
haftmann@26445
  1562
wenzelm@26874
  1563
* Theory List: rule list_induct2 now has explicitly named cases "Nil"
wenzelm@26874
  1564
and "Cons".  INCOMPATIBILITY.
wenzelm@26874
  1565
wenzelm@26422
  1566
* HOL (and FOL): renamed variables in rules imp_elim and swap.
wenzelm@26422
  1567
Potential INCOMPATIBILITY.
wenzelm@26422
  1568
wenzelm@26874
  1569
* Theory Product_Type: duplicated lemmas split_Pair_apply and
wenzelm@26874
  1570
injective_fst_snd removed, use split_eta and prod_eqI instead.
wenzelm@26874
  1571
Renamed upd_fst to apfst and upd_snd to apsnd.  INCOMPATIBILITY.
haftmann@26355
  1572
wenzelm@26335
  1573
* Theory Nat: removed redundant lemmas that merely duplicate lemmas of
wenzelm@26335
  1574
the same name in theory Orderings:
wenzelm@26335
  1575
wenzelm@26335
  1576
  less_trans
wenzelm@26335
  1577
  less_linear
wenzelm@26335
  1578
  le_imp_less_or_eq
wenzelm@26335
  1579
  le_less_trans
wenzelm@26335
  1580
  less_le_trans
wenzelm@26335
  1581
  less_not_sym
wenzelm@26335
  1582
  less_asym
wenzelm@26335
  1583
wenzelm@26335
  1584
Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
wenzelm@26335
  1585
less_irrefl_nat.  Potential INCOMPATIBILITY due to more general types
wenzelm@26335
  1586
and different variable names.
wenzelm@26315
  1587
haftmann@26231
  1588
* Library/Option_ord.thy: Canonical order on option type.
haftmann@26231
  1589
wenzelm@27008
  1590
* Library/RBT.thy: Red-black trees, an efficient implementation of
wenzelm@27008
  1591
finite maps.
krauss@26197
  1592
haftmann@26231
  1593
* Library/Countable.thy: Type class for countable types.
haftmann@26231
  1594
wenzelm@26180
  1595
* Theory Int: The representation of numerals has changed.  The infix
wenzelm@26180
  1596
operator BIT and the bit datatype with constructors B0 and B1 have
wenzelm@26180
  1597
disappeared.  INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
wenzelm@26180
  1598
place of "x BIT bit.B0" and "y BIT bit.B1", respectively.  Theorems
wenzelm@26180
  1599
involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
wenzelm@26180
  1600
accordingly.
wenzelm@26180
  1601
wenzelm@26180
  1602
* Theory Nat: definition of <= and < on natural numbers no longer
wenzelm@26180
  1603
depend on well-founded relations.  INCOMPATIBILITY.  Definitions
wenzelm@26180
  1604
le_def and less_def have disappeared.  Consider lemmas not_less
wenzelm@26180
  1605
[symmetric, where ?'a = nat] and less_eq [symmetric] instead.
wenzelm@26180
  1606
wenzelm@26180
  1607
* Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
wenzelm@26180
  1608
(whose purpose mainly is for various fold_set functionals) have been
wenzelm@26874
  1609
abandoned in favor of the existing algebraic classes
wenzelm@26180
  1610
ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
wenzelm@26180
  1611
lower_semilattice (resp. upper_semilattice) and linorder.
haftmann@26139
  1612
INCOMPATIBILITY.
haftmann@26041
  1613
wenzelm@26180
  1614
* Theory Transitive_Closure: induct and cases rules now declare proper
wenzelm@26180
  1615
case_names ("base" and "step").  INCOMPATIBILITY.
wenzelm@26180
  1616
wenzelm@26180
  1617
* Theorem Inductive.lfp_ordinal_induct generalized to complete
wenzelm@26180
  1618
lattices.  The form set-specific version is available as
wenzelm@26180
  1619
Inductive.lfp_ordinal_induct_set.
haftmann@26013
  1620
wenzelm@26874
  1621
* Renamed theorems "power.simps" to "power_int.simps".
wenzelm@27067
  1622
INCOMPATIBILITY.
haftmann@25961
  1623
wenzelm@26180
  1624
* Class semiring_div provides basic abstract properties of semirings
haftmann@25942
  1625
with division and modulo operations.  Subsumes former class dvd_mod.
haftmann@25942
  1626
wenzelm@26180
  1627
* Merged theories IntDef, Numeral and IntArith into unified theory
wenzelm@26180
  1628
Int.  INCOMPATIBILITY.
wenzelm@26180
  1629
wenzelm@26180
  1630
* Theory Library/Code_Index: type "index" now represents natural
wenzelm@26180
  1631
numbers rather than integers.  INCOMPATIBILITY.
wenzelm@26180
  1632
wenzelm@26180
  1633
* New class "uminus" with operation "uminus" (split of from class
wenzelm@26180
  1634
"minus" which now only has operation "minus", binary).
haftmann@25919
  1635
INCOMPATIBILITY.
haftmann@25919
  1636
wenzelm@25522
  1637
* Constants "card", "internal_split", "option_map" now with authentic
haftmann@25919
  1638
syntax.  INCOMPATIBILITY.
wenzelm@25522
  1639
wenzelm@25522
  1640
* Definitions subset_def, psubset_def, set_diff_def, Compl_def,
wenzelm@25522
  1641
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
wenzelm@25522
  1642
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
wenzelm@25522
  1643
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
wenzelm@25522
  1644
Sup_set_def, le_def, less_def, option_map_def now with object
haftmann@25919
  1645
equality.  INCOMPATIBILITY.
wenzelm@25464
  1646
schirmer@25705
  1647
* Records. Removed K_record, and replaced it by pure lambda term
wenzelm@25726
  1648
%x. c. The simplifier setup is now more robust against eta expansion.
schirmer@25705
  1649
INCOMPATIBILITY: in cases explicitly referring to K_record.
wenzelm@25464
  1650
wenzelm@27067
  1651
* Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
wenzelm@27067
  1652
wenzelm@27067
  1653
* Library/ListVector: new theory of arithmetic vector operations.
wenzelm@27067
  1654
wenzelm@27067
  1655
* Library/Order_Relation: new theory of various orderings as sets of
wenzelm@27067
  1656
pairs.  Defines preorders, partial orders, linear orders and
wenzelm@27067
  1657
well-orders on sets and on types.
krauss@26877
  1658
wenzelm@25726
  1659
krauss@26197
  1660
*** ZF ***
krauss@26197
  1661
wenzelm@26874
  1662
* Renamed some theories to allow to loading both ZF and HOL in the
wenzelm@26874
  1663
same session:
wenzelm@26874
  1664
wenzelm@26874
  1665
  Datatype  -> Datatype_ZF
wenzelm@26874
  1666
  Inductive -> Inductive_ZF
wenzelm@26874
  1667
  Int       -> Int_ZF
wenzelm@26874
  1668
  IntDiv    -> IntDiv_ZF
wenzelm@26874
  1669
  Nat       -> Nat_ZF
wenzelm@26874
  1670
  List      -> List_ZF
wenzelm@26874
  1671
  Main      -> Main_ZF
wenzelm@26874
  1672
wenzelm@26874
  1673
INCOMPATIBILITY: ZF theories that import individual theories below
wenzelm@26874
  1674
Main might need to be adapted.  Regular theory Main is still
wenzelm@26874
  1675
available, as trivial extension of Main_ZF.
krauss@26197
  1676
krauss@26197
  1677
wenzelm@25737
  1678
*** ML ***
wenzelm@25737
  1679
wenzelm@27067
  1680
* ML within Isar: antiquotation @{const name} or @{const
wenzelm@27067
  1681
name(typargs)} produces statically-checked Const term.
wenzelm@27067
  1682
wenzelm@26401
  1683
* Functor NamedThmsFun: data is available to the user as dynamic fact
wenzelm@26724
  1684
(of the same name).  Removed obsolete print command.
wenzelm@26401
  1685
wenzelm@27067
  1686
* Removed obsolete "use_legacy_bindings" function.
wenzelm@26188
  1687
wenzelm@25737
  1688
* The ``print mode'' is now a thread-local value derived from a global
wenzelm@25737
  1689
template (the former print_mode reference), thus access becomes
wenzelm@25737
  1690
non-critical.  The global print_mode reference is for session
wenzelm@25737
  1691
management only; user-code should use print_mode_value,
wenzelm@25737
  1692
print_mode_active, PrintMode.setmp etc.  INCOMPATIBILITY.
wenzelm@25737
  1693
wenzelm@26874
  1694
* Functions system/system_out provide a robust way to invoke external
wenzelm@29161
  1695
shell commands, with propagation of interrupts (requires Poly/ML
wenzelm@29161
  1696
5.2.1).  Do not use OS.Process.system etc. from the basis library!
wenzelm@26222
  1697
wenzelm@25737
  1698
wenzelm@25626
  1699
*** System ***
wenzelm@25626
  1700
wenzelm@25971
  1701
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
wenzelm@25971
  1702
in accordance with Proof General 3.7, which prefers GNU emacs.
wenzelm@25970
  1703
wenzelm@25626
  1704
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm@25626
  1705
optional line editor may be specified via ISABELLE_LINE_EDITOR
wenzelm@25626
  1706
setting, the default settings attempt to locate "ledit" and "rlwrap".
wenzelm@25626
  1707
wenzelm@25651
  1708
* isatool browser now works with Cygwin as well, using general
wenzelm@25651
  1709
"javapath" function defined in Isabelle process environment.
wenzelm@25651
  1710
wenzelm@27067
  1711
* YXML notation provides a simple and efficient alternative to
wenzelm@27067
  1712
standard XML transfer syntax.  See src/Pure/General/yxml.ML and
wenzelm@27067
  1713
isatool yxml as described in the Isabelle system manual.
wenzelm@25651
  1714
wenzelm@25652
  1715
* JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
wenzelm@25651
  1716
provides general wrapper for managing an Isabelle process in a robust
wenzelm@25651
  1717
fashion, with ``cooked'' output from stdin/stderr.
wenzelm@25651
  1718
wenzelm@25855
  1719
* Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
wenzelm@25855
  1720
based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
wenzelm@25855
  1721
wenzelm@27067
  1722
* Removed obsolete THIS_IS_ISABELLE_BUILD feature.  NB: the documented
wenzelm@27067
  1723
way of changing the user's settings is via
wenzelm@27067
  1724
ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
wenzelm@27067
  1725
script.
wenzelm@27067
  1726
wenzelm@27067
  1727
* Multithreading.max_threads := 0 refers to the number of actual CPU
wenzelm@27067
  1728
cores of the underlying machine, which is a good starting point for
wenzelm@27067
  1729
optimal performance tuning.  The corresponding usedir option -M allows
wenzelm@27067
  1730
"max" as an alias for "0".  WARNING: does not work on certain versions
wenzelm@27067
  1731
of Mac OS (with Poly/ML 5.1).
wenzelm@27067
  1732
wenzelm@27067
  1733
* isabelle-process: non-ML sessions are run with "nice", to reduce the
wenzelm@27067
  1734
adverse effect of Isabelle flooding interactive front-ends (notably
wenzelm@27067
  1735
ProofGeneral / XEmacs).
wenzelm@27067
  1736
wenzelm@25626
  1737
wenzelm@25464
  1738
wenzelm@25429
  1739
New in Isabelle2007 (November 2007)
wenzelm@25429
  1740
-----------------------------------
wenzelm@17754
  1741
wenzelm@17754
  1742
*** General ***
wenzelm@17754
  1743
wenzelm@22826
  1744
* More uniform information about legacy features, notably a
wenzelm@22826
  1745
warning/error of "Legacy feature: ...", depending on the state of the
wenzelm@23367
  1746
tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
wenzelm@23367
  1747
legacy features will disappear eventually.
wenzelm@22826
  1748
wenzelm@17918
  1749
* Theory syntax: the header format ``theory A = B + C:'' has been
wenzelm@17918
  1750
discontinued in favour of ``theory A imports B C begin''.  Use isatool
wenzelm@17918
  1751
fixheaders to convert existing theory files.  INCOMPATIBILITY.
wenzelm@17918
  1752
wenzelm@17918
  1753
* Theory syntax: the old non-Isar theory file format has been
wenzelm@17918
  1754
discontinued altogether.  Note that ML proof scripts may still be used
wenzelm@17918
  1755
with Isar theories; migration is usually quite simple with the ML
wenzelm@17918
  1756
function use_legacy_bindings.  INCOMPATIBILITY.
wenzelm@17918
  1757
wenzelm@22871
  1758
* Theory syntax: some popular names (e.g. 'class', 'declaration',
wenzelm@22871
  1759
'fun', 'help', 'if') are now keywords.  INCOMPATIBILITY, use double
wenzelm@22871
  1760
quotes.
wenzelm@19814
  1761
wenzelm@23888
  1762
* Theory loader: be more serious about observing the static theory
wenzelm@23888
  1763
header specifications (including optional directories), but not the
wenzelm@24172
  1764
accidental file locations of previously successful loads.  The strict
wenzelm@24172
  1765
update policy of former update_thy is now already performed by
wenzelm@24172
  1766
use_thy, so the former has been removed; use_thys updates several
wenzelm@24172
  1767
theories simultaneously, just as 'imports' within a theory header
wenzelm@24172
  1768
specification, but without merging the results.  Potential
wenzelm@24172
  1769
INCOMPATIBILITY: may need to refine theory headers and commands
wenzelm@24172
  1770
ROOT.ML which depend on load order.
wenzelm@23888
  1771
wenzelm@23888
  1772
* Theory loader: optional support for content-based file
wenzelm@23888
  1773
identification, instead of the traditional scheme of full physical
wenzelm@23889
  1774
path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
wenzelm@23888
  1775
(cf. the system manual).  The new scheme allows to work with
wenzelm@23888
  1776
non-finished theories in persistent session images, such that source
wenzelm@23888
  1777
files may be moved later on without requiring reloads.
wenzelm@23888
  1778
wenzelm@24187
  1779
* Theory loader: old-style ML proof scripts being *attached* to a thy
wenzelm@24187
  1780
file (with the same base name as the theory) are considered a legacy
wenzelm@24800
  1781
feature, which will disappear eventually. Even now, the theory loader
wenzelm@24800
  1782
no longer maintains dependencies on such files.
wenzelm@24800
  1783
wenzelm@24800
  1784
* Syntax: the scope for resolving ambiguities via type-inference is
wenzelm@24800
  1785
now limited to individual terms, instead of whole simultaneous
wenzelm@24234
  1786
specifications as before. This greatly reduces the complexity of the
wenzelm@24234
  1787
syntax module and improves flexibility by separating parsing and
wenzelm@24234
  1788
type-checking. INCOMPATIBILITY: additional type-constraints (explicit
wenzelm@24234
  1789
'fixes' etc.) are required in rare situations.
wenzelm@24234
  1790
wenzelm@25034
  1791
* Syntax: constants introduced by new-style packages ('definition',
wenzelm@25034
  1792
'abbreviation' etc.) are passed through the syntax module in
wenzelm@25034
  1793
``authentic mode''. This means that associated mixfix annotations
wenzelm@25034
  1794
really stick to such constants, independently of potential name space
wenzelm@25034
  1795
ambiguities introduced later on. INCOMPATIBILITY: constants in parse
wenzelm@25034
  1796
trees are represented slightly differently, may need to adapt syntax
wenzelm@25034
  1797
translations accordingly. Use CONST marker in 'translations' and
wenzelm@25034
  1798
@{const_syntax} antiquotation in 'parse_translation' etc.
wenzelm@25034
  1799
wenzelm@17981
  1800
* Legacy goal package: reduced interface to the bare minimum required
wenzelm@17981
  1801
to keep existing proof scripts running.  Most other user-level
wenzelm@17981
  1802
functions are now part of the OldGoals structure, which is *not* open
wenzelm@17981
  1803
by default (consider isatool expandshort before open OldGoals).
wenzelm@17981
  1804
Removed top_sg, prin, printyp, pprint_term/typ altogether, because
wenzelm@17981
  1805
these tend to cause confusion about the actual goal (!) context being
wenzelm@17981
  1806
used here, which is not necessarily the same as the_context().
wenzelm@17918
  1807
wenzelm@23379
  1808
* Command 'find_theorems': supports "*" wild-card in "name:"
wenzelm@23379
  1809
criterion; "with_dups" option.  Certain ProofGeneral versions might
wenzelm@23379
  1810
support a specific search form (see ProofGeneral/CHANGES).
webertj@22965
  1811
wenzelm@20370
  1812
* The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
wenzelm@20370
  1813
by default, which means that "prems" (and also "fixed variables") are
wenzelm@20370
  1814
suppressed from proof state output.  Note that the ProofGeneral
wenzelm@20370
  1815
settings mechanism allows to change and save options persistently, but
wenzelm@20370
  1816
older versions of Isabelle will fail to start up if a negative prems
wenzelm@20370
  1817
limit is imposed.
wenzelm@20370
  1818
wenzelm@21308
  1819
* Local theory targets may be specified by non-nested blocks of
wenzelm@21308
  1820
``context/locale/class ... begin'' followed by ``end''.  The body may
wenzelm@21308
  1821
contain definitions, theorems etc., including any derived mechanism
wenzelm@21308
  1822
that has been implemented on top of these primitives.  This concept
wenzelm@21308
  1823
generalizes the existing ``theorem (in ...)'' towards more versatility
wenzelm@21308
  1824
and scalability.
wenzelm@21308
  1825
wenzelm@21960
  1826
* Proof General interface: proper undo of final 'end' command;
wenzelm@21960
  1827
discontinued Isabelle/classic mode (ML proof scripts).
wenzelm@21960
  1828
wenzelm@17754
  1829
wenzelm@17865
  1830
*** Document preparation ***
wenzelm@17865
  1831
wenzelm@21717
  1832
* Added antiquotation @{theory name} which prints the given name,
wenzelm@21717
  1833
after checking that it refers to a valid ancestor theory in the
wenzelm@21717
  1834
current context.
haftmann@21339
  1835
wenzelm@17869
  1836
* Added antiquotations @{ML_type text} and @{ML_struct text} which
wenzelm@17869
  1837
check the given source text as ML type/structure, printing verbatim.
wenzelm@17865
  1838
wenzelm@21717
  1839
* Added antiquotation @{abbrev "c args"} which prints the abbreviation
wenzelm@21717
  1840
"c args == rhs" given in the current context.  (Any number of
wenzelm@21735
  1841
arguments may be given on the LHS.)
wenzelm@21717
  1842
wenzelm@21717
  1843
wenzelm@17779
  1844
*** Pure ***
wenzelm@17779
  1845
wenzelm@24800
  1846
* The 'class' package offers a combination of axclass and locale to
wenzelm@25129
  1847
achieve Haskell-like type classes in Isabelle.  Definitions and
wenzelm@25129
  1848
theorems within a class context produce both relative results (with
wenzelm@25129
  1849
implicit parameters according to the locale context), and polymorphic
wenzelm@25129
  1850
constants with qualified polymorphism (according to the class
wenzelm@25129
  1851
context).  Within the body context of a 'class' target, a separate
wenzelm@25129
  1852
syntax layer ("user space type system") takes care of converting
wenzelm@25129
  1853
between global polymorphic consts and internal locale representation.
wenzelm@25177
  1854
See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
haftmann@25184
  1855
"isatool doc classes" provides a tutorial.
wenzelm@20807
  1856
haftmann@25199
  1857
* Generic code generator framework allows to generate executable
wenzelm@24800
  1858
code for ML and Haskell (including Isabelle classes).  A short usage
wenzelm@24800
  1859
sketch:
haftmann@20188
  1860
haftmann@20188
  1861
    internal compilation:
haftmann@25199
  1862
        export_code <list of constants (term syntax)> in SML
haftmann@20453
  1863
    writing SML code to a file:
haftmann@25199
  1864
        export_code <list of constants (term syntax)> in SML <filename>
haftmann@22735
  1865
    writing OCaml code to a file:
haftmann@25199
  1866
        export_code <list of constants (term syntax)> in OCaml <filename>
haftmann@20188
  1867
    writing Haskell code to a bunch of files:
haftmann@25199
  1868
        export_code <list of constants (term syntax)> in Haskell <filename>
haftmann@25199
  1869
haftmann@25199
  1870
    evaluating closed propositions to True/False using code generation:
haftmann@25184
  1871
        method ``eval''
haftmann@25184
  1872
haftmann@25184
  1873
Reasonable default setup of framework in HOL.
haftmann@20453
  1874
haftmann@20453
  1875
Theorem attributs for selecting and transforming function equations theorems:
haftmann@20453
  1876
haftmann@22845
  1877
    [code fun]:        select a theorem as function equation for a specific constant
haftmann@22845
  1878
    [code fun del]:    deselect a theorem as function equation for a specific constant
haftmann@22845
  1879
    [code inline]:     select an equation theorem for unfolding (inlining) in place
haftmann@22845
  1880
    [code inline del]: deselect an equation theorem for unfolding (inlining) in place
haftmann@20453
  1881
haftmann@22735
  1882
User-defined serializations (target in {SML, OCaml, Haskell}):
haftmann@20453
  1883
haftmann@20453
  1884
    code_const <and-list of constants (term syntax)>
haftmann@20453
  1885
      {(target) <and-list of const target syntax>}+
haftmann@20453
  1886
haftmann@20453
  1887
    code_type <and-list of type constructors>
haftmann@20453
  1888
      {(target) <and-list of type target syntax>}+
haftmann@20453
  1889
haftmann@20453
  1890
    code_instance <and-list of instances>
haftmann@20453
  1891
      {(target)}+
haftmann@20453
  1892
        where instance ::= <type constructor> :: <class>
haftmann@20453
  1893
haftmann@20453
  1894
    code_class <and_list of classes>
haftmann@20453
  1895
      {(target) <and-list of class target syntax>}+
haftmann@20453
  1896
        where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
haftmann@20453
  1897
haftmann@25199
  1898
code_instance and code_class only are effective to target Haskell.
haftmann@22735
  1899
wenzelm@25177
  1900
For example usage see src/HOL/ex/Codegenerator.thy and
wenzelm@25177
  1901
src/HOL/ex/Codegenerator_Pretty.thy.  A separate tutorial on code
wenzelm@24800
  1902
generation from Isabelle/HOL theories is available via "isatool doc
wenzelm@24800
  1903
codegen".
haftmann@20188
  1904
wenzelm@25129
  1905
* Code generator: consts in 'consts_code' Isar commands are now
wenzelm@25129
  1906
referred to by usual term syntax (including optional type
wenzelm@25129
  1907
annotations).
wenzelm@25129
  1908
wenzelm@19254
  1909
* Command 'no_translations' removes translation rules from theory
wenzelm@19254
  1910
syntax.
wenzelm@19254
  1911
wenzelm@19625
  1912
* Overloaded definitions are now actually checked for acyclic
wenzelm@19714
  1913
dependencies.  The overloading scheme is slightly more general than
wenzelm@19714
  1914
that of Haskell98, although Isabelle does not demand an exact
wenzelm@19714
  1915
correspondence to type class and instance declarations.
wenzelm@19714
  1916
INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
wenzelm@19714
  1917
exotic versions of overloading -- at the discretion of the user!
wenzelm@19711
  1918
wenzelm@19711
  1919
Polymorphic constants are represented via type arguments, i.e. the
wenzelm@19711
  1920
instantiation that matches an instance against the most general
wenzelm@19711
  1921
declaration given in the signature.  For example, with the declaration
wenzelm@19711
  1922
c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
wenzelm@19711
  1923
as c(nat).  Overloading is essentially simultaneous structural
wenzelm@19711
  1924
recursion over such type arguments.  Incomplete specification patterns
wenzelm@19714
  1925
impose global constraints on all occurrences, e.g. c('a * 'a) on the
wenzelm@19715
  1926
LHS means that more general c('a * 'b) will be disallowed on any RHS.
wenzelm@19714
  1927
Command 'print_theory' outputs the normalized system of recursive
wenzelm@19714
  1928
equations, see section "definitions".
wenzelm@19625
  1929
wenzelm@24086
  1930
* Configuration options are maintained within the theory or proof
wenzelm@24086
  1931
context (with name and type bool/int/string), providing a very simple
wenzelm@24086
  1932
interface to a poor-man's version of general context data.  Tools may
wenzelm@24110
  1933
declare options in ML (e.g. using Attrib.config_int) and then refer to
wenzelm@24110
  1934
these values using Config.get etc.  Users may change options via an
wenzelm@24110
  1935
associated attribute of the same name.  This form of context
wenzelm@24110
  1936
declaration works particularly well with commands 'declare' or
wenzelm@24110
  1937
'using', for example ``declare [[foo = 42]]''.  Thus it has become
wenzelm@24110
  1938
very easy to avoid global references, which would not observe Isar
wenzelm@24110
  1939
toplevel undo/redo and fail to work with multithreading.
wenzelm@24086
  1940
wenzelm@24172
  1941
Various global ML references of Pure and HOL have been turned into
wenzelm@24172
  1942
configuration options:
wenzelm@24172
  1943
wenzelm@24172
  1944
  Unify.search_bound		unify_search_bound
wenzelm@24172
  1945
  Unify.trace_bound		unify_trace_bound
wenzelm@24172
  1946
  Unify.trace_simp		unify_trace_simp
wenzelm@24172
  1947
  Unify.trace_types		unify_trace_types
wenzelm@24172
  1948
  Simplifier.simp_depth_limit	simp_depth_limit
wenzelm@24172
  1949
  Blast.depth_limit		blast_depth_limit
wenzelm@24172
  1950
  DatatypeProp.dtK		datatype_distinctness_limit
wenzelm@24172
  1951
  fast_arith_neq_limit  	fast_arith_neq_limit
wenzelm@24172
  1952
  fast_arith_split_limit	fast_arith_split_limit
wenzelm@24172
  1953
wenzelm@24086
  1954
* Named collections of theorems may be easily installed as context
wenzelm@24800
  1955
data using the functor NamedThmsFun (see also
wenzelm@24086
  1956
src/Pure/Tools/named_thms.ML).  The user may add or delete facts via
wenzelm@24110
  1957
attributes; there is also a toplevel print command.  This facility is
wenzelm@24110
  1958
just a common case of general context data, which is the preferred way
wenzelm@24110
  1959
for anything more complex than just a list of facts in canonical
wenzelm@24110
  1960
order.
wenzelm@24086
  1961
wenzelm@24032
  1962
* Isar: command 'declaration' augments a local theory by generic
wenzelm@24032
  1963
declaration functions written in ML.  This enables arbitrary content
wenzelm@24032
  1964
being added to the context, depending on a morphism that tells the
wenzelm@24032
  1965
difference of the original declaration context wrt. the application
wenzelm@24032
  1966
context encountered later on.
wenzelm@24032
  1967
wenzelm@24032
  1968
* Isar: proper interfaces for simplification procedures.  Command
wenzelm@24032
  1969
'simproc_setup' declares named simprocs (with match patterns, and body
wenzelm@24032
  1970
text in ML).  Attribute "simproc" adds/deletes simprocs in the current
wenzelm@24032
  1971
context.  ML antiquotation @{simproc name} retrieves named simprocs.
wenzelm@24032
  1972
wenzelm@24032
  1973
* Isar: an extra pair of brackets around attribute declarations
wenzelm@24032
  1974
abbreviates a theorem reference involving an internal dummy fact,
wenzelm@24032
  1975
which will be ignored later --- only the effect of the attribute on
wenzelm@24032
  1976
the background context will persist.  This form of in-place
wenzelm@24032
  1977
declarations is particularly useful with commands like 'declare' and
wenzelm@24032
  1978
'using', for example ``have A using [[simproc a]] by simp''.
wenzelm@24032
  1979
wenzelm@23369
  1980
* Isar: method "assumption" (and implicit closing of subproofs) now
wenzelm@23369
  1981
takes simple non-atomic goal assumptions into account: after applying
wenzelm@23369
  1982
an assumption as a rule the resulting subgoals are solved by atomic
wenzelm@23369
  1983
assumption steps.  This is particularly useful to finish 'obtain'
wenzelm@23369
  1984
goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
wenzelm@23369
  1985
without referring to the original premise "!!x. P x ==> thesis" in the
wenzelm@23369
  1986
Isar proof context.  POTENTIAL INCOMPATIBILITY: method "assumption" is
wenzelm@23369
  1987
more permissive.
wenzelm@23369
  1988
wenzelm@23369
  1989
* Isar: implicit use of prems from the Isar proof context is
wenzelm@23369
  1990
considered a legacy feature.  Common applications like ``have A .''
wenzelm@23369
  1991
may be replaced by ``have A by fact'' or ``note `A`''.  In general,
wenzelm@23369
  1992
referencing facts explicitly here improves readability and
wenzelm@23369
  1993
maintainability of proof texts.
wenzelm@23369
  1994
wenzelm@17865
  1995
* Isar: improper proof element 'guess' is like 'obtain', but derives
wenzelm@17865
  1996
the obtained context from the course of reasoning!  For example:
wenzelm@17865
  1997
wenzelm@17865
  1998
  assume "EX x y. A x & B y"   -- "any previous fact"
wenzelm@17865
  1999
  then guess x and y by clarify
wenzelm@17865
  2000
wenzelm@17865
  2001
This technique is potentially adventurous, depending on the facts and
wenzelm@17865
  2002
proof tools being involved here.
wenzelm@17865
  2003
wenzelm@18020
  2004
* Isar: known facts from the proof context may be specified as literal
wenzelm@18020
  2005
propositions, using ASCII back-quote syntax.  This works wherever
wenzelm@18020
  2006
named facts used to be allowed so far, in proof commands, proof
wenzelm@18020
  2007
methods, attributes etc.  Literal facts are retrieved from the context
wenzelm@18020
  2008
according to unification of type and term parameters.  For example,
wenzelm@18020
  2009
provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
wenzelm@18020
  2010
theorems in the current context, then these are valid literal facts:
wenzelm@18020
  2011
`A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
wenzelm@18020
  2012
wenzelm@18020
  2013
There is also a proof method "fact" which does the same composition
wenzelm@18044
  2014
for explicit goal states, e.g. the following proof texts coincide with
wenzelm@18044
  2015
certain special cases of literal facts:
wenzelm@18020
  2016
wenzelm@18020
  2017
  have "A" by fact                 ==  note `A`
wenzelm@18020
  2018
  have "A ==> B" by fact           ==  note `A ==> B`
wenzelm@18020
  2019
  have "!!x. P x ==> Q x" by fact  ==  note `!!x. P x ==> Q x`
wenzelm@18020
  2020
  have "P a ==> Q a" by fact       ==  note `P a ==> Q a`
wenzelm@18020
  2021
wenzelm@20118
  2022
* Isar: ":" (colon) is no longer a symbolic identifier character in
wenzelm@20118
  2023
outer syntax.  Thus symbolic identifiers may be used without
wenzelm@20118
  2024
additional white space in declarations like this: ``assume *: A''.
wenzelm@20118
  2025
wenzelm@20013
  2026
* Isar: 'print_facts' prints all local facts of the current context,
wenzelm@20013
  2027
both named and unnamed ones.
wenzelm@20013
  2028
wenzelm@18308
  2029
* Isar: 'def' now admits simultaneous definitions, e.g.:
wenzelm@18308
  2030
wenzelm@18308
  2031
  def x == "t" and y == "u"
wenzelm@18308
  2032
wenzelm@18540
  2033
* Isar: added command 'unfolding', which is structurally similar to
wenzelm@18540
  2034
'using', but affects both the goal state and facts by unfolding given
wenzelm@18815
  2035
rewrite rules.  Thus many occurrences of the 'unfold' method or
wenzelm@18540
  2036
'unfolded' attribute may be replaced by first-class proof text.
wenzelm@18540
  2037
wenzelm@18815
  2038
* Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
wenzelm@18815
  2039
and command 'unfolding' now all support object-level equalities
wenzelm@18815
  2040
(potentially conditional).  The underlying notion of rewrite rule is
wenzelm@18815
  2041
analogous to the 'rule_format' attribute, but *not* that of the
wenzelm@18815
  2042
Simplifier (which is usually more generous).
wenzelm@18815
  2043
kleing@24238
  2044
* Isar: the new attribute [rotated n] (default n = 1) rotates the
kleing@24238
  2045
premises of a theorem by n. Useful in conjunction with drule.
kleing@24238
  2046
wenzelm@19220
  2047
* Isar: the goal restriction operator [N] (default N = 1) evaluates a
wenzelm@19220
  2048
method expression within a sandbox consisting of the first N
wenzelm@19240
  2049
sub-goals, which need to exist.  For example, ``simp_all [3]''
wenzelm@19240
  2050
simplifies the first three sub-goals, while (rule foo, simp_all)[]
wenzelm@19240
  2051
simplifies all new goals that emerge from applying rule foo to the
wenzelm@19240
  2052
originally first one.
wenzelm@19220
  2053
wenzelm@19814
  2054
* Isar: schematic goals are no longer restricted to higher-order
wenzelm@19814
  2055
patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
wenzelm@19814
  2056
expected.
wenzelm@19814
  2057
wenzelm@18901
  2058
* Isar: the conclusion of a long theorem statement is now either
wenzelm@18901
  2059
'shows' (a simultaneous conjunction, as before), or 'obtains'
wenzelm@18901
  2060
(essentially a disjunction of cases with local parameters and
wenzelm@18901
  2061
assumptions).  The latter allows to express general elimination rules
wenzelm@18910
  2062
adequately; in this notation common elimination rules look like this:
wenzelm@18901
  2063
wenzelm@18901
  2064
  lemma exE:    -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
wenzelm@18901
  2065
    assumes "EX x. P x"
wenzelm@18901
  2066
    obtains x where "P x"
wenzelm@18901
  2067
wenzelm@18901
  2068
  lemma conjE:  -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
wenzelm@18901
  2069
    assumes "A & B"
wenzelm@18901
  2070
    obtains A and B
wenzelm@18901
  2071
wenzelm@18901
  2072
  lemma disjE:  -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
wenzelm@18901
  2073
    assumes "A | B"
wenzelm@18901
  2074
    obtains
wenzelm@18901
  2075
      A
wenzelm@18901
  2076
    | B
wenzelm@18901
  2077
wenzelm@18910
  2078
The subsequent classical rules even refer to the formal "thesis"
wenzelm@18901
  2079
explicitly:
wenzelm@18901
  2080
wenzelm@18901
  2081
  lemma classical:     -- "(~ thesis ==> thesis) ==> thesis"
wenzelm@18901
  2082
    obtains "~ thesis"
wenzelm@18901
  2083
wenzelm@18910
  2084
  lemma Peirce's_Law:  -- "((thesis ==> something) ==> thesis) ==> thesis"
wenzelm@18910
  2085
    obtains "thesis ==> something"
wenzelm@18901
  2086
wenzelm@18901
  2087
The actual proof of an 'obtains' statement is analogous to that of the
wenzelm@18910
  2088
Isar proof element 'obtain', only that there may be several cases.
wenzelm@18910
  2089
Optional case names may be specified in parentheses; these will be
wenzelm@18910
  2090
available both in the present proof and as annotations in the
wenzelm@18910
  2091
resulting rule, for later use with the 'cases' method (cf. attribute
wenzelm@18910
  2092
case_names).
wenzelm@18901
  2093
wenzelm@21447
  2094
* Isar: the assumptions of a long theorem statement are available as
wenzelm@21447
  2095
"assms" fact in the proof context.  This is more appropriate than the
wenzelm@21447
  2096
(historical) "prems", which refers to all assumptions of the current
wenzelm@21447
  2097
context, including those from the target locale, proof body etc.
wenzelm@21447
  2098
wenzelm@19263
  2099
* Isar: 'print_statement' prints theorems from the current theory or
wenzelm@19263
  2100
proof context in long statement form, according to the syntax of a
wenzelm@19263
  2101
top-level lemma.
wenzelm@19263
  2102
wenzelm@18901
  2103
* Isar: 'obtain' takes an optional case name for the local context
wenzelm@18901
  2104
introduction rule (default "that").
wenzelm@18901
  2105
wenzelm@19587
  2106
* Isar: removed obsolete 'concl is' patterns.  INCOMPATIBILITY, use
wenzelm@19587
  2107
explicit (is "_ ==> ?foo") in the rare cases where this still happens
wenzelm@19587
  2108
to occur.
wenzelm@19587
  2109
wenzelm@19682
  2110
* Pure: syntax "CONST name" produces a fully internalized constant
wenzelm@19682
  2111
according to the current context.  This is particularly useful for
wenzelm@19682
  2112
syntax translations that should refer to internal constant
wenzelm@19682
  2113
representations independently of name spaces.
wenzelm@19682
  2114
wenzelm@21537
  2115
* Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
wenzelm@21537
  2116
instead of "FOO ". This allows multiple binder declarations to coexist
wenzelm@21537
  2117
in the same context.  INCOMPATIBILITY.
wenzelm@21537
  2118
wenzelm@21209
  2119
* Isar/locales: 'notation' provides a robust interface to the 'syntax'
wenzelm@21209
  2120
primitive that also works in a locale context (both for constants and
wenzelm@24950
  2121
fixed variables). Type declaration and internal syntactic representation
wenzelm@24950
  2122
of given constants retrieved from the context. Likewise, the
wenzelm@24950
  2123
'no_notation' command allows to remove given syntax annotations from the
wenzelm@24950
  2124
current context.
wenzelm@19682
  2125
wenzelm@19665
  2126
* Isar/locales: new derived specification elements 'axiomatization',
wenzelm@19665
  2127
'definition', 'abbreviation', which support type-inference, admit
wenzelm@19083
  2128
object-level specifications (equality, equivalence).  See also the
wenzelm@19083
  2129
isar-ref manual.  Examples:
wenzelm@19081
  2130
wenzelm@19665
  2131
  axiomatization
wenzelm@21595
  2132
    eq  (infix "===" 50) where
wenzelm@21595
  2133
    eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
wenzelm@21595
  2134
wenzelm@21595
  2135
  definition "f x y = x + y + 1"
wenzelm@21595
  2136
  definition g where "g x = f x x"
wenzelm@19081
  2137
wenzelm@19363
  2138
  abbreviation
wenzelm@21595
  2139
    neq  (infix "=!=" 50) where
wenzelm@19363
  2140
    "x =!= y == ~ (x === y)"
wenzelm@19081
  2141
wenzelm@19083
  2142
These specifications may be also used in a locale context.  Then the
wenzelm@19083
  2143
constants being introduced depend on certain fixed parameters, and the
wenzelm@19083
  2144
constant name is qualified by the locale base name.  An internal
wenzelm@19083
  2145
abbreviation takes care for convenient input and output, making the
wenzelm@19088
  2146
parameters implicit and using the original short name.  See also
wenzelm@25177
  2147
src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
wenzelm@19083
  2148
entities from a monomorphic theory.
wenzelm@19083
  2149
wenzelm@19083
  2150
Presently, abbreviations are only available 'in' a target locale, but
wenzelm@19363
  2151
not inherited by general import expressions.  Also note that
wenzelm@19363
  2152
'abbreviation' may be used as a type-safe replacement for 'syntax' +
wenzelm@24735
  2153
'translations' in common applications.  The "no_abbrevs" print mode
wenzelm@24735
  2154
prevents folding of abbreviations in term output.
wenzelm@19084
  2155
wenzelm@19682
  2156
Concrete syntax is attached to specified constants in internal form,
wenzelm@19682
  2157
independently of name spaces.  The parse tree representation is
wenzelm@21209
  2158
slightly different -- use 'notation' instead of raw 'syntax', and
wenzelm@19682
  2159
'translations' with explicit "CONST" markup to accommodate this.
wenzelm@19665
  2160
wenzelm@24800
  2161
* Pure/Isar: unified syntax for new-style specification mechanisms
wenzelm@24800
  2162
(e.g.  'definition', 'abbreviation', or 'inductive' in HOL) admits
wenzelm@24800
  2163
full type inference and dummy patterns ("_").  For example:
wenzelm@24735
  2164
wenzelm@24735
  2165
  definition "K x _ = x"
wenzelm@24735
  2166
wenzelm@24738
  2167
  inductive conj for A B
wenzelm@24738
  2168
  where "A ==> B ==> conj A B"
wenzelm@24738
  2169
wenzelm@21735
  2170
* Pure: command 'print_abbrevs' prints all constant abbreviations of
wenzelm@21735
  2171
the current context.  Print mode "no_abbrevs" prevents inversion of
wenzelm@21735
  2172
abbreviations on output.
wenzelm@21735
  2173
wenzelm@24800
  2174
* Isar/locales: improved parameter handling: use of locales "var" and
wenzelm@24800
  2175
"struct" no longer necessary; - parameter renamings are no longer
wenzelm@24800
  2176
required to be injective.  For example, this allows to define
wenzelm@24800
  2177
endomorphisms as locale endom = homom mult mult h.
ballarin@19783
  2178
ballarin@19931
  2179
* Isar/locales: changed the way locales with predicates are defined.
ballarin@19931
  2180
Instead of accumulating the specification, the imported expression is
wenzelm@22126
  2181
now an interpretation.  INCOMPATIBILITY: different normal form of
wenzelm@22126
  2182
locale expressions.  In particular, in interpretations of locales with
wenzelm@22126
  2183
predicates, goals repesenting already interpreted fragments are not
wenzelm@22126
  2184
removed automatically.  Use methods `intro_locales' and
wenzelm@22126
  2185
`unfold_locales'; see below.
wenzelm@22126
  2186
wenzelm@22126
  2187
* Isar/locales: new methods `intro_locales' and `unfold_locales'
wenzelm@22126
  2188
provide backward reasoning on locales predicates.  The methods are
wenzelm@22126
  2189
aware of interpretations and discharge corresponding goals.
wenzelm@22126
  2190
`intro_locales' is less aggressive then `unfold_locales' and does not
wenzelm@22126
  2191
unfold predicates to assumptions.
ballarin@19931
  2192
ballarin@19931
  2193
* Isar/locales: the order in which locale fragments are accumulated
wenzelm@22126
  2194
has changed.  This enables to override declarations from fragments due
wenzelm@22126
  2195
to interpretations -- for example, unwanted simp rules.
ballarin@19931
  2196
ballarin@23920
  2197
* Isar/locales: interpretation in theories and proof contexts has been
ballarin@23920
  2198
extended.  One may now specify (and prove) equations, which are
ballarin@23920
  2199
unfolded in interpreted theorems.  This is useful for replacing
ballarin@23920
  2200
defined concepts (constants depending on locale parameters) by
ballarin@23920
  2201
concepts already existing in the target context.  Example:
ballarin@23920
  2202
ballarin@23920
  2203
  interpretation partial_order ["op <= :: [int, int] => bool"]
ballarin@23920
  2204
    where "partial_order.less (op <=) (x::int) y = (x < y)"
ballarin@23920
  2205
wenzelm@24800
  2206
Typically, the constant `partial_order.less' is created by a
wenzelm@24800
  2207
definition specification element in the context of locale
wenzelm@24800
  2208
partial_order.
wenzelm@24800
  2209
wenzelm@24859
  2210
* Method "induct": improved internal context management to support
wenzelm@24800
  2211
local fixes and defines on-the-fly. Thus explicit meta-level
wenzelm@24800
  2212
connectives !!  and ==> are rarely required anymore in inductive goals
wenzelm@24800
  2213
(using object-logic connectives for this purpose has been long
wenzelm@24800
  2214
obsolete anyway). Common proof patterns are explained in
wenzelm@25177
  2215
src/HOL/Induct/Common_Patterns.thy, see also
wenzelm@25177
  2216
src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
wenzelm@25177
  2217
examples.
wenzelm@24606
  2218
wenzelm@24859
  2219
* Method "induct": improved handling of simultaneous goals. Instead of
wenzelm@24606
  2220
introducing object-level conjunction, the statement is now split into
wenzelm@24606
  2221
several conclusions, while the corresponding symbolic cases are nested
wenzelm@24606
  2222
accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
wenzelm@25177
  2223
see src/HOL/Induct/Common_Patterns.thy, for example.
wenzelm@24606
  2224
wenzelm@24859
  2225
* Method "induct": mutual induction rules are now specified as a list
wenzelm@24800
  2226
of rule sharing the same induction cases. HOL packages usually provide
wenzelm@24606
  2227
foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
wenzelm@24859
  2228
predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
wenzelm@24859
  2229
mutual induction rules differently, i.e. like this:
wenzelm@18506
  2230
wenzelm@18506
  2231
  (induct rule: foo_bar.inducts)
wenzelm@18506
  2232
  (induct set: foo bar)
wenzelm@24859
  2233
  (induct pred: foo bar)
wenzelm@18506
  2234
  (induct type: foo bar)
wenzelm@18506
  2235
wenzelm@18506
  2236
The ML function ProjectRule.projections turns old-style rules into the
wenzelm@18506
  2237
new format.
wenzelm@18506
  2238
wenzelm@24859
  2239
* Method "coinduct": dual of induction, see
wenzelm@18399
  2240
src/HOL/Library/Coinductive_List.thy for various examples.
wenzelm@18399
  2241
wenzelm@24859
  2242
* Method "cases", "induct", "coinduct": the ``(open)'' option is
wenzelm@24859
  2243
considered a legacy feature.
wenzelm@24859
  2244
wenzelm@20919
  2245
* Attribute "symmetric" produces result with standardized schematic
wenzelm@20919
  2246
variables (index 0).  Potential INCOMPATIBILITY.
wenzelm@20919
  2247
wenzelm@22126
  2248
* Simplifier: by default the simplifier trace only shows top level
wenzelm@22126
  2249
rewrites now. That is, trace_simp_depth_limit is set to 1 by
wenzelm@22126
  2250
default. Thus there is less danger of being flooded by the trace. The
wenzelm@22126
  2251
trace indicates where parts have been suppressed.
nipkow@18674
  2252
  
wenzelm@18536
  2253
* Provers/classical: removed obsolete classical version of elim_format
wenzelm@18536
  2254
attribute; classical elim/dest rules are now treated uniformly when
wenzelm@18536
  2255
manipulating the claset.
wenzelm@18536
  2256
wenzelm@18694
  2257
* Provers/classical: stricter checks to ensure that supplied intro,
wenzelm@18694
  2258
dest and elim rules are well-formed; dest and elim rules must have at
wenzelm@18694
  2259
least one premise.
wenzelm@18694
  2260
wenzelm@18694
  2261
* Provers/classical: attributes dest/elim/intro take an optional
wenzelm@18695
  2262
weight argument for the rule (just as the Pure versions).  Weights are
wenzelm@18696
  2263
ignored by automated tools, but determine the search order of single
wenzelm@18694
  2264
rule steps.
paulson@18557
  2265
wenzelm@18536
  2266
* Syntax: input syntax now supports dummy variable binding "%_. b",
wenzelm@18536
  2267
where the body does not mention the bound variable.  Note that dummy
wenzelm@18536
  2268
patterns implicitly depend on their context of bounds, which makes
wenzelm@18536
  2269
"{_. _}" match any set comprehension as expected.  Potential
wenzelm@18536
  2270
INCOMPATIBILITY -- parse translations need to cope with syntactic
wenzelm@18536
  2271
constant "_idtdummy" in the binding position.
wenzelm@18536
  2272
wenzelm@18536
  2273
* Syntax: removed obsolete syntactic constant "_K" and its associated
wenzelm@18536
  2274
parse translation.  INCOMPATIBILITY -- use dummy abstraction instead,
wenzelm@18536
  2275
for example "A -> B" => "Pi A (%_. B)".
wenzelm@17779
  2276
wenzelm@20582
  2277
* Pure: 'class_deps' command visualizes the subclass relation, using
wenzelm@20582
  2278
the graph browser tool.
wenzelm@20582
  2279
wenzelm@24800
  2280
* Pure: 'print_theory' now suppresses certain internal declarations by
wenzelm@24800
  2281
default; use '!' option for full details.
wenzelm@20620
  2282
wenzelm@17865
  2283
nipkow@17806
  2284
*** HOL ***
nipkow@17806
  2285
wenzelm@25129
  2286
* Method "metis" proves goals by applying the Metis general-purpose
wenzelm@25129
  2287
resolution prover (see also http://gilith.com/software/metis/).
wenzelm@25129
  2288
Examples are in the directory MetisExamples.  WARNING: the
wenzelm@25129
  2289
Isabelle/HOL-Metis integration does not yet work properly with
wenzelm@25129
  2290
multi-threading.
wenzelm@25129
  2291
  
wenzelm@25129
  2292
* Command 'sledgehammer' invokes external automatic theorem provers as
wenzelm@25129
  2293
background processes.  It generates calls to the "metis" method if
wenzelm@25129
  2294
successful. These can be pasted into the proof.  Users do not have to
wenzelm@25129
  2295
wait for the automatic provers to return.  WARNING: does not really
wenzelm@25129
  2296
work with multi-threading.
wenzelm@25129
  2297
wenzelm@24804
  2298
* New "auto_quickcheck" feature tests outermost goal statements for
wenzelm@24804
  2299
potential counter-examples.  Controlled by ML references
wenzelm@24804
  2300
auto_quickcheck (default true) and auto_quickcheck_time_limit (default
wenzelm@25129
  2301
5000 milliseconds).  Fails silently if statements is outside of
wenzelm@25129
  2302
executable fragment, or any other codgenerator problem occurs.
wenzelm@24804
  2303
haftmann@25184
  2304
* New constant "undefined" with axiom "undefined x = undefined".
haftmann@25184
  2305
haftmann@25184
  2306
* Added class "HOL.eq", allowing for code generation with polymorphic
haftmann@25184
  2307
equality.
haftmann@25184
  2308
haftmann@25184
  2309
* Some renaming of class constants due to canonical name prefixing in
haftmann@25184
  2310
the new 'class' package:
haftmann@25184
  2311
haftmann@25184
  2312
    HOL.abs ~> HOL.abs_class.abs
haftmann@25184
  2313
    HOL.divide ~> HOL.divide_class.divide
haftmann@25184
  2314
    0 ~> HOL.zero_class.zero
haftmann@25184
  2315
    1 ~> HOL.one_class.one
haftmann@25184
  2316
    op + ~> HOL.plus_class.plus
haftmann@25184
  2317
    op - ~> HOL.minus_class.minus
haftmann@25184
  2318
    uminus ~> HOL.minus_class.uminus
haftmann@25184
  2319
    op * ~> HOL.times_class.times
haftmann@25184
  2320
    op < ~> HOL.ord_class.less
haftmann@25184
  2321
    op <= > HOL.ord_class.less_eq
haftmann@25184
  2322
    Nat.power ~> Power.power_class.power
haftmann@25184
  2323
    Nat.size ~> Nat.size_class.size
haftmann@25184
  2324
    Numeral.number_of ~> Numeral.number_class.number_of
haftmann@25184
  2325
    FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
haftmann@25184
  2326
    FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
haftmann@25184
  2327
    Orderings.min ~> Orderings.ord_class.min
haftmann@25184
  2328
    Orderings.max ~> Orderings.ord_class.max
haftmann@25184
  2329
    Divides.op div ~> Divides.div_class.div
haftmann@25184
  2330
    Divides.op mod ~> Divides.div_class.mod
haftmann@25184
  2331
    Divides.op dvd ~> Divides.div_class.dvd
haftmann@25184
  2332
haftmann@25184
  2333
INCOMPATIBILITY.  Adaptions may be required in the following cases:
haftmann@25184
  2334
haftmann@25184
  2335
a) User-defined constants using any of the names "plus", "minus",
haftmann@25184
  2336
"times", "less" or "less_eq". The standard syntax translations for
haftmann@25184
  2337
"+", "-" and "*" may go wrong.  INCOMPATIBILITY: use more specific
haftmann@25184
  2338
names.
haftmann@25184
  2339
haftmann@25184
  2340
b) Variables named "plus", "minus", "times", "less", "less_eq"
haftmann@25184
  2341
INCOMPATIBILITY: use more specific names.
haftmann@25184
  2342
haftmann@25184
  2343
c) Permutative equations (e.g. "a + b = b + a")
haftmann@25184
  2344
Since the change of names also changes the order of terms, permutative
haftmann@25184
  2345
rewrite rules may get applied in a different order. Experience shows
haftmann@25184
  2346
that this is rarely the case (only two adaptions in the whole Isabelle
haftmann@25184
  2347
distribution).  INCOMPATIBILITY: rewrite proofs
haftmann@25184
  2348
haftmann@25184
  2349
d) ML code directly refering to constant names
haftmann@25184
  2350
This in general only affects hand-written proof tactics, simprocs and
haftmann@25184
  2351
so on.  INCOMPATIBILITY: grep your sourcecode and replace names.
haftmann@25184
  2352
Consider using @{const_name} antiquotation.
haftmann@25184
  2353
haftmann@25184
  2354
* New class "default" with associated constant "default".
haftmann@25184
  2355
haftmann@25184
  2356
* Function "sgn" is now overloaded and available on int, real, complex
haftmann@25184
  2357
(and other numeric types), using class "sgn".  Two possible defs of
haftmann@25184
  2358
sgn are given as equational assumptions in the classes sgn_if and
haftmann@25184
  2359
sgn_div_norm; ordered_idom now also inherits from sgn_if.
haftmann@25184
  2360
INCOMPATIBILITY.
haftmann@25184
  2361
haftmann@25184
  2362
* Locale "partial_order" now unified with class "order" (cf. theory
haftmann@25184
  2363
Orderings), added parameter "less".  INCOMPATIBILITY.
haftmann@25184
  2364
haftmann@25184
  2365
* Renamings in classes "order" and "linorder": facts "refl", "trans" and
haftmann@25184
  2366
"cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
haftmann@25184
  2367
clashes with HOL "refl" and "trans".  INCOMPATIBILITY.
haftmann@25184
  2368
haftmann@25184
  2369
* Classes "order" and "linorder": potential INCOMPATIBILITY due to
haftmann@25184
  2370
changed order of proof goals in instance proofs.
haftmann@25184
  2371
haftmann@25184
  2372
* The transitivity reasoner for partial and linear orders is set up
haftmann@25184
  2373
for classes "order" and "linorder".  Instances of the reasoner are available
haftmann@25184
  2374
in all contexts importing or interpreting the corresponding locales.
haftmann@25184
  2375
Method "order" invokes the reasoner separately; the reasoner
haftmann@25184
  2376
is also integrated with the Simplifier as a solver.  Diagnostic
haftmann@25184
  2377
command 'print_orders' shows the available instances of the reasoner
haftmann@25184
  2378
in the current context.
haftmann@25184
  2379
haftmann@25184
  2380
* Localized monotonicity predicate in theory "Orderings"; integrated
haftmann@25184
  2381
lemmas max_of_mono and min_of_mono with this predicate.
haftmann@25184
  2382
INCOMPATIBILITY.
haftmann@25184
  2383
haftmann@25184
  2384
* Formulation of theorem "dense" changed slightly due to integration
haftmann@25184
  2385
with new class dense_linear_order.
haftmann@25184
  2386
haftmann@25184
  2387
* Uniform lattice theory development in HOL.
haftmann@25184
  2388
haftmann@25184
  2389
    constants "meet" and "join" now named "inf" and "sup"
haftmann@25184
  2390
    constant "Meet" now named "Inf"
haftmann@25184
  2391
haftmann@25184
  2392
    classes "meet_semilorder" and "join_semilorder" now named
haftmann@25184
  2393
      "lower_semilattice" and "upper_semilattice"
haftmann@25184
  2394
    class "lorder" now named "lattice"
haftmann@25184
  2395
    class "comp_lat" now named "complete_lattice"
haftmann@25184
  2396
haftmann@25184
  2397
    Instantiation of lattice classes allows explicit definitions
haftmann@25184
  2398
    for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
haftmann@25184
  2399
haftmann@25184
  2400
  INCOMPATIBILITY.  Theorem renames:
haftmann@25184
  2401
haftmann@25184
  2402
    meet_left_le            ~> inf_le1
haftmann@25184
  2403
    meet_right_le           ~> inf_le2
haftmann@25184
  2404
    join_left_le            ~> sup_ge1
haftmann@25184
  2405
    join_right_le           ~> sup_ge2
haftmann@25184
  2406
    meet_join_le            ~> inf_sup_ord
haftmann@25184
  2407
    le_meetI                ~> le_infI
haftmann@25184
  2408
    join_leI                ~> le_supI
haftmann@25184
  2409
    le_meet                 ~> le_inf_iff
haftmann@25184
  2410
    le_join                 ~> ge_sup_conv
haftmann@25184
  2411
    meet_idempotent         ~> inf_idem
haftmann@25184
  2412
    join_idempotent         ~> sup_idem
haftmann@25184
  2413
    meet_comm               ~> inf_commute
haftmann@25184
  2414
    join_comm               ~> sup_commute
haftmann@25184
  2415
    meet_leI1               ~> le_infI1
haftmann@25184
  2416
    meet_leI2               ~> le_infI2
haftmann@25184
  2417
    le_joinI1               ~> le_supI1
haftmann@25184
  2418
    le_joinI2               ~> le_supI2
haftmann@25184
  2419
    meet_assoc              ~> inf_assoc
haftmann@25184
  2420
    join_assoc              ~> sup_assoc
haftmann@25184
  2421
    meet_left_comm          ~> inf_left_commute
haftmann@25184
  2422
    meet_left_idempotent    ~> inf_left_idem
haftmann@25184
  2423
    join_left_comm          ~> sup_left_commute
haftmann@25184
  2424
    join_left_idempotent    ~> sup_left_idem
haftmann@25184
  2425
    meet_aci                ~> inf_aci
haftmann@25184
  2426
    join_aci                ~> sup_aci
haftmann@25184
  2427
    le_def_meet             ~> le_iff_inf
haftmann@25184
  2428
    le_def_join             ~> le_iff_sup
haftmann@25184
  2429
    join_absorp2            ~> sup_absorb2
haftmann@25184
  2430
    join_absorp1            ~> sup_absorb1
haftmann@25184
  2431
    meet_absorp1            ~> inf_absorb1
haftmann@25184
  2432
    meet_absorp2            ~> inf_absorb2
haftmann@25184
  2433
    meet_join_absorp        ~> inf_sup_absorb
haftmann@25184
  2434
    join_meet_absorp        ~> sup_inf_absorb
haftmann@25184
  2435
    distrib_join_le         ~> distrib_sup_le
haftmann@25184
  2436
    distrib_meet_le         ~> distrib_inf_le
haftmann@25184
  2437
haftmann@25184
  2438
    add_meet_distrib_left   ~> add_inf_distrib_left
haftmann@25184
  2439
    add_join_distrib_left   ~> add_sup_distrib_left
haftmann@25184
  2440
    is_join_neg_meet        ~> is_join_neg_inf
haftmann@25184
  2441
    is_meet_neg_join        ~> is_meet_neg_sup
haftmann@25184
  2442
    add_meet_distrib_right  ~> add_inf_distrib_right
haftmann@25184
  2443
    add_join_distrib_right  ~> add_sup_distrib_right
haftmann@25184
  2444
    add_meet_join_distribs  ~> add_sup_inf_distribs
haftmann@25184
  2445
    join_eq_neg_meet        ~> sup_eq_neg_inf
haftmann@25184
  2446
    meet_eq_neg_join        ~> inf_eq_neg_sup
haftmann@25184
  2447
    add_eq_meet_join        ~> add_eq_inf_sup
haftmann@25184
  2448
    meet_0_imp_0            ~> inf_0_imp_0
haftmann@25184
  2449
    join_0_imp_0            ~> sup_0_imp_0
haftmann@25184
  2450
    meet_0_eq_0             ~> inf_0_eq_0
haftmann@25184
  2451
    join_0_eq_0             ~> sup_0_eq_0
haftmann@25184
  2452
    neg_meet_eq_join        ~> neg_inf_eq_sup
haftmann@25184
  2453
    neg_join_eq_meet        ~> neg_sup_eq_inf
haftmann@25184
  2454
    join_eq_if              ~> sup_eq_if
haftmann@25184
  2455
haftmann@25184
  2456
    mono_meet               ~> mono_inf
haftmann@25184
  2457
    mono_join               ~> mono_sup
haftmann@25184
  2458
    meet_bool_eq            ~> inf_bool_eq
haftmann@25184
  2459
    join_bool_eq            ~> sup_bool_eq
haftmann@25184
  2460
    meet_fun_eq             ~> inf_fun_eq
haftmann@25184
  2461
    join_fun_eq             ~> sup_fun_eq
haftmann@25184
  2462
    meet_set_eq             ~> inf_set_eq
haftmann@25184
  2463
    join_set_eq             ~> sup_set_eq
haftmann@25184
  2464
    meet1_iff               ~> inf1_iff
haftmann@25184
  2465
    meet2_iff               ~> inf2_iff
haftmann@25184
  2466
    meet1I                  ~> inf1I
haftmann@25184
  2467
    meet2I                  ~> inf2I
haftmann@25184
  2468
    meet1D1                 ~> inf1D1
haftmann@25184
  2469
    meet2D1                 ~> inf2D1
haftmann@25184
  2470
    meet1D2                 ~> inf1D2
haftmann@25184
  2471
    meet2D2                 ~> inf2D2
haftmann@25184
  2472
    meet1E                  ~> inf1E
haftmann@25184
  2473
    meet2E                  ~> inf2E
haftmann@25184
  2474
    join1_iff               ~> sup1_iff
haftmann@25184
  2475
    join2_iff               ~> sup2_iff
haftmann@25184
  2476
    join1I1                 ~> sup1I1
haftmann@25184
  2477
    join2I1                 ~> sup2I1
haftmann@25184
  2478
    join1I1                 ~> sup1I1
haftmann@25184
  2479
    join2I2                 ~> sup1I2
haftmann@25184
  2480
    join1CI                 ~> sup1CI
haftmann@25184
  2481
    join2CI                 ~> sup2CI
haftmann@25184
  2482
    join1E                  ~> sup1E
haftmann@25184
  2483
    join2E                  ~> sup2E
haftmann@25184
  2484
haftmann@25184
  2485
    is_meet_Meet            ~> is_meet_Inf
haftmann@25184
  2486
    Meet_bool_def           ~> Inf_bool_def
haftmann@25184
  2487
    Meet_fun_def            ~> Inf_fun_def
haftmann@25184
  2488
    Meet_greatest           ~> Inf_greatest
haftmann@25184
  2489
    Meet_lower              ~> Inf_lower
haftmann@25184
  2490
    Meet_set_def            ~> Inf_set_def
haftmann@25184
  2491
haftmann@25184
  2492
    Sup_def                 ~> Sup_Inf
haftmann@25184
  2493
    Sup_bool_eq             ~> Sup_bool_def
haftmann@25184
  2494
    Sup_fun_eq              ~> Sup_fun_def
haftmann@25184
  2495
    Sup_set_eq              ~> Sup_set_def
haftmann@25184
  2496
haftmann@25184
  2497
    listsp_meetI            ~> listsp_infI
haftmann@25184
  2498
    listsp_meet_eq          ~> listsp_inf_eq
haftmann@25184
  2499
haftmann@25184
  2500
    meet_min                ~> inf_min
haftmann@25184
  2501
    join_max                ~> sup_max
haftmann@25184
  2502
haftmann@25184
  2503
* Added syntactic class "size"; overloaded constant "size" now has
haftmann@25184
  2504
type "'a::size ==> bool"
haftmann@25184
  2505
wenzelm@24800
  2506
* Internal reorganisation of `size' of datatypes: size theorems
wenzelm@24800
  2507
"foo.size" are no longer subsumed by "foo.simps" (but are still
wenzelm@24800
  2508
simplification rules by default!); theorems "prod.size" now named
haftmann@25184
  2509
"*.size".
haftmann@25184
  2510
haftmann@25184
  2511
* Class "div" now inherits from class "times" rather than "type".
haftmann@25184
  2512
INCOMPATIBILITY.
wenzelm@24800
  2513
wenzelm@24800
  2514
* HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
wenzelm@24800
  2515
Linorder etc.  have disappeared; operations defined in terms of
wenzelm@24800
  2516
fold_set now are named Inf_fin, Sup_fin.  INCOMPATIBILITY.
wenzelm@24800
  2517
wenzelm@25129
  2518
* HOL/Nat: neq0_conv no longer declared as iff.  INCOMPATIBILITY.
wenzelm@25129
  2519
wenzelm@24800
  2520
* HOL-Word: New extensive library and type for generic, fixed size
wenzelm@24800
  2521
machine words, with arithemtic, bit-wise, shifting and rotating
wenzelm@24800
  2522
operations, reflection into int, nat, and bool lists, automation for
wenzelm@24800
  2523
linear arithmetic (by automatic reflection into nat or int), including
wenzelm@24800
  2524
lemmas on overflow and monotonicity.  Instantiated to all appropriate
wenzelm@24800
  2525
arithmetic type classes, supporting automatic simplification of
wenzelm@24800
  2526
numerals on all operations.
kleing@24333
  2527
kleing@24333
  2528
* Library/Boolean_Algebra: locales for abstract boolean algebras.
kleing@24333
  2529
kleing@24333
  2530
* Library/Numeral_Type: numbers as types, e.g. TYPE(32).
kleing@24333
  2531
haftmann@23850
  2532
* Code generator library theories:
haftmann@24993
  2533
  - Code_Integer represents HOL integers by big integer literals in target
haftmann@23850
  2534
    languages.
haftmann@24993
  2535
  - Code_Char represents HOL characters by character literals in target
haftmann@23850
  2536
    languages.
haftmann@24993
  2537
  - Code_Char_chr like Code_Char, but also offers treatment of character
haftmann@24993
  2538
    codes; includes Code_Integer.
wenzelm@24800
  2539
  - Executable_Set allows to generate code for finite sets using lists.
wenzelm@24800
  2540
  - Executable_Rat implements rational numbers as triples (sign, enumerator,
haftmann@23850
  2541
    denominator).
wenzelm@24800
  2542
  - Executable_Real implements a subset of real numbers, namly those
haftmann@23850
  2543
    representable by rational numbers.
wenzelm@24800
  2544
  - Efficient_Nat implements natural numbers by integers, which in general will
haftmann@23850
  2545
    result in higher efficency; pattern matching with 0/Suc is eliminated;
haftmann@24993
  2546
    includes Code_Integer.
haftmann@24993
  2547
  - Code_Index provides an additional datatype index which is mapped to
haftmann@24993
  2548
    target-language built-in integers.
haftmann@26355
  2549
  - Code_Message provides an additional datatype message_string which is isomorphic to
haftmann@24993
  2550
    strings; messages are mapped to target-language strings.
haftmann@23850
  2551
berghofe@23783
  2552
* New package for inductive predicates
berghofe@23783
  2553
berghofe@23783
  2554
  An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
berghofe@23783
  2555
berghofe@23783
  2556
    inductive
berghofe@23783
  2557
      p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
berghofe@23783
  2558
      for z_1 :: U_1 and ... and z_n :: U_m
berghofe@23783
  2559
    where
berghofe@23783
  2560
      rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
berghofe@23783
  2561
    | ...
berghofe@23783
  2562
wenzelm@24800
  2563
  with full support for type-inference, rather than
berghofe@23783
  2564
berghofe@23783
  2565
    consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
berghofe@23783
  2566
berghofe@23783
  2567
    abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
berghofe@23783
  2568
    where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
berghofe@23783
  2569
berghofe@23783
  2570
    inductive "s z_1 ... z_m"
berghofe@23783
  2571
    intros
berghofe@23783
  2572
      rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
berghofe@23783
  2573
      ...
berghofe@23783
  2574
berghofe@23783
  2575
  For backward compatibility, there is a wrapper allowing inductive
berghofe@23783
  2576
  sets to be defined with the new package via
berghofe@23783
  2577
berghofe@23783
  2578
    inductive_set
berghofe@23783
  2579
      s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
berghofe@23783
  2580
      for z_1 :: U_1 and ... and z_n :: U_m
berghofe@23783
  2581
    where
berghofe@23783
  2582
      rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
berghofe@23783
  2583
    | ...
berghofe@23783
  2584
berghofe@23783
  2585
  or
berghofe@23783
  2586
berghofe@23783
  2587
    inductive_set
berghofe@23783
  2588
      s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
berghofe@23783
  2589
      and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
berghofe@23783
  2590
      for z_1 :: U_1 and ... and z_n :: U_m
berghofe@23783
  2591
    where
berghofe@23783
  2592
      "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
berghofe@23783
  2593
    | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
berghofe@23783
  2594
    | ...
berghofe@23783
  2595
berghofe@23783
  2596
  if the additional syntax "p ..." is required.
berghofe@23783
  2597
wenzelm@25177
  2598
  Numerous examples can be found in the subdirectories src/HOL/Auth,
wenzelm@25177
  2599
  src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
berghofe@23783
  2600
berghofe@23783
  2601
  INCOMPATIBILITIES:
berghofe@23783
  2602
berghofe@23783
  2603
  - Since declaration and definition of inductive sets or predicates
wenzelm@24800
  2604
    is no longer separated, abbreviations involving the newly
wenzelm@24800
  2605
    introduced sets or predicates must be specified together with the
wenzelm@24800
  2606
    introduction rules after the 'where' keyword (see above), rather
wenzelm@24800
  2607
    than before the actual inductive definition.
wenzelm@24800
  2608
wenzelm@24800
  2609
  - The variables in induction and elimination rules are now
wenzelm@24800
  2610
    quantified in the order of their occurrence in the introduction
wenzelm@24800
  2611
    rules, rather than in alphabetical order. Since this may break
wenzelm@24800
  2612
    some proofs, these proofs either have to be repaired, e.g. by
wenzelm@24800
  2613
    reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
wenzelm@24800
  2614
    statements of the form
berghofe@23783
  2615
berghofe@23783
  2616
      case (rule_i a_i_1 ... a_i_{k_i})
berghofe@23783
  2617
berghofe@23783
  2618
    or the old order of quantification has to be restored by explicitly adding
berghofe@23783
  2619
    meta-level quantifiers in the introduction rules, i.e.
berghofe@23783
  2620
berghofe@23783
  2621
      | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
berghofe@23783
  2622
berghofe@23783
  2623
  - The format of the elimination rules is now
berghofe@23783
  2624