enabled MaSh by default -- set 'MaSh' to 'none' in Isabelle Plugin Options to disable
1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Document antiquotation @{url} produces markup for the given URL,
10 which results in an active hyperlink within the text.
12 * Document antiquotation @{file_unchecked} is like @{file}, but does
13 not check existence within the file-system.
15 * Discontinued legacy_isub_isup, which was a temporary Isabelle/ML
16 workaround in Isabelle2013-1. The prover process no longer accepts
17 old identifier syntax with \<^isub> or \<^isup>.
19 * Syntax of document antiquotation @{rail} now uses \<newline> instead
20 of "\\", to avoid the optical illusion of escaped backslash within
21 string token. Minor INCOMPATIBILITY.
23 * Lexical syntax (inner and outer) supports text cartouches with
24 arbitrary nesting, and without escapes of quotes etc. The Prover IDE
25 supports input via ` (backquote).
27 * The outer syntax categories "text" (for formal comments and document
28 markup commands) and "altstring" (for literal fact references) allow
29 cartouches as well, in addition to the traditional mix of quotations.
31 * More static checking of proof methods, which allows the system to
32 form a closure over the concrete syntax. Method arguments should be
33 processed in the original proof context as far as possible, before
34 operating on the goal state. In any case, the standard discipline for
35 subgoal-addressing needs to be observed: no subgoals or a subgoal
36 number that is out of range produces an empty result sequence, not an
37 exception. Potential INCOMPATIBILITY for non-conformant tactical
40 * Support for official Standard ML within the Isabelle context.
41 Command 'SML_file' reads and evaluates the given Standard ML file.
42 Toplevel bindings are stored within the theory context; the initial
43 environment is restricted to the Standard ML implementation of
44 Poly/ML, without the add-ons of Isabelle/ML. Commands 'SML_import'
45 and 'SML_export' allow to exchange toplevel bindings between the two
46 separate environments. See also ~~/src/Tools/SML/Examples.thy for
50 *** Prover IDE -- Isabelle/Scala/jEdit ***
52 * Improved syntactic and semantic completion mechanism:
54 - No completion for Isar keywords that have already been recognized
55 by the prover, e.g. ":" within accepted Isar syntax looses its
56 meaning as abbreviation for symbol "\<in>".
58 - Completion context provides information about embedded languages
59 of Isabelle: keywords are only completed for outer syntax, symbols
60 or antiquotations for languages that support them. E.g. no symbol
61 completion for ML source, but within ML strings, comments,
64 - Support for semantic completion based on failed name space lookup.
65 The error produced by the prover contains information about
66 alternative names that are accessible in a particular position.
67 This may be used with explicit completion (C+b) or implicit
68 completion after some delay.
70 - Semantic completions may get extended by appending a suffix of
71 underscores to an already recognized name, e.g. "foo_" to complete
72 "foo" or "foobar" if these are known in the context. The special
73 identifier "__" serves as a wild-card in this respect: it
74 completes to the full collection of names from the name space
75 (truncated according to the system option "completion_limit").
77 - Syntax completion of the editor and semantic completion of the
78 prover are merged. Since the latter requires a full round-trip of
79 document update to arrive, the default for option
80 jedit_completion_delay has been changed to 0.5s to improve the
83 - Option jedit_completion_immediate may now get used with
84 jedit_completion_delay > 0, to complete symbol abbreviations
85 aggressively while benefiting from combined syntactic and semantic
88 - Support for simple completion templates (with single
89 place-holder), e.g. "`" for text cartouche, or "@{" for
92 - Support for path completion within the formal text, based on
95 - Improved treatment of completion vs. various forms of jEdit text
96 selection (multiple selections, rectangular selections,
97 rectangular selection as "tall caret").
99 - More reliable treatment of GUI events vs. completion popups: avoid
100 loosing keystrokes with slow / remote graphics displays.
102 * Integrated spell-checker for document text, comments etc. with
103 completion popup and context-menu. See also "Plugin Options /
104 Isabelle / General / Spell Checker" for some system options.
106 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.
107 Open text buffers take precedence over copies within the file-system.
109 * Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for
112 * Document panel: simplied interaction where every single mouse click
113 (re)opens document via desktop environment or as jEdit buffer.
115 * More general "Query" panel supersedes "Find" panel, with GUI access
116 to commands 'find_theorems' and 'find_consts', as well as print
117 operations for the context. Minor incompatibility in keyboard
118 shortcuts etc.: replace action isabelle-find by isabelle-query.
120 * Search field for all output panels ("Output", "Query", "Info" etc.)
121 to highlight text via regular expression.
123 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /
124 General") allows to specify additional print modes for the prover
125 process, without requiring old-fashioned command-line invocation of
126 "isabelle jedit -m MODE".
128 * New panel: Simplifier trace. Provides an interactive view of the
129 simplification process, enabled by the newly-introduced
130 "simplifier_trace" declaration.
132 * Support for Navigator plugin (with toolbar buttons).
134 * More support for remote files (e.g. http) using standard Java
135 networking operations instead of jEdit virtual file-systems.
137 * Improved Console/Scala plugin: more uniform scala.Console output,
138 more robust treatment of threads and interrupts.
140 * Improved management of dockable windows: clarified keyboard focus
141 and window placement wrt. main editor view; optional menu item to
142 "Detach" a copy where this makes sense.
147 * Basic constants of Pure use more conventional names and are always
148 qualified. Rare INCOMPATIBILITY, but with potentially serious
149 consequences, notably for tools in Isabelle/ML. The following
150 renaming needs to be applied:
156 dummy_pattern ~> Pure.dummy_pattern
158 Systematic porting works by using the following theory setup on a
159 *previous* Isabelle version to introduce the new name accesses for the
165 |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="
166 |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"
167 |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"
168 |> Sign.restore_naming thy
171 Thus ML antiquotations like @{const_name Pure.eq} may be used already.
172 Later the application is moved to the current Isabelle version, and
173 the auxiliary aliases are deleted.
175 * Low-level type-class commands 'classes', 'classrel', 'arities' have
176 been discontinued to avoid the danger of non-trivial axiomatization
177 that is not immediately visible. INCOMPATIBILITY, use regular
178 'instance' with proof. The required OFCLASS(...) theorem might be
179 postulated via 'axiomatization' beforehand, or the proof finished
180 trivially if the underlying class definition is made vacuous (without
181 any assumptions). See also Isabelle/ML operations
182 Axclass.axiomatize_class, Axclass.axiomatize_classrel,
183 Axclass.axiomatize_arity.
185 * Attributes "where" and "of" allow an optional context of local
186 variables ('for' declaration): these variables become schematic in the
187 instantiated theorem.
189 * Obsolete attribute "standard" has been discontinued (legacy since
190 Isabelle2012). Potential INCOMPATIBILITY, use explicit 'for' context
191 where instantiations with schematic variables are intended (for
192 declaration commands like 'lemmas' or attributes like "of"). The
193 following temporary definition may help to port old applications:
195 attribute_setup standard =
196 "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"
198 * More thorough check of proof context for goal statements and
199 attributed fact expressions (concerning background theory, declared
200 hyps). Potential INCOMPATIBILITY, tools need to observe standard
201 context discipline. See also Assumption.add_assumes and the more
202 primitive Thm.assume_hyps.
204 * Inner syntax token language allows regular quoted strings "..."
205 (only makes sense in practice, if outer syntax is delimited
211 * Command and antiquotation ''value'' are hardcoded against nbe and
212 ML now. Minor INCOMPATIBILITY.
214 * Separate command ''approximate'' for approximative computation
215 in Decision_Procs/Approximation. Minor INCOMPATIBILITY.
217 * Adjustion of INF and SUP operations:
218 * Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.
219 * Consolidated theorem names containing INFI and SUPR: have INF
220 and SUP instead uniformly.
221 * More aggressive normalization of expressions involving INF and Inf
223 * INF_image and SUP_image do not unfold composition.
224 * Dropped facts INF_comp, SUP_comp.
225 * Default congruence rules strong_INF_cong and strong_SUP_cong,
226 with simplifier implication in premises. Generalize and replace
227 former INT_cong, SUP_cong
230 * Swapped orientation of facts image_comp and vimage_comp:
231 image_compose ~> image_comp [symmetric]
232 image_comp ~> image_comp [symmetric]
233 vimage_compose ~> vimage_comp [symmetric]
234 vimage_comp ~> vimage_comp [symmetric]
237 * Simplifier: Enhanced solver of preconditions of rewrite rules
238 can now deal with conjunctions.
239 For help with converting proofs, the old behaviour of the simplifier
240 can be restored like this: declare/using [[simp_legacy_precond]]
241 This configuration option will disappear again in the future.
244 * Abandoned fact collection "word_arith_alts", which is a
245 duplicate of "word_arith_wis".
246 * Dropped first (duplicated) element in fact collections
247 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",
248 "uint_word_arith_bintrs".
250 * Code generator: enforce case of identifiers only for strict
251 target language requirements. INCOMPATIBILITY.
253 * Code generator: explicit proof contexts in many ML interfaces.
256 * Code generator: minimize exported identifiers by default.
257 Minor INCOMPATIBILITY.
259 * Code generation for SML and OCaml: dropped arcane "no_signatures" option.
260 Minor INCOMPATIBILITY.
262 * Simproc "finite_Collect" is no longer enabled by default, due to
263 spurious crashes and other surprises. Potential INCOMPATIBILITY.
265 * Moved new (co)datatype package and its dependencies from "HOL-BNF" to "HOL".
266 The "bnf", "wrap_free_constructors", "datatype_new", "codatatype",
267 "primcorec", and "primcorecursive" commands are now part of "Main".
269 FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)
270 Library/Wfrec.thy ~> Wfrec.thy
271 Library/Zorn.thy ~> Zorn.thy
272 Cardinals/Order_Relation.thy ~> Order_Relation.thy
273 Library/Order_Union.thy ~> Cardinals/Order_Union.thy
274 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy
275 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy
276 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy
277 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy
278 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy
279 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy
280 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy
281 BNF/BNF_Comp.thy ~> BNF_Comp.thy
282 BNF/BNF_Def.thy ~> BNF_Def.thy
283 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy
284 BNF/BNF_GFP.thy ~> BNF_GFP.thy
285 BNF/BNF_LFP.thy ~> BNF_LFP.thy
286 BNF/BNF_Util.thy ~> BNF_Util.thy
287 BNF/Coinduction.thy ~> Coinduction.thy
288 BNF/More_BNFs.thy ~> Library/More_BNFs.thy
289 BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy
290 BNF/Examples/* ~> BNF_Examples/*
292 Wellorder_Extension.thy (split from Zorn.thy)
293 Library/Cardinal_Notations.thy
294 Library/BNF_Axomatization.thy
295 BNF_Examples/Misc_Primcorec.thy
296 BNF_Examples/Stream_Processor.thy
297 Discontinued theories:
299 BNF/Equiv_Relations_More.thy
302 * New (co)datatype package:
303 * "primcorec" is fully implemented.
304 * "datatype_new" generates size functions ("size_xxx" and "size") as
306 * BNFs are integrated with the Lifting tool and new-style (co)datatypes
309 datatype_new_compat ~> datatype_compat
310 primrec_new ~> primrec
311 wrap_free_constructors ~> free_constructors
313 * The generated constants "xxx_case" and "xxx_rec" have been renamed
314 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
316 * The constant "xxx_(un)fold" and related theorems are no longer generated.
317 Use "xxx_(co)rec" or define "xxx_(un)fold" manually using "prim(co)rec".
319 * No discriminators are generated for nullary constructors by default,
320 eliminating the need for the odd "=:" syntax.
322 * No discriminators or selectors are generated by default by
323 "datatype_new", unless custom names are specified or the new
324 "discs_sels" option is passed.
327 * Old datatype package:
328 * The generated theorems "xxx.cases" and "xxx.recs" have been renamed
329 "xxx.case" and "xxx.rec" (e.g., "sum.cases" -> "sum.case").
331 * The generated constants "xxx_case", "xxx_rec", and "xxx_size" have been
332 renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g., "prod_case" ~>
336 * The types "'a list" and "'a option", their set and map functions, their
337 relators, and their selectors are now produced using the new BNF-based
340 Option.set ~> set_option
341 Option.map ~> map_option
342 option_rel ~> rel_option
344 set_def ~> set_rec[abs_def]
345 map_def ~> map_rec[abs_def]
346 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")
347 option.recs ~> option.rec
348 list_all2_def ~> list_all2_iff
349 set.simps ~> set_simps (or the slightly different "list.set")
350 map.simps ~> list.map
351 hd.simps ~> list.sel(1)
352 tl.simps ~> list.sel(2-3)
353 the.simps ~> option.sel
356 * The following map functions and relators have been renamed:
363 filter_rel ~> rel_filter
364 fset_rel ~> rel_fset (in "Library/FSet.thy")
365 cset_rel ~> rel_cset (in "Library/Countable_Set_Type.thy")
366 vset ~> rel_vset (in "Library/Quotient_Set.thy")
369 Cardinals/Ordinal_Arithmetic.thy
372 * Theory reorganizations:
373 * Big_Operators.thy ~> Groups_Big.thy and Lattices_Big.thy
375 * New internal SAT solver "cdclite" that produces models and proof traces.
376 This solver replaces the internal SAT solvers "enumerate" and "dpll".
377 Applications that explicitly used one of these two SAT solvers should
378 use "cdclite" instead. In addition, "cdclite" is now the default SAT
379 solver for the "sat" and "satx" proof methods and corresponding tactics;
380 the old default can be restored using
381 "declare [[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY.
384 * A new version of the SMT module, temporarily called "SMT2", uses SMT-LIB 2
385 and supports recent versions of Z3 (e.g., 4.3). The new proof method is
386 called "smt2". CVC3 and CVC4 are also supported as oracles. Yices is no
387 longer supported, because no version of the solver can handle both
388 SMT-LIB 2 and quantifiers.
391 - Z3 can now produce Isar proofs.
393 - New SML-based learning engines eliminate the dependency on Python
394 and increase performance and reliability.
395 - MaSh and MeSh are now used by default together with the traditional
396 MePo (Meng-Paulson) relevance filter. To disable MaSh, set the "MaSh"
397 system option in Plugin Options / Isabelle / General to "none". Other
398 allowed values include "sml" (for the default SML engine) and "py"
399 (for the old Python engine).
403 isar_compress ~> compress
408 - Removed legacy proof method 'metisFT'. Use 'metis (full_types)' instead.
411 * Try0: Added 'algebra' and 'meson' to the set of proof methods.
413 * Command renaming: enriched_type ~> functor. INCOMPATIBILITY.
415 * The symbol "\<newline>" may be used within char or string literals
416 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
418 * Activation of Z3 now works via "z3_non_commercial" system option
419 (without requiring restart), instead of former settings variable
420 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu
421 Plugin Options / Isabelle / General.
423 * "declare [[code abort: ...]]" replaces "code_abort ...".
426 * "declare [[code drop: ...]]" drops all code equations associated
427 with the given constants.
429 * Abolished slightly odd global lattice interpretation for min/max.
432 min_max.inf_assoc ~> min.assoc
433 min_max.inf_commute ~> min.commute
434 min_max.inf_left_commute ~> min.left_commute
435 min_max.inf_idem ~> min.idem
436 min_max.inf_left_idem ~> min.left_idem
437 min_max.inf_right_idem ~> min.right_idem
438 min_max.sup_assoc ~> max.assoc
439 min_max.sup_commute ~> max.commute
440 min_max.sup_left_commute ~> max.left_commute
441 min_max.sup_idem ~> max.idem
442 min_max.sup_left_idem ~> max.left_idem
443 min_max.sup_inf_distrib1 ~> max_min_distrib2
444 min_max.sup_inf_distrib2 ~> max_min_distrib1
445 min_max.inf_sup_distrib1 ~> min_max_distrib2
446 min_max.inf_sup_distrib2 ~> min_max_distrib1
447 min_max.distrib ~> min_max_distribs
448 min_max.inf_absorb1 ~> min.absorb1
449 min_max.inf_absorb2 ~> min.absorb2
450 min_max.sup_absorb1 ~> max.absorb1
451 min_max.sup_absorb2 ~> max.absorb2
452 min_max.le_iff_inf ~> min.absorb_iff1
453 min_max.le_iff_sup ~> max.absorb_iff2
454 min_max.inf_le1 ~> min.cobounded1
455 min_max.inf_le2 ~> min.cobounded2
456 le_maxI1, min_max.sup_ge1 ~> max.cobounded1
457 le_maxI2, min_max.sup_ge2 ~> max.cobounded2
458 min_max.le_infI1 ~> min.coboundedI1
459 min_max.le_infI2 ~> min.coboundedI2
460 min_max.le_supI1 ~> max.coboundedI1
461 min_max.le_supI2 ~> max.coboundedI2
462 min_max.less_infI1 ~> min.strict_coboundedI1
463 min_max.less_infI2 ~> min.strict_coboundedI2
464 min_max.less_supI1 ~> max.strict_coboundedI1
465 min_max.less_supI2 ~> max.strict_coboundedI2
466 min_max.inf_mono ~> min.mono
467 min_max.sup_mono ~> max.mono
468 min_max.le_infI, min_max.inf_greatest ~> min.boundedI
469 min_max.le_supI, min_max.sup_least ~> max.boundedI
470 min_max.le_inf_iff ~> min.bounded_iff
471 min_max.le_sup_iff ~> max.bounded_iff
473 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
474 min.left_commute, min.left_idem, max.commute, max.assoc,
475 max.left_commute, max.left_idem directly.
477 For min_max.inf_sup_ord, prefer (one of) min.cobounded1, min.cobounded2,
478 max.cobounded1m max.cobounded2 directly.
480 For min_ac or max_ac, prefer more general collection ac_simps.
484 * Word library: bit representations prefer type bool over type bit.
487 * Theorem disambiguation Inf_le_Sup (on finite sets) ~> Inf_fin_le_Sup_fin.
490 * Code generations are provided for make, fields, extend and truncate
491 operations on records.
493 * Qualified constant names Wellfounded.acc, Wellfounded.accp.
496 * Fact generalization and consolidation:
497 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
500 * Purely algebraic definition of even. Fact generalization and consolidation:
501 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
502 even_zero_(nat|int) ~> even_zero
505 * Abolished neg_numeral.
506 * Canonical representation for minus one is "- 1".
507 * Canonical representation for other negative numbers is "- (numeral _)".
508 * When devising rule sets for number calculation, consider the
509 following canonical cases: 0, 1, numeral _, - 1, - numeral _.
510 * HOLogic.dest_number also recognizes numerals in non-canonical forms
511 like "numeral One", "- numeral One", "- 0" and even "- ... - _".
512 * Syntax for negative numerals is mere input syntax.
515 * Elimination of fact duplicates:
516 equals_zero_I ~> minus_unique
517 diff_eq_0_iff_eq ~> right_minus_eq
518 nat_infinite ~> infinite_UNIV_nat
519 int_infinite ~> infinite_UNIV_int
522 * Fact name consolidation:
523 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
524 minus_le_self_iff ~> neg_less_eq_nonneg
525 le_minus_self_iff ~> less_eq_neg_nonpos
526 neg_less_nonneg ~> neg_less_pos
527 less_minus_self_iff ~> less_neg_neg [simp]
530 * More simplification rules on unary and binary minus:
531 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
532 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
533 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
534 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
535 minus_add_cancel, uminus_add_conv_diff. These correspondingly
536 have been taken away from fact collections algebra_simps and
537 field_simps. INCOMPATIBILITY.
539 To restore proofs, the following patterns are helpful:
541 a) Arbitrary failing proof not involving "diff_def":
542 Consider simplification with algebra_simps or field_simps.
544 b) Lifting rules from addition to subtraction:
545 Try with "using <rule for addition> of [... "- _" ...]" by simp".
547 c) Simplification with "diff_def": just drop "diff_def".
548 Consider simplification with algebra_simps or field_simps;
549 or the brute way with
550 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
552 * SUP and INF generalized to conditionally_complete_lattice
554 * Theory Lubs moved HOL image to HOL-Library. It is replaced by
555 Conditionally_Complete_Lattices. INCOMPATIBILITY.
557 * Introduce bdd_above and bdd_below in Conditionally_Complete_Lattices, use them
558 instead of explicitly stating boundedness of sets.
560 * ccpo.admissible quantifies only over non-empty chains to allow
561 more syntax-directed proof rules; the case of the empty chain
562 shows up as additional case in fixpoint induction proofs.
565 * Removed and renamed theorems in Series:
566 summable_le ~> suminf_le
567 suminf_le ~> suminf_le_const
568 series_pos_le ~> setsum_le_suminf
569 series_pos_less ~> setsum_less_suminf
570 suminf_ge_zero ~> suminf_nonneg
571 suminf_gt_zero ~> suminf_pos
572 suminf_gt_zero_iff ~> suminf_pos_iff
573 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ
574 suminf_0_le ~> suminf_nonneg [rotate]
575 pos_summable ~> summableI_nonneg_bounded
576 ratio_test ~> summable_ratio_test
578 removed series_zero, replaced by sums_finite
580 removed auxiliary lemmas:
581 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,
582 half, le_Suc_ex_iff, lemma_realpow_diff_sumr, real_setsum_nat_ivl_bounded,
583 summable_le2, ratio_test_lemma2, sumr_minus_one_realpow_zerom,
584 sumr_one_lb_realpow_zero, summable_convergent_sumr_iff, sumr_diff_mult_const
587 * Replace (F)DERIV syntax by has_derivative:
588 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"
590 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"
592 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax
594 - removed constant isDiff
596 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as input
599 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed
601 - Renamed FDERIV_... lemmas to has_derivative_...
603 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV
605 - removed DERIV_intros, has_derivative_eq_intros
607 - introduced derivative_intros and deriative_eq_intros which includes now rules for
608 DERIV, has_derivative and has_vector_derivative.
611 differentiable_def ~> real_differentiable_def
612 differentiableE ~> real_differentiableE
613 fderiv_def ~> has_derivative_at
614 field_fderiv_def ~> field_has_derivative_at
615 isDiff_der ~> differentiable_def
616 deriv_fderiv ~> has_field_derivative_def
617 deriv_def ~> DERIV_def
620 * Include more theorems in continuous_intros. Remove the continuous_on_intros,
621 isCont_intros collections, these facts are now in continuous_intros.
623 * Theorems about complex numbers are now stated only using Re and Im, the Complex
624 constructor is not used anymore. It is possible to use primcorec to defined the
625 behaviour of a complex-valued function.
627 Removed theorems about the Complex constructor from the simpset, they are
628 available as the lemma collection legacy_Complex_simps. This especially
630 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".
632 Instead the reverse direction is supported with
633 Complex_eq: "Complex a b = a + \<i> * b"
635 Moved csqrt from Fundamental_Algebra_Theorem to Complex.
639 complex_Re/Im_zero ~> zero_complex.sel
640 complex_Re/Im_add ~> plus_complex.sel
641 complex_Re/Im_minus ~> uminus_complex.sel
642 complex_Re/Im_diff ~> minus_complex.sel
643 complex_Re/Im_one ~> one_complex.sel
644 complex_Re/Im_mult ~> times_complex.sel
645 complex_Re/Im_inverse ~> inverse_complex.sel
646 complex_Re/Im_scaleR ~> scaleR_complex.sel
647 complex_Re/Im_i ~> ii.sel
648 complex_Re/Im_cnj ~> cnj.sel
651 complex_divide_def ~> divide_complex_def
652 complex_norm_def ~> norm_complex_def
653 cmod_def ~> norm_complex_de
665 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
668 - Fixed soundness bug whereby mutually recursive datatypes could take
670 - Fixed soundness bug with low-level number functions such as "Abs_Integ" and
672 - Removed "std" option.
673 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to
676 * HOL-Multivariate_Analysis:
677 - type class ordered_real_vector for ordered vector spaces
678 - new theory Complex_Basic_Analysis defining complex derivatives,
679 holomorphic functions, etc., ported from HOL Light's canal.ml.
680 - changed order of ordered_euclidean_space to be compatible with
681 pointwise ordering on products. Therefore instance of
682 conditionally_complete_lattice and ordered_real_vector.
683 INCOMPATIBILITY: use box instead of greaterThanLessThan or
684 explicit set-comprehensions with eucl_less for other (half-) open
688 derivative_linear ~> has_derivative_bounded_linear
689 derivative_is_linear ~> has_derivative_linear
690 bounded_linear_imp_linear ~> bounded_linear.linear
693 - replaced the Lebesgue integral on real numbers by the more general Bochner
694 integral for functions into a real-normed vector space.
696 integral_zero ~> integral_zero / integrable_zero
697 integral_minus ~> integral_minus / integrable_minus
698 integral_add ~> integral_add / integrable_add
699 integral_diff ~> integral_diff / integrable_diff
700 integral_setsum ~> integral_setsum / integrable_setsum
701 integral_multc ~> integral_mult_left / integrable_mult_left
702 integral_cmult ~> integral_mult_right / integrable_mult_right
703 integral_triangle_inequality~> integral_norm_bound
704 integrable_nonneg ~> integrableI_nonneg
705 integral_positive ~> integral_nonneg_AE
706 integrable_abs_iff ~> integrable_abs_cancel
707 positive_integral_lim_INF ~> positive_integral_liminf
708 lebesgue_real_affine ~> lborel_real_affine
709 borel_integral_has_integral ~> has_integral_lebesgue_integral
710 integral_indicator ~>
711 integral_real_indicator / integrable_real_indicator
712 positive_integral_fst ~> positive_integral_fst'
713 positive_integral_fst_measurable ~> positive_integral_fst
714 positive_integral_snd_measurable ~> positive_integral_snd
716 integrable_fst_measurable ~>
717 integral_fst / integrable_fst / AE_integrable_fst
719 integrable_snd_measurable ~>
720 integral_snd / integrable_snd / AE_integrable_snd
722 integral_monotone_convergence ~>
723 integral_monotone_convergence / integrable_monotone_convergence
725 integral_monotone_convergence_at_top ~>
726 integral_monotone_convergence_at_top /
727 integrable_monotone_convergence_at_top
729 has_integral_iff_positive_integral_lebesgue ~>
730 has_integral_iff_has_bochner_integral_lebesgue_nonneg
732 lebesgue_integral_has_integral ~>
733 has_integral_integrable_lebesgue_nonneg
735 positive_integral_lebesgue_has_integral ~>
736 integral_has_integral_lebesgue_nonneg /
737 integrable_has_integral_lebesgue_nonneg
739 lebesgue_integral_real_affine ~>
740 positive_integral_real_affine
742 has_integral_iff_positive_integral_lborel ~>
743 integral_has_integral_nonneg / integrable_has_integral_nonneg
745 The following theorems where removed:
747 lebesgue_integral_nonneg
748 lebesgue_integral_uminus
749 lebesgue_integral_cmult
750 lebesgue_integral_multc
751 lebesgue_integral_cmult_nonneg
752 integral_cmul_indicator
755 - Renamed positive_integral to nn_integral:
757 * Renamed all lemmas "*positive_integral*" to *nn_integral*"
758 positive_integral_positive ~> nn_integral_nonneg
760 * Renamed abbreviation integral\<^sup>P to integral\<^sup>N.
762 - Formalized properties about exponentially, Erlang, and normal distributed
765 * Library/Kleene-Algebra was removed because AFP/Kleene_Algebra subsumes it.
769 * The signature and semantics of Document.Snapshot.cumulate_markup /
770 select_markup have been clarified. Markup is now traversed in the
771 order of reports given by the prover: later markup is usually more
772 specific and may override results accumulated so far. The elements
773 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.
778 * Moved ML_Compiler.exn_trace and other operations on exceptions to
779 structure Runtime. Minor INCOMPATIBILITY.
781 * Discontinued old Toplevel.debug in favour of system option
782 "ML_exception_trace", which may be also declared within the context via
783 "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.
785 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor
788 * Configuration option "ML_print_depth" controls the pretty-printing
789 depth of the ML compiler within the context. The old print_depth in
790 ML is still available as default_print_depth, but rarely used. Minor
793 * Proper context discipline for read_instantiate and instantiate_tac:
794 variables that are meant to become schematic need to be given as
795 fixed, and are generalized by the explicit context of local variables.
796 This corresponds to Isar attributes "where" and "of" with 'for'
797 declaration. INCOMPATIBILITY, also due to potential change of indices
798 of schematic variables.
800 * Toplevel function "use" refers to raw ML bootstrap environment,
801 without Isar context nor antiquotations. Potential INCOMPATIBILITY.
802 Note that 'ML_file' is the canonical command to load ML files into the
805 * Proper context for basic Simplifier operations: rewrite_rule,
806 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
807 pass runtime Proof.context (and ensure that the simplified entity
808 actually belongs to it).
810 * Subtle change of semantics of Thm.eq_thm: theory stamps are not
811 compared (according to Thm.thm_ord), but assumed to be covered by the
812 current background theory. Thus equivalent data produced in different
813 branches of the theory graph usually coincides (e.g. relevant for
814 theory merge). Note that the softer Thm.eq_thm_prop is often more
815 appropriate than Thm.eq_thm.
817 * Simplified programming interface to define ML antiquotations, see
818 structure ML_Antiquotation. Minor INCOMPATIBILITY.
820 * ML antiquotation @{here} refers to its source position, which is
821 occasionally useful for experimentation and diagnostic purposes.
823 * ML antiquotation @{path} produces a Path.T value, similarly to
824 Path.explode, but with compile-time check against the file-system and
825 some PIDE markup. Note that unlike theory source, ML does not have a
826 well-defined master directory, so an absolute symbolic path
827 specification is usually required, e.g. "~~/src/HOL".
829 * ML antiquotation @{print} inlines a function to print an arbitrary
830 ML value, which is occasionally useful for diagnostic or demonstration
836 * Session ROOT specifications require explicit 'document_files' for
837 robust dependencies on LaTeX sources. Only these explicitly given
838 files are copied to the document output directory, before document
839 processing is started.
841 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER
842 and PDF_VIEWER now refer to the actual programs, not shell
843 command-lines. Discontinued option -c: invocation may be asynchronous
844 via desktop environment, without any special precautions. Potential
845 INCOMPATIBILITY with ambitious private settings.
847 * Improved 'display_drafts' concerning desktop integration and
848 repeated invocation in PIDE front-end: re-use single file
849 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
851 * The raw Isabelle process executable has been renamed from
852 "isabelle-process" to "isabelle_process", which conforms to common
853 shell naming conventions, and allows to define a shell function within
854 the Isabelle environment to avoid dynamic path lookup. Rare
855 incompatibility for old tools that do not use the $ISABELLE_PROCESS
856 settings variable yet.
858 * Retired the now unused Isabelle tool "wwwfind". Similar
859 functionality may be integrated into PIDE/jEdit at a later point.
861 * Windows: support for regular TeX installation (e.g. MiKTeX) instead
862 of TeX Live from Cygwin.
866 New in Isabelle2013-2 (December 2013)
867 -------------------------------------
869 *** Prover IDE -- Isabelle/Scala/jEdit ***
871 * More robust editing of running commands with internal forks,
872 e.g. non-terminating 'by' steps.
874 * More relaxed Sledgehammer panel: avoid repeated application of query
875 after edits surrounding the command location.
877 * More status information about commands that are interrupted
878 accidentally (via physical event or Poly/ML runtime system signal,
884 * More robust termination of external processes managed by
885 Isabelle/ML: support cancellation of tasks within the range of
886 milliseconds, as required for PIDE document editing with automatically
887 tried tools (e.g. Sledgehammer).
889 * Reactivated Isabelle/Scala kill command for external processes on
890 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
891 workaround for some Debian/Ubuntu Linux versions from 2013.
895 New in Isabelle2013-1 (November 2013)
896 -------------------------------------
900 * Discontinued obsolete 'uses' within theory header. Note that
901 commands like 'ML_file' work without separate declaration of file
902 dependencies. Minor INCOMPATIBILITY.
904 * Discontinued redundant 'use' command, which was superseded by
905 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
907 * Simplified subscripts within identifiers, using plain \<^sub>
908 instead of the second copy \<^isub> and \<^isup>. Superscripts are
909 only for literal tokens within notation; explicit mixfix annotations
910 for consts or fixed variables may be used as fall-back for unusual
911 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
912 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
913 standardize symbols as a starting point for further manual cleanup.
914 The ML reference variable "legacy_isub_isup" may be set as temporary
915 workaround, to make the prover accept a subset of the old identifier
918 * Document antiquotations: term style "isub" has been renamed to
919 "sub". Minor INCOMPATIBILITY.
921 * Uniform management of "quick_and_dirty" as system option (see also
922 "isabelle options"), configuration option within the context (see also
923 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
924 INCOMPATIBILITY, need to use more official Isabelle means to access
925 quick_and_dirty, instead of historical poking into mutable reference.
927 * Renamed command 'print_configs' to 'print_options'. Minor
930 * Proper diagnostic command 'print_state'. Old 'pr' (with its
931 implicit change of some global references) is retained for now as
932 control command, e.g. for ProofGeneral 3.7.x.
934 * Discontinued 'print_drafts' command with its old-fashioned PS output
935 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
936 'display_drafts' instead and print via the regular document viewer.
938 * Updated and extended "isar-ref" and "implementation" manual,
939 eliminated old "ref" manual.
942 *** Prover IDE -- Isabelle/Scala/jEdit ***
944 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
947 * Dockable window "Documentation" provides access to Isabelle
950 * Dockable window "Find" provides query operations for formal entities
951 (GUI front-end to 'find_theorems' command).
953 * Dockable window "Sledgehammer" manages asynchronous / parallel
954 sledgehammer runs over existing document sources, independently of
955 normal editing and checking process.
957 * Dockable window "Timing" provides an overview of relevant command
958 timing information, depending on option jedit_timing_threshold. The
959 same timing information is shown in the extended tooltip of the
960 command keyword, when hovering the mouse over it while the CONTROL or
961 COMMAND modifier is pressed.
963 * Improved dockable window "Theories": Continuous checking of proof
964 document (visible and required parts) may be controlled explicitly,
965 using check box or shortcut "C+e ENTER". Individual theory nodes may
966 be marked explicitly as required and checked in full, using check box
967 or shortcut "C+e SPACE".
969 * Improved completion mechanism, which is now managed by the
970 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
971 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
973 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
974 isabelle.complete for explicit completion in Isabelle sources.
975 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
978 * Improved support of various "minor modes" for Isabelle NEWS,
979 options, session ROOT etc., with completion and SideKick tree view.
981 * Strictly monotonic document update, without premature cancellation of
982 running transactions that are still needed: avoid reset/restart of
983 such command executions while editing.
985 * Support for asynchronous print functions, as overlay to existing
988 * Support for automatic tools in HOL, which try to prove or disprove
989 toplevel theorem statements.
991 * Action isabelle.reset-font-size resets main text area font size
992 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
993 also "Plugin Options / Isabelle / General"). It can be bound to some
994 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
996 * File specifications in jEdit (e.g. file browser) may refer to
997 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued
998 obsolete $ISABELLE_HOME_WINDOWS variable.
1000 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
1001 / Global Options / Appearance".
1003 * Improved support of native Mac OS X functionality via "MacOSX"
1004 plugin, which is now enabled by default.
1009 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
1010 In particular, 'interpretation' allows for non-persistent
1011 interpretation within "context ... begin ... end" blocks offering a
1012 light-weight alternative to 'sublocale'. See "isar-ref" manual for
1015 * Improved locales diagnostic command 'print_dependencies'.
1017 * Discontinued obsolete 'axioms' command, which has been marked as
1018 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
1019 instead, while observing its uniform scope for polymorphism.
1021 * Discontinued empty name bindings in 'axiomatization'.
1024 * System option "proofs" has been discontinued. Instead the global
1025 state of Proofterm.proofs is persistently compiled into logic images
1026 as required, notably HOL-Proofs. Users no longer need to change
1027 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
1029 * Syntax translation functions (print_translation etc.) always depend
1030 on Proof.context. Discontinued former "(advanced)" option -- this is
1031 now the default. Minor INCOMPATIBILITY.
1033 * Former global reference trace_unify_fail is now available as
1034 configuration option "unify_trace_failure" (global context only).
1036 * SELECT_GOAL now retains the syntactic context of the overall goal
1037 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
1043 * Stronger precedence of syntax for big intersection and union on
1044 sets, in accordance with corresponding lattice operations.
1047 * Notation "{p:A. P}" now allows tuple patterns as well.
1049 * Nested case expressions are now translated in a separate check phase
1050 rather than during parsing. The data for case combinators is separated
1051 from the datatype package. The declaration attribute
1052 "case_translation" can be used to register new case combinators:
1054 declare [[case_translation case_combinator constructor1 ... constructorN]]
1057 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
1059 - 'code_identifier' declares name hints for arbitrary identifiers in
1060 generated code, subsuming 'code_modulename'.
1062 See the isar-ref manual for syntax diagrams, and the HOL theories for
1065 * Attibute 'code': 'code' now declares concrete and abstract code
1066 equations uniformly. Use explicit 'code equation' and 'code abstract'
1067 to distinguish both when desired.
1069 * Discontinued theories Code_Integer and Efficient_Nat by a more
1070 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
1071 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
1072 generation for details. INCOMPATIBILITY.
1074 * Numeric types are mapped by default to target language numerals:
1075 natural (replaces former code_numeral) and integer (replaces former
1076 code_int). Conversions are available as integer_of_natural /
1077 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
1078 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
1079 ML). INCOMPATIBILITY.
1081 * Function package: For mutually recursive functions f and g, separate
1082 cases rules f.cases and g.cases are generated instead of unusable
1083 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
1084 in the case that the unusable rule was used nevertheless.
1086 * Function package: For each function f, new rules f.elims are
1087 generated, which eliminate equalities of the form "f x = t".
1089 * New command 'fun_cases' derives ad-hoc elimination rules for
1090 function equations as simplified instances of f.elims, analogous to
1091 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
1094 - parametrized correspondence relations are now supported:
1095 + parametricity theorems for the raw term can be specified in
1096 the command lift_definition, which allow us to generate stronger
1098 + setup_lifting generates stronger transfer rules if parametric
1099 correspondence relation can be generated
1100 + various new properties of the relator must be specified to support
1102 + parametricity theorem for the Quotient relation can be specified
1103 - setup_lifting generates domain rules for the Transfer package
1104 - stronger reflexivity prover of respectfulness theorems for type
1106 - ===> and --> are now local. The symbols can be introduced
1107 by interpreting the locale lifting_syntax (typically in an
1109 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
1110 Main. Potential INCOMPATIBILITY
1111 - new commands for restoring and deleting Lifting/Transfer context:
1112 lifting_forget, lifting_update
1113 - the command print_quotmaps was renamed to print_quot_maps.
1117 - better support for domains in Transfer: replace Domainp T
1118 by the actual invariant in a transferred goal
1119 - transfer rules can have as assumptions other transfer rules
1120 - Experimental support for transferring from the raw level to the
1121 abstract level: Transfer.transferred attribute
1122 - Attribute version of the transfer method: untransferred attribute
1124 * Reification and reflection:
1125 - Reification is now directly available in HOL-Main in structure
1127 - Reflection now handles multiple lists with variables also.
1128 - The whole reflection stack has been decomposed into conversions.
1131 * Revised devices for recursive definitions over finite sets:
1132 - Only one fundamental fold combinator on finite set remains:
1133 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
1134 This is now identity on infinite sets.
1135 - Locales ("mini packages") for fundamental definitions with
1136 Finite_Set.fold: folding, folding_idem.
1137 - Locales comm_monoid_set, semilattice_order_set and
1138 semilattice_neutr_order_set for big operators on sets.
1139 See theory Big_Operators for canonical examples.
1140 Note that foundational constants comm_monoid_set.F and
1141 semilattice_set.F correspond to former combinators fold_image
1142 and fold1 respectively. These are now gone. You may use
1143 those foundational constants as substitutes, but it is
1144 preferable to interpret the above locales accordingly.
1145 - Dropped class ab_semigroup_idem_mult (special case of lattice,
1146 no longer needed in connection with Finite_Set.fold etc.)
1148 card.union_inter ~> card_Un_Int [symmetric]
1149 card.union_disjoint ~> card_Un_disjoint
1152 * Locale hierarchy for abstract orderings and (semi)lattices.
1154 * Complete_Partial_Order.admissible is defined outside the type class
1155 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
1156 class predicate assumption or sort constraint when possible.
1159 * Introduce type class "conditionally_complete_lattice": Like a
1160 complete lattice but does not assume the existence of the top and
1161 bottom elements. Allows to generalize some lemmas about reals and
1162 extended reals. Removed SupInf and replaced it by the instantiation
1163 of conditionally_complete_lattice for real. Renamed lemmas about
1164 conditionally-complete lattice from Sup_... to cSup_... and from
1165 Inf_... to cInf_... to avoid hidding of similar complete lattice
1168 * Introduce type class linear_continuum as combination of
1169 conditionally-complete lattices and inner dense linorders which have
1170 more than one element. INCOMPATIBILITY.
1172 * Introduced type classes order_top and order_bot. The old classes top
1173 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
1174 Rename bot -> order_bot, top -> order_top
1176 * Introduce type classes "no_top" and "no_bot" for orderings without
1177 top and bottom elements.
1179 * Split dense_linorder into inner_dense_order and no_top, no_bot.
1181 * Complex_Main: Unify and move various concepts from
1182 HOL-Multivariate_Analysis to HOL-Complex_Main.
1184 - Introduce type class (lin)order_topology and
1185 linear_continuum_topology. Allows to generalize theorems about
1186 limits and order. Instances are reals and extended reals.
1188 - continuous and continuos_on from Multivariate_Analysis:
1189 "continuous" is the continuity of a function at a filter. "isCont"
1190 is now an abbrevitation: "isCont x f == continuous (at _) f".
1192 Generalized continuity lemmas from isCont to continuous on an
1195 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
1196 compactness of closed intervals on reals. Continuous functions
1197 attain infimum and supremum on compact sets. The inverse of a
1198 continuous function is continuous, when the function is continuous
1201 - connected from Multivariate_Analysis. Use it to prove the
1202 intermediate value theorem. Show connectedness of intervals on
1203 linear_continuum_topology).
1205 - first_countable_topology from Multivariate_Analysis. Is used to
1206 show equivalence of properties on the neighbourhood filter of x and
1207 on all sequences converging to x.
1209 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
1210 theorems from Library/FDERIV.thy to Deriv.thy and base the
1211 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
1212 which are restricted to sets, i.e. to represent derivatives from
1215 - Removed the within-filter. It is replaced by the principal filter:
1217 F within X = inf F (principal X)
1219 - Introduce "at x within U" as a single constant, "at x" is now an
1220 abbreviation for "at x within UNIV"
1222 - Introduce named theorem collections tendsto_intros,
1223 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
1224 in tendsto_intros (or FDERIV_intros) are also available as
1225 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
1226 is replaced by a congruence rule. This allows to apply them as
1227 intro rules and then proving equivalence by the simplifier.
1229 - Restructured theories in HOL-Complex_Main:
1231 + Moved RealDef and RComplete into Real
1233 + Introduced Topological_Spaces and moved theorems about
1234 topological spaces, filters, limits and continuity to it
1236 + Renamed RealVector to Real_Vector_Spaces
1238 + Split Lim, SEQ, Series into Topological_Spaces,
1239 Real_Vector_Spaces, and Limits
1241 + Moved Ln and Log to Transcendental
1243 + Moved theorems about continuity from Deriv to Topological_Spaces
1245 - Remove various auxiliary lemmas.
1250 - Added option "spy".
1251 - Reduce incidence of "too high arity" errors.
1255 isar_shrink ~> isar_compress
1257 - Added options "isar_try0", "spy".
1258 - Better support for "isar_proofs".
1259 - MaSh has been fined-tuned and now runs as a local server.
1261 * Improved support for ad hoc overloading of constants (see also
1262 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
1264 * Library/Polynomial.thy:
1265 - Use lifting for primitive definitions.
1266 - Explicit conversions from and to lists of coefficients, used for
1268 - Replaced recursion operator poly_rec by fold_coeffs.
1269 - Prefer pre-existing gcd operation for gcd.
1271 poly_eq_iff ~> poly_eq_poly_eq_iff
1272 poly_ext ~> poly_eqI
1273 expand_poly_eq ~> poly_eq_iff
1276 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
1277 case_of_simps to convert function definitions between a list of
1278 equations with patterns on the lhs and a single equation with case
1279 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
1281 * New Library/FSet.thy: type of finite sets defined as a subtype of
1282 sets defined by Lifting/Transfer.
1284 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
1286 * Consolidation of library theories on product orders:
1288 Product_Lattice ~> Product_Order -- pointwise order on products
1289 Product_ord ~> Product_Lexorder -- lexicographic order on products
1293 * Imperative-HOL: The MREC combinator is considered legacy and no
1294 longer included by default. INCOMPATIBILITY, use partial_function
1295 instead, or import theory Legacy_Mrec as a fallback.
1297 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
1298 ~~/src/HOL/Algebra/poly. Existing theories should be based on
1299 ~~/src/HOL/Library/Polynomial instead. The latter provides
1300 integration with HOL's type classes for rings. INCOMPATIBILITY.
1303 - Various improvements to BNF-based (co)datatype package, including
1304 new commands "primrec_new", "primcorec", and
1305 "datatype_new_compat", as well as documentation. See
1306 "datatypes.pdf" for details.
1307 - New "coinduction" method to avoid some boilerplate (compared to
1310 data ~> datatype_new
1311 codata ~> codatatype
1313 - Renamed many generated theorems, including
1315 map_comp' ~> map_comp
1325 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
1326 "check_property" allows to check specifications of the form "ALL x y
1327 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
1328 Examples.thy in particular.
1330 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
1331 tracing output in the command transaction context instead of physical
1332 stdout. See also Toplevel.debug, Toplevel.debugging and
1333 ML_Compiler.exn_trace.
1335 * ML type "theory" is now immutable, without any special treatment of
1336 drafts or linear updates (which could lead to "stale theory" errors in
1337 the past). Discontinued obsolete operations like Theory.copy,
1338 Theory.checkpoint, and the auxiliary type theory_ref. Minor
1341 * More uniform naming of goal functions for skipped proofs:
1343 Skip_Proof.prove ~> Goal.prove_sorry
1344 Skip_Proof.prove_global ~> Goal.prove_sorry_global
1346 Minor INCOMPATIBILITY.
1348 * Simplifier tactics and tools use proper Proof.context instead of
1349 historic type simpset. Old-style declarations like addsimps,
1350 addsimprocs etc. operate directly on Proof.context. Raw type simpset
1351 retains its use as snapshot of the main Simplifier context, using
1352 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
1353 old tools by making them depend on (ctxt : Proof.context) instead of
1354 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
1356 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
1357 operate on Proof.context instead of claset, for uniformity with addIs,
1358 addEs, addDs etc. Note that claset_of and put_claset allow to manage
1359 clasets separately from the context.
1361 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
1362 INCOMPATIBILITY, use @{context} instead.
1364 * Antiquotation @{theory_context A} is similar to @{theory A}, but
1365 presents the result as initial Proof.context.
1370 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
1371 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
1373 * Discontinued obsolete isabelle-process options -f and -u (former
1374 administrative aliases of option -e). Minor INCOMPATIBILITY.
1376 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
1379 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
1380 document formats: dvi.gz, ps, ps.gz -- the default document format is
1383 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
1384 specify global resources of the JVM process run by isabelle build.
1386 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
1387 to run Isabelle/Scala source files as standalone programs.
1389 * Improved "isabelle keywords" tool (for old-style ProofGeneral
1390 keyword tables): use Isabelle/Scala operations, which inspect outer
1391 syntax without requiring to build sessions first.
1393 * Sessions may be organized via 'chapter' specifications in the ROOT
1394 file, which determines a two-level hierarchy of browser info. The old
1395 tree-like organization via implicit sub-session relation (with its
1396 tendency towards erratic fluctuation of URLs) has been discontinued.
1397 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
1398 for HTML presentation of theories.
1402 New in Isabelle2013 (February 2013)
1403 -----------------------------------
1407 * Theorem status about oracles and unfinished/failed future proofs is
1408 no longer printed by default, since it is incompatible with
1409 incremental / parallel checking of the persistent document model. ML
1410 function Thm.peek_status may be used to inspect a snapshot of the
1411 ongoing evaluation process. Note that in batch mode --- notably
1412 isabelle build --- the system ensures that future proofs of all
1413 accessible theorems in the theory context are finished (as before).
1415 * Configuration option show_markup controls direct inlining of markup
1416 into the printed representation of formal entities --- notably type
1417 and sort constraints. This enables Prover IDE users to retrieve that
1418 information via tooltips in the output window, for example.
1420 * Command 'ML_file' evaluates ML text from a file directly within the
1421 theory, without any predeclaration via 'uses' in the theory header.
1423 * Old command 'use' command and corresponding keyword 'uses' in the
1424 theory header are legacy features and will be discontinued soon.
1425 Tools that load their additional source files may imitate the
1426 'ML_file' implementation, such that the system can take care of
1427 dependencies properly.
1429 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
1430 is called fastforce / fast_force_tac already since Isabelle2011-1.
1432 * Updated and extended "isar-ref" and "implementation" manual, reduced
1433 remaining material in old "ref" manual.
1435 * Improved support for auxiliary contexts that indicate block structure
1436 for specifications. Nesting of "context fixes ... context assumes ..."
1437 and "class ... context ...".
1439 * Attribute "consumes" allows a negative value as well, which is
1440 interpreted relatively to the total number of premises of the rule in
1441 the target context. This form of declaration is stable when exported
1442 from a nested 'context' with additional assumptions. It is the
1443 preferred form for definitional packages, notably cases/rules produced
1444 in HOL/inductive and HOL/function.
1446 * More informative error messages for Isar proof commands involving
1447 lazy enumerations (method applications etc.).
1449 * Refined 'help' command to retrieve outer syntax commands according
1450 to name patterns (with clickable results).
1453 *** Prover IDE -- Isabelle/Scala/jEdit ***
1455 * Parallel terminal proofs ('by') are enabled by default, likewise
1456 proofs that are built into packages like 'datatype', 'function'. This
1457 allows to "run ahead" checking the theory specifications on the
1458 surface, while the prover is still crunching on internal
1459 justifications. Unfinished / cancelled proofs are restarted as
1460 required to complete full proof checking eventually.
1462 * Improved output panel with tooltips, hyperlinks etc. based on the
1463 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
1464 tooltips leads to some window that supports the same recursively,
1465 which can lead to stacks of tooltips as the semantic document content
1466 is explored. ESCAPE closes the whole stack, individual windows may be
1467 closed separately, or detached to become independent jEdit dockables.
1469 * Improved support for commands that produce graph output: the text
1470 message contains a clickable area to open a new instance of the graph
1473 * More robust incremental parsing of outer syntax (partial comments,
1474 malformed symbols). Changing the balance of open/close quotes and
1475 comment delimiters works more conveniently with unfinished situations
1476 that frequently occur in user interaction.
1478 * More efficient painting and improved reactivity when editing large
1479 files. More scalable management of formal document content.
1481 * Smarter handling of tracing messages: prover process pauses after
1482 certain number of messages per command transaction, with some user
1483 dialog to stop or continue. This avoids swamping the front-end with
1484 potentially infinite message streams.
1486 * More plugin options and preferences, based on Isabelle/Scala. The
1487 jEdit plugin option panel provides access to some Isabelle/Scala
1488 options, including tuning parameters for editor reactivity and color
1491 * Dockable window "Symbols" provides some editing support for Isabelle
1494 * Dockable window "Monitor" shows ML runtime statistics. Note that
1495 continuous display of the chart slows down the system.
1497 * Improved editing support for control styles: subscript, superscript,
1498 bold, reset of style -- operating on single symbols or text
1499 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
1501 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
1502 adjust the main text area font size, and its derivatives for output,
1503 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
1504 need to be adapted to local keyboard layouts.
1506 * More reactive completion popup by default: use \t (TAB) instead of
1507 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
1508 also "Plugin Options / SideKick / General / Code Completion Options".
1510 * Implicit check and build dialog of the specified logic session
1511 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
1512 demand, without bundling big platform-dependent heap images in the
1513 Isabelle distribution.
1515 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
1516 from Oracle provide better multi-platform experience. This version is
1517 now bundled exclusively with Isabelle.
1522 * Code generation for Haskell: restrict unqualified imports from
1523 Haskell Prelude to a small set of fundamental operations.
1525 * Command 'export_code': relative file names are interpreted
1526 relatively to master directory of current theory rather than the
1527 rather arbitrary current working directory. INCOMPATIBILITY.
1529 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
1530 use regular rule composition via "OF" / "THEN", or explicit proof
1531 structure instead. Note that Isabelle/ML provides a variety of
1532 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
1533 with some care where this is really required.
1535 * Command 'typ' supports an additional variant with explicit sort
1536 constraint, to infer and check the most general type conforming to a
1537 given sort. Example (in HOL):
1539 typ "_ * _ * bool * unit" :: finite
1541 * Command 'locale_deps' visualizes all locales and their relations as
1549 - Added MaSh relevance filter based on machine-learning; see the
1550 Sledgehammer manual for details.
1551 - Polished Isar proofs generated with "isar_proofs" option.
1552 - Rationalized type encodings ("type_enc" option).
1553 - Renamed "kill_provers" subcommand to "kill_all".
1555 isar_proof ~> isar_proofs
1556 isar_shrink_factor ~> isar_shrink
1557 max_relevant ~> max_facts
1558 relevance_thresholds ~> fact_thresholds
1560 * Quickcheck: added an optimisation for equality premises. It is
1561 switched on by default, and can be switched off by setting the
1562 configuration quickcheck_optimise_equality to false.
1564 * Quotient: only one quotient can be defined by quotient_type
1568 - generation of an abstraction function equation in lift_definition
1569 - quot_del attribute
1570 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
1572 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
1575 * Preprocessing of the code generator rewrites set comprehensions into
1576 pointfree expressions.
1578 * The SMT solver Z3 has now by default a restricted set of directly
1579 supported features. For the full set of features (div/mod, nonlinear
1580 arithmetic, datatypes/records) with potential proof reconstruction
1581 failures, enable the configuration option "z3_with_extensions". Minor
1584 * Simplified 'typedef' specifications: historical options for implicit
1585 set definition and alternative name have been discontinued. The
1586 former behavior of "typedef (open) t = A" is now the default, but
1587 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
1590 * Removed constant "chars"; prefer "Enum.enum" on type "char"
1591 directly. INCOMPATIBILITY.
1593 * Moved operation product, sublists and n_lists from theory Enum to
1594 List. INCOMPATIBILITY.
1596 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
1598 * Class "comm_monoid_diff" formalises properties of bounded
1599 subtraction, with natural numbers and multisets as typical instances.
1601 * Added combinator "Option.these" with type "'a option set => 'a set".
1603 * Theory "Transitive_Closure": renamed lemmas
1605 reflcl_tranclp -> reflclp_tranclp
1606 rtranclp_reflcl -> rtranclp_reflclp
1610 * Theory "Rings": renamed lemmas (in class semiring)
1612 left_distrib ~> distrib_right
1613 right_distrib ~> distrib_left
1617 * Generalized the definition of limits:
1619 - Introduced the predicate filterlim (LIM x F. f x :> G) which
1620 expresses that when the input values x converge to F then the
1621 output f x converges to G.
1623 - Added filters for convergence to positive (at_top) and negative
1626 - Moved infinity in the norm (at_infinity) from
1627 Multivariate_Analysis to Complex_Main.
1629 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
1634 * Theory "Library/Option_ord" provides instantiation of option type to
1635 lattice type classes.
1637 * Theory "Library/Multiset": renamed
1639 constant fold_mset ~> Multiset.fold
1640 fact fold_mset_commute ~> fold_mset_comm
1644 * Renamed theory Library/List_Prefix to Library/Sublist, with related
1647 - Renamed constants (and related lemmas)
1650 strict_prefix ~> prefix
1652 - Replaced constant "postfix" by "suffixeq" with swapped argument
1653 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
1654 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
1655 Renamed lemmas accordingly.
1657 - Added constant "list_hembeq" for homeomorphic embedding on
1658 lists. Added abbreviation "sublisteq" for special case
1659 "list_hembeq (op =)".
1661 - Theory Library/Sublist no longer provides "order" and "bot" type
1662 class instances for the prefix order (merely corresponding locale
1663 interpretations). The type class instances are now in theory
1664 Library/Prefix_Order.
1666 - The sublist relation of theory Library/Sublist_Order is now based
1667 on "Sublist.sublisteq". Renamed lemmas accordingly:
1669 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
1670 le_list_append_mono ~> Sublist.list_hembeq_append_mono
1671 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
1672 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
1673 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
1674 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
1675 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
1676 le_list_drop_many ~> Sublist.sublisteq_drop_many
1677 le_list_filter_left ~> Sublist.sublisteq_filter_left
1678 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
1679 le_list_rev_take_iff ~> Sublist.sublisteq_append
1680 le_list_same_length ~> Sublist.sublisteq_same_length
1681 le_list_take_many_iff ~> Sublist.sublisteq_append'
1682 less_eq_list.drop ~> less_eq_list_drop
1683 less_eq_list.induct ~> less_eq_list_induct
1684 not_le_list_length ~> Sublist.not_sublisteq_length
1688 * New theory Library/Countable_Set.
1690 * Theory Library/Debug and Library/Parallel provide debugging and
1691 parallel execution for code generated towards Isabelle/ML.
1693 * Theory Library/FuncSet: Extended support for Pi and extensional and
1694 introduce the extensional dependent function space "PiE". Replaced
1695 extensional_funcset by an abbreviation, and renamed lemmas from
1696 extensional_funcset to PiE as follows:
1698 extensional_empty ~> PiE_empty
1699 extensional_funcset_empty_domain ~> PiE_empty_domain
1700 extensional_funcset_empty_range ~> PiE_empty_range
1701 extensional_funcset_arb ~> PiE_arb
1702 extensional_funcset_mem ~> PiE_mem
1703 extensional_funcset_extend_domainI ~> PiE_fun_upd
1704 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
1705 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
1706 card_extensional_funcset ~> card_PiE
1707 finite_extensional_funcset ~> finite_PiE
1711 * Theory Library/FinFun: theory of almost everywhere constant
1712 functions (supersedes the AFP entry "Code Generation for Functions as
1715 * Theory Library/Phantom: generic phantom type to make a type
1716 parameter appear in a constant's type. This alternative to adding
1717 TYPE('a) as another parameter avoids unnecessary closures in generated
1720 * Theory Library/RBT_Impl: efficient construction of red-black trees
1721 from sorted associative lists. Merging two trees with rbt_union may
1722 return a structurally different tree than before. Potential
1725 * Theory Library/IArray: immutable arrays with code generation.
1727 * Theory Library/Finite_Lattice: theory of finite lattices.
1729 * HOL/Multivariate_Analysis: replaced
1731 "basis :: 'a::euclidean_space => nat => real"
1732 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
1734 on euclidean spaces by using the inner product "_ \<bullet> _" with
1735 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
1736 "SUM i : Basis. f i * r i".
1738 With this change the following constants are also changed or removed:
1740 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
1741 a $$ i ~> inner a i (where i : Basis)
1743 \<pi>, \<pi>' removed
1745 Theorems about these constants where removed.
1749 component_le_norm ~> Basis_le_norm
1750 euclidean_eq ~> euclidean_eq_iff
1751 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
1752 euclidean_simps ~> inner_simps
1753 independent_basis ~> independent_Basis
1754 span_basis ~> span_Basis
1755 in_span_basis ~> in_span_Basis
1756 norm_bound_component_le ~> norm_boound_Basis_le
1757 norm_bound_component_lt ~> norm_boound_Basis_lt
1758 component_le_infnorm ~> Basis_le_infnorm
1764 - Added simproc "measurable" to automatically prove measurability.
1766 - Added induction rules for sigma sets with disjoint union
1767 (sigma_sets_induct_disjoint) and for Borel-measurable functions
1768 (borel_measurable_induct).
1770 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
1773 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
1774 AFP entry "Ordinals_and_Cardinals").
1776 * HOL/BNF: New (co)datatype package based on bounded natural functors
1777 with support for mixed, nested recursion and interesting non-free
1780 * HOL/Finite_Set and Relation: added new set and relation operations
1781 expressed by Finite_Set.fold.
1783 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
1784 trees for the code generator.
1786 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
1788 possible INCOMPATIBILITY.
1790 * HOL/Set: renamed Set.project -> Set.filter
1794 *** Document preparation ***
1796 * Dropped legacy antiquotations "term_style" and "thm_style", since
1797 styles may be given as arguments to "term" and "thm" already.
1798 Discontinued legacy styles "prem1" .. "prem19".
1800 * Default LaTeX rendering for \<euro> is now based on eurosym package,
1801 instead of slightly exotic babel/greek.
1803 * Document variant NAME may use different LaTeX entry point
1804 document/root_NAME.tex if that file exists, instead of the common
1807 * Simplified custom document/build script, instead of old-style
1808 document/IsaMakefile. Minor INCOMPATIBILITY.
1813 * The default limit for maximum number of worker threads is now 8,
1814 instead of 4, in correspondence to capabilities of contemporary
1815 hardware and Poly/ML runtime system.
1817 * Type Seq.results and related operations support embedded error
1818 messages within lazy enumerations, and thus allow to provide
1819 informative errors in the absence of any usable results.
1821 * Renamed Position.str_of to Position.here to emphasize that this is a
1822 formal device to inline positions into message text, but not
1823 necessarily printing visible text.
1828 * Advanced support for Isabelle sessions and build management, see
1829 "system" manual for the chapter of that name, especially the "isabelle
1830 build" tool and its examples. The "isabelle mkroot" tool prepares
1831 session root directories for use with "isabelle build", similar to
1832 former "isabelle mkdir" for "isabelle usedir". Note that this affects
1833 document preparation as well. INCOMPATIBILITY, isabelle usedir /
1834 mkdir / make are rendered obsolete.
1836 * Discontinued obsolete Isabelle/build script, it is superseded by the
1837 regular isabelle build tool. For example:
1839 isabelle build -s -b HOL
1841 * Discontinued obsolete "isabelle makeall".
1843 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
1844 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
1845 provides some traditional targets that invoke "isabelle build". Note
1846 that this is inefficient! Applications of Isabelle/HOL involving
1847 "isabelle make" should be upgraded to use "isabelle build" directly.
1849 * The "isabelle options" tool prints Isabelle system options, as
1850 required for "isabelle build", for example.
1852 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
1853 Minor INCOMPATIBILITY in command-line options.
1855 * The "isabelle install" tool has now a simpler command-line. Minor
1858 * The "isabelle components" tool helps to resolve add-on components
1859 that are not bundled, or referenced from a bare-bones repository
1860 version of Isabelle.
1862 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
1863 platform family: "linux", "macos", "windows".
1865 * The ML system is configured as regular component, and no longer
1866 picked up from some surrounding directory. Potential INCOMPATIBILITY
1867 for home-made settings.
1869 * Improved ML runtime statistics (heap, threads, future tasks etc.).
1871 * Discontinued support for Poly/ML 5.2.1, which was the last version
1872 without exception positions and advanced ML compiler/toplevel
1875 * Discontinued special treatment of Proof General -- no longer guess
1876 PROOFGENERAL_HOME based on accidental file-system layout. Minor
1877 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
1878 settings manually, or use a Proof General version that has been
1879 bundled as Isabelle component.
1883 New in Isabelle2012 (May 2012)
1884 ------------------------------
1888 * Prover IDE (PIDE) improvements:
1890 - more robust Sledgehammer integration (as before the sledgehammer
1891 command-line needs to be typed into the source buffer)
1892 - markup for bound variables
1893 - markup for types of term variables (displayed as tooltips)
1894 - support for user-defined Isar commands within the running session
1895 - improved support for Unicode outside original 16bit range
1896 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
1898 * Forward declaration of outer syntax keywords within the theory
1899 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
1900 commands to be used in the same theory where defined.
1902 * Auxiliary contexts indicate block structure for specifications with
1903 additional parameters and assumptions. Such unnamed contexts may be
1904 nested within other targets, like 'theory', 'locale', 'class',
1905 'instantiation' etc. Results from the local context are generalized
1906 accordingly and applied to the enclosing target context. Example:
1910 assumes xy: "x = y" and yz: "y = z"
1913 lemma my_trans: "x = z" using xy yz by simp
1919 The most basic application is to factor-out context elements of
1920 several fixes/assumes/shows theorem statements, e.g. see
1921 ~~/src/HOL/Isar_Examples/Group_Context.thy
1923 Any other local theory specification element works within the "context
1924 ... begin ... end" block as well.
1926 * Bundled declarations associate attributed fact expressions with a
1927 given name in the context. These may be later included in other
1928 contexts. This allows to manage context extensions casually, without
1929 the logical dependencies of locales and locale interpretation. See
1930 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
1932 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
1933 declaration, and results are standardized before being stored. Thus
1934 old-style "standard" after instantiation or composition of facts
1935 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
1936 indices of schematic variables.
1938 * Rule attributes in local theory declarations (e.g. locale or class)
1939 are now statically evaluated: the resulting theorem is stored instead
1940 of the original expression. INCOMPATIBILITY in rare situations, where
1941 the historic accident of dynamic re-evaluation in interpretations
1944 * New tutorial "Programming and Proving in Isabelle/HOL"
1945 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
1946 Structured Isar Proofs" ("isar-overview"), which has been removed. It
1947 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
1948 Logic" as the recommended beginners tutorial, but does not cover all
1949 of the material of that old tutorial.
1951 * Updated and extended reference manuals: "isar-ref",
1952 "implementation", "system"; reduced remaining material in old "ref"
1958 * Command 'definition' no longer exports the foundational "raw_def"
1959 into the user context. Minor INCOMPATIBILITY, may use the regular
1960 "def" result with attribute "abs_def" to imitate the old version.
1962 * Attribute "abs_def" turns an equation of the form "f x y == t" into
1963 "f == %x y. t", which ensures that "simp" or "unfold" steps always
1964 expand it. This also works for object-logic equality. (Formerly
1965 undocumented feature.)
1967 * Sort constraints are now propagated in simultaneous statements, just
1968 like type constraints. INCOMPATIBILITY in rare situations, where
1969 distinct sorts used to be assigned accidentally. For example:
1971 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
1973 lemma "P (x::'a)" and "Q (y::'a::bar)"
1974 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
1976 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
1977 tolerant against multiple unifiers, as long as the final result is
1978 unique. (As before, rules are composed in canonical right-to-left
1979 order to accommodate newly introduced premises.)
1981 * Renamed some inner syntax categories:
1987 Minor INCOMPATIBILITY. Note that in practice "num_const" or
1988 "num_position" etc. are mainly used instead (which also include
1989 position information via constraints).
1991 * Simplified configuration options for syntax ambiguity: see
1992 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
1993 manual. Minor INCOMPATIBILITY.
1995 * Discontinued configuration option "syntax_positions": atomic terms
1996 in parse trees are always annotated by position constraints.
1998 * Old code generator for SML and its commands 'code_module',
1999 'code_library', 'consts_code', 'types_code' have been discontinued.
2000 Use commands of the generic code generator instead. INCOMPATIBILITY.
2002 * Redundant attribute "code_inline" has been discontinued. Use
2003 "code_unfold" instead. INCOMPATIBILITY.
2005 * Dropped attribute "code_unfold_post" in favor of the its dual
2006 "code_abbrev", which yields a common pattern in definitions like
2008 definition [code_abbrev]: "f = t"
2012 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
2013 instead. INCOMPATIBILITY.
2015 * Discontinued old "prems" fact, which used to refer to the accidental
2016 collection of foundational premises in the context (already marked as
2017 legacy since Isabelle2011).
2022 * Type 'a set is now a proper type constructor (just as before
2023 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
2024 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
2025 sets separate, it is often sufficient to rephrase some set S that has
2026 been accidentally used as predicates by "%x. x : S", and some
2027 predicate P that has been accidentally used as set by "{x. P x}".
2028 Corresponding proofs in a first step should be pruned from any
2029 tinkering with former theorems mem_def and Collect_def as far as
2032 For developments which deliberately mix predicates and sets, a
2033 planning step is necessary to determine what should become a predicate
2034 and what a set. It can be helpful to carry out that step in
2035 Isabelle2011-1 before jumping right into the current release.
2037 * Code generation by default implements sets as container type rather
2038 than predicates. INCOMPATIBILITY.
2040 * New type synonym 'a rel = ('a * 'a) set
2042 * The representation of numerals has changed. Datatype "num"
2043 represents strictly positive binary numerals, along with functions
2044 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
2045 positive and negated numeric literals, respectively. See also
2046 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
2047 user theories may require adaptations as follows:
2049 - Theorems with number_ring or number_semiring constraints: These
2050 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
2052 - Theories defining numeric types: Remove number, number_semiring,
2053 and number_ring instances. Defer all theorems about numerals until
2054 after classes one and semigroup_add have been instantiated.
2056 - Numeral-only simp rules: Replace each rule having a "number_of v"
2057 pattern with two copies, one for numeral and one for neg_numeral.
2059 - Theorems about subclasses of semiring_1 or ring_1: These classes
2060 automatically support numerals now, so more simp rules and
2061 simprocs may now apply within the proof.
2063 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
2064 Redefine using other integer operations.
2066 * Transfer: New package intended to generalize the existing
2067 "descending" method and related theorem attributes from the Quotient
2068 package. (Not all functionality is implemented yet, but future
2069 development will focus on Transfer as an eventual replacement for the
2070 corresponding parts of the Quotient package.)
2072 - transfer_rule attribute: Maintains a collection of transfer rules,
2073 which relate constants at two different types. Transfer rules may
2074 relate different type instances of the same polymorphic constant,
2075 or they may relate an operation on a raw type to a corresponding
2076 operation on an abstract type (quotient or subtype). For example:
2078 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
2079 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
2081 - transfer method: Replaces a subgoal on abstract types with an
2082 equivalent subgoal on the corresponding raw types. Constants are
2083 replaced with corresponding ones according to the transfer rules.
2084 Goals are generalized over all free variables by default; this is
2085 necessary for variables whose types change, but can be overridden
2086 for specific variables with e.g. "transfer fixing: x y z". The
2087 variant transfer' method allows replacing a subgoal with one that
2088 is logically stronger (rather than equivalent).
2090 - relator_eq attribute: Collects identity laws for relators of
2091 various type constructors, e.g. "list_all2 (op =) = (op =)". The
2092 transfer method uses these lemmas to infer transfer rules for
2093 non-polymorphic constants on the fly.
2095 - transfer_prover method: Assists with proving a transfer rule for a
2096 new constant, provided the constant is defined in terms of other
2097 constants that already have transfer rules. It should be applied
2098 after unfolding the constant definitions.
2100 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
2101 from type nat to type int.
2103 * Lifting: New package intended to generalize the quotient_definition
2104 facility of the Quotient package; designed to work with Transfer.
2106 - lift_definition command: Defines operations on an abstract type in
2107 terms of a corresponding operation on a representation
2108 type. Example syntax:
2110 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
2113 Users must discharge a respectfulness proof obligation when each
2114 constant is defined. (For a type copy, i.e. a typedef with UNIV,
2115 the proof is discharged automatically.) The obligation is
2116 presented in a user-friendly, readable form; a respectfulness
2117 theorem in the standard format and a transfer rule are generated
2120 - Integration with code_abstype: For typedefs (e.g. subtypes
2121 corresponding to a datatype invariant, such as dlist),
2122 lift_definition generates a code certificate theorem and sets up
2123 code generation for each constant.
2125 - setup_lifting command: Sets up the Lifting package to work with a
2126 user-defined type. The user must provide either a quotient theorem
2127 or a type_definition theorem. The package configures transfer
2128 rules for equality and quantifiers on the type, and sets up the
2129 lift_definition command to work with the type.
2131 - Usage examples: See Quotient_Examples/Lift_DList.thy,
2132 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
2133 Word/Word.thy and Library/Float.thy.
2137 - The 'quotient_type' command now supports a 'morphisms' option with
2138 rep and abs functions, similar to typedef.
2140 - 'quotient_type' sets up new types to work with the Lifting and
2141 Transfer packages, as with 'setup_lifting'.
2143 - The 'quotient_definition' command now requires the user to prove a
2144 respectfulness property at the point where the constant is
2145 defined, similar to lift_definition; INCOMPATIBILITY.
2147 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
2148 accordingly, INCOMPATIBILITY.
2150 * New diagnostic command 'find_unused_assms' to find potentially
2151 superfluous assumptions in theorems using Quickcheck.
2155 - Quickcheck returns variable assignments as counterexamples, which
2156 allows to reveal the underspecification of functions under test.
2157 For example, refuting "hd xs = x", it presents the variable
2158 assignment xs = [] and x = a1 as a counterexample, assuming that
2159 any property is false whenever "hd []" occurs in it.
2161 These counterexample are marked as potentially spurious, as
2162 Quickcheck also returns "xs = []" as a counterexample to the
2163 obvious theorem "hd xs = hd xs".
2165 After finding a potentially spurious counterexample, Quickcheck
2166 continues searching for genuine ones.
2168 By default, Quickcheck shows potentially spurious and genuine
2169 counterexamples. The option "genuine_only" sets quickcheck to only
2170 show genuine counterexamples.
2172 - The command 'quickcheck_generator' creates random and exhaustive
2173 value generators for a given type and operations.
2175 It generates values by using the operations as if they were
2176 constructors of that type.
2178 - Support for multisets.
2180 - Added "use_subtype" options.
2182 - Added "quickcheck_locale" configuration to specify how to process
2183 conjectures in a locale context.
2185 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
2186 and affecting 'rat' and 'real'.
2189 - Integrated more tightly with SPASS, as described in the ITP 2012
2190 paper "More SPASS with Isabelle".
2191 - Made it try "smt" as a fallback if "metis" fails or times out.
2192 - Added support for the following provers: Alt-Ergo (via Why3 and
2193 TFF1), iProver, iProver-Eq.
2194 - Sped up the minimizer.
2195 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
2196 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
2197 - Renamed "sound" option to "strict".
2199 * Metis: Added possibility to specify lambda translations scheme as a
2200 parenthesized argument (e.g., "by (metis (lifting) ...)").
2202 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
2204 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
2206 * New "case_product" attribute to generate a case rule doing multiple
2207 case distinctions at the same time. E.g.
2209 list.exhaust [case_product nat.exhaust]
2211 produces a rule which can be used to perform case distinction on both
2214 * New "eventually_elim" method as a generalized variant of the
2215 eventually_elim* rules. Supports structured proofs.
2217 * Typedef with implicit set definition is considered legacy. Use
2218 "typedef (open)" form instead, which will eventually become the
2221 * Record: code generation can be switched off manually with
2223 declare [[record_coden = false]] -- "default true"
2225 * Datatype: type parameters allow explicit sort constraints.
2227 * Concrete syntax for case expressions includes constraints for source
2228 positions, and thus produces Prover IDE markup for its bindings.
2229 INCOMPATIBILITY for old-style syntax translations that augment the
2230 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
2233 * Clarified attribute "mono_set": pure declaration without modifying
2234 the result of the fact expression.
2236 * More default pred/set conversions on a couple of relation operations
2237 and predicates. Added powers of predicate relations. Consolidation
2238 of some relation theorems:
2240 converse_def ~> converse_unfold
2241 rel_comp_def ~> relcomp_unfold
2242 symp_def ~> (modified, use symp_def and sym_def instead)
2243 transp_def ~> transp_trans
2244 Domain_def ~> Domain_unfold
2245 Range_def ~> Domain_converse [symmetric]
2247 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
2249 See theory "Relation" for examples for making use of pred/set
2250 conversions by means of attributes "to_set" and "to_pred".
2254 * Renamed facts about the power operation on relations, i.e., relpow
2255 to match the constant's name:
2257 rel_pow_1 ~> relpow_1
2258 rel_pow_0_I ~> relpow_0_I
2259 rel_pow_Suc_I ~> relpow_Suc_I
2260 rel_pow_Suc_I2 ~> relpow_Suc_I2
2261 rel_pow_0_E ~> relpow_0_E
2262 rel_pow_Suc_E ~> relpow_Suc_E
2263 rel_pow_E ~> relpow_E
2264 rel_pow_Suc_D2 ~> relpow_Suc_D2
2265 rel_pow_Suc_E2 ~> relpow_Suc_E2
2266 rel_pow_Suc_D2' ~> relpow_Suc_D2'
2267 rel_pow_E2 ~> relpow_E2
2268 rel_pow_add ~> relpow_add
2269 rel_pow_commute ~> relpow
2270 rel_pow_empty ~> relpow_empty:
2271 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
2272 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
2273 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
2274 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
2275 rel_pow_fun_conv ~> relpow_fun_conv
2276 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
2277 rel_pow_finite_bounded ~> relpow_finite_bounded
2278 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
2279 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
2280 single_valued_rel_pow ~> single_valued_relpow
2284 * Theory Relation: Consolidated constant name for relation composition
2285 and corresponding theorem names:
2287 - Renamed constant rel_comp to relcomp.
2289 - Dropped abbreviation pred_comp. Use relcompp instead.
2293 rel_compI ~> relcompI
2294 rel_compEpair ~> relcompEpair
2295 rel_compE ~> relcompE
2296 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
2297 rel_comp_empty1 ~> relcomp_empty1
2298 rel_comp_mono ~> relcomp_mono
2299 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
2300 rel_comp_distrib ~> relcomp_distrib
2301 rel_comp_distrib2 ~> relcomp_distrib2
2302 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
2303 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
2304 single_valued_rel_comp ~> single_valued_relcomp
2305 rel_comp_def ~> relcomp_unfold
2306 converse_rel_comp ~> converse_relcomp
2307 pred_compI ~> relcomppI
2308 pred_compE ~> relcomppE
2309 pred_comp_bot1 ~> relcompp_bot1
2310 pred_comp_bot2 ~> relcompp_bot2
2311 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
2312 pred_comp_mono ~> relcompp_mono
2313 pred_comp_distrib ~> relcompp_distrib
2314 pred_comp_distrib2 ~> relcompp_distrib2
2315 converse_pred_comp ~> converse_relcompp
2317 finite_rel_comp ~> finite_relcomp
2319 set_rel_comp ~> set_relcomp
2323 * Theory Divides: Discontinued redundant theorems about div and mod.
2324 INCOMPATIBILITY, use the corresponding generic theorems instead.
2326 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
2327 zdiv_self ~> div_self
2328 zmod_self ~> mod_self
2331 zdiv_zmod_equality ~> div_mod_equality2
2332 zdiv_zmod_equality2 ~> div_mod_equality
2333 zmod_zdiv_trivial ~> mod_div_trivial
2334 zdiv_zminus_zminus ~> div_minus_minus
2335 zmod_zminus_zminus ~> mod_minus_minus
2336 zdiv_zminus2 ~> div_minus_right
2337 zmod_zminus2 ~> mod_minus_right
2338 zdiv_minus1_right ~> div_minus1_right
2339 zmod_minus1_right ~> mod_minus1_right
2340 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
2341 zmod_zmult1_eq ~> mod_mult_right_eq
2342 zpower_zmod ~> power_mod
2343 zdvd_zmod ~> dvd_mod
2344 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
2345 mod_mult_distrib ~> mult_mod_left
2346 mod_mult_distrib2 ~> mult_mod_right
2348 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
2349 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
2351 * Finite_Set.fold now qualified. INCOMPATIBILITY.
2353 * Consolidated theorem names concerning fold combinators:
2355 inf_INFI_fold_inf ~> inf_INF_fold_inf
2356 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
2357 INFI_fold_inf ~> INF_fold_inf
2358 SUPR_fold_sup ~> SUP_fold_sup
2359 union_set ~> union_set_fold
2360 minus_set ~> minus_set_fold
2361 INFI_set_fold ~> INF_set_fold
2362 SUPR_set_fold ~> SUP_set_fold
2363 INF_code ~> INF_set_foldr
2364 SUP_code ~> SUP_set_foldr
2365 foldr.simps ~> foldr.simps (in point-free formulation)
2366 foldr_fold_rev ~> foldr_conv_fold
2367 foldl_fold ~> foldl_conv_fold
2368 foldr_foldr ~> foldr_conv_foldl
2369 foldl_foldr ~> foldl_conv_foldr
2370 fold_set_remdups ~> fold_set_fold_remdups
2371 fold_set ~> fold_set_fold
2372 fold1_set ~> fold1_set_fold
2376 * Dropped rarely useful theorems concerning fold combinators:
2377 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
2378 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
2379 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
2380 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
2381 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
2382 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
2383 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
2384 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
2385 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
2386 unfolding "foldr_conv_fold" and "foldl_conv_fold".
2388 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
2389 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
2390 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
2391 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
2392 lemmas over fold rather than foldr, or make use of lemmas
2393 fold_conv_foldr and fold_rev.
2395 * Congruence rules Option.map_cong and Option.bind_cong for recursion
2396 through option types.
2398 * "Transitive_Closure.ntrancl": bounded transitive closure on
2401 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
2403 * Theory Int: Discontinued many legacy theorems specific to type int.
2404 INCOMPATIBILITY, use the corresponding generic theorems instead.
2406 zminus_zminus ~> minus_minus
2407 zminus_0 ~> minus_zero
2408 zminus_zadd_distrib ~> minus_add_distrib
2409 zadd_commute ~> add_commute
2410 zadd_assoc ~> add_assoc
2411 zadd_left_commute ~> add_left_commute
2414 zadd_0 ~> add_0_left
2415 zadd_0_right ~> add_0_right
2416 zadd_zminus_inverse2 ~> left_minus
2417 zmult_zminus ~> mult_minus_left
2418 zmult_commute ~> mult_commute
2419 zmult_assoc ~> mult_assoc
2420 zadd_zmult_distrib ~> left_distrib
2421 zadd_zmult_distrib2 ~> right_distrib
2422 zdiff_zmult_distrib ~> left_diff_distrib
2423 zdiff_zmult_distrib2 ~> right_diff_distrib
2424 zmult_1 ~> mult_1_left
2425 zmult_1_right ~> mult_1_right
2426 zle_refl ~> order_refl
2427 zle_trans ~> order_trans
2428 zle_antisym ~> order_antisym
2429 zle_linear ~> linorder_linear
2430 zless_linear ~> linorder_less_linear
2431 zadd_left_mono ~> add_left_mono
2432 zadd_strict_right_mono ~> add_strict_right_mono
2433 zadd_zless_mono ~> add_less_le_mono
2434 int_0_less_1 ~> zero_less_one
2435 int_0_neq_1 ~> zero_neq_one
2437 zpower_zadd_distrib ~> power_add
2438 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
2439 zero_le_zpower_abs ~> zero_le_power_abs
2441 * Theory Deriv: Renamed
2443 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
2445 * Theory Library/Multiset: Improved code generation of multisets.
2447 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
2448 are expressed via type classes again. The special syntax
2449 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
2450 setsum_set, which is now subsumed by Big_Operators.setsum.
2453 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
2454 use theory HOL/Library/Nat_Bijection instead.
2456 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
2457 trees is now inside a type class context. Names of affected
2458 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
2459 theories working directly with raw red-black trees, adapt the names as
2463 bulkload -> rbt_bulkload
2464 del_from_left -> rbt_del_from_left
2465 del_from_right -> rbt_del_from_right
2467 delete -> rbt_delete
2469 insert -> rbt_insert
2470 insertw -> rbt_insert_with
2471 insert_with_key -> rbt_insert_with_key
2472 map_entry -> rbt_map_entry
2473 lookup -> rbt_lookup
2474 sorted -> rbt_sorted
2475 tree_greater -> rbt_greater
2476 tree_less -> rbt_less
2477 tree_less_symbol -> rbt_less_symbol
2479 union_with -> rbt_union_with
2480 union_with_key -> rbt_union_with_key
2483 balance_left_sorted -> balance_left_rbt_sorted
2484 balance_left_tree_greater -> balance_left_rbt_greater
2485 balance_left_tree_less -> balance_left_rbt_less
2486 balance_right_sorted -> balance_right_rbt_sorted
2487 balance_right_tree_greater -> balance_right_rbt_greater
2488 balance_right_tree_less -> balance_right_rbt_less
2489 balance_sorted -> balance_rbt_sorted
2490 balance_tree_greater -> balance_rbt_greater
2491 balance_tree_less -> balance_rbt_less
2492 bulkload_is_rbt -> rbt_bulkload_is_rbt
2493 combine_sorted -> combine_rbt_sorted
2494 combine_tree_greater -> combine_rbt_greater
2495 combine_tree_less -> combine_rbt_less
2496 delete_in_tree -> rbt_delete_in_tree
2497 delete_is_rbt -> rbt_delete_is_rbt
2498 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
2499 del_from_left_tree_less -> rbt_del_from_left_rbt_less
2500 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
2501 del_from_right_tree_less -> rbt_del_from_right_rbt_less
2502 del_in_tree -> rbt_del_in_tree
2503 del_inv1_inv2 -> rbt_del_inv1_inv2
2504 del_sorted -> rbt_del_rbt_sorted
2505 del_tree_greater -> rbt_del_rbt_greater
2506 del_tree_less -> rbt_del_rbt_less
2507 dom_lookup_Branch -> dom_rbt_lookup_Branch
2508 entries_lookup -> entries_rbt_lookup
2509 finite_dom_lookup -> finite_dom_rbt_lookup
2510 insert_sorted -> rbt_insert_rbt_sorted
2511 insertw_is_rbt -> rbt_insertw_is_rbt
2512 insertwk_is_rbt -> rbt_insertwk_is_rbt
2513 insertwk_sorted -> rbt_insertwk_rbt_sorted
2514 insertw_sorted -> rbt_insertw_rbt_sorted
2515 ins_sorted -> ins_rbt_sorted
2516 ins_tree_greater -> ins_rbt_greater
2517 ins_tree_less -> ins_rbt_less
2518 is_rbt_sorted -> is_rbt_rbt_sorted
2519 lookup_balance -> rbt_lookup_balance
2520 lookup_bulkload -> rbt_lookup_rbt_bulkload
2521 lookup_delete -> rbt_lookup_rbt_delete
2522 lookup_Empty -> rbt_lookup_Empty
2523 lookup_from_in_tree -> rbt_lookup_from_in_tree
2524 lookup_in_tree -> rbt_lookup_in_tree
2525 lookup_ins -> rbt_lookup_ins
2526 lookup_insert -> rbt_lookup_rbt_insert
2527 lookup_insertw -> rbt_lookup_rbt_insertw
2528 lookup_insertwk -> rbt_lookup_rbt_insertwk
2529 lookup_keys -> rbt_lookup_keys
2530 lookup_map -> rbt_lookup_map
2531 lookup_map_entry -> rbt_lookup_rbt_map_entry
2532 lookup_tree_greater -> rbt_lookup_rbt_greater
2533 lookup_tree_less -> rbt_lookup_rbt_less
2534 lookup_union -> rbt_lookup_rbt_union
2535 map_entry_color_of -> rbt_map_entry_color_of
2536 map_entry_inv1 -> rbt_map_entry_inv1
2537 map_entry_inv2 -> rbt_map_entry_inv2
2538 map_entry_is_rbt -> rbt_map_entry_is_rbt
2539 map_entry_sorted -> rbt_map_entry_rbt_sorted
2540 map_entry_tree_greater -> rbt_map_entry_rbt_greater
2541 map_entry_tree_less -> rbt_map_entry_rbt_less
2542 map_tree_greater -> map_rbt_greater
2543 map_tree_less -> map_rbt_less
2544 map_sorted -> map_rbt_sorted
2545 paint_sorted -> paint_rbt_sorted
2546 paint_lookup -> paint_rbt_lookup
2547 paint_tree_greater -> paint_rbt_greater
2548 paint_tree_less -> paint_rbt_less
2549 sorted_entries -> rbt_sorted_entries
2550 tree_greater_eq_trans -> rbt_greater_eq_trans
2551 tree_greater_nit -> rbt_greater_nit
2552 tree_greater_prop -> rbt_greater_prop
2553 tree_greater_simps -> rbt_greater_simps
2554 tree_greater_trans -> rbt_greater_trans
2555 tree_less_eq_trans -> rbt_less_eq_trans
2556 tree_less_nit -> rbt_less_nit
2557 tree_less_prop -> rbt_less_prop
2558 tree_less_simps -> rbt_less_simps
2559 tree_less_trans -> rbt_less_trans
2560 tree_ord_props -> rbt_ord_props
2561 union_Branch -> rbt_union_Branch
2562 union_is_rbt -> rbt_union_is_rbt
2563 unionw_is_rbt -> rbt_unionw_is_rbt
2564 unionwk_is_rbt -> rbt_unionwk_is_rbt
2565 unionwk_sorted -> rbt_unionwk_rbt_sorted
2567 * Theory HOL/Library/Float: Floating point numbers are now defined as
2568 a subset of the real numbers. All operations are defined using the
2569 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
2576 round_down -> float_round_down
2577 round_up -> float_round_up
2581 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
2584 abs_float_def -> Float.compute_float_abs
2585 bitlen_ge0 -> bitlen_nonneg
2586 bitlen.simps -> Float.compute_bitlen
2587 float_components -> Float_mantissa_exponent
2588 float_divl.simps -> Float.compute_float_divl
2589 float_divr.simps -> Float.compute_float_divr
2590 float_eq_odd -> mult_powr_eq_mult_powr_iff
2591 float_power -> real_of_float_power
2592 lapprox_posrat_def -> Float.compute_lapprox_posrat
2593 lapprox_rat.simps -> Float.compute_lapprox_rat
2594 le_float_def' -> Float.compute_float_le
2595 le_float_def -> less_eq_float.rep_eq
2596 less_float_def' -> Float.compute_float_less
2597 less_float_def -> less_float.rep_eq
2598 normfloat_def -> Float.compute_normfloat
2599 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
2600 normfloat -> normfloat_def
2601 normfloat_unique -> use normfloat_def
2602 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
2603 one_float_def -> Float.compute_float_one
2604 plus_float_def -> Float.compute_float_plus
2605 rapprox_posrat_def -> Float.compute_rapprox_posrat
2606 rapprox_rat.simps -> Float.compute_rapprox_rat
2607 real_of_float_0 -> zero_float.rep_eq
2608 real_of_float_1 -> one_float.rep_eq
2609 real_of_float_abs -> abs_float.rep_eq
2610 real_of_float_add -> plus_float.rep_eq
2611 real_of_float_minus -> uminus_float.rep_eq
2612 real_of_float_mult -> times_float.rep_eq
2613 real_of_float_simp -> Float.rep_eq
2614 real_of_float_sub -> minus_float.rep_eq
2615 round_down.simps -> Float.compute_float_round_down
2616 round_up.simps -> Float.compute_float_round_up
2617 times_float_def -> Float.compute_float_times
2618 uminus_float_def -> Float.compute_float_uminus
2619 zero_float_def -> Float.compute_float_zero
2621 Lemmas not necessary anymore, use the transfer method:
2622 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
2623 float_divr, float_le_simp, float_less1_mantissa_bound,
2624 float_less_simp, float_less_zero, float_le_zero,
2625 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
2626 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
2627 lapprox_rat_bottom, normalized_float, rapprox_posrat,
2628 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
2629 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
2630 round_up, zero_le_float, zero_less_float
2632 * New theory HOL/Library/DAList provides an abstract type for
2633 association lists with distinct keys.
2635 * Session HOL/IMP: Added new theory of abstract interpretation of
2638 * Session HOL-Import: Re-implementation from scratch is faster,
2639 simpler, and more scalable. Requires a proof bundle, which is
2640 available as an external component. Discontinued old (and mostly
2641 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
2643 * Session HOL-Word: Discontinued many redundant theorems specific to
2644 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
2647 word_sub_alt ~> word_sub_wi
2648 word_add_alt ~> word_add_def
2649 word_mult_alt ~> word_mult_def
2650 word_minus_alt ~> word_minus_def
2651 word_0_alt ~> word_0_wi
2652 word_1_alt ~> word_1_wi
2653 word_add_0 ~> add_0_left
2654 word_add_0_right ~> add_0_right
2655 word_mult_1 ~> mult_1_left
2656 word_mult_1_right ~> mult_1_right
2657 word_add_commute ~> add_commute
2658 word_add_assoc ~> add_assoc
2659 word_add_left_commute ~> add_left_commute
2660 word_mult_commute ~> mult_commute
2661 word_mult_assoc ~> mult_assoc
2662 word_mult_left_commute ~> mult_left_commute
2663 word_left_distrib ~> left_distrib
2664 word_right_distrib ~> right_distrib
2665 word_left_minus ~> left_minus
2666 word_diff_0_right ~> diff_0_right
2667 word_diff_self ~> diff_self
2668 word_sub_def ~> diff_minus
2669 word_diff_minus ~> diff_minus
2670 word_add_ac ~> add_ac
2671 word_mult_ac ~> mult_ac
2672 word_plus_ac0 ~> add_0_left add_0_right add_ac
2673 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
2674 word_order_trans ~> order_trans
2675 word_order_refl ~> order_refl
2676 word_order_antisym ~> order_antisym
2677 word_order_linear ~> linorder_linear
2678 lenw1_zero_neq_one ~> zero_neq_one
2679 word_number_of_eq ~> number_of_eq
2680 word_of_int_add_hom ~> wi_hom_add
2681 word_of_int_sub_hom ~> wi_hom_sub
2682 word_of_int_mult_hom ~> wi_hom_mult
2683 word_of_int_minus_hom ~> wi_hom_neg
2684 word_of_int_succ_hom ~> wi_hom_succ
2685 word_of_int_pred_hom ~> wi_hom_pred
2686 word_of_int_0_hom ~> word_0_wi
2687 word_of_int_1_hom ~> word_1_wi
2689 * Session HOL-Word: New proof method "word_bitwise" for splitting
2690 machine word equalities and inequalities into logical circuits,
2691 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
2692 multiplication, shifting by constants, bitwise operators and numeric
2693 constants. Requires fixed-length word types, not 'a word. Solves
2694 many standard word identities outright and converts more into first
2695 order problems amenable to blast or similar. See also examples in
2696 HOL/Word/Examples/WordExamples.thy.
2698 * Session HOL-Probability: Introduced the type "'a measure" to
2699 represent measures, this replaces the records 'a algebra and 'a
2700 measure_space. The locales based on subset_class now have two
2701 locale-parameters the space \<Omega> and the set of measurable sets M.
2702 The product of probability spaces uses now the same constant as the
2703 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
2704 measure". Most constants are defined now outside of locales and gain
2705 an additional parameter, like null_sets, almost_eventually or \<mu>'.
2706 Measure space constructions for distributions and densities now got
2707 their own constants distr and density. Instead of using locales to
2708 describe measure spaces with a finite space, the measure count_space
2709 and point_measure is introduced. INCOMPATIBILITY.
2713 finite_measure.\<mu>' -> measure
2714 product_algebra_generator -> prod_algebra
2715 product_prob_space.emb -> prod_emb
2716 product_prob_space.infprod_algebra -> PiM
2719 completeable_measure_space
2720 finite_measure_space
2722 finite_product_finite_prob_space
2723 finite_product_sigma_algebra
2724 finite_sigma_algebra
2726 pair_finite_prob_space
2727 pair_finite_sigma_algebra
2730 product_sigma_algebra
2734 distribution -> use distr measure, or distributed predicate
2736 joint_distribution -> use distr measure, or distributed predicate
2737 pair_measure_generator
2738 product_prob_space.infprod_algebra -> use PiM
2741 Replacement theorems:
2742 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
2743 finite_measure.empty_measure -> measure_empty
2744 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
2745 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
2746 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
2747 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
2748 finite_measure.finite_measure -> finite_measure.emeasure_finite
2749 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
2750 finite_measure.positive_measure' -> measure_nonneg
2751 finite_measure.real_measure -> finite_measure.emeasure_real
2752 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
2753 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
2754 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
2755 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
2756 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
2757 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
2758 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
2759 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
2760 information_space.entropy_commute -> information_space.entropy_commute_simple
2761 information_space.entropy_eq -> information_space.entropy_simple_distributed
2762 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
2763 information_space.entropy_positive -> information_space.entropy_nonneg_simple
2764 information_space.entropy_uniform_max -> information_space.entropy_uniform
2765 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
2766 information_space.KL_eq_0 -> information_space.KL_same_eq_0
2767 information_space.KL_ge_0 -> information_space.KL_nonneg
2768 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
2769 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
2770 Int_stable_cuboids -> Int_stable_atLeastAtMost
2771 Int_stable_product_algebra_generator -> positive_integral
2772 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
2773 measure_space.additive -> emeasure_additive
2774 measure_space.AE_iff_null_set -> AE_iff_null
2775 measure_space.almost_everywhere_def -> eventually_ae_filter
2776 measure_space.almost_everywhere_vimage -> AE_distrD
2777 measure_space.continuity_from_above -> INF_emeasure_decseq
2778 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
2779 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
2780 measure_space.continuity_from_below -> SUP_emeasure_incseq
2781 measure_space_density -> emeasure_density
2782 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
2783 measure_space.integrable_vimage -> integrable_distr
2784 measure_space.integral_translated_density -> integral_density
2785 measure_space.integral_vimage -> integral_distr
2786 measure_space.measure_additive -> plus_emeasure
2787 measure_space.measure_compl -> emeasure_compl
2788 measure_space.measure_countable_increasing -> emeasure_countable_increasing
2789 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
2790 measure_space.measure_decseq -> decseq_emeasure
2791 measure_space.measure_Diff -> emeasure_Diff
2792 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
2793 measure_space.measure_eq_0 -> emeasure_eq_0
2794 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
2795 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
2796 measure_space.measure_incseq -> incseq_emeasure
2797 measure_space.measure_insert -> emeasure_insert
2798 measure_space.measure_mono -> emeasure_mono
2799 measure_space.measure_not_negative -> emeasure_not_MInf
2800 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
2801 measure_space.measure_setsum -> setsum_emeasure
2802 measure_space.measure_setsum_split -> setsum_emeasure_cover
2803 measure_space.measure_space_vimage -> emeasure_distr
2804 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
2805 measure_space.measure_subadditive -> subadditive
2806 measure_space.measure_top -> emeasure_space
2807 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
2808 measure_space.measure_Un_null_set -> emeasure_Un_null_set
2809 measure_space.positive_integral_translated_density -> positive_integral_density
2810 measure_space.positive_integral_vimage -> positive_integral_distr
2811 measure_space.real_continuity_from_above -> Lim_measure_decseq
2812 measure_space.real_continuity_from_below -> Lim_measure_incseq
2813 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
2814 measure_space.real_measure_Diff -> measure_Diff
2815 measure_space.real_measure_finite_Union -> measure_finite_Union
2816 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
2817 measure_space.real_measure_subadditive -> measure_subadditive
2818 measure_space.real_measure_Union -> measure_Union
2819 measure_space.real_measure_UNION -> measure_UNION
2820 measure_space.simple_function_vimage -> simple_function_comp
2821 measure_space.simple_integral_vimage -> simple_integral_distr
2822 measure_space.simple_integral_vimage -> simple_integral_distr
2823 measure_unique_Int_stable -> measure_eqI_generator_eq
2824 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
2825 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
2826 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
2827 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
2828 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
2829 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
2830 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
2831 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
2832 pair_sigma_algebra.sets_swap -> sets_pair_swap
2833 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
2834 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
2835 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
2836 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
2837 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
2838 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
2839 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
2840 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
2841 prob_space.measure_space_1 -> prob_space.emeasure_space_1
2842 prob_space.prob_space_vimage -> prob_space_distr
2843 prob_space.random_variable_restrict -> measurable_restrict
2844 prob_space_unique_Int_stable -> measure_eqI_prob_space
2845 product_algebraE -> prod_algebraE_all
2846 product_algebra_generator_der -> prod_algebra_eq_finite
2847 product_algebra_generator_into_space -> prod_algebra_sets_into_space
2848 product_algebraI -> sets_PiM_I_finite
2849 product_measure_exists -> product_sigma_finite.sigma_finite
2850 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
2851 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
2852 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
2853 product_prob_space.measurable_component -> measurable_component_singleton
2854 product_prob_space.measurable_emb -> measurable_prod_emb
2855 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
2856 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
2857 product_prob_space.measure_emb -> emeasure_prod_emb
2858 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
2859 product_sigma_algebra.product_algebra_into_space -> space_closed
2860 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
2861 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
2862 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
2863 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
2864 sets_product_algebra -> sets_PiM
2865 sigma_algebra.measurable_sigma -> measurable_measure_of
2866 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
2867 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
2868 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
2869 space_product_algebra -> space_PiM
2871 * Session HOL-TPTP: support to parse and import TPTP problems (all
2872 languages) into Isabelle/HOL.
2877 * New "case_product" attribute (see HOL).
2882 * Greater support for structured proofs involving induction or case
2885 * Much greater use of mathematical symbols.
2887 * Removal of many ML theorem bindings. INCOMPATIBILITY.
2892 * Antiquotation @{keyword "name"} produces a parser for outer syntax
2893 from a minor keyword introduced via theory header declaration.
2895 * Antiquotation @{command_spec "name"} produces the
2896 Outer_Syntax.command_spec from a major keyword introduced via theory
2897 header declaration; it can be passed to Outer_Syntax.command etc.
2899 * Local_Theory.define no longer hard-wires default theorem name
2900 "foo_def", but retains the binding as given. If that is Binding.empty
2901 / Attrib.empty_binding, the result is not registered as user-level
2902 fact. The Local_Theory.define_internal variant allows to specify a
2903 non-empty name (used for the foundation in the background theory),
2904 while omitting the fact binding in the user-context. Potential
2905 INCOMPATIBILITY for derived definitional packages: need to specify
2906 naming policy for primitive definitions more explicitly.
2908 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
2909 conformance with similar operations in structure Term and Logic.
2911 * Antiquotation @{attributes [...]} embeds attribute source
2912 representation into the ML text, which is particularly useful with
2913 declarations like Local_Theory.note.
2915 * Structure Proof_Context follows standard naming scheme. Old
2916 ProofContext has been discontinued. INCOMPATIBILITY.
2918 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
2919 change of semantics: update is applied to auxiliary local theory
2922 * Modernized some old-style infix operations:
2924 addeqcongs ~> Simplifier.add_eqcong
2925 deleqcongs ~> Simplifier.del_eqcong
2926 addcongs ~> Simplifier.add_cong
2927 delcongs ~> Simplifier.del_cong
2928 setmksimps ~> Simplifier.set_mksimps
2929 setmkcong ~> Simplifier.set_mkcong
2930 setmksym ~> Simplifier.set_mksym
2931 setmkeqTrue ~> Simplifier.set_mkeqTrue
2932 settermless ~> Simplifier.set_termless
2933 setsubgoaler ~> Simplifier.set_subgoaler
2934 addsplits ~> Splitter.add_split
2935 delsplits ~> Splitter.del_split
2940 * USER_HOME settings variable points to cross-platform user home
2941 directory, which coincides with HOME on POSIX systems only. Likewise,
2942 the Isabelle path specification "~" now expands to $USER_HOME, instead
2943 of former $HOME. A different default for USER_HOME may be set
2944 explicitly in shell environment, before Isabelle settings are
2945 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
2946 the generic user home was intended.
2948 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
2949 notation, which is useful for the jEdit file browser, for example.
2951 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
2956 New in Isabelle2011-1 (October 2011)
2957 ------------------------------------
2961 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
2962 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
2964 - Management of multiple theory files directly from the editor
2965 buffer store -- bypassing the file-system (no requirement to save
2966 files for checking).
2968 - Markup of formal entities within the text buffer, with semantic
2969 highlighting, tooltips and hyperlinks to jump to defining source
2972 - Improved text rendering, with sub/superscripts in the source
2973 buffer (including support for copy/paste wrt. output panel, HTML
2974 theory output and other non-Isabelle text boxes).
2976 - Refined scheduling of proof checking and printing of results,
2977 based on interactive editor view. (Note: jEdit folding and
2978 narrowing allows to restrict buffer perspectives explicitly.)
2980 - Reduced CPU performance requirements, usable on machines with few
2983 - Reduced memory requirements due to pruning of unused document
2984 versions (garbage collection).
2986 See also ~~/src/Tools/jEdit/README.html for further information,
2987 including some remaining limitations.
2989 * Theory loader: source files are exclusively located via the master
2990 directory of each theory node (where the .thy file itself resides).
2991 The global load path (such as src/HOL/Library) has been discontinued.
2992 Note that the path element ~~ may be used to reference theories in the
2993 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
2996 * Theory loader: source files are identified by content via SHA1
2997 digests. Discontinued former path/modtime identification and optional
2998 ISABELLE_FILE_IDENT plugin scripts.
3000 * Parallelization of nested Isar proofs is subject to
3001 Goal.parallel_proofs_threshold (default 100). See also isabelle
3004 * Name space: former unsynchronized references are now proper
3005 configuration options, with more conventional names:
3007 long_names ~> names_long
3008 short_names ~> names_short
3009 unique_names ~> names_unique
3011 Minor INCOMPATIBILITY, need to declare options in context like this:
3013 declare [[names_unique = false]]
3015 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
3016 that the result needs to be unique, which means fact specifications
3017 may have to be refined after enriching a proof context.
3019 * Attribute "case_names" has been refined: the assumptions in each case
3020 can be named now by following the case name with [name1 name2 ...].
3022 * Isabelle/Isar reference manual has been updated and extended:
3023 - "Synopsis" provides a catalog of main Isar language concepts.
3024 - Formal references in syntax diagrams, via @{rail} antiquotation.
3025 - Updated material from classic "ref" manual, notably about
3026 "Classical Reasoner".
3031 * Class bot and top require underlying partial order rather than
3032 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
3034 * Class complete_lattice: generalized a couple of lemmas from sets;
3035 generalized theorems INF_cong and SUP_cong. New type classes for
3036 complete boolean algebras and complete linear orders. Lemmas
3037 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
3038 class complete_linorder.
3040 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
3041 Sup_fun_def, Inf_apply, Sup_apply.
3043 Removed redundant lemmas (the right hand side gives hints how to
3044 replace them for (metis ...), or (simp only: ...) proofs):
3046 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
3047 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
3048 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
3049 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
3050 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
3051 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
3052 Inter_def ~> INF_def, image_def
3053 Union_def ~> SUP_def, image_def
3054 INT_eq ~> INF_def, and image_def
3055 UN_eq ~> SUP_def, and image_def
3056 INF_subset ~> INF_superset_mono [OF _ order_refl]
3058 More consistent and comprehensive names:
3060 INTER_eq_Inter_image ~> INF_def
3061 UNION_eq_Union_image ~> SUP_def
3064 INF_leI ~> INF_lower
3065 INF_leI2 ~> INF_lower2
3066 le_INFI ~> INF_greatest
3067 le_SUPI ~> SUP_upper
3068 le_SUPI2 ~> SUP_upper2
3069 SUP_leI ~> SUP_least
3070 INFI_bool_eq ~> INF_bool_eq
3071 SUPR_bool_eq ~> SUP_bool_eq
3072 INFI_apply ~> INF_apply
3073 SUPR_apply ~> SUP_apply
3074 INTER_def ~> INTER_eq
3075 UNION_def ~> UNION_eq
3079 * Renamed theory Complete_Lattice to Complete_Lattices.
3082 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
3083 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
3084 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
3085 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
3087 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
3088 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
3089 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
3092 * Added syntactic classes "inf" and "sup" for the respective
3093 constants. INCOMPATIBILITY: Changes in the argument order of the
3094 (mostly internal) locale predicates for some derived classes.
3096 * Theorem collections ball_simps and bex_simps do not contain theorems
3097 referring to UNION any longer; these have been moved to collection
3098 UN_ball_bex_simps. INCOMPATIBILITY.
3100 * Theory Archimedean_Field: floor now is defined as parameter of a
3101 separate type class floor_ceiling.
3103 * Theory Finite_Set: more coherent development of fold_set locales:
3105 locale fun_left_comm ~> locale comp_fun_commute
3106 locale fun_left_comm_idem ~> locale comp_fun_idem
3108 Both use point-free characterization; interpretation proofs may need
3109 adjustment. INCOMPATIBILITY.
3111 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
3112 accordance with standard mathematical terminology. INCOMPATIBILITY.
3114 * Theory Complex_Main: The locale interpretations for the
3115 bounded_linear and bounded_bilinear locales have been removed, in
3116 order to reduce the number of duplicate lemmas. Users must use the
3117 original names for distributivity theorems, potential INCOMPATIBILITY.
3119 divide.add ~> add_divide_distrib
3120 divide.diff ~> diff_divide_distrib
3121 divide.setsum ~> setsum_divide_distrib
3122 mult.add_right ~> right_distrib
3123 mult.diff_right ~> right_diff_distrib
3124 mult_right.setsum ~> setsum_right_distrib
3125 mult_left.diff ~> left_diff_distrib
3127 * Theory Complex_Main: Several redundant theorems have been removed or
3128 replaced by more general versions. INCOMPATIBILITY.
3130 real_diff_def ~> minus_real_def
3131 real_divide_def ~> divide_real_def
3132 real_less_def ~> less_le
3133 real_abs_def ~> abs_real_def
3134 real_sgn_def ~> sgn_real_def
3135 real_mult_commute ~> mult_commute
3136 real_mult_assoc ~> mult_assoc
3137 real_mult_1 ~> mult_1_left
3138 real_add_mult_distrib ~> left_distrib
3139 real_zero_not_eq_one ~> zero_neq_one
3140 real_mult_inverse_left ~> left_inverse
3141 INVERSE_ZERO ~> inverse_zero
3142 real_le_refl ~> order_refl
3143 real_le_antisym ~> order_antisym
3144 real_le_trans ~> order_trans
3145 real_le_linear ~> linear
3146 real_le_eq_diff ~> le_iff_diff_le_0
3147 real_add_left_mono ~> add_left_mono
3148 real_mult_order ~> mult_pos_pos
3149 real_mult_less_mono2 ~> mult_strict_left_mono
3150 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
3151 real_0_le_divide_iff ~> zero_le_divide_iff
3152 realpow_two_disj ~> power2_eq_iff
3153 real_squared_diff_one_factored ~> square_diff_one_factored
3154 realpow_two_diff ~> square_diff_square_factored
3155 reals_complete2 ~> complete_real
3156 real_sum_squared_expand ~> power2_sum
3157 exp_ln_eq ~> ln_unique
3159 expi_zero ~> exp_zero
3160 lemma_DERIV_subst ~> DERIV_cong
3161 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
3162 LIMSEQ_const ~> tendsto_const
3163 LIMSEQ_norm ~> tendsto_norm
3164 LIMSEQ_add ~> tendsto_add
3165 LIMSEQ_minus ~> tendsto_minus
3166 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
3167 LIMSEQ_diff ~> tendsto_diff
3168 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
3169 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
3170 LIMSEQ_mult ~> tendsto_mult
3171 LIMSEQ_inverse ~> tendsto_inverse
3172 LIMSEQ_divide ~> tendsto_divide
3173 LIMSEQ_pow ~> tendsto_power
3174 LIMSEQ_setsum ~> tendsto_setsum
3175 LIMSEQ_setprod ~> tendsto_setprod
3176 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
3177 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
3178 LIMSEQ_imp_rabs ~> tendsto_rabs
3179 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
3180 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
3181 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
3182 LIMSEQ_Complex ~> tendsto_Complex
3183 LIM_ident ~> tendsto_ident_at
3184 LIM_const ~> tendsto_const
3185 LIM_add ~> tendsto_add
3186 LIM_add_zero ~> tendsto_add_zero
3187 LIM_minus ~> tendsto_minus
3188 LIM_diff ~> tendsto_diff
3189 LIM_norm ~> tendsto_norm
3190 LIM_norm_zero ~> tendsto_norm_zero
3191 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
3192 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
3193 LIM_rabs ~> tendsto_rabs
3194 LIM_rabs_zero ~> tendsto_rabs_zero
3195 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
3196 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
3197 LIM_compose ~> tendsto_compose
3198 LIM_mult ~> tendsto_mult
3199 LIM_scaleR ~> tendsto_scaleR
3200 LIM_of_real ~> tendsto_of_real
3201 LIM_power ~> tendsto_power
3202 LIM_inverse ~> tendsto_inverse
3203 LIM_sgn ~> tendsto_sgn
3204 isCont_LIM_compose ~> isCont_tendsto_compose
3205 bounded_linear.LIM ~> bounded_linear.tendsto
3206 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
3207 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
3208 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
3209 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
3210 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
3211 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
3213 * Theory Complex_Main: The definition of infinite series was
3214 generalized. Now it is defined on the type class {topological_space,
3215 comm_monoid_add}. Hence it is useable also for extended real numbers.
3217 * Theory Complex_Main: The complex exponential function "expi" is now
3218 a type-constrained abbreviation for "exp :: complex => complex"; thus
3219 several polymorphic lemmas about "exp" are now applicable to "expi".
3223 - Theory Library/Code_Char_ord provides native ordering of
3224 characters in the target language.
3226 - Commands code_module and code_library are legacy, use export_code
3229 - Method "evaluation" is legacy, use method "eval" instead.
3231 - Legacy evaluator "SML" is deactivated by default. May be
3232 reactivated by the following theory command:
3234 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
3236 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
3238 * New proof method "induction" that gives induction hypotheses the
3239 name "IH", thus distinguishing them from further hypotheses that come
3240 from rule induction. The latter are still called "hyps". Method
3241 "induction" is a thin wrapper around "induct" and follows the same
3244 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
3245 still available as a legacy feature for some time.
3248 - Added "need" and "total_consts" options.
3249 - Reintroduced "show_skolems" option by popular demand.
3250 - Renamed attribute: nitpick_def ~> nitpick_unfold.
3254 - Use quasi-sound (and efficient) translations by default.
3255 - Added support for the following provers: E-ToFoF, LEO-II,
3256 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
3257 - Automatically preplay and minimize proofs before showing them if
3258 this can be done within reasonable time.
3259 - sledgehammer available_provers ~> sledgehammer supported_provers.
3261 - Added "preplay_timeout", "slicing", "type_enc", "sound",
3262 "max_mono_iters", and "max_new_mono_instances" options.
3263 - Removed "explicit_apply" and "full_types" options as well as "Full
3264 Types" Proof General menu item. INCOMPATIBILITY.
3267 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
3268 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
3272 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
3273 "elim:" options. INCOMPATIBILITY.
3274 - Introduced 'try' that not only runs 'try_methods' but also
3275 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
3278 - Added "eval" option to evaluate terms for the found counterexample
3279 (currently only supported by the default (exhaustive) tester).
3280 - Added post-processing of terms to obtain readable counterexamples
3281 (currently only supported by the default (exhaustive) tester).
3282 - New counterexample generator quickcheck[narrowing] enables
3283 narrowing-based testing. Requires the Glasgow Haskell compiler
3284 with its installation location defined in the Isabelle settings
3285 environment as ISABELLE_GHC.
3286 - Removed quickcheck tester "SML" based on the SML code generator
3287 (formly in HOL/Library).
3289 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
3290 use 'partial_function' instead.
3292 * Theory Library/Extended_Reals replaces now the positive extended
3293 reals found in probability theory. This file is extended by
3294 Multivariate_Analysis/Extended_Real_Limits.
3296 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
3297 from where it must be imported explicitly if it is really required.
3300 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
3301 been moved here. INCOMPATIBILITY.
3303 * Theory Library/Saturated provides type of numbers with saturated
3306 * Theory Library/Product_Lattice defines a pointwise ordering for the
3307 product type 'a * 'b, and provides instance proofs for various order
3308 and lattice type classes.
3310 * Theory Library/Countable now provides the "countable_datatype" proof
3311 method for proving "countable" class instances for datatypes.
3313 * Theory Library/Cset_Monad allows do notation for computable sets
3314 (cset) via the generic monad ad-hoc overloading facility.
3316 * Library: Theories of common data structures are split into theories
3317 for implementation, an invariant-ensuring type, and connection to an
3318 abstract type. INCOMPATIBILITY.
3320 - RBT is split into RBT and RBT_Mapping.
3321 - AssocList is split and renamed into AList and AList_Mapping.
3322 - DList is split into DList_Impl, DList, and DList_Cset.
3323 - Cset is split into Cset and List_Cset.
3325 * Theory Library/Nat_Infinity has been renamed to
3326 Library/Extended_Nat, with name changes of the following types and
3329 type inat ~> type enat
3331 Infty ~> infinity (overloaded)
3335 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
3336 been renamed accordingly. INCOMPATIBILITY.
3338 * Session Multivariate_Analysis: The euclidean_space type class now
3339 fixes a constant "Basis :: 'a set" consisting of the standard
3340 orthonormal basis for the type. Users now have the option of
3341 quantifying over this set instead of using the "basis" function, e.g.
3342 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
3344 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
3345 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
3346 "Cart_nth" and "Cart_lambda" have been respectively renamed to
3347 "vec_nth" and "vec_lambda"; theorems mentioning those names have
3348 changed to match. Definition theorems for overloaded constants now use
3349 the standard "foo_vec_def" naming scheme. A few other theorems have
3350 been renamed as follows (INCOMPATIBILITY):
3352 Cart_eq ~> vec_eq_iff
3353 dist_nth_le_cart ~> dist_vec_nth_le
3354 tendsto_vector ~> vec_tendstoI
3355 Cauchy_vector ~> vec_CauchyI
3357 * Session Multivariate_Analysis: Several duplicate theorems have been
3358 removed, and other theorems have been renamed or replaced with more
3359 general versions. INCOMPATIBILITY.
3361 finite_choice ~> finite_set_choice
3362 eventually_conjI ~> eventually_conj
3363 eventually_and ~> eventually_conj_iff
3364 eventually_false ~> eventually_False
3365 setsum_norm ~> norm_setsum
3366 Lim_sequentially ~> LIMSEQ_def
3367 Lim_ident_at ~> LIM_ident
3368 Lim_const ~> tendsto_const
3369 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
3370 Lim_neg ~> tendsto_minus
3371 Lim_add ~> tendsto_add
3372 Lim_sub ~> tendsto_diff
3373 Lim_mul ~> tendsto_scaleR
3374 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
3375 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
3376 Lim_linear ~> bounded_linear.tendsto
3377 Lim_component ~> tendsto_euclidean_component
3378 Lim_component_cart ~> tendsto_vec_nth
3379 Lim_inner ~> tendsto_inner [OF tendsto_const]
3380 dot_lsum ~> inner_setsum_left
3381 dot_rsum ~> inner_setsum_right
3382 continuous_cmul ~> continuous_scaleR [OF continuous_const]
3383 continuous_neg ~> continuous_minus
3384 continuous_sub ~> continuous_diff
3385 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
3386 continuous_mul ~> continuous_scaleR
3387 continuous_inv ~> continuous_inverse
3388 continuous_at_within_inv ~> continuous_at_within_inverse
3389 continuous_at_inv ~> continuous_at_inverse
3390 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
3391 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
3392 continuous_at_component ~> continuous_component [OF continuous_at_id]
3393 continuous_on_neg ~> continuous_on_minus
3394 continuous_on_sub ~> continuous_on_diff
3395 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
3396 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
3397 continuous_on_mul ~> continuous_on_scaleR
3398 continuous_on_mul_real ~> continuous_on_mult
3399 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
3400 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
3401 continuous_on_inverse ~> continuous_on_inv
3402 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
3403 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
3404 subset_interior ~> interior_mono
3405 subset_closure ~> closure_mono
3406 closure_univ ~> closure_UNIV
3407 real_arch_lt ~> reals_Archimedean2
3408 real_arch ~> reals_Archimedean3
3409 real_abs_norm ~> abs_norm_cancel
3410 real_abs_sub_norm ~> norm_triangle_ineq3
3411 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
3413 * Session HOL-Probability:
3414 - Caratheodory's extension lemma is now proved for ring_of_sets.
3415 - Infinite products of probability measures are now available.
3416 - Sigma closure is independent, if the generator is independent
3417 - Use extended reals instead of positive extended
3418 reals. INCOMPATIBILITY.
3420 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
3422 expand_fun_below ~> fun_below_iff
3423 below_fun_ext ~> fun_belowI
3424 expand_cfun_eq ~> cfun_eq_iff
3425 ext_cfun ~> cfun_eqI
3426 expand_cfun_below ~> cfun_below_iff
3427 below_cfun_ext ~> cfun_belowI
3428 monofun_fun_fun ~> fun_belowD
3429 monofun_fun_arg ~> monofunE
3430 monofun_lub_fun ~> adm_monofun [THEN admD]
3431 cont_lub_fun ~> adm_cont [THEN admD]
3432 cont2cont_Rep_CFun ~> cont2cont_APP
3433 cont_Rep_CFun_app ~> cont_APP_app
3434 cont_Rep_CFun_app_app ~> cont_APP_app_app
3435 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
3436 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
3437 contlub_cfun ~> lub_APP [symmetric]
3438 contlub_LAM ~> lub_LAM [symmetric]
3441 lift_distinct1 ~> lift.distinct(1)
3442 lift_distinct2 ~> lift.distinct(2)
3443 Def_not_UU ~> lift.distinct(2)
3444 Def_inject ~> lift.inject
3445 below_UU_iff ~> below_bottom_iff
3446 eq_UU_iff ~> eq_bottom_iff
3449 *** Document preparation ***
3451 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
3452 isar-ref manual, both for description and actual application of the
3455 * Antiquotation @{value} evaluates the given term and presents its
3458 * Antiquotations: term style "isub" provides ad-hoc conversion of
3459 variables x1, y23 into subscripted form x\<^isub>1,
3460 y\<^isub>2\<^isub>3.
3462 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
3463 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
3465 * Localized \isabellestyle switch can be used within blocks or groups
3468 \isabellestyle{it} %preferred default
3469 {\isabellestylett @{text "typewriter stuff"}}
3471 * Discontinued special treatment of hard tabulators. Implicit
3472 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
3478 * The inner syntax of sort/type/term/prop supports inlined YXML
3479 representations within quoted string tokens. By encoding logical
3480 entities via Term_XML (in ML or Scala) concrete syntax can be
3481 bypassed, which is particularly useful for producing bits of text
3482 under external program control.
3484 * Antiquotations for ML and document preparation are managed as theory
3485 data, which requires explicit setup.
3487 * Isabelle_Process.is_active allows tools to check if the official
3488 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
3489 (better known as Proof General).
3491 * Structure Proof_Context follows standard naming scheme. Old
3492 ProofContext is still available for some time as legacy alias.
3494 * Structure Timing provides various operations for timing; supersedes
3495 former start_timing/end_timing etc.
3497 * Path.print is the official way to show file-system paths to users
3498 (including quotes etc.).
3500 * Inner syntax: identifiers in parse trees of generic categories
3501 "logic", "aprop", "idt" etc. carry position information (disguised as
3502 type constraints). Occasional INCOMPATIBILITY with non-compliant
3503 translations that choke on unexpected type constraints. Positions can
3504 be stripped in ML translations via Syntax.strip_positions /
3505 Syntax.strip_positions_ast, or via the syntax constant
3506 "_strip_positions" within parse trees. As last resort, positions can
3507 be disabled via the configuration option Syntax.positions, which is
3508 called "syntax_positions" in Isar attribute syntax.
3510 * Discontinued special status of various ML structures that contribute
3511 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
3512 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
3513 refer directly to Ast.Constant, Lexicon.is_identifier,
3514 Syntax_Trans.mk_binder_tr etc.
3516 * Typed print translation: discontinued show_sorts argument, which is
3517 already available via context of "advanced" translation.
3519 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
3520 goal states; body tactic needs to address all subgoals uniformly.
3522 * Slightly more special eq_list/eq_set, with shortcut involving
3523 pointer equality (assumes that eq relation is reflexive).
3525 * Classical tactics use proper Proof.context instead of historic types
3526 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
3527 operate directly on Proof.context. Raw type claset retains its use as
3528 snapshot of the classical context, which can be recovered via
3529 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
3530 INCOMPATIBILITY, classical tactics and derived proof methods require
3531 proper Proof.context.
3536 * Discontinued support for Poly/ML 5.2, which was the last version
3537 without proper multithreading and TimeLimit implementation.
3539 * Discontinued old lib/scripts/polyml-platform, which has been
3540 obsolete since Isabelle2009-2.
3542 * Various optional external tools are referenced more robustly and
3543 uniformly by explicit Isabelle settings as follows:
3545 ISABELLE_CSDP (formerly CSDP_EXE)
3546 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
3547 ISABELLE_OCAML (formerly EXEC_OCAML)
3548 ISABELLE_SWIPL (formerly EXEC_SWIPL)
3549 ISABELLE_YAP (formerly EXEC_YAP)
3551 Note that automated detection from the file-system or search path has
3552 been discontinued. INCOMPATIBILITY.
3554 * Scala layer provides JVM method invocation service for static
3555 methods of type (String)String, see Invoke_Scala.method in ML. For
3558 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
3560 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
3561 this allows to pass structured values between ML and Scala.
3563 * The IsabelleText fonts includes some further glyphs to support the
3564 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
3565 installed a local copy (which is normally *not* required) need to
3566 delete or update it from ~~/lib/fonts/.
3570 New in Isabelle2011 (January 2011)
3571 ----------------------------------
3575 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
3576 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
3577 useful tooltips and hyperlinks produced from its static analysis. The
3578 bundled component provides an executable Isabelle tool that can be run
3581 Isabelle2011/bin/isabelle jedit
3583 * Significantly improved Isabelle/Isar implementation manual.
3585 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
3586 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
3587 while the default heap location within that directory lacks that extra
3588 suffix. This isolates multiple Isabelle installations from each
3589 other, avoiding problems with old settings in new versions.
3590 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
3592 * Source files are always encoded as UTF-8, instead of old-fashioned
3593 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
3594 the following package declarations:
3596 \usepackage[utf8]{inputenc}
3597 \usepackage{textcomp}
3599 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
3600 a Unicode character is treated as a single symbol, not a sequence of
3601 non-ASCII bytes as before. Since Isabelle/ML string literals may
3602 contain symbols without further backslash escapes, Unicode can now be
3603 used here as well. Recall that Symbol.explode in ML provides a
3604 consistent view on symbols, while raw explode (or String.explode)
3605 merely give a byte-oriented representation.
3607 * Theory loader: source files are primarily located via the master
3608 directory of each theory node (where the .thy file itself resides).
3609 The global load path is still partially available as legacy feature.
3610 Minor INCOMPATIBILITY due to subtle change in file lookup: use
3611 explicit paths, relatively to the theory.
3613 * Special treatment of ML file names has been discontinued.
3614 Historically, optional extensions .ML or .sml were added on demand --
3615 at the cost of clarity of file dependencies. Recall that Isabelle/ML
3616 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
3618 * Various options that affect pretty printing etc. are now properly
3619 handled within the context via configuration options, instead of
3620 unsynchronized references or print modes. There are both ML Config.T
3621 entities and Isar declaration attributes to access these.
3623 ML (Config.T) Isar (attribute)
3625 eta_contract eta_contract
3626 show_brackets show_brackets
3627 show_sorts show_sorts
3628 show_types show_types
3629 show_question_marks show_question_marks
3630 show_consts show_consts
3631 show_abbrevs show_abbrevs
3633 Syntax.ast_trace syntax_ast_trace
3634 Syntax.ast_stat syntax_ast_stat
3635 Syntax.ambiguity_level syntax_ambiguity_level
3637 Goal_Display.goals_limit goals_limit
3638 Goal_Display.show_main_goal show_main_goal
3640 Method.rule_trace rule_trace
3642 Thy_Output.display thy_output_display
3643 Thy_Output.quotes thy_output_quotes
3644 Thy_Output.indent thy_output_indent
3645 Thy_Output.source thy_output_source
3646 Thy_Output.break thy_output_break
3648 Note that corresponding "..._default" references in ML may only be
3649 changed globally at the ROOT session setup, but *not* within a theory.
3650 The option "show_abbrevs" supersedes the former print mode
3651 "no_abbrevs" with inverted meaning.
3653 * More systematic naming of some configuration options.
3656 trace_simp ~> simp_trace
3657 debug_simp ~> simp_debug
3659 * Support for real valued configuration options, using simplistic
3660 floating-point notation that coincides with the inner syntax for
3663 * Support for real valued preferences (with approximative PGIP type):
3664 front-ends need to accept "pgint" values in float notation.
3667 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
3670 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
3675 * Command 'type_synonym' (with single argument) replaces somewhat
3676 outdated 'types', which is still available as legacy feature for some
3679 * Command 'nonterminal' (with 'and' separated list of arguments)
3680 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
3682 * Command 'notepad' replaces former 'example_proof' for
3683 experimentation in Isar without any result. INCOMPATIBILITY.
3685 * Locale interpretation commands 'interpret' and 'sublocale' accept
3686 lists of equations to map definitions in a locale to appropriate
3687 entities in the context of the interpretation. The 'interpretation'
3688 command already provided this functionality.
3690 * Diagnostic command 'print_dependencies' prints the locale instances
3691 that would be activated if the specified expression was interpreted in
3692 the current context. Variant "print_dependencies!" assumes a context
3693 without interpretations.
3695 * Diagnostic command 'print_interps' prints interpretations in proofs
3696 in addition to interpretations in theories.
3698 * Discontinued obsolete 'global' and 'local' commands to manipulate
3699 the theory name space. Rare INCOMPATIBILITY. The ML functions
3700 Sign.root_path and Sign.local_path may be applied directly where this
3701 feature is still required for historical reasons.
3703 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
3704 'definition' instead.
3706 * The "prems" fact, which refers to the accidental collection of
3707 foundational premises in the context, is now explicitly marked as
3708 legacy feature and will be discontinued soon. Consider using "assms"
3709 of the head statement or reference facts by explicit names.
3711 * Document antiquotations @{class} and @{type} print classes and type
3714 * Document antiquotation @{file} checks file/directory entries within
3715 the local file system.
3720 * Coercive subtyping: functions can be declared as coercions and type
3721 inference will add them as necessary upon input of a term. Theory
3722 Complex_Main declares real :: nat => real and real :: int => real as
3723 coercions. A coercion function f is declared like this:
3725 declare [[coercion f]]
3727 To lift coercions through type constructors (e.g. from nat => real to
3728 nat list => real list), map functions can be declared, e.g.
3730 declare [[coercion_map map]]
3732 Currently coercion inference is activated only in theories including
3733 real numbers, i.e. descendants of Complex_Main. This is controlled by
3734 the configuration option "coercion_enabled", e.g. it can be enabled in
3735 other theories like this:
3737 declare [[coercion_enabled]]
3739 * Command 'partial_function' provides basic support for recursive
3740 function definitions over complete partial orders. Concrete instances
3741 are provided for i) the option type, ii) tail recursion on arbitrary
3742 types, and iii) the heap monad of Imperative_HOL. See
3743 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
3746 * Function package: f.psimps rules are no longer implicitly declared
3747 as [simp]. INCOMPATIBILITY.
3749 * Datatype package: theorems generated for executable equality (class
3750 "eq") carry proper names and are treated as default code equations.
3752 * Inductive package: now offers command 'inductive_simps' to
3753 automatically derive instantiated and simplified equations for
3754 inductive predicates, similar to 'inductive_cases'.
3756 * Command 'enriched_type' allows to register properties of the
3757 functorial structure of types.
3759 * Improved infrastructure for term evaluation using code generator
3760 techniques, in particular static evaluation conversions.
3762 * Code generator: Scala (2.8 or higher) has been added to the target
3765 * Code generator: globbing constant expressions "*" and "Theory.*"
3766 have been replaced by the more idiomatic "_" and "Theory._".
3769 * Code generator: export_code without explicit file declaration prints
3770 to standard output. INCOMPATIBILITY.
3772 * Code generator: do not print function definitions for case
3773 combinators any longer.
3775 * Code generator: simplification with rules determined with
3776 src/Tools/Code/code_simp.ML and method "code_simp".
3778 * Code generator for records: more idiomatic representation of record
3779 types. Warning: records are not covered by ancient SML code
3780 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
3781 rep_datatype declaration helps to succeed then:
3785 rep_datatype foo_ext ...
3787 * Records: logical foundation type for records does not carry a
3788 '_type' suffix any longer (obsolete due to authentic syntax).
3791 * Quickcheck now by default uses exhaustive testing instead of random
3792 testing. Random testing can be invoked by "quickcheck [random]",
3793 exhaustive testing by "quickcheck [exhaustive]".
3795 * Quickcheck instantiates polymorphic types with small finite
3796 datatypes by default. This enables a simple execution mechanism to
3797 handle quantifiers and function equality over the finite datatypes.
3799 * Quickcheck random generator has been renamed from "code" to
3800 "random". INCOMPATIBILITY.
3802 * Quickcheck now has a configurable time limit which is set to 30
3803 seconds by default. This can be changed by adding [timeout = n] to the
3804 quickcheck command. The time limit for Auto Quickcheck is still set
3807 * Quickcheck in locales considers interpretations of that locale for
3808 counter example search.
3811 - Added "smt" and "remote_smt" provers based on the "smt" proof
3812 method. See the Sledgehammer manual for details ("isabelle doc
3815 sledgehammer atp_info ~> sledgehammer running_provers
3816 sledgehammer atp_kill ~> sledgehammer kill_provers
3817 sledgehammer available_atps ~> sledgehammer available_provers
3820 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
3821 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
3822 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
3823 (and "ms" and "min" are no longer supported)
3828 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
3829 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
3831 - Added support for partial quotient types.
3832 - Added local versions of the "Nitpick.register_xxx" functions.
3833 - Added "whack" option.
3834 - Allow registration of quotient types as codatatypes.
3835 - Improved "merge_type_vars" option to merge more types.
3836 - Removed unsound "fast_descrs" option.
3837 - Added custom symmetry breaking for datatypes, making it possible to reach
3838 higher cardinalities.
3839 - Prevent the expansion of too large definitions.
3841 * Proof methods "metis" and "meson" now have configuration options
3842 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
3843 to diagnose these tools. E.g.
3845 using [[metis_trace = true]]
3847 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
3848 manually as command 'solve_direct'.
3850 * The default SMT solver Z3 must be enabled explicitly (due to
3851 licensing issues) by setting the environment variable
3852 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
3853 commercial applications, the SMT solver CVC3 is provided as fall-back;
3854 changing the SMT solver is done via the configuration option
3857 * Remote SMT solvers need to be referred to by the "remote_" prefix,
3858 i.e. "remote_cvc3" and "remote_z3".
3860 * Added basic SMT support for datatypes, records, and typedefs using
3861 the oracle mode (no proofs). Direct support of pairs has been dropped
3862 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
3863 support for a similar behavior). Minor INCOMPATIBILITY.
3865 * Changed SMT configuration options:
3867 z3_proofs ~> smt_oracle (with inverted meaning)
3868 z3_trace_assms ~> smt_trace_used_facts
3881 * Boogie output files (.b2i files) need to be declared in the theory
3884 * Simplification procedure "list_to_set_comprehension" rewrites list
3885 comprehensions applied to List.set to set comprehensions. Occasional
3886 INCOMPATIBILITY, may be deactivated like this:
3888 declare [[simproc del: list_to_set_comprehension]]
3890 * Removed old version of primrec package. INCOMPATIBILITY.
3892 * Removed simplifier congruence rule of "prod_case", as has for long
3893 been the case with "split". INCOMPATIBILITY.
3895 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
3897 * Removed [split_format ... and ... and ...] version of
3898 [split_format]. Potential INCOMPATIBILITY.
3900 * Predicate "sorted" now defined inductively, with nice induction
3901 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
3903 * Constant "contents" renamed to "the_elem", to free the generic name
3904 contents for other uses. INCOMPATIBILITY.
3906 * Renamed class eq and constant eq (for code generation) to class
3907 equal and constant equal, plus renaming of related facts and various
3908 tuning. INCOMPATIBILITY.
3910 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
3912 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
3915 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
3916 avoid confusion with finite sets. INCOMPATIBILITY.
3918 * Abandoned locales equiv, congruent and congruent2 for equivalence
3919 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
3922 * Some previously unqualified names have been qualified:
3929 Trueprop ~> HOL.Trueprop
3934 op --> ~> HOL.implies
3946 Pair ~> Product_Type.Pair
3947 fst ~> Product_Type.fst
3948 snd ~> Product_Type.snd
3949 curry ~> Product_Type.curry
3951 Collect ~> Set.Collect
3955 * More canonical naming convention for some fundamental definitions:
3957 bot_bool_eq ~> bot_bool_def
3958 top_bool_eq ~> top_bool_def
3959 inf_bool_eq ~> inf_bool_def
3960 sup_bool_eq ~> sup_bool_def
3961 bot_fun_eq ~> bot_fun_def
3962 top_fun_eq ~> top_fun_def
3963 inf_fun_eq ~> inf_fun_def
3964 sup_fun_eq ~> sup_fun_def
3968 * More stylized fact names:
3970 expand_fun_eq ~> fun_eq_iff
3971 expand_set_eq ~> set_eq_iff
3973 nat_number ~> eval_nat_numeral
3977 * Refactoring of code-generation specific operations in theory List:
3983 mem_iff ~> member_def
3984 null_empty ~> null_def
3986 INCOMPATIBILITY. Note that these were not supposed to be used
3987 regularly unless for striking reasons; their main purpose was code
3990 Various operations from the Haskell prelude are used for generating
3993 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
3994 "surj f" is now an abbreviation of "range f = UNIV". The theorems
3995 bij_def and surj_def are unchanged. INCOMPATIBILITY.
3997 * Abolished some non-alphabetic type names: "prod" and "sum" replace
3998 "*" and "+" respectively. INCOMPATIBILITY.
4000 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
4001 "Sum_Type.Plus" instead.
4003 * Constant "split" has been merged with constant "prod_case"; names of
4004 ML functions, facts etc. involving split have been retained so far,
4005 though. INCOMPATIBILITY.
4007 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
4008 instead. INCOMPATIBILITY.
4010 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
4013 * Former theory Library/Enum is now part of the HOL-Main image.
4014 INCOMPATIBILITY: all constants of the Enum theory now have to be
4015 referred to by its qualified name.
4018 nlists ~> Enum.nlists
4019 product ~> Enum.product
4021 * Theory Library/Monad_Syntax provides do-syntax for monad types.
4022 Syntax in Library/State_Monad has been changed to avoid ambiguities.
4025 * Theory Library/SetsAndFunctions has been split into
4026 Library/Function_Algebras and Library/Set_Algebras; canonical names
4027 for instance definitions for functions; various improvements.
4030 * Theory Library/Multiset provides stable quicksort implementation of
4033 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
4036 * Session Multivariate_Analysis: introduced a type class for euclidean
4037 space. Most theorems are now stated in terms of euclidean spaces
4038 instead of finite cartesian products.
4041 real ^ 'n ~> 'a::real_vector
4042 ~> 'a::euclidean_space
4043 ~> 'a::ordered_euclidean_space
4044 (depends on your needs)
4048 \<chi> x. _ ~> \<chi>\<chi> x. _
4051 Also note that the indices are now natural numbers and not from some
4052 finite type. Finite cartesian products of euclidean spaces, products
4053 of euclidean spaces the real and complex numbers are instantiated to
4054 be euclidean_spaces. INCOMPATIBILITY.
4056 * Session Probability: introduced pextreal as positive extended real
4057 numbers. Use pextreal as value for measures. Introduce the
4058 Radon-Nikodym derivative, product spaces and Fubini's theorem for
4059 arbitrary sigma finite measures. Introduces Lebesgue measure based on
4060 the integral in Multivariate Analysis. INCOMPATIBILITY.
4062 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
4065 * Session SPARK (with image HOL-SPARK) provides commands to load and
4066 prove verification conditions generated by the SPARK Ada program
4067 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
4072 * Theorems for additive ring operations (locale abelian_monoid and
4073 descendants) are generated by interpretation from their multiplicative
4074 counterparts. Names (in particular theorem names) have the mandatory
4075 qualifier 'add'. Previous theorem names are redeclared for
4078 * Structure "int_ring" is now an abbreviation (previously a
4079 definition). This fits more natural with advanced interpretations.
4084 * The domain package now runs in definitional mode by default: The
4085 former command 'new_domain' is now called 'domain'. To use the domain
4086 package in its original axiomatic mode, use 'domain (unsafe)'.
4089 * The new class "domain" is now the default sort. Class "predomain"
4090 is an unpointed version of "domain". Theories can be updated by
4091 replacing sort annotations as shown below. INCOMPATIBILITY.
4093 'a::type ~> 'a::countable
4094 'a::cpo ~> 'a::predomain
4095 'a::pcpo ~> 'a::domain
4097 * The old type class "rep" has been superseded by class "domain".
4098 Accordingly, users of the definitional package must remove any
4099 "default_sort rep" declarations. INCOMPATIBILITY.
4101 * The domain package (definitional mode) now supports unpointed
4102 predomain argument types, as long as they are marked 'lazy'. (Strict
4103 arguments must be in class "domain".) For example, the following
4104 domain definition now works:
4106 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
4108 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
4109 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
4110 'a option, and 'a list. Additionally, it configures fixrec and the
4111 domain package to work with these types. For example:
4113 fixrec isInl :: "('a + 'b) u -> tr"
4114 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
4116 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
4118 * The "(permissive)" option of fixrec has been replaced with a
4119 per-equation "(unchecked)" option. See
4120 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
4122 * The "bifinite" class no longer fixes a constant "approx"; the class
4123 now just asserts that such a function exists. INCOMPATIBILITY.
4125 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
4126 defines an embedding of type 'a defl into udom by default; instances
4127 of "bifinite" and "domain" classes are available in
4128 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
4130 * The syntax "REP('a)" has been replaced with "DEFL('a)".
4132 * The predicate "directed" has been removed. INCOMPATIBILITY.
4134 * The type class "finite_po" has been removed. INCOMPATIBILITY.
4136 * The function "cprod_map" has been renamed to "prod_map".
4139 * The monadic bind operator on each powerdomain has new binder syntax
4140 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
4141 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
4143 * The infix syntax for binary union on each powerdomain has changed
4144 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
4145 syntax. INCOMPATIBILITY.
4147 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
4148 still supported as an input translation.
4150 * Renamed some theorems (the original names are also still available).
4152 expand_fun_below ~> fun_below_iff
4153 below_fun_ext ~> fun_belowI
4154 expand_cfun_eq ~> cfun_eq_iff
4155 ext_cfun ~> cfun_eqI
4156 expand_cfun_below ~> cfun_below_iff
4157 below_cfun_ext ~> cfun_belowI
4158 cont2cont_Rep_CFun ~> cont2cont_APP
4160 * The Abs and Rep functions for various types have changed names.
4161 Related theorem names have also changed to match. INCOMPATIBILITY.
4163 Rep_CFun ~> Rep_cfun
4164 Abs_CFun ~> Abs_cfun
4165 Rep_Sprod ~> Rep_sprod
4166 Abs_Sprod ~> Abs_sprod
4167 Rep_Ssum ~> Rep_ssum
4168 Abs_Ssum ~> Abs_ssum
4170 * Lemmas with names of the form *_defined_iff or *_strict_iff have
4171 been renamed to *_bottom_iff. INCOMPATIBILITY.
4173 * Various changes to bisimulation/coinduction with domain package:
4175 - Definitions of "bisim" constants no longer mention definedness.
4176 - With mutual recursion, "bisim" predicate is now curried.
4177 - With mutual recursion, each type gets a separate coind theorem.
4178 - Variable names in bisim_def and coinduct rules have changed.
4182 * Case combinators generated by the domain package for type "foo" are
4183 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
4185 * Several theorems have been renamed to more accurately reflect the
4186 names of constants and types involved. INCOMPATIBILITY.
4188 thelub_const ~> lub_const
4189 lub_const ~> is_lub_const
4191 is_lub_lub ~> is_lubD2
4193 unique_lub ~> is_lub_unique
4194 is_ub_lub ~> is_lub_rangeD1
4195 lub_bin_chain ~> is_lub_bin_chain
4196 lub_fun ~> is_lub_fun
4197 thelub_fun ~> lub_fun
4198 thelub_cfun ~> lub_cfun
4199 thelub_Pair ~> lub_Pair
4200 lub_cprod ~> is_lub_prod
4201 thelub_cprod ~> lub_prod
4202 minimal_cprod ~> minimal_prod
4203 inst_cprod_pcpo ~> inst_prod_pcpo
4205 compact_UU ~> compact_bottom
4206 deflation_UU ~> deflation_bottom
4207 finite_deflation_UU ~> finite_deflation_bottom
4209 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
4211 sq_ord_less_eq_trans ~> below_eq_trans
4212 sq_ord_eq_less_trans ~> eq_below_trans
4213 refl_less ~> below_refl
4214 trans_less ~> below_trans
4215 antisym_less ~> below_antisym
4216 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
4217 box_less ~> box_below
4218 rev_trans_less ~> rev_below_trans
4219 not_less2not_eq ~> not_below2not_eq
4220 less_UU_iff ~> below_UU_iff
4221 flat_less_iff ~> flat_below_iff
4222 adm_less ~> adm_below
4223 adm_not_less ~> adm_not_below
4224 adm_compact_not_less ~> adm_compact_not_below
4225 less_fun_def ~> below_fun_def
4226 expand_fun_less ~> fun_below_iff
4227 less_fun_ext ~> fun_belowI
4228 less_discr_def ~> below_discr_def
4229 discr_less_eq ~> discr_below_eq
4230 less_unit_def ~> below_unit_def
4231 less_cprod_def ~> below_prod_def
4232 prod_lessI ~> prod_belowI
4233 Pair_less_iff ~> Pair_below_iff
4234 fst_less_iff ~> fst_below_iff
4235 snd_less_iff ~> snd_below_iff
4236 expand_cfun_less ~> cfun_below_iff
4237 less_cfun_ext ~> cfun_belowI
4238 injection_less ~> injection_below
4239 less_up_def ~> below_up_def
4240 not_Iup_less ~> not_Iup_below
4241 Iup_less ~> Iup_below
4243 Def_inject_less_eq ~> Def_below_Def
4244 Def_less_is_eq ~> Def_below_iff
4245 spair_less_iff ~> spair_below_iff
4246 less_sprod ~> below_sprod
4247 spair_less ~> spair_below
4248 sfst_less_iff ~> sfst_below_iff
4249 ssnd_less_iff ~> ssnd_below_iff
4250 fix_least_less ~> fix_least_below
4251 dist_less_one ~> dist_below_one
4252 less_ONE ~> below_ONE
4253 ONE_less_iff ~> ONE_below_iff
4254 less_sinlD ~> below_sinlD
4255 less_sinrD ~> below_sinrD
4260 * All constant names are now qualified internally and use proper
4261 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
4266 * Antiquotation @{assert} inlines a function bool -> unit that raises
4267 Fail if the argument is false. Due to inlining the source position of
4268 failed assertions is included in the error output.
4270 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
4271 text is in practice always evaluated with a stable theory checkpoint.
4272 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
4274 * Antiquotation @{theory A} refers to theory A from the ancestry of
4275 the current context, not any accidental theory loader state as before.
4276 Potential INCOMPATIBILITY, subtle change in semantics.
4278 * Syntax.pretty_priority (default 0) configures the required priority
4279 of pretty-printed output and thus affects insertion of parentheses.
4281 * Syntax.default_root (default "any") configures the inner syntax
4282 category (nonterminal symbol) for parsing of terms.
4284 * Former exception Library.UnequalLengths now coincides with
4285 ListPair.UnequalLengths.
4287 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
4288 main functionality is provided by structure Simplifier.
4290 * Renamed raw "explode" function to "raw_explode" to emphasize its
4291 meaning. Note that internally to Isabelle, Symbol.explode is used in
4292 almost all situations.
4294 * Discontinued obsolete function sys_error and exception SYS_ERROR.
4295 See implementation manual for further details on exceptions in
4298 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
4301 * Renamed structure PureThy to Pure_Thy and moved most of its
4302 operations to structure Global_Theory, to emphasize that this is
4303 rarely-used global-only stuff.
4305 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
4306 instead (or tracing for high-volume output).
4308 * Configuration option show_question_marks only affects regular pretty
4309 printing of types and terms, not raw Term.string_of_vname.
4311 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
4312 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
4313 @{thms} for most purposes.
4315 * ML structure Unsynchronized is never opened, not even in Isar
4316 interaction mode as before. Old Unsynchronized.set etc. have been
4317 discontinued -- use plain := instead. This should be *rare* anyway,
4318 since modern tools always work via official context data, notably
4319 configuration options.
4321 * Parallel and asynchronous execution requires special care concerning
4322 interrupts. Structure Exn provides some convenience functions that
4323 avoid working directly with raw Interrupt. User code must not absorb
4324 interrupts -- intermediate handling (for cleanup etc.) needs to be
4325 followed by re-raising of the original exception. Another common
4326 source of mistakes are "handle _" patterns, which make the meaning of
4327 the program subject to physical effects of the environment.
4331 New in Isabelle2009-2 (June 2010)
4332 ---------------------------------
4336 * Authentic syntax for *all* logical entities (type classes, type
4337 constructors, term constants): provides simple and robust
4338 correspondence between formal entities and concrete syntax. Within
4339 the parse tree / AST representations, "constants" are decorated by
4340 their category (class, type, const) and spelled out explicitly with
4341 their full internal name.
4343 Substantial INCOMPATIBILITY concerning low-level syntax declarations
4344 and translations (translation rules and translation functions in ML).
4345 Some hints on upgrading:
4347 - Many existing uses of 'syntax' and 'translations' can be replaced
4348 by more modern 'type_notation', 'notation' and 'abbreviation',
4349 which are independent of this issue.
4351 - 'translations' require markup within the AST; the term syntax
4352 provides the following special forms:
4354 CONST c -- produces syntax version of constant c from context
4355 XCONST c -- literally c, checked as constant from context
4356 c -- literally c, if declared by 'syntax'
4358 Plain identifiers are treated as AST variables -- occasionally the
4359 system indicates accidental variables via the error "rhs contains
4362 Type classes and type constructors are marked according to their
4363 concrete syntax. Some old translations rules need to be written
4364 for the "type" category, using type constructor application
4365 instead of pseudo-term application of the default category
4368 - 'parse_translation' etc. in ML may use the following
4371 @{class_syntax c} -- type class c within parse tree / AST
4372 @{term_syntax c} -- type constructor c within parse tree / AST
4373 @{const_syntax c} -- ML version of "CONST c" above
4374 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
4376 - Literal types within 'typed_print_translations', i.e. those *not*
4377 represented as pseudo-terms are represented verbatim. Use @{class
4378 c} or @{type_name c} here instead of the above syntax
4381 Note that old non-authentic syntax was based on unqualified base
4382 names, so all of the above "constant" names would coincide. Recall
4383 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
4384 diagnose syntax problems.
4386 * Type constructors admit general mixfix syntax, not just infix.
4388 * Concrete syntax may be attached to local entities without a proof
4389 body, too. This works via regular mixfix annotations for 'fix',
4390 'def', 'obtain' etc. or via the explicit 'write' command, which is
4391 similar to the 'notation' command in theory specifications.
4393 * Discontinued unnamed infix syntax (legacy feature for many years) --
4394 need to specify constant name and syntax separately. Internal ML
4395 datatype constructors have been renamed from InfixName to Infix etc.
4396 Minor INCOMPATIBILITY.
4398 * Schematic theorem statements need to be explicitly markup as such,
4399 via commands 'schematic_lemma', 'schematic_theorem',
4400 'schematic_corollary'. Thus the relevance of the proof is made
4401 syntactically clear, which impacts performance in a parallel or
4402 asynchronous interactive environment. Minor INCOMPATIBILITY.
4404 * Use of cumulative prems via "!" in some proof methods has been
4405 discontinued (old legacy feature).
4407 * References 'trace_simp' and 'debug_simp' have been replaced by
4408 configuration options stored in the context. Enabling tracing (the
4409 case of debugging is similar) in proofs works via
4411 using [[trace_simp = true]]
4413 Tracing is then active for all invocations of the simplifier in
4414 subsequent goal refinement steps. Tracing may also still be enabled or
4415 disabled via the ProofGeneral settings menu.
4417 * Separate commands 'hide_class', 'hide_type', 'hide_const',
4418 'hide_fact' replace the former 'hide' KIND command. Minor
4421 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
4422 more efficient than combinations with -q1 or -q2.
4427 * Proofterms record type-class reasoning explicitly, using the
4428 "unconstrain" operation internally. This eliminates all sort
4429 constraints from a theorem and proof, introducing explicit
4430 OFCLASS-premises. On the proof term level, this operation is
4431 automatically applied at theorem boundaries, such that closed proofs
4432 are always free of sort constraints. INCOMPATIBILITY for tools that
4433 inspect proof terms.
4435 * Local theory specifications may depend on extra type variables that
4436 are not present in the result type -- arguments TYPE('a) :: 'a itself
4437 are added internally. For example:
4439 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
4441 * Predicates of locales introduced by classes carry a mandatory
4442 "class" prefix. INCOMPATIBILITY.
4444 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
4446 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
4449 * Command 'code_reflect' allows to incorporate generated ML code into
4450 runtime environment; replaces immature code_datatype antiquotation.
4453 * Code generator: simple concept for abstract datatypes obeying
4456 * Code generator: details of internal data cache have no impact on the
4457 user space functionality any longer.
4459 * Methods "unfold_locales" and "intro_locales" ignore non-locale
4460 subgoals. This is more appropriate for interpretations with 'where'.
4463 * Command 'example_proof' opens an empty proof body. This allows to
4464 experiment with Isar, without producing any persistent result.
4466 * Commands 'type_notation' and 'no_type_notation' declare type syntax
4467 within a local theory context, with explicit checking of the
4468 constructors involved (in contrast to the raw 'syntax' versions).
4470 * Commands 'types' and 'typedecl' now work within a local theory
4471 context -- without introducing dependencies on parameters or
4472 assumptions, which is not possible in Isabelle/Pure.
4474 * Command 'defaultsort' has been renamed to 'default_sort', it works
4475 within a local theory context. Minor INCOMPATIBILITY.
4480 * Command 'typedef' now works within a local theory context -- without
4481 introducing dependencies on parameters or assumptions, which is not
4482 possible in Isabelle/Pure/HOL. Note that the logical environment may
4483 contain multiple interpretations of local typedefs (with different
4484 non-emptiness proofs), even in a global theory context.
4486 * New package for quotient types. Commands 'quotient_type' and
4487 'quotient_definition' may be used for defining types and constants by
4488 quotient constructions. An example is the type of integers created by
4489 quotienting pairs of natural numbers:
4492 intrel :: "(nat * nat) => (nat * nat) => bool"
4494 "intrel (x, y) (u, v) = (x + v = u + y)"
4496 quotient_type int = "nat * nat" / intrel
4497 by (auto simp add: equivp_def expand_fun_eq)
4500 "0::int" is "(0::nat, 0::nat)"
4502 The method "lifting" can be used to lift of theorems from the
4503 underlying "raw" type to the quotient type. The example
4504 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
4505 construction and provides a reasoning infrastructure for finite sets.
4507 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
4508 clash with new theory Quotient in Main HOL.
4510 * Moved the SMT binding into the main HOL session, eliminating
4511 separate HOL-SMT session.
4513 * List membership infix mem operation is only an input abbreviation.
4516 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
4517 for future developements; former Library/Word.thy is still present in
4518 the AFP entry RSAPPS.
4520 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
4521 longer shadowed. INCOMPATIBILITY.
4523 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
4526 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
4529 * Dropped normalizing_semiring etc; use the facts in semiring classes
4530 instead. INCOMPATIBILITY.
4532 * Dropped several real-specific versions of lemmas about floor and
4533 ceiling; use the generic lemmas from theory "Archimedean_Field"
4534 instead. INCOMPATIBILITY.
4536 floor_number_of_eq ~> floor_number_of
4537 le_floor_eq_number_of ~> number_of_le_floor
4538 le_floor_eq_zero ~> zero_le_floor
4539 le_floor_eq_one ~> one_le_floor
4540 floor_less_eq_number_of ~> floor_less_number_of
4541 floor_less_eq_zero ~> floor_less_zero
4542 floor_less_eq_one ~> floor_less_one
4543 less_floor_eq_number_of ~> number_of_less_floor
4544 less_floor_eq_zero ~> zero_less_floor
4545 less_floor_eq_one ~> one_less_floor
4546 floor_le_eq_number_of ~> floor_le_number_of
4547 floor_le_eq_zero ~> floor_le_zero
4548 floor_le_eq_one ~> floor_le_one
4549 floor_subtract_number_of ~> floor_diff_number_of
4550 floor_subtract_one ~> floor_diff_one
4551 ceiling_number_of_eq ~> ceiling_number_of
4552 ceiling_le_eq_number_of ~> ceiling_le_number_of
4553 ceiling_le_zero_eq ~> ceiling_le_zero
4554 ceiling_le_eq_one ~> ceiling_le_one
4555 less_ceiling_eq_number_of ~> number_of_less_ceiling
4556 less_ceiling_eq_zero ~> zero_less_ceiling
4557 less_ceiling_eq_one ~> one_less_ceiling
4558 ceiling_less_eq_number_of ~> ceiling_less_number_of
4559 ceiling_less_eq_zero ~> ceiling_less_zero
4560 ceiling_less_eq_one ~> ceiling_less_one
4561 le_ceiling_eq_number_of ~> number_of_le_ceiling
4562 le_ceiling_eq_zero ~> zero_le_ceiling
4563 le_ceiling_eq_one ~> one_le_ceiling
4564 ceiling_subtract_number_of ~> ceiling_diff_number_of
4565 ceiling_subtract_one ~> ceiling_diff_one
4567 * Theory "Finite_Set": various folding_XXX locales facilitate the
4568 application of the various fold combinators on finite sets.
4570 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
4571 provides abstract red-black tree type which is backed by "RBT_Impl" as
4572 implementation. INCOMPATIBILTY.
4574 * Theory Library/Coinductive_List has been removed -- superseded by
4575 AFP/thys/Coinductive.
4577 * Theory PReal, including the type "preal" and related operations, has
4578 been removed. INCOMPATIBILITY.
4580 * Real: new development using Cauchy Sequences.
4582 * Split off theory "Big_Operators" containing setsum, setprod,
4583 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
4585 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
4586 "Int" etc. INCOMPATIBILITY.
4588 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
4590 * New set of rules "ac_simps" provides combined assoc / commute
4591 rewrites for all interpretations of the appropriate generic locales.
4593 * Renamed theory "OrderedGroup" to "Groups" and split theory
4594 "Ring_and_Field" into theories "Rings" and "Fields"; for more
4595 appropriate and more consistent names suitable for name prefixes
4596 within the HOL theories. INCOMPATIBILITY.
4598 * Some generic constants have been put to appropriate theories:
4599 - less_eq, less: Orderings
4600 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
4601 - inverse, divide: Rings
4604 * More consistent naming of type classes involving orderings (and
4607 lower_semilattice ~> semilattice_inf
4608 upper_semilattice ~> semilattice_sup
4610 dense_linear_order ~> dense_linorder
4612 pordered_ab_group_add ~> ordered_ab_group_add
4613 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
4614 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
4615 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
4616 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
4617 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
4618 pordered_cancel_semiring ~> ordered_cancel_semiring
4619 pordered_comm_monoid_add ~> ordered_comm_monoid_add
4620 pordered_comm_ring ~> ordered_comm_ring
4621 pordered_comm_semiring ~> ordered_comm_semiring
4622 pordered_ring ~> ordered_ring
4623 pordered_ring_abs ~> ordered_ring_abs
4624 pordered_semiring ~> ordered_semiring
4626 ordered_ab_group_add ~> linordered_ab_group_add
4627 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
4628 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
4629 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
4630 ordered_field ~> linordered_field
4631 ordered_field_no_lb ~> linordered_field_no_lb
4632 ordered_field_no_ub ~> linordered_field_no_ub
4633 ordered_field_dense_linear_order ~> dense_linordered_field
4634 ordered_idom ~> linordered_idom
4635 ordered_ring ~> linordered_ring
4636 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
4637 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
4638 ordered_ring_strict ~> linordered_ring_strict
4639 ordered_semidom ~> linordered_semidom
4640 ordered_semiring ~> linordered_semiring
4641 ordered_semiring_1 ~> linordered_semiring_1
4642 ordered_semiring_1_strict ~> linordered_semiring_1_strict
4643 ordered_semiring_strict ~> linordered_semiring_strict
4645 The following slightly odd type classes have been moved to a
4646 separate theory Library/Lattice_Algebras:
4648 lordered_ab_group_add ~> lattice_ab_group_add
4649 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
4650 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
4651 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
4652 lordered_ring ~> lattice_ring
4656 * Refined field classes:
4657 - classes division_ring_inverse_zero, field_inverse_zero,
4658 linordered_field_inverse_zero include rule inverse 0 = 0 --
4659 subsumes former division_by_zero class;
4660 - numerous lemmas have been ported from field to division_ring.
4663 * Refined algebra theorem collections:
4664 - dropped theorem group group_simps, use algebra_simps instead;
4665 - dropped theorem group ring_simps, use field_simps instead;
4666 - proper theorem collection field_simps subsumes former theorem
4667 groups field_eq_simps and field_simps;
4668 - dropped lemma eq_minus_self_iff which is a duplicate for
4672 * Theory Finite_Set and List: some lemmas have been generalized from
4675 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
4676 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
4677 inter_Inter_fold_inter ~> inf_Inf_fold_inf
4678 union_Union_fold_union ~> sup_Sup_fold_sup
4679 Inter_fold_inter ~> Inf_fold_inf
4680 Union_fold_union ~> Sup_fold_sup
4681 inter_INTER_fold_inter ~> inf_INFI_fold_inf
4682 union_UNION_fold_union ~> sup_SUPR_fold_sup
4683 INTER_fold_inter ~> INFI_fold_inf
4684 UNION_fold_union ~> SUPR_fold_sup
4686 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
4687 replaced by the more convenient lemmas Inf_empty and Sup_empty.
4688 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
4689 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
4690 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
4691 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
4693 * Reorganized theory Multiset: swapped notation of pointwise and
4696 - pointwise ordering is instance of class order with standard syntax
4698 - multiset ordering has syntax <=# and <#; partial order properties
4699 are provided by means of interpretation with prefix
4701 - less duplication, less historical organization of sections,
4702 conversion from associations lists to multisets, rudimentary code
4704 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
4709 multiset_eq_conv_count_eq ~> multiset_ext_iff
4710 multi_count_ext ~> multiset_ext
4711 diff_union_inverse2 ~> diff_union_cancelR
4715 * Theory Permutation: replaced local "remove" by List.remove1.
4717 * Code generation: ML and OCaml code is decorated with signatures.
4719 * Theory List: added transpose.
4721 * Library/Nat_Bijection.thy is a collection of bijective functions
4722 between nat and other types, which supersedes the older libraries
4723 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
4726 Nat_Int_Bij.nat2_to_nat ~> prod_encode
4727 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
4728 Nat_Int_Bij.int_to_nat_bij ~> int_encode
4729 Nat_Int_Bij.nat_to_int_bij ~> int_decode
4730 Countable.pair_encode ~> prod_encode
4731 NatIso.prod2nat ~> prod_encode
4732 NatIso.nat2prod ~> prod_decode
4733 NatIso.sum2nat ~> sum_encode
4734 NatIso.nat2sum ~> sum_decode
4735 NatIso.list2nat ~> list_encode
4736 NatIso.nat2list ~> list_decode
4737 NatIso.set2nat ~> set_encode
4738 NatIso.nat2set ~> set_decode
4741 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
4742 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
4743 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
4744 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
4745 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
4746 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
4747 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
4748 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
4749 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
4750 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
4751 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
4752 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
4753 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
4756 - Renamed ATP commands:
4757 atp_info ~> sledgehammer running_atps
4758 atp_kill ~> sledgehammer kill_atps
4759 atp_messages ~> sledgehammer messages
4760 atp_minimize ~> sledgehammer minimize
4761 print_atps ~> sledgehammer available_atps
4763 - Added user's manual ("isabelle doc sledgehammer").
4764 - Added option syntax and "sledgehammer_params" to customize
4765 Sledgehammer's behavior. See the manual for details.
4766 - Modified the Isar proof reconstruction code so that it produces
4767 direct proofs rather than proofs by contradiction. (This feature
4768 is still experimental.)
4769 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
4771 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
4774 - Added and implemented "binary_ints" and "bits" options.
4775 - Added "std" option and implemented support for nonstandard models.
4776 - Added and implemented "finitize" option to improve the precision
4777 of infinite datatypes based on a monotonicity analysis.
4778 - Added support for quotient types.
4779 - Added support for "specification" and "ax_specification"
4781 - Added support for local definitions (for "function" and
4782 "termination" proofs).
4783 - Added support for term postprocessors.
4784 - Optimized "Multiset.multiset" and "FinFun.finfun".
4785 - Improved efficiency of "destroy_constrs" optimization.
4786 - Fixed soundness bugs related to "destroy_constrs" optimization and
4788 - Fixed soundness bug related to higher-order constructors.
4789 - Fixed soundness bug when "full_descrs" is enabled.
4790 - Improved precision of set constructs.
4791 - Added "atoms" option.
4792 - Added cache to speed up repeated Kodkod invocations on the same
4794 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
4795 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
4796 "SAT4J_Light". INCOMPATIBILITY.
4797 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
4798 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
4799 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
4801 * Method "induct" now takes instantiations of the form t, where t is not
4802 a variable, as a shorthand for "x == t", where x is a fresh variable.
4803 If this is not intended, t has to be enclosed in parentheses.
4804 By default, the equalities generated by definitional instantiations
4805 are pre-simplified, which may cause parameters of inductive cases
4806 to disappear, or may even delete some of the inductive cases.
4807 Use "induct (no_simp)" instead of "induct" to restore the old
4808 behaviour. The (no_simp) option is also understood by the "cases"
4809 and "nominal_induct" methods, which now perform pre-simplification, too.
4815 * Variable names in lemmas generated by the domain package have
4816 changed; the naming scheme is now consistent with the HOL datatype
4817 package. Some proof scripts may be affected, INCOMPATIBILITY.
4819 * The domain package no longer defines the function "foo_copy" for
4820 recursive domain "foo". The reach lemma is now stated directly in
4821 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
4822 be reformulated in terms of "foo_take", INCOMPATIBILITY.
4824 * Most definedness lemmas generated by the domain package (previously
4825 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
4826 like "foo$x = UU <-> x = UU", which works better as a simp rule.
4827 Proofs that used definedness lemmas as intro rules may break,
4828 potential INCOMPATIBILITY.
4830 * Induction and casedist rules generated by the domain package now
4831 declare proper case_names (one called "bottom", and one named for each
4832 constructor). INCOMPATIBILITY.
4834 * For mutually-recursive domains, separate "reach" and "take_lemma"
4835 rules are generated for each domain, INCOMPATIBILITY.
4837 foo_bar.reach ~> foo.reach bar.reach
4838 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
4840 * Some lemmas generated by the domain package have been renamed for
4841 consistency with the datatype package, INCOMPATIBILITY.
4843 foo.ind ~> foo.induct
4844 foo.finite_ind ~> foo.finite_induct
4845 foo.coind ~> foo.coinduct
4846 foo.casedist ~> foo.exhaust
4847 foo.exhaust ~> foo.nchotomy
4849 * For consistency with other definition packages, the fixrec package
4850 now generates qualified theorem names, INCOMPATIBILITY.
4852 foo_simps ~> foo.simps
4853 foo_unfold ~> foo.unfold
4854 foo_induct ~> foo.induct
4856 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
4857 method and internal fixrec proofs now use the default simpset instead.
4860 * The "contlub" predicate has been removed. Proof scripts should use
4861 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
4863 * The "admw" predicate has been removed, INCOMPATIBILITY.
4865 * The constants cpair, cfst, and csnd have been removed in favor of
4866 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
4871 * Antiquotations for basic formal entities:
4873 @{class NAME} -- type class
4874 @{class_syntax NAME} -- syntax representation of the above
4876 @{type_name NAME} -- logical type
4877 @{type_abbrev NAME} -- type abbreviation
4878 @{nonterminal NAME} -- type of concrete syntactic category
4879 @{type_syntax NAME} -- syntax representation of any of the above
4881 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
4882 @{const_abbrev NAME} -- abbreviated constant
4883 @{const_syntax NAME} -- syntax representation of any of the above
4885 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
4886 syntax constant (cf. 'syntax' command).
4888 * Antiquotation @{make_string} inlines a function to print arbitrary
4889 values similar to the ML toplevel. The result is compiler dependent
4890 and may fall back on "?" in certain situations.
4892 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
4893 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
4894 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
4895 not work with the asynchronous Isar document model.
4897 * Configuration options now admit dynamic default values, depending on
4898 the context or even global references.
4900 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
4901 uses an efficient external library if available (for Poly/ML).
4903 * Renamed some important ML structures, while keeping the old names
4904 for some time as aliases within the structure Legacy:
4906 OuterKeyword ~> Keyword
4909 OuterSyntax ~> Outer_Syntax
4910 PrintMode ~> Print_Mode
4911 SpecParse ~> Parse_Spec
4914 ThyOutput ~> Thy_Output
4915 TypeInfer ~> Type_Infer
4917 Note that "open Legacy" simplifies porting of sources, but forgetting
4918 to remove it again will complicate porting again in the future.
4920 * Most operations that refer to a global context are named
4921 accordingly, e.g. Simplifier.global_context or
4922 ProofContext.init_global. There are some situations where a global
4923 context actually works, but under normal circumstances one needs to
4924 pass the proper local context through the code!
4926 * Discontinued old TheoryDataFun with its copy/init operation -- data
4927 needs to be pure. Functor Theory_Data_PP retains the traditional
4928 Pretty.pp argument to merge, which is absent in the standard
4929 Theory_Data version.
4931 * Sorts.certify_sort and derived "cert" operations for types and terms
4932 no longer minimize sorts. Thus certification at the boundary of the
4933 inference kernel becomes invariant under addition of class relations,
4934 which is an important monotonicity principle. Sorts are now minimized
4935 in the syntax layer only, at the boundary between the end-user and the
4936 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
4937 explicitly in rare situations.
4939 * Renamed old-style Drule.standard to Drule.export_without_context, to
4940 emphasize that this is in no way a standard operation.
4943 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
4944 usual for resolution. Rare INCOMPATIBILITY.
4946 * Renamed varify/unvarify operations to varify_global/unvarify_global
4947 to emphasize that these only work in a global situation (which is
4950 * Curried take and drop in library.ML; negative length is interpreted
4951 as infinity (as in chop). Subtle INCOMPATIBILITY.
4953 * Proof terms: type substitutions on proof constants now use canonical
4954 order of type variables. INCOMPATIBILITY for tools working with proof
4957 * Raw axioms/defs may no longer carry sort constraints, and raw defs
4958 may no longer carry premises. User-level specifications are
4959 transformed accordingly by Thm.add_axiom/add_def.
4964 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
4965 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
4966 proof terms are enabled unconditionally in the new HOL-Proofs image.
4968 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
4969 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
4972 * Old lib/scripts/polyml-platform is superseded by the
4973 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
4974 variant, even on a 64 bit machine. The following example setting
4975 prefers 64 bit if available:
4977 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
4979 * The preliminary Isabelle/jEdit application demonstrates the emerging
4980 Isabelle/Scala layer for advanced prover interaction and integration.
4981 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
4984 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
4985 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
4986 similar to the default assignment of the document preparation system
4987 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
4988 provides some operations for direct access to the font without asking
4989 the user for manual installation.
4993 New in Isabelle2009-1 (December 2009)
4994 -------------------------------------
4998 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
4999 one backslash should be used, even in ML sources.
5004 * Locale interpretation propagates mixins along the locale hierarchy.
5005 The currently only available mixins are the equations used to map
5006 local definitions to terms of the target domain of an interpretation.
5008 * Reactivated diagnostic command 'print_interps'. Use "print_interps
5009 loc" to print all interpretations of locale "loc" in the theory.
5010 Interpretations in proofs are not shown.
5012 * Thoroughly revised locales tutorial. New section on conditional
5015 * On instantiation of classes, remaining undefined class parameters
5016 are formally declared. INCOMPATIBILITY.
5019 *** Document preparation ***
5021 * New generalized style concept for printing terms: @{foo (style) ...}
5022 instead of @{foo_style style ...} (old form is still retained for
5023 backward compatibility). Styles can be also applied for
5024 antiquotations prop, term_type and typeof.
5029 * New proof method "smt" for a combination of first-order logic with
5030 equality, linear and nonlinear (natural/integer/real) arithmetic, and
5031 fixed-size bitvectors; there is also basic support for higher-order
5032 features (esp. lambda abstractions). It is an incomplete decision
5033 procedure based on external SMT solvers using the oracle mechanism;
5034 for the SMT solver Z3, this method is proof-producing. Certificates
5035 are provided to avoid calling the external solvers solely for
5036 re-checking proofs. Due to a remote SMT service there is no need for
5037 installing SMT solvers locally. See src/HOL/SMT.
5039 * New commands to load and prove verification conditions generated by
5040 the Boogie program verifier or derived systems (e.g. the Verifying C
5041 Compiler (VCC) or Spec#). See src/HOL/Boogie.
5043 * New counterexample generator tool 'nitpick' based on the Kodkod
5044 relational model finder. See src/HOL/Tools/Nitpick and
5045 src/HOL/Nitpick_Examples.
5047 * New commands 'code_pred' and 'values' to invoke the predicate
5048 compiler and to enumerate values of inductive predicates.
5050 * A tabled implementation of the reflexive transitive closure.
5052 * New implementation of quickcheck uses generic code generator;
5053 default generators are provided for all suitable HOL types, records
5054 and datatypes. Old quickcheck can be re-activated importing theory
5055 Library/SML_Quickcheck.
5057 * New testing tool Mirabelle for automated proof tools. Applies
5058 several tools and tactics like sledgehammer, metis, or quickcheck, to
5059 every proof step in a theory. To be used in batch mode via the
5060 "mirabelle" utility.
5062 * New proof method "sos" (sum of squares) for nonlinear real
5063 arithmetic (originally due to John Harison). It requires theory
5064 Library/Sum_Of_Squares. It is not a complete decision procedure but
5065 works well in practice on quantifier-free real arithmetic with +, -,
5066 *, ^, =, <= and <, i.e. boolean combinations of equalities and
5067 inequalities between polynomials. It makes use of external
5068 semidefinite programming solvers. Method "sos" generates a
5069 certificate that can be pasted into the proof thus avoiding the need
5070 to call an external tool every time the proof is checked. See
5071 src/HOL/Library/Sum_Of_Squares.
5073 * New method "linarith" invokes existing linear arithmetic decision
5076 * New command 'atp_minimal' reduces result produced by Sledgehammer.
5078 * New Sledgehammer option "Full Types" in Proof General settings menu.
5079 Causes full type information to be output to the ATPs. This slows
5080 ATPs down considerably but eliminates a source of unsound "proofs"
5083 * New method "metisFT": A version of metis that uses full type
5084 information in order to avoid failures of proof reconstruction.
5086 * New evaluator "approximate" approximates an real valued term using
5087 the same method as the approximation method.
5089 * Method "approximate" now supports arithmetic expressions as
5090 boundaries of intervals and implements interval splitting and Taylor
5093 * ML antiquotation @{code_datatype} inserts definition of a datatype
5094 generated by the code generator; e.g. see src/HOL/Predicate.thy.
5096 * New theory SupInf of the supremum and infimum operators for sets of
5099 * New theory Probability, which contains a development of measure
5100 theory, eventually leading to Lebesgue integration and probability.
5102 * Extended Multivariate Analysis to include derivation and Brouwer's
5105 * Reorganization of number theory, INCOMPATIBILITY:
5106 - new number theory development for nat and int, in theories Divides
5107 and GCD as well as in new session Number_Theory
5108 - some constants and facts now suffixed with _nat and _int
5110 - former session NumberTheory now named Old_Number_Theory, including
5111 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
5112 - moved theory Pocklington from src/HOL/Library to
5113 src/HOL/Old_Number_Theory
5115 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
5116 lcm of finite and infinite sets. It is shown that they form a complete
5119 * Class semiring_div requires superclass no_zero_divisors and proof of
5120 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
5121 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
5122 generalized to class semiring_div, subsuming former theorems
5123 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
5124 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
5127 * Refinements to lattice classes and sets:
5128 - less default intro/elim rules in locale variant, more default
5129 intro/elim rules in class variant: more uniformity
5130 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
5132 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
5134 - renamed ACI to inf_sup_aci
5135 - new class "boolean_algebra"
5136 - class "complete_lattice" moved to separate theory
5137 "Complete_Lattice"; corresponding constants (and abbreviations)
5138 renamed and with authentic syntax:
5139 Set.Inf ~> Complete_Lattice.Inf
5140 Set.Sup ~> Complete_Lattice.Sup
5141 Set.INFI ~> Complete_Lattice.INFI
5142 Set.SUPR ~> Complete_Lattice.SUPR
5143 Set.Inter ~> Complete_Lattice.Inter
5144 Set.Union ~> Complete_Lattice.Union
5145 Set.INTER ~> Complete_Lattice.INTER
5146 Set.UNION ~> Complete_Lattice.UNION
5147 - authentic syntax for
5150 - mere abbreviations:
5153 Set.inter (for inf, formerly Set.Int)
5154 Set.union (for sup, formerly Set.Un)
5155 Complete_Lattice.Inter (for Inf)
5156 Complete_Lattice.Union (for Sup)
5157 Complete_Lattice.INTER (for INFI)
5158 Complete_Lattice.UNION (for SUPR)
5159 - object-logic definitions as far as appropriate
5161 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
5162 Un_subset_iff are explicitly deleted as default simp rules; then also
5163 their lattice counterparts le_inf_iff and le_sup_iff have to be
5164 deleted to achieve the desired effect.
5166 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
5167 rules by default any longer; the same applies to min_max.inf_absorb1
5168 etc. INCOMPATIBILITY.
5170 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
5171 pred_set_conv by default. INCOMPATIBILITY.
5173 * Power operations on relations and functions are now one dedicated
5174 constant "compow" with infix syntax "^^". Power operation on
5175 multiplicative monoids retains syntax "^" and is now defined generic
5176 in class power. INCOMPATIBILITY.
5178 * Relation composition "R O S" now has a more standard argument order:
5179 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
5180 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
5181 break, since the O_assoc rule was not rewritten like this. Fix using
5182 O_assoc[symmetric]. The same applies to the curried version "R OO S".
5184 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
5185 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
5188 * Most rules produced by inductive and datatype package have mandatory
5189 prefixes. INCOMPATIBILITY.
5191 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
5192 the attribute of the same name. Each of the theorems in the list
5193 DERIV_intros assumes composition with an additional function and
5194 matches a variable to the derivative, which has to be solved by the
5195 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
5196 of most elementary terms. Former Maclauren.DERIV_tac and
5197 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
5200 * Code generator attributes follow the usual underscore convention:
5201 code_unfold replaces code unfold
5202 code_post replaces code post
5207 sizechange -> size_change
5208 induct_scheme -> induction_schema
5211 * Discontinued abbreviation "arbitrary" of constant "undefined".
5212 INCOMPATIBILITY, use "undefined" directly.
5215 Suc_eq_add_numeral_1 -> Suc_eq_plus1
5216 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
5217 Suc_plus1 -> Suc_eq_plus1
5218 *anti_sym -> *antisym*
5219 vector_less_eq_def -> vector_le_def
5222 * Added theorem List.map_map as [simp]. Removed List.map_compose.
5225 * Removed predicate "M hassize n" (<--> card M = n & finite M).
5231 * Theory Representable defines a class "rep" of domains that are
5232 representable (via an ep-pair) in the universal domain type "udom".
5233 Instances are provided for all type constructors defined in HOLCF.
5235 * The 'new_domain' command is a purely definitional version of the
5236 domain package, for representable domains. Syntax is identical to the
5237 old domain package. The 'new_domain' package also supports indirect
5238 recursion using previously-defined type constructors. See
5239 src/HOLCF/ex/New_Domain.thy for examples.
5241 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
5242 on the left-hand side of an equation, and then performs
5243 simplification. Rewriting is done using rules declared with the
5244 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
5245 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
5247 * The pattern-match compiler in 'fixrec' can now handle constructors
5248 with HOL function types. Pattern-match combinators for the Pair
5249 constructor are pre-configured.
5251 * The 'fixrec' package now produces better fixed-point induction rules
5252 for mutually-recursive definitions: Induction rules have conclusions
5253 of the form "P foo bar" instead of "P <foo, bar>".
5255 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
5256 been renamed to "below". The name "below" now replaces "less" in many
5257 theorem names. (Legacy theorem names using "less" are still supported
5260 * The 'fixrec' package now supports "bottom patterns". Bottom
5261 patterns can be used to generate strictness rules, or to make
5262 functions more strict (much like the bang-patterns supported by the
5263 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
5269 * Support for Poly/ML 5.3.0, with improved reporting of compiler
5270 errors and run-time exceptions, including detailed source positions.
5272 * Structure Name_Space (formerly NameSpace) now manages uniquely
5273 identified entries, with some additional information such as source
5274 position, logical grouping etc.
5276 * Theory and context data is now introduced by the simplified and
5277 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
5278 to be pure, but the old TheoryDataFun for mutable data (with explicit
5279 copy operation) is still available for some time.
5281 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
5282 provides a high-level programming interface to synchronized state
5283 variables with atomic update. This works via pure function
5284 application within a critical section -- its runtime should be as
5285 short as possible; beware of deadlocks if critical code is nested,
5286 either directly or indirectly via other synchronized variables!
5288 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
5289 wraps raw ML references, explicitly indicating their non-thread-safe
5290 behaviour. The Isar toplevel keeps this structure open, to
5291 accommodate Proof General as well as quick and dirty interactive
5292 experiments with references.
5294 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
5295 parallel tactical reasoning.
5297 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
5298 are similar to SUBPROOF, but are slightly more flexible: only the
5299 specified parts of the subgoal are imported into the context, and the
5300 body tactic may introduce new subgoals and schematic variables.
5302 * Old tactical METAHYPS, which does not observe the proof context, has
5303 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
5304 or Subgoal.FOCUS etc.
5306 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
5307 functors have their own ML name space there is no point to mark them
5308 separately.) Minor INCOMPATIBILITY.
5310 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
5312 * Renamed several structures FooBar to Foo_Bar. Occasional,
5315 * Operations of structure Skip_Proof no longer require quick_and_dirty
5316 mode, which avoids critical setmp.
5318 * Eliminated old Attrib.add_attributes, Method.add_methods and related
5319 combinators for "args". INCOMPATIBILITY, need to use simplified
5320 Attrib/Method.setup introduced in Isabelle2009.
5322 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
5323 back on global_simpset_of, global_claset_of, global_clasimpset_of as
5324 last resort. INCOMPATIBILITY.
5326 * Display.pretty_thm now requires a proper context (cf. former
5327 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
5328 or even Display.pretty_thm_without_context as last resort.
5331 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
5332 Syntax.pretty_typ/term directly, preferably with proper context
5333 instead of global theory.
5338 * Further fine tuning of parallel proof checking, scales up to 8 cores
5339 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
5342 * Support for additional "Isabelle components" via etc/components, see
5343 also the system manual.
5345 * The isabelle makeall tool now operates on all components with
5346 IsaMakefile, not just hardwired "logics".
5348 * Removed "compress" option from isabelle-process and isabelle usedir;
5349 this is always enabled.
5351 * Discontinued support for Poly/ML 4.x versions.
5353 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
5354 on a given logic image. This requires the lighttpd webserver and is
5355 currently supported on Linux only.
5359 New in Isabelle2009 (April 2009)
5360 --------------------------------
5364 * Simplified main Isabelle executables, with less surprises on
5365 case-insensitive file-systems (such as Mac OS).
5367 - The main Isabelle tool wrapper is now called "isabelle" instead of
5370 - The former "isabelle" alias for "isabelle-process" has been
5371 removed (should rarely occur to regular users).
5373 - The former "isabelle-interface" and its alias "Isabelle" have been
5374 removed (interfaces are now regular Isabelle tools).
5376 Within scripts and make files, the Isabelle environment variables
5377 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
5378 respectively. (The latter are still available as legacy feature.)
5380 The old isabelle-interface wrapper could react in confusing ways if
5381 the interface was uninstalled or changed otherwise. Individual
5382 interface tool configuration is now more explicit, see also the
5383 Isabelle system manual. In particular, Proof General is now available
5384 via "isabelle emacs".
5386 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
5387 purge installed copies of Isabelle executables and re-run "isabelle
5388 install -p ...", or use symlinks.
5390 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
5391 old ~/isabelle, which was slightly non-standard and apt to cause
5392 surprises on case-insensitive file-systems (such as Mac OS).
5394 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
5395 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
5396 care is required when using older releases of Isabelle. Note that
5397 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
5398 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
5400 * Proofs of fully specified statements are run in parallel on
5401 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
5402 a regular 4-core machine, if the initial heap space is made reasonably
5403 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
5405 * The main reference manuals ("isar-ref", "implementation", and
5406 "system") have been updated and extended. Formally checked references
5407 as hyperlinks are now available uniformly.
5412 * Complete re-implementation of locales. INCOMPATIBILITY in several
5413 respects. The most important changes are listed below. See the
5414 Tutorial on Locales ("locales" manual) for details.
5416 - In locale expressions, instantiation replaces renaming. Parameters
5417 must be declared in a for clause. To aid compatibility with previous
5418 parameter inheritance, in locale declarations, parameters that are not
5419 'touched' (instantiation position "_" or omitted) are implicitly added
5420 with their syntax at the beginning of the for clause.
5422 - Syntax from abbreviations and definitions in locales is available in
5423 locale expressions and context elements. The latter is particularly
5424 useful in locale declarations.
5426 - More flexible mechanisms to qualify names generated by locale
5427 expressions. Qualifiers (prefixes) may be specified in locale
5428 expressions, and can be marked as mandatory (syntax: "name!:") or
5429 optional (syntax "name?:"). The default depends for plain "name:"
5430 depends on the situation where a locale expression is used: in
5431 commands 'locale' and 'sublocale' prefixes are optional, in
5432 'interpretation' and 'interpret' prefixes are mandatory. The old
5433 implicit qualifiers derived from the parameter names of a locale are
5434 no longer generated.
5436 - Command "sublocale l < e" replaces "interpretation l < e". The
5437 instantiation clause in "interpretation" and "interpret" (square
5438 brackets) is no longer available. Use locale expressions.
5440 - When converting proof scripts, mandatory qualifiers in
5441 'interpretation' and 'interpret' should be retained by default, even
5442 if this is an INCOMPATIBILITY compared to former behavior. In the
5443 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
5444 in locale expressions range over a single locale instance only.
5446 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
5447 In existing theorem specifications replace the includes element by the
5448 respective context elements of the included locale, omitting those
5449 that are already present in the theorem specification. Multiple
5450 assume elements of a locale should be replaced by a single one
5451 involving the locale predicate. In the proof body, declarations (most
5452 notably theorems) may be regained by interpreting the respective
5453 locales in the proof context as required (command "interpret").
5455 If using "includes" in replacement of a target solely because the
5456 parameter types in the theorem are not as general as in the target,
5457 consider declaring a new locale with additional type constraints on
5458 the parameters (context element "constrains").
5460 - Discontinued "locale (open)". INCOMPATIBILITY.
5462 - Locale interpretation commands no longer attempt to simplify goal.
5463 INCOMPATIBILITY: in rare situations the generated goal differs. Use
5464 methods intro_locales and unfold_locales to clarify.
5466 - Locale interpretation commands no longer accept interpretation
5467 attributes. INCOMPATIBILITY.
5469 * Class declaration: so-called "base sort" must not be given in import
5470 list any longer, but is inferred from the specification. Particularly
5477 class foo = type + ...
5479 * Class target: global versions of theorems stemming do not carry a
5480 parameter prefix any longer. INCOMPATIBILITY.
5482 * Class 'instance' command no longer accepts attached definitions.
5483 INCOMPATIBILITY, use proper 'instantiation' target instead.
5485 * Recovered hiding of consts, which was accidentally broken in
5486 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
5487 makes c inaccessible; consider using ``hide (open) const c'' instead.
5489 * Slightly more coherent Pure syntax, with updated documentation in
5490 isar-ref manual. Removed locales meta_term_syntax and
5491 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
5492 INCOMPATIBILITY in rare situations. Note that &&& should not be used
5493 directly in regular applications.
5495 * There is a new syntactic category "float_const" for signed decimal
5496 fractions (e.g. 123.45 or -123.45).
5498 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
5499 interface with 'setup' command instead.
5501 * Command 'local_setup' is similar to 'setup', but operates on a local
5504 * The 'axiomatization' command now only works within a global theory
5505 context. INCOMPATIBILITY.
5507 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
5508 hypotheses. Sorts required in the course of reasoning need to be
5509 covered by the constraints in the initial statement, completed by the
5510 type instance information of the background theory. Non-trivial sort
5511 hypotheses, which rarely occur in practice, may be specified via
5512 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
5514 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
5516 The result contains an implicit sort hypotheses as before --
5517 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
5520 * Generalized Isar history, with support for linear undo, direct state
5523 * Changed defaults for unify configuration options:
5525 unify_trace_bound = 50 (formerly 25)
5526 unify_search_bound = 60 (formerly 30)
5528 * Different bookkeeping for code equations (INCOMPATIBILITY):
5530 a) On theory merge, the last set of code equations for a particular
5531 constant is taken (in accordance with the policy applied by other
5532 parts of the code generator framework).
5534 b) Code equations stemming from explicit declarations (e.g. code
5535 attribute) gain priority over default code equations stemming
5536 from definition, primrec, fun etc.
5538 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
5540 * Unified theorem tables for both code generators. Thus [code
5541 func] has disappeared and only [code] remains. INCOMPATIBILITY.
5543 * Command 'find_consts' searches for constants based on type and name
5546 find_consts "_ => bool"
5548 By default, matching is against subtypes, but it may be restricted to
5549 the whole type. Searching by name is possible. Multiple queries are
5550 conjunctive and queries may be negated by prefixing them with a
5553 find_consts strict: "_ => bool" name: "Int" -"int => int"
5555 * New 'find_theorems' criterion "solves" matches theorems that
5556 directly solve the current goal (modulo higher-order unification).
5558 * Auto solve feature for main theorem statements: whenever a new goal
5559 is stated, "find_theorems solves" is called; any theorems that could
5560 solve the lemma directly are listed as part of the goal state.
5561 Cf. associated options in Proof General Isabelle settings menu,
5562 enabled by default, with reasonable timeout for pathological cases of
5563 higher-order unification.
5566 *** Document preparation ***
5568 * Antiquotation @{lemma} now imitates a regular terminal proof,
5569 demanding keyword 'by' and supporting the full method expression
5570 syntax just like the Isar command 'by'.
5575 * Integrated main parts of former image HOL-Complex with HOL. Entry
5576 points Main and Complex_Main remain as before.
5578 * Logic image HOL-Plain provides a minimal HOL with the most important
5579 tools available (inductive, datatype, primrec, ...). This facilitates
5580 experimentation and tool development. Note that user applications
5581 (and library theories) should never refer to anything below theory
5584 * Logic image HOL-Main stops at theory Main, and thus facilitates
5585 experimentation due to shorter build times.
5587 * Logic image HOL-NSA contains theories of nonstandard analysis which
5588 were previously part of former HOL-Complex. Entry point Hyperreal
5589 remains valid, but theories formerly using Complex_Main should now use
5590 new entry point Hypercomplex.
5592 * Generic ATP manager for Sledgehammer, based on ML threads instead of
5593 Posix processes. Avoids potentially expensive forking of the ML
5594 process. New thread-based implementation also works on non-Unix
5595 platforms (Cygwin). Provers are no longer hardwired, but defined
5596 within the theory via plain ML wrapper functions. Basic Sledgehammer
5597 commands are covered in the isar-ref manual.
5599 * Wrapper scripts for remote SystemOnTPTP service allows to use
5600 sledgehammer without local ATP installation (Vampire etc.). Other
5601 provers may be included via suitable ML wrappers, see also
5602 src/HOL/ATP_Linkup.thy.
5604 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
5607 * The metis method no longer fails because the theorem is too trivial
5608 (contains the empty clause).
5610 * The metis method now fails in the usual manner, rather than raising
5611 an exception, if it determines that it cannot prove the theorem.
5613 * Method "coherent" implements a prover for coherent logic (see also
5614 src/Tools/coherent.ML).
5616 * Constants "undefined" and "default" replace "arbitrary". Usually
5617 "undefined" is the right choice to replace "arbitrary", though
5618 logically there is no difference. INCOMPATIBILITY.
5620 * Command "value" now integrates different evaluation mechanisms. The
5621 result of the first successful evaluation mechanism is printed. In
5622 square brackets a particular named evaluation mechanisms may be
5623 specified (currently, [SML], [code] or [nbe]). See further
5624 src/HOL/ex/Eval_Examples.thy.
5626 * Normalization by evaluation now allows non-leftlinear equations.
5627 Declare with attribute [code nbe].
5629 * Methods "case_tac" and "induct_tac" now refer to the very same rules
5630 as the structured Isar versions "cases" and "induct", cf. the
5631 corresponding "cases" and "induct" attributes. Mutual induction rules
5632 are now presented as a list of individual projections
5633 (e.g. foo_bar.inducts for types foo and bar); the old format with
5634 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
5635 rare situations a different rule is selected --- notably nested tuple
5636 elimination instead of former prod.exhaust: use explicit (case_tac t
5637 rule: prod.exhaust) here.
5639 * Attributes "cases", "induct", "coinduct" support "del" option.
5641 * Removed fact "case_split_thm", which duplicates "case_split".
5643 * The option datatype has been moved to a new theory Option. Renamed
5644 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
5646 * New predicate "strict_mono" classifies strict functions on partial
5647 orders. With strict functions on linear orders, reasoning about
5648 (in)equalities is facilitated by theorems "strict_mono_eq",
5649 "strict_mono_less_eq" and "strict_mono_less".
5651 * Some set operations are now proper qualified constants with
5652 authentic syntax. INCOMPATIBILITY:
5663 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
5666 * Auxiliary class "itself" has disappeared -- classes without any
5667 parameter are treated as expected by the 'class' command.
5669 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
5671 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
5672 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
5674 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
5675 method "approximation". It proves formulas on real values by using
5676 interval arithmetic. In the formulas are also the transcendental
5677 functions sin, cos, tan, atan, ln, exp and the constant pi are
5678 allowed. For examples see
5679 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
5681 * Theory "Reflection" now resides in HOL/Library.
5683 * Entry point to Word library now simply named "Word".
5686 * Made source layout more coherent with logical distribution
5689 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
5690 src/HOL/Library/Code_Message.thy ~> src/HOL/
5691 src/HOL/Library/GCD.thy ~> src/HOL/
5692 src/HOL/Library/Order_Relation.thy ~> src/HOL/
5693 src/HOL/Library/Parity.thy ~> src/HOL/
5694 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
5695 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
5696 src/HOL/Real/Lubs.thy ~> src/HOL/
5697 src/HOL/Real/PReal.thy ~> src/HOL/
5698 src/HOL/Real/Rational.thy ~> src/HOL/
5699 src/HOL/Real/RComplete.thy ~> src/HOL/
5700 src/HOL/Real/RealDef.thy ~> src/HOL/
5701 src/HOL/Real/RealPow.thy ~> src/HOL/
5702 src/HOL/Real/Real.thy ~> src/HOL/
5703 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
5704 src/HOL/Complex/Complex.thy ~> src/HOL/
5705 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
5706 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
5707 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
5708 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
5709 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
5710 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
5711 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
5712 src/HOL/Hyperreal/Log.thy ~> src/HOL/
5713 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
5714 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
5715 src/HOL/Hyperreal/Series.thy ~> src/HOL/
5716 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
5717 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
5718 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
5719 src/HOL/Real/Float ~> src/HOL/Library/
5720 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
5721 src/HOL/Real/RealVector.thy ~> src/HOL/
5723 src/HOL/arith_data.ML ~> src/HOL/Tools
5724 src/HOL/hologic.ML ~> src/HOL/Tools
5725 src/HOL/simpdata.ML ~> src/HOL/Tools
5726 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
5727 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
5728 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
5729 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
5730 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
5731 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
5732 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
5734 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
5735 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
5736 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
5737 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
5738 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
5739 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
5741 * If methods "eval" and "evaluation" encounter a structured proof
5742 state with !!/==>, only the conclusion is evaluated to True (if
5743 possible), avoiding strange error messages.
5745 * Method "sizechange" automates termination proofs using (a
5746 modification of) the size-change principle. Requires SAT solver. See
5747 src/HOL/ex/Termination.thy for examples.
5749 * Simplifier: simproc for let expressions now unfolds if bound
5750 variable occurs at most once in let expression body. INCOMPATIBILITY.
5752 * Method "arith": Linear arithmetic now ignores all inequalities when
5753 fast_arith_neq_limit is exceeded, instead of giving up entirely.
5755 * New attribute "arith" for facts that should always be used
5756 automatically by arithmetic. It is intended to be used locally in
5759 assumes [arith]: "x > 0"
5761 Global usage is discouraged because of possible performance impact.
5763 * New classes "top" and "bot" with corresponding operations "top" and
5764 "bot" in theory Orderings; instantiation of class "complete_lattice"
5765 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
5767 * Changed definition lemma "less_fun_def" in order to provide an
5768 instance for preorders on functions; use lemma "less_le" instead.
5771 * Theory Orderings: class "wellorder" moved here, with explicit
5772 induction rule "less_induct" as assumption. For instantiation of
5773 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
5776 * Theory Orderings: added class "preorder" as superclass of "order".
5777 INCOMPATIBILITY: Instantiation proofs for order, linorder
5778 etc. slightly changed. Some theorems named order_class.* now named
5781 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
5784 * Theory Finite_Set: added a new fold combinator of type
5786 ('a => 'b => 'b) => 'b => 'a set => 'b
5788 Occasionally this is more convenient than the old fold combinator
5789 which is now defined in terms of the new one and renamed to
5792 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
5793 and "ring_simps" have been replaced by "algebra_simps" (which can be
5794 extended with further lemmas!). At the moment both still exist but
5795 the former will disappear at some point.
5797 * Theory Power: Lemma power_Suc is now declared as a simp rule in
5798 class recpower. Type-specific simp rules for various recpower types
5799 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
5801 rat_power_0 -> power_0
5802 rat_power_Suc -> power_Suc
5803 realpow_0 -> power_0
5804 realpow_Suc -> power_Suc
5805 complexpow_0 -> power_0
5806 complexpow_Suc -> power_Suc
5807 power_poly_0 -> power_0
5808 power_poly_Suc -> power_Suc
5810 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
5811 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
5812 dvd has been generalized to class comm_semiring_1. Likewise a bunch
5813 of lemmas from Divides has been generalized from nat to class
5814 semiring_div. INCOMPATIBILITY. This involves the following theorem
5815 renames resulting from duplicate elimination:
5817 dvd_def_mod ~> dvd_eq_mod_eq_0
5818 zero_dvd_iff ~> dvd_0_left_iff
5819 dvd_0 ~> dvd_0_right
5820 DIVISION_BY_ZERO_DIV ~> div_by_0
5821 DIVISION_BY_ZERO_MOD ~> mod_by_0
5822 mult_div ~> div_mult_self2_is_id
5823 mult_mod ~> mod_mult_self2_is_0
5825 * Theory IntDiv: removed many lemmas that are instances of class-based
5826 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
5827 rename old lemmas as follows:
5829 dvd_diff -> nat_dvd_diff
5830 dvd_zminus_iff -> dvd_minus_iff
5831 mod_add1_eq -> mod_add_eq
5832 mod_mult1_eq -> mod_mult_right_eq
5833 mod_mult1_eq' -> mod_mult_left_eq
5834 mod_mult_distrib_mod -> mod_mult_eq
5835 nat_mod_add_left_eq -> mod_add_left_eq
5836 nat_mod_add_right_eq -> mod_add_right_eq
5837 nat_mod_div_trivial -> mod_div_trivial
5838 nat_mod_mod_trivial -> mod_mod_trivial
5839 zdiv_zadd_self1 -> div_add_self1
5840 zdiv_zadd_self2 -> div_add_self2
5841 zdiv_zmult_self1 -> div_mult_self2_is_id
5842 zdiv_zmult_self2 -> div_mult_self1_is_id
5843 zdvd_triv_left -> dvd_triv_left
5844 zdvd_triv_right -> dvd_triv_right
5845 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
5846 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
5847 zmod_zadd_left_eq -> mod_add_left_eq
5848 zmod_zadd_right_eq -> mod_add_right_eq
5849 zmod_zadd_self1 -> mod_add_self1
5850 zmod_zadd_self2 -> mod_add_self2
5851 zmod_zadd1_eq -> mod_add_eq
5852 zmod_zdiff1_eq -> mod_diff_eq
5853 zmod_zdvd_zmod -> mod_mod_cancel
5854 zmod_zmod_cancel -> mod_mod_cancel
5855 zmod_zmult_self1 -> mod_mult_self2_is_0
5856 zmod_zmult_self2 -> mod_mult_self1_is_0
5859 zdvd_abs1 -> abs_dvd_iff
5860 zdvd_abs2 -> dvd_abs_iff
5861 zdvd_refl -> dvd_refl
5862 zdvd_trans -> dvd_trans
5863 zdvd_zadd -> dvd_add
5864 zdvd_zdiff -> dvd_diff
5865 zdvd_zminus_iff -> dvd_minus_iff
5866 zdvd_zminus2_iff -> minus_dvd_iff
5867 zdvd_zmultD -> dvd_mult_right
5868 zdvd_zmultD2 -> dvd_mult_left
5869 zdvd_zmult_mono -> mult_dvd_mono
5870 zdvd_0_right -> dvd_0_right
5871 zdvd_0_left -> dvd_0_left_iff
5872 zdvd_1_left -> one_dvd
5873 zminus_dvd_iff -> minus_dvd_iff
5875 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
5877 * The real numbers offer decimal input syntax: 12.34 is translated
5878 into 1234/10^2. This translation is not reversed upon output.
5880 * Theory Library/Polynomial defines an abstract type 'a poly of
5881 univariate polynomials with coefficients of type 'a. In addition to
5882 the standard ring operations, it also supports div and mod. Code
5883 generation is also supported, using list-style constructors.
5885 * Theory Library/Inner_Product defines a class of real_inner for real
5886 inner product spaces, with an overloaded operation inner :: 'a => 'a
5887 => real. Class real_inner is a subclass of real_normed_vector from
5890 * Theory Library/Product_Vector provides instances for the product
5891 type 'a * 'b of several classes from RealVector and Inner_Product.
5892 Definitions of addition, subtraction, scalar multiplication, norms,
5893 and inner products are included.
5895 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
5896 addition to the field operations, numerals and case syntax are also
5899 * Theory Library/Diagonalize provides constructive version of Cantor's
5900 first diagonalization argument.
5902 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
5903 zlcm (for int); carried together from various gcd/lcm developements in
5904 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
5905 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
5906 may recover tupled syntax as follows:
5908 hide (open) const gcd
5909 abbreviation gcd where
5910 "gcd == (%(a, b). GCD.gcd a b)"
5912 GCD.gcd ("gcd '(_, _')")
5914 The same works for lcm, zgcd, zlcm.
5916 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
5917 instantiations for algebraic structures. Removed some duplicate
5918 theorems. Changes in simp rules. INCOMPATIBILITY.
5920 * ML antiquotation @{code} takes a constant as argument and generates
5921 corresponding code in background and inserts name of the corresponding
5922 resulting ML value/function/datatype constructor binding in place.
5923 All occurrences of @{code} with a single ML block are generated
5924 simultaneously. Provides a generic and safe interface for
5925 instrumentalizing code generation. See
5926 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
5927 In future you ought to refrain from ad-hoc compiling generated SML
5928 code on the ML toplevel. Note that (for technical reasons) @{code}
5929 cannot refer to constants for which user-defined serializations are
5930 set. Refer to the corresponding ML counterpart directly in that
5933 * Command 'rep_datatype': instead of theorem names the command now
5934 takes a list of terms denoting the constructors of the type to be
5935 represented as datatype. The characteristic theorems have to be
5936 proven. INCOMPATIBILITY. Also observe that the following theorems
5937 have disappeared in favour of existing ones:
5939 unit_induct ~> unit.induct
5940 prod_induct ~> prod.induct
5941 sum_induct ~> sum.induct
5942 Suc_Suc_eq ~> nat.inject
5943 Suc_not_Zero Zero_not_Suc ~> nat.distinct
5948 * New locales for orders and lattices where the equivalence relation
5949 is not restricted to equality. INCOMPATIBILITY: all order and lattice
5950 locales use a record structure with field eq for the equivalence.
5952 * New theory of factorial domains.
5954 * Units_l_inv and Units_r_inv are now simp rules by default.
5955 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
5956 and/or r_inv will now also require deletion of these lemmas.
5958 * Renamed the following theorems, INCOMPATIBILITY:
5960 UpperD ~> Upper_memD
5961 LowerD ~> Lower_memD
5962 least_carrier ~> least_closed
5963 greatest_carrier ~> greatest_closed
5964 greatest_Lower_above ~> greatest_Lower_below
5965 one_zero ~> carrier_one_zero
5966 one_not_zero ~> carrier_one_not_zero (collision with assumption)
5971 * Nominal datatypes can now contain type-variables.
5973 * Commands 'nominal_inductive' and 'equivariance' work with local
5976 * Nominal primrec can now works with local theory targets and its
5977 specification syntax now conforms to the general format as seen in
5980 * Method "perm_simp" honours the standard simplifier attributes
5981 (no_asm), (no_asm_use) etc.
5983 * The new predicate #* is defined like freshness, except that on the
5984 left hand side can be a set or list of atoms.
5986 * Experimental command 'nominal_inductive2' derives strong induction
5987 principles for inductive definitions. In contrast to
5988 'nominal_inductive', which can only deal with a fixed number of
5989 binders, it can deal with arbitrary expressions standing for sets of
5990 atoms to be avoided. The only inductive definition we have at the
5991 moment that needs this generalisation is the typing rule for Lets in
5994 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
5995 -----------------------------------------------------------------
5996 Gamma |- Let x be t1 in t2 : T2
5998 In this rule one wants to avoid all the binders that are introduced by
5999 "close Gamma T1". We are looking for other examples where this
6000 feature might be useful. Please let us know.
6005 * Reimplemented the simplification procedure for proving continuity
6006 subgoals. The new simproc is extensible; users can declare additional
6007 continuity introduction rules with the attribute [cont2cont].
6009 * The continuity simproc now uses a different introduction rule for
6010 solving continuity subgoals on terms with lambda abstractions. In
6011 some rare cases the new simproc may fail to solve subgoals that the
6012 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
6013 Potential INCOMPATIBILITY.
6015 * Command 'fixrec': specification syntax now conforms to the general
6016 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
6017 examples. INCOMPATIBILITY.
6022 * Proof of Zorn's Lemma for partial orders.
6027 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
6028 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
6029 depends on multithreading, so timouts will not work before Poly/ML
6032 * High-level support for concurrent ML programming, see
6033 src/Pure/Cuncurrent. The data-oriented model of "future values" is
6034 particularly convenient to organize independent functional
6035 computations. The concept of "synchronized variables" provides a
6036 higher-order interface for components with shared state, avoiding the
6037 delicate details of mutexes and condition variables. (Requires
6038 Poly/ML 5.2.1 or later.)
6040 * ML bindings produced via Isar commands are stored within the Isar
6041 context (theory or proof). Consequently, commands like 'use' and 'ML'
6042 become thread-safe and work with undo as expected (concerning
6043 top-level bindings, not side-effects on global references).
6044 INCOMPATIBILITY, need to provide proper Isar context when invoking the
6045 compiler at runtime; really global bindings need to be given outside a
6046 theory. (Requires Poly/ML 5.2 or later.)
6048 * Command 'ML_prf' is analogous to 'ML' but works within a proof
6049 context. Top-level ML bindings are stored within the proof context in
6050 a purely sequential fashion, disregarding the nested proof structure.
6051 ML bindings introduced by 'ML_prf' are discarded at the end of the
6052 proof. (Requires Poly/ML 5.2 or later.)
6054 * Simplified ML attribute and method setup, cf. functions Attrib.setup
6055 and Method.setup, as well as Isar commands 'attribute_setup' and
6056 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
6057 existing code accordingly, or use plain 'setup' together with old
6060 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
6061 to 'a -> thm, while results are always tagged with an authentic oracle
6062 name. The Isar command 'oracle' is now polymorphic, no argument type
6063 is specified. INCOMPATIBILITY, need to simplify existing oracle code
6064 accordingly. Note that extra performance may be gained by producing
6065 the cterm carefully, avoiding slow Thm.cterm_of.
6067 * Simplified interface for defining document antiquotations via
6068 ThyOutput.antiquotation, ThyOutput.output, and optionally
6069 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
6070 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
6073 * More systematic treatment of long names, abstract name bindings, and
6074 name space operations. Basic operations on qualified names have been
6075 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
6076 Long_Name.append. Old type bstring has been mostly replaced by
6077 abstract type binding (see structure Binding), which supports precise
6078 qualification by packages and local theory targets, as well as proper
6079 tracking of source positions. INCOMPATIBILITY, need to wrap old
6080 bstring values into Binding.name, or better pass through abstract
6081 bindings everywhere. See further src/Pure/General/long_name.ML,
6082 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
6084 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
6085 LocalTheory.note etc.) now refer to the *full* internal name, not the
6086 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
6088 * Disposed old type and term read functions (Sign.read_def_typ,
6089 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
6090 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
6091 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
6092 Syntax.read_term_global etc.; see also OldGoals.read_term as last
6093 resort for legacy applications.
6095 * Disposed old declarations, tactics, tactic combinators that refer to
6096 the simpset or claset of an implicit theory (such as Addsimps,
6097 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
6098 embedded ML text, or local_simpset_of with a proper context passed as
6099 explicit runtime argument.
6101 * Rules and tactics that read instantiations (read_instantiate,
6102 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
6103 context, which is required for parsing and type-checking. Moreover,
6104 the variables are specified as plain indexnames, not string encodings
6105 thereof. INCOMPATIBILITY.
6107 * Generic Toplevel.add_hook interface allows to analyze the result of
6108 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
6109 for theorem dependency output of transactions resulting in a new
6112 * ML antiquotations: block-structured compilation context indicated by
6113 \<lbrace> ... \<rbrace>; additional antiquotation forms:
6115 @{binding name} - basic name binding
6116 @{let ?pat = term} - term abbreviation (HO matching)
6117 @{note name = fact} - fact abbreviation
6118 @{thm fact} - singleton fact (with attributes)
6119 @{thms fact} - general fact (with attributes)
6120 @{lemma prop by method} - singleton goal
6121 @{lemma prop by meth1 meth2} - singleton goal
6122 @{lemma prop1 ... propN by method} - general goal
6123 @{lemma prop1 ... propN by meth1 meth2} - general goal
6124 @{lemma (open) ...} - open derivation
6129 * The Isabelle "emacs" tool provides a specific interface to invoke
6130 Proof General / Emacs, with more explicit failure if that is not
6131 installed (the old isabelle-interface script silently falls back on
6132 isabelle-process). The PROOFGENERAL_HOME setting determines the
6133 installation location of the Proof General distribution.
6135 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
6136 the Isabelle process into a JVM/Scala application. See
6137 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
6138 process wrapper has been discontinued.)
6140 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
6142 * Various status messages (with exact source position information) are
6143 emitted, if proper markup print mode is enabled. This allows
6144 user-interface components to provide detailed feedback on internal
6149 New in Isabelle2008 (June 2008)
6150 -------------------------------
6154 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
6155 and updated, with formally checked references as hyperlinks.
6157 * Theory loader: use_thy (and similar operations) no longer set the
6158 implicit ML context, which was occasionally hard to predict and in
6159 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
6160 provides a proper context already.
6162 * Theory loader: old-style ML proof scripts being *attached* to a thy
6163 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
6164 'use' within a theory file will do the job.
6166 * Name space merge now observes canonical order, i.e. the second space
6167 is inserted into the first one, while existing entries in the first
6168 space take precedence. INCOMPATIBILITY in rare situations, may try to
6169 swap theory imports.
6171 * Syntax: symbol \<chi> is now considered a letter. Potential
6172 INCOMPATIBILITY in identifier syntax etc.
6174 * Outer syntax: string tokens no longer admit escaped white space,
6175 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
6176 white space without escapes.
6178 * Outer syntax: string tokens may contain arbitrary character codes
6179 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
6185 * Context-dependent token translations. Default setup reverts locally
6186 fixed variables, and adds hilite markup for undeclared frees.
6188 * Unused theorems can be found using the new command 'unused_thms'.
6189 There are three ways of invoking it:
6192 Only finds unused theorems in the current theory.
6194 (2) unused_thms thy_1 ... thy_n -
6195 Finds unused theorems in the current theory and all of its ancestors,
6196 excluding the theories thy_1 ... thy_n and all of their ancestors.
6198 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
6199 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
6200 their ancestors, excluding the theories thy_1 ... thy_n and all of
6203 In order to increase the readability of the list produced by
6204 unused_thms, theorems that have been created by a particular instance
6205 of a theory command such as 'inductive' or 'function' are considered
6206 to belong to the same "group", meaning that if at least one theorem in
6207 this group is used, the other theorems in the same group are no longer
6208 reported as unused. Moreover, if all theorems in the group are
6209 unused, only one theorem in the group is displayed.
6211 Note that proof objects have to be switched on in order for
6212 unused_thms to work properly (i.e. !proofs must be >= 1, which is
6213 usually the case when using Proof General with the default settings).
6215 * Authentic naming of facts disallows ad-hoc overwriting of previous
6216 theorems within the same name space. INCOMPATIBILITY, need to remove
6217 duplicate fact bindings, or even accidental fact duplications. Note
6218 that tools may maintain dynamically scoped facts systematically, using
6219 PureThy.add_thms_dynamic.
6221 * Command 'hide' now allows to hide from "fact" name space as well.
6223 * Eliminated destructive theorem database, simpset, claset, and
6224 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
6225 update of theories within ML code.
6227 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
6228 INCOMPATIBILITY, object-logics depending on former Pure require
6229 additional setup PureThy.old_appl_syntax_setup; object-logics
6230 depending on former CPure need to refer to Pure.
6232 * Commands 'use' and 'ML' are now purely functional, operating on
6233 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
6234 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
6237 * Command 'setup': discontinued implicit version with ML reference.
6239 * Instantiation target allows for simultaneous specification of class
6240 instance operations together with an instantiation proof.
6241 Type-checking phase allows to refer to class operations uniformly.
6242 See src/HOL/Complex/Complex.thy for an Isar example and
6243 src/HOL/Library/Eval.thy for an ML example.
6245 * Indexing of literal facts: be more serious about including only
6246 facts from the visible specification/proof context, but not the
6247 background context (locale etc.). Affects `prop` notation and method
6248 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
6251 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
6252 "(open)" option, which used to expose internal bound variables to the
6255 * Isar statements: removed obsolete case "rule_context".
6256 INCOMPATIBILITY, better use explicit fixes/assumes.
6258 * Locale proofs: default proof step now includes 'unfold_locales';
6259 hence 'proof' without argument may be used to unfold locale
6263 *** Document preparation ***
6265 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
6266 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
6267 obsolete thumbpdf setup (contemporary PDF viewers do this on the
6268 spot); renamed link color from "darkblue" to "linkcolor" (default
6269 value unchanged, can be redefined via \definecolor); no longer sets
6270 "a4paper" option (unnecessary or even intrusive).
6272 * Antiquotation @{lemma A method} proves proposition A by the given
6273 method (either a method name or a method name plus (optional) method
6274 arguments in parentheses) and prints A just like @{prop A}.
6279 * New primrec package. Specification syntax conforms in style to
6280 definition/function/.... No separate induction rule is provided. The
6281 "primrec" command distinguishes old-style and new-style specifications
6282 by syntax. The former primrec package is now named OldPrimrecPackage.
6283 When adjusting theories, beware: constants stemming from new-style
6284 primrec specifications have authentic syntax.
6286 * Metis prover is now an order of magnitude faster, and also works
6287 with multithreading.
6289 * Metis: the maximum number of clauses that can be produced from a
6290 theorem is now given by the attribute max_clauses. Theorems that
6291 exceed this number are ignored, with a warning printed.
6293 * Sledgehammer no longer produces structured proofs by default. To
6294 enable, declare [[sledgehammer_full = true]]. Attributes
6295 reconstruction_modulus, reconstruction_sorts renamed
6296 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
6298 * Method "induct_scheme" derives user-specified induction rules
6299 from well-founded induction and completeness of patterns. This factors
6300 out some operations that are done internally by the function package
6301 and makes them available separately. See
6302 src/HOL/ex/Induction_Scheme.thy for examples.
6304 * More flexible generation of measure functions for termination
6305 proofs: Measure functions can be declared by proving a rule of the
6306 form "is_measure f" and giving it the [measure_function] attribute.
6307 The "is_measure" predicate is logically meaningless (always true), and
6308 just guides the heuristic. To find suitable measure functions, the
6309 termination prover sets up the goal "is_measure ?f" of the appropriate
6310 type and generates all solutions by Prolog-style backward proof using
6313 This setup also deals with rules like
6315 "is_measure f ==> is_measure (list_size f)"
6317 which accommodates nested datatypes that recurse through lists.
6318 Similar rules are predeclared for products and option types.
6320 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
6324 - Definitions of overloaded constants on sets have to be replaced by
6325 definitions on => and bool.
6327 - Some definitions of overloaded operators on sets can now be proved
6328 using the definitions of the operators on => and bool. Therefore,
6329 the following theorems have been renamed:
6331 subset_def -> subset_eq
6332 psubset_def -> psubset_eq
6333 set_diff_def -> set_diff_eq
6334 Compl_def -> Compl_eq
6335 Sup_set_def -> Sup_set_eq
6336 Inf_set_def -> Inf_set_eq
6337 sup_set_def -> sup_set_eq
6338 inf_set_def -> inf_set_eq
6340 - Due to the incompleteness of the HO unification algorithm, some
6341 rules such as subst may require manual instantiation, if some of
6342 the unknowns in the rule is a set.
6344 - Higher order unification and forward proofs:
6347 have "P (S::'a set)" <...>
6348 then have "EX S. P S" ..
6350 no longer works (due to the incompleteness of the HO unification
6351 algorithm) and must be replaced by the pattern
6358 - Calculational reasoning with subst (or similar rules):
6361 have "P (S::'a set)" <...>
6362 also have "S = T" <...>
6363 finally have "P T" .
6365 no longer works (for similar reasons as the previous example) and
6366 must be replaced by something like
6368 have "P (S::'a set)" <...>
6369 moreover have "S = T" <...>
6370 ultimately have "P T" by simp
6372 - Tactics or packages written in ML code:
6373 Code performing pattern matching on types via
6375 Type ("set", [T]) => ...
6377 must be rewritten. Moreover, functions like strip_type or
6378 binder_types no longer return the right value when applied to a
6381 T1 => ... => Tn => U => bool
6385 T1 => ... => Tn => U set
6387 * Merged theories Wellfounded_Recursion, Accessible_Part and
6388 Wellfounded_Relations to theory Wellfounded.
6390 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
6392 * Class finite no longer treats UNIV as class parameter. Use class
6393 enum from theory Library/Enum instead to achieve a similar effect.
6396 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
6397 and "Cons". INCOMPATIBILITY.
6399 * HOL (and FOL): renamed variables in rules imp_elim and swap.
6400 Potential INCOMPATIBILITY.
6402 * Theory Product_Type: duplicated lemmas split_Pair_apply and
6403 injective_fst_snd removed, use split_eta and prod_eqI instead.
6404 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
6406 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
6407 the same name in theory Orderings:
6417 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
6418 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
6419 and different variable names.
6421 * Library/Option_ord.thy: Canonical order on option type.
6423 * Library/RBT.thy: Red-black trees, an efficient implementation of
6426 * Library/Countable.thy: Type class for countable types.
6428 * Theory Int: The representation of numerals has changed. The infix
6429 operator BIT and the bit datatype with constructors B0 and B1 have
6430 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
6431 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
6432 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
6435 * Theory Nat: definition of <= and < on natural numbers no longer
6436 depend on well-founded relations. INCOMPATIBILITY. Definitions
6437 le_def and less_def have disappeared. Consider lemmas not_less
6438 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
6440 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
6441 (whose purpose mainly is for various fold_set functionals) have been
6442 abandoned in favor of the existing algebraic classes
6443 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
6444 lower_semilattice (resp. upper_semilattice) and linorder.
6447 * Theory Transitive_Closure: induct and cases rules now declare proper
6448 case_names ("base" and "step"). INCOMPATIBILITY.
6450 * Theorem Inductive.lfp_ordinal_induct generalized to complete
6451 lattices. The form set-specific version is available as
6452 Inductive.lfp_ordinal_induct_set.
6454 * Renamed theorems "power.simps" to "power_int.simps".
6457 * Class semiring_div provides basic abstract properties of semirings
6458 with division and modulo operations. Subsumes former class dvd_mod.
6460 * Merged theories IntDef, Numeral and IntArith into unified theory
6461 Int. INCOMPATIBILITY.
6463 * Theory Library/Code_Index: type "index" now represents natural
6464 numbers rather than integers. INCOMPATIBILITY.
6466 * New class "uminus" with operation "uminus" (split of from class
6467 "minus" which now only has operation "minus", binary).
6470 * Constants "card", "internal_split", "option_map" now with authentic
6471 syntax. INCOMPATIBILITY.
6473 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
6474 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
6475 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
6476 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
6477 Sup_set_def, le_def, less_def, option_map_def now with object
6478 equality. INCOMPATIBILITY.
6480 * Records. Removed K_record, and replaced it by pure lambda term
6481 %x. c. The simplifier setup is now more robust against eta expansion.
6482 INCOMPATIBILITY: in cases explicitly referring to K_record.
6484 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
6486 * Library/ListVector: new theory of arithmetic vector operations.
6488 * Library/Order_Relation: new theory of various orderings as sets of
6489 pairs. Defines preorders, partial orders, linear orders and
6490 well-orders on sets and on types.
6495 * Renamed some theories to allow to loading both ZF and HOL in the
6498 Datatype -> Datatype_ZF
6499 Inductive -> Inductive_ZF
6506 INCOMPATIBILITY: ZF theories that import individual theories below
6507 Main might need to be adapted. Regular theory Main is still
6508 available, as trivial extension of Main_ZF.
6513 * ML within Isar: antiquotation @{const name} or @{const
6514 name(typargs)} produces statically-checked Const term.
6516 * Functor NamedThmsFun: data is available to the user as dynamic fact
6517 (of the same name). Removed obsolete print command.
6519 * Removed obsolete "use_legacy_bindings" function.
6521 * The ``print mode'' is now a thread-local value derived from a global
6522 template (the former print_mode reference), thus access becomes
6523 non-critical. The global print_mode reference is for session
6524 management only; user-code should use print_mode_value,
6525 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
6527 * Functions system/system_out provide a robust way to invoke external
6528 shell commands, with propagation of interrupts (requires Poly/ML
6529 5.2.1). Do not use OS.Process.system etc. from the basis library!
6534 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
6535 in accordance with Proof General 3.7, which prefers GNU emacs.
6537 * isatool tty runs Isabelle process with plain tty interaction;
6538 optional line editor may be specified via ISABELLE_LINE_EDITOR
6539 setting, the default settings attempt to locate "ledit" and "rlwrap".
6541 * isatool browser now works with Cygwin as well, using general
6542 "javapath" function defined in Isabelle process environment.
6544 * YXML notation provides a simple and efficient alternative to
6545 standard XML transfer syntax. See src/Pure/General/yxml.ML and
6546 isatool yxml as described in the Isabelle system manual.
6548 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
6549 provides general wrapper for managing an Isabelle process in a robust
6550 fashion, with ``cooked'' output from stdin/stderr.
6552 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
6553 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
6555 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
6556 way of changing the user's settings is via
6557 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
6560 * Multithreading.max_threads := 0 refers to the number of actual CPU
6561 cores of the underlying machine, which is a good starting point for
6562 optimal performance tuning. The corresponding usedir option -M allows
6563 "max" as an alias for "0". WARNING: does not work on certain versions
6564 of Mac OS (with Poly/ML 5.1).
6566 * isabelle-process: non-ML sessions are run with "nice", to reduce the
6567 adverse effect of Isabelle flooding interactive front-ends (notably
6568 ProofGeneral / XEmacs).
6572 New in Isabelle2007 (November 2007)
6573 -----------------------------------
6577 * More uniform information about legacy features, notably a
6578 warning/error of "Legacy feature: ...", depending on the state of the
6579 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
6580 legacy features will disappear eventually.
6582 * Theory syntax: the header format ``theory A = B + C:'' has been
6583 discontinued in favour of ``theory A imports B C begin''. Use isatool
6584 fixheaders to convert existing theory files. INCOMPATIBILITY.
6586 * Theory syntax: the old non-Isar theory file format has been
6587 discontinued altogether. Note that ML proof scripts may still be used
6588 with Isar theories; migration is usually quite simple with the ML
6589 function use_legacy_bindings. INCOMPATIBILITY.
6591 * Theory syntax: some popular names (e.g. 'class', 'declaration',
6592 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
6595 * Theory loader: be more serious about observing the static theory
6596 header specifications (including optional directories), but not the
6597 accidental file locations of previously successful loads. The strict
6598 update policy of former update_thy is now already performed by
6599 use_thy, so the former has been removed; use_thys updates several
6600 theories simultaneously, just as 'imports' within a theory header
6601 specification, but without merging the results. Potential
6602 INCOMPATIBILITY: may need to refine theory headers and commands
6603 ROOT.ML which depend on load order.
6605 * Theory loader: optional support for content-based file
6606 identification, instead of the traditional scheme of full physical
6607 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
6608 (cf. the system manual). The new scheme allows to work with
6609 non-finished theories in persistent session images, such that source
6610 files may be moved later on without requiring reloads.
6612 * Theory loader: old-style ML proof scripts being *attached* to a thy
6613 file (with the same base name as the theory) are considered a legacy
6614 feature, which will disappear eventually. Even now, the theory loader
6615 no longer maintains dependencies on such files.
6617 * Syntax: the scope for resolving ambiguities via type-inference is
6618 now limited to individual terms, instead of whole simultaneous
6619 specifications as before. This greatly reduces the complexity of the
6620 syntax module and improves flexibility by separating parsing and
6621 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
6622 'fixes' etc.) are required in rare situations.
6624 * Syntax: constants introduced by new-style packages ('definition',
6625 'abbreviation' etc.) are passed through the syntax module in
6626 ``authentic mode''. This means that associated mixfix annotations
6627 really stick to such constants, independently of potential name space
6628 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
6629 trees are represented slightly differently, may need to adapt syntax
6630 translations accordingly. Use CONST marker in 'translations' and
6631 @{const_syntax} antiquotation in 'parse_translation' etc.
6633 * Legacy goal package: reduced interface to the bare minimum required
6634 to keep existing proof scripts running. Most other user-level
6635 functions are now part of the OldGoals structure, which is *not* open
6636 by default (consider isatool expandshort before open OldGoals).
6637 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
6638 these tend to cause confusion about the actual goal (!) context being
6639 used here, which is not necessarily the same as the_context().
6641 * Command 'find_theorems': supports "*" wild-card in "name:"
6642 criterion; "with_dups" option. Certain ProofGeneral versions might
6643 support a specific search form (see ProofGeneral/CHANGES).
6645 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
6646 by default, which means that "prems" (and also "fixed variables") are
6647 suppressed from proof state output. Note that the ProofGeneral
6648 settings mechanism allows to change and save options persistently, but
6649 older versions of Isabelle will fail to start up if a negative prems
6652 * Local theory targets may be specified by non-nested blocks of
6653 ``context/locale/class ... begin'' followed by ``end''. The body may
6654 contain definitions, theorems etc., including any derived mechanism
6655 that has been implemented on top of these primitives. This concept
6656 generalizes the existing ``theorem (in ...)'' towards more versatility
6659 * Proof General interface: proper undo of final 'end' command;
6660 discontinued Isabelle/classic mode (ML proof scripts).
6663 *** Document preparation ***
6665 * Added antiquotation @{theory name} which prints the given name,
6666 after checking that it refers to a valid ancestor theory in the
6669 * Added antiquotations @{ML_type text} and @{ML_struct text} which
6670 check the given source text as ML type/structure, printing verbatim.
6672 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
6673 "c args == rhs" given in the current context. (Any number of
6674 arguments may be given on the LHS.)
6679 * The 'class' package offers a combination of axclass and locale to
6680 achieve Haskell-like type classes in Isabelle. Definitions and
6681 theorems within a class context produce both relative results (with
6682 implicit parameters according to the locale context), and polymorphic
6683 constants with qualified polymorphism (according to the class
6684 context). Within the body context of a 'class' target, a separate
6685 syntax layer ("user space type system") takes care of converting
6686 between global polymorphic consts and internal locale representation.
6687 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
6688 "isatool doc classes" provides a tutorial.
6690 * Generic code generator framework allows to generate executable
6691 code for ML and Haskell (including Isabelle classes). A short usage
6694 internal compilation:
6695 export_code <list of constants (term syntax)> in SML
6696 writing SML code to a file:
6697 export_code <list of constants (term syntax)> in SML <filename>
6698 writing OCaml code to a file:
6699 export_code <list of constants (term syntax)> in OCaml <filename>
6700 writing Haskell code to a bunch of files:
6701 export_code <list of constants (term syntax)> in Haskell <filename>
6703 evaluating closed propositions to True/False using code generation:
6706 Reasonable default setup of framework in HOL.
6708 Theorem attributs for selecting and transforming function equations theorems:
6710 [code fun]: select a theorem as function equation for a specific constant
6711 [code fun del]: deselect a theorem as function equation for a specific constant
6712 [code inline]: select an equation theorem for unfolding (inlining) in place
6713 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
6715 User-defined serializations (target in {SML, OCaml, Haskell}):
6717 code_const <and-list of constants (term syntax)>
6718 {(target) <and-list of const target syntax>}+
6720 code_type <and-list of type constructors>
6721 {(target) <and-list of type target syntax>}+
6723 code_instance <and-list of instances>
6725 where instance ::= <type constructor> :: <class>
6727 code_class <and_list of classes>
6728 {(target) <and-list of class target syntax>}+
6729 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
6731 code_instance and code_class only are effective to target Haskell.
6733 For example usage see src/HOL/ex/Codegenerator.thy and
6734 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
6735 generation from Isabelle/HOL theories is available via "isatool doc
6738 * Code generator: consts in 'consts_code' Isar commands are now
6739 referred to by usual term syntax (including optional type
6742 * Command 'no_translations' removes translation rules from theory
6745 * Overloaded definitions are now actually checked for acyclic
6746 dependencies. The overloading scheme is slightly more general than
6747 that of Haskell98, although Isabelle does not demand an exact
6748 correspondence to type class and instance declarations.
6749 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
6750 exotic versions of overloading -- at the discretion of the user!
6752 Polymorphic constants are represented via type arguments, i.e. the
6753 instantiation that matches an instance against the most general
6754 declaration given in the signature. For example, with the declaration
6755 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
6756 as c(nat). Overloading is essentially simultaneous structural
6757 recursion over such type arguments. Incomplete specification patterns
6758 impose global constraints on all occurrences, e.g. c('a * 'a) on the
6759 LHS means that more general c('a * 'b) will be disallowed on any RHS.
6760 Command 'print_theory' outputs the normalized system of recursive
6761 equations, see section "definitions".
6763 * Configuration options are maintained within the theory or proof
6764 context (with name and type bool/int/string), providing a very simple
6765 interface to a poor-man's version of general context data. Tools may
6766 declare options in ML (e.g. using Attrib.config_int) and then refer to
6767 these values using Config.get etc. Users may change options via an
6768 associated attribute of the same name. This form of context
6769 declaration works particularly well with commands 'declare' or
6770 'using', for example ``declare [[foo = 42]]''. Thus it has become
6771 very easy to avoid global references, which would not observe Isar
6772 toplevel undo/redo and fail to work with multithreading.
6774 Various global ML references of Pure and HOL have been turned into
6775 configuration options:
6777 Unify.search_bound unify_search_bound
6778 Unify.trace_bound unify_trace_bound
6779 Unify.trace_simp unify_trace_simp
6780 Unify.trace_types unify_trace_types
6781 Simplifier.simp_depth_limit simp_depth_limit
6782 Blast.depth_limit blast_depth_limit
6783 DatatypeProp.dtK datatype_distinctness_limit
6784 fast_arith_neq_limit fast_arith_neq_limit
6785 fast_arith_split_limit fast_arith_split_limit
6787 * Named collections of theorems may be easily installed as context
6788 data using the functor NamedThmsFun (see also
6789 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
6790 attributes; there is also a toplevel print command. This facility is
6791 just a common case of general context data, which is the preferred way
6792 for anything more complex than just a list of facts in canonical
6795 * Isar: command 'declaration' augments a local theory by generic
6796 declaration functions written in ML. This enables arbitrary content
6797 being added to the context, depending on a morphism that tells the
6798 difference of the original declaration context wrt. the application
6799 context encountered later on.
6801 * Isar: proper interfaces for simplification procedures. Command
6802 'simproc_setup' declares named simprocs (with match patterns, and body
6803 text in ML). Attribute "simproc" adds/deletes simprocs in the current
6804 context. ML antiquotation @{simproc name} retrieves named simprocs.
6806 * Isar: an extra pair of brackets around attribute declarations
6807 abbreviates a theorem reference involving an internal dummy fact,
6808 which will be ignored later --- only the effect of the attribute on
6809 the background context will persist. This form of in-place
6810 declarations is particularly useful with commands like 'declare' and
6811 'using', for example ``have A using [[simproc a]] by simp''.
6813 * Isar: method "assumption" (and implicit closing of subproofs) now
6814 takes simple non-atomic goal assumptions into account: after applying
6815 an assumption as a rule the resulting subgoals are solved by atomic
6816 assumption steps. This is particularly useful to finish 'obtain'
6817 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
6818 without referring to the original premise "!!x. P x ==> thesis" in the
6819 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
6822 * Isar: implicit use of prems from the Isar proof context is
6823 considered a legacy feature. Common applications like ``have A .''
6824 may be replaced by ``have A by fact'' or ``note `A`''. In general,
6825 referencing facts explicitly here improves readability and
6826 maintainability of proof texts.
6828 * Isar: improper proof element 'guess' is like 'obtain', but derives
6829 the obtained context from the course of reasoning! For example:
6831 assume "EX x y. A x & B y" -- "any previous fact"
6832 then guess x and y by clarify
6834 This technique is potentially adventurous, depending on the facts and
6835 proof tools being involved here.
6837 * Isar: known facts from the proof context may be specified as literal
6838 propositions, using ASCII back-quote syntax. This works wherever
6839 named facts used to be allowed so far, in proof commands, proof
6840 methods, attributes etc. Literal facts are retrieved from the context
6841 according to unification of type and term parameters. For example,
6842 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
6843 theorems in the current context, then these are valid literal facts:
6844 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
6846 There is also a proof method "fact" which does the same composition
6847 for explicit goal states, e.g. the following proof texts coincide with
6848 certain special cases of literal facts:
6850 have "A" by fact == note `A`
6851 have "A ==> B" by fact == note `A ==> B`
6852 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
6853 have "P a ==> Q a" by fact == note `P a ==> Q a`
6855 * Isar: ":" (colon) is no longer a symbolic identifier character in
6856 outer syntax. Thus symbolic identifiers may be used without
6857 additional white space in declarations like this: ``assume *: A''.
6859 * Isar: 'print_facts' prints all local facts of the current context,
6860 both named and unnamed ones.
6862 * Isar: 'def' now admits simultaneous definitions, e.g.:
6864 def x == "t" and y == "u"
6866 * Isar: added command 'unfolding', which is structurally similar to
6867 'using', but affects both the goal state and facts by unfolding given
6868 rewrite rules. Thus many occurrences of the 'unfold' method or
6869 'unfolded' attribute may be replaced by first-class proof text.
6871 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
6872 and command 'unfolding' now all support object-level equalities
6873 (potentially conditional). The underlying notion of rewrite rule is
6874 analogous to the 'rule_format' attribute, but *not* that of the
6875 Simplifier (which is usually more generous).
6877 * Isar: the new attribute [rotated n] (default n = 1) rotates the
6878 premises of a theorem by n. Useful in conjunction with drule.
6880 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
6881 method expression within a sandbox consisting of the first N
6882 sub-goals, which need to exist. For example, ``simp_all [3]''
6883 simplifies the first three sub-goals, while (rule foo, simp_all)[]
6884 simplifies all new goals that emerge from applying rule foo to the
6885 originally first one.
6887 * Isar: schematic goals are no longer restricted to higher-order
6888 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
6891 * Isar: the conclusion of a long theorem statement is now either
6892 'shows' (a simultaneous conjunction, as before), or 'obtains'
6893 (essentially a disjunction of cases with local parameters and
6894 assumptions). The latter allows to express general elimination rules
6895 adequately; in this notation common elimination rules look like this:
6897 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
6899 obtains x where "P x"
6901 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
6905 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
6911 The subsequent classical rules even refer to the formal "thesis"
6914 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
6917 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
6918 obtains "thesis ==> something"
6920 The actual proof of an 'obtains' statement is analogous to that of the
6921 Isar proof element 'obtain', only that there may be several cases.
6922 Optional case names may be specified in parentheses; these will be
6923 available both in the present proof and as annotations in the
6924 resulting rule, for later use with the 'cases' method (cf. attribute
6927 * Isar: the assumptions of a long theorem statement are available as
6928 "assms" fact in the proof context. This is more appropriate than the
6929 (historical) "prems", which refers to all assumptions of the current
6930 context, including those from the target locale, proof body etc.
6932 * Isar: 'print_statement' prints theorems from the current theory or
6933 proof context in long statement form, according to the syntax of a
6936 * Isar: 'obtain' takes an optional case name for the local context
6937 introduction rule (default "that").
6939 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
6940 explicit (is "_ ==> ?foo") in the rare cases where this still happens
6943 * Pure: syntax "CONST name" produces a fully internalized constant
6944 according to the current context. This is particularly useful for
6945 syntax translations that should refer to internal constant
6946 representations independently of name spaces.
6948 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
6949 instead of "FOO ". This allows multiple binder declarations to coexist
6950 in the same context. INCOMPATIBILITY.
6952 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
6953 primitive that also works in a locale context (both for constants and
6954 fixed variables). Type declaration and internal syntactic representation
6955 of given constants retrieved from the context. Likewise, the
6956 'no_notation' command allows to remove given syntax annotations from the
6959 * Isar/locales: new derived specification elements 'axiomatization',
6960 'definition', 'abbreviation', which support type-inference, admit
6961 object-level specifications (equality, equivalence). See also the
6962 isar-ref manual. Examples:
6965 eq (infix "===" 50) where
6966 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
6968 definition "f x y = x + y + 1"
6969 definition g where "g x = f x x"
6972 neq (infix "=!=" 50) where
6973 "x =!= y == ~ (x === y)"
6975 These specifications may be also used in a locale context. Then the
6976 constants being introduced depend on certain fixed parameters, and the
6977 constant name is qualified by the locale base name. An internal
6978 abbreviation takes care for convenient input and output, making the
6979 parameters implicit and using the original short name. See also
6980 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
6981 entities from a monomorphic theory.
6983 Presently, abbreviations are only available 'in' a target locale, but
6984 not inherited by general import expressions. Also note that
6985 'abbreviation' may be used as a type-safe replacement for 'syntax' +
6986 'translations' in common applications. The "no_abbrevs" print mode
6987 prevents folding of abbreviations in term output.
6989 Concrete syntax is attached to specified constants in internal form,
6990 independently of name spaces. The parse tree representation is
6991 slightly different -- use 'notation' instead of raw 'syntax', and
6992 'translations' with explicit "CONST" markup to accommodate this.
6994 * Pure/Isar: unified syntax for new-style specification mechanisms
6995 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
6996 full type inference and dummy patterns ("_"). For example:
6998 definition "K x _ = x"
7000 inductive conj for A B
7001 where "A ==> B ==> conj A B"
7003 * Pure: command 'print_abbrevs' prints all constant abbreviations of
7004 the current context. Print mode "no_abbrevs" prevents inversion of
7005 abbreviations on output.
7007 * Isar/locales: improved parameter handling: use of locales "var" and
7008 "struct" no longer necessary; - parameter renamings are no longer
7009 required to be injective. For example, this allows to define
7010 endomorphisms as locale endom = homom mult mult h.
7012 * Isar/locales: changed the way locales with predicates are defined.
7013 Instead of accumulating the specification, the imported expression is
7014 now an interpretation. INCOMPATIBILITY: different normal form of
7015 locale expressions. In particular, in interpretations of locales with
7016 predicates, goals repesenting already interpreted fragments are not
7017 removed automatically. Use methods `intro_locales' and
7018 `unfold_locales'; see below.
7020 * Isar/locales: new methods `intro_locales' and `unfold_locales'
7021 provide backward reasoning on locales predicates. The methods are
7022 aware of interpretations and discharge corresponding goals.
7023 `intro_locales' is less aggressive then `unfold_locales' and does not
7024 unfold predicates to assumptions.
7026 * Isar/locales: the order in which locale fragments are accumulated
7027 has changed. This enables to override declarations from fragments due
7028 to interpretations -- for example, unwanted simp rules.
7030 * Isar/locales: interpretation in theories and proof contexts has been
7031 extended. One may now specify (and prove) equations, which are
7032 unfolded in interpreted theorems. This is useful for replacing
7033 defined concepts (constants depending on locale parameters) by
7034 concepts already existing in the target context. Example:
7036 interpretation partial_order ["op <= :: [int, int] => bool"]
7037 where "partial_order.less (op <=) (x::int) y = (x < y)"
7039 Typically, the constant `partial_order.less' is created by a
7040 definition specification element in the context of locale
7043 * Method "induct": improved internal context management to support
7044 local fixes and defines on-the-fly. Thus explicit meta-level
7045 connectives !! and ==> are rarely required anymore in inductive goals
7046 (using object-logic connectives for this purpose has been long
7047 obsolete anyway). Common proof patterns are explained in
7048 src/HOL/Induct/Common_Patterns.thy, see also
7049 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
7052 * Method "induct": improved handling of simultaneous goals. Instead of
7053 introducing object-level conjunction, the statement is now split into
7054 several conclusions, while the corresponding symbolic cases are nested
7055 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
7056 see src/HOL/Induct/Common_Patterns.thy, for example.
7058 * Method "induct": mutual induction rules are now specified as a list
7059 of rule sharing the same induction cases. HOL packages usually provide
7060 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
7061 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
7062 mutual induction rules differently, i.e. like this:
7064 (induct rule: foo_bar.inducts)
7065 (induct set: foo bar)
7066 (induct pred: foo bar)
7067 (induct type: foo bar)
7069 The ML function ProjectRule.projections turns old-style rules into the
7072 * Method "coinduct": dual of induction, see
7073 src/HOL/Library/Coinductive_List.thy for various examples.
7075 * Method "cases", "induct", "coinduct": the ``(open)'' option is
7076 considered a legacy feature.
7078 * Attribute "symmetric" produces result with standardized schematic
7079 variables (index 0). Potential INCOMPATIBILITY.
7081 * Simplifier: by default the simplifier trace only shows top level
7082 rewrites now. That is, trace_simp_depth_limit is set to 1 by
7083 default. Thus there is less danger of being flooded by the trace. The
7084 trace indicates where parts have been suppressed.
7086 * Provers/classical: removed obsolete classical version of elim_format
7087 attribute; classical elim/dest rules are now treated uniformly when
7088 manipulating the claset.
7090 * Provers/classical: stricter checks to ensure that supplied intro,
7091 dest and elim rules are well-formed; dest and elim rules must have at
7094 * Provers/classical: attributes dest/elim/intro take an optional
7095 weight argument for the rule (just as the Pure versions). Weights are
7096 ignored by automated tools, but determine the search order of single
7099 * Syntax: input syntax now supports dummy variable binding "%_. b",
7100 where the body does not mention the bound variable. Note that dummy
7101 patterns implicitly depend on their context of bounds, which makes
7102 "{_. _}" match any set comprehension as expected. Potential
7103 INCOMPATIBILITY -- parse translations need to cope with syntactic
7104 constant "_idtdummy" in the binding position.
7106 * Syntax: removed obsolete syntactic constant "_K" and its associated
7107 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
7108 for example "A -> B" => "Pi A (%_. B)".
7110 * Pure: 'class_deps' command visualizes the subclass relation, using
7111 the graph browser tool.
7113 * Pure: 'print_theory' now suppresses certain internal declarations by
7114 default; use '!' option for full details.
7119 * Method "metis" proves goals by applying the Metis general-purpose
7120 resolution prover (see also http://gilith.com/software/metis/).
7121 Examples are in the directory MetisExamples. WARNING: the
7122 Isabelle/HOL-Metis integration does not yet work properly with
7125 * Command 'sledgehammer' invokes external automatic theorem provers as
7126 background processes. It generates calls to the "metis" method if
7127 successful. These can be pasted into the proof. Users do not have to
7128 wait for the automatic provers to return. WARNING: does not really
7129 work with multi-threading.
7131 * New "auto_quickcheck" feature tests outermost goal statements for
7132 potential counter-examples. Controlled by ML references
7133 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
7134 5000 milliseconds). Fails silently if statements is outside of
7135 executable fragment, or any other codgenerator problem occurs.
7137 * New constant "undefined" with axiom "undefined x = undefined".
7139 * Added class "HOL.eq", allowing for code generation with polymorphic
7142 * Some renaming of class constants due to canonical name prefixing in
7143 the new 'class' package:
7145 HOL.abs ~> HOL.abs_class.abs
7146 HOL.divide ~> HOL.divide_class.divide
7147 0 ~> HOL.zero_class.zero
7148 1 ~> HOL.one_class.one
7149 op + ~> HOL.plus_class.plus
7150 op - ~> HOL.minus_class.minus
7151 uminus ~> HOL.minus_class.uminus
7152 op * ~> HOL.times_class.times
7153 op < ~> HOL.ord_class.less
7154 op <= > HOL.ord_class.less_eq
7155 Nat.power ~> Power.power_class.power
7156 Nat.size ~> Nat.size_class.size
7157 Numeral.number_of ~> Numeral.number_class.number_of
7158 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
7159 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
7160 Orderings.min ~> Orderings.ord_class.min
7161 Orderings.max ~> Orderings.ord_class.max
7162 Divides.op div ~> Divides.div_class.div
7163 Divides.op mod ~> Divides.div_class.mod
7164 Divides.op dvd ~> Divides.div_class.dvd
7166 INCOMPATIBILITY. Adaptions may be required in the following cases:
7168 a) User-defined constants using any of the names "plus", "minus",
7169 "times", "less" or "less_eq". The standard syntax translations for
7170 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
7173 b) Variables named "plus", "minus", "times", "less", "less_eq"
7174 INCOMPATIBILITY: use more specific names.
7176 c) Permutative equations (e.g. "a + b = b + a")
7177 Since the change of names also changes the order of terms, permutative
7178 rewrite rules may get applied in a different order. Experience shows
7179 that this is rarely the case (only two adaptions in the whole Isabelle
7180 distribution). INCOMPATIBILITY: rewrite proofs
7182 d) ML code directly refering to constant names
7183 This in general only affects hand-written proof tactics, simprocs and
7184 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
7185 Consider using @{const_name} antiquotation.
7187 * New class "default" with associated constant "default".
7189 * Function "sgn" is now overloaded and available on int, real, complex
7190 (and other numeric types), using class "sgn". Two possible defs of
7191 sgn are given as equational assumptions in the classes sgn_if and
7192 sgn_div_norm; ordered_idom now also inherits from sgn_if.
7195 * Locale "partial_order" now unified with class "order" (cf. theory
7196 Orderings), added parameter "less". INCOMPATIBILITY.
7198 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
7199 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
7200 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
7202 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
7203 changed order of proof goals in instance proofs.
7205 * The transitivity reasoner for partial and linear orders is set up
7206 for classes "order" and "linorder". Instances of the reasoner are available
7207 in all contexts importing or interpreting the corresponding locales.
7208 Method "order" invokes the reasoner separately; the reasoner
7209 is also integrated with the Simplifier as a solver. Diagnostic
7210 command 'print_orders' shows the available instances of the reasoner
7211 in the current context.
7213 * Localized monotonicity predicate in theory "Orderings"; integrated
7214 lemmas max_of_mono and min_of_mono with this predicate.
7217 * Formulation of theorem "dense" changed slightly due to integration
7218 with new class dense_linear_order.
7220 * Uniform lattice theory development in HOL.
7222 constants "meet" and "join" now named "inf" and "sup"
7223 constant "Meet" now named "Inf"
7225 classes "meet_semilorder" and "join_semilorder" now named
7226 "lower_semilattice" and "upper_semilattice"
7227 class "lorder" now named "lattice"
7228 class "comp_lat" now named "complete_lattice"
7230 Instantiation of lattice classes allows explicit definitions
7231 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
7233 INCOMPATIBILITY. Theorem renames:
7235 meet_left_le ~> inf_le1
7236 meet_right_le ~> inf_le2
7237 join_left_le ~> sup_ge1
7238 join_right_le ~> sup_ge2
7239 meet_join_le ~> inf_sup_ord
7242 le_meet ~> le_inf_iff
7243 le_join ~> ge_sup_conv
7244 meet_idempotent ~> inf_idem
7245 join_idempotent ~> sup_idem
7246 meet_comm ~> inf_commute
7247 join_comm ~> sup_commute
7248 meet_leI1 ~> le_infI1
7249 meet_leI2 ~> le_infI2
7250 le_joinI1 ~> le_supI1
7251 le_joinI2 ~> le_supI2
7252 meet_assoc ~> inf_assoc
7253 join_assoc ~> sup_assoc
7254 meet_left_comm ~> inf_left_commute
7255 meet_left_idempotent ~> inf_left_idem
7256 join_left_comm ~> sup_left_commute
7257 join_left_idempotent ~> sup_left_idem
7260 le_def_meet ~> le_iff_inf
7261 le_def_join ~> le_iff_sup
7262 join_absorp2 ~> sup_absorb2
7263 join_absorp1 ~> sup_absorb1
7264 meet_absorp1 ~> inf_absorb1
7265 meet_absorp2 ~> inf_absorb2
7266 meet_join_absorp ~> inf_sup_absorb
7267 join_meet_absorp ~> sup_inf_absorb
7268 distrib_join_le ~> distrib_sup_le
7269 distrib_meet_le ~> distrib_inf_le
7271 add_meet_distrib_left ~> add_inf_distrib_left
7272 add_join_distrib_left ~> add_sup_distrib_left
7273 is_join_neg_meet ~> is_join_neg_inf
7274 is_meet_neg_join ~> is_meet_neg_sup
7275 add_meet_distrib_right ~> add_inf_distrib_right
7276 add_join_distrib_right ~> add_sup_distrib_right
7277 add_meet_join_distribs ~> add_sup_inf_distribs
7278 join_eq_neg_meet ~> sup_eq_neg_inf
7279 meet_eq_neg_join ~> inf_eq_neg_sup
7280 add_eq_meet_join ~> add_eq_inf_sup
7281 meet_0_imp_0 ~> inf_0_imp_0
7282 join_0_imp_0 ~> sup_0_imp_0
7283 meet_0_eq_0 ~> inf_0_eq_0
7284 join_0_eq_0 ~> sup_0_eq_0
7285 neg_meet_eq_join ~> neg_inf_eq_sup
7286 neg_join_eq_meet ~> neg_sup_eq_inf
7287 join_eq_if ~> sup_eq_if
7289 mono_meet ~> mono_inf
7290 mono_join ~> mono_sup
7291 meet_bool_eq ~> inf_bool_eq
7292 join_bool_eq ~> sup_bool_eq
7293 meet_fun_eq ~> inf_fun_eq
7294 join_fun_eq ~> sup_fun_eq
7295 meet_set_eq ~> inf_set_eq
7296 join_set_eq ~> sup_set_eq
7297 meet1_iff ~> inf1_iff
7298 meet2_iff ~> inf2_iff
7307 join1_iff ~> sup1_iff
7308 join2_iff ~> sup2_iff
7318 is_meet_Meet ~> is_meet_Inf
7319 Meet_bool_def ~> Inf_bool_def
7320 Meet_fun_def ~> Inf_fun_def
7321 Meet_greatest ~> Inf_greatest
7322 Meet_lower ~> Inf_lower
7323 Meet_set_def ~> Inf_set_def
7326 Sup_bool_eq ~> Sup_bool_def
7327 Sup_fun_eq ~> Sup_fun_def
7328 Sup_set_eq ~> Sup_set_def
7330 listsp_meetI ~> listsp_infI
7331 listsp_meet_eq ~> listsp_inf_eq
7336 * Added syntactic class "size"; overloaded constant "size" now has
7337 type "'a::size ==> bool"
7339 * Internal reorganisation of `size' of datatypes: size theorems
7340 "foo.size" are no longer subsumed by "foo.simps" (but are still
7341 simplification rules by default!); theorems "prod.size" now named
7344 * Class "div" now inherits from class "times" rather than "type".
7347 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
7348 Linorder etc. have disappeared; operations defined in terms of
7349 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
7351 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
7353 * HOL-Word: New extensive library and type for generic, fixed size
7354 machine words, with arithmetic, bit-wise, shifting and rotating
7355 operations, reflection into int, nat, and bool lists, automation for
7356 linear arithmetic (by automatic reflection into nat or int), including
7357 lemmas on overflow and monotonicity. Instantiated to all appropriate
7358 arithmetic type classes, supporting automatic simplification of
7359 numerals on all operations.
7361 * Library/Boolean_Algebra: locales for abstract boolean algebras.
7363 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
7365 * Code generator library theories:
7366 - Code_Integer represents HOL integers by big integer literals in target
7368 - Code_Char represents HOL characters by character literals in target
7370 - Code_Char_chr like Code_Char, but also offers treatment of character
7371 codes; includes Code_Integer.
7372 - Executable_Set allows to generate code for finite sets using lists.
7373 - Executable_Rat implements rational numbers as triples (sign, enumerator,
7375 - Executable_Real implements a subset of real numbers, namly those
7376 representable by rational numbers.
7377 - Efficient_Nat implements natural numbers by integers, which in general will
7378 result in higher efficency; pattern matching with 0/Suc is eliminated;
7379 includes Code_Integer.
7380 - Code_Index provides an additional datatype index which is mapped to
7381 target-language built-in integers.
7382 - Code_Message provides an additional datatype message_string which is isomorphic to
7383 strings; messages are mapped to target-language strings.
7385 * New package for inductive predicates
7387 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
7390 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7391 for z_1 :: U_1 and ... and z_n :: U_m
7393 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7396 with full support for type-inference, rather than
7398 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7400 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7401 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7403 inductive "s z_1 ... z_m"
7405 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7408 For backward compatibility, there is a wrapper allowing inductive
7409 sets to be defined with the new package via
7412 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7413 for z_1 :: U_1 and ... and z_n :: U_m
7415 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7421 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7422 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7423 for z_1 :: U_1 and ... and z_n :: U_m
7425 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7426 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7429 if the additional syntax "p ..." is required.
7431 Numerous examples can be found in the subdirectories src/HOL/Auth,
7432 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
7436 - Since declaration and definition of inductive sets or predicates
7437 is no longer separated, abbreviations involving the newly
7438 introduced sets or predicates must be specified together with the
7439 introduction rules after the 'where' keyword (see above), rather
7440 than before the actual inductive definition.
7442 - The variables in induction and elimination rules are now
7443 quantified in the order of their occurrence in the introduction
7444 rules, rather than in alphabetical order. Since this may break
7445 some proofs, these proofs either have to be repaired, e.g. by
7446 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
7447 statements of the form
7449 case (rule_i a_i_1 ... a_i_{k_i})
7451 or the old order of quantification has to be restored by explicitly adding
7452 meta-level quantifiers in the introduction rules, i.e.
7454 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
7456 - The format of the elimination rules is now
7458 p z_1 ... z_m x_1 ... x_n ==>
7459 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7464 (x_1, ..., x_n) : s z_1 ... z_m ==>
7465 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7468 for sets rather than
7470 x : s z_1 ... z_m ==>
7471 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
7474 This may require terms in goals to be expanded to n-tuples
7475 (e.g. using case_tac or simplification with the split_paired_all
7476 rule) before the above elimination rule is applicable.
7478 - The elimination or case analysis rules for (mutually) inductive
7479 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
7480 list of rules "p_1_..._p_k.elims" is no longer available.
7482 * New package "function"/"fun" for general recursive functions,
7483 supporting mutual and nested recursion, definitions in local contexts,
7484 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
7485 for small examples, and the separate tutorial on the function
7486 package. The old recdef "package" is still available as before, but
7487 users are encouraged to use the new package.
7489 * Method "lexicographic_order" automatically synthesizes termination
7490 relations as lexicographic combinations of size measures.
7492 * Case-expressions allow arbitrary constructor-patterns (including
7493 "_") and take their order into account, like in functional
7494 programming. Internally, this is translated into nested
7495 case-expressions; missing cases are added and mapped to the predefined
7496 constant "undefined". In complicated cases printing may no longer show
7497 the original input but the internal form. Lambda-abstractions allow
7498 the same form of pattern matching: "% pat1 => e1 | ..." is an
7499 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
7502 * IntDef: The constant "int :: nat => int" has been removed; now "int"
7503 is an abbreviation for "of_nat :: nat => int". The simplification
7504 rules for "of_nat" have been changed to work like "int" did
7505 previously. Potential INCOMPATIBILITY:
7506 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
7507 - of_nat_diff and of_nat_mult are no longer default simp rules
7509 * Method "algebra" solves polynomial equations over (semi)rings using
7510 Groebner bases. The (semi)ring structure is defined by locales and the
7511 tool setup depends on that generic context. Installing the method for
7512 a specific type involves instantiating the locale and possibly adding
7513 declarations for computation on the coefficients. The method is
7514 already instantiated for natural numbers and for the axiomatic class
7515 of idoms with numerals. See also the paper by Chaieb and Wenzel at
7516 CALCULEMUS 2007 for the general principles underlying this
7517 architecture of context-aware proof-tools.
7519 * Method "ferrack" implements quantifier elimination over
7520 special-purpose dense linear orders using locales (analogous to
7521 "algebra"). The method is already installed for class
7522 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
7525 * Former constant "List.op @" now named "List.append". Use ML
7526 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
7527 circumvent possible incompatibilities when working on ML level.
7529 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
7531 * New function listsum :: 'a list => 'a for arbitrary monoids.
7532 Special syntax: "SUM x <- xs. f x" (and latex variants)
7534 * New syntax for Haskell-like list comprehension (input only), eg.
7535 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
7537 * The special syntax for function "filter" has changed from [x :
7538 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
7539 comprehension syntax, and for uniformity. INCOMPATIBILITY.
7541 * [a..b] is now defined for arbitrary linear orders. It used to be
7542 defined on nat only, as an abbreviation for [a..<Suc b]
7545 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
7547 * New functions "sorted" and "sort" in src/HOL/List.thy.
7549 * New lemma collection field_simps (an extension of ring_simps) for
7550 manipulating (in)equations involving division. Multiplies with all
7551 denominators that can be proved to be non-zero (in equations) or
7552 positive/negative (in inequations).
7554 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
7555 have been improved and renamed to ring_simps, group_simps and
7556 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
7557 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
7559 * Theory Library/Commutative_Ring: switched from recdef to function
7560 package; constants add, mul, pow now curried. Infix syntax for
7561 algebraic operations.
7563 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
7566 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
7569 * HOL/records: generalised field-update to take a function on the
7570 field rather than the new value: r(|A := x|) is translated to A_update
7571 (K x) r The K-combinator that is internally used is called K_record.
7572 INCOMPATIBILITY: Usage of the plain update functions has to be
7575 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
7576 * x = 0, which are required for a semiring. Richer structures do not
7577 inherit from semiring_0 anymore, because this property is a theorem
7578 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
7579 there is more to prove, but this is mostly trivial.
7581 * Class "recpower" is generalized to arbitrary monoids, not just
7582 commutative semirings. INCOMPATIBILITY: may need to incorporate
7583 commutativity or semiring properties additionally.
7585 * Constant "List.list_all2" in List.thy now uses authentic syntax.
7586 INCOMPATIBILITY: translations containing list_all2 may go wrong,
7587 better use 'abbreviation'.
7589 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
7591 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
7592 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
7593 significant changes for setting up numeral syntax for types:
7594 - New constants Numeral.pred and Numeral.succ instead
7595 of former Numeral.bin_pred and Numeral.bin_succ.
7596 - Use integer operations instead of bin_add, bin_mult and so on.
7597 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
7598 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
7600 See src/HOL/Integ/IntArith.thy for an example setup.
7602 * Command 'normal_form' computes the normal form of a term that may
7603 contain free variables. For example ``normal_form "rev [a, b, c]"''
7604 produces ``[b, c, a]'' (without proof). This command is suitable for
7605 heavy-duty computations because the functions are compiled to ML
7606 first. Correspondingly, a method "normalization" is provided. See
7607 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
7609 * Alternative iff syntax "A <-> B" for equality on bool (with priority
7610 25 like -->); output depends on the "iff" print_mode, the default is
7611 "A = B" (with priority 50).
7613 * Relations less (<) and less_eq (<=) are also available on type bool.
7614 Modified syntax to disallow nesting without explicit parentheses,
7615 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
7618 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
7620 * Relation composition operator "op O" now has precedence 75 and binds
7621 stronger than union and intersection. INCOMPATIBILITY.
7623 * The old set interval syntax "{m..n(}" (and relatives) has been
7624 removed. Use "{m..<n}" (and relatives) instead.
7626 * In the context of the assumption "~(s = t)" the Simplifier rewrites
7627 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
7628 ``declare [[simproc del: neq]]''.
7630 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
7633 * Theorem Cons_eq_map_conv no longer declared as "simp".
7635 * Theorem setsum_mult renamed to setsum_right_distrib.
7637 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
7640 * Reimplemented methods "sat" and "satx", with several improvements:
7641 goals no longer need to be stated as "<prems> ==> False", equivalences
7642 (i.e. "=" on type bool) are handled, variable names of the form
7643 "lit_<n>" are no longer reserved, significant speedup.
7645 * Methods "sat" and "satx" can now replay MiniSat proof traces.
7646 zChaff is still supported as well.
7648 * 'inductive' and 'datatype': provide projections of mutual rules,
7649 bundled as foo_bar.inducts;
7651 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
7654 * Library: moved theory Accessible_Part to main HOL.
7656 * Library: added theory Coinductive_List of potentially infinite lists
7657 as greatest fixed-point.
7659 * Library: added theory AssocList which implements (finite) maps as
7662 * Method "evaluation" solves goals (i.e. a boolean expression)
7663 efficiently by compiling it to ML. The goal is "proved" (via an
7664 oracle) if it evaluates to True.
7666 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
7667 also when invoked by the simplifier. This results in the Simplifier
7668 being more powerful on arithmetic goals. INCOMPATIBILITY.
7669 Configuration option fast_arith_split_limit=0 recovers the old
7672 * Support for hex (0x20) and binary (0b1001) numerals.
7674 * New method: reify eqs (t), where eqs are equations for an
7675 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
7676 parameter, computes a term s::'b and a list xs::'a list and proves the
7677 theorem I xs s = t. This is also known as reification or quoting. The
7678 resulting theorem is applied to the subgoal to substitute t with I xs
7679 s. If t is omitted, the subgoal itself is reified.
7681 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
7682 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
7683 where f is supposed to be a computable function (in the sense of code
7684 generattion). The method uses reify to compute s and xs as above then
7685 applies corr_thm and uses normalization by evaluation to "prove" f s =
7686 r and finally gets the theorem t = r, which is again applied to the
7687 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
7689 * Reflection: Automatic reification now handels binding, an example is
7690 available in src/HOL/ex/ReflectionEx.thy
7692 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
7693 command 'statespace' that is similar to 'record', but introduces an
7694 abstract specification based on the locale infrastructure instead of
7695 HOL types. This leads to extra flexibility in composing state spaces,
7696 in particular multiple inheritance and renaming of components.
7701 * Hyperreal: Functions root and sqrt are now defined on negative real
7702 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
7703 Nonnegativity side conditions have been removed from many lemmas, so
7704 that more subgoals may now be solved by simplification; potential
7707 * Real: new type classes formalize real normed vector spaces and
7708 algebras, using new overloaded constants scaleR :: real => 'a => 'a
7709 and norm :: 'a => real.
7711 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
7712 reals into other types. The overloaded constant Reals :: 'a set is now
7713 defined as range of_real; potential INCOMPATIBILITY.
7715 * Real: proper support for ML code generation, including 'quickcheck'.
7716 Reals are implemented as arbitrary precision rationals.
7718 * Hyperreal: Several constants that previously worked only for the
7719 reals have been generalized, so they now work over arbitrary vector
7720 spaces. Type annotations may need to be added in some cases; potential
7723 Infinitesimal :: ('a::real_normed_vector) star set
7724 HFinite :: ('a::real_normed_vector) star set
7725 HInfinite :: ('a::real_normed_vector) star set
7726 approx :: ('a::real_normed_vector) star => 'a star => bool
7727 monad :: ('a::real_normed_vector) star => 'a star set
7728 galaxy :: ('a::real_normed_vector) star => 'a star set
7729 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
7730 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
7731 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
7732 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
7733 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
7734 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
7735 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
7736 sgn :: 'a::real_normed_vector => 'a
7737 exp :: 'a::{recpower,real_normed_field,banach} => 'a
7739 * Complex: Some complex-specific constants are now abbreviations for
7740 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
7741 hnorm. Other constants have been entirely removed in favor of the
7742 polymorphic versions (INCOMPATIBILITY):
7746 HInfinite <-- CInfinite
7747 Infinitesimal <-- CInfinitesimal
7750 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
7751 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
7752 (ns)deriv <-- (ns)cderiv
7757 * Formalisation of ideals and the quotient construction over rings.
7759 * Order and lattice theory no longer based on records.
7762 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
7763 greatest_closed. INCOMPATIBILITY.
7765 * Method algebra is now set up via an attribute. For examples see
7766 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
7767 of algebraic structures.
7769 * Renamed theory CRing to Ring.
7774 * Substantial, yet incomplete support for nominal datatypes (binding
7775 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
7776 src/HOL/Nominal/Examples. Prospective users should consult
7777 http://isabelle.in.tum.de/nominal/
7782 * ML basics: just one true type int, which coincides with IntInf.int
7785 * ML within Isar: antiquotations allow to embed statically-checked
7786 formal entities in the source, referring to the context available at
7787 compile-time. For example:
7789 ML {* @{sort "{zero,one}"} *}
7790 ML {* @{typ "'a => 'b"} *}
7791 ML {* @{term "%x. x"} *}
7792 ML {* @{prop "x == y"} *}
7793 ML {* @{ctyp "'a => 'b"} *}
7794 ML {* @{cterm "%x. x"} *}
7795 ML {* @{cprop "x == y"} *}
7796 ML {* @{thm asm_rl} *}
7797 ML {* @{thms asm_rl} *}
7798 ML {* @{type_name c} *}
7799 ML {* @{type_syntax c} *}
7800 ML {* @{const_name c} *}
7801 ML {* @{const_syntax c} *}
7804 ML {* @{theory Pure} *}
7805 ML {* @{theory_ref} *}
7806 ML {* @{theory_ref Pure} *}
7809 ML {* @{clasimpset} *}
7811 The same works for sources being ``used'' within an Isar context.
7813 * ML in Isar: improved error reporting; extra verbosity with
7814 ML_Context.trace enabled.
7816 * Pure/General/table.ML: the join operations now works via exceptions
7817 DUP/SAME instead of type option. This is simpler in simple cases, and
7818 admits slightly more efficient complex applications.
7820 * Pure: 'advanced' translation functions (parse_translation etc.) now
7821 use Context.generic instead of just theory.
7823 * Pure: datatype Context.generic joins theory/Proof.context and
7824 provides some facilities for code that works in either kind of
7825 context, notably GenericDataFun for uniform theory and proof data.
7827 * Pure: simplified internal attribute type, which is now always
7828 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
7829 local (Proof.context) attributes have been discontinued, while
7830 minimizing code duplication. Thm.rule_attribute and
7831 Thm.declaration_attribute build canonical attributes; see also structure
7832 Context for further operations on Context.generic, notably
7833 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
7834 declarations and definitions.
7836 * Context data interfaces (Theory/Proof/GenericDataFun): removed
7837 name/print, uninitialized data defaults to ad-hoc copy of empty value,
7838 init only required for impure data. INCOMPATIBILITY: empty really need
7839 to be empty (no dependencies on theory content!)
7841 * Pure/kernel: consts certification ignores sort constraints given in
7842 signature declarations. (This information is not relevant to the
7843 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
7844 potential INCOMPATIBILITY.
7846 * Pure: axiomatic type classes are now purely definitional, with
7847 explicit proofs of class axioms and super class relations performed
7848 internally. See Pure/axclass.ML for the main internal interfaces --
7849 notably AxClass.define_class supercedes AxClass.add_axclass, and
7850 AxClass.axiomatize_class/classrel/arity supersede
7851 Sign.add_classes/classrel/arities.
7853 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
7854 global/local versions on theory vs. Proof.context have been
7855 discontinued; Attrib.syntax and Method.syntax have been adapted
7856 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
7857 attributes, methods, etc.
7859 * Pure: several functions of signature "... -> theory -> theory * ..."
7860 have been reoriented to "... -> theory -> ... * theory" in order to
7861 allow natural usage in combination with the ||>, ||>>, |-> and
7862 fold_map combinators.
7864 * Pure: official theorem names (closed derivations) and additional
7865 comments (tags) are now strictly separate. Name hints -- which are
7866 maintained as tags -- may be attached any time without affecting the
7869 * Pure: primitive rule lift_rule now takes goal cterm instead of an
7870 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
7871 achieve the old behaviour.
7873 * Pure: the "Goal" constant is now called "prop", supporting a
7874 slightly more general idea of ``protecting'' meta-level rule
7877 * Pure: Logic.(un)varify only works in a global context, which is now
7878 enforced instead of silently assumed. INCOMPATIBILITY, may use
7879 Logic.legacy_(un)varify as temporary workaround.
7881 * Pure: structure Name provides scalable operations for generating
7882 internal variable names, notably Name.variants etc. This replaces
7883 some popular functions from term.ML:
7885 Term.variant -> Name.variant
7886 Term.variantlist -> Name.variant_list
7887 Term.invent_names -> Name.invent_list
7889 Note that low-level renaming rarely occurs in new code -- operations
7890 from structure Variable are used instead (see below).
7892 * Pure: structure Variable provides fundamental operations for proper
7893 treatment of fixed/schematic variables in a context. For example,
7894 Variable.import introduces fixes for schematics of given facts and
7895 Variable.export reverses the effect (up to renaming) -- this replaces
7896 various freeze_thaw operations.
7898 * Pure: structure Goal provides simple interfaces for
7899 init/conclude/finish and tactical prove operations (replacing former
7900 Tactic.prove). Goal.prove is the canonical way to prove results
7901 within a given context; Goal.prove_global is a degraded version for
7902 theory level goals, including a global Drule.standard. Note that
7903 OldGoals.prove_goalw_cterm has long been obsolete, since it is
7904 ill-behaved in a local proof context (e.g. with local fixes/assumes or
7905 in a locale context).
7907 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
7908 and type checking (Syntax.check_term etc.), with common combinations
7909 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
7910 which are considered legacy and await removal.
7912 * Pure/Syntax: generic interfaces for type unchecking
7913 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
7914 with common combinations (Syntax.pretty_term, Syntax.string_of_term
7915 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
7916 available for convenience, but refer to the very same operations using
7917 a mere theory instead of a full context.
7919 * Isar: simplified treatment of user-level errors, using exception
7920 ERROR of string uniformly. Function error now merely raises ERROR,
7921 without any side effect on output channels. The Isar toplevel takes
7922 care of proper display of ERROR exceptions. ML code may use plain
7923 handle/can/try; cat_error may be used to concatenate errors like this:
7925 ... handle ERROR msg => cat_error msg "..."
7927 Toplevel ML code (run directly or through the Isar toplevel) may be
7928 embedded into the Isar toplevel with exception display/debug like
7931 Isar.toplevel (fn () => ...)
7933 INCOMPATIBILITY, removed special transform_error facilities, removed
7934 obsolete variants of user-level exceptions (ERROR_MESSAGE,
7935 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
7936 -- use plain ERROR instead.
7938 * Isar: theory setup now has type (theory -> theory), instead of a
7939 list. INCOMPATIBILITY, may use #> to compose setup functions.
7941 * Isar: ML toplevel pretty printer for type Proof.context, subject to
7942 ProofContext.debug/verbose flags.
7944 * Isar: Toplevel.theory_to_proof admits transactions that modify the
7945 theory before entering a proof state. Transactions now always see a
7946 quasi-functional intermediate checkpoint, both in interactive and
7949 * Isar: simplified interfaces for outer syntax. Renamed
7950 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
7951 OuterSyntax.add_parsers -- this functionality is now included in
7952 OuterSyntax.command etc. INCOMPATIBILITY.
7954 * Simplifier: the simpset of a running simplification process now
7955 contains a proof context (cf. Simplifier.the_context), which is the
7956 very context that the initial simpset has been retrieved from (by
7957 simpset_of/local_simpset_of). Consequently, all plug-in components
7958 (solver, looper etc.) may depend on arbitrary proof data.
7960 * Simplifier.inherit_context inherits the proof context (plus the
7961 local bounds) of the current simplification process; any simproc
7962 etc. that calls the Simplifier recursively should do this! Removed
7963 former Simplifier.inherit_bounds, which is already included here --
7964 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
7965 specify an explicit context using Simplifier.context/theory_context.
7967 * Simplifier/Classical Reasoner: more abstract interfaces
7968 change_simpset/claset for modifying the simpset/claset reference of a
7969 theory; raw versions simpset/claset_ref etc. have been discontinued --
7972 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
7978 * settings: the default heap location within ISABELLE_HOME_USER now
7979 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
7980 Isabelle installations.
7982 * isabelle-process: option -S (secure mode) disables some critical
7983 operations, notably runtime compilation and evaluation of ML source
7986 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
7988 * Support for parallel execution, using native multicore support of
7989 Poly/ML 5.1. The theory loader exploits parallelism when processing
7990 independent theories, according to the given theory header
7991 specifications. The maximum number of worker threads is specified via
7992 usedir option -M or the "max-threads" setting in Proof General. A
7993 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
7994 to 6 on a 8-core machine. User-code needs to observe certain
7995 guidelines for thread-safe programming, see appendix A in the Isar
7996 Implementation manual.
8000 New in Isabelle2005 (October 2005)
8001 ----------------------------------
8005 * Theory headers: the new header syntax for Isar theories is
8008 imports <theory1> ... <theoryN>
8009 uses <file1> ... <fileM>
8012 where the 'uses' part is optional. The previous syntax
8014 theory <name> = <theory1> + ... + <theoryN>:
8016 will disappear in the next release. Use isatool fixheaders to convert
8017 existing theory files. Note that there is no change in ancient
8018 non-Isar theories now, but these will disappear soon.
8020 * Theory loader: parent theories can now also be referred to via
8021 relative and absolute paths.
8023 * Command 'find_theorems' searches for a list of criteria instead of a
8024 list of constants. Known criteria are: intro, elim, dest, name:string,
8025 simp:term, and any term. Criteria can be preceded by '-' to select
8026 theorems that do not match. Intro, elim, dest select theorems that
8027 match the current goal, name:s selects theorems whose fully qualified
8028 name contain s, and simp:term selects all simplification rules whose
8029 lhs match term. Any other term is interpreted as pattern and selects
8030 all theorems matching the pattern. Available in ProofGeneral under
8031 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
8033 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
8035 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
8036 matching the current goal as introduction rule and not having "HOL."
8037 in their name (i.e. not being defined in theory HOL).
8039 * Command 'thms_containing' has been discontinued in favour of
8040 'find_theorems'; INCOMPATIBILITY.
8042 * Communication with Proof General is now 8bit clean, which means that
8043 Unicode text in UTF-8 encoding may be used within theory texts (both
8044 formal and informal parts). Cf. option -U of the Isabelle Proof
8045 General interface. Here are some simple examples (cf. src/HOL/ex):
8047 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
8048 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
8050 * Improved efficiency of the Simplifier and, to a lesser degree, the
8051 Classical Reasoner. Typical big applications run around 2 times
8055 *** Document preparation ***
8057 * Commands 'display_drafts' and 'print_drafts' perform simple output
8058 of raw sources. Only those symbols that do not require additional
8059 LaTeX packages (depending on comments in isabellesym.sty) are
8060 displayed properly, everything else is left verbatim. isatool display
8061 and isatool print are used as front ends (these are subject to the
8062 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
8064 * Command tags control specific markup of certain regions of text,
8065 notably folding and hiding. Predefined tags include "theory" (for
8066 theory begin and end), "proof" for proof commands, and "ML" for
8067 commands involving ML code; the additional tags "visible" and
8068 "invisible" are unused by default. Users may give explicit tag
8069 specifications in the text, e.g. ''by %invisible (auto)''. The
8070 interpretation of tags is determined by the LaTeX job during document
8071 preparation: see option -V of isatool usedir, or options -n and -t of
8072 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
8075 Several document versions may be produced at the same time via isatool
8076 usedir (the generated index.html will link all of them). Typical
8077 specifications include ''-V document=theory,proof,ML'' to present
8078 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
8079 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
8080 these parts without any formal replacement text. The Isabelle site
8081 default settings produce ''document'' and ''outline'' versions as
8084 * Several new antiquotations:
8086 @{term_type term} prints a term with its type annotated;
8088 @{typeof term} prints the type of a term;
8090 @{const const} is the same as @{term const}, but checks that the
8091 argument is a known logical constant;
8093 @{term_style style term} and @{thm_style style thm} print a term or
8094 theorem applying a "style" to it
8098 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
8099 definitions, equations, inequations etc., 'concl' printing only the
8100 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
8101 to print the specified premise. TermStyle.add_style provides an ML
8102 interface for introducing further styles. See also the "LaTeX Sugar"
8103 document practical applications. The ML antiquotation prints
8104 type-checked ML expressions verbatim.
8106 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
8107 and 'text' support optional locale specification '(in loc)', which
8108 specifies the default context for interpreting antiquotations. For
8109 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
8111 * Option 'locale=NAME' of antiquotations specifies an alternative
8112 context interpreting the subsequent argument. For example: @{thm
8113 [locale=lattice] inf_assoc}.
8115 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
8118 * Proper output of antiquotations for theory commands involving a
8119 proof context (such as 'locale' or 'theorem (in loc) ...').
8121 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
8122 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
8124 * isatool usedir: new option -C (default true) controls whether option
8125 -D should include a copy of the original document directory; -C false
8126 prevents unwanted effects such as copying of administrative CVS data.
8131 * Considerably improved version of 'constdefs' command. Now performs
8132 automatic type-inference of declared constants; additional support for
8133 local structure declarations (cf. locales and HOL records), see also
8134 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
8135 sequential dependencies of definitions within a single 'constdefs'
8136 section; moreover, the declared name needs to be an identifier. If
8137 all fails, consider to fall back on 'consts' and 'defs' separately.
8139 * Improved indexed syntax and implicit structures. First of all,
8140 indexed syntax provides a notational device for subscripted
8141 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
8142 expressions. Secondly, in a local context with structure
8143 declarations, number indexes \<^sub>n or the empty index (default
8144 number 1) refer to a certain fixed variable implicitly; option
8145 show_structs controls printing of implicit structures. Typical
8146 applications of these concepts involve record types and locales.
8148 * New command 'no_syntax' removes grammar declarations (and
8149 translations) resulting from the given syntax specification, which is
8150 interpreted in the same manner as for the 'syntax' command.
8152 * 'Advanced' translation functions (parse_translation etc.) may depend
8153 on the signature of the theory context being presently used for
8154 parsing/printing, see also isar-ref manual.
8156 * Improved 'oracle' command provides a type-safe interface to turn an
8157 ML expression of type theory -> T -> term into a primitive rule of
8158 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
8159 is already included here); see also FOL/ex/IffExample.thy;
8162 * axclass: name space prefix for class "c" is now "c_class" (was "c"
8163 before); "cI" is no longer bound, use "c.intro" instead.
8164 INCOMPATIBILITY. This change avoids clashes of fact bindings for
8165 axclasses vs. locales.
8167 * Improved internal renaming of symbolic identifiers -- attach primes
8168 instead of base 26 numbers.
8170 * New flag show_question_marks controls printing of leading question
8171 marks in schematic variable names.
8173 * In schematic variable names, *any* symbol following \<^isub> or
8174 \<^isup> is now treated as part of the base name. For example, the
8175 following works without printing of awkward ".0" indexes:
8177 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
8180 * Inner syntax includes (*(*nested*) comments*).
8182 * Pretty printer now supports unbreakable blocks, specified in mixfix
8183 annotations as "(00...)".
8185 * Clear separation of logical types and nonterminals, where the latter
8186 may only occur in 'syntax' specifications or type abbreviations.
8187 Before that distinction was only partially implemented via type class
8188 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
8189 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
8190 exotic syntax specifications may require further adaption
8191 (e.g. Cube/Cube.thy).
8193 * Removed obsolete type class "logic", use the top sort {} instead.
8194 Note that non-logical types should be declared as 'nonterminals'
8195 rather than 'types'. INCOMPATIBILITY for new object-logic
8198 * Attributes 'induct' and 'cases': type or set names may now be
8199 locally fixed variables as well.
8201 * Simplifier: can now control the depth to which conditional rewriting
8202 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
8205 * Simplifier: simplification procedures may now take the current
8206 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
8207 interface), which is very useful for calling the Simplifier
8208 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
8209 is gone -- use prems_of_ss on the simpset instead. Moreover, the
8210 low-level mk_simproc no longer applies Logic.varify internally, to
8211 allow for use in a context of fixed variables.
8213 * thin_tac now works even if the assumption being deleted contains !!
8214 or ==>. More generally, erule now works even if the major premise of
8215 the elimination rule contains !! or ==>.
8217 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
8219 * Reorganized bootstrapping of the Pure theories; CPure is now derived
8220 from Pure, which contains all common declarations already. Both
8221 theories are defined via plain Isabelle/Isar .thy files.
8222 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
8223 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
8224 use isatool fixcpure to adapt your theory and ML sources.
8226 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
8227 selections of theorems in named facts via index ranges.
8229 * 'print_theorems': in theory mode, really print the difference
8230 wrt. the last state (works for interactive theory development only),
8231 in proof mode print all local facts (cf. 'print_facts');
8233 * 'hide': option '(open)' hides only base names.
8235 * More efficient treatment of intermediate checkpoints in interactive
8238 * Code generator is now invoked via code_module (incremental code
8239 generation) and code_library (modular code generation, ML structures
8240 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
8241 must be quoted when used as identifiers.
8243 * New 'value' command for reading, evaluating and printing terms using
8244 the code generator. INCOMPATIBILITY: command keyword 'value' must be
8245 quoted when used as identifier.
8250 * New commands for the interpretation of locale expressions in
8251 theories (1), locales (2) and proof contexts (3). These generate
8252 proof obligations from the expression specification. After the
8253 obligations have been discharged, theorems of the expression are added
8254 to the theory, target locale or proof context. The synopsis of the
8255 commands is a follows:
8257 (1) interpretation expr inst
8258 (2) interpretation target < expr
8259 (3) interpret expr inst
8261 Interpretation in theories and proof contexts require a parameter
8262 instantiation of terms from the current context. This is applied to
8263 specifications and theorems of the interpreted expression.
8264 Interpretation in locales only permits parameter renaming through the
8265 locale expression. Interpretation is smart in that interpretations
8266 that are active already do not occur in proof obligations, neither are
8267 instantiated theorems stored in duplicate. Use 'print_interps' to
8268 inspect active interpretations of a particular locale. For details,
8269 see the Isar Reference manual. Examples can be found in
8270 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
8272 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
8273 'interpret' instead.
8275 * New context element 'constrains' for adding type constraints to
8278 * Context expressions: renaming of parameters with syntax
8281 * Locale declaration: 'includes' disallowed.
8283 * Proper static binding of attribute syntax -- i.e. types / terms /
8284 facts mentioned as arguments are always those of the locale definition
8285 context, independently of the context of later invocations. Moreover,
8286 locale operations (renaming and type / term instantiation) are applied
8287 to attribute arguments as expected.
8289 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
8290 actual attributes; rare situations may require Attrib.attribute to
8291 embed those attributes into Attrib.src that lack concrete syntax.
8292 Attribute implementations need to cooperate properly with the static
8293 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
8294 Attrib.XXX_thm etc. already do the right thing without further
8295 intervention. Only unusual applications -- such as "where" or "of"
8296 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
8297 on the context and the facts involved -- may have to assign parsed
8298 values to argument tokens explicitly.
8300 * Changed parameter management in theorem generation for long goal
8301 statements with 'includes'. INCOMPATIBILITY: produces a different
8302 theorem statement in rare situations.
8304 * Locale inspection command 'print_locale' omits notes elements. Use
8305 'print_locale!' to have them included in the output.
8310 * Provers/hypsubst.ML: improved version of the subst method, for
8311 single-step rewriting: it now works in bound variable contexts. New is
8312 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
8313 rewrite a different subterm than the original subst method, which is
8314 still available as 'simplesubst'.
8316 * Provers/quasi.ML: new transitivity reasoners for transitivity only
8319 * Provers/trancl.ML: new transitivity reasoner for transitive and
8320 reflexive-transitive closure of relations.
8322 * Provers/blast.ML: new reference depth_limit to make blast's depth
8323 limit (previously hard-coded with a value of 20) user-definable.
8325 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
8326 is peformed already. Object-logics merely need to finish their
8327 initial simpset configuration as before. INCOMPATIBILITY.
8332 * Symbolic syntax of Hilbert Choice Operator is now as follows:
8335 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
8337 The symbol \<some> is displayed as the alternative epsilon of LaTeX
8338 and x-symbol; use option '-m epsilon' to get it actually printed.
8339 Moreover, the mathematically important symbolic identifier \<epsilon>
8340 becomes available as variable, constant etc. INCOMPATIBILITY,
8342 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
8343 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
8344 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
8345 support corresponding Isar calculations.
8347 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
8350 * theory SetInterval: changed the syntax for open intervals:
8359 The old syntax is still supported but will disappear in the next
8360 release. For conversion use the following Emacs search and replace
8361 patterns (these are not perfect but work quite well):
8363 {)\([^\.]*\)\.\. -> {\1<\.\.}
8364 \.\.\([^(}]*\)(} -> \.\.<\1}
8366 * Theory Commutative_Ring (in Library): method comm_ring for proving
8367 equalities in commutative rings; method 'algebra' provides a generic
8370 * Theory Finite_Set: changed the syntax for 'setsum', summation over
8371 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
8372 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
8375 Some new syntax forms are available:
8377 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
8378 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
8379 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
8380 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
8382 The latter form "\<Sum>x < k. e" used to be based on a separate
8383 function "Summation", which has been discontinued.
8385 * theory Finite_Set: in structured induction proofs, the insert case
8386 is now 'case (insert x F)' instead of the old counterintuitive 'case
8389 * The 'refute' command has been extended to support a much larger
8390 fragment of HOL, including axiomatic type classes, constdefs and
8391 typedefs, inductive datatypes and recursion.
8393 * New tactics 'sat' and 'satx' to prove propositional tautologies.
8394 Requires zChaff with proof generation to be installed. See
8395 HOL/ex/SAT_Examples.thy for examples.
8397 * Datatype induction via method 'induct' now preserves the name of the
8398 induction variable. For example, when proving P(xs::'a list) by
8399 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
8400 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
8401 in unstructured proof scripts.
8403 * Reworked implementation of records. Improved scalability for
8404 records with many fields, avoiding performance problems for type
8405 inference. Records are no longer composed of nested field types, but
8406 of nested extension types. Therefore the record type only grows linear
8407 in the number of extensions and not in the number of fields. The
8408 top-level (users) view on records is preserved. Potential
8409 INCOMPATIBILITY only in strange cases, where the theory depends on the
8410 old record representation. The type generated for a record is called
8411 <record_name>_ext_type.
8413 Flag record_quick_and_dirty_sensitive can be enabled to skip the
8414 proofs triggered by a record definition or a simproc (if
8415 quick_and_dirty is enabled). Definitions of large records can take
8418 New simproc record_upd_simproc for simplification of multiple record
8419 updates enabled by default. Moreover, trivial updates are also
8420 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
8421 occasionally, since simplification is more powerful by default.
8423 * typedef: proper support for polymorphic sets, which contain extra
8424 type-variables in the term.
8426 * Simplifier: automatically reasons about transitivity chains
8427 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
8428 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
8429 old proofs break occasionally as simplification may now solve more
8430 goals than previously.
8432 * Simplifier: converts x <= y into x = y if assumption y <= x is
8433 present. Works for all partial orders (class "order"), in particular
8434 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
8437 * Simplifier: new simproc for "let x = a in f x". If a is a free or
8438 bound variable or a constant then the let is unfolded. Otherwise
8439 first a is simplified to b, and then f b is simplified to g. If
8440 possible we abstract b from g arriving at "let x = b in h x",
8441 otherwise we unfold the let and arrive at g. The simproc can be
8442 enabled/disabled by the reference use_let_simproc. Potential
8443 INCOMPATIBILITY since simplification is more powerful by default.
8445 * Classical reasoning: the meson method now accepts theorems as arguments.
8447 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
8448 jobs to provide advice on the provability of subgoals.
8450 * Theory OrderedGroup and Ring_and_Field: various additions and
8451 improvements to faciliate calculations involving equalities and
8454 The following theorems have been eliminated or modified
8457 abs_eq now named abs_of_nonneg
8458 abs_of_ge_0 now named abs_of_nonneg
8459 abs_minus_eq now named abs_of_nonpos
8460 imp_abs_id now named abs_of_nonneg
8461 imp_abs_neg_id now named abs_of_nonpos
8462 mult_pos now named mult_pos_pos
8463 mult_pos_le now named mult_nonneg_nonneg
8464 mult_pos_neg_le now named mult_nonneg_nonpos
8465 mult_pos_neg2_le now named mult_nonneg_nonpos2
8466 mult_neg now named mult_neg_neg
8467 mult_neg_le now named mult_nonpos_nonpos
8469 * The following lemmas in Ring_and_Field have been added to the simplifier:
8472 not_square_less_zero
8474 The following lemmas have been deleted from Real/RealPow:
8484 * Theory Parity: added rules for simplifying exponents.
8488 The following theorems have been eliminated or modified
8491 list_all_Nil now named list_all.simps(1)
8492 list_all_Cons now named list_all.simps(2)
8493 list_all_conv now named list_all_iff
8494 set_mem_eq now named mem_iff
8496 * Theories SetsAndFunctions and BigO (see HOL/Library) support
8497 asymptotic "big O" calculations. See the notes in BigO.thy.
8502 * Theory RealDef: better support for embedding natural numbers and
8503 integers in the reals.
8505 The following theorems have been eliminated or modified
8508 exp_ge_add_one_self now requires no hypotheses
8509 real_of_int_add reversed direction of equality (use [symmetric])
8510 real_of_int_minus reversed direction of equality (use [symmetric])
8511 real_of_int_diff reversed direction of equality (use [symmetric])
8512 real_of_int_mult reversed direction of equality (use [symmetric])
8514 * Theory RComplete: expanded support for floor and ceiling functions.
8516 * Theory Ln is new, with properties of the natural logarithm
8518 * Hyperreal: There is a new type constructor "star" for making
8519 nonstandard types. The old type names are now type synonyms:
8523 hcomplex = complex star
8525 * Hyperreal: Many groups of similarly-defined constants have been
8526 replaced by polymorphic versions (INCOMPATIBILITY):
8528 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
8530 starset <-- starsetNat, starsetC
8531 *s* <-- *sNat*, *sc*
8532 starset_n <-- starsetNat_n, starsetC_n
8533 *sn* <-- *sNatn*, *scn*
8534 InternalSets <-- InternalNatSets, InternalCSets
8536 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8537 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
8538 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
8539 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
8540 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
8542 * Hyperreal: Many type-specific theorems have been removed in favor of
8543 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
8545 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
8546 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
8547 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
8548 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
8549 right_minus <-- hypreal_add_minus
8550 left_minus <-- {hypreal,hcomplex}_add_minus_left
8551 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
8552 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
8553 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
8554 mult_1_right <-- hcomplex_mult_one_right
8555 mult_zero_left <-- hcomplex_mult_zero_left
8556 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
8557 right_distrib <-- hypnat_add_mult_distrib2
8558 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
8559 right_inverse <-- hypreal_mult_inverse
8560 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
8561 order_refl <-- {hypreal,hypnat}_le_refl
8562 order_trans <-- {hypreal,hypnat}_le_trans
8563 order_antisym <-- {hypreal,hypnat}_le_anti_sym
8564 order_less_le <-- {hypreal,hypnat}_less_le
8565 linorder_linear <-- {hypreal,hypnat}_le_linear
8566 add_left_mono <-- {hypreal,hypnat}_add_left_mono
8567 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
8568 add_nonneg_nonneg <-- hypreal_le_add_order
8570 * Hyperreal: Separate theorems having to do with type-specific
8571 versions of constants have been merged into theorems that apply to the
8572 new polymorphic constants (INCOMPATIBILITY):
8574 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
8575 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
8576 STAR_Un <-- {STAR,NatStar,STARC}_Un
8577 STAR_Int <-- {STAR,NatStar,STARC}_Int
8578 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
8579 STAR_subset <-- {STAR,NatStar,STARC}_subset
8580 STAR_mem <-- {STAR,NatStar,STARC}_mem
8581 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
8582 STAR_diff <-- {STAR,STARC}_diff
8583 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
8584 STARC_hcomplex_of_complex}_image_subset
8585 starset_n_Un <-- starset{Nat,C}_n_Un
8586 starset_n_Int <-- starset{Nat,C}_n_Int
8587 starset_n_Compl <-- starset{Nat,C}_n_Compl
8588 starset_n_diff <-- starset{Nat,C}_n_diff
8589 InternalSets_Un <-- Internal{Nat,C}Sets_Un
8590 InternalSets_Int <-- Internal{Nat,C}Sets_Int
8591 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
8592 InternalSets_diff <-- Internal{Nat,C}Sets_diff
8593 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
8594 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
8595 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
8596 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
8597 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
8598 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8599 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
8600 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
8601 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
8602 starfun_diff <-- starfun{C,RC,CR}_diff
8603 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
8604 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
8605 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
8606 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
8607 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
8608 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
8609 starfun_Id <-- starfunC_Id
8610 starfun_approx <-- starfun{Nat,CR}_approx
8611 starfun_capprox <-- starfun{C,RC}_capprox
8612 starfun_abs <-- starfunNat_rabs
8613 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
8614 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
8615 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
8616 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
8617 starfun_add_capprox <-- starfun{C,RC}_add_capprox
8618 starfun_add_approx <-- starfunCR_add_approx
8619 starfun_inverse_inverse <-- starfunC_inverse_inverse
8620 starfun_divide <-- starfun{C,CR,RC}_divide
8621 starfun_n <-- starfun{Nat,C}_n
8622 starfun_n_mult <-- starfun{Nat,C}_n_mult
8623 starfun_n_add <-- starfun{Nat,C}_n_add
8624 starfun_n_add_minus <-- starfunNat_n_add_minus
8625 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
8626 starfun_n_minus <-- starfun{Nat,C}_n_minus
8627 starfun_n_eq <-- starfun{Nat,C}_n_eq
8629 star_n_add <-- {hypreal,hypnat,hcomplex}_add
8630 star_n_minus <-- {hypreal,hcomplex}_minus
8631 star_n_diff <-- {hypreal,hcomplex}_diff
8632 star_n_mult <-- {hypreal,hcomplex}_mult
8633 star_n_inverse <-- {hypreal,hcomplex}_inverse
8634 star_n_le <-- {hypreal,hypnat}_le
8635 star_n_less <-- {hypreal,hypnat}_less
8636 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
8637 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
8638 star_n_abs <-- hypreal_hrabs
8639 star_n_divide <-- hcomplex_divide
8641 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
8642 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
8643 star_of_diff <-- hypreal_of_real_diff
8644 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
8645 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
8646 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
8647 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
8648 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
8649 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
8650 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
8651 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
8652 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
8653 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
8654 star_of_number_of <-- {hypreal,hcomplex}_number_of
8655 star_of_number_less <-- number_of_less_hypreal_of_real_iff
8656 star_of_number_le <-- number_of_le_hypreal_of_real_iff
8657 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
8658 star_of_less_number <-- hypreal_of_real_less_number_of_iff
8659 star_of_le_number <-- hypreal_of_real_le_number_of_iff
8660 star_of_power <-- hypreal_of_real_power
8661 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
8663 * Hyperreal: new method "transfer" that implements the transfer
8664 principle of nonstandard analysis. With a subgoal that mentions
8665 nonstandard types like "'a star", the command "apply transfer"
8666 replaces it with an equivalent one that mentions only standard types.
8667 To be successful, all free variables must have standard types; non-
8668 standard variables must have explicit universal quantifiers.
8670 * Hyperreal: A theory of Taylor series.
8675 * Discontinued special version of 'constdefs' (which used to support
8676 continuous functions) in favor of the general Pure one with full
8679 * New simplification procedure for solving continuity conditions; it
8680 is much faster on terms with many nested lambda abstractions (cubic
8681 instead of exponential time).
8683 * New syntax for domain package: selector names are now optional.
8684 Parentheses should be omitted unless argument is lazy, for example:
8686 domain 'a stream = cons "'a" (lazy "'a stream")
8688 * New command 'fixrec' for defining recursive functions with pattern
8689 matching; defining multiple functions with mutual recursion is also
8690 supported. Patterns may include the constants cpair, spair, up, sinl,
8691 sinr, or any data constructor defined by the domain package. The given
8692 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
8693 syntax and examples.
8695 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
8696 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
8697 but the proof obligation additionally includes an admissibility
8698 requirement. The packages generate instances of class cpo or pcpo,
8699 with continuity and strictness theorems for Rep and Abs.
8701 * HOLCF: Many theorems have been renamed according to a more standard naming
8702 scheme (INCOMPATIBILITY):
8704 foo_inject: "foo$x = foo$y ==> x = y"
8705 foo_eq: "(foo$x = foo$y) = (x = y)"
8706 foo_less: "(foo$x << foo$y) = (x << y)"
8707 foo_strict: "foo$UU = UU"
8708 foo_defined: "... ==> foo$x ~= UU"
8709 foo_defined_iff: "(foo$x = UU) = (x = UU)"
8714 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
8715 including the First Isomorphism Theorem (on quotienting by the kernel
8718 * ZF/Simplifier: install second copy of type solver that actually
8719 makes use of TC rules declared to Isar proof contexts (or locales);
8720 the old version is still required for ML proof scripts.
8725 * Converted to Isar theory format; use locales instead of axiomatic
8731 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
8734 * Pure/library.ML no longer defines its own option datatype, but uses
8735 that of the SML basis, which has constructors NONE and SOME instead of
8736 None and Some, as well as exception Option.Option instead of OPTION.
8737 The functions the, if_none, is_some, is_none have been adapted
8738 accordingly, while Option.map replaces apsome.
8740 * Pure/library.ML: the exception LIST has been given up in favour of
8741 the standard exceptions Empty and Subscript, as well as
8742 Library.UnequalLengths. Function like Library.hd and Library.tl are
8743 superceded by the standard hd and tl functions etc.
8745 A number of basic list functions are no longer exported to the ML
8746 toplevel, as they are variants of predefined functions. The following
8747 suggests how one can translate existing code:
8749 rev_append xs ys = List.revAppend (xs, ys)
8750 nth_elem (i, xs) = List.nth (xs, i)
8751 last_elem xs = List.last xs
8752 flat xss = List.concat xss
8753 seq fs = List.app fs
8754 partition P xs = List.partition P xs
8755 mapfilter f xs = List.mapPartial f xs
8757 * Pure/library.ML: several combinators for linear functional
8758 transformations, notably reverse application and composition:
8761 (x, y) |-> f f #-> g
8763 * Pure/library.ML: introduced/changed precedence of infix operators:
8765 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
8767 infix 3 o oo ooo oooo;
8768 infix 4 ~~ upto downto;
8770 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
8773 * Pure/library.ML: natural list combinators fold, fold_rev, and
8774 fold_map support linear functional transformations and nesting. For
8777 fold f [x1, ..., xN] y =
8778 y |> f x1 |> ... |> f xN
8780 (fold o fold) f [xs1, ..., xsN] y =
8781 y |> fold f xs1 |> ... |> fold f xsN
8783 fold f [x1, ..., xN] =
8786 (fold o fold) f [xs1, ..., xsN] =
8787 fold f xs1 #> ... #> fold f xsN
8789 * Pure/library.ML: the following selectors on type 'a option are
8792 the: 'a option -> 'a (*partial*)
8793 these: 'a option -> 'a where 'a = 'b list
8794 the_default: 'a -> 'a option -> 'a
8795 the_list: 'a option -> 'a list
8797 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
8798 basic operations for association lists, following natural argument
8799 order; moreover the explicit equality predicate passed here avoids
8800 potentially expensive polymorphic runtime equality checks.
8801 The old functions may be expressed as follows:
8803 assoc = uncurry (AList.lookup (op =))
8804 assocs = these oo AList.lookup (op =)
8805 overwrite = uncurry (AList.update (op =)) o swap
8807 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
8809 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
8810 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
8812 replacing make_keylist and keyfilter (occassionally used)
8815 make_keylist = AList.make
8816 keyfilter = AList.find (op =)
8818 * eq_fst and eq_snd now take explicit equality parameter, thus
8819 avoiding eqtypes. Naive rewrites:
8821 eq_fst = eq_fst (op =)
8822 eq_snd = eq_snd (op =)
8824 * Removed deprecated apl and apr (rarely used).
8827 apl (n, op) =>>= curry op n
8828 apr (op, m) =>>= fn n => op (n, m)
8830 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
8831 provides a reasonably efficient light-weight implementation of sets as
8834 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
8835 few new operations; existing lookup and update are now curried to
8836 follow natural argument order (for use with fold etc.);
8837 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
8839 * Pure/General: output via the Isabelle channels of
8840 writeln/warning/error etc. is now passed through Output.output, with a
8841 hook for arbitrary transformations depending on the print_mode
8842 (cf. Output.add_mode -- the first active mode that provides a output
8843 function wins). Already formatted output may be embedded into further
8844 text via Output.raw; the result of Pretty.string_of/str_of and derived
8845 functions (string_of_term/cterm/thm etc.) is already marked raw to
8846 accommodate easy composition of diagnostic messages etc. Programmers
8847 rarely need to care about Output.output or Output.raw at all, with
8848 some notable exceptions: Output.output is required when bypassing the
8849 standard channels (writeln etc.), or in token translations to produce
8850 properly formatted results; Output.raw is required when capturing
8851 already output material that will eventually be presented to the user
8852 a second time. For the default print mode, both Output.output and
8853 Output.raw have no effect.
8855 * Pure/General: Output.time_accumulator NAME creates an operator ('a
8856 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
8857 cumulative results are displayed at the end of a batch session.
8859 * Pure/General: File.sysify_path and File.quote_sysify path have been
8860 replaced by File.platform_path and File.shell_path (with appropriate
8861 hooks). This provides a clean interface for unusual systems where the
8862 internal and external process view of file names are different.
8864 * Pure: more efficient orders for basic syntactic entities: added
8865 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
8866 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
8867 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
8868 orders now -- potential INCOMPATIBILITY for code that depends on a
8869 particular order for Symtab.keys, Symtab.dest, etc. (consider using
8870 Library.sort_strings on result).
8872 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
8873 fold_types traverse types/terms from left to right, observing natural
8874 argument order. Supercedes previous foldl_XXX versions, add_frees,
8875 add_vars etc. have been adapted as well: INCOMPATIBILITY.
8877 * Pure: name spaces have been refined, with significant changes of the
8878 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
8879 to extern(_table). The plain name entry path is superceded by a
8880 general 'naming' context, which also includes the 'policy' to produce
8881 a fully qualified name and external accesses of a fully qualified
8882 name; NameSpace.extend is superceded by context dependent
8883 Sign.declare_name. Several theory and proof context operations modify
8884 the naming context. Especially note Theory.restore_naming and
8885 ProofContext.restore_naming to get back to a sane state; note that
8886 Theory.add_path is no longer sufficient to recover from
8887 Theory.absolute_path in particular.
8889 * Pure: new flags short_names (default false) and unique_names
8890 (default true) for controlling output of qualified names. If
8891 short_names is set, names are printed unqualified. If unique_names is
8892 reset, the name prefix is reduced to the minimum required to achieve
8893 the original result when interning again, even if there is an overlap
8894 with earlier declarations.
8896 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
8897 now 'extend', and 'merge' gets an additional Pretty.pp argument
8898 (useful for printing error messages). INCOMPATIBILITY.
8900 * Pure: major reorganization of the theory context. Type Sign.sg and
8901 Theory.theory are now identified, referring to the universal
8902 Context.theory (see Pure/context.ML). Actual signature and theory
8903 content is managed as theory data. The old code and interfaces were
8904 spread over many files and structures; the new arrangement introduces
8905 considerable INCOMPATIBILITY to gain more clarity:
8907 Context -- theory management operations (name, identity, inclusion,
8908 parents, ancestors, merge, etc.), plus generic theory data;
8910 Sign -- logical signature and syntax operations (declaring consts,
8911 types, etc.), plus certify/read for common entities;
8913 Theory -- logical theory operations (stating axioms, definitions,
8914 oracles), plus a copy of logical signature operations (consts,
8915 types, etc.); also a few basic management operations (Theory.copy,
8918 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
8919 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
8920 for convenience -- they merely return the theory.
8922 * Pure: type Type.tsig is superceded by theory in most interfaces.
8924 * Pure: the Isar proof context type is already defined early in Pure
8925 as Context.proof (note that ProofContext.context and Proof.context are
8926 aliases, where the latter is the preferred name). This enables other
8927 Isabelle components to refer to that type even before Isar is present.
8929 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
8930 typeK, constK, axiomK, oracleK), but provide explicit operations for
8931 any of these kinds. For example, Sign.intern typeK is now
8932 Sign.intern_type, Theory.hide_space Sign.typeK is now
8933 Theory.hide_types. Also note that former
8934 Theory.hide_classes/types/consts are now
8935 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
8936 internalize their arguments! INCOMPATIBILITY.
8938 * Pure: get_thm interface (of PureThy and ProofContext) expects
8939 datatype thmref (with constructors Name and NameSelection) instead of
8940 plain string -- INCOMPATIBILITY;
8942 * Pure: cases produced by proof methods specify options, where NONE
8943 means to remove case bindings -- INCOMPATIBILITY in
8946 * Pure: the following operations retrieve axioms or theorems from a
8947 theory node or theory hierarchy, respectively:
8949 Theory.axioms_of: theory -> (string * term) list
8950 Theory.all_axioms_of: theory -> (string * term) list
8951 PureThy.thms_of: theory -> (string * thm) list
8952 PureThy.all_thms_of: theory -> (string * thm) list
8954 * Pure: print_tac now outputs the goal through the trace channel.
8956 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
8957 Reference Toplevel.debug (default false) controls detailed printing
8958 and tracing of low-level exceptions; Toplevel.profiling (default 0)
8959 controls execution profiling -- set to 1 for time and 2 for space
8960 (both increase the runtime).
8962 * Isar session: The initial use of ROOT.ML is now always timed,
8963 i.e. the log will show the actual process times, in contrast to the
8964 elapsed wall-clock time that the outer shell wrapper produces.
8966 * Simplifier: improved handling of bound variables (nameless
8967 representation, avoid allocating new strings). Simprocs that invoke
8968 the Simplifier recursively should use Simplifier.inherit_bounds to
8969 avoid local name clashes. Failure to do so produces warnings
8970 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
8971 for further details.
8973 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
8974 bindings for all theorems stored within a given theory; this may help
8975 in porting non-Isar theories to Isar ones, while keeping ML proof
8976 scripts for the time being.
8978 * ML operator HTML.with_charset specifies the charset begin used for
8979 generated HTML files. For example:
8981 HTML.with_charset "utf-8" use_thy "Hebrew";
8982 HTML.with_charset "utf-8" use_thy "Chinese";
8987 * Allow symlinks to all proper Isabelle executables (Isabelle,
8988 isabelle, isatool etc.).
8990 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
8991 isatool doc, isatool mkdir, display_drafts etc.).
8993 * isatool usedir: option -f allows specification of the ML file to be
8994 used by Isabelle; default is ROOT.ML.
8996 * New isatool version outputs the version identifier of the Isabelle
8997 distribution being used.
8999 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
9000 (containing Boolean satisfiability problems) into Isabelle/HOL
9005 New in Isabelle2004 (April 2004)
9006 --------------------------------
9010 * Provers/order.ML: new efficient reasoner for partial and linear orders.
9011 Replaces linorder.ML.
9013 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
9014 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
9015 (\<a>...\<z>), are now considered normal letters, and can therefore
9016 be used anywhere where an ASCII letter (a...zA...Z) has until
9017 now. COMPATIBILITY: This obviously changes the parsing of some
9018 terms, especially where a symbol has been used as a binder, say
9019 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
9020 as an identifier. Fix it by inserting a space around former
9021 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
9022 existing theory and ML files.
9024 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
9026 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
9027 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
9028 a normal (but invisible) letter. For multiple letter subscripts repeat
9029 \<^isub> like this: x\<^isub>1\<^isub>2.
9031 * Pure: There are now sub-/superscripts that can span more than one
9032 character. Text between \<^bsub> and \<^esub> is set in subscript in
9033 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
9034 superscript. The new control characters are not identifier parts.
9036 * Pure: Control-symbols of the form \<^raw:...> will literally print the
9037 content of "..." to the latex file instead of \isacntrl... . The "..."
9038 may consist of any printable characters excluding the end bracket >.
9040 * Pure: Using new Isar command "finalconsts" (or the ML functions
9041 Theory.add_finals or Theory.add_finals_i) it is now possible to
9042 declare constants "final", which prevents their being given a definition
9043 later. It is useful for constants whose behaviour is fixed axiomatically
9044 rather than definitionally, such as the meta-logic connectives.
9046 * Pure: 'instance' now handles general arities with general sorts
9047 (i.e. intersections of classes),
9049 * Presentation: generated HTML now uses a CSS style sheet to make layout
9050 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
9051 It can be changed to alter the colors/layout of generated pages.
9056 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
9057 cut_tac, subgoal_tac and thin_tac:
9058 - Now understand static (Isar) contexts. As a consequence, users of Isar
9059 locales are no longer forced to write Isar proof scripts.
9060 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
9062 - INCOMPATIBILITY: names of variables to be instantiated may no
9063 longer be enclosed in quotes. Instead, precede variable name with `?'.
9064 This is consistent with the instantiation attribute "where".
9066 * Attributes "where" and "of":
9067 - Now take type variables of instantiated theorem into account when reading
9068 the instantiation string. This fixes a bug that caused instantiated
9069 theorems to have too special types in some circumstances.
9070 - "where" permits explicit instantiations of type variables.
9072 * Calculation commands "moreover" and "also" no longer interfere with
9073 current facts ("this"), admitting arbitrary combinations with "then"
9077 - Goal statements involving the context element "includes" no longer
9078 generate theorems with internal delta predicates (those ending on
9079 "_axioms") in the premise.
9080 Resolve particular premise with <locale>.intro to obtain old form.
9081 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
9082 specification and "includes" elements in goal statement.
9083 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
9084 [intro?] and [elim?] (respectively) by default.
9085 - Experimental command for instantiation of locales in proof contexts:
9086 instantiate <label>[<attrs>]: <loc>
9087 Instantiates locale <loc> and adds all its theorems to the current context
9088 taking into account their attributes. Label and attrs are optional
9089 modifiers, like in theorem declarations. If present, names of
9090 instantiated theorems are qualified with <label>, and the attributes
9091 <attrs> are applied after any attributes these theorems might have already.
9092 If the locale has assumptions, a chained fact of the form
9093 "<loc> t1 ... tn" is expected from which instantiations of the parameters
9094 are derived. The command does not support old-style locales declared
9095 with "locale (open)".
9096 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
9098 * HOL: Tactic emulation methods induct_tac and case_tac understand static
9104 * Proof import: new image HOL4 contains the imported library from
9105 the HOL4 system with about 2500 theorems. It is imported by
9106 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
9107 can be used like any other Isabelle image. See
9108 HOL/Import/HOL/README for more information.
9111 - Much improved handling of linear and partial orders.
9112 Reasoners for linear and partial orders are set up for type classes
9113 "linorder" and "order" respectively, and are added to the default simpset
9114 as solvers. This means that the simplifier can build transitivity chains
9115 to solve goals from the assumptions.
9116 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
9117 of blast or auto after simplification become unnecessary because the goal
9118 is solved by simplification already.
9120 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
9121 all proved in axiomatic type classes for semirings, rings and fields.
9124 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
9125 now formalized using the Ring_and_Field theory mentioned above.
9126 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
9127 than before, because now they are set up once in a generic manner.
9128 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
9129 Look for the general versions in Ring_and_Field (and Power if they concern
9132 * Type "rat" of the rational numbers is now available in HOL-Complex.
9135 - Record types are now by default printed with their type abbreviation
9136 instead of the list of all field types. This can be configured via
9137 the reference "print_record_type_abbr".
9138 - Simproc "record_upd_simproc" for simplification of multiple updates added
9139 (not enabled by default).
9140 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
9141 EX x. x = sel r to True (not enabled by default).
9142 - Tactic "record_split_simp_tac" to split and simplify records added.
9144 * 'specification' command added, allowing for definition by
9145 specification. There is also an 'ax_specification' command that
9146 introduces the new constants axiomatically.
9148 * arith(_tac) is now able to generate counterexamples for reals as well.
9150 * HOL-Algebra: new locale "ring" for non-commutative rings.
9152 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
9153 definitions, thanks to Sava Krsti\'{c} and John Matthews.
9155 * HOL-Matrix: a first theory for matrices in HOL with an application of
9156 matrix theory to linear programming.
9158 * Unions and Intersections:
9159 The latex output syntax of UN and INT has been changed
9160 from "\Union x \in A. B" to "\Union_{x \in A} B"
9161 i.e. the index formulae has become a subscript.
9162 Similarly for "\Union x. B", and for \Inter instead of \Union.
9164 * Unions and Intersections over Intervals:
9165 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
9166 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
9167 like in normal math, and corresponding versions for < and for intersection.
9169 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
9170 lexicographic dictonary ordering has been added as "lexord".
9172 * ML: the legacy theory structures Int and List have been removed. They had
9173 conflicted with ML Basis Library structures having the same names.
9175 * 'refute' command added to search for (finite) countermodels. Only works
9176 for a fragment of HOL. The installation of an external SAT solver is
9177 highly recommended. See "HOL/Refute.thy" for details.
9179 * 'quickcheck' command: Allows to find counterexamples by evaluating
9180 formulae under an assignment of free variables to random values.
9181 In contrast to 'refute', it can deal with inductive datatypes,
9182 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
9188 * Streams now come with concatenation and are part of the HOLCF image
9192 New in Isabelle2003 (May 2003)
9193 ------------------------------
9197 * Provers/simplifier:
9199 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
9200 Assumptions are now subject to complete mutual simplification,
9201 not just from left to right. The simplifier now preserves
9202 the order of assumptions.
9204 Potential INCOMPATIBILITY:
9206 -- simp sometimes diverges where the old version did
9207 not, e.g. invoking simp on the goal
9209 [| P (f x); y = x; f x = f y |] ==> Q
9211 now gives rise to the infinite reduction sequence
9213 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
9215 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
9218 -- Tactics combining classical reasoner and simplification (such as auto)
9219 are also affected by this change, because many of them rely on
9220 simp. They may sometimes diverge as well or yield a different numbers
9221 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
9222 in case of problems. Sometimes subsequent calls to the classical
9223 reasoner will fail because a preceeding call to the simplifier too
9224 eagerly simplified the goal, e.g. deleted redundant premises.
9226 - The simplifier trace now shows the names of the applied rewrite rules
9228 - You can limit the number of recursive invocations of the simplifier
9229 during conditional rewriting (where the simplifie tries to solve the
9230 conditions before applying the rewrite rule):
9231 ML "simp_depth_limit := n"
9232 where n is an integer. Thus you can force termination where previously
9233 the simplifier would diverge.
9235 - Accepts free variables as head terms in congruence rules. Useful in Isar.
9237 - No longer aborts on failed congruence proof. Instead, the
9238 congruence is ignored.
9240 * Pure: New generic framework for extracting programs from constructive
9241 proofs. See HOL/Extraction.thy for an example instantiation, as well
9242 as HOL/Extraction for some case studies.
9244 * Pure: The main goal of the proof state is no longer shown by default, only
9245 the subgoals. This behaviour is controlled by a new flag.
9246 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
9247 (ML: Proof.show_main_goal).
9249 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
9250 rules whose conclusion matches subgoal 1:
9251 PG menu: Isabelle/Isar -> Show me -> matching rules
9252 The rules are ordered by how closely they match the subgoal.
9253 In particular, rules that solve a subgoal outright are displayed first
9254 (or rather last, the way they are printed).
9255 (ML: ProofGeneral.print_intros())
9257 * Pure: New flag trace_unify_fail causes unification to print
9258 diagnostic information (PG: in trace buffer) when it fails. This is
9259 useful for figuring out why single step proofs like rule, erule or
9262 * Pure: Locale specifications now produce predicate definitions
9263 according to the body of text (covering assumptions modulo local
9264 definitions); predicate "loc_axioms" covers newly introduced text,
9265 while "loc" is cumulative wrt. all included locale expressions; the
9266 latter view is presented only on export into the global theory
9267 context; potential INCOMPATIBILITY, use "(open)" option to fall back
9268 on the old view without predicates;
9270 * Pure: predefined locales "var" and "struct" are useful for sharing
9271 parameters (as in CASL, for example); just specify something like
9272 ``var x + var y + struct M'' as import;
9274 * Pure: improved thms_containing: proper indexing of facts instead of
9275 raw theorems; check validity of results wrt. current name space;
9276 include local facts of proof configuration (also covers active
9277 locales), cover fixed variables in index; may use "_" in term
9278 specification; an optional limit for the number of printed facts may
9279 be given (the default is 40);
9281 * Pure: disallow duplicate fact bindings within new-style theory files
9284 * Provers: improved induct method: assumptions introduced by case
9285 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
9286 the goal statement); "foo" still refers to all facts collectively;
9288 * Provers: the function blast.overloaded has been removed: all constants
9289 are regarded as potentially overloaded, which improves robustness in exchange
9290 for slight decrease in efficiency;
9292 * Provers/linorder: New generic prover for transitivity reasoning over
9293 linear orders. Note: this prover is not efficient!
9295 * Isar: preview of problems to finish 'show' now produce an error
9296 rather than just a warning (in interactive mode);
9303 - Produces a counter example if it cannot prove a goal.
9304 Note that the counter example may be spurious if the goal is not a formula
9305 of quantifier-free linear arithmetic.
9306 In ProofGeneral the counter example appears in the trace buffer.
9308 - Knows about div k and mod k where k is a numeral of type nat or int.
9310 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
9311 linear arithmetic fails. This takes account of quantifiers and divisibility.
9312 Presburger arithmetic can also be called explicitly via presburger(_tac).
9314 * simp's arithmetic capabilities have been enhanced a bit: it now
9315 takes ~= in premises into account (by performing a case split);
9317 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
9318 are distributed over a sum of terms;
9320 * New tactic "trans_tac" and method "trans" instantiate
9321 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
9324 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
9325 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
9327 * 'typedef' command has new option "open" to suppress the set
9330 * functions Min and Max on finite sets have been introduced (theory
9333 * attribute [symmetric] now works for relations as well; it turns
9334 (x,y) : R^-1 into (y,x) : R, and vice versa;
9336 * induct over a !!-quantified statement (say !!x1..xn):
9337 each "case" automatically performs "fix x1 .. xn" with exactly those names.
9339 * Map: `empty' is no longer a constant but a syntactic abbreviation for
9340 %x. None. Warning: empty_def now refers to the previously hidden definition
9343 * Algebra: formalization of classical algebra. Intended as base for
9344 any algebraic development in Isabelle. Currently covers group theory
9345 (up to Sylow's theorem) and ring theory (Universal Property of
9346 Univariate Polynomials). Contributions welcome;
9348 * GroupTheory: deleted, since its material has been moved to Algebra;
9350 * Complex: new directory of the complex numbers with numeric constants,
9351 nonstandard complex numbers, and some complex analysis, standard and
9352 nonstandard (Jacques Fleuriot);
9354 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
9356 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
9359 * Real/HahnBanach: updated and adapted to locales;
9361 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
9364 * UNITY: added the Meier-Sanders theory of progress sets;
9366 * MicroJava: bytecode verifier and lightweight bytecode verifier
9367 as abstract algorithms, instantiated to the JVM;
9369 * Bali: Java source language formalization. Type system, operational
9370 semantics, axiomatic semantics. Supported language features:
9371 classes, interfaces, objects,virtual methods, static methods,
9372 static/instance fields, arrays, access modifiers, definite
9373 assignment, exceptions.
9378 * ZF/Constructible: consistency proof for AC (Gdel's constructible
9381 * Main ZF: virtually all theories converted to new-style format;
9386 * Pure: Tactic.prove provides sane interface for internal proofs;
9387 omits the infamous "standard" operation, so this is more appropriate
9388 than prove_goalw_cterm in many situations (e.g. in simprocs);
9390 * Pure: improved error reporting of simprocs;
9392 * Provers: Simplifier.simproc(_i) provides sane interface for setting
9396 *** Document preparation ***
9398 * uses \par instead of \\ for line breaks in theory text. This may
9399 shift some page breaks in large documents. To get the old behaviour
9400 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
9402 * minimized dependencies of isabelle.sty and isabellesym.sty on
9405 * \<euro> now needs package babel/greek instead of marvosym (which
9408 * normal size for \<zero>...\<nine> (uses \mathbf instead of
9413 New in Isabelle2002 (March 2002)
9414 --------------------------------
9416 *** Document preparation ***
9418 * greatly simplified document preparation setup, including more
9419 graceful interpretation of isatool usedir -i/-d/-D options, and more
9420 instructive isatool mkdir; users should basically be able to get
9421 started with "isatool mkdir HOL Test && isatool make"; alternatively,
9422 users may run a separate document processing stage manually like this:
9423 "isatool usedir -D output HOL Test && isatool document Test/output";
9425 * theory dependency graph may now be incorporated into documents;
9426 isatool usedir -g true will produce session_graph.eps/.pdf for use
9427 with \includegraphics of LaTeX;
9429 * proper spacing of consecutive markup elements, especially text
9430 blocks after section headings;
9432 * support bold style (for single symbols only), input syntax is like
9433 this: "\<^bold>\<alpha>" or "\<^bold>A";
9435 * \<bullet> is now output as bold \cdot by default, which looks much
9436 better in printed text;
9438 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
9439 note that these symbols are currently unavailable in Proof General /
9440 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
9442 * isatool latex no longer depends on changed TEXINPUTS, instead
9443 isatool document copies the Isabelle style files to the target
9449 * Pure/Provers: improved proof by cases and induction;
9450 - 'case' command admits impromptu naming of parameters (such as
9452 - 'induct' method divinates rule instantiation from the inductive
9453 claim; no longer requires excessive ?P bindings for proper
9454 instantiation of cases;
9455 - 'induct' method properly enumerates all possibilities of set/type
9456 rules; as a consequence facts may be also passed through *type*
9457 rules without further ado;
9458 - 'induct' method now derives symbolic cases from the *rulified*
9459 rule (before it used to rulify cases stemming from the internal
9460 atomized version); this means that the context of a non-atomic
9461 statement becomes is included in the hypothesis, avoiding the
9462 slightly cumbersome show "PROP ?case" form;
9463 - 'induct' may now use elim-style induction rules without chaining
9464 facts, using ``missing'' premises from the goal state; this allows
9465 rules stemming from inductive sets to be applied in unstructured
9466 scripts, while still benefitting from proper handling of non-atomic
9467 statements; NB: major inductive premises need to be put first, all
9468 the rest of the goal is passed through the induction;
9469 - 'induct' proper support for mutual induction involving non-atomic
9470 rule statements (uses the new concept of simultaneous goals, see
9472 - append all possible rule selections, but only use the first
9473 success (no backtracking);
9474 - removed obsolete "(simplified)" and "(stripped)" options of methods;
9475 - undeclared rule case names default to numbers 1, 2, 3, ...;
9476 - added 'print_induct_rules' (covered by help item in recent Proof
9478 - moved induct/cases attributes to Pure, methods to Provers;
9479 - generic method setup instantiated for FOL and HOL;
9481 * Pure: support multiple simultaneous goal statements, for example
9482 "have a: A and b: B" (same for 'theorem' etc.); being a pure
9483 meta-level mechanism, this acts as if several individual goals had
9484 been stated separately; in particular common proof methods need to be
9485 repeated in order to cover all claims; note that a single elimination
9486 step is *not* sufficient to establish the two conjunctions, so this
9489 assume "A & B" then have A and B .. (*".." fails*)
9491 better use "obtain" in situations as above; alternative refer to
9492 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
9494 * Pure: proper integration with ``locales''; unlike the original
9495 version by Florian Kammller, Isar locales package high-level proof
9496 contexts rather than raw logical ones (e.g. we admit to include
9497 attributes everywhere); operations on locales include merge and
9498 rename; support for implicit arguments (``structures''); simultaneous
9499 type-inference over imports and text; see also HOL/ex/Locales.thy for
9502 * Pure: the following commands have been ``localized'', supporting a
9503 target locale specification "(in name)": 'lemma', 'theorem',
9504 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
9505 stored both within the locale and at the theory level (exported and
9506 qualified by the locale name);
9508 * Pure: theory goals may now be specified in ``long'' form, with
9509 ad-hoc contexts consisting of arbitrary locale elements. for example
9510 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
9511 definitions may be given, too); the result is a meta-level rule with
9512 the context elements being discharged in the obvious way;
9514 * Pure: new proof command 'using' allows to augment currently used
9515 facts after a goal statement ('using' is syntactically analogous to
9516 'apply', but acts on the goal's facts only); this allows chained facts
9517 to be separated into parts given before and after a claim, as in
9518 ``from a and b have C using d and e <proof>'';
9520 * Pure: renamed "antecedent" case to "rule_context";
9522 * Pure: new 'judgment' command records explicit information about the
9523 object-logic embedding (used by several tools internally); no longer
9524 use hard-wired "Trueprop";
9526 * Pure: added 'corollary' command;
9528 * Pure: fixed 'token_translation' command;
9530 * Pure: removed obsolete 'exported' attribute;
9532 * Pure: dummy pattern "_" in is/let is now automatically lifted over
9533 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
9534 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
9536 * Pure: method 'atomize' presents local goal premises as object-level
9537 statements (atomic meta-level propositions); setup controlled via
9538 rewrite rules declarations of 'atomize' attribute; example
9539 application: 'induct' method with proper rule statements in improper
9542 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
9543 now consider the syntactic context of assumptions, giving a better
9544 chance to get type-inference of the arguments right (this is
9545 especially important for locales);
9547 * Pure: "sorry" no longer requires quick_and_dirty in interactive
9550 * Pure/obtain: the formal conclusion "thesis", being marked as
9551 ``internal'', may no longer be reference directly in the text;
9552 potential INCOMPATIBILITY, may need to use "?thesis" in rare
9555 * Pure: generic 'sym' attribute which declares a rule both as pure
9556 'elim?' and for the 'symmetric' operation;
9558 * Pure: marginal comments ``--'' may now occur just anywhere in the
9559 text; the fixed correlation with particular command syntax has been
9562 * Pure: new method 'rules' is particularly well-suited for proof
9563 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
9564 but often produces more compact proof terms with less detours;
9566 * Pure/Provers/classical: simplified integration with pure rule
9567 attributes and methods; the classical "intro?/elim?/dest?"
9568 declarations coincide with the pure ones; the "rule" method no longer
9569 includes classically swapped intros; "intro" and "elim" methods no
9570 longer pick rules from the context; also got rid of ML declarations
9571 AddXIs/AddXEs/AddXDs; all of this has some potential for
9574 * Provers/classical: attribute 'swapped' produces classical inversions
9575 of introduction rules;
9577 * Provers/simplifier: 'simplified' attribute may refer to explicit
9578 rules instead of full simplifier context; 'iff' attribute handles
9581 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
9583 * HOL: 'recdef' now fails on unfinished automated proofs, use
9584 "(permissive)" option to recover old behavior;
9586 * HOL: 'inductive' no longer features separate (collective) attributes
9587 for 'intros' (was found too confusing);
9589 * HOL: properly declared induction rules less_induct and
9595 * HOL: moved over to sane numeral syntax; the new policy is as
9598 - 0 and 1 are polymorphic constants, which are defined on any
9599 numeric type (nat, int, real etc.);
9601 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
9602 binary representation internally;
9604 - type nat has special constructor Suc, and generally prefers Suc 0
9605 over 1::nat and Suc (Suc 0) over 2::nat;
9607 This change may cause significant problems of INCOMPATIBILITY; here
9608 are some hints on converting existing sources:
9610 - due to the new "num" token, "-0" and "-1" etc. are now atomic
9611 entities, so expressions involving "-" (unary or binary minus) need
9612 to be spaced properly;
9614 - existing occurrences of "1" may need to be constraint "1::nat" or
9615 even replaced by Suc 0; similar for old "2";
9617 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
9619 - remove all special provisions on numerals in proofs;
9621 * HOL: simp rules nat_number expand numerals on nat to Suc/0
9622 representation (depends on bin_arith_simps in the default context);
9624 * HOL: symbolic syntax for x^2 (numeral 2);
9626 * HOL: the class of all HOL types is now called "type" rather than
9627 "term"; INCOMPATIBILITY, need to adapt references to this type class
9628 in axclass/classes, instance/arities, and (usually rare) occurrences
9629 in typings (of consts etc.); internally the class is called
9630 "HOL.type", ML programs should refer to HOLogic.typeS;
9632 * HOL/record package improvements:
9633 - new derived operations "fields" to build a partial record section,
9634 "extend" to promote a fixed record to a record scheme, and
9635 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
9636 declared as simp by default;
9637 - shared operations ("more", "fields", etc.) now need to be always
9638 qualified) --- potential INCOMPATIBILITY;
9639 - removed "make_scheme" operations (use "make" with "extend") --
9641 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
9642 - provides cases/induct rules for use with corresponding Isar
9643 methods (for concrete records, record schemes, concrete more
9644 parts, and schematic more parts -- in that order);
9645 - internal definitions directly based on a light-weight abstract
9646 theory of product types over typedef rather than datatype;
9648 * HOL: generic code generator for generating executable ML code from
9649 specifications; specific support for HOL constructs such as inductive
9650 datatypes and sets, as well as recursive functions; can be invoked
9651 via 'generate_code' theory section;
9653 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
9655 * HOL: consolidated and renamed several theories. In particular:
9656 Ord.thy has been absorbed into HOL.thy
9657 String.thy has been absorbed into List.thy
9659 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
9660 (beware of argument permutation!);
9662 * HOL: linorder_less_split superseded by linorder_cases;
9664 * HOL/List: "nodups" renamed to "distinct";
9666 * HOL: added "The" definite description operator; move Hilbert's "Eps"
9667 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
9668 - Ex_def has changed, now need to use some_eq_ex
9670 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
9671 in this (rare) case use:
9673 delSWrapper "split_all_tac"
9674 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
9676 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
9679 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
9680 Isabelle's type classes, ^ on functions and relations has too general
9681 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
9682 necessary to attach explicit type constraints;
9684 * HOL/Relation: the prefix name of the infix "O" has been changed from
9685 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
9686 renamed accordingly (eg "compI" -> "rel_compI").
9688 * HOL: syntax translations now work properly with numerals and records
9691 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
9692 of "lam" -- INCOMPATIBILITY;
9694 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
9695 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
9696 renamed "Product_Type.unit";
9698 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
9700 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
9701 the "cases" method);
9703 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
9706 * HOL/IMP: updated and converted to new-style theory format; several
9707 parts turned into readable document, with proper Isar proof texts and
9708 some explanations (by Gerwin Klein);
9710 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
9712 * HOL-Hyperreal is now a logic image;
9717 * Isar: consts/constdefs supports mixfix syntax for continuous
9720 * Isar: domain package adapted to new-style theory format, e.g. see
9723 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
9724 potential INCOMPATIBILITY; now use plain induct_tac instead of former
9725 lift.induct_tac, always use UU instead of Undef;
9727 * HOLCF/IMP: updated and converted to new-style theory;
9732 * Isar: proper integration of logic-specific tools and packages,
9733 including theory commands '(co)inductive', '(co)datatype',
9734 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
9735 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
9737 * theory Main no longer includes AC; for the Axiom of Choice, base
9738 your theory on Main_ZFC;
9740 * the integer library now covers quotients and remainders, with many
9741 laws relating division to addition, multiplication, etc.;
9743 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
9744 typeless version of the formalism;
9746 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
9749 * ZF/Induct: new directory for examples of inductive definitions,
9750 including theory Multiset for multiset orderings; converted to
9751 new-style theory format;
9753 * ZF: many new theorems about lists, ordinals, etc.;
9758 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
9759 variable proof controls level of detail: 0 = no proofs (only oracle
9760 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
9761 also ref manual for further ML interfaces;
9763 * Pure/axclass: removed obsolete ML interface
9764 goal_subclass/goal_arity;
9766 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
9767 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
9768 separate tokens, so expressions involving minus need to be spaced
9771 * Pure/syntax: support non-oriented infixes, using keyword "infix"
9772 rather than "infixl" or "infixr";
9774 * Pure/syntax: concrete syntax for dummy type variables admits genuine
9775 sort constraint specifications in type inference; e.g. "x::_::foo"
9776 ensures that the type of "x" is of sort "foo" (but not necessarily a
9779 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
9780 control output of nested => (types); the default behavior is
9783 * Pure/syntax: builtin parse translation for "_constify" turns valued
9784 tokens into AST constants;
9786 * Pure/syntax: prefer later declarations of translations and print
9787 translation functions; potential INCOMPATIBILITY: need to reverse
9788 multiple declarations for same syntax element constant;
9790 * Pure/show_hyps reset by default (in accordance to existing Isar
9793 * Provers/classical: renamed addaltern to addafter, addSaltern to
9796 * Provers/clasimp: ``iff'' declarations now handle conditional rules
9799 * system: tested support for MacOS X; should be able to get Isabelle +
9800 Proof General to work in a plain Terminal after installing Poly/ML
9801 (e.g. from the Isabelle distribution area) and GNU bash alone
9802 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
9803 support requires further installations, e.g. from
9804 http://fink.sourceforge.net/);
9806 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
9808 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
9809 of 40 MB), cf. ML_OPTIONS;
9811 * system: Proof General keywords specification is now part of the
9812 Isabelle distribution (see etc/isar-keywords.el);
9814 * system: support for persistent Proof General sessions (refrain from
9815 outdating all loaded theories on startup); user may create writable
9816 logic images like this: ``isabelle -q HOL Test'';
9818 * system: smart selection of Isabelle process versus Isabelle
9819 interface, accommodates case-insensitive file systems (e.g. HFS+); may
9820 run both "isabelle" and "Isabelle" even if file names are badly
9821 damaged (executable inspects the case of the first letter of its own
9822 name); added separate "isabelle-process" and "isabelle-interface";
9824 * system: refrain from any attempt at filtering input streams; no
9825 longer support ``8bit'' encoding of old isabelle font, instead proper
9826 iso-latin characters may now be used; the related isatools
9827 "symbolinput" and "nonascii" have disappeared as well;
9829 * system: removed old "xterm" interface (the print modes "xterm" and
9830 "xterm_color" are still available for direct use in a suitable
9835 New in Isabelle99-2 (February 2001)
9836 -----------------------------------
9838 *** Overview of INCOMPATIBILITIES ***
9840 * HOL: please note that theories in the Library and elsewhere often use the
9841 new-style (Isar) format; to refer to their theorems in an ML script you must
9842 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
9844 * HOL: inductive package no longer splits induction rule aggressively,
9845 but only as far as specified by the introductions given; the old
9846 format may be recovered via ML function complete_split_rule or attribute
9847 'split_rule (complete)';
9849 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
9850 gfp_Tarski to gfp_unfold;
9852 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
9854 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
9855 relation); infix "^^" has been renamed "``"; infix "``" has been
9856 renamed "`"; "univalent" has been renamed "single_valued";
9858 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
9861 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
9863 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
9865 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
9866 consequence, it is no longer monotonic wrt. the local goal context
9867 (which is now passed through the inductive cases);
9869 * Document preparation: renamed standard symbols \<ll> to \<lless> and
9870 \<gg> to \<ggreater>;
9873 *** Document preparation ***
9875 * \isabellestyle{NAME} selects version of Isabelle output (currently
9876 available: are "it" for near math-mode best-style output, "sl" for
9877 slanted text style, and "tt" for plain type-writer; if no
9878 \isabellestyle command is given, output is according to slanted
9881 * support sub/super scripts (for single symbols only), input syntax is
9882 like this: "A\<^sup>*" or "A\<^sup>\<star>";
9884 * some more standard symbols; see Appendix A of the system manual for
9885 the complete list of symbols defined in isabellesym.sty;
9887 * improved isabelle style files; more abstract symbol implementation
9888 (should now use \isamath{...} and \isatext{...} in custom symbol
9891 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
9892 state; Note that presentation of goal states does not conform to
9893 actual human-readable proof documents. Please do not include goal
9894 states into document output unless you really know what you are doing!
9896 * proper indentation of antiquoted output with proportional LaTeX
9899 * no_document ML operator temporarily disables LaTeX document
9902 * isatool unsymbolize tunes sources for plain ASCII communication;
9907 * Pure: Isar now suffers initial goal statements to contain unbound
9908 schematic variables (this does not conform to actual readable proof
9909 documents, due to unpredictable outcome and non-compositional proof
9910 checking); users who know what they are doing may use schematic goals
9911 for Prolog-style synthesis of proven results;
9913 * Pure: assumption method (an implicit finishing) now handles actual
9916 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
9917 initial goal, declare "that" only as Pure intro (only for single
9918 steps); the "that" rule assumption may now be involved in implicit
9919 finishing, thus ".." becomes a feasible for trivial obtains;
9921 * Pure: default proof step now includes 'intro_classes'; thus trivial
9922 instance proofs may be performed by "..";
9924 * Pure: ?thesis / ?this / "..." now work for pure meta-level
9927 * Pure: more robust selection of calculational rules;
9929 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
9930 rule (as well as the assumption rule);
9932 * Pure: 'thm_deps' command visualizes dependencies of theorems and
9933 lemmas, using the graph browser tool;
9935 * Pure: predict failure of "show" in interactive mode;
9937 * Pure: 'thms_containing' now takes actual terms as arguments;
9939 * HOL: improved method 'induct' --- now handles non-atomic goals
9940 (potential INCOMPATIBILITY); tuned error handling;
9942 * HOL: cases and induct rules now provide explicit hints about the
9943 number of facts to be consumed (0 for "type" and 1 for "set" rules);
9944 any remaining facts are inserted into the goal verbatim;
9946 * HOL: local contexts (aka cases) may now contain term bindings as
9947 well; the 'cases' and 'induct' methods new provide a ?case binding for
9948 the result to be shown in each case;
9950 * HOL: added 'recdef_tc' command;
9952 * isatool convert assists in eliminating legacy ML scripts;
9957 * HOL/Library: a collection of generic theories to be used together
9958 with main HOL; the theory loader path already includes this directory
9959 by default; the following existing theories have been moved here:
9960 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
9961 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
9963 * HOL/Unix: "Some aspects of Unix file-system security", a typical
9964 modelling and verification task performed in Isabelle/HOL +
9965 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
9967 * HOL/Algebra: special summation operator SUM no longer exists, it has
9968 been replaced by setsum; infix 'assoc' now has priority 50 (like
9969 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
9970 'domain', this makes the theory consistent with mathematical
9973 * HOL basics: added overloaded operations "inverse" and "divide"
9974 (infix "/"), syntax for generic "abs" operation, generic summation
9977 * HOL/typedef: simplified package, provide more useful rules (see also
9980 * HOL/datatype: induction rule for arbitrarily branching datatypes is
9981 now expressed as a proper nested rule (old-style tactic scripts may
9982 require atomize_strip_tac to cope with non-atomic premises);
9984 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
9985 to "split_conv" (old name still available for compatibility);
9987 * HOL: improved concrete syntax for strings (e.g. allows translation
9988 rules with string literals);
9990 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
9991 and Fleuriot's mechanization of analysis, including the transcendental
9992 functions for the reals;
9994 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
9999 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
10000 "lam" is displayed as TWO lambda-symbols
10002 * CTT: theory Main now available, containing everything (that is, Bool
10008 * Pure: the Simplifier has been implemented properly as a derived rule
10009 outside of the actual kernel (at last!); the overall performance
10010 penalty in practical applications is about 50%, while reliability of
10011 the Isabelle inference kernel has been greatly improved;
10013 * print modes "brackets" and "no_brackets" control output of nested =>
10014 (types) and ==> (props); the default behaviour is "brackets";
10016 * Provers: fast_tac (and friends) now handle actual object-logic rules
10017 as assumptions as well;
10019 * system: support Poly/ML 4.0;
10021 * system: isatool install handles KDE version 1 or 2;
10025 New in Isabelle99-1 (October 2000)
10026 ----------------------------------
10028 *** Overview of INCOMPATIBILITIES ***
10030 * HOL: simplification of natural numbers is much changed; to partly
10031 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
10032 issue the following ML commands:
10034 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
10035 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
10037 * HOL: simplification no longer dives into case-expressions; this is
10038 controlled by "t.weak_case_cong" for each datatype t;
10040 * HOL: nat_less_induct renamed to less_induct;
10042 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
10043 fixsome to patch .thy and .ML sources automatically;
10045 select_equality -> some_equality
10046 select_eq_Ex -> some_eq_ex
10047 selectI2EX -> someI2_ex
10050 select1_equality -> some1_equality
10051 Eps_sym_eq -> some_sym_eq_trivial
10052 Eps_eq -> some_eq_trivial
10054 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
10056 * HOL: removed obsolete theorem binding expand_if (refer to split_if
10059 * HOL: the recursion equations generated by 'recdef' are now called
10060 f.simps instead of f.rules;
10062 * HOL: qed_spec_mp now also handles bounded ALL as well;
10064 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
10065 sometimes be needed;
10067 * HOL: the constant for "f``x" is now "image" rather than "op ``";
10069 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
10071 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
10072 product is now "<*>" instead of "Times"; the lexicographic product is
10073 now "<*lex*>" instead of "**";
10075 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
10076 of main HOL, but was unused); better use HOL's datatype package;
10078 * HOL: removed "symbols" syntax for constant "override" of theory Map;
10079 the old syntax may be recovered as follows:
10082 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
10083 (infixl "\\<oplus>" 100)
10085 * HOL/Real: "rabs" replaced by overloaded "abs" function;
10087 * HOL/ML: even fewer consts are declared as global (see theories Ord,
10088 Lfp, Gfp, WF); this only affects ML packages that refer to const names
10091 * HOL and ZF: syntax for quotienting wrt an equivalence relation
10092 changed from A/r to A//r;
10094 * ZF: new treatment of arithmetic (nat & int) may break some old
10097 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
10098 rulify -> rule_format, elimify -> elim_format, ...);
10100 * Isar/Provers: intro/elim/dest attributes changed; renamed
10101 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
10102 should have to change intro!! to intro? only); replaced "delrule" by
10105 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
10107 * Provers: strengthened force_tac by using new first_best_tac;
10109 * LaTeX document preparation: several changes of isabelle.sty (see
10113 *** Document preparation ***
10115 * formal comments (text blocks etc.) in new-style theories may now
10116 contain antiquotations of thm/prop/term/typ/text to be presented
10117 according to latex print mode; concrete syntax is like this:
10118 @{term[show_types] "f(x) = a + x"};
10120 * isatool mkdir provides easy setup of Isabelle session directories,
10121 including proper document sources;
10123 * generated LaTeX sources are now deleted after successful run
10124 (isatool document -c); may retain a copy somewhere else via -D option
10127 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
10128 style files, achieving self-contained LaTeX sources and simplifying
10131 * old-style theories now produce (crude) LaTeX output as well;
10133 * browser info session directories are now self-contained (may be put
10134 on WWW server seperately); improved graphs of nested sessions; removed
10135 graph for 'all sessions';
10137 * several improvements in isabelle style files; \isabellestyle{it}
10138 produces fake math mode output; \isamarkupheader is now \section by
10139 default; see lib/texinputs/isabelle.sty etc.;
10144 * Isar/Pure: local results and corresponding term bindings are now
10145 subject to Hindley-Milner polymorphism (similar to ML); this
10146 accommodates incremental type-inference very nicely;
10148 * Isar/Pure: new derived language element 'obtain' supports
10149 generalized existence reasoning;
10151 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
10152 support accumulation of results, without applying any rules yet;
10153 useful to collect intermediate results without explicit name
10154 references, and for use with transitivity rules with more than 2
10157 * Isar/Pure: scalable support for case-analysis type proofs: new
10158 'case' language element refers to local contexts symbolically, as
10159 produced by certain proof methods; internally, case names are attached
10160 to theorems as "tags";
10162 * Isar/Pure: theory command 'hide' removes declarations from
10163 class/type/const name spaces;
10165 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
10166 indicate potential overloading;
10168 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
10170 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
10171 "{a,b,c}" instead of {a,b,c};
10173 * Isar/Pure now provides its own version of intro/elim/dest
10174 attributes; useful for building new logics, but beware of confusion
10175 with the version in Provers/classical;
10177 * Isar/Pure: the local context of (non-atomic) goals is provided via
10178 case name 'antecedent';
10180 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
10181 to the current context is now done automatically);
10183 * Isar/Pure: theory command 'method_setup' provides a simple interface
10184 for definining proof methods in ML;
10186 * Isar/Provers: intro/elim/dest attributes changed; renamed
10187 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
10188 most cases, one should have to change intro!! to intro? only);
10189 replaced "delrule" by "rule del";
10191 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
10192 'symmetric' attribute (the latter supercedes [RS sym]);
10194 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
10195 method modifier); 'simp' method: 'only:' modifier removes loopers as
10196 well (including splits);
10198 * Isar/Provers: Simplifier and Classical methods now support all kind
10199 of modifiers used in the past, including 'cong', 'iff', etc.
10201 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
10202 of Simplifier and Classical reasoner);
10204 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
10205 now support named cases; major packages (inductive, datatype, primrec,
10206 recdef) support case names and properly name parameters;
10208 * Isar/HOL: new transitivity rules for substitution in inequalities --
10209 monotonicity conditions are extracted to be proven at end of
10212 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
10215 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
10216 split_if split_if_asm; datatype package provides theorems foo.splits =
10217 foo.split foo.split_asm for each datatype;
10219 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
10220 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
10221 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
10222 use "(cases (simplified))" method in proper proof texts);
10224 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
10226 * Isar: names of theorems etc. may be natural numbers as well;
10228 * Isar: 'pr' command: optional arguments for goals_limit and
10229 ProofContext.prems_limit; no longer prints theory contexts, but only
10232 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
10233 additional print modes to be specified; e.g. "pr(latex)" will print
10234 proof state according to the Isabelle LaTeX style;
10236 * Isar: improved support for emulating tactic scripts, including proof
10237 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
10238 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
10239 (for HOL datatypes);
10241 * Isar: simplified (more robust) goal selection of proof methods: 1st
10242 goal, all goals, or explicit goal specifier (tactic emulation); thus
10243 'proof method scripts' have to be in depth-first order;
10245 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
10247 * Isar: removed 'help' command, which hasn't been too helpful anyway;
10248 should instead use individual commands for printing items
10249 (print_commands, print_methods etc.);
10251 * Isar: added 'nothing' --- the empty list of theorems;
10256 * HOL/MicroJava: formalization of a fragment of Java, together with a
10257 corresponding virtual machine and a specification of its bytecode
10258 verifier and a lightweight bytecode verifier, including proofs of
10259 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
10260 Cornelia Pusch (see also the homepage of project Bali at
10261 http://isabelle.in.tum.de/Bali/);
10263 * HOL/Algebra: new theory of rings and univariate polynomials, by
10266 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
10267 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
10270 * HOL/Lattice: fundamental concepts of lattice theory and order
10271 structures, including duals, properties of bounds versus algebraic
10272 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
10273 Theorem for complete lattices etc.; may also serve as a demonstration
10274 for abstract algebraic reasoning using axiomatic type classes, and
10275 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
10277 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
10280 * HOL/IMPP: extension of IMP with local variables and mutually
10281 recursive procedures, by David von Oheimb;
10283 * HOL/Lambda: converted into new-style theory and document;
10285 * HOL/ex/Multiquote: example of multiple nested quotations and
10286 anti-quotations -- basically a generalized version of de-Bruijn
10287 representation; very useful in avoiding lifting of operations;
10289 * HOL/record: added general record equality rule to simpset; fixed
10290 select-update simplification procedure to handle extended records as
10291 well; admit "r" as field name;
10293 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
10294 other numeric types and also as the identity of groups, rings, etc.;
10296 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
10297 Types nat and int belong to this axclass;
10299 * HOL: greatly improved simplification involving numerals of type nat, int, real:
10300 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
10301 i*j + k + j*#3*i simplifies to #4*(i*j) + k
10302 two terms #m*u and #n*u are replaced by #(m+n)*u
10303 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
10304 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
10305 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
10307 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
10308 powerful prover for predicate logic but knows nothing of clasets; see
10309 ex/mesontest.ML and ex/mesontest2.ML for example applications;
10311 * HOL: new version of "case_tac" subsumes both boolean case split and
10312 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
10313 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
10315 * HOL: simplification no longer dives into case-expressions: only the
10316 selector expression is simplified, but not the remaining arms; to
10317 enable full simplification of case-expressions for datatype t, you may
10318 remove t.weak_case_cong from the simpset, either globally (Delcongs
10319 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
10321 * HOL/recdef: the recursion equations generated by 'recdef' for
10322 function 'f' are now called f.simps instead of f.rules; if all
10323 termination conditions are proved automatically, these simplification
10324 rules are added to the simpset, as in primrec; rules may be named
10325 individually as well, resulting in a separate list of theorems for
10328 * HOL/While is a new theory that provides a while-combinator. It
10329 permits the definition of tail-recursive functions without the
10330 provision of a termination measure. The latter is necessary once the
10331 invariant proof rule for while is applied.
10333 * HOL: new (overloaded) notation for the set of elements below/above
10334 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
10336 * HOL: theorems impI, allI, ballI bound as "strip";
10338 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
10339 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
10340 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
10342 * HOL/Real: "rabs" replaced by overloaded "abs" function;
10344 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
10345 main HOL, but was unused);
10347 * HOL: fewer consts declared as global (e.g. have to refer to
10348 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
10350 * HOL: tuned AST representation of nested pairs, avoiding bogus output
10351 in case of overlap with user translations (e.g. judgements over
10352 tuples); (note that the underlying logical represenation is still
10358 * ZF: simplification automatically cancels common terms in arithmetic
10359 expressions over nat and int;
10361 * ZF: new treatment of nat to minimize type-checking: all operators
10362 coerce their operands to a natural number using the function natify,
10363 making the algebraic laws unconditional;
10365 * ZF: as above, for int: operators coerce their operands to an integer
10366 using the function intify;
10368 * ZF: the integer library now contains many of the usual laws for the
10369 orderings, including $<=, and monotonicity laws for $+ and $*;
10371 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
10374 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
10375 to the simplifier and classical reasoner simultaneously;
10380 * Provers: blast_tac now handles actual object-logic rules as
10381 assumptions; note that auto_tac uses blast_tac internally as well;
10383 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
10384 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
10386 * Provers: delrules now handles destruct rules as well (no longer need
10387 explicit make_elim);
10389 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
10390 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10391 use instead the strong form,
10392 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10393 in HOL, FOL and ZF the function cla_make_elim will create such rules
10394 from destruct-rules;
10396 * Provers: Simplifier.easy_setup provides a fast path to basic
10397 Simplifier setup for new object-logics;
10399 * Pure: AST translation rules no longer require constant head on LHS;
10401 * Pure: improved name spaces: ambiguous output is qualified; support
10402 for hiding of names;
10404 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
10405 XSYMBOL_HOME; no longer need to do manual configuration in most
10408 * system: compression of ML heaps images may now be controlled via -c
10409 option of isabelle and isatool usedir (currently only observed by
10412 * system: isatool installfonts may handle X-Symbol fonts as well (very
10413 useful for remote X11);
10415 * system: provide TAGS file for Isabelle sources;
10417 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
10420 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
10421 timing flag supersedes proof_timing and Toplevel.trace;
10423 * ML: new combinators |>> and |>>> for incremental transformations
10424 with secondary results (e.g. certain theory extensions):
10426 * ML: PureThy.add_defs gets additional argument to indicate potential
10427 overloading (usually false);
10429 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
10434 New in Isabelle99 (October 1999)
10435 --------------------------------
10437 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10439 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
10440 are no longer simplified. (This allows the simplifier to unfold recursive
10441 functional programs.) To restore the old behaviour, declare
10443 Delcongs [if_weak_cong];
10445 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
10448 * HOL: the predicate "inj" is now defined by translation to "inj_on";
10450 * HOL/datatype: mutual_induct_tac no longer exists --
10451 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
10453 * HOL/typedef: fixed type inference for representing set; type
10454 arguments now have to occur explicitly on the rhs as type constraints;
10456 * ZF: The con_defs part of an inductive definition may no longer refer
10457 to constants declared in the same theory;
10459 * HOL, ZF: the function mk_cases, generated by the inductive
10460 definition package, has lost an argument. To simplify its result, it
10461 uses the default simpset instead of a supplied list of theorems.
10463 * HOL/List: the constructors of type list are now Nil and Cons;
10465 * Simplifier: the type of the infix ML functions
10466 setSSolver addSSolver setSolver addSolver
10467 is now simpset * solver -> simpset where `solver' is a new abstract type
10468 for packaging solvers. A solver is created via
10469 mk_solver: string -> (thm list -> int -> tactic) -> solver
10470 where the string argument is only a comment.
10473 *** Proof tools ***
10475 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
10476 decision procedure for linear arithmetic. Currently it is used for
10477 types `nat', `int', and `real' in HOL (see below); it can, should and
10478 will be instantiated for other types and logics as well.
10480 * The simplifier now accepts rewrite rules with flexible heads, eg
10481 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
10482 They are applied like any rule with a non-pattern lhs, i.e. by first-order
10488 * New Isabelle/Isar subsystem provides an alternative to traditional
10489 tactical theorem proving; together with the ProofGeneral/isar user
10490 interface it offers an interactive environment for developing human
10491 readable proof documents (Isar == Intelligible semi-automated
10492 reasoning); for further information see isatool doc isar-ref,
10493 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
10495 * improved and simplified presentation of theories: better HTML markup
10496 (including colors), graph views in several sizes; isatool usedir now
10497 provides a proper interface for user theories (via -P option); actual
10498 document preparation based on (PDF)LaTeX is available as well (for
10499 new-style theories only); see isatool doc system for more information;
10501 * native support for Proof General, both for classic Isabelle and
10504 * ML function thm_deps visualizes dependencies of theorems and lemmas,
10505 using the graph browser tool;
10507 * Isabelle manuals now also available as PDF;
10509 * theory loader rewritten from scratch (may not be fully
10510 bug-compatible); old loadpath variable has been replaced by show_path,
10511 add_path, del_path, reset_path functions; new operations such as
10512 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
10515 * improved isatool install: option -k creates KDE application icon,
10516 option -p DIR installs standalone binaries;
10518 * added ML_PLATFORM setting (useful for cross-platform installations);
10519 more robust handling of platform specific ML images for SML/NJ;
10521 * the settings environment is now statically scoped, i.e. it is never
10522 created again in sub-processes invoked from isabelle, isatool, or
10525 * path element specification '~~' refers to '$ISABELLE_HOME';
10527 * in locales, the "assumes" and "defines" parts may be omitted if
10530 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
10533 * new print_mode "HTML";
10535 * new flag show_tags controls display of tags of theorems (which are
10536 basically just comments that may be attached by some tools);
10538 * Isamode 2.6 requires patch to accomodate change of Isabelle font
10539 mode and goal output format:
10541 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
10543 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
10545 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
10546 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
10548 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
10550 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
10552 * function bind_thms stores lists of theorems (cf. bind_thm);
10554 * new shorthand tactics ftac, eatac, datac, fatac;
10556 * qed (and friends) now accept "" as result name; in that case the
10557 theorem is not stored, but proper checks and presentation of the
10558 result still apply;
10560 * theorem database now also indexes constants "Trueprop", "all",
10561 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
10566 ** HOL arithmetic **
10568 * There are now decision procedures for linear arithmetic over nat and
10571 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
10572 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
10573 are treated as atomic; subformulae not involving type `nat' or `int'
10574 are ignored; quantified subformulae are ignored unless they are
10575 positive universal or negative existential. The tactic has to be
10576 invoked by hand and can be a little bit slow. In particular, the
10577 running time is exponential in the number of occurrences of `min' and
10578 `max', and `-' on `nat'.
10580 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
10581 (negated) (in)equalities among the premises and the conclusion into
10582 account (i.e. no compound formulae) and does not know about `min' and
10583 `max', and `-' on `nat'. It is fast and is used automatically by the
10586 NB: At the moment, these decision procedures do not cope with mixed
10587 nat/int formulae where the two parts interact, such as `m < n ==>
10590 * HOL/Numeral provides a generic theory of numerals (encoded
10591 efficiently as bit strings); setup for types nat/int/real is in place;
10592 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
10593 int, existing theories and proof scripts may require a few additional
10596 * integer division and remainder can now be performed on constant
10599 * many properties of integer multiplication, division and remainder
10602 * An interface to the Stanford Validity Checker (SVC) is available through the
10603 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
10604 are proved automatically. SVC must be installed separately, and its results
10605 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
10606 invocation of the underlying oracle). For SVC see
10607 http://verify.stanford.edu/SVC
10609 * IsaMakefile: the HOL-Real target now builds an actual image;
10614 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
10615 (in Isabelle/Isar) -- by Gertrud Bauer;
10617 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
10618 analysis for assembly languages with subtypes;
10620 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
10621 -- avoids syntactic ambiguities and treats state, transition, and
10622 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
10623 changed syntax and (many) tactics;
10625 * HOL/inductive: Now also handles more general introduction rules such
10626 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
10627 theorems are now maintained within the theory (maintained via the
10630 * HOL/datatype: Now also handles arbitrarily branching datatypes
10631 (using function types) such as
10633 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
10635 * HOL/record: record_simproc (part of the default simpset) takes care
10636 of selectors applied to updated records; record_split_tac is no longer
10637 part of the default claset; update_defs may now be removed from the
10638 simpset in many cases; COMPATIBILITY: old behavior achieved by
10640 claset_ref () := claset() addSWrapper record_split_wrapper;
10641 Delsimprocs [record_simproc]
10643 * HOL/typedef: fixed type inference for representing set; type
10644 arguments now have to occur explicitly on the rhs as type constraints;
10646 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
10647 names rather than an ML expression;
10649 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
10650 supplied later. Program schemes can be defined, such as
10651 "While B C s = (if B s then While B C (C s) else s)"
10652 where the well-founded relation can be chosen after B and C have been given.
10654 * HOL/List: the constructors of type list are now Nil and Cons;
10655 INCOMPATIBILITY: while [] and infix # syntax is still there, of
10656 course, ML tools referring to List.list.op # etc. have to be adapted;
10658 * HOL_quantifiers flag superseded by "HOL" print mode, which is
10659 disabled by default; run isabelle with option -m HOL to get back to
10660 the original Gordon/HOL-style output;
10662 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
10663 ALL x<=y. P, EX x<y. P, EX x<=y. P;
10665 * HOL basic syntax simplified (more orthogonal): all variants of
10666 All/Ex now support plain / symbolic / HOL notation; plain syntax for
10667 Eps operator is provided as well: "SOME x. P[x]";
10669 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
10671 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
10672 thus available for user theories;
10674 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
10675 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
10678 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
10679 several times and then mp;
10684 * the notation <<...>> is now available as a notation for sequences of
10687 * the simplifier is now installed
10689 * the axiom system has been generalized (thanks to Soren Heilmann)
10691 * the classical reasoner now has a default rule database
10696 * new primrec section allows primitive recursive functions to be given
10697 directly (as in HOL) over datatypes and the natural numbers;
10699 * new tactics induct_tac and exhaust_tac for induction (or case
10700 analysis) over datatypes and the natural numbers;
10702 * the datatype declaration of type T now defines the recursor T_rec;
10704 * simplification automatically does freeness reasoning for datatype
10707 * automatic type-inference, with AddTCs command to insert new
10708 type-checking rules;
10710 * datatype introduction rules are now added as Safe Introduction rules
10713 * the syntax "if P then x else y" is now available in addition to
10717 *** Internal programming interfaces ***
10719 * tuned simplifier trace output; new flag debug_simp;
10721 * structures Vartab / Termtab (instances of TableFun) offer efficient
10722 tables indexed by indexname_ord / term_ord (compatible with aconv);
10724 * AxClass.axclass_tac lost the theory argument;
10726 * tuned current_goals_markers semantics: begin / end goal avoids
10727 printing empty lines;
10729 * removed prs and prs_fn hook, which was broken because it did not
10730 include \n in its semantics, forcing writeln to add one
10731 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
10732 string -> unit if you really want to output text without newline;
10734 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
10735 plain output, interface builders may have to enable 'isabelle_font'
10736 mode to get Isabelle font glyphs as before;
10738 * refined token_translation interface; INCOMPATIBILITY: output length
10739 now of type real instead of int;
10741 * theory loader actions may be traced via new ThyInfo.add_hook
10742 interface (see src/Pure/Thy/thy_info.ML); example application: keep
10743 your own database of information attached to *whole* theories -- as
10744 opposed to intra-theory data slots offered via TheoryDataFun;
10746 * proper handling of dangling sort hypotheses (at last!);
10747 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
10748 extra sort hypotheses that can be witnessed from the type signature;
10749 the force_strip_shyps flag is gone, any remaining shyps are simply
10750 left in the theorem (with a warning issued by strip_shyps_warning);
10754 New in Isabelle98-1 (October 1998)
10755 ----------------------------------
10757 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10759 * several changes of automated proof tools;
10761 * HOL: major changes to the inductive and datatype packages, including
10762 some minor incompatibilities of theory syntax;
10764 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
10767 * HOL: removed duplicate thms in Arith:
10768 less_imp_add_less should be replaced by trans_less_add1
10769 le_imp_add_le should be replaced by trans_le_add1
10771 * HOL: unary minus is now overloaded (new type constraints may be
10774 * HOL and ZF: unary minus for integers is now #- instead of #~. In
10775 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
10776 now taken as an integer constant.
10778 * Pure: ML function 'theory_of' renamed to 'theory';
10781 *** Proof tools ***
10784 1. Asm_full_simp_tac is now more aggressive.
10785 1. It will sometimes reorient premises if that increases their power to
10787 2. It does no longer proceed strictly from left to right but may also
10788 rotate premises to achieve further simplification.
10789 For compatibility reasons there is now Asm_lr_simp_tac which is like the
10790 old Asm_full_simp_tac in that it does not rotate premises.
10791 2. The simplifier now knows a little bit about nat-arithmetic.
10793 * Classical reasoner: wrapper mechanism for the classical reasoner now
10794 allows for selected deletion of wrappers, by introduction of names for
10795 wrapper functionals. This implies that addbefore, addSbefore,
10796 addaltern, and addSaltern now take a pair (name, tactic) as argument,
10797 and that adding two tactics with the same name overwrites the first
10798 one (emitting a warning).
10799 type wrapper = (int -> tactic) -> (int -> tactic)
10800 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
10801 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
10802 delWrapper, delSWrapper: claset * string -> claset
10803 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
10805 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
10806 semantics; addbefore now affects only the unsafe part of step_tac
10807 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
10808 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
10811 * Classical reasoner: setwrapper to setWrapper and compwrapper to
10812 compWrapper; added safe wrapper (and access functions for it);
10814 * HOL/split_all_tac is now much faster and fails if there is nothing
10815 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
10816 and the names of the automatically generated variables have changed.
10817 split_all_tac has moved within claset() from unsafe wrappers to safe
10818 wrappers, which means that !!-bound variables are split much more
10819 aggressively, and safe_tac and clarify_tac now split such variables.
10820 If this splitting is not appropriate, use delSWrapper "split_all_tac".
10821 Note: the same holds for record_split_tac, which does the job of
10822 split_all_tac for record fields.
10824 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
10825 permanently to the default simpset using Addsplits just like
10826 Addsimps. They can be removed via Delsplits just like
10827 Delsimps. Lower-case versions are also available.
10829 * HOL/Simplifier: The rule split_if is now part of the default
10830 simpset. This means that the simplifier will eliminate all occurrences
10831 of if-then-else in the conclusion of a goal. To prevent this, you can
10832 either remove split_if completely from the default simpset by
10833 `Delsplits [split_if]' or remove it in a specific call of the
10834 simplifier using `... delsplits [split_if]'. You can also add/delete
10835 other case splitting rules to/from the default simpset: every datatype
10836 generates suitable rules `split_t_case' and `split_t_case_asm' (where
10837 t is the name of the datatype).
10839 * Classical reasoner / Simplifier combination: new force_tac (and
10840 derivatives Force_tac, force) combines rewriting and classical
10841 reasoning (and whatever other tools) similarly to auto_tac, but is
10842 aimed to solve the given subgoal completely.
10847 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
10848 and `goalw': the theory is no longer needed as an explicit argument -
10849 the current theory context is used; assumptions are no longer returned
10850 at the ML-level unless one of them starts with ==> or !!; it is
10851 recommended to convert to these new commands using isatool fixgoal
10852 (backup your sources first!);
10854 * new top-level commands 'thm' and 'thms' for retrieving theorems from
10855 the current theory context, and 'theory' to lookup stored theories;
10857 * new theory section 'locale' for declaring constants, assumptions and
10858 definitions that have local scope;
10860 * new theory section 'nonterminals' for purely syntactic types;
10862 * new theory section 'setup' for generic ML setup functions
10863 (e.g. package initialization);
10865 * the distribution now includes Isabelle icons: see
10866 lib/logo/isabelle-{small,tiny}.xpm;
10868 * isatool install - install binaries with absolute references to
10871 * isatool logo -- create instances of the Isabelle logo (as EPS);
10873 * print mode 'emacs' reserved for Isamode;
10875 * support multiple print (ast) translations per constant name;
10877 * theorems involving oracles are now printed with a suffixed [!];
10882 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
10884 * HOL/inductive package reorganized and improved: now supports mutual
10885 definitions such as
10890 oddI "n : EVEN ==> Suc n : ODD"
10891 evenI "n : ODD ==> Suc n : EVEN"
10893 new theorem list "elims" contains an elimination rule for each of the
10894 recursive sets; inductive definitions now handle disjunctive premises
10895 correctly (also ZF);
10897 INCOMPATIBILITIES: requires Inductive as an ancestor; component
10898 "mutual_induct" no longer exists - the induction rule is always
10899 contained in "induct";
10902 * HOL/datatype package re-implemented and greatly improved: now
10903 supports mutually recursive datatypes such as
10906 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
10907 | SUM ('a aexp) ('a aexp)
10908 | DIFF ('a aexp) ('a aexp)
10911 'a bexp = LESS ('a aexp) ('a aexp)
10912 | AND ('a bexp) ('a bexp)
10913 | OR ('a bexp) ('a bexp)
10915 as well as indirectly recursive datatypes such as
10918 ('a, 'b) term = Var 'a
10919 | App 'b ((('a, 'b) term) list)
10921 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
10922 induction on mutually / indirectly recursive datatypes.
10924 Primrec equations are now stored in theory and can be accessed via
10925 <function_name>.simps.
10929 - Theories using datatypes must now have theory Datatype as an
10931 - The specific <typename>.induct_tac no longer exists - use the
10932 generic induct_tac instead.
10933 - natE has been renamed to nat.exhaust - use exhaust_tac
10934 instead of res_inst_tac ... natE. Note that the variable
10935 names in nat.exhaust differ from the names in natE, this
10936 may cause some "fragile" proofs to fail.
10937 - The theorems split_<typename>_case and split_<typename>_case_asm
10938 have been renamed to <typename>.split and <typename>.split_asm.
10939 - Since default sorts of type variables are now handled correctly,
10940 some datatype definitions may have to be annotated with explicit
10942 - Primrec definitions no longer require function name and type
10943 of recursive argument.
10945 Consider using isatool fixdatatype to adapt your theories and proof
10946 scripts to the new package (backup your sources first!).
10949 * HOL/record package: considerably improved implementation; now
10950 includes concrete syntax for record types, terms, updates; theorems
10951 for surjective pairing and splitting !!-bound record variables; proof
10952 support is as follows:
10954 1) standard conversions (selectors or updates applied to record
10955 constructor terms) are part of the standard simpset;
10957 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
10958 made part of standard simpset and claset via addIffs;
10960 3) a tactic for record field splitting (record_split_tac) is part of
10961 the standard claset (addSWrapper);
10963 To get a better idea about these rules you may retrieve them via
10964 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
10965 the name of your record type.
10967 The split tactic 3) conceptually simplifies by the following rule:
10969 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
10971 Thus any record variable that is bound by meta-all will automatically
10972 blow up into some record constructor term, consequently the
10973 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
10974 solve record problems automatically.
10977 * reorganized the main HOL image: HOL/Integ and String loaded by
10978 default; theory Main includes everything;
10980 * automatic simplification of integer sums and comparisons, using cancellation;
10982 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
10984 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
10986 * many new identities for unions, intersections, set difference, etc.;
10988 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
10989 called split_if, split_split, split_sum_case and split_nat_case (to go
10990 with add/delsplits);
10992 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
10993 (?x::unit) = (); this is made part of the default simpset, which COULD
10994 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
10995 'Delsimprocs [unit_eq_proc];' as last resort); also note that
10996 unit_abs_eta_conv is added in order to counter the effect of
10997 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
11000 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
11003 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
11004 It and 'sym RS equals0D' are now in the default claset, giving automatic
11005 disjointness reasoning but breaking a few old proofs.
11007 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
11008 to 'converse' from 'inverse' (for compatibility with ZF and some
11011 * HOL/recdef can now declare non-recursive functions, with {} supplied as
11012 the well-founded relation;
11014 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
11015 Compl A. The "Compl" syntax remains available as input syntax for this
11018 * HOL/Update: new theory of function updates:
11019 f(a:=b) == %x. if x=a then b else f x
11020 may also be iterated as in f(a:=b,c:=d,...);
11022 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
11025 - new function list_update written xs[i:=v] that updates the i-th
11026 list position. May also be iterated as in xs[i:=a,j:=b,...].
11027 - new function `upt' written [i..j(] which generates the list
11028 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
11029 bound write [i..j], which is a shorthand for [i..j+1(].
11030 - new lexicographic orderings and corresponding wellfoundedness theorems.
11033 - removed 'pred' (predecessor) function;
11034 - generalized some theorems about n-1;
11035 - many new laws about "div" and "mod";
11036 - new laws about greatest common divisors (see theory ex/Primes);
11038 * HOL/Relation: renamed the relational operator r^-1 "converse"
11039 instead of "inverse";
11041 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
11042 of the multiset ordering;
11044 * directory HOL/Real: a construction of the reals using Dedekind cuts
11045 (not included by default);
11047 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
11049 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
11050 programs, i.e. different program variables may have different types.
11052 * calling (stac rew i) now fails if "rew" has no effect on the goal
11053 [previously, this check worked only if the rewrite rule was unconditional]
11054 Now rew can involve either definitions or equalities (either == or =).
11059 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
11060 only the theorems proved on ZF.ML;
11062 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
11063 It and 'sym RS equals0D' are now in the default claset, giving automatic
11064 disjointness reasoning but breaking a few old proofs.
11066 * ZF/Update: new theory of function updates
11067 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
11068 may also be iterated as in f(a:=b,c:=d,...);
11070 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
11072 * calling (stac rew i) now fails if "rew" has no effect on the goal
11073 [previously, this check worked only if the rewrite rule was unconditional]
11074 Now rew can involve either definitions or equalities (either == or =).
11076 * case_tac provided for compatibility with HOL
11077 (like the old excluded_middle_tac, but with subgoals swapped)
11080 *** Internal programming interfaces ***
11082 * Pure: several new basic modules made available for general use, see
11083 also src/Pure/README;
11085 * improved the theory data mechanism to support encapsulation (data
11086 kind name replaced by private Object.kind, acting as authorization
11087 key); new type-safe user interface via functor TheoryDataFun; generic
11088 print_data function becomes basically useless;
11090 * removed global_names compatibility flag -- all theory declarations
11091 are qualified by default;
11093 * module Pure/Syntax now offers quote / antiquote translation
11094 functions (useful for Hoare logic etc. with implicit dependencies);
11095 see HOL/ex/Antiquote for an example use;
11097 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
11100 * new tactical CHANGED_GOAL for checking that a tactic modifies a
11103 * Display.print_goals function moved to Locale.print_goals;
11105 * standard print function for goals supports current_goals_markers
11106 variable for marking begin of proof, end of proof, start of goal; the
11107 default is ("", "", ""); setting current_goals_markers := ("<proof>",
11108 "</proof>", "<goal>") causes SGML like tagged proof state printing,
11113 New in Isabelle98 (January 1998)
11114 --------------------------------
11116 *** Overview of INCOMPATIBILITIES (see below for more details) ***
11118 * changed lexical syntax of terms / types: dots made part of long
11119 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
11121 * simpset (and claset) reference variable replaced by functions
11122 simpset / simpset_ref;
11124 * no longer supports theory aliases (via merge) and non-trivial
11125 implicit merge of thms' signatures;
11127 * most internal names of constants changed due to qualified names;
11129 * changed Pure/Sequence interface (see Pure/seq.ML);
11132 *** General Changes ***
11134 * hierachically structured name spaces (for consts, types, axms, thms
11135 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
11136 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
11137 isatool fixdots ensures space after dots (e.g. "%x. x"); set
11138 long_names for fully qualified output names; NOTE: ML programs
11139 (special tactics, packages etc.) referring to internal names may have
11140 to be adapted to cope with fully qualified names; in case of severe
11141 backward campatibility problems try setting 'global_names' at compile
11142 time to have enrything declared within a flat name space; one may also
11143 fine tune name declarations in theories via the 'global' and 'local'
11146 * reimplemented the implicit simpset and claset using the new anytype
11147 data filed in signatures; references simpset:simpset ref etc. are
11148 replaced by functions simpset:unit->simpset and
11149 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
11150 to patch your ML files accordingly;
11152 * HTML output now includes theory graph data for display with Java
11153 applet or isatool browser; data generated automatically via isatool
11154 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
11156 * defs may now be conditional; improved rewrite_goals_tac to handle
11157 conditional equations;
11159 * defs now admits additional type arguments, using TYPE('a) syntax;
11161 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
11162 creates a new theory node; implicit merge of thms' signatures is
11163 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
11164 transfer:theory->thm->thm in (rare) cases;
11166 * improved handling of draft signatures / theories; draft thms (and
11167 ctyps, cterms) are automatically promoted to real ones;
11169 * slightly changed interfaces for oracles: admit many per theory, named
11170 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
11172 * print_goals: optional output of const types (set show_consts and
11175 * improved output of warnings (###) and errors (***);
11177 * subgoal_tac displays a warning if the new subgoal has type variables;
11179 * removed old README and Makefiles;
11181 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
11183 * removed obsolete init_pps and init_database;
11185 * deleted the obsolete tactical STATE, which was declared by
11186 fun STATE tacfun st = tacfun st st;
11188 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
11189 (which abbreviates $HOME);
11191 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
11192 use isatool fixseq to adapt your ML programs (this works for fully
11193 qualified references to the Sequence structure only!);
11195 * use_thy no longer requires writable current directory; it always
11196 reloads .ML *and* .thy file, if either one is out of date;
11199 *** Classical Reasoner ***
11201 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
11202 tactics that use classical reasoning to simplify a subgoal without
11203 splitting it into several subgoals;
11205 * Safe_tac: like safe_tac but uses the default claset;
11210 * added simplification meta rules:
11211 (asm_)(full_)simplify: simpset -> thm -> thm;
11213 * simplifier.ML no longer part of Pure -- has to be loaded by object
11216 * added prems argument to simplification procedures;
11218 * HOL, FOL, ZF: added infix function `addsplits':
11219 instead of `<simpset> setloop (split_tac <thms>)'
11220 you can simply write `<simpset> addsplits <thms>'
11225 * TYPE('a) syntax for type reflection terms;
11227 * no longer handles consts with name "" -- declare as 'syntax' instead;
11229 * pretty printer: changed order of mixfix annotation preference (again!);
11231 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
11236 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
11237 with `addloop' of the simplifier to faciliate case splitting in premises.
11239 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
11241 * HOL/Auth: new protocol proofs including some for the Internet
11244 * HOL/Map: new theory of `maps' a la VDM;
11246 * HOL/simplifier: simplification procedures nat_cancel_sums for
11247 cancelling out common nat summands from =, <, <= (in)equalities, or
11248 differences; simplification procedures nat_cancel_factor for
11249 cancelling common factor from =, <, <= (in)equalities over natural
11250 sums; nat_cancel contains both kinds of procedures, it is installed by
11251 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
11253 * HOL/simplifier: terms of the form
11254 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
11256 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
11257 and those of the form
11258 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
11260 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
11263 Each datatype `t' now comes with a theorem `split_t_case' of the form
11265 P(t_case f1 ... fn x) =
11266 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
11268 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
11271 and a theorem `split_t_case_asm' of the form
11273 P(t_case f1 ... fn x) =
11274 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
11276 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
11278 which can be added to a simpset via `addsplits'. The existing theorems
11279 expand_list_case and expand_option_case have been renamed to
11280 split_list_case and split_option_case.
11283 - `pred n' is automatically converted to `n-1'.
11284 Users are strongly encouraged not to use `pred' any longer,
11285 because it will disappear altogether at some point.
11286 - Users are strongly encouraged to write "0 < n" rather than
11287 "n ~= 0". Theorems and proof tools have been modified towards this
11291 the function "set_of_list" has been renamed "set" (and its theorems too);
11292 the function "nth" now takes its arguments in the reverse order and
11293 has acquired the infix notation "!" as in "xs!n".
11295 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
11297 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
11298 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
11300 * HOL/record: extensible records with schematic structural subtyping
11301 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
11302 still lacks various theorems and concrete record syntax;
11307 * removed "axioms" and "generated by" sections;
11309 * replaced "ops" section by extended "consts" section, which is capable of
11310 handling the continuous function space "->" directly;
11313 . proves theorems immediately and stores them in the theory,
11314 . creates hierachical name space,
11315 . now uses normal mixfix annotations (instead of cinfix...),
11316 . minor changes to some names and values (for consistency),
11317 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
11318 . separator between mutual domain defs: changed "," to "and",
11319 . improved handling of sort constraints; now they have to
11320 appear on the left-hand side of the equations only;
11322 * fixed LAM <x,y,zs>.b syntax;
11324 * added extended adm_tac to simplifier in HOLCF -- can now discharge
11325 adm (%x. P (t x)), where P is chainfinite and t continuous;
11330 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
11331 with `addloop' of the simplifier to faciliate case splitting in premises.
11333 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
11334 in HOL, they strip ALL and --> from proved theorems;
11338 New in Isabelle94-8 (May 1997)
11339 ------------------------------
11341 *** General Changes ***
11343 * new utilities to build / run / maintain Isabelle etc. (in parts
11344 still somewhat experimental); old Makefiles etc. still functional;
11346 * new 'Isabelle System Manual';
11348 * INSTALL text, together with ./configure and ./build scripts;
11350 * reimplemented type inference for greater efficiency, better error
11351 messages and clean internal interface;
11353 * prlim command for dealing with lots of subgoals (an easier way of
11354 setting goals_limit);
11359 * supports alternative (named) syntax tables (parser and pretty
11360 printer); internal interface is provided by add_modesyntax(_i);
11362 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
11363 be used in conjunction with the Isabelle symbol font; uses the
11364 "symbols" syntax table;
11366 * added token_translation interface (may translate name tokens in
11367 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
11368 the current print_mode); IMPORTANT: user print translation functions
11369 are responsible for marking newly introduced bounds
11370 (Syntax.mark_boundT);
11372 * token translations for modes "xterm" and "xterm_color" that display
11373 names in bold, underline etc. or colors (which requires a color
11376 * infixes may now be declared with names independent of their syntax;
11378 * added typed_print_translation (like print_translation, but may
11379 access type of constant);
11382 *** Classical Reasoner ***
11384 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
11385 some limitations. Blast_tac...
11386 + ignores addss, addbefore, addafter; this restriction is intrinsic
11387 + ignores elimination rules that don't have the correct format
11388 (the conclusion MUST be a formula variable)
11389 + ignores types, which can make HOL proofs fail
11390 + rules must not require higher-order unification, e.g. apply_type in ZF
11391 [message "Function Var's argument not a bound variable" relates to this]
11392 + its proof strategy is more general but can actually be slower
11394 * substitution with equality assumptions no longer permutes other
11397 * minor changes in semantics of addafter (now called addaltern); renamed
11398 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
11399 (and access functions for it);
11401 * improved combination of classical reasoner and simplifier:
11402 + functions for handling clasimpsets
11403 + improvement of addss: now the simplifier is called _after_ the
11405 + safe variant of addss called addSss: uses safe simplifications
11406 _during_ the safe steps. It is more complete as it allows multiple
11407 instantiations of unknowns (e.g. with slow_tac).
11411 * added interface for simplification procedures (functions that
11412 produce *proven* rewrite rules on the fly, depending on current
11415 * ordering on terms as parameter (used for ordered rewriting);
11417 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
11419 * the solver is now split into a safe and an unsafe part.
11420 This should be invisible for the normal user, except that the
11421 functions setsolver and addsolver have been renamed to setSolver and
11422 addSolver; added safe_asm_full_simp_tac;
11427 * a generic induction tactic `induct_tac' which works for all datatypes and
11428 also for type `nat';
11430 * a generic case distinction tactic `exhaust_tac' which works for all
11431 datatypes and also for type `nat';
11433 * each datatype comes with a function `size';
11435 * patterns in case expressions allow tuple patterns as arguments to
11436 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
11438 * primrec now also works with type nat;
11440 * recdef: a new declaration form, allows general recursive functions to be
11441 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
11443 * the constant for negation has been renamed from "not" to "Not" to
11444 harmonize with FOL, ZF, LK, etc.;
11446 * HOL/ex/LFilter theory of a corecursive "filter" functional for
11449 * HOL/Modelcheck demonstrates invocation of model checker oracle;
11451 * HOL/ex/Ring.thy declares cring_simp, which solves equational
11452 problems in commutative rings, using axiomatic type classes for + and *;
11454 * more examples in HOL/MiniML and HOL/Auth;
11456 * more default rewrite rules for quantifiers, union/intersection;
11458 * a new constant `arbitrary == @x.False';
11460 * HOLCF/IOA replaces old HOL/IOA;
11462 * HOLCF changes: derived all rules and arities
11463 + axiomatic type classes instead of classes
11464 + typedef instead of faking type definitions
11465 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
11466 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
11467 + eliminated the types void, one, tr
11468 + use unit lift and bool lift (with translations) instead of one and tr
11469 + eliminated blift from Lift3.thy (use Def instead of blift)
11470 all eliminated rules are derived as theorems --> no visible changes ;
11475 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
11476 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
11477 as ZF_cs addSIs [equalityI];
11481 New in Isabelle94-7 (November 96)
11482 ---------------------------------
11484 * allowing negative levels (as offsets) in prlev and choplev;
11486 * super-linear speedup for large simplifications;
11488 * FOL, ZF and HOL now use miniscoping: rewriting pushes
11489 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
11490 FAIL); can suppress it using the command Delsimps (ex_simps @
11491 all_simps); De Morgan laws are also now included, by default;
11493 * improved printing of ==> : ~:
11495 * new object-logic "Sequents" adds linear logic, while replacing LK
11496 and Modal (thanks to Sara Kalvala);
11498 * HOL/Auth: correctness proofs for authentication protocols;
11500 * HOL: new auto_tac combines rewriting and classical reasoning (many
11501 examples on HOL/Auth);
11503 * HOL: new command AddIffs for declaring theorems of the form P=Q to
11504 the rewriter and classical reasoner simultaneously;
11506 * function uresult no longer returns theorems in "standard" format;
11507 regain previous version by: val uresult = standard o uresult;
11511 New in Isabelle94-6
11512 -------------------
11514 * oracles -- these establish an interface between Isabelle and trusted
11515 external reasoners, which may deliver results as theorems;
11517 * proof objects (in particular record all uses of oracles);
11519 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
11521 * "constdefs" section in theory files;
11523 * "primrec" section (HOL) no longer requires names;
11525 * internal type "tactic" now simply "thm -> thm Sequence.seq";
11529 New in Isabelle94-5
11530 -------------------
11532 * reduced space requirements;
11534 * automatic HTML generation from theories;
11536 * theory files no longer require "..." (quotes) around most types;
11538 * new examples, including two proofs of the Church-Rosser theorem;
11540 * non-curried (1994) version of HOL is no longer distributed;
11544 New in Isabelle94-4
11545 -------------------
11547 * greatly reduced space requirements;
11549 * theory files (.thy) no longer require \...\ escapes at line breaks;
11551 * searchable theorem database (see the section "Retrieving theorems" on
11552 page 8 of the Reference Manual);
11554 * new examples, including Grabczewski's monumental case study of the
11557 * The previous version of HOL renamed to Old_HOL;
11559 * The new version of HOL (previously called CHOL) uses a curried syntax
11560 for functions. Application looks like f a b instead of f(a,b);
11562 * Mutually recursive inductive definitions finally work in HOL;
11564 * In ZF, pattern-matching on tuples is now available in all abstractions and
11565 translates to the operator "split";
11569 New in Isabelle94-3
11570 -------------------
11572 * new infix operator, addss, allowing the classical reasoner to
11573 perform simplification at each step of its search. Example:
11574 fast_tac (cs addss ss)
11576 * a new logic, CHOL, the same as HOL, but with a curried syntax
11577 for functions. Application looks like f a b instead of f(a,b). Also pairs
11578 look like (a,b) instead of <a,b>;
11580 * PLEASE NOTE: CHOL will eventually replace HOL!
11582 * In CHOL, pattern-matching on tuples is now available in all abstractions.
11583 It translates to the operator "split". A new theory of integers is available;
11585 * In ZF, integer numerals now denote two's-complement binary integers.
11586 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
11588 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
11589 of the Axiom of Choice;
11593 New in Isabelle94-2
11594 -------------------
11596 * Significantly faster resolution;
11598 * the different sections in a .thy file can now be mixed and repeated
11601 * Database of theorems for FOL, HOL and ZF. New
11602 commands including qed, qed_goal and bind_thm store theorems in the database.
11604 * Simple database queries: return a named theorem (get_thm) or all theorems of
11605 a given theory (thms_of), or find out what theory a theorem was proved in
11608 * Bugs fixed in the inductive definition and datatype packages;
11610 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
11611 and HOL_dup_cs obsolete;
11613 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
11616 * Simpler definition of function space in ZF;
11618 * new results about cardinal and ordinal arithmetic in ZF;
11620 * 'subtype' facility in HOL for introducing new types as subsets of existing
11623 :mode=isabelle-news:wrap=hard:maxLineLen=72: