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