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 methods via ` (backquote), or << and >> (double angle
28 * The outer syntax categories "text" (for formal comments and document
29 markup commands) and "altstring" (for literal fact references) allow
30 cartouches as well, in addition to the traditional mix of quotations.
32 * More static checking of proof methods, which allows the system to
33 form a closure over the concrete syntax. Method arguments should be
34 processed in the original proof context as far as possible, before
35 operating on the goal state. In any case, the standard discipline for
36 subgoal-addressing needs to be observed: no subgoals or a subgoal
37 number that is out of range produces an empty result sequence, not an
38 exception. Potential INCOMPATIBILITY for non-conformant tactical
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. See also
45 ~~/src/Tools/SML/Examples.thy for some basic examples.
48 *** Prover IDE -- Isabelle/Scala/jEdit ***
50 * Improved syntactic and semantic completion mechanism:
52 - No completion for Isar keywords that have already been recognized
53 by the prover, e.g. ":" within accepted Isar syntax looses its
54 meaning as abbreviation for symbol "\<in>".
56 - Completion context provides information about embedded languages
57 of Isabelle: keywords are only completed for outer syntax, symbols
58 or antiquotations for languages that support them. E.g. no symbol
59 completion for ML source, but within ML strings, comments,
62 - Support for semantic completion based on failed name space lookup.
63 The error produced by the prover contains information about
64 alternative names that are accessible in a particular position.
65 This may be used with explicit completion (C+b) or implicit
66 completion after some delay.
68 - Semantic completions may get extended by appending a suffix of
69 underscores to an already recognized name, e.g. "foo_" to complete
70 "foo" or "foobar" if these are known in the context. The special
71 identifier "__" serves as a wild-card in this respect: it
72 completes to the full collection of names from the name space
73 (truncated according to the system option "completion_limit").
75 - Syntax completion of the editor and semantic completion of the
76 prover are merged. Since the latter requires a full round-trip of
77 document update to arrive, the default for option
78 jedit_completion_delay has been changed to 0.5s to improve the
81 - Option jedit_completion_immediate may now get used with
82 jedit_completion_delay > 0, to complete symbol abbreviations
83 aggressively while benefiting from combined syntactic and semantic
86 - Support for simple completion templates (with single
87 place-holder), e.g. "`" for text cartouche, or "@{" for
90 - Improved treatment of completion vs. various forms of jEdit text
91 selection (multiple selections, rectangular selections,
92 rectangular selection as "tall caret").
94 - More reliable treatment of GUI events vs. completion popups: avoid
95 loosing keystrokes with slow / remote graphics displays.
97 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.
98 Open text buffers take precedence over copies within the file-system.
100 * Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for
103 * Document panel: simplied interaction where every single mouse click
104 (re)opens document via desktop environment or as jEdit buffer.
106 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /
107 General") allows to specify additional print modes for the prover
108 process, without requiring old-fashioned command-line invocation of
109 "isabelle jedit -m MODE".
111 * New panel: Simplifier trace. Provides an interactive view of the
112 simplification process, enabled by the newly-introduced
113 "simplifier_trace" declaration.
115 * Support for Navigator plugin (with toolbar buttons).
117 * More support for remote files (e.g. http) using standard Java
118 networking operations instead of jEdit virtual file-systems.
123 * Basic constants of Pure use more conventional names and are always
124 qualified. Rare INCOMPATIBILITY, but with potentially serious
125 consequences, notably for tools in Isabelle/ML. The following
126 renaming needs to be applied:
132 dummy_pattern ~> Pure.dummy_pattern
134 Systematic porting works by using the following theory setup on a
135 *previous* Isabelle version to introduce the new name accesses for the
141 |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="
142 |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"
143 |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"
144 |> Sign.restore_naming thy
147 Thus ML antiquotations like @{const_name Pure.eq} may be used already.
148 Later the application is moved to the current Isabelle version, and
149 the auxiliary aliases are deleted.
151 * Low-level type-class commands 'classes', 'classrel', 'arities' have
152 been discontinued to avoid the danger of non-trivial axiomatization
153 that is not immediately visible. INCOMPATIBILITY, use regular
154 'instance' with proof. The required OFCLASS(...) theorem might be
155 postulated via 'axiomatization' beforehand, or the proof finished
156 trivially if the underlying class definition is made vacuous (without
157 any assumptions). See also Isabelle/ML operations
158 Axclass.axiomatize_class, Axclass.axiomatize_classrel,
159 Axclass.axiomatize_arity.
161 * Attributes "where" and "of" allow an optional context of local
162 variables ('for' declaration): these variables become schematic in the
163 instantiated theorem.
165 * Obsolete attribute "standard" has been discontinued (legacy since
166 Isabelle2012). Potential INCOMPATIBILITY, use explicit 'for' context
167 where instantiations with schematic variables are intended (for
168 declaration commands like 'lemmas' or attributes like "of"). The
169 following temporary definition may help to port old applications:
171 attribute_setup standard =
172 "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"
174 * More thorough check of proof context for goal statements and
175 attributed fact expressions (concerning background theory, declared
176 hyps). Potential INCOMPATIBILITY, tools need to observe standard
177 context discipline. See also Assumption.add_assumes and the more
178 primitive Thm.assume_hyps.
180 * Inner syntax token language allows regular quoted strings "..."
181 (only makes sense in practice, if outer syntax is delimited
187 * Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.
190 * Default congruence rules strong_INF_cong and strong_SUP_cong,
191 with simplifier implication in premises. Generalized and replace
192 former INT_cong, SUP_cong. INCOMPATIBILITY.
194 * Consolidated theorem names containing INFI and SUPR: have INF
195 and SUP instead uniformly. INCOMPATIBILITY.
197 * More aggressive normalization of expressions involving INF and Inf
198 or SUP and Sup. INCOMPATIBILITY.
200 * INF_image and SUP_image do not unfold composition.
203 * Swapped orientation of facts image_comp and vimage_comp:
204 image_compose ~> image_comp [symmetric]
205 image_comp ~> image_comp [symmetric]
206 vimage_compose ~> vimage_comp [symmetric]
207 vimage_comp ~> vimage_comp [symmetric]
210 * Simplifier: Enhanced solver of preconditions of rewrite rules
211 can now deal with conjunctions.
212 For help with converting proofs, the old behaviour of the simplifier
213 can be restored like this: declare/using [[simp_legacy_precond]]
214 This configuration option will disappear again in the future.
216 * Dropped facts INF_comp, SUP_comp. INCOMPATIBILITY.
219 * Abandoned fact collection "word_arith_alts", which is a
220 duplicate of "word_arith_wis".
221 * Dropped first (duplicated) element in fact collections
222 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",
223 "uint_word_arith_bintrs".
225 * Code generator: explicit proof contexts in many ML interfaces.
228 * Code generator: minimize exported identifiers by default.
229 Minor INCOMPATIBILITY.
231 * Code generation for SML and OCaml: dropped arcane "no_signatures" option.
232 Minor INCOMPATIBILITY.
234 * Simproc "finite_Collect" is no longer enabled by default, due to
235 spurious crashes and other surprises. Potential INCOMPATIBILITY.
237 * Moved new (co)datatype package and its dependencies from "HOL-BNF" to "HOL".
238 The "bnf", "wrap_free_constructors", "datatype_new", "codatatype",
239 "primcorec", and "primcorecursive" commands are now part of "Main".
241 FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)
242 Library/Wfrec.thy ~> Wfrec.thy
243 Library/Zorn.thy ~> Zorn.thy
244 Cardinals/Order_Relation.thy ~> Order_Relation.thy
245 Library/Order_Union.thy ~> Cardinals/Order_Union.thy
246 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy
247 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy
248 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy
249 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy
250 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy
251 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy
252 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy
253 BNF/BNF_Comp.thy ~> BNF_Comp.thy
254 BNF/BNF_Def.thy ~> BNF_Def.thy
255 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy
256 BNF/BNF_GFP.thy ~> BNF_GFP.thy
257 BNF/BNF_LFP.thy ~> BNF_LFP.thy
258 BNF/BNF_Util.thy ~> BNF_Util.thy
259 BNF/Coinduction.thy ~> Coinduction.thy
260 BNF/More_BNFs.thy ~> Library/More_BNFs.thy
261 BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy
262 BNF/Examples/* ~> BNF_Examples/*
264 Wellorder_Extension.thy (split from Zorn.thy)
265 Library/Cardinal_Notations.thy
267 BNF_Examples/Misc_Primcorec.thy
268 BNF_Examples/Stream_Processor.thy
269 Discontinued theories:
271 BNF/Equiv_Relations_More.thy
274 * New (co)datatype package:
275 * "primcorec" is fully implemented.
277 datatype_new_compat ~> datatype_compat
278 primrec_new ~> primrec
279 wrap_free_constructors ~> free_constructors
281 * The generated constants "xxx_case" and "xxx_rec" have been renamed
282 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
284 * The constant "xxx_(un)fold" and related theorems are no longer generated.
285 Use "xxx_(co)rec" or define "xxx_(un)fold" manually using "prim(co)rec".
288 * Old datatype package:
289 * The generated theorems "xxx.cases" and "xxx.recs" have been renamed
290 "xxx.case" and "xxx.rec" (e.g., "sum.cases" -> "sum.case").
292 * The generated constants "xxx_case" and "xxx_rec" have been renamed
293 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
296 * The types "'a list" and "'a option", their set and map functions, their
297 relators, and their selectors are now produced using the new BNF-based
300 Option.set ~> set_option
301 Option.map ~> map_option
302 option_rel ~> rel_option
303 option_rec ~> case_option
305 set_def ~> set_rec[abs_def]
306 map_def ~> map_rec[abs_def]
307 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")
308 option.recs ~> option.case
309 list_all2_def ~> list_all2_iff
310 set.simps ~> set_simps (or the slightly different "list.set")
311 map.simps ~> list.map
312 hd.simps ~> list.sel(1)
313 tl.simps ~> list.sel(2-3)
314 the.simps ~> option.sel
317 * The following map functions and relators have been renamed:
324 filter_rel ~> rel_filter
325 fset_rel ~> rel_fset (in "Library/FSet.thy")
326 cset_rel ~> rel_cset (in "Library/Countable_Set_Type.thy")
327 vset ~> rel_vset (in "Library/Quotient_Set.thy")
330 Cardinals/Ordinal_Arithmetic.thy
332 * Theory reorganizations:
333 * Big_Operators.thy ~> Groups_Big.thy and Lattices_Big.thy
336 * A new version of the SMT module, temporarily called "SMT2", uses SMT-LIB 2
337 and supports recent versions of Z3 (e.g., 4.3). The new proof method is
338 called "smt2", and the new Z3 is called "z3_new" in Sledgehammer and
342 - New prover "z3_new" with support for Isar proofs
346 isar_compress ~> compress_isar
347 isar_try0 ~> try0_isar
351 - Removed legacy proof method 'metisFT'. Use 'metis (full_types)' instead.
354 * Try0: Added 'algebra' and 'meson' to the set of proof methods.
356 * Command renaming: enriched_type ~> functor. INCOMPATIBILITY.
358 * The symbol "\<newline>" may be used within char or string literals
359 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
361 * Activation of Z3 now works via "z3_non_commercial" system option
362 (without requiring restart), instead of former settings variable
363 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu
364 Plugin Options / Isabelle / General.
366 * "declare [[code abort: ...]]" replaces "code_abort ...".
369 * "declare [[code drop: ...]]" drops all code equations associated
370 with the given constants.
372 * Abolished slightly odd global lattice interpretation for min/max.
375 min_max.inf_assoc ~> min.assoc
376 min_max.inf_commute ~> min.commute
377 min_max.inf_left_commute ~> min.left_commute
378 min_max.inf_idem ~> min.idem
379 min_max.inf_left_idem ~> min.left_idem
380 min_max.inf_right_idem ~> min.right_idem
381 min_max.sup_assoc ~> max.assoc
382 min_max.sup_commute ~> max.commute
383 min_max.sup_left_commute ~> max.left_commute
384 min_max.sup_idem ~> max.idem
385 min_max.sup_left_idem ~> max.left_idem
386 min_max.sup_inf_distrib1 ~> max_min_distrib2
387 min_max.sup_inf_distrib2 ~> max_min_distrib1
388 min_max.inf_sup_distrib1 ~> min_max_distrib2
389 min_max.inf_sup_distrib2 ~> min_max_distrib1
390 min_max.distrib ~> min_max_distribs
391 min_max.inf_absorb1 ~> min.absorb1
392 min_max.inf_absorb2 ~> min.absorb2
393 min_max.sup_absorb1 ~> max.absorb1
394 min_max.sup_absorb2 ~> max.absorb2
395 min_max.le_iff_inf ~> min.absorb_iff1
396 min_max.le_iff_sup ~> max.absorb_iff2
397 min_max.inf_le1 ~> min.cobounded1
398 min_max.inf_le2 ~> min.cobounded2
399 le_maxI1, min_max.sup_ge1 ~> max.cobounded1
400 le_maxI2, min_max.sup_ge2 ~> max.cobounded2
401 min_max.le_infI1 ~> min.coboundedI1
402 min_max.le_infI2 ~> min.coboundedI2
403 min_max.le_supI1 ~> max.coboundedI1
404 min_max.le_supI2 ~> max.coboundedI2
405 min_max.less_infI1 ~> min.strict_coboundedI1
406 min_max.less_infI2 ~> min.strict_coboundedI2
407 min_max.less_supI1 ~> max.strict_coboundedI1
408 min_max.less_supI2 ~> max.strict_coboundedI2
409 min_max.inf_mono ~> min.mono
410 min_max.sup_mono ~> max.mono
411 min_max.le_infI, min_max.inf_greatest ~> min.boundedI
412 min_max.le_supI, min_max.sup_least ~> max.boundedI
413 min_max.le_inf_iff ~> min.bounded_iff
414 min_max.le_sup_iff ~> max.bounded_iff
416 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
417 min.left_commute, min.left_idem, max.commute, max.assoc,
418 max.left_commute, max.left_idem directly.
420 For min_max.inf_sup_ord, prefer (one of) min.cobounded1, min.cobounded2,
421 max.cobounded1m max.cobounded2 directly.
423 For min_ac or max_ac, prefor more general collection ac_simps.
427 * Word library: bit representations prefer type bool over type bit.
430 * Theorem disambiguation Inf_le_Sup (on finite sets) ~> Inf_fin_le_Sup_fin.
433 * Code generations are provided for make, fields, extend and truncate
434 operations on records.
436 * Qualified constant names Wellfounded.acc, Wellfounded.accp.
439 * Fact generalization and consolidation:
440 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
443 * Purely algebraic definition of even. Fact generalization and consolidation:
444 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
445 even_zero_(nat|int) ~> even_zero
448 * Abolished neg_numeral.
449 * Canonical representation for minus one is "- 1".
450 * Canonical representation for other negative numbers is "- (numeral _)".
451 * When devising rule sets for number calculation, consider the
452 following canonical cases: 0, 1, numeral _, - 1, - numeral _.
453 * HOLogic.dest_number also recognizes numerals in non-canonical forms
454 like "numeral One", "- numeral One", "- 0" and even "- ... - _".
455 * Syntax for negative numerals is mere input syntax.
458 * Elimination of fact duplicates:
459 equals_zero_I ~> minus_unique
460 diff_eq_0_iff_eq ~> right_minus_eq
461 nat_infinite ~> infinite_UNIV_nat
462 int_infinite ~> infinite_UNIV_int
465 * Fact name consolidation:
466 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
467 minus_le_self_iff ~> neg_less_eq_nonneg
468 le_minus_self_iff ~> less_eq_neg_nonpos
469 neg_less_nonneg ~> neg_less_pos
470 less_minus_self_iff ~> less_neg_neg [simp]
473 * More simplification rules on unary and binary minus:
474 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
475 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
476 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
477 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
478 minus_add_cancel, uminus_add_conv_diff. These correspondingly
479 have been taken away from fact collections algebra_simps and
480 field_simps. INCOMPATIBILITY.
482 To restore proofs, the following patterns are helpful:
484 a) Arbitrary failing proof not involving "diff_def":
485 Consider simplification with algebra_simps or field_simps.
487 b) Lifting rules from addition to subtraction:
488 Try with "using <rule for addition> of [... "- _" ...]" by simp".
490 c) Simplification with "diff_def": just drop "diff_def".
491 Consider simplification with algebra_simps or field_simps;
492 or the brute way with
493 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
495 * SUP and INF generalized to conditionally_complete_lattice
497 * Theory Lubs moved HOL image to HOL-Library. It is replaced by
498 Conditionally_Complete_Lattices. INCOMPATIBILITY.
500 * Introduce bdd_above and bdd_below in Conditionally_Complete_Lattices, use them
501 instead of explicitly stating boundedness of sets.
503 * ccpo.admissible quantifies only over non-empty chains to allow
504 more syntax-directed proof rules; the case of the empty chain
505 shows up as additional case in fixpoint induction proofs.
508 * Removed and renamed theorems in Series:
509 summable_le ~> suminf_le
510 suminf_le ~> suminf_le_const
511 series_pos_le ~> setsum_le_suminf
512 series_pos_less ~> setsum_less_suminf
513 suminf_ge_zero ~> suminf_nonneg
514 suminf_gt_zero ~> suminf_pos
515 suminf_gt_zero_iff ~> suminf_pos_iff
516 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ
517 suminf_0_le ~> suminf_nonneg [rotate]
518 pos_summable ~> summableI_nonneg_bounded
519 ratio_test ~> summable_ratio_test
521 removed series_zero, replaced by sums_finite
523 removed auxiliary lemmas:
524 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,
525 half, le_Suc_ex_iff, lemma_realpow_diff_sumr, real_setsum_nat_ivl_bounded,
526 summable_le2, ratio_test_lemma2, sumr_minus_one_realpow_zerom,
527 sumr_one_lb_realpow_zero, summable_convergent_sumr_iff, sumr_diff_mult_const
530 * Replace (F)DERIV syntax by has_derivative:
531 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"
533 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"
535 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax
537 - removed constant isDiff
539 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as input
542 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed
544 - Renamed FDERIV_... lemmas to has_derivative_...
546 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV
548 - removed DERIV_intros, has_derivative_eq_intros
550 - introduced derivative_intros and deriative_eq_intros which includes now rules for
551 DERIV, has_derivative and has_vector_derivative.
554 differentiable_def ~> real_differentiable_def
555 differentiableE ~> real_differentiableE
556 fderiv_def ~> has_derivative_at
557 field_fderiv_def ~> field_has_derivative_at
558 isDiff_der ~> differentiable_def
559 deriv_fderiv ~> has_field_derivative_def
560 deriv_def ~> DERIV_def
563 * Include more theorems in continuous_intros. Remove the continuous_on_intros,
564 isCont_intros collections, these facts are now in continuous_intros.
566 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
569 - Fixed soundness bug whereby mutually recursive datatypes could take
571 - Fixed soundness bug with low-level number functions such as "Abs_Integ" and
573 - Removed "std" option.
574 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to
577 * HOL-Multivariate_Analysis:
578 - type class ordered_real_vector for ordered vector spaces
579 - changed order of ordered_euclidean_space to be compatible with
580 pointwise ordering on products. Therefore instance of
581 conditionally_complete_lattice and ordered_real_vector.
582 INCOMPATIBILITY: use box instead of greaterThanLessThan or
583 explicit set-comprehensions with eucl_less for other (half-) open
587 derivative_linear ~> has_derivative_bounded_linear
588 derivative_is_linear ~> has_derivative_linear
589 bounded_linear_imp_linear ~> bounded_linear.linear
594 * The signature and semantics of Document.Snapshot.cumulate_markup /
595 select_markup have been clarified. Markup is now traversed in the
596 order of reports given by the prover: later markup is usually more
597 specific and may override results accumulated so far. The elements
598 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.
603 * Moved ML_Compiler.exn_trace and other operations on exceptions to
604 structure Runtime. Minor INCOMPATIBILITY.
606 * Discontinued old Toplevel.debug in favour of system option
607 "ML_exception_trace", which may be also declared within the context via
608 "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.
610 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor
613 * Configuration option "ML_print_depth" controls the pretty-printing
614 depth of the ML compiler within the context. The old print_depth in
615 ML is still available as default_print_depth, but rarely used. Minor
618 * Proper context discipline for read_instantiate and instantiate_tac:
619 variables that are meant to become schematic need to be given as
620 fixed, and are generalized by the explicit context of local variables.
621 This corresponds to Isar attributes "where" and "of" with 'for'
622 declaration. INCOMPATIBILITY, also due to potential change of indices
623 of schematic variables.
625 * Toplevel function "use" refers to raw ML bootstrap environment,
626 without Isar context nor antiquotations. Potential INCOMPATIBILITY.
627 Note that 'ML_file' is the canonical command to load ML files into the
630 * Proper context for basic Simplifier operations: rewrite_rule,
631 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
632 pass runtime Proof.context (and ensure that the simplified entity
633 actually belongs to it).
635 * Subtle change of semantics of Thm.eq_thm: theory stamps are not
636 compared (according to Thm.thm_ord), but assumed to be covered by the
637 current background theory. Thus equivalent data produced in different
638 branches of the theory graph usually coincides (e.g. relevant for
639 theory merge). Note that the softer Thm.eq_thm_prop is often more
640 appropriate than Thm.eq_thm.
642 * Simplified programming interface to define ML antiquotations, see
643 structure ML_Antiquotation. Minor INCOMPATIBILITY.
645 * ML antiquotation @{here} refers to its source position, which is
646 occasionally useful for experimentation and diagnostic purposes.
648 * ML antiquotation @{path} produces a Path.T value, similarly to
649 Path.explode, but with compile-time check against the file-system and
650 some PIDE markup. Note that unlike theory source, ML does not have a
651 well-defined master directory, so an absolute symbolic path
652 specification is usually required, e.g. "~~/src/HOL".
654 * ML antiquotation @{print} inlines a function to print an arbitrary
655 ML value, which is occasionally useful for diagnostic or demonstration
661 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER
662 and PDF_VIEWER now refer to the actual programs, not shell
663 command-lines. Discontinued option -c: invocation may be asynchronous
664 via desktop environment, without any special precautions. Potential
665 INCOMPATIBILITY with ambitious private settings.
667 * Improved 'display_drafts' concerning desktop integration and
668 repeated invocation in PIDE front-end: re-use single file
669 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
671 * The raw Isabelle process executable has been renamed from
672 "isabelle-process" to "isabelle_process", which conforms to common
673 shell naming conventions, and allows to define a shell function within
674 the Isabelle environment to avoid dynamic path lookup. Rare
675 incompatibility for old tools that do not use the $ISABELLE_PROCESS
676 settings variable yet.
680 New in Isabelle2013-2 (December 2013)
681 -------------------------------------
683 *** Prover IDE -- Isabelle/Scala/jEdit ***
685 * More robust editing of running commands with internal forks,
686 e.g. non-terminating 'by' steps.
688 * More relaxed Sledgehammer panel: avoid repeated application of query
689 after edits surrounding the command location.
691 * More status information about commands that are interrupted
692 accidentally (via physical event or Poly/ML runtime system signal,
698 * More robust termination of external processes managed by
699 Isabelle/ML: support cancellation of tasks within the range of
700 milliseconds, as required for PIDE document editing with automatically
701 tried tools (e.g. Sledgehammer).
703 * Reactivated Isabelle/Scala kill command for external processes on
704 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
705 workaround for some Debian/Ubuntu Linux versions from 2013.
709 New in Isabelle2013-1 (November 2013)
710 -------------------------------------
714 * Discontinued obsolete 'uses' within theory header. Note that
715 commands like 'ML_file' work without separate declaration of file
716 dependencies. Minor INCOMPATIBILITY.
718 * Discontinued redundant 'use' command, which was superseded by
719 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
721 * Simplified subscripts within identifiers, using plain \<^sub>
722 instead of the second copy \<^isub> and \<^isup>. Superscripts are
723 only for literal tokens within notation; explicit mixfix annotations
724 for consts or fixed variables may be used as fall-back for unusual
725 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
726 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
727 standardize symbols as a starting point for further manual cleanup.
728 The ML reference variable "legacy_isub_isup" may be set as temporary
729 workaround, to make the prover accept a subset of the old identifier
732 * Document antiquotations: term style "isub" has been renamed to
733 "sub". Minor INCOMPATIBILITY.
735 * Uniform management of "quick_and_dirty" as system option (see also
736 "isabelle options"), configuration option within the context (see also
737 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
738 INCOMPATIBILITY, need to use more official Isabelle means to access
739 quick_and_dirty, instead of historical poking into mutable reference.
741 * Renamed command 'print_configs' to 'print_options'. Minor
744 * Proper diagnostic command 'print_state'. Old 'pr' (with its
745 implicit change of some global references) is retained for now as
746 control command, e.g. for ProofGeneral 3.7.x.
748 * Discontinued 'print_drafts' command with its old-fashioned PS output
749 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
750 'display_drafts' instead and print via the regular document viewer.
752 * Updated and extended "isar-ref" and "implementation" manual,
753 eliminated old "ref" manual.
756 *** Prover IDE -- Isabelle/Scala/jEdit ***
758 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
761 * Dockable window "Documentation" provides access to Isabelle
764 * Dockable window "Find" provides query operations for formal entities
765 (GUI front-end to 'find_theorems' command).
767 * Dockable window "Sledgehammer" manages asynchronous / parallel
768 sledgehammer runs over existing document sources, independently of
769 normal editing and checking process.
771 * Dockable window "Timing" provides an overview of relevant command
772 timing information, depending on option jedit_timing_threshold. The
773 same timing information is shown in the extended tooltip of the
774 command keyword, when hovering the mouse over it while the CONTROL or
775 COMMAND modifier is pressed.
777 * Improved dockable window "Theories": Continuous checking of proof
778 document (visible and required parts) may be controlled explicitly,
779 using check box or shortcut "C+e ENTER". Individual theory nodes may
780 be marked explicitly as required and checked in full, using check box
781 or shortcut "C+e SPACE".
783 * Improved completion mechanism, which is now managed by the
784 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
785 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
787 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
788 isabelle.complete for explicit completion in Isabelle sources.
789 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
792 * Improved support of various "minor modes" for Isabelle NEWS,
793 options, session ROOT etc., with completion and SideKick tree view.
795 * Strictly monotonic document update, without premature cancellation of
796 running transactions that are still needed: avoid reset/restart of
797 such command executions while editing.
799 * Support for asynchronous print functions, as overlay to existing
802 * Support for automatic tools in HOL, which try to prove or disprove
803 toplevel theorem statements.
805 * Action isabelle.reset-font-size resets main text area font size
806 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
807 also "Plugin Options / Isabelle / General"). It can be bound to some
808 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
810 * File specifications in jEdit (e.g. file browser) may refer to
811 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued
812 obsolete $ISABELLE_HOME_WINDOWS variable.
814 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
815 / Global Options / Appearance".
817 * Improved support of native Mac OS X functionality via "MacOSX"
818 plugin, which is now enabled by default.
823 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
824 In particular, 'interpretation' allows for non-persistent
825 interpretation within "context ... begin ... end" blocks offering a
826 light-weight alternative to 'sublocale'. See "isar-ref" manual for
829 * Improved locales diagnostic command 'print_dependencies'.
831 * Discontinued obsolete 'axioms' command, which has been marked as
832 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
833 instead, while observing its uniform scope for polymorphism.
835 * Discontinued empty name bindings in 'axiomatization'.
838 * System option "proofs" has been discontinued. Instead the global
839 state of Proofterm.proofs is persistently compiled into logic images
840 as required, notably HOL-Proofs. Users no longer need to change
841 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
843 * Syntax translation functions (print_translation etc.) always depend
844 on Proof.context. Discontinued former "(advanced)" option -- this is
845 now the default. Minor INCOMPATIBILITY.
847 * Former global reference trace_unify_fail is now available as
848 configuration option "unify_trace_failure" (global context only).
850 * SELECT_GOAL now retains the syntactic context of the overall goal
851 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
857 * Stronger precedence of syntax for big intersection and union on
858 sets, in accordance with corresponding lattice operations.
861 * Notation "{p:A. P}" now allows tuple patterns as well.
863 * Nested case expressions are now translated in a separate check phase
864 rather than during parsing. The data for case combinators is separated
865 from the datatype package. The declaration attribute
866 "case_translation" can be used to register new case combinators:
868 declare [[case_translation case_combinator constructor1 ... constructorN]]
871 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
873 - 'code_identifier' declares name hints for arbitrary identifiers in
874 generated code, subsuming 'code_modulename'.
876 See the isar-ref manual for syntax diagrams, and the HOL theories for
879 * Attibute 'code': 'code' now declares concrete and abstract code
880 equations uniformly. Use explicit 'code equation' and 'code abstract'
881 to distinguish both when desired.
883 * Discontinued theories Code_Integer and Efficient_Nat by a more
884 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
885 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
886 generation for details. INCOMPATIBILITY.
888 * Numeric types are mapped by default to target language numerals:
889 natural (replaces former code_numeral) and integer (replaces former
890 code_int). Conversions are available as integer_of_natural /
891 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
892 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
893 ML). INCOMPATIBILITY.
895 * Function package: For mutually recursive functions f and g, separate
896 cases rules f.cases and g.cases are generated instead of unusable
897 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
898 in the case that the unusable rule was used nevertheless.
900 * Function package: For each function f, new rules f.elims are
901 generated, which eliminate equalities of the form "f x = t".
903 * New command 'fun_cases' derives ad-hoc elimination rules for
904 function equations as simplified instances of f.elims, analogous to
905 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
908 - parametrized correspondence relations are now supported:
909 + parametricity theorems for the raw term can be specified in
910 the command lift_definition, which allow us to generate stronger
912 + setup_lifting generates stronger transfer rules if parametric
913 correspondence relation can be generated
914 + various new properties of the relator must be specified to support
916 + parametricity theorem for the Quotient relation can be specified
917 - setup_lifting generates domain rules for the Transfer package
918 - stronger reflexivity prover of respectfulness theorems for type
920 - ===> and --> are now local. The symbols can be introduced
921 by interpreting the locale lifting_syntax (typically in an
923 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
924 Main. Potential INCOMPATIBILITY
925 - new commands for restoring and deleting Lifting/Transfer context:
926 lifting_forget, lifting_update
927 - the command print_quotmaps was renamed to print_quot_maps.
931 - better support for domains in Transfer: replace Domainp T
932 by the actual invariant in a transferred goal
933 - transfer rules can have as assumptions other transfer rules
934 - Experimental support for transferring from the raw level to the
935 abstract level: Transfer.transferred attribute
936 - Attribute version of the transfer method: untransferred attribute
938 * Reification and reflection:
939 - Reification is now directly available in HOL-Main in structure
941 - Reflection now handles multiple lists with variables also.
942 - The whole reflection stack has been decomposed into conversions.
945 * Revised devices for recursive definitions over finite sets:
946 - Only one fundamental fold combinator on finite set remains:
947 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
948 This is now identity on infinite sets.
949 - Locales ("mini packages") for fundamental definitions with
950 Finite_Set.fold: folding, folding_idem.
951 - Locales comm_monoid_set, semilattice_order_set and
952 semilattice_neutr_order_set for big operators on sets.
953 See theory Big_Operators for canonical examples.
954 Note that foundational constants comm_monoid_set.F and
955 semilattice_set.F correspond to former combinators fold_image
956 and fold1 respectively. These are now gone. You may use
957 those foundational constants as substitutes, but it is
958 preferable to interpret the above locales accordingly.
959 - Dropped class ab_semigroup_idem_mult (special case of lattice,
960 no longer needed in connection with Finite_Set.fold etc.)
962 card.union_inter ~> card_Un_Int [symmetric]
963 card.union_disjoint ~> card_Un_disjoint
966 * Locale hierarchy for abstract orderings and (semi)lattices.
968 * Complete_Partial_Order.admissible is defined outside the type class
969 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
970 class predicate assumption or sort constraint when possible.
973 * Introduce type class "conditionally_complete_lattice": Like a
974 complete lattice but does not assume the existence of the top and
975 bottom elements. Allows to generalize some lemmas about reals and
976 extended reals. Removed SupInf and replaced it by the instantiation
977 of conditionally_complete_lattice for real. Renamed lemmas about
978 conditionally-complete lattice from Sup_... to cSup_... and from
979 Inf_... to cInf_... to avoid hidding of similar complete lattice
982 * Introduce type class linear_continuum as combination of
983 conditionally-complete lattices and inner dense linorders which have
984 more than one element. INCOMPATIBILITY.
986 * Introduced type classes order_top and order_bot. The old classes top
987 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
988 Rename bot -> order_bot, top -> order_top
990 * Introduce type classes "no_top" and "no_bot" for orderings without
991 top and bottom elements.
993 * Split dense_linorder into inner_dense_order and no_top, no_bot.
995 * Complex_Main: Unify and move various concepts from
996 HOL-Multivariate_Analysis to HOL-Complex_Main.
998 - Introduce type class (lin)order_topology and
999 linear_continuum_topology. Allows to generalize theorems about
1000 limits and order. Instances are reals and extended reals.
1002 - continuous and continuos_on from Multivariate_Analysis:
1003 "continuous" is the continuity of a function at a filter. "isCont"
1004 is now an abbrevitation: "isCont x f == continuous (at _) f".
1006 Generalized continuity lemmas from isCont to continuous on an
1009 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
1010 compactness of closed intervals on reals. Continuous functions
1011 attain infimum and supremum on compact sets. The inverse of a
1012 continuous function is continuous, when the function is continuous
1015 - connected from Multivariate_Analysis. Use it to prove the
1016 intermediate value theorem. Show connectedness of intervals on
1017 linear_continuum_topology).
1019 - first_countable_topology from Multivariate_Analysis. Is used to
1020 show equivalence of properties on the neighbourhood filter of x and
1021 on all sequences converging to x.
1023 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
1024 theorems from Library/FDERIV.thy to Deriv.thy and base the
1025 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
1026 which are restricted to sets, i.e. to represent derivatives from
1029 - Removed the within-filter. It is replaced by the principal filter:
1031 F within X = inf F (principal X)
1033 - Introduce "at x within U" as a single constant, "at x" is now an
1034 abbreviation for "at x within UNIV"
1036 - Introduce named theorem collections tendsto_intros,
1037 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
1038 in tendsto_intros (or FDERIV_intros) are also available as
1039 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
1040 is replaced by a congruence rule. This allows to apply them as
1041 intro rules and then proving equivalence by the simplifier.
1043 - Restructured theories in HOL-Complex_Main:
1045 + Moved RealDef and RComplete into Real
1047 + Introduced Topological_Spaces and moved theorems about
1048 topological spaces, filters, limits and continuity to it
1050 + Renamed RealVector to Real_Vector_Spaces
1052 + Split Lim, SEQ, Series into Topological_Spaces,
1053 Real_Vector_Spaces, and Limits
1055 + Moved Ln and Log to Transcendental
1057 + Moved theorems about continuity from Deriv to Topological_Spaces
1059 - Remove various auxiliary lemmas.
1064 - Added option "spy".
1065 - Reduce incidence of "too high arity" errors.
1069 isar_shrink ~> isar_compress
1071 - Added options "isar_try0", "spy".
1072 - Better support for "isar_proofs".
1073 - MaSh has been fined-tuned and now runs as a local server.
1075 * Improved support for ad hoc overloading of constants (see also
1076 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
1078 * Library/Polynomial.thy:
1079 - Use lifting for primitive definitions.
1080 - Explicit conversions from and to lists of coefficients, used for
1082 - Replaced recursion operator poly_rec by fold_coeffs.
1083 - Prefer pre-existing gcd operation for gcd.
1085 poly_eq_iff ~> poly_eq_poly_eq_iff
1086 poly_ext ~> poly_eqI
1087 expand_poly_eq ~> poly_eq_iff
1090 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
1091 case_of_simps to convert function definitions between a list of
1092 equations with patterns on the lhs and a single equation with case
1093 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
1095 * New Library/FSet.thy: type of finite sets defined as a subtype of
1096 sets defined by Lifting/Transfer.
1098 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
1100 * Consolidation of library theories on product orders:
1102 Product_Lattice ~> Product_Order -- pointwise order on products
1103 Product_ord ~> Product_Lexorder -- lexicographic order on products
1107 * Imperative-HOL: The MREC combinator is considered legacy and no
1108 longer included by default. INCOMPATIBILITY, use partial_function
1109 instead, or import theory Legacy_Mrec as a fallback.
1111 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
1112 ~~/src/HOL/Algebra/poly. Existing theories should be based on
1113 ~~/src/HOL/Library/Polynomial instead. The latter provides
1114 integration with HOL's type classes for rings. INCOMPATIBILITY.
1117 - Various improvements to BNF-based (co)datatype package, including
1118 new commands "primrec_new", "primcorec", and
1119 "datatype_new_compat", as well as documentation. See
1120 "datatypes.pdf" for details.
1121 - New "coinduction" method to avoid some boilerplate (compared to
1124 data ~> datatype_new
1125 codata ~> codatatype
1127 - Renamed many generated theorems, including
1129 map_comp' ~> map_comp
1139 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
1140 "check_property" allows to check specifications of the form "ALL x y
1141 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
1142 Examples.thy in particular.
1144 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
1145 tracing output in the command transaction context instead of physical
1146 stdout. See also Toplevel.debug, Toplevel.debugging and
1147 ML_Compiler.exn_trace.
1149 * ML type "theory" is now immutable, without any special treatment of
1150 drafts or linear updates (which could lead to "stale theory" errors in
1151 the past). Discontinued obsolete operations like Theory.copy,
1152 Theory.checkpoint, and the auxiliary type theory_ref. Minor
1155 * More uniform naming of goal functions for skipped proofs:
1157 Skip_Proof.prove ~> Goal.prove_sorry
1158 Skip_Proof.prove_global ~> Goal.prove_sorry_global
1160 Minor INCOMPATIBILITY.
1162 * Simplifier tactics and tools use proper Proof.context instead of
1163 historic type simpset. Old-style declarations like addsimps,
1164 addsimprocs etc. operate directly on Proof.context. Raw type simpset
1165 retains its use as snapshot of the main Simplifier context, using
1166 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
1167 old tools by making them depend on (ctxt : Proof.context) instead of
1168 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
1170 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
1171 operate on Proof.context instead of claset, for uniformity with addIs,
1172 addEs, addDs etc. Note that claset_of and put_claset allow to manage
1173 clasets separately from the context.
1175 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
1176 INCOMPATIBILITY, use @{context} instead.
1178 * Antiquotation @{theory_context A} is similar to @{theory A}, but
1179 presents the result as initial Proof.context.
1184 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
1185 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
1187 * Discontinued obsolete isabelle-process options -f and -u (former
1188 administrative aliases of option -e). Minor INCOMPATIBILITY.
1190 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
1193 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
1194 document formats: dvi.gz, ps, ps.gz -- the default document format is
1197 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
1198 specify global resources of the JVM process run by isabelle build.
1200 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
1201 to run Isabelle/Scala source files as standalone programs.
1203 * Improved "isabelle keywords" tool (for old-style ProofGeneral
1204 keyword tables): use Isabelle/Scala operations, which inspect outer
1205 syntax without requiring to build sessions first.
1207 * Sessions may be organized via 'chapter' specifications in the ROOT
1208 file, which determines a two-level hierarchy of browser info. The old
1209 tree-like organization via implicit sub-session relation (with its
1210 tendency towards erratic fluctuation of URLs) has been discontinued.
1211 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
1212 for HTML presentation of theories.
1216 New in Isabelle2013 (February 2013)
1217 -----------------------------------
1221 * Theorem status about oracles and unfinished/failed future proofs is
1222 no longer printed by default, since it is incompatible with
1223 incremental / parallel checking of the persistent document model. ML
1224 function Thm.peek_status may be used to inspect a snapshot of the
1225 ongoing evaluation process. Note that in batch mode --- notably
1226 isabelle build --- the system ensures that future proofs of all
1227 accessible theorems in the theory context are finished (as before).
1229 * Configuration option show_markup controls direct inlining of markup
1230 into the printed representation of formal entities --- notably type
1231 and sort constraints. This enables Prover IDE users to retrieve that
1232 information via tooltips in the output window, for example.
1234 * Command 'ML_file' evaluates ML text from a file directly within the
1235 theory, without any predeclaration via 'uses' in the theory header.
1237 * Old command 'use' command and corresponding keyword 'uses' in the
1238 theory header are legacy features and will be discontinued soon.
1239 Tools that load their additional source files may imitate the
1240 'ML_file' implementation, such that the system can take care of
1241 dependencies properly.
1243 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
1244 is called fastforce / fast_force_tac already since Isabelle2011-1.
1246 * Updated and extended "isar-ref" and "implementation" manual, reduced
1247 remaining material in old "ref" manual.
1249 * Improved support for auxiliary contexts that indicate block structure
1250 for specifications. Nesting of "context fixes ... context assumes ..."
1251 and "class ... context ...".
1253 * Attribute "consumes" allows a negative value as well, which is
1254 interpreted relatively to the total number of premises of the rule in
1255 the target context. This form of declaration is stable when exported
1256 from a nested 'context' with additional assumptions. It is the
1257 preferred form for definitional packages, notably cases/rules produced
1258 in HOL/inductive and HOL/function.
1260 * More informative error messages for Isar proof commands involving
1261 lazy enumerations (method applications etc.).
1263 * Refined 'help' command to retrieve outer syntax commands according
1264 to name patterns (with clickable results).
1267 *** Prover IDE -- Isabelle/Scala/jEdit ***
1269 * Parallel terminal proofs ('by') are enabled by default, likewise
1270 proofs that are built into packages like 'datatype', 'function'. This
1271 allows to "run ahead" checking the theory specifications on the
1272 surface, while the prover is still crunching on internal
1273 justifications. Unfinished / cancelled proofs are restarted as
1274 required to complete full proof checking eventually.
1276 * Improved output panel with tooltips, hyperlinks etc. based on the
1277 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
1278 tooltips leads to some window that supports the same recursively,
1279 which can lead to stacks of tooltips as the semantic document content
1280 is explored. ESCAPE closes the whole stack, individual windows may be
1281 closed separately, or detached to become independent jEdit dockables.
1283 * Improved support for commands that produce graph output: the text
1284 message contains a clickable area to open a new instance of the graph
1287 * More robust incremental parsing of outer syntax (partial comments,
1288 malformed symbols). Changing the balance of open/close quotes and
1289 comment delimiters works more conveniently with unfinished situations
1290 that frequently occur in user interaction.
1292 * More efficient painting and improved reactivity when editing large
1293 files. More scalable management of formal document content.
1295 * Smarter handling of tracing messages: prover process pauses after
1296 certain number of messages per command transaction, with some user
1297 dialog to stop or continue. This avoids swamping the front-end with
1298 potentially infinite message streams.
1300 * More plugin options and preferences, based on Isabelle/Scala. The
1301 jEdit plugin option panel provides access to some Isabelle/Scala
1302 options, including tuning parameters for editor reactivity and color
1305 * Dockable window "Symbols" provides some editing support for Isabelle
1308 * Dockable window "Monitor" shows ML runtime statistics. Note that
1309 continuous display of the chart slows down the system.
1311 * Improved editing support for control styles: subscript, superscript,
1312 bold, reset of style -- operating on single symbols or text
1313 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
1315 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
1316 adjust the main text area font size, and its derivatives for output,
1317 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
1318 need to be adapted to local keyboard layouts.
1320 * More reactive completion popup by default: use \t (TAB) instead of
1321 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
1322 also "Plugin Options / SideKick / General / Code Completion Options".
1324 * Implicit check and build dialog of the specified logic session
1325 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
1326 demand, without bundling big platform-dependent heap images in the
1327 Isabelle distribution.
1329 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
1330 from Oracle provide better multi-platform experience. This version is
1331 now bundled exclusively with Isabelle.
1336 * Code generation for Haskell: restrict unqualified imports from
1337 Haskell Prelude to a small set of fundamental operations.
1339 * Command 'export_code': relative file names are interpreted
1340 relatively to master directory of current theory rather than the
1341 rather arbitrary current working directory. INCOMPATIBILITY.
1343 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
1344 use regular rule composition via "OF" / "THEN", or explicit proof
1345 structure instead. Note that Isabelle/ML provides a variety of
1346 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
1347 with some care where this is really required.
1349 * Command 'typ' supports an additional variant with explicit sort
1350 constraint, to infer and check the most general type conforming to a
1351 given sort. Example (in HOL):
1353 typ "_ * _ * bool * unit" :: finite
1355 * Command 'locale_deps' visualizes all locales and their relations as
1363 - Added MaSh relevance filter based on machine-learning; see the
1364 Sledgehammer manual for details.
1365 - Polished Isar proofs generated with "isar_proofs" option.
1366 - Rationalized type encodings ("type_enc" option).
1367 - Renamed "kill_provers" subcommand to "kill_all".
1369 isar_proof ~> isar_proofs
1370 isar_shrink_factor ~> isar_shrink
1371 max_relevant ~> max_facts
1372 relevance_thresholds ~> fact_thresholds
1374 * Quickcheck: added an optimisation for equality premises. It is
1375 switched on by default, and can be switched off by setting the
1376 configuration quickcheck_optimise_equality to false.
1378 * Quotient: only one quotient can be defined by quotient_type
1382 - generation of an abstraction function equation in lift_definition
1383 - quot_del attribute
1384 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
1386 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
1389 * Preprocessing of the code generator rewrites set comprehensions into
1390 pointfree expressions.
1392 * The SMT solver Z3 has now by default a restricted set of directly
1393 supported features. For the full set of features (div/mod, nonlinear
1394 arithmetic, datatypes/records) with potential proof reconstruction
1395 failures, enable the configuration option "z3_with_extensions". Minor
1398 * Simplified 'typedef' specifications: historical options for implicit
1399 set definition and alternative name have been discontinued. The
1400 former behavior of "typedef (open) t = A" is now the default, but
1401 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
1404 * Removed constant "chars"; prefer "Enum.enum" on type "char"
1405 directly. INCOMPATIBILITY.
1407 * Moved operation product, sublists and n_lists from theory Enum to
1408 List. INCOMPATIBILITY.
1410 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
1412 * Class "comm_monoid_diff" formalises properties of bounded
1413 subtraction, with natural numbers and multisets as typical instances.
1415 * Added combinator "Option.these" with type "'a option set => 'a set".
1417 * Theory "Transitive_Closure": renamed lemmas
1419 reflcl_tranclp -> reflclp_tranclp
1420 rtranclp_reflcl -> rtranclp_reflclp
1424 * Theory "Rings": renamed lemmas (in class semiring)
1426 left_distrib ~> distrib_right
1427 right_distrib ~> distrib_left
1431 * Generalized the definition of limits:
1433 - Introduced the predicate filterlim (LIM x F. f x :> G) which
1434 expresses that when the input values x converge to F then the
1435 output f x converges to G.
1437 - Added filters for convergence to positive (at_top) and negative
1440 - Moved infinity in the norm (at_infinity) from
1441 Multivariate_Analysis to Complex_Main.
1443 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
1448 * Theory "Library/Option_ord" provides instantiation of option type to
1449 lattice type classes.
1451 * Theory "Library/Multiset": renamed
1453 constant fold_mset ~> Multiset.fold
1454 fact fold_mset_commute ~> fold_mset_comm
1458 * Renamed theory Library/List_Prefix to Library/Sublist, with related
1461 - Renamed constants (and related lemmas)
1464 strict_prefix ~> prefix
1466 - Replaced constant "postfix" by "suffixeq" with swapped argument
1467 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
1468 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
1469 Renamed lemmas accordingly.
1471 - Added constant "list_hembeq" for homeomorphic embedding on
1472 lists. Added abbreviation "sublisteq" for special case
1473 "list_hembeq (op =)".
1475 - Theory Library/Sublist no longer provides "order" and "bot" type
1476 class instances for the prefix order (merely corresponding locale
1477 interpretations). The type class instances are now in theory
1478 Library/Prefix_Order.
1480 - The sublist relation of theory Library/Sublist_Order is now based
1481 on "Sublist.sublisteq". Renamed lemmas accordingly:
1483 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
1484 le_list_append_mono ~> Sublist.list_hembeq_append_mono
1485 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
1486 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
1487 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
1488 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
1489 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
1490 le_list_drop_many ~> Sublist.sublisteq_drop_many
1491 le_list_filter_left ~> Sublist.sublisteq_filter_left
1492 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
1493 le_list_rev_take_iff ~> Sublist.sublisteq_append
1494 le_list_same_length ~> Sublist.sublisteq_same_length
1495 le_list_take_many_iff ~> Sublist.sublisteq_append'
1496 less_eq_list.drop ~> less_eq_list_drop
1497 less_eq_list.induct ~> less_eq_list_induct
1498 not_le_list_length ~> Sublist.not_sublisteq_length
1502 * New theory Library/Countable_Set.
1504 * Theory Library/Debug and Library/Parallel provide debugging and
1505 parallel execution for code generated towards Isabelle/ML.
1507 * Theory Library/FuncSet: Extended support for Pi and extensional and
1508 introduce the extensional dependent function space "PiE". Replaced
1509 extensional_funcset by an abbreviation, and renamed lemmas from
1510 extensional_funcset to PiE as follows:
1512 extensional_empty ~> PiE_empty
1513 extensional_funcset_empty_domain ~> PiE_empty_domain
1514 extensional_funcset_empty_range ~> PiE_empty_range
1515 extensional_funcset_arb ~> PiE_arb
1516 extensional_funcset_mem ~> PiE_mem
1517 extensional_funcset_extend_domainI ~> PiE_fun_upd
1518 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
1519 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
1520 card_extensional_funcset ~> card_PiE
1521 finite_extensional_funcset ~> finite_PiE
1525 * Theory Library/FinFun: theory of almost everywhere constant
1526 functions (supersedes the AFP entry "Code Generation for Functions as
1529 * Theory Library/Phantom: generic phantom type to make a type
1530 parameter appear in a constant's type. This alternative to adding
1531 TYPE('a) as another parameter avoids unnecessary closures in generated
1534 * Theory Library/RBT_Impl: efficient construction of red-black trees
1535 from sorted associative lists. Merging two trees with rbt_union may
1536 return a structurally different tree than before. Potential
1539 * Theory Library/IArray: immutable arrays with code generation.
1541 * Theory Library/Finite_Lattice: theory of finite lattices.
1543 * HOL/Multivariate_Analysis: replaced
1545 "basis :: 'a::euclidean_space => nat => real"
1546 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
1548 on euclidean spaces by using the inner product "_ \<bullet> _" with
1549 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
1550 "SUM i : Basis. f i * r i".
1552 With this change the following constants are also changed or removed:
1554 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
1555 a $$ i ~> inner a i (where i : Basis)
1557 \<pi>, \<pi>' removed
1559 Theorems about these constants where removed.
1563 component_le_norm ~> Basis_le_norm
1564 euclidean_eq ~> euclidean_eq_iff
1565 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
1566 euclidean_simps ~> inner_simps
1567 independent_basis ~> independent_Basis
1568 span_basis ~> span_Basis
1569 in_span_basis ~> in_span_Basis
1570 norm_bound_component_le ~> norm_boound_Basis_le
1571 norm_bound_component_lt ~> norm_boound_Basis_lt
1572 component_le_infnorm ~> Basis_le_infnorm
1578 - Added simproc "measurable" to automatically prove measurability.
1580 - Added induction rules for sigma sets with disjoint union
1581 (sigma_sets_induct_disjoint) and for Borel-measurable functions
1582 (borel_measurable_induct).
1584 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
1587 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
1588 AFP entry "Ordinals_and_Cardinals").
1590 * HOL/BNF: New (co)datatype package based on bounded natural functors
1591 with support for mixed, nested recursion and interesting non-free
1594 * HOL/Finite_Set and Relation: added new set and relation operations
1595 expressed by Finite_Set.fold.
1597 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
1598 trees for the code generator.
1600 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
1602 possible INCOMPATIBILITY.
1604 * HOL/Set: renamed Set.project -> Set.filter
1608 *** Document preparation ***
1610 * Dropped legacy antiquotations "term_style" and "thm_style", since
1611 styles may be given as arguments to "term" and "thm" already.
1612 Discontinued legacy styles "prem1" .. "prem19".
1614 * Default LaTeX rendering for \<euro> is now based on eurosym package,
1615 instead of slightly exotic babel/greek.
1617 * Document variant NAME may use different LaTeX entry point
1618 document/root_NAME.tex if that file exists, instead of the common
1621 * Simplified custom document/build script, instead of old-style
1622 document/IsaMakefile. Minor INCOMPATIBILITY.
1627 * The default limit for maximum number of worker threads is now 8,
1628 instead of 4, in correspondence to capabilities of contemporary
1629 hardware and Poly/ML runtime system.
1631 * Type Seq.results and related operations support embedded error
1632 messages within lazy enumerations, and thus allow to provide
1633 informative errors in the absence of any usable results.
1635 * Renamed Position.str_of to Position.here to emphasize that this is a
1636 formal device to inline positions into message text, but not
1637 necessarily printing visible text.
1642 * Advanced support for Isabelle sessions and build management, see
1643 "system" manual for the chapter of that name, especially the "isabelle
1644 build" tool and its examples. The "isabelle mkroot" tool prepares
1645 session root directories for use with "isabelle build", similar to
1646 former "isabelle mkdir" for "isabelle usedir". Note that this affects
1647 document preparation as well. INCOMPATIBILITY, isabelle usedir /
1648 mkdir / make are rendered obsolete.
1650 * Discontinued obsolete Isabelle/build script, it is superseded by the
1651 regular isabelle build tool. For example:
1653 isabelle build -s -b HOL
1655 * Discontinued obsolete "isabelle makeall".
1657 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
1658 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
1659 provides some traditional targets that invoke "isabelle build". Note
1660 that this is inefficient! Applications of Isabelle/HOL involving
1661 "isabelle make" should be upgraded to use "isabelle build" directly.
1663 * The "isabelle options" tool prints Isabelle system options, as
1664 required for "isabelle build", for example.
1666 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
1667 Minor INCOMPATIBILITY in command-line options.
1669 * The "isabelle install" tool has now a simpler command-line. Minor
1672 * The "isabelle components" tool helps to resolve add-on components
1673 that are not bundled, or referenced from a bare-bones repository
1674 version of Isabelle.
1676 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
1677 platform family: "linux", "macos", "windows".
1679 * The ML system is configured as regular component, and no longer
1680 picked up from some surrounding directory. Potential INCOMPATIBILITY
1681 for home-made settings.
1683 * Improved ML runtime statistics (heap, threads, future tasks etc.).
1685 * Discontinued support for Poly/ML 5.2.1, which was the last version
1686 without exception positions and advanced ML compiler/toplevel
1689 * Discontinued special treatment of Proof General -- no longer guess
1690 PROOFGENERAL_HOME based on accidental file-system layout. Minor
1691 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
1692 settings manually, or use a Proof General version that has been
1693 bundled as Isabelle component.
1697 New in Isabelle2012 (May 2012)
1698 ------------------------------
1702 * Prover IDE (PIDE) improvements:
1704 - more robust Sledgehammer integration (as before the sledgehammer
1705 command-line needs to be typed into the source buffer)
1706 - markup for bound variables
1707 - markup for types of term variables (displayed as tooltips)
1708 - support for user-defined Isar commands within the running session
1709 - improved support for Unicode outside original 16bit range
1710 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
1712 * Forward declaration of outer syntax keywords within the theory
1713 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
1714 commands to be used in the same theory where defined.
1716 * Auxiliary contexts indicate block structure for specifications with
1717 additional parameters and assumptions. Such unnamed contexts may be
1718 nested within other targets, like 'theory', 'locale', 'class',
1719 'instantiation' etc. Results from the local context are generalized
1720 accordingly and applied to the enclosing target context. Example:
1724 assumes xy: "x = y" and yz: "y = z"
1727 lemma my_trans: "x = z" using xy yz by simp
1733 The most basic application is to factor-out context elements of
1734 several fixes/assumes/shows theorem statements, e.g. see
1735 ~~/src/HOL/Isar_Examples/Group_Context.thy
1737 Any other local theory specification element works within the "context
1738 ... begin ... end" block as well.
1740 * Bundled declarations associate attributed fact expressions with a
1741 given name in the context. These may be later included in other
1742 contexts. This allows to manage context extensions casually, without
1743 the logical dependencies of locales and locale interpretation. See
1744 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
1746 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
1747 declaration, and results are standardized before being stored. Thus
1748 old-style "standard" after instantiation or composition of facts
1749 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
1750 indices of schematic variables.
1752 * Rule attributes in local theory declarations (e.g. locale or class)
1753 are now statically evaluated: the resulting theorem is stored instead
1754 of the original expression. INCOMPATIBILITY in rare situations, where
1755 the historic accident of dynamic re-evaluation in interpretations
1758 * New tutorial "Programming and Proving in Isabelle/HOL"
1759 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
1760 Structured Isar Proofs" ("isar-overview"), which has been removed. It
1761 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
1762 Logic" as the recommended beginners tutorial, but does not cover all
1763 of the material of that old tutorial.
1765 * Updated and extended reference manuals: "isar-ref",
1766 "implementation", "system"; reduced remaining material in old "ref"
1772 * Command 'definition' no longer exports the foundational "raw_def"
1773 into the user context. Minor INCOMPATIBILITY, may use the regular
1774 "def" result with attribute "abs_def" to imitate the old version.
1776 * Attribute "abs_def" turns an equation of the form "f x y == t" into
1777 "f == %x y. t", which ensures that "simp" or "unfold" steps always
1778 expand it. This also works for object-logic equality. (Formerly
1779 undocumented feature.)
1781 * Sort constraints are now propagated in simultaneous statements, just
1782 like type constraints. INCOMPATIBILITY in rare situations, where
1783 distinct sorts used to be assigned accidentally. For example:
1785 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
1787 lemma "P (x::'a)" and "Q (y::'a::bar)"
1788 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
1790 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
1791 tolerant against multiple unifiers, as long as the final result is
1792 unique. (As before, rules are composed in canonical right-to-left
1793 order to accommodate newly introduced premises.)
1795 * Renamed some inner syntax categories:
1801 Minor INCOMPATIBILITY. Note that in practice "num_const" or
1802 "num_position" etc. are mainly used instead (which also include
1803 position information via constraints).
1805 * Simplified configuration options for syntax ambiguity: see
1806 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
1807 manual. Minor INCOMPATIBILITY.
1809 * Discontinued configuration option "syntax_positions": atomic terms
1810 in parse trees are always annotated by position constraints.
1812 * Old code generator for SML and its commands 'code_module',
1813 'code_library', 'consts_code', 'types_code' have been discontinued.
1814 Use commands of the generic code generator instead. INCOMPATIBILITY.
1816 * Redundant attribute "code_inline" has been discontinued. Use
1817 "code_unfold" instead. INCOMPATIBILITY.
1819 * Dropped attribute "code_unfold_post" in favor of the its dual
1820 "code_abbrev", which yields a common pattern in definitions like
1822 definition [code_abbrev]: "f = t"
1826 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
1827 instead. INCOMPATIBILITY.
1829 * Discontinued old "prems" fact, which used to refer to the accidental
1830 collection of foundational premises in the context (already marked as
1831 legacy since Isabelle2011).
1836 * Type 'a set is now a proper type constructor (just as before
1837 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
1838 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
1839 sets separate, it is often sufficient to rephrase some set S that has
1840 been accidentally used as predicates by "%x. x : S", and some
1841 predicate P that has been accidentally used as set by "{x. P x}".
1842 Corresponding proofs in a first step should be pruned from any
1843 tinkering with former theorems mem_def and Collect_def as far as
1846 For developments which deliberately mix predicates and sets, a
1847 planning step is necessary to determine what should become a predicate
1848 and what a set. It can be helpful to carry out that step in
1849 Isabelle2011-1 before jumping right into the current release.
1851 * Code generation by default implements sets as container type rather
1852 than predicates. INCOMPATIBILITY.
1854 * New type synonym 'a rel = ('a * 'a) set
1856 * The representation of numerals has changed. Datatype "num"
1857 represents strictly positive binary numerals, along with functions
1858 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
1859 positive and negated numeric literals, respectively. See also
1860 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
1861 user theories may require adaptations as follows:
1863 - Theorems with number_ring or number_semiring constraints: These
1864 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
1866 - Theories defining numeric types: Remove number, number_semiring,
1867 and number_ring instances. Defer all theorems about numerals until
1868 after classes one and semigroup_add have been instantiated.
1870 - Numeral-only simp rules: Replace each rule having a "number_of v"
1871 pattern with two copies, one for numeral and one for neg_numeral.
1873 - Theorems about subclasses of semiring_1 or ring_1: These classes
1874 automatically support numerals now, so more simp rules and
1875 simprocs may now apply within the proof.
1877 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
1878 Redefine using other integer operations.
1880 * Transfer: New package intended to generalize the existing
1881 "descending" method and related theorem attributes from the Quotient
1882 package. (Not all functionality is implemented yet, but future
1883 development will focus on Transfer as an eventual replacement for the
1884 corresponding parts of the Quotient package.)
1886 - transfer_rule attribute: Maintains a collection of transfer rules,
1887 which relate constants at two different types. Transfer rules may
1888 relate different type instances of the same polymorphic constant,
1889 or they may relate an operation on a raw type to a corresponding
1890 operation on an abstract type (quotient or subtype). For example:
1892 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
1893 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
1895 - transfer method: Replaces a subgoal on abstract types with an
1896 equivalent subgoal on the corresponding raw types. Constants are
1897 replaced with corresponding ones according to the transfer rules.
1898 Goals are generalized over all free variables by default; this is
1899 necessary for variables whose types change, but can be overridden
1900 for specific variables with e.g. "transfer fixing: x y z". The
1901 variant transfer' method allows replacing a subgoal with one that
1902 is logically stronger (rather than equivalent).
1904 - relator_eq attribute: Collects identity laws for relators of
1905 various type constructors, e.g. "list_all2 (op =) = (op =)". The
1906 transfer method uses these lemmas to infer transfer rules for
1907 non-polymorphic constants on the fly.
1909 - transfer_prover method: Assists with proving a transfer rule for a
1910 new constant, provided the constant is defined in terms of other
1911 constants that already have transfer rules. It should be applied
1912 after unfolding the constant definitions.
1914 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
1915 from type nat to type int.
1917 * Lifting: New package intended to generalize the quotient_definition
1918 facility of the Quotient package; designed to work with Transfer.
1920 - lift_definition command: Defines operations on an abstract type in
1921 terms of a corresponding operation on a representation
1922 type. Example syntax:
1924 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
1927 Users must discharge a respectfulness proof obligation when each
1928 constant is defined. (For a type copy, i.e. a typedef with UNIV,
1929 the proof is discharged automatically.) The obligation is
1930 presented in a user-friendly, readable form; a respectfulness
1931 theorem in the standard format and a transfer rule are generated
1934 - Integration with code_abstype: For typedefs (e.g. subtypes
1935 corresponding to a datatype invariant, such as dlist),
1936 lift_definition generates a code certificate theorem and sets up
1937 code generation for each constant.
1939 - setup_lifting command: Sets up the Lifting package to work with a
1940 user-defined type. The user must provide either a quotient theorem
1941 or a type_definition theorem. The package configures transfer
1942 rules for equality and quantifiers on the type, and sets up the
1943 lift_definition command to work with the type.
1945 - Usage examples: See Quotient_Examples/Lift_DList.thy,
1946 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
1947 Word/Word.thy and Library/Float.thy.
1951 - The 'quotient_type' command now supports a 'morphisms' option with
1952 rep and abs functions, similar to typedef.
1954 - 'quotient_type' sets up new types to work with the Lifting and
1955 Transfer packages, as with 'setup_lifting'.
1957 - The 'quotient_definition' command now requires the user to prove a
1958 respectfulness property at the point where the constant is
1959 defined, similar to lift_definition; INCOMPATIBILITY.
1961 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
1962 accordingly, INCOMPATIBILITY.
1964 * New diagnostic command 'find_unused_assms' to find potentially
1965 superfluous assumptions in theorems using Quickcheck.
1969 - Quickcheck returns variable assignments as counterexamples, which
1970 allows to reveal the underspecification of functions under test.
1971 For example, refuting "hd xs = x", it presents the variable
1972 assignment xs = [] and x = a1 as a counterexample, assuming that
1973 any property is false whenever "hd []" occurs in it.
1975 These counterexample are marked as potentially spurious, as
1976 Quickcheck also returns "xs = []" as a counterexample to the
1977 obvious theorem "hd xs = hd xs".
1979 After finding a potentially spurious counterexample, Quickcheck
1980 continues searching for genuine ones.
1982 By default, Quickcheck shows potentially spurious and genuine
1983 counterexamples. The option "genuine_only" sets quickcheck to only
1984 show genuine counterexamples.
1986 - The command 'quickcheck_generator' creates random and exhaustive
1987 value generators for a given type and operations.
1989 It generates values by using the operations as if they were
1990 constructors of that type.
1992 - Support for multisets.
1994 - Added "use_subtype" options.
1996 - Added "quickcheck_locale" configuration to specify how to process
1997 conjectures in a locale context.
1999 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
2000 and affecting 'rat' and 'real'.
2003 - Integrated more tightly with SPASS, as described in the ITP 2012
2004 paper "More SPASS with Isabelle".
2005 - Made it try "smt" as a fallback if "metis" fails or times out.
2006 - Added support for the following provers: Alt-Ergo (via Why3 and
2007 TFF1), iProver, iProver-Eq.
2008 - Sped up the minimizer.
2009 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
2010 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
2011 - Renamed "sound" option to "strict".
2013 * Metis: Added possibility to specify lambda translations scheme as a
2014 parenthesized argument (e.g., "by (metis (lifting) ...)").
2016 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
2018 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
2020 * New "case_product" attribute to generate a case rule doing multiple
2021 case distinctions at the same time. E.g.
2023 list.exhaust [case_product nat.exhaust]
2025 produces a rule which can be used to perform case distinction on both
2028 * New "eventually_elim" method as a generalized variant of the
2029 eventually_elim* rules. Supports structured proofs.
2031 * Typedef with implicit set definition is considered legacy. Use
2032 "typedef (open)" form instead, which will eventually become the
2035 * Record: code generation can be switched off manually with
2037 declare [[record_coden = false]] -- "default true"
2039 * Datatype: type parameters allow explicit sort constraints.
2041 * Concrete syntax for case expressions includes constraints for source
2042 positions, and thus produces Prover IDE markup for its bindings.
2043 INCOMPATIBILITY for old-style syntax translations that augment the
2044 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
2047 * Clarified attribute "mono_set": pure declaration without modifying
2048 the result of the fact expression.
2050 * More default pred/set conversions on a couple of relation operations
2051 and predicates. Added powers of predicate relations. Consolidation
2052 of some relation theorems:
2054 converse_def ~> converse_unfold
2055 rel_comp_def ~> relcomp_unfold
2056 symp_def ~> (modified, use symp_def and sym_def instead)
2057 transp_def ~> transp_trans
2058 Domain_def ~> Domain_unfold
2059 Range_def ~> Domain_converse [symmetric]
2061 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
2063 See theory "Relation" for examples for making use of pred/set
2064 conversions by means of attributes "to_set" and "to_pred".
2068 * Renamed facts about the power operation on relations, i.e., relpow
2069 to match the constant's name:
2071 rel_pow_1 ~> relpow_1
2072 rel_pow_0_I ~> relpow_0_I
2073 rel_pow_Suc_I ~> relpow_Suc_I
2074 rel_pow_Suc_I2 ~> relpow_Suc_I2
2075 rel_pow_0_E ~> relpow_0_E
2076 rel_pow_Suc_E ~> relpow_Suc_E
2077 rel_pow_E ~> relpow_E
2078 rel_pow_Suc_D2 ~> relpow_Suc_D2
2079 rel_pow_Suc_E2 ~> relpow_Suc_E2
2080 rel_pow_Suc_D2' ~> relpow_Suc_D2'
2081 rel_pow_E2 ~> relpow_E2
2082 rel_pow_add ~> relpow_add
2083 rel_pow_commute ~> relpow
2084 rel_pow_empty ~> relpow_empty:
2085 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
2086 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
2087 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
2088 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
2089 rel_pow_fun_conv ~> relpow_fun_conv
2090 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
2091 rel_pow_finite_bounded ~> relpow_finite_bounded
2092 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
2093 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
2094 single_valued_rel_pow ~> single_valued_relpow
2098 * Theory Relation: Consolidated constant name for relation composition
2099 and corresponding theorem names:
2101 - Renamed constant rel_comp to relcomp.
2103 - Dropped abbreviation pred_comp. Use relcompp instead.
2107 rel_compI ~> relcompI
2108 rel_compEpair ~> relcompEpair
2109 rel_compE ~> relcompE
2110 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
2111 rel_comp_empty1 ~> relcomp_empty1
2112 rel_comp_mono ~> relcomp_mono
2113 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
2114 rel_comp_distrib ~> relcomp_distrib
2115 rel_comp_distrib2 ~> relcomp_distrib2
2116 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
2117 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
2118 single_valued_rel_comp ~> single_valued_relcomp
2119 rel_comp_def ~> relcomp_unfold
2120 converse_rel_comp ~> converse_relcomp
2121 pred_compI ~> relcomppI
2122 pred_compE ~> relcomppE
2123 pred_comp_bot1 ~> relcompp_bot1
2124 pred_comp_bot2 ~> relcompp_bot2
2125 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
2126 pred_comp_mono ~> relcompp_mono
2127 pred_comp_distrib ~> relcompp_distrib
2128 pred_comp_distrib2 ~> relcompp_distrib2
2129 converse_pred_comp ~> converse_relcompp
2131 finite_rel_comp ~> finite_relcomp
2133 set_rel_comp ~> set_relcomp
2137 * Theory Divides: Discontinued redundant theorems about div and mod.
2138 INCOMPATIBILITY, use the corresponding generic theorems instead.
2140 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
2141 zdiv_self ~> div_self
2142 zmod_self ~> mod_self
2145 zdiv_zmod_equality ~> div_mod_equality2
2146 zdiv_zmod_equality2 ~> div_mod_equality
2147 zmod_zdiv_trivial ~> mod_div_trivial
2148 zdiv_zminus_zminus ~> div_minus_minus
2149 zmod_zminus_zminus ~> mod_minus_minus
2150 zdiv_zminus2 ~> div_minus_right
2151 zmod_zminus2 ~> mod_minus_right
2152 zdiv_minus1_right ~> div_minus1_right
2153 zmod_minus1_right ~> mod_minus1_right
2154 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
2155 zmod_zmult1_eq ~> mod_mult_right_eq
2156 zpower_zmod ~> power_mod
2157 zdvd_zmod ~> dvd_mod
2158 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
2159 mod_mult_distrib ~> mult_mod_left
2160 mod_mult_distrib2 ~> mult_mod_right
2162 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
2163 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
2165 * Finite_Set.fold now qualified. INCOMPATIBILITY.
2167 * Consolidated theorem names concerning fold combinators:
2169 inf_INFI_fold_inf ~> inf_INF_fold_inf
2170 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
2171 INFI_fold_inf ~> INF_fold_inf
2172 SUPR_fold_sup ~> SUP_fold_sup
2173 union_set ~> union_set_fold
2174 minus_set ~> minus_set_fold
2175 INFI_set_fold ~> INF_set_fold
2176 SUPR_set_fold ~> SUP_set_fold
2177 INF_code ~> INF_set_foldr
2178 SUP_code ~> SUP_set_foldr
2179 foldr.simps ~> foldr.simps (in point-free formulation)
2180 foldr_fold_rev ~> foldr_conv_fold
2181 foldl_fold ~> foldl_conv_fold
2182 foldr_foldr ~> foldr_conv_foldl
2183 foldl_foldr ~> foldl_conv_foldr
2184 fold_set_remdups ~> fold_set_fold_remdups
2185 fold_set ~> fold_set_fold
2186 fold1_set ~> fold1_set_fold
2190 * Dropped rarely useful theorems concerning fold combinators:
2191 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
2192 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
2193 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
2194 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
2195 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
2196 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
2197 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
2198 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
2199 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
2200 unfolding "foldr_conv_fold" and "foldl_conv_fold".
2202 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
2203 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
2204 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
2205 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
2206 lemmas over fold rather than foldr, or make use of lemmas
2207 fold_conv_foldr and fold_rev.
2209 * Congruence rules Option.map_cong and Option.bind_cong for recursion
2210 through option types.
2212 * "Transitive_Closure.ntrancl": bounded transitive closure on
2215 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
2217 * Theory Int: Discontinued many legacy theorems specific to type int.
2218 INCOMPATIBILITY, use the corresponding generic theorems instead.
2220 zminus_zminus ~> minus_minus
2221 zminus_0 ~> minus_zero
2222 zminus_zadd_distrib ~> minus_add_distrib
2223 zadd_commute ~> add_commute
2224 zadd_assoc ~> add_assoc
2225 zadd_left_commute ~> add_left_commute
2228 zadd_0 ~> add_0_left
2229 zadd_0_right ~> add_0_right
2230 zadd_zminus_inverse2 ~> left_minus
2231 zmult_zminus ~> mult_minus_left
2232 zmult_commute ~> mult_commute
2233 zmult_assoc ~> mult_assoc
2234 zadd_zmult_distrib ~> left_distrib
2235 zadd_zmult_distrib2 ~> right_distrib
2236 zdiff_zmult_distrib ~> left_diff_distrib
2237 zdiff_zmult_distrib2 ~> right_diff_distrib
2238 zmult_1 ~> mult_1_left
2239 zmult_1_right ~> mult_1_right
2240 zle_refl ~> order_refl
2241 zle_trans ~> order_trans
2242 zle_antisym ~> order_antisym
2243 zle_linear ~> linorder_linear
2244 zless_linear ~> linorder_less_linear
2245 zadd_left_mono ~> add_left_mono
2246 zadd_strict_right_mono ~> add_strict_right_mono
2247 zadd_zless_mono ~> add_less_le_mono
2248 int_0_less_1 ~> zero_less_one
2249 int_0_neq_1 ~> zero_neq_one
2251 zpower_zadd_distrib ~> power_add
2252 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
2253 zero_le_zpower_abs ~> zero_le_power_abs
2255 * Theory Deriv: Renamed
2257 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
2259 * Theory Library/Multiset: Improved code generation of multisets.
2261 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
2262 are expressed via type classes again. The special syntax
2263 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
2264 setsum_set, which is now subsumed by Big_Operators.setsum.
2267 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
2268 use theory HOL/Library/Nat_Bijection instead.
2270 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
2271 trees is now inside a type class context. Names of affected
2272 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
2273 theories working directly with raw red-black trees, adapt the names as
2277 bulkload -> rbt_bulkload
2278 del_from_left -> rbt_del_from_left
2279 del_from_right -> rbt_del_from_right
2281 delete -> rbt_delete
2283 insert -> rbt_insert
2284 insertw -> rbt_insert_with
2285 insert_with_key -> rbt_insert_with_key
2286 map_entry -> rbt_map_entry
2287 lookup -> rbt_lookup
2288 sorted -> rbt_sorted
2289 tree_greater -> rbt_greater
2290 tree_less -> rbt_less
2291 tree_less_symbol -> rbt_less_symbol
2293 union_with -> rbt_union_with
2294 union_with_key -> rbt_union_with_key
2297 balance_left_sorted -> balance_left_rbt_sorted
2298 balance_left_tree_greater -> balance_left_rbt_greater
2299 balance_left_tree_less -> balance_left_rbt_less
2300 balance_right_sorted -> balance_right_rbt_sorted
2301 balance_right_tree_greater -> balance_right_rbt_greater
2302 balance_right_tree_less -> balance_right_rbt_less
2303 balance_sorted -> balance_rbt_sorted
2304 balance_tree_greater -> balance_rbt_greater
2305 balance_tree_less -> balance_rbt_less
2306 bulkload_is_rbt -> rbt_bulkload_is_rbt
2307 combine_sorted -> combine_rbt_sorted
2308 combine_tree_greater -> combine_rbt_greater
2309 combine_tree_less -> combine_rbt_less
2310 delete_in_tree -> rbt_delete_in_tree
2311 delete_is_rbt -> rbt_delete_is_rbt
2312 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
2313 del_from_left_tree_less -> rbt_del_from_left_rbt_less
2314 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
2315 del_from_right_tree_less -> rbt_del_from_right_rbt_less
2316 del_in_tree -> rbt_del_in_tree
2317 del_inv1_inv2 -> rbt_del_inv1_inv2
2318 del_sorted -> rbt_del_rbt_sorted
2319 del_tree_greater -> rbt_del_rbt_greater
2320 del_tree_less -> rbt_del_rbt_less
2321 dom_lookup_Branch -> dom_rbt_lookup_Branch
2322 entries_lookup -> entries_rbt_lookup
2323 finite_dom_lookup -> finite_dom_rbt_lookup
2324 insert_sorted -> rbt_insert_rbt_sorted
2325 insertw_is_rbt -> rbt_insertw_is_rbt
2326 insertwk_is_rbt -> rbt_insertwk_is_rbt
2327 insertwk_sorted -> rbt_insertwk_rbt_sorted
2328 insertw_sorted -> rbt_insertw_rbt_sorted
2329 ins_sorted -> ins_rbt_sorted
2330 ins_tree_greater -> ins_rbt_greater
2331 ins_tree_less -> ins_rbt_less
2332 is_rbt_sorted -> is_rbt_rbt_sorted
2333 lookup_balance -> rbt_lookup_balance
2334 lookup_bulkload -> rbt_lookup_rbt_bulkload
2335 lookup_delete -> rbt_lookup_rbt_delete
2336 lookup_Empty -> rbt_lookup_Empty
2337 lookup_from_in_tree -> rbt_lookup_from_in_tree
2338 lookup_in_tree -> rbt_lookup_in_tree
2339 lookup_ins -> rbt_lookup_ins
2340 lookup_insert -> rbt_lookup_rbt_insert
2341 lookup_insertw -> rbt_lookup_rbt_insertw
2342 lookup_insertwk -> rbt_lookup_rbt_insertwk
2343 lookup_keys -> rbt_lookup_keys
2344 lookup_map -> rbt_lookup_map
2345 lookup_map_entry -> rbt_lookup_rbt_map_entry
2346 lookup_tree_greater -> rbt_lookup_rbt_greater
2347 lookup_tree_less -> rbt_lookup_rbt_less
2348 lookup_union -> rbt_lookup_rbt_union
2349 map_entry_color_of -> rbt_map_entry_color_of
2350 map_entry_inv1 -> rbt_map_entry_inv1
2351 map_entry_inv2 -> rbt_map_entry_inv2
2352 map_entry_is_rbt -> rbt_map_entry_is_rbt
2353 map_entry_sorted -> rbt_map_entry_rbt_sorted
2354 map_entry_tree_greater -> rbt_map_entry_rbt_greater
2355 map_entry_tree_less -> rbt_map_entry_rbt_less
2356 map_tree_greater -> map_rbt_greater
2357 map_tree_less -> map_rbt_less
2358 map_sorted -> map_rbt_sorted
2359 paint_sorted -> paint_rbt_sorted
2360 paint_lookup -> paint_rbt_lookup
2361 paint_tree_greater -> paint_rbt_greater
2362 paint_tree_less -> paint_rbt_less
2363 sorted_entries -> rbt_sorted_entries
2364 tree_greater_eq_trans -> rbt_greater_eq_trans
2365 tree_greater_nit -> rbt_greater_nit
2366 tree_greater_prop -> rbt_greater_prop
2367 tree_greater_simps -> rbt_greater_simps
2368 tree_greater_trans -> rbt_greater_trans
2369 tree_less_eq_trans -> rbt_less_eq_trans
2370 tree_less_nit -> rbt_less_nit
2371 tree_less_prop -> rbt_less_prop
2372 tree_less_simps -> rbt_less_simps
2373 tree_less_trans -> rbt_less_trans
2374 tree_ord_props -> rbt_ord_props
2375 union_Branch -> rbt_union_Branch
2376 union_is_rbt -> rbt_union_is_rbt
2377 unionw_is_rbt -> rbt_unionw_is_rbt
2378 unionwk_is_rbt -> rbt_unionwk_is_rbt
2379 unionwk_sorted -> rbt_unionwk_rbt_sorted
2381 * Theory HOL/Library/Float: Floating point numbers are now defined as
2382 a subset of the real numbers. All operations are defined using the
2383 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
2390 round_down -> float_round_down
2391 round_up -> float_round_up
2395 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
2398 abs_float_def -> Float.compute_float_abs
2399 bitlen_ge0 -> bitlen_nonneg
2400 bitlen.simps -> Float.compute_bitlen
2401 float_components -> Float_mantissa_exponent
2402 float_divl.simps -> Float.compute_float_divl
2403 float_divr.simps -> Float.compute_float_divr
2404 float_eq_odd -> mult_powr_eq_mult_powr_iff
2405 float_power -> real_of_float_power
2406 lapprox_posrat_def -> Float.compute_lapprox_posrat
2407 lapprox_rat.simps -> Float.compute_lapprox_rat
2408 le_float_def' -> Float.compute_float_le
2409 le_float_def -> less_eq_float.rep_eq
2410 less_float_def' -> Float.compute_float_less
2411 less_float_def -> less_float.rep_eq
2412 normfloat_def -> Float.compute_normfloat
2413 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
2414 normfloat -> normfloat_def
2415 normfloat_unique -> use normfloat_def
2416 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
2417 one_float_def -> Float.compute_float_one
2418 plus_float_def -> Float.compute_float_plus
2419 rapprox_posrat_def -> Float.compute_rapprox_posrat
2420 rapprox_rat.simps -> Float.compute_rapprox_rat
2421 real_of_float_0 -> zero_float.rep_eq
2422 real_of_float_1 -> one_float.rep_eq
2423 real_of_float_abs -> abs_float.rep_eq
2424 real_of_float_add -> plus_float.rep_eq
2425 real_of_float_minus -> uminus_float.rep_eq
2426 real_of_float_mult -> times_float.rep_eq
2427 real_of_float_simp -> Float.rep_eq
2428 real_of_float_sub -> minus_float.rep_eq
2429 round_down.simps -> Float.compute_float_round_down
2430 round_up.simps -> Float.compute_float_round_up
2431 times_float_def -> Float.compute_float_times
2432 uminus_float_def -> Float.compute_float_uminus
2433 zero_float_def -> Float.compute_float_zero
2435 Lemmas not necessary anymore, use the transfer method:
2436 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
2437 float_divr, float_le_simp, float_less1_mantissa_bound,
2438 float_less_simp, float_less_zero, float_le_zero,
2439 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
2440 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
2441 lapprox_rat_bottom, normalized_float, rapprox_posrat,
2442 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
2443 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
2444 round_up, zero_le_float, zero_less_float
2446 * New theory HOL/Library/DAList provides an abstract type for
2447 association lists with distinct keys.
2449 * Session HOL/IMP: Added new theory of abstract interpretation of
2452 * Session HOL-Import: Re-implementation from scratch is faster,
2453 simpler, and more scalable. Requires a proof bundle, which is
2454 available as an external component. Discontinued old (and mostly
2455 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
2457 * Session HOL-Word: Discontinued many redundant theorems specific to
2458 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
2461 word_sub_alt ~> word_sub_wi
2462 word_add_alt ~> word_add_def
2463 word_mult_alt ~> word_mult_def
2464 word_minus_alt ~> word_minus_def
2465 word_0_alt ~> word_0_wi
2466 word_1_alt ~> word_1_wi
2467 word_add_0 ~> add_0_left
2468 word_add_0_right ~> add_0_right
2469 word_mult_1 ~> mult_1_left
2470 word_mult_1_right ~> mult_1_right
2471 word_add_commute ~> add_commute
2472 word_add_assoc ~> add_assoc
2473 word_add_left_commute ~> add_left_commute
2474 word_mult_commute ~> mult_commute
2475 word_mult_assoc ~> mult_assoc
2476 word_mult_left_commute ~> mult_left_commute
2477 word_left_distrib ~> left_distrib
2478 word_right_distrib ~> right_distrib
2479 word_left_minus ~> left_minus
2480 word_diff_0_right ~> diff_0_right
2481 word_diff_self ~> diff_self
2482 word_sub_def ~> diff_minus
2483 word_diff_minus ~> diff_minus
2484 word_add_ac ~> add_ac
2485 word_mult_ac ~> mult_ac
2486 word_plus_ac0 ~> add_0_left add_0_right add_ac
2487 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
2488 word_order_trans ~> order_trans
2489 word_order_refl ~> order_refl
2490 word_order_antisym ~> order_antisym
2491 word_order_linear ~> linorder_linear
2492 lenw1_zero_neq_one ~> zero_neq_one
2493 word_number_of_eq ~> number_of_eq
2494 word_of_int_add_hom ~> wi_hom_add
2495 word_of_int_sub_hom ~> wi_hom_sub
2496 word_of_int_mult_hom ~> wi_hom_mult
2497 word_of_int_minus_hom ~> wi_hom_neg
2498 word_of_int_succ_hom ~> wi_hom_succ
2499 word_of_int_pred_hom ~> wi_hom_pred
2500 word_of_int_0_hom ~> word_0_wi
2501 word_of_int_1_hom ~> word_1_wi
2503 * Session HOL-Word: New proof method "word_bitwise" for splitting
2504 machine word equalities and inequalities into logical circuits,
2505 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
2506 multiplication, shifting by constants, bitwise operators and numeric
2507 constants. Requires fixed-length word types, not 'a word. Solves
2508 many standard word identities outright and converts more into first
2509 order problems amenable to blast or similar. See also examples in
2510 HOL/Word/Examples/WordExamples.thy.
2512 * Session HOL-Probability: Introduced the type "'a measure" to
2513 represent measures, this replaces the records 'a algebra and 'a
2514 measure_space. The locales based on subset_class now have two
2515 locale-parameters the space \<Omega> and the set of measurable sets M.
2516 The product of probability spaces uses now the same constant as the
2517 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
2518 measure". Most constants are defined now outside of locales and gain
2519 an additional parameter, like null_sets, almost_eventually or \<mu>'.
2520 Measure space constructions for distributions and densities now got
2521 their own constants distr and density. Instead of using locales to
2522 describe measure spaces with a finite space, the measure count_space
2523 and point_measure is introduced. INCOMPATIBILITY.
2527 finite_measure.\<mu>' -> measure
2528 product_algebra_generator -> prod_algebra
2529 product_prob_space.emb -> prod_emb
2530 product_prob_space.infprod_algebra -> PiM
2533 completeable_measure_space
2534 finite_measure_space
2536 finite_product_finite_prob_space
2537 finite_product_sigma_algebra
2538 finite_sigma_algebra
2540 pair_finite_prob_space
2541 pair_finite_sigma_algebra
2544 product_sigma_algebra
2548 distribution -> use distr measure, or distributed predicate
2550 joint_distribution -> use distr measure, or distributed predicate
2551 pair_measure_generator
2552 product_prob_space.infprod_algebra -> use PiM
2555 Replacement theorems:
2556 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
2557 finite_measure.empty_measure -> measure_empty
2558 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
2559 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
2560 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
2561 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
2562 finite_measure.finite_measure -> finite_measure.emeasure_finite
2563 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
2564 finite_measure.positive_measure' -> measure_nonneg
2565 finite_measure.real_measure -> finite_measure.emeasure_real
2566 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
2567 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
2568 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
2569 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
2570 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
2571 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
2572 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
2573 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
2574 information_space.entropy_commute -> information_space.entropy_commute_simple
2575 information_space.entropy_eq -> information_space.entropy_simple_distributed
2576 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
2577 information_space.entropy_positive -> information_space.entropy_nonneg_simple
2578 information_space.entropy_uniform_max -> information_space.entropy_uniform
2579 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
2580 information_space.KL_eq_0 -> information_space.KL_same_eq_0
2581 information_space.KL_ge_0 -> information_space.KL_nonneg
2582 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
2583 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
2584 Int_stable_cuboids -> Int_stable_atLeastAtMost
2585 Int_stable_product_algebra_generator -> positive_integral
2586 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
2587 measure_space.additive -> emeasure_additive
2588 measure_space.AE_iff_null_set -> AE_iff_null
2589 measure_space.almost_everywhere_def -> eventually_ae_filter
2590 measure_space.almost_everywhere_vimage -> AE_distrD
2591 measure_space.continuity_from_above -> INF_emeasure_decseq
2592 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
2593 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
2594 measure_space.continuity_from_below -> SUP_emeasure_incseq
2595 measure_space_density -> emeasure_density
2596 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
2597 measure_space.integrable_vimage -> integrable_distr
2598 measure_space.integral_translated_density -> integral_density
2599 measure_space.integral_vimage -> integral_distr
2600 measure_space.measure_additive -> plus_emeasure
2601 measure_space.measure_compl -> emeasure_compl
2602 measure_space.measure_countable_increasing -> emeasure_countable_increasing
2603 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
2604 measure_space.measure_decseq -> decseq_emeasure
2605 measure_space.measure_Diff -> emeasure_Diff
2606 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
2607 measure_space.measure_eq_0 -> emeasure_eq_0
2608 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
2609 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
2610 measure_space.measure_incseq -> incseq_emeasure
2611 measure_space.measure_insert -> emeasure_insert
2612 measure_space.measure_mono -> emeasure_mono
2613 measure_space.measure_not_negative -> emeasure_not_MInf
2614 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
2615 measure_space.measure_setsum -> setsum_emeasure
2616 measure_space.measure_setsum_split -> setsum_emeasure_cover
2617 measure_space.measure_space_vimage -> emeasure_distr
2618 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
2619 measure_space.measure_subadditive -> subadditive
2620 measure_space.measure_top -> emeasure_space
2621 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
2622 measure_space.measure_Un_null_set -> emeasure_Un_null_set
2623 measure_space.positive_integral_translated_density -> positive_integral_density
2624 measure_space.positive_integral_vimage -> positive_integral_distr
2625 measure_space.real_continuity_from_above -> Lim_measure_decseq
2626 measure_space.real_continuity_from_below -> Lim_measure_incseq
2627 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
2628 measure_space.real_measure_Diff -> measure_Diff
2629 measure_space.real_measure_finite_Union -> measure_finite_Union
2630 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
2631 measure_space.real_measure_subadditive -> measure_subadditive
2632 measure_space.real_measure_Union -> measure_Union
2633 measure_space.real_measure_UNION -> measure_UNION
2634 measure_space.simple_function_vimage -> simple_function_comp
2635 measure_space.simple_integral_vimage -> simple_integral_distr
2636 measure_space.simple_integral_vimage -> simple_integral_distr
2637 measure_unique_Int_stable -> measure_eqI_generator_eq
2638 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
2639 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
2640 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
2641 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
2642 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
2643 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
2644 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
2645 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
2646 pair_sigma_algebra.sets_swap -> sets_pair_swap
2647 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
2648 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
2649 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
2650 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
2651 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
2652 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
2653 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
2654 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
2655 prob_space.measure_space_1 -> prob_space.emeasure_space_1
2656 prob_space.prob_space_vimage -> prob_space_distr
2657 prob_space.random_variable_restrict -> measurable_restrict
2658 prob_space_unique_Int_stable -> measure_eqI_prob_space
2659 product_algebraE -> prod_algebraE_all
2660 product_algebra_generator_der -> prod_algebra_eq_finite
2661 product_algebra_generator_into_space -> prod_algebra_sets_into_space
2662 product_algebraI -> sets_PiM_I_finite
2663 product_measure_exists -> product_sigma_finite.sigma_finite
2664 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
2665 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
2666 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
2667 product_prob_space.measurable_component -> measurable_component_singleton
2668 product_prob_space.measurable_emb -> measurable_prod_emb
2669 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
2670 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
2671 product_prob_space.measure_emb -> emeasure_prod_emb
2672 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
2673 product_sigma_algebra.product_algebra_into_space -> space_closed
2674 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
2675 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
2676 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
2677 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
2678 sets_product_algebra -> sets_PiM
2679 sigma_algebra.measurable_sigma -> measurable_measure_of
2680 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
2681 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
2682 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
2683 space_product_algebra -> space_PiM
2685 * Session HOL-TPTP: support to parse and import TPTP problems (all
2686 languages) into Isabelle/HOL.
2691 * New "case_product" attribute (see HOL).
2696 * Greater support for structured proofs involving induction or case
2699 * Much greater use of mathematical symbols.
2701 * Removal of many ML theorem bindings. INCOMPATIBILITY.
2706 * Antiquotation @{keyword "name"} produces a parser for outer syntax
2707 from a minor keyword introduced via theory header declaration.
2709 * Antiquotation @{command_spec "name"} produces the
2710 Outer_Syntax.command_spec from a major keyword introduced via theory
2711 header declaration; it can be passed to Outer_Syntax.command etc.
2713 * Local_Theory.define no longer hard-wires default theorem name
2714 "foo_def", but retains the binding as given. If that is Binding.empty
2715 / Attrib.empty_binding, the result is not registered as user-level
2716 fact. The Local_Theory.define_internal variant allows to specify a
2717 non-empty name (used for the foundation in the background theory),
2718 while omitting the fact binding in the user-context. Potential
2719 INCOMPATIBILITY for derived definitional packages: need to specify
2720 naming policy for primitive definitions more explicitly.
2722 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
2723 conformance with similar operations in structure Term and Logic.
2725 * Antiquotation @{attributes [...]} embeds attribute source
2726 representation into the ML text, which is particularly useful with
2727 declarations like Local_Theory.note.
2729 * Structure Proof_Context follows standard naming scheme. Old
2730 ProofContext has been discontinued. INCOMPATIBILITY.
2732 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
2733 change of semantics: update is applied to auxiliary local theory
2736 * Modernized some old-style infix operations:
2738 addeqcongs ~> Simplifier.add_eqcong
2739 deleqcongs ~> Simplifier.del_eqcong
2740 addcongs ~> Simplifier.add_cong
2741 delcongs ~> Simplifier.del_cong
2742 setmksimps ~> Simplifier.set_mksimps
2743 setmkcong ~> Simplifier.set_mkcong
2744 setmksym ~> Simplifier.set_mksym
2745 setmkeqTrue ~> Simplifier.set_mkeqTrue
2746 settermless ~> Simplifier.set_termless
2747 setsubgoaler ~> Simplifier.set_subgoaler
2748 addsplits ~> Splitter.add_split
2749 delsplits ~> Splitter.del_split
2754 * USER_HOME settings variable points to cross-platform user home
2755 directory, which coincides with HOME on POSIX systems only. Likewise,
2756 the Isabelle path specification "~" now expands to $USER_HOME, instead
2757 of former $HOME. A different default for USER_HOME may be set
2758 explicitly in shell environment, before Isabelle settings are
2759 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
2760 the generic user home was intended.
2762 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
2763 notation, which is useful for the jEdit file browser, for example.
2765 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
2770 New in Isabelle2011-1 (October 2011)
2771 ------------------------------------
2775 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
2776 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
2778 - Management of multiple theory files directly from the editor
2779 buffer store -- bypassing the file-system (no requirement to save
2780 files for checking).
2782 - Markup of formal entities within the text buffer, with semantic
2783 highlighting, tooltips and hyperlinks to jump to defining source
2786 - Improved text rendering, with sub/superscripts in the source
2787 buffer (including support for copy/paste wrt. output panel, HTML
2788 theory output and other non-Isabelle text boxes).
2790 - Refined scheduling of proof checking and printing of results,
2791 based on interactive editor view. (Note: jEdit folding and
2792 narrowing allows to restrict buffer perspectives explicitly.)
2794 - Reduced CPU performance requirements, usable on machines with few
2797 - Reduced memory requirements due to pruning of unused document
2798 versions (garbage collection).
2800 See also ~~/src/Tools/jEdit/README.html for further information,
2801 including some remaining limitations.
2803 * Theory loader: source files are exclusively located via the master
2804 directory of each theory node (where the .thy file itself resides).
2805 The global load path (such as src/HOL/Library) has been discontinued.
2806 Note that the path element ~~ may be used to reference theories in the
2807 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
2810 * Theory loader: source files are identified by content via SHA1
2811 digests. Discontinued former path/modtime identification and optional
2812 ISABELLE_FILE_IDENT plugin scripts.
2814 * Parallelization of nested Isar proofs is subject to
2815 Goal.parallel_proofs_threshold (default 100). See also isabelle
2818 * Name space: former unsynchronized references are now proper
2819 configuration options, with more conventional names:
2821 long_names ~> names_long
2822 short_names ~> names_short
2823 unique_names ~> names_unique
2825 Minor INCOMPATIBILITY, need to declare options in context like this:
2827 declare [[names_unique = false]]
2829 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
2830 that the result needs to be unique, which means fact specifications
2831 may have to be refined after enriching a proof context.
2833 * Attribute "case_names" has been refined: the assumptions in each case
2834 can be named now by following the case name with [name1 name2 ...].
2836 * Isabelle/Isar reference manual has been updated and extended:
2837 - "Synopsis" provides a catalog of main Isar language concepts.
2838 - Formal references in syntax diagrams, via @{rail} antiquotation.
2839 - Updated material from classic "ref" manual, notably about
2840 "Classical Reasoner".
2845 * Class bot and top require underlying partial order rather than
2846 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
2848 * Class complete_lattice: generalized a couple of lemmas from sets;
2849 generalized theorems INF_cong and SUP_cong. New type classes for
2850 complete boolean algebras and complete linear orders. Lemmas
2851 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
2852 class complete_linorder.
2854 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
2855 Sup_fun_def, Inf_apply, Sup_apply.
2857 Removed redundant lemmas (the right hand side gives hints how to
2858 replace them for (metis ...), or (simp only: ...) proofs):
2860 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
2861 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
2862 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
2863 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
2864 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
2865 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
2866 Inter_def ~> INF_def, image_def
2867 Union_def ~> SUP_def, image_def
2868 INT_eq ~> INF_def, and image_def
2869 UN_eq ~> SUP_def, and image_def
2870 INF_subset ~> INF_superset_mono [OF _ order_refl]
2872 More consistent and comprehensive names:
2874 INTER_eq_Inter_image ~> INF_def
2875 UNION_eq_Union_image ~> SUP_def
2878 INF_leI ~> INF_lower
2879 INF_leI2 ~> INF_lower2
2880 le_INFI ~> INF_greatest
2881 le_SUPI ~> SUP_upper
2882 le_SUPI2 ~> SUP_upper2
2883 SUP_leI ~> SUP_least
2884 INFI_bool_eq ~> INF_bool_eq
2885 SUPR_bool_eq ~> SUP_bool_eq
2886 INFI_apply ~> INF_apply
2887 SUPR_apply ~> SUP_apply
2888 INTER_def ~> INTER_eq
2889 UNION_def ~> UNION_eq
2893 * Renamed theory Complete_Lattice to Complete_Lattices.
2896 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
2897 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
2898 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
2899 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
2901 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
2902 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
2903 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
2906 * Added syntactic classes "inf" and "sup" for the respective
2907 constants. INCOMPATIBILITY: Changes in the argument order of the
2908 (mostly internal) locale predicates for some derived classes.
2910 * Theorem collections ball_simps and bex_simps do not contain theorems
2911 referring to UNION any longer; these have been moved to collection
2912 UN_ball_bex_simps. INCOMPATIBILITY.
2914 * Theory Archimedean_Field: floor now is defined as parameter of a
2915 separate type class floor_ceiling.
2917 * Theory Finite_Set: more coherent development of fold_set locales:
2919 locale fun_left_comm ~> locale comp_fun_commute
2920 locale fun_left_comm_idem ~> locale comp_fun_idem
2922 Both use point-free characterization; interpretation proofs may need
2923 adjustment. INCOMPATIBILITY.
2925 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
2926 accordance with standard mathematical terminology. INCOMPATIBILITY.
2928 * Theory Complex_Main: The locale interpretations for the
2929 bounded_linear and bounded_bilinear locales have been removed, in
2930 order to reduce the number of duplicate lemmas. Users must use the
2931 original names for distributivity theorems, potential INCOMPATIBILITY.
2933 divide.add ~> add_divide_distrib
2934 divide.diff ~> diff_divide_distrib
2935 divide.setsum ~> setsum_divide_distrib
2936 mult.add_right ~> right_distrib
2937 mult.diff_right ~> right_diff_distrib
2938 mult_right.setsum ~> setsum_right_distrib
2939 mult_left.diff ~> left_diff_distrib
2941 * Theory Complex_Main: Several redundant theorems have been removed or
2942 replaced by more general versions. INCOMPATIBILITY.
2944 real_diff_def ~> minus_real_def
2945 real_divide_def ~> divide_real_def
2946 real_less_def ~> less_le
2947 real_abs_def ~> abs_real_def
2948 real_sgn_def ~> sgn_real_def
2949 real_mult_commute ~> mult_commute
2950 real_mult_assoc ~> mult_assoc
2951 real_mult_1 ~> mult_1_left
2952 real_add_mult_distrib ~> left_distrib
2953 real_zero_not_eq_one ~> zero_neq_one
2954 real_mult_inverse_left ~> left_inverse
2955 INVERSE_ZERO ~> inverse_zero
2956 real_le_refl ~> order_refl
2957 real_le_antisym ~> order_antisym
2958 real_le_trans ~> order_trans
2959 real_le_linear ~> linear
2960 real_le_eq_diff ~> le_iff_diff_le_0
2961 real_add_left_mono ~> add_left_mono
2962 real_mult_order ~> mult_pos_pos
2963 real_mult_less_mono2 ~> mult_strict_left_mono
2964 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
2965 real_0_le_divide_iff ~> zero_le_divide_iff
2966 realpow_two_disj ~> power2_eq_iff
2967 real_squared_diff_one_factored ~> square_diff_one_factored
2968 realpow_two_diff ~> square_diff_square_factored
2969 reals_complete2 ~> complete_real
2970 real_sum_squared_expand ~> power2_sum
2971 exp_ln_eq ~> ln_unique
2973 expi_zero ~> exp_zero
2974 lemma_DERIV_subst ~> DERIV_cong
2975 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
2976 LIMSEQ_const ~> tendsto_const
2977 LIMSEQ_norm ~> tendsto_norm
2978 LIMSEQ_add ~> tendsto_add
2979 LIMSEQ_minus ~> tendsto_minus
2980 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
2981 LIMSEQ_diff ~> tendsto_diff
2982 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
2983 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
2984 LIMSEQ_mult ~> tendsto_mult
2985 LIMSEQ_inverse ~> tendsto_inverse
2986 LIMSEQ_divide ~> tendsto_divide
2987 LIMSEQ_pow ~> tendsto_power
2988 LIMSEQ_setsum ~> tendsto_setsum
2989 LIMSEQ_setprod ~> tendsto_setprod
2990 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
2991 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
2992 LIMSEQ_imp_rabs ~> tendsto_rabs
2993 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
2994 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
2995 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
2996 LIMSEQ_Complex ~> tendsto_Complex
2997 LIM_ident ~> tendsto_ident_at
2998 LIM_const ~> tendsto_const
2999 LIM_add ~> tendsto_add
3000 LIM_add_zero ~> tendsto_add_zero
3001 LIM_minus ~> tendsto_minus
3002 LIM_diff ~> tendsto_diff
3003 LIM_norm ~> tendsto_norm
3004 LIM_norm_zero ~> tendsto_norm_zero
3005 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
3006 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
3007 LIM_rabs ~> tendsto_rabs
3008 LIM_rabs_zero ~> tendsto_rabs_zero
3009 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
3010 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
3011 LIM_compose ~> tendsto_compose
3012 LIM_mult ~> tendsto_mult
3013 LIM_scaleR ~> tendsto_scaleR
3014 LIM_of_real ~> tendsto_of_real
3015 LIM_power ~> tendsto_power
3016 LIM_inverse ~> tendsto_inverse
3017 LIM_sgn ~> tendsto_sgn
3018 isCont_LIM_compose ~> isCont_tendsto_compose
3019 bounded_linear.LIM ~> bounded_linear.tendsto
3020 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
3021 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
3022 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
3023 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
3024 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
3025 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
3027 * Theory Complex_Main: The definition of infinite series was
3028 generalized. Now it is defined on the type class {topological_space,
3029 comm_monoid_add}. Hence it is useable also for extended real numbers.
3031 * Theory Complex_Main: The complex exponential function "expi" is now
3032 a type-constrained abbreviation for "exp :: complex => complex"; thus
3033 several polymorphic lemmas about "exp" are now applicable to "expi".
3037 - Theory Library/Code_Char_ord provides native ordering of
3038 characters in the target language.
3040 - Commands code_module and code_library are legacy, use export_code
3043 - Method "evaluation" is legacy, use method "eval" instead.
3045 - Legacy evaluator "SML" is deactivated by default. May be
3046 reactivated by the following theory command:
3048 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
3050 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
3052 * New proof method "induction" that gives induction hypotheses the
3053 name "IH", thus distinguishing them from further hypotheses that come
3054 from rule induction. The latter are still called "hyps". Method
3055 "induction" is a thin wrapper around "induct" and follows the same
3058 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
3059 still available as a legacy feature for some time.
3062 - Added "need" and "total_consts" options.
3063 - Reintroduced "show_skolems" option by popular demand.
3064 - Renamed attribute: nitpick_def ~> nitpick_unfold.
3068 - Use quasi-sound (and efficient) translations by default.
3069 - Added support for the following provers: E-ToFoF, LEO-II,
3070 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
3071 - Automatically preplay and minimize proofs before showing them if
3072 this can be done within reasonable time.
3073 - sledgehammer available_provers ~> sledgehammer supported_provers.
3075 - Added "preplay_timeout", "slicing", "type_enc", "sound",
3076 "max_mono_iters", and "max_new_mono_instances" options.
3077 - Removed "explicit_apply" and "full_types" options as well as "Full
3078 Types" Proof General menu item. INCOMPATIBILITY.
3081 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
3082 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
3086 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
3087 "elim:" options. INCOMPATIBILITY.
3088 - Introduced 'try' that not only runs 'try_methods' but also
3089 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
3092 - Added "eval" option to evaluate terms for the found counterexample
3093 (currently only supported by the default (exhaustive) tester).
3094 - Added post-processing of terms to obtain readable counterexamples
3095 (currently only supported by the default (exhaustive) tester).
3096 - New counterexample generator quickcheck[narrowing] enables
3097 narrowing-based testing. Requires the Glasgow Haskell compiler
3098 with its installation location defined in the Isabelle settings
3099 environment as ISABELLE_GHC.
3100 - Removed quickcheck tester "SML" based on the SML code generator
3101 (formly in HOL/Library).
3103 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
3104 use 'partial_function' instead.
3106 * Theory Library/Extended_Reals replaces now the positive extended
3107 reals found in probability theory. This file is extended by
3108 Multivariate_Analysis/Extended_Real_Limits.
3110 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
3111 from where it must be imported explicitly if it is really required.
3114 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
3115 been moved here. INCOMPATIBILITY.
3117 * Theory Library/Saturated provides type of numbers with saturated
3120 * Theory Library/Product_Lattice defines a pointwise ordering for the
3121 product type 'a * 'b, and provides instance proofs for various order
3122 and lattice type classes.
3124 * Theory Library/Countable now provides the "countable_datatype" proof
3125 method for proving "countable" class instances for datatypes.
3127 * Theory Library/Cset_Monad allows do notation for computable sets
3128 (cset) via the generic monad ad-hoc overloading facility.
3130 * Library: Theories of common data structures are split into theories
3131 for implementation, an invariant-ensuring type, and connection to an
3132 abstract type. INCOMPATIBILITY.
3134 - RBT is split into RBT and RBT_Mapping.
3135 - AssocList is split and renamed into AList and AList_Mapping.
3136 - DList is split into DList_Impl, DList, and DList_Cset.
3137 - Cset is split into Cset and List_Cset.
3139 * Theory Library/Nat_Infinity has been renamed to
3140 Library/Extended_Nat, with name changes of the following types and
3143 type inat ~> type enat
3145 Infty ~> infinity (overloaded)
3149 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
3150 been renamed accordingly. INCOMPATIBILITY.
3152 * Session Multivariate_Analysis: The euclidean_space type class now
3153 fixes a constant "Basis :: 'a set" consisting of the standard
3154 orthonormal basis for the type. Users now have the option of
3155 quantifying over this set instead of using the "basis" function, e.g.
3156 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
3158 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
3159 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
3160 "Cart_nth" and "Cart_lambda" have been respectively renamed to
3161 "vec_nth" and "vec_lambda"; theorems mentioning those names have
3162 changed to match. Definition theorems for overloaded constants now use
3163 the standard "foo_vec_def" naming scheme. A few other theorems have
3164 been renamed as follows (INCOMPATIBILITY):
3166 Cart_eq ~> vec_eq_iff
3167 dist_nth_le_cart ~> dist_vec_nth_le
3168 tendsto_vector ~> vec_tendstoI
3169 Cauchy_vector ~> vec_CauchyI
3171 * Session Multivariate_Analysis: Several duplicate theorems have been
3172 removed, and other theorems have been renamed or replaced with more
3173 general versions. INCOMPATIBILITY.
3175 finite_choice ~> finite_set_choice
3176 eventually_conjI ~> eventually_conj
3177 eventually_and ~> eventually_conj_iff
3178 eventually_false ~> eventually_False
3179 setsum_norm ~> norm_setsum
3180 Lim_sequentially ~> LIMSEQ_def
3181 Lim_ident_at ~> LIM_ident
3182 Lim_const ~> tendsto_const
3183 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
3184 Lim_neg ~> tendsto_minus
3185 Lim_add ~> tendsto_add
3186 Lim_sub ~> tendsto_diff
3187 Lim_mul ~> tendsto_scaleR
3188 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
3189 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
3190 Lim_linear ~> bounded_linear.tendsto
3191 Lim_component ~> tendsto_euclidean_component
3192 Lim_component_cart ~> tendsto_vec_nth
3193 Lim_inner ~> tendsto_inner [OF tendsto_const]
3194 dot_lsum ~> inner_setsum_left
3195 dot_rsum ~> inner_setsum_right
3196 continuous_cmul ~> continuous_scaleR [OF continuous_const]
3197 continuous_neg ~> continuous_minus
3198 continuous_sub ~> continuous_diff
3199 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
3200 continuous_mul ~> continuous_scaleR
3201 continuous_inv ~> continuous_inverse
3202 continuous_at_within_inv ~> continuous_at_within_inverse
3203 continuous_at_inv ~> continuous_at_inverse
3204 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
3205 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
3206 continuous_at_component ~> continuous_component [OF continuous_at_id]
3207 continuous_on_neg ~> continuous_on_minus
3208 continuous_on_sub ~> continuous_on_diff
3209 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
3210 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
3211 continuous_on_mul ~> continuous_on_scaleR
3212 continuous_on_mul_real ~> continuous_on_mult
3213 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
3214 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
3215 continuous_on_inverse ~> continuous_on_inv
3216 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
3217 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
3218 subset_interior ~> interior_mono
3219 subset_closure ~> closure_mono
3220 closure_univ ~> closure_UNIV
3221 real_arch_lt ~> reals_Archimedean2
3222 real_arch ~> reals_Archimedean3
3223 real_abs_norm ~> abs_norm_cancel
3224 real_abs_sub_norm ~> norm_triangle_ineq3
3225 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
3227 * Session HOL-Probability:
3228 - Caratheodory's extension lemma is now proved for ring_of_sets.
3229 - Infinite products of probability measures are now available.
3230 - Sigma closure is independent, if the generator is independent
3231 - Use extended reals instead of positive extended
3232 reals. INCOMPATIBILITY.
3234 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
3236 expand_fun_below ~> fun_below_iff
3237 below_fun_ext ~> fun_belowI
3238 expand_cfun_eq ~> cfun_eq_iff
3239 ext_cfun ~> cfun_eqI
3240 expand_cfun_below ~> cfun_below_iff
3241 below_cfun_ext ~> cfun_belowI
3242 monofun_fun_fun ~> fun_belowD
3243 monofun_fun_arg ~> monofunE
3244 monofun_lub_fun ~> adm_monofun [THEN admD]
3245 cont_lub_fun ~> adm_cont [THEN admD]
3246 cont2cont_Rep_CFun ~> cont2cont_APP
3247 cont_Rep_CFun_app ~> cont_APP_app
3248 cont_Rep_CFun_app_app ~> cont_APP_app_app
3249 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
3250 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
3251 contlub_cfun ~> lub_APP [symmetric]
3252 contlub_LAM ~> lub_LAM [symmetric]
3255 lift_distinct1 ~> lift.distinct(1)
3256 lift_distinct2 ~> lift.distinct(2)
3257 Def_not_UU ~> lift.distinct(2)
3258 Def_inject ~> lift.inject
3259 below_UU_iff ~> below_bottom_iff
3260 eq_UU_iff ~> eq_bottom_iff
3263 *** Document preparation ***
3265 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
3266 isar-ref manual, both for description and actual application of the
3269 * Antiquotation @{value} evaluates the given term and presents its
3272 * Antiquotations: term style "isub" provides ad-hoc conversion of
3273 variables x1, y23 into subscripted form x\<^isub>1,
3274 y\<^isub>2\<^isub>3.
3276 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
3277 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
3279 * Localized \isabellestyle switch can be used within blocks or groups
3282 \isabellestyle{it} %preferred default
3283 {\isabellestylett @{text "typewriter stuff"}}
3285 * Discontinued special treatment of hard tabulators. Implicit
3286 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
3292 * The inner syntax of sort/type/term/prop supports inlined YXML
3293 representations within quoted string tokens. By encoding logical
3294 entities via Term_XML (in ML or Scala) concrete syntax can be
3295 bypassed, which is particularly useful for producing bits of text
3296 under external program control.
3298 * Antiquotations for ML and document preparation are managed as theory
3299 data, which requires explicit setup.
3301 * Isabelle_Process.is_active allows tools to check if the official
3302 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
3303 (better known as Proof General).
3305 * Structure Proof_Context follows standard naming scheme. Old
3306 ProofContext is still available for some time as legacy alias.
3308 * Structure Timing provides various operations for timing; supersedes
3309 former start_timing/end_timing etc.
3311 * Path.print is the official way to show file-system paths to users
3312 (including quotes etc.).
3314 * Inner syntax: identifiers in parse trees of generic categories
3315 "logic", "aprop", "idt" etc. carry position information (disguised as
3316 type constraints). Occasional INCOMPATIBILITY with non-compliant
3317 translations that choke on unexpected type constraints. Positions can
3318 be stripped in ML translations via Syntax.strip_positions /
3319 Syntax.strip_positions_ast, or via the syntax constant
3320 "_strip_positions" within parse trees. As last resort, positions can
3321 be disabled via the configuration option Syntax.positions, which is
3322 called "syntax_positions" in Isar attribute syntax.
3324 * Discontinued special status of various ML structures that contribute
3325 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
3326 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
3327 refer directly to Ast.Constant, Lexicon.is_identifier,
3328 Syntax_Trans.mk_binder_tr etc.
3330 * Typed print translation: discontinued show_sorts argument, which is
3331 already available via context of "advanced" translation.
3333 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
3334 goal states; body tactic needs to address all subgoals uniformly.
3336 * Slightly more special eq_list/eq_set, with shortcut involving
3337 pointer equality (assumes that eq relation is reflexive).
3339 * Classical tactics use proper Proof.context instead of historic types
3340 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
3341 operate directly on Proof.context. Raw type claset retains its use as
3342 snapshot of the classical context, which can be recovered via
3343 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
3344 INCOMPATIBILITY, classical tactics and derived proof methods require
3345 proper Proof.context.
3350 * Discontinued support for Poly/ML 5.2, which was the last version
3351 without proper multithreading and TimeLimit implementation.
3353 * Discontinued old lib/scripts/polyml-platform, which has been
3354 obsolete since Isabelle2009-2.
3356 * Various optional external tools are referenced more robustly and
3357 uniformly by explicit Isabelle settings as follows:
3359 ISABELLE_CSDP (formerly CSDP_EXE)
3360 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
3361 ISABELLE_OCAML (formerly EXEC_OCAML)
3362 ISABELLE_SWIPL (formerly EXEC_SWIPL)
3363 ISABELLE_YAP (formerly EXEC_YAP)
3365 Note that automated detection from the file-system or search path has
3366 been discontinued. INCOMPATIBILITY.
3368 * Scala layer provides JVM method invocation service for static
3369 methods of type (String)String, see Invoke_Scala.method in ML. For
3372 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
3374 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
3375 this allows to pass structured values between ML and Scala.
3377 * The IsabelleText fonts includes some further glyphs to support the
3378 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
3379 installed a local copy (which is normally *not* required) need to
3380 delete or update it from ~~/lib/fonts/.
3384 New in Isabelle2011 (January 2011)
3385 ----------------------------------
3389 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
3390 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
3391 useful tooltips and hyperlinks produced from its static analysis. The
3392 bundled component provides an executable Isabelle tool that can be run
3395 Isabelle2011/bin/isabelle jedit
3397 * Significantly improved Isabelle/Isar implementation manual.
3399 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
3400 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
3401 while the default heap location within that directory lacks that extra
3402 suffix. This isolates multiple Isabelle installations from each
3403 other, avoiding problems with old settings in new versions.
3404 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
3406 * Source files are always encoded as UTF-8, instead of old-fashioned
3407 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
3408 the following package declarations:
3410 \usepackage[utf8]{inputenc}
3411 \usepackage{textcomp}
3413 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
3414 a Unicode character is treated as a single symbol, not a sequence of
3415 non-ASCII bytes as before. Since Isabelle/ML string literals may
3416 contain symbols without further backslash escapes, Unicode can now be
3417 used here as well. Recall that Symbol.explode in ML provides a
3418 consistent view on symbols, while raw explode (or String.explode)
3419 merely give a byte-oriented representation.
3421 * Theory loader: source files are primarily located via the master
3422 directory of each theory node (where the .thy file itself resides).
3423 The global load path is still partially available as legacy feature.
3424 Minor INCOMPATIBILITY due to subtle change in file lookup: use
3425 explicit paths, relatively to the theory.
3427 * Special treatment of ML file names has been discontinued.
3428 Historically, optional extensions .ML or .sml were added on demand --
3429 at the cost of clarity of file dependencies. Recall that Isabelle/ML
3430 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
3432 * Various options that affect pretty printing etc. are now properly
3433 handled within the context via configuration options, instead of
3434 unsynchronized references or print modes. There are both ML Config.T
3435 entities and Isar declaration attributes to access these.
3437 ML (Config.T) Isar (attribute)
3439 eta_contract eta_contract
3440 show_brackets show_brackets
3441 show_sorts show_sorts
3442 show_types show_types
3443 show_question_marks show_question_marks
3444 show_consts show_consts
3445 show_abbrevs show_abbrevs
3447 Syntax.ast_trace syntax_ast_trace
3448 Syntax.ast_stat syntax_ast_stat
3449 Syntax.ambiguity_level syntax_ambiguity_level
3451 Goal_Display.goals_limit goals_limit
3452 Goal_Display.show_main_goal show_main_goal
3454 Method.rule_trace rule_trace
3456 Thy_Output.display thy_output_display
3457 Thy_Output.quotes thy_output_quotes
3458 Thy_Output.indent thy_output_indent
3459 Thy_Output.source thy_output_source
3460 Thy_Output.break thy_output_break
3462 Note that corresponding "..._default" references in ML may only be
3463 changed globally at the ROOT session setup, but *not* within a theory.
3464 The option "show_abbrevs" supersedes the former print mode
3465 "no_abbrevs" with inverted meaning.
3467 * More systematic naming of some configuration options.
3470 trace_simp ~> simp_trace
3471 debug_simp ~> simp_debug
3473 * Support for real valued configuration options, using simplistic
3474 floating-point notation that coincides with the inner syntax for
3477 * Support for real valued preferences (with approximative PGIP type):
3478 front-ends need to accept "pgint" values in float notation.
3481 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
3484 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
3489 * Command 'type_synonym' (with single argument) replaces somewhat
3490 outdated 'types', which is still available as legacy feature for some
3493 * Command 'nonterminal' (with 'and' separated list of arguments)
3494 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
3496 * Command 'notepad' replaces former 'example_proof' for
3497 experimentation in Isar without any result. INCOMPATIBILITY.
3499 * Locale interpretation commands 'interpret' and 'sublocale' accept
3500 lists of equations to map definitions in a locale to appropriate
3501 entities in the context of the interpretation. The 'interpretation'
3502 command already provided this functionality.
3504 * Diagnostic command 'print_dependencies' prints the locale instances
3505 that would be activated if the specified expression was interpreted in
3506 the current context. Variant "print_dependencies!" assumes a context
3507 without interpretations.
3509 * Diagnostic command 'print_interps' prints interpretations in proofs
3510 in addition to interpretations in theories.
3512 * Discontinued obsolete 'global' and 'local' commands to manipulate
3513 the theory name space. Rare INCOMPATIBILITY. The ML functions
3514 Sign.root_path and Sign.local_path may be applied directly where this
3515 feature is still required for historical reasons.
3517 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
3518 'definition' instead.
3520 * The "prems" fact, which refers to the accidental collection of
3521 foundational premises in the context, is now explicitly marked as
3522 legacy feature and will be discontinued soon. Consider using "assms"
3523 of the head statement or reference facts by explicit names.
3525 * Document antiquotations @{class} and @{type} print classes and type
3528 * Document antiquotation @{file} checks file/directory entries within
3529 the local file system.
3534 * Coercive subtyping: functions can be declared as coercions and type
3535 inference will add them as necessary upon input of a term. Theory
3536 Complex_Main declares real :: nat => real and real :: int => real as
3537 coercions. A coercion function f is declared like this:
3539 declare [[coercion f]]
3541 To lift coercions through type constructors (e.g. from nat => real to
3542 nat list => real list), map functions can be declared, e.g.
3544 declare [[coercion_map map]]
3546 Currently coercion inference is activated only in theories including
3547 real numbers, i.e. descendants of Complex_Main. This is controlled by
3548 the configuration option "coercion_enabled", e.g. it can be enabled in
3549 other theories like this:
3551 declare [[coercion_enabled]]
3553 * Command 'partial_function' provides basic support for recursive
3554 function definitions over complete partial orders. Concrete instances
3555 are provided for i) the option type, ii) tail recursion on arbitrary
3556 types, and iii) the heap monad of Imperative_HOL. See
3557 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
3560 * Function package: f.psimps rules are no longer implicitly declared
3561 as [simp]. INCOMPATIBILITY.
3563 * Datatype package: theorems generated for executable equality (class
3564 "eq") carry proper names and are treated as default code equations.
3566 * Inductive package: now offers command 'inductive_simps' to
3567 automatically derive instantiated and simplified equations for
3568 inductive predicates, similar to 'inductive_cases'.
3570 * Command 'enriched_type' allows to register properties of the
3571 functorial structure of types.
3573 * Improved infrastructure for term evaluation using code generator
3574 techniques, in particular static evaluation conversions.
3576 * Code generator: Scala (2.8 or higher) has been added to the target
3579 * Code generator: globbing constant expressions "*" and "Theory.*"
3580 have been replaced by the more idiomatic "_" and "Theory._".
3583 * Code generator: export_code without explicit file declaration prints
3584 to standard output. INCOMPATIBILITY.
3586 * Code generator: do not print function definitions for case
3587 combinators any longer.
3589 * Code generator: simplification with rules determined with
3590 src/Tools/Code/code_simp.ML and method "code_simp".
3592 * Code generator for records: more idiomatic representation of record
3593 types. Warning: records are not covered by ancient SML code
3594 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
3595 rep_datatype declaration helps to succeed then:
3599 rep_datatype foo_ext ...
3601 * Records: logical foundation type for records does not carry a
3602 '_type' suffix any longer (obsolete due to authentic syntax).
3605 * Quickcheck now by default uses exhaustive testing instead of random
3606 testing. Random testing can be invoked by "quickcheck [random]",
3607 exhaustive testing by "quickcheck [exhaustive]".
3609 * Quickcheck instantiates polymorphic types with small finite
3610 datatypes by default. This enables a simple execution mechanism to
3611 handle quantifiers and function equality over the finite datatypes.
3613 * Quickcheck random generator has been renamed from "code" to
3614 "random". INCOMPATIBILITY.
3616 * Quickcheck now has a configurable time limit which is set to 30
3617 seconds by default. This can be changed by adding [timeout = n] to the
3618 quickcheck command. The time limit for Auto Quickcheck is still set
3621 * Quickcheck in locales considers interpretations of that locale for
3622 counter example search.
3625 - Added "smt" and "remote_smt" provers based on the "smt" proof
3626 method. See the Sledgehammer manual for details ("isabelle doc
3629 sledgehammer atp_info ~> sledgehammer running_provers
3630 sledgehammer atp_kill ~> sledgehammer kill_provers
3631 sledgehammer available_atps ~> sledgehammer available_provers
3634 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
3635 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
3636 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
3637 (and "ms" and "min" are no longer supported)
3642 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
3643 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
3645 - Added support for partial quotient types.
3646 - Added local versions of the "Nitpick.register_xxx" functions.
3647 - Added "whack" option.
3648 - Allow registration of quotient types as codatatypes.
3649 - Improved "merge_type_vars" option to merge more types.
3650 - Removed unsound "fast_descrs" option.
3651 - Added custom symmetry breaking for datatypes, making it possible to reach
3652 higher cardinalities.
3653 - Prevent the expansion of too large definitions.
3655 * Proof methods "metis" and "meson" now have configuration options
3656 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
3657 to diagnose these tools. E.g.
3659 using [[metis_trace = true]]
3661 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
3662 manually as command 'solve_direct'.
3664 * The default SMT solver Z3 must be enabled explicitly (due to
3665 licensing issues) by setting the environment variable
3666 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
3667 commercial applications, the SMT solver CVC3 is provided as fall-back;
3668 changing the SMT solver is done via the configuration option
3671 * Remote SMT solvers need to be referred to by the "remote_" prefix,
3672 i.e. "remote_cvc3" and "remote_z3".
3674 * Added basic SMT support for datatypes, records, and typedefs using
3675 the oracle mode (no proofs). Direct support of pairs has been dropped
3676 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
3677 support for a similar behavior). Minor INCOMPATIBILITY.
3679 * Changed SMT configuration options:
3681 z3_proofs ~> smt_oracle (with inverted meaning)
3682 z3_trace_assms ~> smt_trace_used_facts
3695 * Boogie output files (.b2i files) need to be declared in the theory
3698 * Simplification procedure "list_to_set_comprehension" rewrites list
3699 comprehensions applied to List.set to set comprehensions. Occasional
3700 INCOMPATIBILITY, may be deactivated like this:
3702 declare [[simproc del: list_to_set_comprehension]]
3704 * Removed old version of primrec package. INCOMPATIBILITY.
3706 * Removed simplifier congruence rule of "prod_case", as has for long
3707 been the case with "split". INCOMPATIBILITY.
3709 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
3711 * Removed [split_format ... and ... and ...] version of
3712 [split_format]. Potential INCOMPATIBILITY.
3714 * Predicate "sorted" now defined inductively, with nice induction
3715 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
3717 * Constant "contents" renamed to "the_elem", to free the generic name
3718 contents for other uses. INCOMPATIBILITY.
3720 * Renamed class eq and constant eq (for code generation) to class
3721 equal and constant equal, plus renaming of related facts and various
3722 tuning. INCOMPATIBILITY.
3724 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
3726 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
3729 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
3730 avoid confusion with finite sets. INCOMPATIBILITY.
3732 * Abandoned locales equiv, congruent and congruent2 for equivalence
3733 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
3736 * Some previously unqualified names have been qualified:
3743 Trueprop ~> HOL.Trueprop
3748 op --> ~> HOL.implies
3760 Pair ~> Product_Type.Pair
3761 fst ~> Product_Type.fst
3762 snd ~> Product_Type.snd
3763 curry ~> Product_Type.curry
3765 Collect ~> Set.Collect
3769 * More canonical naming convention for some fundamental definitions:
3771 bot_bool_eq ~> bot_bool_def
3772 top_bool_eq ~> top_bool_def
3773 inf_bool_eq ~> inf_bool_def
3774 sup_bool_eq ~> sup_bool_def
3775 bot_fun_eq ~> bot_fun_def
3776 top_fun_eq ~> top_fun_def
3777 inf_fun_eq ~> inf_fun_def
3778 sup_fun_eq ~> sup_fun_def
3782 * More stylized fact names:
3784 expand_fun_eq ~> fun_eq_iff
3785 expand_set_eq ~> set_eq_iff
3787 nat_number ~> eval_nat_numeral
3791 * Refactoring of code-generation specific operations in theory List:
3797 mem_iff ~> member_def
3798 null_empty ~> null_def
3800 INCOMPATIBILITY. Note that these were not supposed to be used
3801 regularly unless for striking reasons; their main purpose was code
3804 Various operations from the Haskell prelude are used for generating
3807 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
3808 "surj f" is now an abbreviation of "range f = UNIV". The theorems
3809 bij_def and surj_def are unchanged. INCOMPATIBILITY.
3811 * Abolished some non-alphabetic type names: "prod" and "sum" replace
3812 "*" and "+" respectively. INCOMPATIBILITY.
3814 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
3815 "Sum_Type.Plus" instead.
3817 * Constant "split" has been merged with constant "prod_case"; names of
3818 ML functions, facts etc. involving split have been retained so far,
3819 though. INCOMPATIBILITY.
3821 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
3822 instead. INCOMPATIBILITY.
3824 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
3827 * Former theory Library/Enum is now part of the HOL-Main image.
3828 INCOMPATIBILITY: all constants of the Enum theory now have to be
3829 referred to by its qualified name.
3832 nlists ~> Enum.nlists
3833 product ~> Enum.product
3835 * Theory Library/Monad_Syntax provides do-syntax for monad types.
3836 Syntax in Library/State_Monad has been changed to avoid ambiguities.
3839 * Theory Library/SetsAndFunctions has been split into
3840 Library/Function_Algebras and Library/Set_Algebras; canonical names
3841 for instance definitions for functions; various improvements.
3844 * Theory Library/Multiset provides stable quicksort implementation of
3847 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
3850 * Session Multivariate_Analysis: introduced a type class for euclidean
3851 space. Most theorems are now stated in terms of euclidean spaces
3852 instead of finite cartesian products.
3855 real ^ 'n ~> 'a::real_vector
3856 ~> 'a::euclidean_space
3857 ~> 'a::ordered_euclidean_space
3858 (depends on your needs)
3862 \<chi> x. _ ~> \<chi>\<chi> x. _
3865 Also note that the indices are now natural numbers and not from some
3866 finite type. Finite cartesian products of euclidean spaces, products
3867 of euclidean spaces the real and complex numbers are instantiated to
3868 be euclidean_spaces. INCOMPATIBILITY.
3870 * Session Probability: introduced pextreal as positive extended real
3871 numbers. Use pextreal as value for measures. Introduce the
3872 Radon-Nikodym derivative, product spaces and Fubini's theorem for
3873 arbitrary sigma finite measures. Introduces Lebesgue measure based on
3874 the integral in Multivariate Analysis. INCOMPATIBILITY.
3876 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
3879 * Session SPARK (with image HOL-SPARK) provides commands to load and
3880 prove verification conditions generated by the SPARK Ada program
3881 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
3886 * Theorems for additive ring operations (locale abelian_monoid and
3887 descendants) are generated by interpretation from their multiplicative
3888 counterparts. Names (in particular theorem names) have the mandatory
3889 qualifier 'add'. Previous theorem names are redeclared for
3892 * Structure "int_ring" is now an abbreviation (previously a
3893 definition). This fits more natural with advanced interpretations.
3898 * The domain package now runs in definitional mode by default: The
3899 former command 'new_domain' is now called 'domain'. To use the domain
3900 package in its original axiomatic mode, use 'domain (unsafe)'.
3903 * The new class "domain" is now the default sort. Class "predomain"
3904 is an unpointed version of "domain". Theories can be updated by
3905 replacing sort annotations as shown below. INCOMPATIBILITY.
3907 'a::type ~> 'a::countable
3908 'a::cpo ~> 'a::predomain
3909 'a::pcpo ~> 'a::domain
3911 * The old type class "rep" has been superseded by class "domain".
3912 Accordingly, users of the definitional package must remove any
3913 "default_sort rep" declarations. INCOMPATIBILITY.
3915 * The domain package (definitional mode) now supports unpointed
3916 predomain argument types, as long as they are marked 'lazy'. (Strict
3917 arguments must be in class "domain".) For example, the following
3918 domain definition now works:
3920 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
3922 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
3923 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
3924 'a option, and 'a list. Additionally, it configures fixrec and the
3925 domain package to work with these types. For example:
3927 fixrec isInl :: "('a + 'b) u -> tr"
3928 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
3930 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
3932 * The "(permissive)" option of fixrec has been replaced with a
3933 per-equation "(unchecked)" option. See
3934 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
3936 * The "bifinite" class no longer fixes a constant "approx"; the class
3937 now just asserts that such a function exists. INCOMPATIBILITY.
3939 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
3940 defines an embedding of type 'a defl into udom by default; instances
3941 of "bifinite" and "domain" classes are available in
3942 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
3944 * The syntax "REP('a)" has been replaced with "DEFL('a)".
3946 * The predicate "directed" has been removed. INCOMPATIBILITY.
3948 * The type class "finite_po" has been removed. INCOMPATIBILITY.
3950 * The function "cprod_map" has been renamed to "prod_map".
3953 * The monadic bind operator on each powerdomain has new binder syntax
3954 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
3955 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
3957 * The infix syntax for binary union on each powerdomain has changed
3958 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
3959 syntax. INCOMPATIBILITY.
3961 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
3962 still supported as an input translation.
3964 * Renamed some theorems (the original names are also still available).
3966 expand_fun_below ~> fun_below_iff
3967 below_fun_ext ~> fun_belowI
3968 expand_cfun_eq ~> cfun_eq_iff
3969 ext_cfun ~> cfun_eqI
3970 expand_cfun_below ~> cfun_below_iff
3971 below_cfun_ext ~> cfun_belowI
3972 cont2cont_Rep_CFun ~> cont2cont_APP
3974 * The Abs and Rep functions for various types have changed names.
3975 Related theorem names have also changed to match. INCOMPATIBILITY.
3977 Rep_CFun ~> Rep_cfun
3978 Abs_CFun ~> Abs_cfun
3979 Rep_Sprod ~> Rep_sprod
3980 Abs_Sprod ~> Abs_sprod
3981 Rep_Ssum ~> Rep_ssum
3982 Abs_Ssum ~> Abs_ssum
3984 * Lemmas with names of the form *_defined_iff or *_strict_iff have
3985 been renamed to *_bottom_iff. INCOMPATIBILITY.
3987 * Various changes to bisimulation/coinduction with domain package:
3989 - Definitions of "bisim" constants no longer mention definedness.
3990 - With mutual recursion, "bisim" predicate is now curried.
3991 - With mutual recursion, each type gets a separate coind theorem.
3992 - Variable names in bisim_def and coinduct rules have changed.
3996 * Case combinators generated by the domain package for type "foo" are
3997 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
3999 * Several theorems have been renamed to more accurately reflect the
4000 names of constants and types involved. INCOMPATIBILITY.
4002 thelub_const ~> lub_const
4003 lub_const ~> is_lub_const
4005 is_lub_lub ~> is_lubD2
4007 unique_lub ~> is_lub_unique
4008 is_ub_lub ~> is_lub_rangeD1
4009 lub_bin_chain ~> is_lub_bin_chain
4010 lub_fun ~> is_lub_fun
4011 thelub_fun ~> lub_fun
4012 thelub_cfun ~> lub_cfun
4013 thelub_Pair ~> lub_Pair
4014 lub_cprod ~> is_lub_prod
4015 thelub_cprod ~> lub_prod
4016 minimal_cprod ~> minimal_prod
4017 inst_cprod_pcpo ~> inst_prod_pcpo
4019 compact_UU ~> compact_bottom
4020 deflation_UU ~> deflation_bottom
4021 finite_deflation_UU ~> finite_deflation_bottom
4023 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
4025 sq_ord_less_eq_trans ~> below_eq_trans
4026 sq_ord_eq_less_trans ~> eq_below_trans
4027 refl_less ~> below_refl
4028 trans_less ~> below_trans
4029 antisym_less ~> below_antisym
4030 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
4031 box_less ~> box_below
4032 rev_trans_less ~> rev_below_trans
4033 not_less2not_eq ~> not_below2not_eq
4034 less_UU_iff ~> below_UU_iff
4035 flat_less_iff ~> flat_below_iff
4036 adm_less ~> adm_below
4037 adm_not_less ~> adm_not_below
4038 adm_compact_not_less ~> adm_compact_not_below
4039 less_fun_def ~> below_fun_def
4040 expand_fun_less ~> fun_below_iff
4041 less_fun_ext ~> fun_belowI
4042 less_discr_def ~> below_discr_def
4043 discr_less_eq ~> discr_below_eq
4044 less_unit_def ~> below_unit_def
4045 less_cprod_def ~> below_prod_def
4046 prod_lessI ~> prod_belowI
4047 Pair_less_iff ~> Pair_below_iff
4048 fst_less_iff ~> fst_below_iff
4049 snd_less_iff ~> snd_below_iff
4050 expand_cfun_less ~> cfun_below_iff
4051 less_cfun_ext ~> cfun_belowI
4052 injection_less ~> injection_below
4053 less_up_def ~> below_up_def
4054 not_Iup_less ~> not_Iup_below
4055 Iup_less ~> Iup_below
4057 Def_inject_less_eq ~> Def_below_Def
4058 Def_less_is_eq ~> Def_below_iff
4059 spair_less_iff ~> spair_below_iff
4060 less_sprod ~> below_sprod
4061 spair_less ~> spair_below
4062 sfst_less_iff ~> sfst_below_iff
4063 ssnd_less_iff ~> ssnd_below_iff
4064 fix_least_less ~> fix_least_below
4065 dist_less_one ~> dist_below_one
4066 less_ONE ~> below_ONE
4067 ONE_less_iff ~> ONE_below_iff
4068 less_sinlD ~> below_sinlD
4069 less_sinrD ~> below_sinrD
4074 * All constant names are now qualified internally and use proper
4075 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
4080 * Antiquotation @{assert} inlines a function bool -> unit that raises
4081 Fail if the argument is false. Due to inlining the source position of
4082 failed assertions is included in the error output.
4084 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
4085 text is in practice always evaluated with a stable theory checkpoint.
4086 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
4088 * Antiquotation @{theory A} refers to theory A from the ancestry of
4089 the current context, not any accidental theory loader state as before.
4090 Potential INCOMPATIBILITY, subtle change in semantics.
4092 * Syntax.pretty_priority (default 0) configures the required priority
4093 of pretty-printed output and thus affects insertion of parentheses.
4095 * Syntax.default_root (default "any") configures the inner syntax
4096 category (nonterminal symbol) for parsing of terms.
4098 * Former exception Library.UnequalLengths now coincides with
4099 ListPair.UnequalLengths.
4101 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
4102 main functionality is provided by structure Simplifier.
4104 * Renamed raw "explode" function to "raw_explode" to emphasize its
4105 meaning. Note that internally to Isabelle, Symbol.explode is used in
4106 almost all situations.
4108 * Discontinued obsolete function sys_error and exception SYS_ERROR.
4109 See implementation manual for further details on exceptions in
4112 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
4115 * Renamed structure PureThy to Pure_Thy and moved most of its
4116 operations to structure Global_Theory, to emphasize that this is
4117 rarely-used global-only stuff.
4119 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
4120 instead (or tracing for high-volume output).
4122 * Configuration option show_question_marks only affects regular pretty
4123 printing of types and terms, not raw Term.string_of_vname.
4125 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
4126 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
4127 @{thms} for most purposes.
4129 * ML structure Unsynchronized is never opened, not even in Isar
4130 interaction mode as before. Old Unsynchronized.set etc. have been
4131 discontinued -- use plain := instead. This should be *rare* anyway,
4132 since modern tools always work via official context data, notably
4133 configuration options.
4135 * Parallel and asynchronous execution requires special care concerning
4136 interrupts. Structure Exn provides some convenience functions that
4137 avoid working directly with raw Interrupt. User code must not absorb
4138 interrupts -- intermediate handling (for cleanup etc.) needs to be
4139 followed by re-raising of the original exception. Another common
4140 source of mistakes are "handle _" patterns, which make the meaning of
4141 the program subject to physical effects of the environment.
4145 New in Isabelle2009-2 (June 2010)
4146 ---------------------------------
4150 * Authentic syntax for *all* logical entities (type classes, type
4151 constructors, term constants): provides simple and robust
4152 correspondence between formal entities and concrete syntax. Within
4153 the parse tree / AST representations, "constants" are decorated by
4154 their category (class, type, const) and spelled out explicitly with
4155 their full internal name.
4157 Substantial INCOMPATIBILITY concerning low-level syntax declarations
4158 and translations (translation rules and translation functions in ML).
4159 Some hints on upgrading:
4161 - Many existing uses of 'syntax' and 'translations' can be replaced
4162 by more modern 'type_notation', 'notation' and 'abbreviation',
4163 which are independent of this issue.
4165 - 'translations' require markup within the AST; the term syntax
4166 provides the following special forms:
4168 CONST c -- produces syntax version of constant c from context
4169 XCONST c -- literally c, checked as constant from context
4170 c -- literally c, if declared by 'syntax'
4172 Plain identifiers are treated as AST variables -- occasionally the
4173 system indicates accidental variables via the error "rhs contains
4176 Type classes and type constructors are marked according to their
4177 concrete syntax. Some old translations rules need to be written
4178 for the "type" category, using type constructor application
4179 instead of pseudo-term application of the default category
4182 - 'parse_translation' etc. in ML may use the following
4185 @{class_syntax c} -- type class c within parse tree / AST
4186 @{term_syntax c} -- type constructor c within parse tree / AST
4187 @{const_syntax c} -- ML version of "CONST c" above
4188 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
4190 - Literal types within 'typed_print_translations', i.e. those *not*
4191 represented as pseudo-terms are represented verbatim. Use @{class
4192 c} or @{type_name c} here instead of the above syntax
4195 Note that old non-authentic syntax was based on unqualified base
4196 names, so all of the above "constant" names would coincide. Recall
4197 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
4198 diagnose syntax problems.
4200 * Type constructors admit general mixfix syntax, not just infix.
4202 * Concrete syntax may be attached to local entities without a proof
4203 body, too. This works via regular mixfix annotations for 'fix',
4204 'def', 'obtain' etc. or via the explicit 'write' command, which is
4205 similar to the 'notation' command in theory specifications.
4207 * Discontinued unnamed infix syntax (legacy feature for many years) --
4208 need to specify constant name and syntax separately. Internal ML
4209 datatype constructors have been renamed from InfixName to Infix etc.
4210 Minor INCOMPATIBILITY.
4212 * Schematic theorem statements need to be explicitly markup as such,
4213 via commands 'schematic_lemma', 'schematic_theorem',
4214 'schematic_corollary'. Thus the relevance of the proof is made
4215 syntactically clear, which impacts performance in a parallel or
4216 asynchronous interactive environment. Minor INCOMPATIBILITY.
4218 * Use of cumulative prems via "!" in some proof methods has been
4219 discontinued (old legacy feature).
4221 * References 'trace_simp' and 'debug_simp' have been replaced by
4222 configuration options stored in the context. Enabling tracing (the
4223 case of debugging is similar) in proofs works via
4225 using [[trace_simp = true]]
4227 Tracing is then active for all invocations of the simplifier in
4228 subsequent goal refinement steps. Tracing may also still be enabled or
4229 disabled via the ProofGeneral settings menu.
4231 * Separate commands 'hide_class', 'hide_type', 'hide_const',
4232 'hide_fact' replace the former 'hide' KIND command. Minor
4235 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
4236 more efficient than combinations with -q1 or -q2.
4241 * Proofterms record type-class reasoning explicitly, using the
4242 "unconstrain" operation internally. This eliminates all sort
4243 constraints from a theorem and proof, introducing explicit
4244 OFCLASS-premises. On the proof term level, this operation is
4245 automatically applied at theorem boundaries, such that closed proofs
4246 are always free of sort constraints. INCOMPATIBILITY for tools that
4247 inspect proof terms.
4249 * Local theory specifications may depend on extra type variables that
4250 are not present in the result type -- arguments TYPE('a) :: 'a itself
4251 are added internally. For example:
4253 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
4255 * Predicates of locales introduced by classes carry a mandatory
4256 "class" prefix. INCOMPATIBILITY.
4258 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
4260 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
4263 * Command 'code_reflect' allows to incorporate generated ML code into
4264 runtime environment; replaces immature code_datatype antiquotation.
4267 * Code generator: simple concept for abstract datatypes obeying
4270 * Code generator: details of internal data cache have no impact on the
4271 user space functionality any longer.
4273 * Methods "unfold_locales" and "intro_locales" ignore non-locale
4274 subgoals. This is more appropriate for interpretations with 'where'.
4277 * Command 'example_proof' opens an empty proof body. This allows to
4278 experiment with Isar, without producing any persistent result.
4280 * Commands 'type_notation' and 'no_type_notation' declare type syntax
4281 within a local theory context, with explicit checking of the
4282 constructors involved (in contrast to the raw 'syntax' versions).
4284 * Commands 'types' and 'typedecl' now work within a local theory
4285 context -- without introducing dependencies on parameters or
4286 assumptions, which is not possible in Isabelle/Pure.
4288 * Command 'defaultsort' has been renamed to 'default_sort', it works
4289 within a local theory context. Minor INCOMPATIBILITY.
4294 * Command 'typedef' now works within a local theory context -- without
4295 introducing dependencies on parameters or assumptions, which is not
4296 possible in Isabelle/Pure/HOL. Note that the logical environment may
4297 contain multiple interpretations of local typedefs (with different
4298 non-emptiness proofs), even in a global theory context.
4300 * New package for quotient types. Commands 'quotient_type' and
4301 'quotient_definition' may be used for defining types and constants by
4302 quotient constructions. An example is the type of integers created by
4303 quotienting pairs of natural numbers:
4306 intrel :: "(nat * nat) => (nat * nat) => bool"
4308 "intrel (x, y) (u, v) = (x + v = u + y)"
4310 quotient_type int = "nat * nat" / intrel
4311 by (auto simp add: equivp_def expand_fun_eq)
4314 "0::int" is "(0::nat, 0::nat)"
4316 The method "lifting" can be used to lift of theorems from the
4317 underlying "raw" type to the quotient type. The example
4318 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
4319 construction and provides a reasoning infrastructure for finite sets.
4321 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
4322 clash with new theory Quotient in Main HOL.
4324 * Moved the SMT binding into the main HOL session, eliminating
4325 separate HOL-SMT session.
4327 * List membership infix mem operation is only an input abbreviation.
4330 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
4331 for future developements; former Library/Word.thy is still present in
4332 the AFP entry RSAPPS.
4334 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
4335 longer shadowed. INCOMPATIBILITY.
4337 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
4340 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
4343 * Dropped normalizing_semiring etc; use the facts in semiring classes
4344 instead. INCOMPATIBILITY.
4346 * Dropped several real-specific versions of lemmas about floor and
4347 ceiling; use the generic lemmas from theory "Archimedean_Field"
4348 instead. INCOMPATIBILITY.
4350 floor_number_of_eq ~> floor_number_of
4351 le_floor_eq_number_of ~> number_of_le_floor
4352 le_floor_eq_zero ~> zero_le_floor
4353 le_floor_eq_one ~> one_le_floor
4354 floor_less_eq_number_of ~> floor_less_number_of
4355 floor_less_eq_zero ~> floor_less_zero
4356 floor_less_eq_one ~> floor_less_one
4357 less_floor_eq_number_of ~> number_of_less_floor
4358 less_floor_eq_zero ~> zero_less_floor
4359 less_floor_eq_one ~> one_less_floor
4360 floor_le_eq_number_of ~> floor_le_number_of
4361 floor_le_eq_zero ~> floor_le_zero
4362 floor_le_eq_one ~> floor_le_one
4363 floor_subtract_number_of ~> floor_diff_number_of
4364 floor_subtract_one ~> floor_diff_one
4365 ceiling_number_of_eq ~> ceiling_number_of
4366 ceiling_le_eq_number_of ~> ceiling_le_number_of
4367 ceiling_le_zero_eq ~> ceiling_le_zero
4368 ceiling_le_eq_one ~> ceiling_le_one
4369 less_ceiling_eq_number_of ~> number_of_less_ceiling
4370 less_ceiling_eq_zero ~> zero_less_ceiling
4371 less_ceiling_eq_one ~> one_less_ceiling
4372 ceiling_less_eq_number_of ~> ceiling_less_number_of
4373 ceiling_less_eq_zero ~> ceiling_less_zero
4374 ceiling_less_eq_one ~> ceiling_less_one
4375 le_ceiling_eq_number_of ~> number_of_le_ceiling
4376 le_ceiling_eq_zero ~> zero_le_ceiling
4377 le_ceiling_eq_one ~> one_le_ceiling
4378 ceiling_subtract_number_of ~> ceiling_diff_number_of
4379 ceiling_subtract_one ~> ceiling_diff_one
4381 * Theory "Finite_Set": various folding_XXX locales facilitate the
4382 application of the various fold combinators on finite sets.
4384 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
4385 provides abstract red-black tree type which is backed by "RBT_Impl" as
4386 implementation. INCOMPATIBILTY.
4388 * Theory Library/Coinductive_List has been removed -- superseded by
4389 AFP/thys/Coinductive.
4391 * Theory PReal, including the type "preal" and related operations, has
4392 been removed. INCOMPATIBILITY.
4394 * Real: new development using Cauchy Sequences.
4396 * Split off theory "Big_Operators" containing setsum, setprod,
4397 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
4399 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
4400 "Int" etc. INCOMPATIBILITY.
4402 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
4404 * New set of rules "ac_simps" provides combined assoc / commute
4405 rewrites for all interpretations of the appropriate generic locales.
4407 * Renamed theory "OrderedGroup" to "Groups" and split theory
4408 "Ring_and_Field" into theories "Rings" and "Fields"; for more
4409 appropriate and more consistent names suitable for name prefixes
4410 within the HOL theories. INCOMPATIBILITY.
4412 * Some generic constants have been put to appropriate theories:
4413 - less_eq, less: Orderings
4414 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
4415 - inverse, divide: Rings
4418 * More consistent naming of type classes involving orderings (and
4421 lower_semilattice ~> semilattice_inf
4422 upper_semilattice ~> semilattice_sup
4424 dense_linear_order ~> dense_linorder
4426 pordered_ab_group_add ~> ordered_ab_group_add
4427 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
4428 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
4429 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
4430 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
4431 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
4432 pordered_cancel_semiring ~> ordered_cancel_semiring
4433 pordered_comm_monoid_add ~> ordered_comm_monoid_add
4434 pordered_comm_ring ~> ordered_comm_ring
4435 pordered_comm_semiring ~> ordered_comm_semiring
4436 pordered_ring ~> ordered_ring
4437 pordered_ring_abs ~> ordered_ring_abs
4438 pordered_semiring ~> ordered_semiring
4440 ordered_ab_group_add ~> linordered_ab_group_add
4441 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
4442 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
4443 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
4444 ordered_field ~> linordered_field
4445 ordered_field_no_lb ~> linordered_field_no_lb
4446 ordered_field_no_ub ~> linordered_field_no_ub
4447 ordered_field_dense_linear_order ~> dense_linordered_field
4448 ordered_idom ~> linordered_idom
4449 ordered_ring ~> linordered_ring
4450 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
4451 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
4452 ordered_ring_strict ~> linordered_ring_strict
4453 ordered_semidom ~> linordered_semidom
4454 ordered_semiring ~> linordered_semiring
4455 ordered_semiring_1 ~> linordered_semiring_1
4456 ordered_semiring_1_strict ~> linordered_semiring_1_strict
4457 ordered_semiring_strict ~> linordered_semiring_strict
4459 The following slightly odd type classes have been moved to a
4460 separate theory Library/Lattice_Algebras:
4462 lordered_ab_group_add ~> lattice_ab_group_add
4463 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
4464 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
4465 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
4466 lordered_ring ~> lattice_ring
4470 * Refined field classes:
4471 - classes division_ring_inverse_zero, field_inverse_zero,
4472 linordered_field_inverse_zero include rule inverse 0 = 0 --
4473 subsumes former division_by_zero class;
4474 - numerous lemmas have been ported from field to division_ring.
4477 * Refined algebra theorem collections:
4478 - dropped theorem group group_simps, use algebra_simps instead;
4479 - dropped theorem group ring_simps, use field_simps instead;
4480 - proper theorem collection field_simps subsumes former theorem
4481 groups field_eq_simps and field_simps;
4482 - dropped lemma eq_minus_self_iff which is a duplicate for
4486 * Theory Finite_Set and List: some lemmas have been generalized from
4489 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
4490 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
4491 inter_Inter_fold_inter ~> inf_Inf_fold_inf
4492 union_Union_fold_union ~> sup_Sup_fold_sup
4493 Inter_fold_inter ~> Inf_fold_inf
4494 Union_fold_union ~> Sup_fold_sup
4495 inter_INTER_fold_inter ~> inf_INFI_fold_inf
4496 union_UNION_fold_union ~> sup_SUPR_fold_sup
4497 INTER_fold_inter ~> INFI_fold_inf
4498 UNION_fold_union ~> SUPR_fold_sup
4500 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
4501 replaced by the more convenient lemmas Inf_empty and Sup_empty.
4502 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
4503 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
4504 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
4505 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
4507 * Reorganized theory Multiset: swapped notation of pointwise and
4510 - pointwise ordering is instance of class order with standard syntax
4512 - multiset ordering has syntax <=# and <#; partial order properties
4513 are provided by means of interpretation with prefix
4515 - less duplication, less historical organization of sections,
4516 conversion from associations lists to multisets, rudimentary code
4518 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
4523 multiset_eq_conv_count_eq ~> multiset_ext_iff
4524 multi_count_ext ~> multiset_ext
4525 diff_union_inverse2 ~> diff_union_cancelR
4529 * Theory Permutation: replaced local "remove" by List.remove1.
4531 * Code generation: ML and OCaml code is decorated with signatures.
4533 * Theory List: added transpose.
4535 * Library/Nat_Bijection.thy is a collection of bijective functions
4536 between nat and other types, which supersedes the older libraries
4537 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
4540 Nat_Int_Bij.nat2_to_nat ~> prod_encode
4541 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
4542 Nat_Int_Bij.int_to_nat_bij ~> int_encode
4543 Nat_Int_Bij.nat_to_int_bij ~> int_decode
4544 Countable.pair_encode ~> prod_encode
4545 NatIso.prod2nat ~> prod_encode
4546 NatIso.nat2prod ~> prod_decode
4547 NatIso.sum2nat ~> sum_encode
4548 NatIso.nat2sum ~> sum_decode
4549 NatIso.list2nat ~> list_encode
4550 NatIso.nat2list ~> list_decode
4551 NatIso.set2nat ~> set_encode
4552 NatIso.nat2set ~> set_decode
4555 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
4556 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
4557 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
4558 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
4559 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
4560 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
4561 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
4562 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
4563 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
4564 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
4565 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
4566 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
4567 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
4570 - Renamed ATP commands:
4571 atp_info ~> sledgehammer running_atps
4572 atp_kill ~> sledgehammer kill_atps
4573 atp_messages ~> sledgehammer messages
4574 atp_minimize ~> sledgehammer minimize
4575 print_atps ~> sledgehammer available_atps
4577 - Added user's manual ("isabelle doc sledgehammer").
4578 - Added option syntax and "sledgehammer_params" to customize
4579 Sledgehammer's behavior. See the manual for details.
4580 - Modified the Isar proof reconstruction code so that it produces
4581 direct proofs rather than proofs by contradiction. (This feature
4582 is still experimental.)
4583 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
4585 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
4588 - Added and implemented "binary_ints" and "bits" options.
4589 - Added "std" option and implemented support for nonstandard models.
4590 - Added and implemented "finitize" option to improve the precision
4591 of infinite datatypes based on a monotonicity analysis.
4592 - Added support for quotient types.
4593 - Added support for "specification" and "ax_specification"
4595 - Added support for local definitions (for "function" and
4596 "termination" proofs).
4597 - Added support for term postprocessors.
4598 - Optimized "Multiset.multiset" and "FinFun.finfun".
4599 - Improved efficiency of "destroy_constrs" optimization.
4600 - Fixed soundness bugs related to "destroy_constrs" optimization and
4602 - Fixed soundness bug related to higher-order constructors.
4603 - Fixed soundness bug when "full_descrs" is enabled.
4604 - Improved precision of set constructs.
4605 - Added "atoms" option.
4606 - Added cache to speed up repeated Kodkod invocations on the same
4608 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
4609 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
4610 "SAT4J_Light". INCOMPATIBILITY.
4611 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
4612 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
4613 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
4615 * Method "induct" now takes instantiations of the form t, where t is not
4616 a variable, as a shorthand for "x == t", where x is a fresh variable.
4617 If this is not intended, t has to be enclosed in parentheses.
4618 By default, the equalities generated by definitional instantiations
4619 are pre-simplified, which may cause parameters of inductive cases
4620 to disappear, or may even delete some of the inductive cases.
4621 Use "induct (no_simp)" instead of "induct" to restore the old
4622 behaviour. The (no_simp) option is also understood by the "cases"
4623 and "nominal_induct" methods, which now perform pre-simplification, too.
4629 * Variable names in lemmas generated by the domain package have
4630 changed; the naming scheme is now consistent with the HOL datatype
4631 package. Some proof scripts may be affected, INCOMPATIBILITY.
4633 * The domain package no longer defines the function "foo_copy" for
4634 recursive domain "foo". The reach lemma is now stated directly in
4635 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
4636 be reformulated in terms of "foo_take", INCOMPATIBILITY.
4638 * Most definedness lemmas generated by the domain package (previously
4639 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
4640 like "foo$x = UU <-> x = UU", which works better as a simp rule.
4641 Proofs that used definedness lemmas as intro rules may break,
4642 potential INCOMPATIBILITY.
4644 * Induction and casedist rules generated by the domain package now
4645 declare proper case_names (one called "bottom", and one named for each
4646 constructor). INCOMPATIBILITY.
4648 * For mutually-recursive domains, separate "reach" and "take_lemma"
4649 rules are generated for each domain, INCOMPATIBILITY.
4651 foo_bar.reach ~> foo.reach bar.reach
4652 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
4654 * Some lemmas generated by the domain package have been renamed for
4655 consistency with the datatype package, INCOMPATIBILITY.
4657 foo.ind ~> foo.induct
4658 foo.finite_ind ~> foo.finite_induct
4659 foo.coind ~> foo.coinduct
4660 foo.casedist ~> foo.exhaust
4661 foo.exhaust ~> foo.nchotomy
4663 * For consistency with other definition packages, the fixrec package
4664 now generates qualified theorem names, INCOMPATIBILITY.
4666 foo_simps ~> foo.simps
4667 foo_unfold ~> foo.unfold
4668 foo_induct ~> foo.induct
4670 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
4671 method and internal fixrec proofs now use the default simpset instead.
4674 * The "contlub" predicate has been removed. Proof scripts should use
4675 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
4677 * The "admw" predicate has been removed, INCOMPATIBILITY.
4679 * The constants cpair, cfst, and csnd have been removed in favor of
4680 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
4685 * Antiquotations for basic formal entities:
4687 @{class NAME} -- type class
4688 @{class_syntax NAME} -- syntax representation of the above
4690 @{type_name NAME} -- logical type
4691 @{type_abbrev NAME} -- type abbreviation
4692 @{nonterminal NAME} -- type of concrete syntactic category
4693 @{type_syntax NAME} -- syntax representation of any of the above
4695 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
4696 @{const_abbrev NAME} -- abbreviated constant
4697 @{const_syntax NAME} -- syntax representation of any of the above
4699 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
4700 syntax constant (cf. 'syntax' command).
4702 * Antiquotation @{make_string} inlines a function to print arbitrary
4703 values similar to the ML toplevel. The result is compiler dependent
4704 and may fall back on "?" in certain situations.
4706 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
4707 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
4708 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
4709 not work with the asynchronous Isar document model.
4711 * Configuration options now admit dynamic default values, depending on
4712 the context or even global references.
4714 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
4715 uses an efficient external library if available (for Poly/ML).
4717 * Renamed some important ML structures, while keeping the old names
4718 for some time as aliases within the structure Legacy:
4720 OuterKeyword ~> Keyword
4723 OuterSyntax ~> Outer_Syntax
4724 PrintMode ~> Print_Mode
4725 SpecParse ~> Parse_Spec
4728 ThyOutput ~> Thy_Output
4729 TypeInfer ~> Type_Infer
4731 Note that "open Legacy" simplifies porting of sources, but forgetting
4732 to remove it again will complicate porting again in the future.
4734 * Most operations that refer to a global context are named
4735 accordingly, e.g. Simplifier.global_context or
4736 ProofContext.init_global. There are some situations where a global
4737 context actually works, but under normal circumstances one needs to
4738 pass the proper local context through the code!
4740 * Discontinued old TheoryDataFun with its copy/init operation -- data
4741 needs to be pure. Functor Theory_Data_PP retains the traditional
4742 Pretty.pp argument to merge, which is absent in the standard
4743 Theory_Data version.
4745 * Sorts.certify_sort and derived "cert" operations for types and terms
4746 no longer minimize sorts. Thus certification at the boundary of the
4747 inference kernel becomes invariant under addition of class relations,
4748 which is an important monotonicity principle. Sorts are now minimized
4749 in the syntax layer only, at the boundary between the end-user and the
4750 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
4751 explicitly in rare situations.
4753 * Renamed old-style Drule.standard to Drule.export_without_context, to
4754 emphasize that this is in no way a standard operation.
4757 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
4758 usual for resolution. Rare INCOMPATIBILITY.
4760 * Renamed varify/unvarify operations to varify_global/unvarify_global
4761 to emphasize that these only work in a global situation (which is
4764 * Curried take and drop in library.ML; negative length is interpreted
4765 as infinity (as in chop). Subtle INCOMPATIBILITY.
4767 * Proof terms: type substitutions on proof constants now use canonical
4768 order of type variables. INCOMPATIBILITY for tools working with proof
4771 * Raw axioms/defs may no longer carry sort constraints, and raw defs
4772 may no longer carry premises. User-level specifications are
4773 transformed accordingly by Thm.add_axiom/add_def.
4778 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
4779 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
4780 proof terms are enabled unconditionally in the new HOL-Proofs image.
4782 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
4783 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
4786 * Old lib/scripts/polyml-platform is superseded by the
4787 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
4788 variant, even on a 64 bit machine. The following example setting
4789 prefers 64 bit if available:
4791 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
4793 * The preliminary Isabelle/jEdit application demonstrates the emerging
4794 Isabelle/Scala layer for advanced prover interaction and integration.
4795 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
4798 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
4799 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
4800 similar to the default assignment of the document preparation system
4801 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
4802 provides some operations for direct access to the font without asking
4803 the user for manual installation.
4807 New in Isabelle2009-1 (December 2009)
4808 -------------------------------------
4812 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
4813 one backslash should be used, even in ML sources.
4818 * Locale interpretation propagates mixins along the locale hierarchy.
4819 The currently only available mixins are the equations used to map
4820 local definitions to terms of the target domain of an interpretation.
4822 * Reactivated diagnostic command 'print_interps'. Use "print_interps
4823 loc" to print all interpretations of locale "loc" in the theory.
4824 Interpretations in proofs are not shown.
4826 * Thoroughly revised locales tutorial. New section on conditional
4829 * On instantiation of classes, remaining undefined class parameters
4830 are formally declared. INCOMPATIBILITY.
4833 *** Document preparation ***
4835 * New generalized style concept for printing terms: @{foo (style) ...}
4836 instead of @{foo_style style ...} (old form is still retained for
4837 backward compatibility). Styles can be also applied for
4838 antiquotations prop, term_type and typeof.
4843 * New proof method "smt" for a combination of first-order logic with
4844 equality, linear and nonlinear (natural/integer/real) arithmetic, and
4845 fixed-size bitvectors; there is also basic support for higher-order
4846 features (esp. lambda abstractions). It is an incomplete decision
4847 procedure based on external SMT solvers using the oracle mechanism;
4848 for the SMT solver Z3, this method is proof-producing. Certificates
4849 are provided to avoid calling the external solvers solely for
4850 re-checking proofs. Due to a remote SMT service there is no need for
4851 installing SMT solvers locally. See src/HOL/SMT.
4853 * New commands to load and prove verification conditions generated by
4854 the Boogie program verifier or derived systems (e.g. the Verifying C
4855 Compiler (VCC) or Spec#). See src/HOL/Boogie.
4857 * New counterexample generator tool 'nitpick' based on the Kodkod
4858 relational model finder. See src/HOL/Tools/Nitpick and
4859 src/HOL/Nitpick_Examples.
4861 * New commands 'code_pred' and 'values' to invoke the predicate
4862 compiler and to enumerate values of inductive predicates.
4864 * A tabled implementation of the reflexive transitive closure.
4866 * New implementation of quickcheck uses generic code generator;
4867 default generators are provided for all suitable HOL types, records
4868 and datatypes. Old quickcheck can be re-activated importing theory
4869 Library/SML_Quickcheck.
4871 * New testing tool Mirabelle for automated proof tools. Applies
4872 several tools and tactics like sledgehammer, metis, or quickcheck, to
4873 every proof step in a theory. To be used in batch mode via the
4874 "mirabelle" utility.
4876 * New proof method "sos" (sum of squares) for nonlinear real
4877 arithmetic (originally due to John Harison). It requires theory
4878 Library/Sum_Of_Squares. It is not a complete decision procedure but
4879 works well in practice on quantifier-free real arithmetic with +, -,
4880 *, ^, =, <= and <, i.e. boolean combinations of equalities and
4881 inequalities between polynomials. It makes use of external
4882 semidefinite programming solvers. Method "sos" generates a
4883 certificate that can be pasted into the proof thus avoiding the need
4884 to call an external tool every time the proof is checked. See
4885 src/HOL/Library/Sum_Of_Squares.
4887 * New method "linarith" invokes existing linear arithmetic decision
4890 * New command 'atp_minimal' reduces result produced by Sledgehammer.
4892 * New Sledgehammer option "Full Types" in Proof General settings menu.
4893 Causes full type information to be output to the ATPs. This slows
4894 ATPs down considerably but eliminates a source of unsound "proofs"
4897 * New method "metisFT": A version of metis that uses full type
4898 information in order to avoid failures of proof reconstruction.
4900 * New evaluator "approximate" approximates an real valued term using
4901 the same method as the approximation method.
4903 * Method "approximate" now supports arithmetic expressions as
4904 boundaries of intervals and implements interval splitting and Taylor
4907 * ML antiquotation @{code_datatype} inserts definition of a datatype
4908 generated by the code generator; e.g. see src/HOL/Predicate.thy.
4910 * New theory SupInf of the supremum and infimum operators for sets of
4913 * New theory Probability, which contains a development of measure
4914 theory, eventually leading to Lebesgue integration and probability.
4916 * Extended Multivariate Analysis to include derivation and Brouwer's
4919 * Reorganization of number theory, INCOMPATIBILITY:
4920 - new number theory development for nat and int, in theories Divides
4921 and GCD as well as in new session Number_Theory
4922 - some constants and facts now suffixed with _nat and _int
4924 - former session NumberTheory now named Old_Number_Theory, including
4925 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
4926 - moved theory Pocklington from src/HOL/Library to
4927 src/HOL/Old_Number_Theory
4929 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
4930 lcm of finite and infinite sets. It is shown that they form a complete
4933 * Class semiring_div requires superclass no_zero_divisors and proof of
4934 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
4935 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
4936 generalized to class semiring_div, subsuming former theorems
4937 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
4938 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
4941 * Refinements to lattice classes and sets:
4942 - less default intro/elim rules in locale variant, more default
4943 intro/elim rules in class variant: more uniformity
4944 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
4946 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
4948 - renamed ACI to inf_sup_aci
4949 - new class "boolean_algebra"
4950 - class "complete_lattice" moved to separate theory
4951 "Complete_Lattice"; corresponding constants (and abbreviations)
4952 renamed and with authentic syntax:
4953 Set.Inf ~> Complete_Lattice.Inf
4954 Set.Sup ~> Complete_Lattice.Sup
4955 Set.INFI ~> Complete_Lattice.INFI
4956 Set.SUPR ~> Complete_Lattice.SUPR
4957 Set.Inter ~> Complete_Lattice.Inter
4958 Set.Union ~> Complete_Lattice.Union
4959 Set.INTER ~> Complete_Lattice.INTER
4960 Set.UNION ~> Complete_Lattice.UNION
4961 - authentic syntax for
4964 - mere abbreviations:
4967 Set.inter (for inf, formerly Set.Int)
4968 Set.union (for sup, formerly Set.Un)
4969 Complete_Lattice.Inter (for Inf)
4970 Complete_Lattice.Union (for Sup)
4971 Complete_Lattice.INTER (for INFI)
4972 Complete_Lattice.UNION (for SUPR)
4973 - object-logic definitions as far as appropriate
4975 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
4976 Un_subset_iff are explicitly deleted as default simp rules; then also
4977 their lattice counterparts le_inf_iff and le_sup_iff have to be
4978 deleted to achieve the desired effect.
4980 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
4981 rules by default any longer; the same applies to min_max.inf_absorb1
4982 etc. INCOMPATIBILITY.
4984 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
4985 pred_set_conv by default. INCOMPATIBILITY.
4987 * Power operations on relations and functions are now one dedicated
4988 constant "compow" with infix syntax "^^". Power operation on
4989 multiplicative monoids retains syntax "^" and is now defined generic
4990 in class power. INCOMPATIBILITY.
4992 * Relation composition "R O S" now has a more standard argument order:
4993 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
4994 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
4995 break, since the O_assoc rule was not rewritten like this. Fix using
4996 O_assoc[symmetric]. The same applies to the curried version "R OO S".
4998 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
4999 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
5002 * Most rules produced by inductive and datatype package have mandatory
5003 prefixes. INCOMPATIBILITY.
5005 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
5006 the attribute of the same name. Each of the theorems in the list
5007 DERIV_intros assumes composition with an additional function and
5008 matches a variable to the derivative, which has to be solved by the
5009 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
5010 of most elementary terms. Former Maclauren.DERIV_tac and
5011 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
5014 * Code generator attributes follow the usual underscore convention:
5015 code_unfold replaces code unfold
5016 code_post replaces code post
5021 sizechange -> size_change
5022 induct_scheme -> induction_schema
5025 * Discontinued abbreviation "arbitrary" of constant "undefined".
5026 INCOMPATIBILITY, use "undefined" directly.
5029 Suc_eq_add_numeral_1 -> Suc_eq_plus1
5030 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
5031 Suc_plus1 -> Suc_eq_plus1
5032 *anti_sym -> *antisym*
5033 vector_less_eq_def -> vector_le_def
5036 * Added theorem List.map_map as [simp]. Removed List.map_compose.
5039 * Removed predicate "M hassize n" (<--> card M = n & finite M).
5045 * Theory Representable defines a class "rep" of domains that are
5046 representable (via an ep-pair) in the universal domain type "udom".
5047 Instances are provided for all type constructors defined in HOLCF.
5049 * The 'new_domain' command is a purely definitional version of the
5050 domain package, for representable domains. Syntax is identical to the
5051 old domain package. The 'new_domain' package also supports indirect
5052 recursion using previously-defined type constructors. See
5053 src/HOLCF/ex/New_Domain.thy for examples.
5055 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
5056 on the left-hand side of an equation, and then performs
5057 simplification. Rewriting is done using rules declared with the
5058 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
5059 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
5061 * The pattern-match compiler in 'fixrec' can now handle constructors
5062 with HOL function types. Pattern-match combinators for the Pair
5063 constructor are pre-configured.
5065 * The 'fixrec' package now produces better fixed-point induction rules
5066 for mutually-recursive definitions: Induction rules have conclusions
5067 of the form "P foo bar" instead of "P <foo, bar>".
5069 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
5070 been renamed to "below". The name "below" now replaces "less" in many
5071 theorem names. (Legacy theorem names using "less" are still supported
5074 * The 'fixrec' package now supports "bottom patterns". Bottom
5075 patterns can be used to generate strictness rules, or to make
5076 functions more strict (much like the bang-patterns supported by the
5077 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
5083 * Support for Poly/ML 5.3.0, with improved reporting of compiler
5084 errors and run-time exceptions, including detailed source positions.
5086 * Structure Name_Space (formerly NameSpace) now manages uniquely
5087 identified entries, with some additional information such as source
5088 position, logical grouping etc.
5090 * Theory and context data is now introduced by the simplified and
5091 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
5092 to be pure, but the old TheoryDataFun for mutable data (with explicit
5093 copy operation) is still available for some time.
5095 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
5096 provides a high-level programming interface to synchronized state
5097 variables with atomic update. This works via pure function
5098 application within a critical section -- its runtime should be as
5099 short as possible; beware of deadlocks if critical code is nested,
5100 either directly or indirectly via other synchronized variables!
5102 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
5103 wraps raw ML references, explicitly indicating their non-thread-safe
5104 behaviour. The Isar toplevel keeps this structure open, to
5105 accommodate Proof General as well as quick and dirty interactive
5106 experiments with references.
5108 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
5109 parallel tactical reasoning.
5111 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
5112 are similar to SUBPROOF, but are slightly more flexible: only the
5113 specified parts of the subgoal are imported into the context, and the
5114 body tactic may introduce new subgoals and schematic variables.
5116 * Old tactical METAHYPS, which does not observe the proof context, has
5117 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
5118 or Subgoal.FOCUS etc.
5120 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
5121 functors have their own ML name space there is no point to mark them
5122 separately.) Minor INCOMPATIBILITY.
5124 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
5126 * Renamed several structures FooBar to Foo_Bar. Occasional,
5129 * Operations of structure Skip_Proof no longer require quick_and_dirty
5130 mode, which avoids critical setmp.
5132 * Eliminated old Attrib.add_attributes, Method.add_methods and related
5133 combinators for "args". INCOMPATIBILITY, need to use simplified
5134 Attrib/Method.setup introduced in Isabelle2009.
5136 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
5137 back on global_simpset_of, global_claset_of, global_clasimpset_of as
5138 last resort. INCOMPATIBILITY.
5140 * Display.pretty_thm now requires a proper context (cf. former
5141 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
5142 or even Display.pretty_thm_without_context as last resort.
5145 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
5146 Syntax.pretty_typ/term directly, preferably with proper context
5147 instead of global theory.
5152 * Further fine tuning of parallel proof checking, scales up to 8 cores
5153 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
5156 * Support for additional "Isabelle components" via etc/components, see
5157 also the system manual.
5159 * The isabelle makeall tool now operates on all components with
5160 IsaMakefile, not just hardwired "logics".
5162 * Removed "compress" option from isabelle-process and isabelle usedir;
5163 this is always enabled.
5165 * Discontinued support for Poly/ML 4.x versions.
5167 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
5168 on a given logic image. This requires the lighttpd webserver and is
5169 currently supported on Linux only.
5173 New in Isabelle2009 (April 2009)
5174 --------------------------------
5178 * Simplified main Isabelle executables, with less surprises on
5179 case-insensitive file-systems (such as Mac OS).
5181 - The main Isabelle tool wrapper is now called "isabelle" instead of
5184 - The former "isabelle" alias for "isabelle-process" has been
5185 removed (should rarely occur to regular users).
5187 - The former "isabelle-interface" and its alias "Isabelle" have been
5188 removed (interfaces are now regular Isabelle tools).
5190 Within scripts and make files, the Isabelle environment variables
5191 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
5192 respectively. (The latter are still available as legacy feature.)
5194 The old isabelle-interface wrapper could react in confusing ways if
5195 the interface was uninstalled or changed otherwise. Individual
5196 interface tool configuration is now more explicit, see also the
5197 Isabelle system manual. In particular, Proof General is now available
5198 via "isabelle emacs".
5200 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
5201 purge installed copies of Isabelle executables and re-run "isabelle
5202 install -p ...", or use symlinks.
5204 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
5205 old ~/isabelle, which was slightly non-standard and apt to cause
5206 surprises on case-insensitive file-systems (such as Mac OS).
5208 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
5209 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
5210 care is required when using older releases of Isabelle. Note that
5211 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
5212 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
5214 * Proofs of fully specified statements are run in parallel on
5215 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
5216 a regular 4-core machine, if the initial heap space is made reasonably
5217 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
5219 * The main reference manuals ("isar-ref", "implementation", and
5220 "system") have been updated and extended. Formally checked references
5221 as hyperlinks are now available uniformly.
5226 * Complete re-implementation of locales. INCOMPATIBILITY in several
5227 respects. The most important changes are listed below. See the
5228 Tutorial on Locales ("locales" manual) for details.
5230 - In locale expressions, instantiation replaces renaming. Parameters
5231 must be declared in a for clause. To aid compatibility with previous
5232 parameter inheritance, in locale declarations, parameters that are not
5233 'touched' (instantiation position "_" or omitted) are implicitly added
5234 with their syntax at the beginning of the for clause.
5236 - Syntax from abbreviations and definitions in locales is available in
5237 locale expressions and context elements. The latter is particularly
5238 useful in locale declarations.
5240 - More flexible mechanisms to qualify names generated by locale
5241 expressions. Qualifiers (prefixes) may be specified in locale
5242 expressions, and can be marked as mandatory (syntax: "name!:") or
5243 optional (syntax "name?:"). The default depends for plain "name:"
5244 depends on the situation where a locale expression is used: in
5245 commands 'locale' and 'sublocale' prefixes are optional, in
5246 'interpretation' and 'interpret' prefixes are mandatory. The old
5247 implicit qualifiers derived from the parameter names of a locale are
5248 no longer generated.
5250 - Command "sublocale l < e" replaces "interpretation l < e". The
5251 instantiation clause in "interpretation" and "interpret" (square
5252 brackets) is no longer available. Use locale expressions.
5254 - When converting proof scripts, mandatory qualifiers in
5255 'interpretation' and 'interpret' should be retained by default, even
5256 if this is an INCOMPATIBILITY compared to former behavior. In the
5257 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
5258 in locale expressions range over a single locale instance only.
5260 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
5261 In existing theorem specifications replace the includes element by the
5262 respective context elements of the included locale, omitting those
5263 that are already present in the theorem specification. Multiple
5264 assume elements of a locale should be replaced by a single one
5265 involving the locale predicate. In the proof body, declarations (most
5266 notably theorems) may be regained by interpreting the respective
5267 locales in the proof context as required (command "interpret").
5269 If using "includes" in replacement of a target solely because the
5270 parameter types in the theorem are not as general as in the target,
5271 consider declaring a new locale with additional type constraints on
5272 the parameters (context element "constrains").
5274 - Discontinued "locale (open)". INCOMPATIBILITY.
5276 - Locale interpretation commands no longer attempt to simplify goal.
5277 INCOMPATIBILITY: in rare situations the generated goal differs. Use
5278 methods intro_locales and unfold_locales to clarify.
5280 - Locale interpretation commands no longer accept interpretation
5281 attributes. INCOMPATIBILITY.
5283 * Class declaration: so-called "base sort" must not be given in import
5284 list any longer, but is inferred from the specification. Particularly
5291 class foo = type + ...
5293 * Class target: global versions of theorems stemming do not carry a
5294 parameter prefix any longer. INCOMPATIBILITY.
5296 * Class 'instance' command no longer accepts attached definitions.
5297 INCOMPATIBILITY, use proper 'instantiation' target instead.
5299 * Recovered hiding of consts, which was accidentally broken in
5300 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
5301 makes c inaccessible; consider using ``hide (open) const c'' instead.
5303 * Slightly more coherent Pure syntax, with updated documentation in
5304 isar-ref manual. Removed locales meta_term_syntax and
5305 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
5306 INCOMPATIBILITY in rare situations. Note that &&& should not be used
5307 directly in regular applications.
5309 * There is a new syntactic category "float_const" for signed decimal
5310 fractions (e.g. 123.45 or -123.45).
5312 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
5313 interface with 'setup' command instead.
5315 * Command 'local_setup' is similar to 'setup', but operates on a local
5318 * The 'axiomatization' command now only works within a global theory
5319 context. INCOMPATIBILITY.
5321 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
5322 hypotheses. Sorts required in the course of reasoning need to be
5323 covered by the constraints in the initial statement, completed by the
5324 type instance information of the background theory. Non-trivial sort
5325 hypotheses, which rarely occur in practice, may be specified via
5326 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
5328 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
5330 The result contains an implicit sort hypotheses as before --
5331 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
5334 * Generalized Isar history, with support for linear undo, direct state
5337 * Changed defaults for unify configuration options:
5339 unify_trace_bound = 50 (formerly 25)
5340 unify_search_bound = 60 (formerly 30)
5342 * Different bookkeeping for code equations (INCOMPATIBILITY):
5344 a) On theory merge, the last set of code equations for a particular
5345 constant is taken (in accordance with the policy applied by other
5346 parts of the code generator framework).
5348 b) Code equations stemming from explicit declarations (e.g. code
5349 attribute) gain priority over default code equations stemming
5350 from definition, primrec, fun etc.
5352 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
5354 * Unified theorem tables for both code generators. Thus [code
5355 func] has disappeared and only [code] remains. INCOMPATIBILITY.
5357 * Command 'find_consts' searches for constants based on type and name
5360 find_consts "_ => bool"
5362 By default, matching is against subtypes, but it may be restricted to
5363 the whole type. Searching by name is possible. Multiple queries are
5364 conjunctive and queries may be negated by prefixing them with a
5367 find_consts strict: "_ => bool" name: "Int" -"int => int"
5369 * New 'find_theorems' criterion "solves" matches theorems that
5370 directly solve the current goal (modulo higher-order unification).
5372 * Auto solve feature for main theorem statements: whenever a new goal
5373 is stated, "find_theorems solves" is called; any theorems that could
5374 solve the lemma directly are listed as part of the goal state.
5375 Cf. associated options in Proof General Isabelle settings menu,
5376 enabled by default, with reasonable timeout for pathological cases of
5377 higher-order unification.
5380 *** Document preparation ***
5382 * Antiquotation @{lemma} now imitates a regular terminal proof,
5383 demanding keyword 'by' and supporting the full method expression
5384 syntax just like the Isar command 'by'.
5389 * Integrated main parts of former image HOL-Complex with HOL. Entry
5390 points Main and Complex_Main remain as before.
5392 * Logic image HOL-Plain provides a minimal HOL with the most important
5393 tools available (inductive, datatype, primrec, ...). This facilitates
5394 experimentation and tool development. Note that user applications
5395 (and library theories) should never refer to anything below theory
5398 * Logic image HOL-Main stops at theory Main, and thus facilitates
5399 experimentation due to shorter build times.
5401 * Logic image HOL-NSA contains theories of nonstandard analysis which
5402 were previously part of former HOL-Complex. Entry point Hyperreal
5403 remains valid, but theories formerly using Complex_Main should now use
5404 new entry point Hypercomplex.
5406 * Generic ATP manager for Sledgehammer, based on ML threads instead of
5407 Posix processes. Avoids potentially expensive forking of the ML
5408 process. New thread-based implementation also works on non-Unix
5409 platforms (Cygwin). Provers are no longer hardwired, but defined
5410 within the theory via plain ML wrapper functions. Basic Sledgehammer
5411 commands are covered in the isar-ref manual.
5413 * Wrapper scripts for remote SystemOnTPTP service allows to use
5414 sledgehammer without local ATP installation (Vampire etc.). Other
5415 provers may be included via suitable ML wrappers, see also
5416 src/HOL/ATP_Linkup.thy.
5418 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
5421 * The metis method no longer fails because the theorem is too trivial
5422 (contains the empty clause).
5424 * The metis method now fails in the usual manner, rather than raising
5425 an exception, if it determines that it cannot prove the theorem.
5427 * Method "coherent" implements a prover for coherent logic (see also
5428 src/Tools/coherent.ML).
5430 * Constants "undefined" and "default" replace "arbitrary". Usually
5431 "undefined" is the right choice to replace "arbitrary", though
5432 logically there is no difference. INCOMPATIBILITY.
5434 * Command "value" now integrates different evaluation mechanisms. The
5435 result of the first successful evaluation mechanism is printed. In
5436 square brackets a particular named evaluation mechanisms may be
5437 specified (currently, [SML], [code] or [nbe]). See further
5438 src/HOL/ex/Eval_Examples.thy.
5440 * Normalization by evaluation now allows non-leftlinear equations.
5441 Declare with attribute [code nbe].
5443 * Methods "case_tac" and "induct_tac" now refer to the very same rules
5444 as the structured Isar versions "cases" and "induct", cf. the
5445 corresponding "cases" and "induct" attributes. Mutual induction rules
5446 are now presented as a list of individual projections
5447 (e.g. foo_bar.inducts for types foo and bar); the old format with
5448 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
5449 rare situations a different rule is selected --- notably nested tuple
5450 elimination instead of former prod.exhaust: use explicit (case_tac t
5451 rule: prod.exhaust) here.
5453 * Attributes "cases", "induct", "coinduct" support "del" option.
5455 * Removed fact "case_split_thm", which duplicates "case_split".
5457 * The option datatype has been moved to a new theory Option. Renamed
5458 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
5460 * New predicate "strict_mono" classifies strict functions on partial
5461 orders. With strict functions on linear orders, reasoning about
5462 (in)equalities is facilitated by theorems "strict_mono_eq",
5463 "strict_mono_less_eq" and "strict_mono_less".
5465 * Some set operations are now proper qualified constants with
5466 authentic syntax. INCOMPATIBILITY:
5477 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
5480 * Auxiliary class "itself" has disappeared -- classes without any
5481 parameter are treated as expected by the 'class' command.
5483 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
5485 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
5486 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
5488 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
5489 method "approximation". It proves formulas on real values by using
5490 interval arithmetic. In the formulas are also the transcendental
5491 functions sin, cos, tan, atan, ln, exp and the constant pi are
5492 allowed. For examples see
5493 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
5495 * Theory "Reflection" now resides in HOL/Library.
5497 * Entry point to Word library now simply named "Word".
5500 * Made source layout more coherent with logical distribution
5503 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
5504 src/HOL/Library/Code_Message.thy ~> src/HOL/
5505 src/HOL/Library/GCD.thy ~> src/HOL/
5506 src/HOL/Library/Order_Relation.thy ~> src/HOL/
5507 src/HOL/Library/Parity.thy ~> src/HOL/
5508 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
5509 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
5510 src/HOL/Real/Lubs.thy ~> src/HOL/
5511 src/HOL/Real/PReal.thy ~> src/HOL/
5512 src/HOL/Real/Rational.thy ~> src/HOL/
5513 src/HOL/Real/RComplete.thy ~> src/HOL/
5514 src/HOL/Real/RealDef.thy ~> src/HOL/
5515 src/HOL/Real/RealPow.thy ~> src/HOL/
5516 src/HOL/Real/Real.thy ~> src/HOL/
5517 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
5518 src/HOL/Complex/Complex.thy ~> src/HOL/
5519 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
5520 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
5521 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
5522 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
5523 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
5524 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
5525 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
5526 src/HOL/Hyperreal/Log.thy ~> src/HOL/
5527 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
5528 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
5529 src/HOL/Hyperreal/Series.thy ~> src/HOL/
5530 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
5531 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
5532 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
5533 src/HOL/Real/Float ~> src/HOL/Library/
5534 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
5535 src/HOL/Real/RealVector.thy ~> src/HOL/
5537 src/HOL/arith_data.ML ~> src/HOL/Tools
5538 src/HOL/hologic.ML ~> src/HOL/Tools
5539 src/HOL/simpdata.ML ~> src/HOL/Tools
5540 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
5541 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
5542 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
5543 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
5544 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
5545 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
5546 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
5548 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
5549 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
5550 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
5551 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
5552 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
5553 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
5555 * If methods "eval" and "evaluation" encounter a structured proof
5556 state with !!/==>, only the conclusion is evaluated to True (if
5557 possible), avoiding strange error messages.
5559 * Method "sizechange" automates termination proofs using (a
5560 modification of) the size-change principle. Requires SAT solver. See
5561 src/HOL/ex/Termination.thy for examples.
5563 * Simplifier: simproc for let expressions now unfolds if bound
5564 variable occurs at most once in let expression body. INCOMPATIBILITY.
5566 * Method "arith": Linear arithmetic now ignores all inequalities when
5567 fast_arith_neq_limit is exceeded, instead of giving up entirely.
5569 * New attribute "arith" for facts that should always be used
5570 automatically by arithmetic. It is intended to be used locally in
5573 assumes [arith]: "x > 0"
5575 Global usage is discouraged because of possible performance impact.
5577 * New classes "top" and "bot" with corresponding operations "top" and
5578 "bot" in theory Orderings; instantiation of class "complete_lattice"
5579 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
5581 * Changed definition lemma "less_fun_def" in order to provide an
5582 instance for preorders on functions; use lemma "less_le" instead.
5585 * Theory Orderings: class "wellorder" moved here, with explicit
5586 induction rule "less_induct" as assumption. For instantiation of
5587 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
5590 * Theory Orderings: added class "preorder" as superclass of "order".
5591 INCOMPATIBILITY: Instantiation proofs for order, linorder
5592 etc. slightly changed. Some theorems named order_class.* now named
5595 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
5598 * Theory Finite_Set: added a new fold combinator of type
5600 ('a => 'b => 'b) => 'b => 'a set => 'b
5602 Occasionally this is more convenient than the old fold combinator
5603 which is now defined in terms of the new one and renamed to
5606 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
5607 and "ring_simps" have been replaced by "algebra_simps" (which can be
5608 extended with further lemmas!). At the moment both still exist but
5609 the former will disappear at some point.
5611 * Theory Power: Lemma power_Suc is now declared as a simp rule in
5612 class recpower. Type-specific simp rules for various recpower types
5613 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
5615 rat_power_0 -> power_0
5616 rat_power_Suc -> power_Suc
5617 realpow_0 -> power_0
5618 realpow_Suc -> power_Suc
5619 complexpow_0 -> power_0
5620 complexpow_Suc -> power_Suc
5621 power_poly_0 -> power_0
5622 power_poly_Suc -> power_Suc
5624 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
5625 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
5626 dvd has been generalized to class comm_semiring_1. Likewise a bunch
5627 of lemmas from Divides has been generalized from nat to class
5628 semiring_div. INCOMPATIBILITY. This involves the following theorem
5629 renames resulting from duplicate elimination:
5631 dvd_def_mod ~> dvd_eq_mod_eq_0
5632 zero_dvd_iff ~> dvd_0_left_iff
5633 dvd_0 ~> dvd_0_right
5634 DIVISION_BY_ZERO_DIV ~> div_by_0
5635 DIVISION_BY_ZERO_MOD ~> mod_by_0
5636 mult_div ~> div_mult_self2_is_id
5637 mult_mod ~> mod_mult_self2_is_0
5639 * Theory IntDiv: removed many lemmas that are instances of class-based
5640 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
5641 rename old lemmas as follows:
5643 dvd_diff -> nat_dvd_diff
5644 dvd_zminus_iff -> dvd_minus_iff
5645 mod_add1_eq -> mod_add_eq
5646 mod_mult1_eq -> mod_mult_right_eq
5647 mod_mult1_eq' -> mod_mult_left_eq
5648 mod_mult_distrib_mod -> mod_mult_eq
5649 nat_mod_add_left_eq -> mod_add_left_eq
5650 nat_mod_add_right_eq -> mod_add_right_eq
5651 nat_mod_div_trivial -> mod_div_trivial
5652 nat_mod_mod_trivial -> mod_mod_trivial
5653 zdiv_zadd_self1 -> div_add_self1
5654 zdiv_zadd_self2 -> div_add_self2
5655 zdiv_zmult_self1 -> div_mult_self2_is_id
5656 zdiv_zmult_self2 -> div_mult_self1_is_id
5657 zdvd_triv_left -> dvd_triv_left
5658 zdvd_triv_right -> dvd_triv_right
5659 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
5660 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
5661 zmod_zadd_left_eq -> mod_add_left_eq
5662 zmod_zadd_right_eq -> mod_add_right_eq
5663 zmod_zadd_self1 -> mod_add_self1
5664 zmod_zadd_self2 -> mod_add_self2
5665 zmod_zadd1_eq -> mod_add_eq
5666 zmod_zdiff1_eq -> mod_diff_eq
5667 zmod_zdvd_zmod -> mod_mod_cancel
5668 zmod_zmod_cancel -> mod_mod_cancel
5669 zmod_zmult_self1 -> mod_mult_self2_is_0
5670 zmod_zmult_self2 -> mod_mult_self1_is_0
5673 zdvd_abs1 -> abs_dvd_iff
5674 zdvd_abs2 -> dvd_abs_iff
5675 zdvd_refl -> dvd_refl
5676 zdvd_trans -> dvd_trans
5677 zdvd_zadd -> dvd_add
5678 zdvd_zdiff -> dvd_diff
5679 zdvd_zminus_iff -> dvd_minus_iff
5680 zdvd_zminus2_iff -> minus_dvd_iff
5681 zdvd_zmultD -> dvd_mult_right
5682 zdvd_zmultD2 -> dvd_mult_left
5683 zdvd_zmult_mono -> mult_dvd_mono
5684 zdvd_0_right -> dvd_0_right
5685 zdvd_0_left -> dvd_0_left_iff
5686 zdvd_1_left -> one_dvd
5687 zminus_dvd_iff -> minus_dvd_iff
5689 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
5691 * The real numbers offer decimal input syntax: 12.34 is translated
5692 into 1234/10^2. This translation is not reversed upon output.
5694 * Theory Library/Polynomial defines an abstract type 'a poly of
5695 univariate polynomials with coefficients of type 'a. In addition to
5696 the standard ring operations, it also supports div and mod. Code
5697 generation is also supported, using list-style constructors.
5699 * Theory Library/Inner_Product defines a class of real_inner for real
5700 inner product spaces, with an overloaded operation inner :: 'a => 'a
5701 => real. Class real_inner is a subclass of real_normed_vector from
5704 * Theory Library/Product_Vector provides instances for the product
5705 type 'a * 'b of several classes from RealVector and Inner_Product.
5706 Definitions of addition, subtraction, scalar multiplication, norms,
5707 and inner products are included.
5709 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
5710 addition to the field operations, numerals and case syntax are also
5713 * Theory Library/Diagonalize provides constructive version of Cantor's
5714 first diagonalization argument.
5716 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
5717 zlcm (for int); carried together from various gcd/lcm developements in
5718 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
5719 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
5720 may recover tupled syntax as follows:
5722 hide (open) const gcd
5723 abbreviation gcd where
5724 "gcd == (%(a, b). GCD.gcd a b)"
5726 GCD.gcd ("gcd '(_, _')")
5728 The same works for lcm, zgcd, zlcm.
5730 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
5731 instantiations for algebraic structures. Removed some duplicate
5732 theorems. Changes in simp rules. INCOMPATIBILITY.
5734 * ML antiquotation @{code} takes a constant as argument and generates
5735 corresponding code in background and inserts name of the corresponding
5736 resulting ML value/function/datatype constructor binding in place.
5737 All occurrences of @{code} with a single ML block are generated
5738 simultaneously. Provides a generic and safe interface for
5739 instrumentalizing code generation. See
5740 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
5741 In future you ought to refrain from ad-hoc compiling generated SML
5742 code on the ML toplevel. Note that (for technical reasons) @{code}
5743 cannot refer to constants for which user-defined serializations are
5744 set. Refer to the corresponding ML counterpart directly in that
5747 * Command 'rep_datatype': instead of theorem names the command now
5748 takes a list of terms denoting the constructors of the type to be
5749 represented as datatype. The characteristic theorems have to be
5750 proven. INCOMPATIBILITY. Also observe that the following theorems
5751 have disappeared in favour of existing ones:
5753 unit_induct ~> unit.induct
5754 prod_induct ~> prod.induct
5755 sum_induct ~> sum.induct
5756 Suc_Suc_eq ~> nat.inject
5757 Suc_not_Zero Zero_not_Suc ~> nat.distinct
5762 * New locales for orders and lattices where the equivalence relation
5763 is not restricted to equality. INCOMPATIBILITY: all order and lattice
5764 locales use a record structure with field eq for the equivalence.
5766 * New theory of factorial domains.
5768 * Units_l_inv and Units_r_inv are now simp rules by default.
5769 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
5770 and/or r_inv will now also require deletion of these lemmas.
5772 * Renamed the following theorems, INCOMPATIBILITY:
5774 UpperD ~> Upper_memD
5775 LowerD ~> Lower_memD
5776 least_carrier ~> least_closed
5777 greatest_carrier ~> greatest_closed
5778 greatest_Lower_above ~> greatest_Lower_below
5779 one_zero ~> carrier_one_zero
5780 one_not_zero ~> carrier_one_not_zero (collision with assumption)
5785 * Nominal datatypes can now contain type-variables.
5787 * Commands 'nominal_inductive' and 'equivariance' work with local
5790 * Nominal primrec can now works with local theory targets and its
5791 specification syntax now conforms to the general format as seen in
5794 * Method "perm_simp" honours the standard simplifier attributes
5795 (no_asm), (no_asm_use) etc.
5797 * The new predicate #* is defined like freshness, except that on the
5798 left hand side can be a set or list of atoms.
5800 * Experimental command 'nominal_inductive2' derives strong induction
5801 principles for inductive definitions. In contrast to
5802 'nominal_inductive', which can only deal with a fixed number of
5803 binders, it can deal with arbitrary expressions standing for sets of
5804 atoms to be avoided. The only inductive definition we have at the
5805 moment that needs this generalisation is the typing rule for Lets in
5808 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
5809 -----------------------------------------------------------------
5810 Gamma |- Let x be t1 in t2 : T2
5812 In this rule one wants to avoid all the binders that are introduced by
5813 "close Gamma T1". We are looking for other examples where this
5814 feature might be useful. Please let us know.
5819 * Reimplemented the simplification procedure for proving continuity
5820 subgoals. The new simproc is extensible; users can declare additional
5821 continuity introduction rules with the attribute [cont2cont].
5823 * The continuity simproc now uses a different introduction rule for
5824 solving continuity subgoals on terms with lambda abstractions. In
5825 some rare cases the new simproc may fail to solve subgoals that the
5826 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
5827 Potential INCOMPATIBILITY.
5829 * Command 'fixrec': specification syntax now conforms to the general
5830 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
5831 examples. INCOMPATIBILITY.
5836 * Proof of Zorn's Lemma for partial orders.
5841 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
5842 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
5843 depends on multithreading, so timouts will not work before Poly/ML
5846 * High-level support for concurrent ML programming, see
5847 src/Pure/Cuncurrent. The data-oriented model of "future values" is
5848 particularly convenient to organize independent functional
5849 computations. The concept of "synchronized variables" provides a
5850 higher-order interface for components with shared state, avoiding the
5851 delicate details of mutexes and condition variables. (Requires
5852 Poly/ML 5.2.1 or later.)
5854 * ML bindings produced via Isar commands are stored within the Isar
5855 context (theory or proof). Consequently, commands like 'use' and 'ML'
5856 become thread-safe and work with undo as expected (concerning
5857 top-level bindings, not side-effects on global references).
5858 INCOMPATIBILITY, need to provide proper Isar context when invoking the
5859 compiler at runtime; really global bindings need to be given outside a
5860 theory. (Requires Poly/ML 5.2 or later.)
5862 * Command 'ML_prf' is analogous to 'ML' but works within a proof
5863 context. Top-level ML bindings are stored within the proof context in
5864 a purely sequential fashion, disregarding the nested proof structure.
5865 ML bindings introduced by 'ML_prf' are discarded at the end of the
5866 proof. (Requires Poly/ML 5.2 or later.)
5868 * Simplified ML attribute and method setup, cf. functions Attrib.setup
5869 and Method.setup, as well as Isar commands 'attribute_setup' and
5870 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
5871 existing code accordingly, or use plain 'setup' together with old
5874 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
5875 to 'a -> thm, while results are always tagged with an authentic oracle
5876 name. The Isar command 'oracle' is now polymorphic, no argument type
5877 is specified. INCOMPATIBILITY, need to simplify existing oracle code
5878 accordingly. Note that extra performance may be gained by producing
5879 the cterm carefully, avoiding slow Thm.cterm_of.
5881 * Simplified interface for defining document antiquotations via
5882 ThyOutput.antiquotation, ThyOutput.output, and optionally
5883 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
5884 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
5887 * More systematic treatment of long names, abstract name bindings, and
5888 name space operations. Basic operations on qualified names have been
5889 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
5890 Long_Name.append. Old type bstring has been mostly replaced by
5891 abstract type binding (see structure Binding), which supports precise
5892 qualification by packages and local theory targets, as well as proper
5893 tracking of source positions. INCOMPATIBILITY, need to wrap old
5894 bstring values into Binding.name, or better pass through abstract
5895 bindings everywhere. See further src/Pure/General/long_name.ML,
5896 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
5898 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
5899 LocalTheory.note etc.) now refer to the *full* internal name, not the
5900 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
5902 * Disposed old type and term read functions (Sign.read_def_typ,
5903 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
5904 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
5905 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
5906 Syntax.read_term_global etc.; see also OldGoals.read_term as last
5907 resort for legacy applications.
5909 * Disposed old declarations, tactics, tactic combinators that refer to
5910 the simpset or claset of an implicit theory (such as Addsimps,
5911 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
5912 embedded ML text, or local_simpset_of with a proper context passed as
5913 explicit runtime argument.
5915 * Rules and tactics that read instantiations (read_instantiate,
5916 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
5917 context, which is required for parsing and type-checking. Moreover,
5918 the variables are specified as plain indexnames, not string encodings
5919 thereof. INCOMPATIBILITY.
5921 * Generic Toplevel.add_hook interface allows to analyze the result of
5922 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
5923 for theorem dependency output of transactions resulting in a new
5926 * ML antiquotations: block-structured compilation context indicated by
5927 \<lbrace> ... \<rbrace>; additional antiquotation forms:
5929 @{binding name} - basic name binding
5930 @{let ?pat = term} - term abbreviation (HO matching)
5931 @{note name = fact} - fact abbreviation
5932 @{thm fact} - singleton fact (with attributes)
5933 @{thms fact} - general fact (with attributes)
5934 @{lemma prop by method} - singleton goal
5935 @{lemma prop by meth1 meth2} - singleton goal
5936 @{lemma prop1 ... propN by method} - general goal
5937 @{lemma prop1 ... propN by meth1 meth2} - general goal
5938 @{lemma (open) ...} - open derivation
5943 * The Isabelle "emacs" tool provides a specific interface to invoke
5944 Proof General / Emacs, with more explicit failure if that is not
5945 installed (the old isabelle-interface script silently falls back on
5946 isabelle-process). The PROOFGENERAL_HOME setting determines the
5947 installation location of the Proof General distribution.
5949 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
5950 the Isabelle process into a JVM/Scala application. See
5951 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
5952 process wrapper has been discontinued.)
5954 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
5956 * Various status messages (with exact source position information) are
5957 emitted, if proper markup print mode is enabled. This allows
5958 user-interface components to provide detailed feedback on internal
5963 New in Isabelle2008 (June 2008)
5964 -------------------------------
5968 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
5969 and updated, with formally checked references as hyperlinks.
5971 * Theory loader: use_thy (and similar operations) no longer set the
5972 implicit ML context, which was occasionally hard to predict and in
5973 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
5974 provides a proper context already.
5976 * Theory loader: old-style ML proof scripts being *attached* to a thy
5977 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
5978 'use' within a theory file will do the job.
5980 * Name space merge now observes canonical order, i.e. the second space
5981 is inserted into the first one, while existing entries in the first
5982 space take precedence. INCOMPATIBILITY in rare situations, may try to
5983 swap theory imports.
5985 * Syntax: symbol \<chi> is now considered a letter. Potential
5986 INCOMPATIBILITY in identifier syntax etc.
5988 * Outer syntax: string tokens no longer admit escaped white space,
5989 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
5990 white space without escapes.
5992 * Outer syntax: string tokens may contain arbitrary character codes
5993 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
5999 * Context-dependent token translations. Default setup reverts locally
6000 fixed variables, and adds hilite markup for undeclared frees.
6002 * Unused theorems can be found using the new command 'unused_thms'.
6003 There are three ways of invoking it:
6006 Only finds unused theorems in the current theory.
6008 (2) unused_thms thy_1 ... thy_n -
6009 Finds unused theorems in the current theory and all of its ancestors,
6010 excluding the theories thy_1 ... thy_n and all of their ancestors.
6012 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
6013 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
6014 their ancestors, excluding the theories thy_1 ... thy_n and all of
6017 In order to increase the readability of the list produced by
6018 unused_thms, theorems that have been created by a particular instance
6019 of a theory command such as 'inductive' or 'function' are considered
6020 to belong to the same "group", meaning that if at least one theorem in
6021 this group is used, the other theorems in the same group are no longer
6022 reported as unused. Moreover, if all theorems in the group are
6023 unused, only one theorem in the group is displayed.
6025 Note that proof objects have to be switched on in order for
6026 unused_thms to work properly (i.e. !proofs must be >= 1, which is
6027 usually the case when using Proof General with the default settings).
6029 * Authentic naming of facts disallows ad-hoc overwriting of previous
6030 theorems within the same name space. INCOMPATIBILITY, need to remove
6031 duplicate fact bindings, or even accidental fact duplications. Note
6032 that tools may maintain dynamically scoped facts systematically, using
6033 PureThy.add_thms_dynamic.
6035 * Command 'hide' now allows to hide from "fact" name space as well.
6037 * Eliminated destructive theorem database, simpset, claset, and
6038 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
6039 update of theories within ML code.
6041 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
6042 INCOMPATIBILITY, object-logics depending on former Pure require
6043 additional setup PureThy.old_appl_syntax_setup; object-logics
6044 depending on former CPure need to refer to Pure.
6046 * Commands 'use' and 'ML' are now purely functional, operating on
6047 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
6048 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
6051 * Command 'setup': discontinued implicit version with ML reference.
6053 * Instantiation target allows for simultaneous specification of class
6054 instance operations together with an instantiation proof.
6055 Type-checking phase allows to refer to class operations uniformly.
6056 See src/HOL/Complex/Complex.thy for an Isar example and
6057 src/HOL/Library/Eval.thy for an ML example.
6059 * Indexing of literal facts: be more serious about including only
6060 facts from the visible specification/proof context, but not the
6061 background context (locale etc.). Affects `prop` notation and method
6062 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
6065 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
6066 "(open)" option, which used to expose internal bound variables to the
6069 * Isar statements: removed obsolete case "rule_context".
6070 INCOMPATIBILITY, better use explicit fixes/assumes.
6072 * Locale proofs: default proof step now includes 'unfold_locales';
6073 hence 'proof' without argument may be used to unfold locale
6077 *** Document preparation ***
6079 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
6080 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
6081 obsolete thumbpdf setup (contemporary PDF viewers do this on the
6082 spot); renamed link color from "darkblue" to "linkcolor" (default
6083 value unchanged, can be redefined via \definecolor); no longer sets
6084 "a4paper" option (unnecessary or even intrusive).
6086 * Antiquotation @{lemma A method} proves proposition A by the given
6087 method (either a method name or a method name plus (optional) method
6088 arguments in parentheses) and prints A just like @{prop A}.
6093 * New primrec package. Specification syntax conforms in style to
6094 definition/function/.... No separate induction rule is provided. The
6095 "primrec" command distinguishes old-style and new-style specifications
6096 by syntax. The former primrec package is now named OldPrimrecPackage.
6097 When adjusting theories, beware: constants stemming from new-style
6098 primrec specifications have authentic syntax.
6100 * Metis prover is now an order of magnitude faster, and also works
6101 with multithreading.
6103 * Metis: the maximum number of clauses that can be produced from a
6104 theorem is now given by the attribute max_clauses. Theorems that
6105 exceed this number are ignored, with a warning printed.
6107 * Sledgehammer no longer produces structured proofs by default. To
6108 enable, declare [[sledgehammer_full = true]]. Attributes
6109 reconstruction_modulus, reconstruction_sorts renamed
6110 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
6112 * Method "induct_scheme" derives user-specified induction rules
6113 from well-founded induction and completeness of patterns. This factors
6114 out some operations that are done internally by the function package
6115 and makes them available separately. See
6116 src/HOL/ex/Induction_Scheme.thy for examples.
6118 * More flexible generation of measure functions for termination
6119 proofs: Measure functions can be declared by proving a rule of the
6120 form "is_measure f" and giving it the [measure_function] attribute.
6121 The "is_measure" predicate is logically meaningless (always true), and
6122 just guides the heuristic. To find suitable measure functions, the
6123 termination prover sets up the goal "is_measure ?f" of the appropriate
6124 type and generates all solutions by prolog-style backwards proof using
6127 This setup also deals with rules like
6129 "is_measure f ==> is_measure (list_size f)"
6131 which accommodates nested datatypes that recurse through lists.
6132 Similar rules are predeclared for products and option types.
6134 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
6138 - Definitions of overloaded constants on sets have to be replaced by
6139 definitions on => and bool.
6141 - Some definitions of overloaded operators on sets can now be proved
6142 using the definitions of the operators on => and bool. Therefore,
6143 the following theorems have been renamed:
6145 subset_def -> subset_eq
6146 psubset_def -> psubset_eq
6147 set_diff_def -> set_diff_eq
6148 Compl_def -> Compl_eq
6149 Sup_set_def -> Sup_set_eq
6150 Inf_set_def -> Inf_set_eq
6151 sup_set_def -> sup_set_eq
6152 inf_set_def -> inf_set_eq
6154 - Due to the incompleteness of the HO unification algorithm, some
6155 rules such as subst may require manual instantiation, if some of
6156 the unknowns in the rule is a set.
6158 - Higher order unification and forward proofs:
6161 have "P (S::'a set)" <...>
6162 then have "EX S. P S" ..
6164 no longer works (due to the incompleteness of the HO unification
6165 algorithm) and must be replaced by the pattern
6172 - Calculational reasoning with subst (or similar rules):
6175 have "P (S::'a set)" <...>
6176 also have "S = T" <...>
6177 finally have "P T" .
6179 no longer works (for similar reasons as the previous example) and
6180 must be replaced by something like
6182 have "P (S::'a set)" <...>
6183 moreover have "S = T" <...>
6184 ultimately have "P T" by simp
6186 - Tactics or packages written in ML code:
6187 Code performing pattern matching on types via
6189 Type ("set", [T]) => ...
6191 must be rewritten. Moreover, functions like strip_type or
6192 binder_types no longer return the right value when applied to a
6195 T1 => ... => Tn => U => bool
6199 T1 => ... => Tn => U set
6201 * Merged theories Wellfounded_Recursion, Accessible_Part and
6202 Wellfounded_Relations to theory Wellfounded.
6204 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
6206 * Class finite no longer treats UNIV as class parameter. Use class
6207 enum from theory Library/Enum instead to achieve a similar effect.
6210 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
6211 and "Cons". INCOMPATIBILITY.
6213 * HOL (and FOL): renamed variables in rules imp_elim and swap.
6214 Potential INCOMPATIBILITY.
6216 * Theory Product_Type: duplicated lemmas split_Pair_apply and
6217 injective_fst_snd removed, use split_eta and prod_eqI instead.
6218 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
6220 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
6221 the same name in theory Orderings:
6231 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
6232 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
6233 and different variable names.
6235 * Library/Option_ord.thy: Canonical order on option type.
6237 * Library/RBT.thy: Red-black trees, an efficient implementation of
6240 * Library/Countable.thy: Type class for countable types.
6242 * Theory Int: The representation of numerals has changed. The infix
6243 operator BIT and the bit datatype with constructors B0 and B1 have
6244 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
6245 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
6246 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
6249 * Theory Nat: definition of <= and < on natural numbers no longer
6250 depend on well-founded relations. INCOMPATIBILITY. Definitions
6251 le_def and less_def have disappeared. Consider lemmas not_less
6252 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
6254 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
6255 (whose purpose mainly is for various fold_set functionals) have been
6256 abandoned in favor of the existing algebraic classes
6257 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
6258 lower_semilattice (resp. upper_semilattice) and linorder.
6261 * Theory Transitive_Closure: induct and cases rules now declare proper
6262 case_names ("base" and "step"). INCOMPATIBILITY.
6264 * Theorem Inductive.lfp_ordinal_induct generalized to complete
6265 lattices. The form set-specific version is available as
6266 Inductive.lfp_ordinal_induct_set.
6268 * Renamed theorems "power.simps" to "power_int.simps".
6271 * Class semiring_div provides basic abstract properties of semirings
6272 with division and modulo operations. Subsumes former class dvd_mod.
6274 * Merged theories IntDef, Numeral and IntArith into unified theory
6275 Int. INCOMPATIBILITY.
6277 * Theory Library/Code_Index: type "index" now represents natural
6278 numbers rather than integers. INCOMPATIBILITY.
6280 * New class "uminus" with operation "uminus" (split of from class
6281 "minus" which now only has operation "minus", binary).
6284 * Constants "card", "internal_split", "option_map" now with authentic
6285 syntax. INCOMPATIBILITY.
6287 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
6288 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
6289 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
6290 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
6291 Sup_set_def, le_def, less_def, option_map_def now with object
6292 equality. INCOMPATIBILITY.
6294 * Records. Removed K_record, and replaced it by pure lambda term
6295 %x. c. The simplifier setup is now more robust against eta expansion.
6296 INCOMPATIBILITY: in cases explicitly referring to K_record.
6298 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
6300 * Library/ListVector: new theory of arithmetic vector operations.
6302 * Library/Order_Relation: new theory of various orderings as sets of
6303 pairs. Defines preorders, partial orders, linear orders and
6304 well-orders on sets and on types.
6309 * Renamed some theories to allow to loading both ZF and HOL in the
6312 Datatype -> Datatype_ZF
6313 Inductive -> Inductive_ZF
6320 INCOMPATIBILITY: ZF theories that import individual theories below
6321 Main might need to be adapted. Regular theory Main is still
6322 available, as trivial extension of Main_ZF.
6327 * ML within Isar: antiquotation @{const name} or @{const
6328 name(typargs)} produces statically-checked Const term.
6330 * Functor NamedThmsFun: data is available to the user as dynamic fact
6331 (of the same name). Removed obsolete print command.
6333 * Removed obsolete "use_legacy_bindings" function.
6335 * The ``print mode'' is now a thread-local value derived from a global
6336 template (the former print_mode reference), thus access becomes
6337 non-critical. The global print_mode reference is for session
6338 management only; user-code should use print_mode_value,
6339 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
6341 * Functions system/system_out provide a robust way to invoke external
6342 shell commands, with propagation of interrupts (requires Poly/ML
6343 5.2.1). Do not use OS.Process.system etc. from the basis library!
6348 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
6349 in accordance with Proof General 3.7, which prefers GNU emacs.
6351 * isatool tty runs Isabelle process with plain tty interaction;
6352 optional line editor may be specified via ISABELLE_LINE_EDITOR
6353 setting, the default settings attempt to locate "ledit" and "rlwrap".
6355 * isatool browser now works with Cygwin as well, using general
6356 "javapath" function defined in Isabelle process environment.
6358 * YXML notation provides a simple and efficient alternative to
6359 standard XML transfer syntax. See src/Pure/General/yxml.ML and
6360 isatool yxml as described in the Isabelle system manual.
6362 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
6363 provides general wrapper for managing an Isabelle process in a robust
6364 fashion, with ``cooked'' output from stdin/stderr.
6366 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
6367 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
6369 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
6370 way of changing the user's settings is via
6371 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
6374 * Multithreading.max_threads := 0 refers to the number of actual CPU
6375 cores of the underlying machine, which is a good starting point for
6376 optimal performance tuning. The corresponding usedir option -M allows
6377 "max" as an alias for "0". WARNING: does not work on certain versions
6378 of Mac OS (with Poly/ML 5.1).
6380 * isabelle-process: non-ML sessions are run with "nice", to reduce the
6381 adverse effect of Isabelle flooding interactive front-ends (notably
6382 ProofGeneral / XEmacs).
6386 New in Isabelle2007 (November 2007)
6387 -----------------------------------
6391 * More uniform information about legacy features, notably a
6392 warning/error of "Legacy feature: ...", depending on the state of the
6393 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
6394 legacy features will disappear eventually.
6396 * Theory syntax: the header format ``theory A = B + C:'' has been
6397 discontinued in favour of ``theory A imports B C begin''. Use isatool
6398 fixheaders to convert existing theory files. INCOMPATIBILITY.
6400 * Theory syntax: the old non-Isar theory file format has been
6401 discontinued altogether. Note that ML proof scripts may still be used
6402 with Isar theories; migration is usually quite simple with the ML
6403 function use_legacy_bindings. INCOMPATIBILITY.
6405 * Theory syntax: some popular names (e.g. 'class', 'declaration',
6406 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
6409 * Theory loader: be more serious about observing the static theory
6410 header specifications (including optional directories), but not the
6411 accidental file locations of previously successful loads. The strict
6412 update policy of former update_thy is now already performed by
6413 use_thy, so the former has been removed; use_thys updates several
6414 theories simultaneously, just as 'imports' within a theory header
6415 specification, but without merging the results. Potential
6416 INCOMPATIBILITY: may need to refine theory headers and commands
6417 ROOT.ML which depend on load order.
6419 * Theory loader: optional support for content-based file
6420 identification, instead of the traditional scheme of full physical
6421 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
6422 (cf. the system manual). The new scheme allows to work with
6423 non-finished theories in persistent session images, such that source
6424 files may be moved later on without requiring reloads.
6426 * Theory loader: old-style ML proof scripts being *attached* to a thy
6427 file (with the same base name as the theory) are considered a legacy
6428 feature, which will disappear eventually. Even now, the theory loader
6429 no longer maintains dependencies on such files.
6431 * Syntax: the scope for resolving ambiguities via type-inference is
6432 now limited to individual terms, instead of whole simultaneous
6433 specifications as before. This greatly reduces the complexity of the
6434 syntax module and improves flexibility by separating parsing and
6435 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
6436 'fixes' etc.) are required in rare situations.
6438 * Syntax: constants introduced by new-style packages ('definition',
6439 'abbreviation' etc.) are passed through the syntax module in
6440 ``authentic mode''. This means that associated mixfix annotations
6441 really stick to such constants, independently of potential name space
6442 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
6443 trees are represented slightly differently, may need to adapt syntax
6444 translations accordingly. Use CONST marker in 'translations' and
6445 @{const_syntax} antiquotation in 'parse_translation' etc.
6447 * Legacy goal package: reduced interface to the bare minimum required
6448 to keep existing proof scripts running. Most other user-level
6449 functions are now part of the OldGoals structure, which is *not* open
6450 by default (consider isatool expandshort before open OldGoals).
6451 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
6452 these tend to cause confusion about the actual goal (!) context being
6453 used here, which is not necessarily the same as the_context().
6455 * Command 'find_theorems': supports "*" wild-card in "name:"
6456 criterion; "with_dups" option. Certain ProofGeneral versions might
6457 support a specific search form (see ProofGeneral/CHANGES).
6459 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
6460 by default, which means that "prems" (and also "fixed variables") are
6461 suppressed from proof state output. Note that the ProofGeneral
6462 settings mechanism allows to change and save options persistently, but
6463 older versions of Isabelle will fail to start up if a negative prems
6466 * Local theory targets may be specified by non-nested blocks of
6467 ``context/locale/class ... begin'' followed by ``end''. The body may
6468 contain definitions, theorems etc., including any derived mechanism
6469 that has been implemented on top of these primitives. This concept
6470 generalizes the existing ``theorem (in ...)'' towards more versatility
6473 * Proof General interface: proper undo of final 'end' command;
6474 discontinued Isabelle/classic mode (ML proof scripts).
6477 *** Document preparation ***
6479 * Added antiquotation @{theory name} which prints the given name,
6480 after checking that it refers to a valid ancestor theory in the
6483 * Added antiquotations @{ML_type text} and @{ML_struct text} which
6484 check the given source text as ML type/structure, printing verbatim.
6486 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
6487 "c args == rhs" given in the current context. (Any number of
6488 arguments may be given on the LHS.)
6493 * The 'class' package offers a combination of axclass and locale to
6494 achieve Haskell-like type classes in Isabelle. Definitions and
6495 theorems within a class context produce both relative results (with
6496 implicit parameters according to the locale context), and polymorphic
6497 constants with qualified polymorphism (according to the class
6498 context). Within the body context of a 'class' target, a separate
6499 syntax layer ("user space type system") takes care of converting
6500 between global polymorphic consts and internal locale representation.
6501 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
6502 "isatool doc classes" provides a tutorial.
6504 * Generic code generator framework allows to generate executable
6505 code for ML and Haskell (including Isabelle classes). A short usage
6508 internal compilation:
6509 export_code <list of constants (term syntax)> in SML
6510 writing SML code to a file:
6511 export_code <list of constants (term syntax)> in SML <filename>
6512 writing OCaml code to a file:
6513 export_code <list of constants (term syntax)> in OCaml <filename>
6514 writing Haskell code to a bunch of files:
6515 export_code <list of constants (term syntax)> in Haskell <filename>
6517 evaluating closed propositions to True/False using code generation:
6520 Reasonable default setup of framework in HOL.
6522 Theorem attributs for selecting and transforming function equations theorems:
6524 [code fun]: select a theorem as function equation for a specific constant
6525 [code fun del]: deselect a theorem as function equation for a specific constant
6526 [code inline]: select an equation theorem for unfolding (inlining) in place
6527 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
6529 User-defined serializations (target in {SML, OCaml, Haskell}):
6531 code_const <and-list of constants (term syntax)>
6532 {(target) <and-list of const target syntax>}+
6534 code_type <and-list of type constructors>
6535 {(target) <and-list of type target syntax>}+
6537 code_instance <and-list of instances>
6539 where instance ::= <type constructor> :: <class>
6541 code_class <and_list of classes>
6542 {(target) <and-list of class target syntax>}+
6543 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
6545 code_instance and code_class only are effective to target Haskell.
6547 For example usage see src/HOL/ex/Codegenerator.thy and
6548 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
6549 generation from Isabelle/HOL theories is available via "isatool doc
6552 * Code generator: consts in 'consts_code' Isar commands are now
6553 referred to by usual term syntax (including optional type
6556 * Command 'no_translations' removes translation rules from theory
6559 * Overloaded definitions are now actually checked for acyclic
6560 dependencies. The overloading scheme is slightly more general than
6561 that of Haskell98, although Isabelle does not demand an exact
6562 correspondence to type class and instance declarations.
6563 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
6564 exotic versions of overloading -- at the discretion of the user!
6566 Polymorphic constants are represented via type arguments, i.e. the
6567 instantiation that matches an instance against the most general
6568 declaration given in the signature. For example, with the declaration
6569 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
6570 as c(nat). Overloading is essentially simultaneous structural
6571 recursion over such type arguments. Incomplete specification patterns
6572 impose global constraints on all occurrences, e.g. c('a * 'a) on the
6573 LHS means that more general c('a * 'b) will be disallowed on any RHS.
6574 Command 'print_theory' outputs the normalized system of recursive
6575 equations, see section "definitions".
6577 * Configuration options are maintained within the theory or proof
6578 context (with name and type bool/int/string), providing a very simple
6579 interface to a poor-man's version of general context data. Tools may
6580 declare options in ML (e.g. using Attrib.config_int) and then refer to
6581 these values using Config.get etc. Users may change options via an
6582 associated attribute of the same name. This form of context
6583 declaration works particularly well with commands 'declare' or
6584 'using', for example ``declare [[foo = 42]]''. Thus it has become
6585 very easy to avoid global references, which would not observe Isar
6586 toplevel undo/redo and fail to work with multithreading.
6588 Various global ML references of Pure and HOL have been turned into
6589 configuration options:
6591 Unify.search_bound unify_search_bound
6592 Unify.trace_bound unify_trace_bound
6593 Unify.trace_simp unify_trace_simp
6594 Unify.trace_types unify_trace_types
6595 Simplifier.simp_depth_limit simp_depth_limit
6596 Blast.depth_limit blast_depth_limit
6597 DatatypeProp.dtK datatype_distinctness_limit
6598 fast_arith_neq_limit fast_arith_neq_limit
6599 fast_arith_split_limit fast_arith_split_limit
6601 * Named collections of theorems may be easily installed as context
6602 data using the functor NamedThmsFun (see also
6603 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
6604 attributes; there is also a toplevel print command. This facility is
6605 just a common case of general context data, which is the preferred way
6606 for anything more complex than just a list of facts in canonical
6609 * Isar: command 'declaration' augments a local theory by generic
6610 declaration functions written in ML. This enables arbitrary content
6611 being added to the context, depending on a morphism that tells the
6612 difference of the original declaration context wrt. the application
6613 context encountered later on.
6615 * Isar: proper interfaces for simplification procedures. Command
6616 'simproc_setup' declares named simprocs (with match patterns, and body
6617 text in ML). Attribute "simproc" adds/deletes simprocs in the current
6618 context. ML antiquotation @{simproc name} retrieves named simprocs.
6620 * Isar: an extra pair of brackets around attribute declarations
6621 abbreviates a theorem reference involving an internal dummy fact,
6622 which will be ignored later --- only the effect of the attribute on
6623 the background context will persist. This form of in-place
6624 declarations is particularly useful with commands like 'declare' and
6625 'using', for example ``have A using [[simproc a]] by simp''.
6627 * Isar: method "assumption" (and implicit closing of subproofs) now
6628 takes simple non-atomic goal assumptions into account: after applying
6629 an assumption as a rule the resulting subgoals are solved by atomic
6630 assumption steps. This is particularly useful to finish 'obtain'
6631 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
6632 without referring to the original premise "!!x. P x ==> thesis" in the
6633 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
6636 * Isar: implicit use of prems from the Isar proof context is
6637 considered a legacy feature. Common applications like ``have A .''
6638 may be replaced by ``have A by fact'' or ``note `A`''. In general,
6639 referencing facts explicitly here improves readability and
6640 maintainability of proof texts.
6642 * Isar: improper proof element 'guess' is like 'obtain', but derives
6643 the obtained context from the course of reasoning! For example:
6645 assume "EX x y. A x & B y" -- "any previous fact"
6646 then guess x and y by clarify
6648 This technique is potentially adventurous, depending on the facts and
6649 proof tools being involved here.
6651 * Isar: known facts from the proof context may be specified as literal
6652 propositions, using ASCII back-quote syntax. This works wherever
6653 named facts used to be allowed so far, in proof commands, proof
6654 methods, attributes etc. Literal facts are retrieved from the context
6655 according to unification of type and term parameters. For example,
6656 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
6657 theorems in the current context, then these are valid literal facts:
6658 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
6660 There is also a proof method "fact" which does the same composition
6661 for explicit goal states, e.g. the following proof texts coincide with
6662 certain special cases of literal facts:
6664 have "A" by fact == note `A`
6665 have "A ==> B" by fact == note `A ==> B`
6666 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
6667 have "P a ==> Q a" by fact == note `P a ==> Q a`
6669 * Isar: ":" (colon) is no longer a symbolic identifier character in
6670 outer syntax. Thus symbolic identifiers may be used without
6671 additional white space in declarations like this: ``assume *: A''.
6673 * Isar: 'print_facts' prints all local facts of the current context,
6674 both named and unnamed ones.
6676 * Isar: 'def' now admits simultaneous definitions, e.g.:
6678 def x == "t" and y == "u"
6680 * Isar: added command 'unfolding', which is structurally similar to
6681 'using', but affects both the goal state and facts by unfolding given
6682 rewrite rules. Thus many occurrences of the 'unfold' method or
6683 'unfolded' attribute may be replaced by first-class proof text.
6685 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
6686 and command 'unfolding' now all support object-level equalities
6687 (potentially conditional). The underlying notion of rewrite rule is
6688 analogous to the 'rule_format' attribute, but *not* that of the
6689 Simplifier (which is usually more generous).
6691 * Isar: the new attribute [rotated n] (default n = 1) rotates the
6692 premises of a theorem by n. Useful in conjunction with drule.
6694 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
6695 method expression within a sandbox consisting of the first N
6696 sub-goals, which need to exist. For example, ``simp_all [3]''
6697 simplifies the first three sub-goals, while (rule foo, simp_all)[]
6698 simplifies all new goals that emerge from applying rule foo to the
6699 originally first one.
6701 * Isar: schematic goals are no longer restricted to higher-order
6702 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
6705 * Isar: the conclusion of a long theorem statement is now either
6706 'shows' (a simultaneous conjunction, as before), or 'obtains'
6707 (essentially a disjunction of cases with local parameters and
6708 assumptions). The latter allows to express general elimination rules
6709 adequately; in this notation common elimination rules look like this:
6711 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
6713 obtains x where "P x"
6715 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
6719 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
6725 The subsequent classical rules even refer to the formal "thesis"
6728 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
6731 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
6732 obtains "thesis ==> something"
6734 The actual proof of an 'obtains' statement is analogous to that of the
6735 Isar proof element 'obtain', only that there may be several cases.
6736 Optional case names may be specified in parentheses; these will be
6737 available both in the present proof and as annotations in the
6738 resulting rule, for later use with the 'cases' method (cf. attribute
6741 * Isar: the assumptions of a long theorem statement are available as
6742 "assms" fact in the proof context. This is more appropriate than the
6743 (historical) "prems", which refers to all assumptions of the current
6744 context, including those from the target locale, proof body etc.
6746 * Isar: 'print_statement' prints theorems from the current theory or
6747 proof context in long statement form, according to the syntax of a
6750 * Isar: 'obtain' takes an optional case name for the local context
6751 introduction rule (default "that").
6753 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
6754 explicit (is "_ ==> ?foo") in the rare cases where this still happens
6757 * Pure: syntax "CONST name" produces a fully internalized constant
6758 according to the current context. This is particularly useful for
6759 syntax translations that should refer to internal constant
6760 representations independently of name spaces.
6762 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
6763 instead of "FOO ". This allows multiple binder declarations to coexist
6764 in the same context. INCOMPATIBILITY.
6766 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
6767 primitive that also works in a locale context (both for constants and
6768 fixed variables). Type declaration and internal syntactic representation
6769 of given constants retrieved from the context. Likewise, the
6770 'no_notation' command allows to remove given syntax annotations from the
6773 * Isar/locales: new derived specification elements 'axiomatization',
6774 'definition', 'abbreviation', which support type-inference, admit
6775 object-level specifications (equality, equivalence). See also the
6776 isar-ref manual. Examples:
6779 eq (infix "===" 50) where
6780 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
6782 definition "f x y = x + y + 1"
6783 definition g where "g x = f x x"
6786 neq (infix "=!=" 50) where
6787 "x =!= y == ~ (x === y)"
6789 These specifications may be also used in a locale context. Then the
6790 constants being introduced depend on certain fixed parameters, and the
6791 constant name is qualified by the locale base name. An internal
6792 abbreviation takes care for convenient input and output, making the
6793 parameters implicit and using the original short name. See also
6794 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
6795 entities from a monomorphic theory.
6797 Presently, abbreviations are only available 'in' a target locale, but
6798 not inherited by general import expressions. Also note that
6799 'abbreviation' may be used as a type-safe replacement for 'syntax' +
6800 'translations' in common applications. The "no_abbrevs" print mode
6801 prevents folding of abbreviations in term output.
6803 Concrete syntax is attached to specified constants in internal form,
6804 independently of name spaces. The parse tree representation is
6805 slightly different -- use 'notation' instead of raw 'syntax', and
6806 'translations' with explicit "CONST" markup to accommodate this.
6808 * Pure/Isar: unified syntax for new-style specification mechanisms
6809 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
6810 full type inference and dummy patterns ("_"). For example:
6812 definition "K x _ = x"
6814 inductive conj for A B
6815 where "A ==> B ==> conj A B"
6817 * Pure: command 'print_abbrevs' prints all constant abbreviations of
6818 the current context. Print mode "no_abbrevs" prevents inversion of
6819 abbreviations on output.
6821 * Isar/locales: improved parameter handling: use of locales "var" and
6822 "struct" no longer necessary; - parameter renamings are no longer
6823 required to be injective. For example, this allows to define
6824 endomorphisms as locale endom = homom mult mult h.
6826 * Isar/locales: changed the way locales with predicates are defined.
6827 Instead of accumulating the specification, the imported expression is
6828 now an interpretation. INCOMPATIBILITY: different normal form of
6829 locale expressions. In particular, in interpretations of locales with
6830 predicates, goals repesenting already interpreted fragments are not
6831 removed automatically. Use methods `intro_locales' and
6832 `unfold_locales'; see below.
6834 * Isar/locales: new methods `intro_locales' and `unfold_locales'
6835 provide backward reasoning on locales predicates. The methods are
6836 aware of interpretations and discharge corresponding goals.
6837 `intro_locales' is less aggressive then `unfold_locales' and does not
6838 unfold predicates to assumptions.
6840 * Isar/locales: the order in which locale fragments are accumulated
6841 has changed. This enables to override declarations from fragments due
6842 to interpretations -- for example, unwanted simp rules.
6844 * Isar/locales: interpretation in theories and proof contexts has been
6845 extended. One may now specify (and prove) equations, which are
6846 unfolded in interpreted theorems. This is useful for replacing
6847 defined concepts (constants depending on locale parameters) by
6848 concepts already existing in the target context. Example:
6850 interpretation partial_order ["op <= :: [int, int] => bool"]
6851 where "partial_order.less (op <=) (x::int) y = (x < y)"
6853 Typically, the constant `partial_order.less' is created by a
6854 definition specification element in the context of locale
6857 * Method "induct": improved internal context management to support
6858 local fixes and defines on-the-fly. Thus explicit meta-level
6859 connectives !! and ==> are rarely required anymore in inductive goals
6860 (using object-logic connectives for this purpose has been long
6861 obsolete anyway). Common proof patterns are explained in
6862 src/HOL/Induct/Common_Patterns.thy, see also
6863 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
6866 * Method "induct": improved handling of simultaneous goals. Instead of
6867 introducing object-level conjunction, the statement is now split into
6868 several conclusions, while the corresponding symbolic cases are nested
6869 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
6870 see src/HOL/Induct/Common_Patterns.thy, for example.
6872 * Method "induct": mutual induction rules are now specified as a list
6873 of rule sharing the same induction cases. HOL packages usually provide
6874 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
6875 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
6876 mutual induction rules differently, i.e. like this:
6878 (induct rule: foo_bar.inducts)
6879 (induct set: foo bar)
6880 (induct pred: foo bar)
6881 (induct type: foo bar)
6883 The ML function ProjectRule.projections turns old-style rules into the
6886 * Method "coinduct": dual of induction, see
6887 src/HOL/Library/Coinductive_List.thy for various examples.
6889 * Method "cases", "induct", "coinduct": the ``(open)'' option is
6890 considered a legacy feature.
6892 * Attribute "symmetric" produces result with standardized schematic
6893 variables (index 0). Potential INCOMPATIBILITY.
6895 * Simplifier: by default the simplifier trace only shows top level
6896 rewrites now. That is, trace_simp_depth_limit is set to 1 by
6897 default. Thus there is less danger of being flooded by the trace. The
6898 trace indicates where parts have been suppressed.
6900 * Provers/classical: removed obsolete classical version of elim_format
6901 attribute; classical elim/dest rules are now treated uniformly when
6902 manipulating the claset.
6904 * Provers/classical: stricter checks to ensure that supplied intro,
6905 dest and elim rules are well-formed; dest and elim rules must have at
6908 * Provers/classical: attributes dest/elim/intro take an optional
6909 weight argument for the rule (just as the Pure versions). Weights are
6910 ignored by automated tools, but determine the search order of single
6913 * Syntax: input syntax now supports dummy variable binding "%_. b",
6914 where the body does not mention the bound variable. Note that dummy
6915 patterns implicitly depend on their context of bounds, which makes
6916 "{_. _}" match any set comprehension as expected. Potential
6917 INCOMPATIBILITY -- parse translations need to cope with syntactic
6918 constant "_idtdummy" in the binding position.
6920 * Syntax: removed obsolete syntactic constant "_K" and its associated
6921 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
6922 for example "A -> B" => "Pi A (%_. B)".
6924 * Pure: 'class_deps' command visualizes the subclass relation, using
6925 the graph browser tool.
6927 * Pure: 'print_theory' now suppresses certain internal declarations by
6928 default; use '!' option for full details.
6933 * Method "metis" proves goals by applying the Metis general-purpose
6934 resolution prover (see also http://gilith.com/software/metis/).
6935 Examples are in the directory MetisExamples. WARNING: the
6936 Isabelle/HOL-Metis integration does not yet work properly with
6939 * Command 'sledgehammer' invokes external automatic theorem provers as
6940 background processes. It generates calls to the "metis" method if
6941 successful. These can be pasted into the proof. Users do not have to
6942 wait for the automatic provers to return. WARNING: does not really
6943 work with multi-threading.
6945 * New "auto_quickcheck" feature tests outermost goal statements for
6946 potential counter-examples. Controlled by ML references
6947 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
6948 5000 milliseconds). Fails silently if statements is outside of
6949 executable fragment, or any other codgenerator problem occurs.
6951 * New constant "undefined" with axiom "undefined x = undefined".
6953 * Added class "HOL.eq", allowing for code generation with polymorphic
6956 * Some renaming of class constants due to canonical name prefixing in
6957 the new 'class' package:
6959 HOL.abs ~> HOL.abs_class.abs
6960 HOL.divide ~> HOL.divide_class.divide
6961 0 ~> HOL.zero_class.zero
6962 1 ~> HOL.one_class.one
6963 op + ~> HOL.plus_class.plus
6964 op - ~> HOL.minus_class.minus
6965 uminus ~> HOL.minus_class.uminus
6966 op * ~> HOL.times_class.times
6967 op < ~> HOL.ord_class.less
6968 op <= > HOL.ord_class.less_eq
6969 Nat.power ~> Power.power_class.power
6970 Nat.size ~> Nat.size_class.size
6971 Numeral.number_of ~> Numeral.number_class.number_of
6972 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
6973 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
6974 Orderings.min ~> Orderings.ord_class.min
6975 Orderings.max ~> Orderings.ord_class.max
6976 Divides.op div ~> Divides.div_class.div
6977 Divides.op mod ~> Divides.div_class.mod
6978 Divides.op dvd ~> Divides.div_class.dvd
6980 INCOMPATIBILITY. Adaptions may be required in the following cases:
6982 a) User-defined constants using any of the names "plus", "minus",
6983 "times", "less" or "less_eq". The standard syntax translations for
6984 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
6987 b) Variables named "plus", "minus", "times", "less", "less_eq"
6988 INCOMPATIBILITY: use more specific names.
6990 c) Permutative equations (e.g. "a + b = b + a")
6991 Since the change of names also changes the order of terms, permutative
6992 rewrite rules may get applied in a different order. Experience shows
6993 that this is rarely the case (only two adaptions in the whole Isabelle
6994 distribution). INCOMPATIBILITY: rewrite proofs
6996 d) ML code directly refering to constant names
6997 This in general only affects hand-written proof tactics, simprocs and
6998 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
6999 Consider using @{const_name} antiquotation.
7001 * New class "default" with associated constant "default".
7003 * Function "sgn" is now overloaded and available on int, real, complex
7004 (and other numeric types), using class "sgn". Two possible defs of
7005 sgn are given as equational assumptions in the classes sgn_if and
7006 sgn_div_norm; ordered_idom now also inherits from sgn_if.
7009 * Locale "partial_order" now unified with class "order" (cf. theory
7010 Orderings), added parameter "less". INCOMPATIBILITY.
7012 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
7013 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
7014 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
7016 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
7017 changed order of proof goals in instance proofs.
7019 * The transitivity reasoner for partial and linear orders is set up
7020 for classes "order" and "linorder". Instances of the reasoner are available
7021 in all contexts importing or interpreting the corresponding locales.
7022 Method "order" invokes the reasoner separately; the reasoner
7023 is also integrated with the Simplifier as a solver. Diagnostic
7024 command 'print_orders' shows the available instances of the reasoner
7025 in the current context.
7027 * Localized monotonicity predicate in theory "Orderings"; integrated
7028 lemmas max_of_mono and min_of_mono with this predicate.
7031 * Formulation of theorem "dense" changed slightly due to integration
7032 with new class dense_linear_order.
7034 * Uniform lattice theory development in HOL.
7036 constants "meet" and "join" now named "inf" and "sup"
7037 constant "Meet" now named "Inf"
7039 classes "meet_semilorder" and "join_semilorder" now named
7040 "lower_semilattice" and "upper_semilattice"
7041 class "lorder" now named "lattice"
7042 class "comp_lat" now named "complete_lattice"
7044 Instantiation of lattice classes allows explicit definitions
7045 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
7047 INCOMPATIBILITY. Theorem renames:
7049 meet_left_le ~> inf_le1
7050 meet_right_le ~> inf_le2
7051 join_left_le ~> sup_ge1
7052 join_right_le ~> sup_ge2
7053 meet_join_le ~> inf_sup_ord
7056 le_meet ~> le_inf_iff
7057 le_join ~> ge_sup_conv
7058 meet_idempotent ~> inf_idem
7059 join_idempotent ~> sup_idem
7060 meet_comm ~> inf_commute
7061 join_comm ~> sup_commute
7062 meet_leI1 ~> le_infI1
7063 meet_leI2 ~> le_infI2
7064 le_joinI1 ~> le_supI1
7065 le_joinI2 ~> le_supI2
7066 meet_assoc ~> inf_assoc
7067 join_assoc ~> sup_assoc
7068 meet_left_comm ~> inf_left_commute
7069 meet_left_idempotent ~> inf_left_idem
7070 join_left_comm ~> sup_left_commute
7071 join_left_idempotent ~> sup_left_idem
7074 le_def_meet ~> le_iff_inf
7075 le_def_join ~> le_iff_sup
7076 join_absorp2 ~> sup_absorb2
7077 join_absorp1 ~> sup_absorb1
7078 meet_absorp1 ~> inf_absorb1
7079 meet_absorp2 ~> inf_absorb2
7080 meet_join_absorp ~> inf_sup_absorb
7081 join_meet_absorp ~> sup_inf_absorb
7082 distrib_join_le ~> distrib_sup_le
7083 distrib_meet_le ~> distrib_inf_le
7085 add_meet_distrib_left ~> add_inf_distrib_left
7086 add_join_distrib_left ~> add_sup_distrib_left
7087 is_join_neg_meet ~> is_join_neg_inf
7088 is_meet_neg_join ~> is_meet_neg_sup
7089 add_meet_distrib_right ~> add_inf_distrib_right
7090 add_join_distrib_right ~> add_sup_distrib_right
7091 add_meet_join_distribs ~> add_sup_inf_distribs
7092 join_eq_neg_meet ~> sup_eq_neg_inf
7093 meet_eq_neg_join ~> inf_eq_neg_sup
7094 add_eq_meet_join ~> add_eq_inf_sup
7095 meet_0_imp_0 ~> inf_0_imp_0
7096 join_0_imp_0 ~> sup_0_imp_0
7097 meet_0_eq_0 ~> inf_0_eq_0
7098 join_0_eq_0 ~> sup_0_eq_0
7099 neg_meet_eq_join ~> neg_inf_eq_sup
7100 neg_join_eq_meet ~> neg_sup_eq_inf
7101 join_eq_if ~> sup_eq_if
7103 mono_meet ~> mono_inf
7104 mono_join ~> mono_sup
7105 meet_bool_eq ~> inf_bool_eq
7106 join_bool_eq ~> sup_bool_eq
7107 meet_fun_eq ~> inf_fun_eq
7108 join_fun_eq ~> sup_fun_eq
7109 meet_set_eq ~> inf_set_eq
7110 join_set_eq ~> sup_set_eq
7111 meet1_iff ~> inf1_iff
7112 meet2_iff ~> inf2_iff
7121 join1_iff ~> sup1_iff
7122 join2_iff ~> sup2_iff
7132 is_meet_Meet ~> is_meet_Inf
7133 Meet_bool_def ~> Inf_bool_def
7134 Meet_fun_def ~> Inf_fun_def
7135 Meet_greatest ~> Inf_greatest
7136 Meet_lower ~> Inf_lower
7137 Meet_set_def ~> Inf_set_def
7140 Sup_bool_eq ~> Sup_bool_def
7141 Sup_fun_eq ~> Sup_fun_def
7142 Sup_set_eq ~> Sup_set_def
7144 listsp_meetI ~> listsp_infI
7145 listsp_meet_eq ~> listsp_inf_eq
7150 * Added syntactic class "size"; overloaded constant "size" now has
7151 type "'a::size ==> bool"
7153 * Internal reorganisation of `size' of datatypes: size theorems
7154 "foo.size" are no longer subsumed by "foo.simps" (but are still
7155 simplification rules by default!); theorems "prod.size" now named
7158 * Class "div" now inherits from class "times" rather than "type".
7161 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
7162 Linorder etc. have disappeared; operations defined in terms of
7163 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
7165 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
7167 * HOL-Word: New extensive library and type for generic, fixed size
7168 machine words, with arithmetic, bit-wise, shifting and rotating
7169 operations, reflection into int, nat, and bool lists, automation for
7170 linear arithmetic (by automatic reflection into nat or int), including
7171 lemmas on overflow and monotonicity. Instantiated to all appropriate
7172 arithmetic type classes, supporting automatic simplification of
7173 numerals on all operations.
7175 * Library/Boolean_Algebra: locales for abstract boolean algebras.
7177 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
7179 * Code generator library theories:
7180 - Code_Integer represents HOL integers by big integer literals in target
7182 - Code_Char represents HOL characters by character literals in target
7184 - Code_Char_chr like Code_Char, but also offers treatment of character
7185 codes; includes Code_Integer.
7186 - Executable_Set allows to generate code for finite sets using lists.
7187 - Executable_Rat implements rational numbers as triples (sign, enumerator,
7189 - Executable_Real implements a subset of real numbers, namly those
7190 representable by rational numbers.
7191 - Efficient_Nat implements natural numbers by integers, which in general will
7192 result in higher efficency; pattern matching with 0/Suc is eliminated;
7193 includes Code_Integer.
7194 - Code_Index provides an additional datatype index which is mapped to
7195 target-language built-in integers.
7196 - Code_Message provides an additional datatype message_string which is isomorphic to
7197 strings; messages are mapped to target-language strings.
7199 * New package for inductive predicates
7201 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
7204 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7205 for z_1 :: U_1 and ... and z_n :: U_m
7207 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7210 with full support for type-inference, rather than
7212 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7214 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7215 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7217 inductive "s z_1 ... z_m"
7219 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7222 For backward compatibility, there is a wrapper allowing inductive
7223 sets to be defined with the new package via
7226 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7227 for z_1 :: U_1 and ... and z_n :: U_m
7229 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7235 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7236 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7237 for z_1 :: U_1 and ... and z_n :: U_m
7239 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7240 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7243 if the additional syntax "p ..." is required.
7245 Numerous examples can be found in the subdirectories src/HOL/Auth,
7246 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
7250 - Since declaration and definition of inductive sets or predicates
7251 is no longer separated, abbreviations involving the newly
7252 introduced sets or predicates must be specified together with the
7253 introduction rules after the 'where' keyword (see above), rather
7254 than before the actual inductive definition.
7256 - The variables in induction and elimination rules are now
7257 quantified in the order of their occurrence in the introduction
7258 rules, rather than in alphabetical order. Since this may break
7259 some proofs, these proofs either have to be repaired, e.g. by
7260 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
7261 statements of the form
7263 case (rule_i a_i_1 ... a_i_{k_i})
7265 or the old order of quantification has to be restored by explicitly adding
7266 meta-level quantifiers in the introduction rules, i.e.
7268 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
7270 - The format of the elimination rules is now
7272 p z_1 ... z_m x_1 ... x_n ==>
7273 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7278 (x_1, ..., x_n) : s z_1 ... z_m ==>
7279 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7282 for sets rather than
7284 x : s z_1 ... z_m ==>
7285 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
7288 This may require terms in goals to be expanded to n-tuples
7289 (e.g. using case_tac or simplification with the split_paired_all
7290 rule) before the above elimination rule is applicable.
7292 - The elimination or case analysis rules for (mutually) inductive
7293 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
7294 list of rules "p_1_..._p_k.elims" is no longer available.
7296 * New package "function"/"fun" for general recursive functions,
7297 supporting mutual and nested recursion, definitions in local contexts,
7298 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
7299 for small examples, and the separate tutorial on the function
7300 package. The old recdef "package" is still available as before, but
7301 users are encouraged to use the new package.
7303 * Method "lexicographic_order" automatically synthesizes termination
7304 relations as lexicographic combinations of size measures.
7306 * Case-expressions allow arbitrary constructor-patterns (including
7307 "_") and take their order into account, like in functional
7308 programming. Internally, this is translated into nested
7309 case-expressions; missing cases are added and mapped to the predefined
7310 constant "undefined". In complicated cases printing may no longer show
7311 the original input but the internal form. Lambda-abstractions allow
7312 the same form of pattern matching: "% pat1 => e1 | ..." is an
7313 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
7316 * IntDef: The constant "int :: nat => int" has been removed; now "int"
7317 is an abbreviation for "of_nat :: nat => int". The simplification
7318 rules for "of_nat" have been changed to work like "int" did
7319 previously. Potential INCOMPATIBILITY:
7320 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
7321 - of_nat_diff and of_nat_mult are no longer default simp rules
7323 * Method "algebra" solves polynomial equations over (semi)rings using
7324 Groebner bases. The (semi)ring structure is defined by locales and the
7325 tool setup depends on that generic context. Installing the method for
7326 a specific type involves instantiating the locale and possibly adding
7327 declarations for computation on the coefficients. The method is
7328 already instantiated for natural numbers and for the axiomatic class
7329 of idoms with numerals. See also the paper by Chaieb and Wenzel at
7330 CALCULEMUS 2007 for the general principles underlying this
7331 architecture of context-aware proof-tools.
7333 * Method "ferrack" implements quantifier elimination over
7334 special-purpose dense linear orders using locales (analogous to
7335 "algebra"). The method is already installed for class
7336 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
7339 * Former constant "List.op @" now named "List.append". Use ML
7340 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
7341 circumvent possible incompatibilities when working on ML level.
7343 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
7345 * New function listsum :: 'a list => 'a for arbitrary monoids.
7346 Special syntax: "SUM x <- xs. f x" (and latex variants)
7348 * New syntax for Haskell-like list comprehension (input only), eg.
7349 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
7351 * The special syntax for function "filter" has changed from [x :
7352 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
7353 comprehension syntax, and for uniformity. INCOMPATIBILITY.
7355 * [a..b] is now defined for arbitrary linear orders. It used to be
7356 defined on nat only, as an abbreviation for [a..<Suc b]
7359 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
7361 * New functions "sorted" and "sort" in src/HOL/List.thy.
7363 * New lemma collection field_simps (an extension of ring_simps) for
7364 manipulating (in)equations involving division. Multiplies with all
7365 denominators that can be proved to be non-zero (in equations) or
7366 positive/negative (in inequations).
7368 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
7369 have been improved and renamed to ring_simps, group_simps and
7370 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
7371 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
7373 * Theory Library/Commutative_Ring: switched from recdef to function
7374 package; constants add, mul, pow now curried. Infix syntax for
7375 algebraic operations.
7377 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
7380 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
7383 * HOL/records: generalised field-update to take a function on the
7384 field rather than the new value: r(|A := x|) is translated to A_update
7385 (K x) r The K-combinator that is internally used is called K_record.
7386 INCOMPATIBILITY: Usage of the plain update functions has to be
7389 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
7390 * x = 0, which are required for a semiring. Richer structures do not
7391 inherit from semiring_0 anymore, because this property is a theorem
7392 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
7393 there is more to prove, but this is mostly trivial.
7395 * Class "recpower" is generalized to arbitrary monoids, not just
7396 commutative semirings. INCOMPATIBILITY: may need to incorporate
7397 commutativity or semiring properties additionally.
7399 * Constant "List.list_all2" in List.thy now uses authentic syntax.
7400 INCOMPATIBILITY: translations containing list_all2 may go wrong,
7401 better use 'abbreviation'.
7403 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
7405 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
7406 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
7407 significant changes for setting up numeral syntax for types:
7408 - New constants Numeral.pred and Numeral.succ instead
7409 of former Numeral.bin_pred and Numeral.bin_succ.
7410 - Use integer operations instead of bin_add, bin_mult and so on.
7411 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
7412 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
7414 See src/HOL/Integ/IntArith.thy for an example setup.
7416 * Command 'normal_form' computes the normal form of a term that may
7417 contain free variables. For example ``normal_form "rev [a, b, c]"''
7418 produces ``[b, c, a]'' (without proof). This command is suitable for
7419 heavy-duty computations because the functions are compiled to ML
7420 first. Correspondingly, a method "normalization" is provided. See
7421 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
7423 * Alternative iff syntax "A <-> B" for equality on bool (with priority
7424 25 like -->); output depends on the "iff" print_mode, the default is
7425 "A = B" (with priority 50).
7427 * Relations less (<) and less_eq (<=) are also available on type bool.
7428 Modified syntax to disallow nesting without explicit parentheses,
7429 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
7432 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
7434 * Relation composition operator "op O" now has precedence 75 and binds
7435 stronger than union and intersection. INCOMPATIBILITY.
7437 * The old set interval syntax "{m..n(}" (and relatives) has been
7438 removed. Use "{m..<n}" (and relatives) instead.
7440 * In the context of the assumption "~(s = t)" the Simplifier rewrites
7441 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
7442 ``declare [[simproc del: neq]]''.
7444 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
7447 * Theorem Cons_eq_map_conv no longer declared as "simp".
7449 * Theorem setsum_mult renamed to setsum_right_distrib.
7451 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
7454 * Reimplemented methods "sat" and "satx", with several improvements:
7455 goals no longer need to be stated as "<prems> ==> False", equivalences
7456 (i.e. "=" on type bool) are handled, variable names of the form
7457 "lit_<n>" are no longer reserved, significant speedup.
7459 * Methods "sat" and "satx" can now replay MiniSat proof traces.
7460 zChaff is still supported as well.
7462 * 'inductive' and 'datatype': provide projections of mutual rules,
7463 bundled as foo_bar.inducts;
7465 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
7468 * Library: moved theory Accessible_Part to main HOL.
7470 * Library: added theory Coinductive_List of potentially infinite lists
7471 as greatest fixed-point.
7473 * Library: added theory AssocList which implements (finite) maps as
7476 * Method "evaluation" solves goals (i.e. a boolean expression)
7477 efficiently by compiling it to ML. The goal is "proved" (via an
7478 oracle) if it evaluates to True.
7480 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
7481 also when invoked by the simplifier. This results in the Simplifier
7482 being more powerful on arithmetic goals. INCOMPATIBILITY.
7483 Configuration option fast_arith_split_limit=0 recovers the old
7486 * Support for hex (0x20) and binary (0b1001) numerals.
7488 * New method: reify eqs (t), where eqs are equations for an
7489 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
7490 parameter, computes a term s::'b and a list xs::'a list and proves the
7491 theorem I xs s = t. This is also known as reification or quoting. The
7492 resulting theorem is applied to the subgoal to substitute t with I xs
7493 s. If t is omitted, the subgoal itself is reified.
7495 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
7496 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
7497 where f is supposed to be a computable function (in the sense of code
7498 generattion). The method uses reify to compute s and xs as above then
7499 applies corr_thm and uses normalization by evaluation to "prove" f s =
7500 r and finally gets the theorem t = r, which is again applied to the
7501 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
7503 * Reflection: Automatic reification now handels binding, an example is
7504 available in src/HOL/ex/ReflectionEx.thy
7506 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
7507 command 'statespace' that is similar to 'record', but introduces an
7508 abstract specification based on the locale infrastructure instead of
7509 HOL types. This leads to extra flexibility in composing state spaces,
7510 in particular multiple inheritance and renaming of components.
7515 * Hyperreal: Functions root and sqrt are now defined on negative real
7516 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
7517 Nonnegativity side conditions have been removed from many lemmas, so
7518 that more subgoals may now be solved by simplification; potential
7521 * Real: new type classes formalize real normed vector spaces and
7522 algebras, using new overloaded constants scaleR :: real => 'a => 'a
7523 and norm :: 'a => real.
7525 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
7526 reals into other types. The overloaded constant Reals :: 'a set is now
7527 defined as range of_real; potential INCOMPATIBILITY.
7529 * Real: proper support for ML code generation, including 'quickcheck'.
7530 Reals are implemented as arbitrary precision rationals.
7532 * Hyperreal: Several constants that previously worked only for the
7533 reals have been generalized, so they now work over arbitrary vector
7534 spaces. Type annotations may need to be added in some cases; potential
7537 Infinitesimal :: ('a::real_normed_vector) star set
7538 HFinite :: ('a::real_normed_vector) star set
7539 HInfinite :: ('a::real_normed_vector) star set
7540 approx :: ('a::real_normed_vector) star => 'a star => bool
7541 monad :: ('a::real_normed_vector) star => 'a star set
7542 galaxy :: ('a::real_normed_vector) star => 'a star set
7543 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
7544 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
7545 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
7546 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
7547 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
7548 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
7549 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
7550 sgn :: 'a::real_normed_vector => 'a
7551 exp :: 'a::{recpower,real_normed_field,banach} => 'a
7553 * Complex: Some complex-specific constants are now abbreviations for
7554 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
7555 hnorm. Other constants have been entirely removed in favor of the
7556 polymorphic versions (INCOMPATIBILITY):
7560 HInfinite <-- CInfinite
7561 Infinitesimal <-- CInfinitesimal
7564 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
7565 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
7566 (ns)deriv <-- (ns)cderiv
7571 * Formalisation of ideals and the quotient construction over rings.
7573 * Order and lattice theory no longer based on records.
7576 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
7577 greatest_closed. INCOMPATIBILITY.
7579 * Method algebra is now set up via an attribute. For examples see
7580 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
7581 of algebraic structures.
7583 * Renamed theory CRing to Ring.
7588 * Substantial, yet incomplete support for nominal datatypes (binding
7589 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
7590 src/HOL/Nominal/Examples. Prospective users should consult
7591 http://isabelle.in.tum.de/nominal/
7596 * ML basics: just one true type int, which coincides with IntInf.int
7599 * ML within Isar: antiquotations allow to embed statically-checked
7600 formal entities in the source, referring to the context available at
7601 compile-time. For example:
7603 ML {* @{sort "{zero,one}"} *}
7604 ML {* @{typ "'a => 'b"} *}
7605 ML {* @{term "%x. x"} *}
7606 ML {* @{prop "x == y"} *}
7607 ML {* @{ctyp "'a => 'b"} *}
7608 ML {* @{cterm "%x. x"} *}
7609 ML {* @{cprop "x == y"} *}
7610 ML {* @{thm asm_rl} *}
7611 ML {* @{thms asm_rl} *}
7612 ML {* @{type_name c} *}
7613 ML {* @{type_syntax c} *}
7614 ML {* @{const_name c} *}
7615 ML {* @{const_syntax c} *}
7618 ML {* @{theory Pure} *}
7619 ML {* @{theory_ref} *}
7620 ML {* @{theory_ref Pure} *}
7623 ML {* @{clasimpset} *}
7625 The same works for sources being ``used'' within an Isar context.
7627 * ML in Isar: improved error reporting; extra verbosity with
7628 ML_Context.trace enabled.
7630 * Pure/General/table.ML: the join operations now works via exceptions
7631 DUP/SAME instead of type option. This is simpler in simple cases, and
7632 admits slightly more efficient complex applications.
7634 * Pure: 'advanced' translation functions (parse_translation etc.) now
7635 use Context.generic instead of just theory.
7637 * Pure: datatype Context.generic joins theory/Proof.context and
7638 provides some facilities for code that works in either kind of
7639 context, notably GenericDataFun for uniform theory and proof data.
7641 * Pure: simplified internal attribute type, which is now always
7642 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
7643 local (Proof.context) attributes have been discontinued, while
7644 minimizing code duplication. Thm.rule_attribute and
7645 Thm.declaration_attribute build canonical attributes; see also structure
7646 Context for further operations on Context.generic, notably
7647 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
7648 declarations and definitions.
7650 * Context data interfaces (Theory/Proof/GenericDataFun): removed
7651 name/print, uninitialized data defaults to ad-hoc copy of empty value,
7652 init only required for impure data. INCOMPATIBILITY: empty really need
7653 to be empty (no dependencies on theory content!)
7655 * Pure/kernel: consts certification ignores sort constraints given in
7656 signature declarations. (This information is not relevant to the
7657 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
7658 potential INCOMPATIBILITY.
7660 * Pure: axiomatic type classes are now purely definitional, with
7661 explicit proofs of class axioms and super class relations performed
7662 internally. See Pure/axclass.ML for the main internal interfaces --
7663 notably AxClass.define_class supercedes AxClass.add_axclass, and
7664 AxClass.axiomatize_class/classrel/arity supersede
7665 Sign.add_classes/classrel/arities.
7667 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
7668 global/local versions on theory vs. Proof.context have been
7669 discontinued; Attrib.syntax and Method.syntax have been adapted
7670 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
7671 attributes, methods, etc.
7673 * Pure: several functions of signature "... -> theory -> theory * ..."
7674 have been reoriented to "... -> theory -> ... * theory" in order to
7675 allow natural usage in combination with the ||>, ||>>, |-> and
7676 fold_map combinators.
7678 * Pure: official theorem names (closed derivations) and additional
7679 comments (tags) are now strictly separate. Name hints -- which are
7680 maintained as tags -- may be attached any time without affecting the
7683 * Pure: primitive rule lift_rule now takes goal cterm instead of an
7684 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
7685 achieve the old behaviour.
7687 * Pure: the "Goal" constant is now called "prop", supporting a
7688 slightly more general idea of ``protecting'' meta-level rule
7691 * Pure: Logic.(un)varify only works in a global context, which is now
7692 enforced instead of silently assumed. INCOMPATIBILITY, may use
7693 Logic.legacy_(un)varify as temporary workaround.
7695 * Pure: structure Name provides scalable operations for generating
7696 internal variable names, notably Name.variants etc. This replaces
7697 some popular functions from term.ML:
7699 Term.variant -> Name.variant
7700 Term.variantlist -> Name.variant_list
7701 Term.invent_names -> Name.invent_list
7703 Note that low-level renaming rarely occurs in new code -- operations
7704 from structure Variable are used instead (see below).
7706 * Pure: structure Variable provides fundamental operations for proper
7707 treatment of fixed/schematic variables in a context. For example,
7708 Variable.import introduces fixes for schematics of given facts and
7709 Variable.export reverses the effect (up to renaming) -- this replaces
7710 various freeze_thaw operations.
7712 * Pure: structure Goal provides simple interfaces for
7713 init/conclude/finish and tactical prove operations (replacing former
7714 Tactic.prove). Goal.prove is the canonical way to prove results
7715 within a given context; Goal.prove_global is a degraded version for
7716 theory level goals, including a global Drule.standard. Note that
7717 OldGoals.prove_goalw_cterm has long been obsolete, since it is
7718 ill-behaved in a local proof context (e.g. with local fixes/assumes or
7719 in a locale context).
7721 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
7722 and type checking (Syntax.check_term etc.), with common combinations
7723 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
7724 which are considered legacy and await removal.
7726 * Pure/Syntax: generic interfaces for type unchecking
7727 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
7728 with common combinations (Syntax.pretty_term, Syntax.string_of_term
7729 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
7730 available for convenience, but refer to the very same operations using
7731 a mere theory instead of a full context.
7733 * Isar: simplified treatment of user-level errors, using exception
7734 ERROR of string uniformly. Function error now merely raises ERROR,
7735 without any side effect on output channels. The Isar toplevel takes
7736 care of proper display of ERROR exceptions. ML code may use plain
7737 handle/can/try; cat_error may be used to concatenate errors like this:
7739 ... handle ERROR msg => cat_error msg "..."
7741 Toplevel ML code (run directly or through the Isar toplevel) may be
7742 embedded into the Isar toplevel with exception display/debug like
7745 Isar.toplevel (fn () => ...)
7747 INCOMPATIBILITY, removed special transform_error facilities, removed
7748 obsolete variants of user-level exceptions (ERROR_MESSAGE,
7749 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
7750 -- use plain ERROR instead.
7752 * Isar: theory setup now has type (theory -> theory), instead of a
7753 list. INCOMPATIBILITY, may use #> to compose setup functions.
7755 * Isar: ML toplevel pretty printer for type Proof.context, subject to
7756 ProofContext.debug/verbose flags.
7758 * Isar: Toplevel.theory_to_proof admits transactions that modify the
7759 theory before entering a proof state. Transactions now always see a
7760 quasi-functional intermediate checkpoint, both in interactive and
7763 * Isar: simplified interfaces for outer syntax. Renamed
7764 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
7765 OuterSyntax.add_parsers -- this functionality is now included in
7766 OuterSyntax.command etc. INCOMPATIBILITY.
7768 * Simplifier: the simpset of a running simplification process now
7769 contains a proof context (cf. Simplifier.the_context), which is the
7770 very context that the initial simpset has been retrieved from (by
7771 simpset_of/local_simpset_of). Consequently, all plug-in components
7772 (solver, looper etc.) may depend on arbitrary proof data.
7774 * Simplifier.inherit_context inherits the proof context (plus the
7775 local bounds) of the current simplification process; any simproc
7776 etc. that calls the Simplifier recursively should do this! Removed
7777 former Simplifier.inherit_bounds, which is already included here --
7778 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
7779 specify an explicit context using Simplifier.context/theory_context.
7781 * Simplifier/Classical Reasoner: more abstract interfaces
7782 change_simpset/claset for modifying the simpset/claset reference of a
7783 theory; raw versions simpset/claset_ref etc. have been discontinued --
7786 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
7792 * settings: the default heap location within ISABELLE_HOME_USER now
7793 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
7794 Isabelle installations.
7796 * isabelle-process: option -S (secure mode) disables some critical
7797 operations, notably runtime compilation and evaluation of ML source
7800 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
7802 * Support for parallel execution, using native multicore support of
7803 Poly/ML 5.1. The theory loader exploits parallelism when processing
7804 independent theories, according to the given theory header
7805 specifications. The maximum number of worker threads is specified via
7806 usedir option -M or the "max-threads" setting in Proof General. A
7807 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
7808 to 6 on a 8-core machine. User-code needs to observe certain
7809 guidelines for thread-safe programming, see appendix A in the Isar
7810 Implementation manual.
7814 New in Isabelle2005 (October 2005)
7815 ----------------------------------
7819 * Theory headers: the new header syntax for Isar theories is
7822 imports <theory1> ... <theoryN>
7823 uses <file1> ... <fileM>
7826 where the 'uses' part is optional. The previous syntax
7828 theory <name> = <theory1> + ... + <theoryN>:
7830 will disappear in the next release. Use isatool fixheaders to convert
7831 existing theory files. Note that there is no change in ancient
7832 non-Isar theories now, but these will disappear soon.
7834 * Theory loader: parent theories can now also be referred to via
7835 relative and absolute paths.
7837 * Command 'find_theorems' searches for a list of criteria instead of a
7838 list of constants. Known criteria are: intro, elim, dest, name:string,
7839 simp:term, and any term. Criteria can be preceded by '-' to select
7840 theorems that do not match. Intro, elim, dest select theorems that
7841 match the current goal, name:s selects theorems whose fully qualified
7842 name contain s, and simp:term selects all simplification rules whose
7843 lhs match term. Any other term is interpreted as pattern and selects
7844 all theorems matching the pattern. Available in ProofGeneral under
7845 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
7847 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
7849 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
7850 matching the current goal as introduction rule and not having "HOL."
7851 in their name (i.e. not being defined in theory HOL).
7853 * Command 'thms_containing' has been discontinued in favour of
7854 'find_theorems'; INCOMPATIBILITY.
7856 * Communication with Proof General is now 8bit clean, which means that
7857 Unicode text in UTF-8 encoding may be used within theory texts (both
7858 formal and informal parts). Cf. option -U of the Isabelle Proof
7859 General interface. Here are some simple examples (cf. src/HOL/ex):
7861 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
7862 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
7864 * Improved efficiency of the Simplifier and, to a lesser degree, the
7865 Classical Reasoner. Typical big applications run around 2 times
7869 *** Document preparation ***
7871 * Commands 'display_drafts' and 'print_drafts' perform simple output
7872 of raw sources. Only those symbols that do not require additional
7873 LaTeX packages (depending on comments in isabellesym.sty) are
7874 displayed properly, everything else is left verbatim. isatool display
7875 and isatool print are used as front ends (these are subject to the
7876 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
7878 * Command tags control specific markup of certain regions of text,
7879 notably folding and hiding. Predefined tags include "theory" (for
7880 theory begin and end), "proof" for proof commands, and "ML" for
7881 commands involving ML code; the additional tags "visible" and
7882 "invisible" are unused by default. Users may give explicit tag
7883 specifications in the text, e.g. ''by %invisible (auto)''. The
7884 interpretation of tags is determined by the LaTeX job during document
7885 preparation: see option -V of isatool usedir, or options -n and -t of
7886 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
7889 Several document versions may be produced at the same time via isatool
7890 usedir (the generated index.html will link all of them). Typical
7891 specifications include ''-V document=theory,proof,ML'' to present
7892 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
7893 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
7894 these parts without any formal replacement text. The Isabelle site
7895 default settings produce ''document'' and ''outline'' versions as
7898 * Several new antiquotations:
7900 @{term_type term} prints a term with its type annotated;
7902 @{typeof term} prints the type of a term;
7904 @{const const} is the same as @{term const}, but checks that the
7905 argument is a known logical constant;
7907 @{term_style style term} and @{thm_style style thm} print a term or
7908 theorem applying a "style" to it
7912 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
7913 definitions, equations, inequations etc., 'concl' printing only the
7914 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
7915 to print the specified premise. TermStyle.add_style provides an ML
7916 interface for introducing further styles. See also the "LaTeX Sugar"
7917 document practical applications. The ML antiquotation prints
7918 type-checked ML expressions verbatim.
7920 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
7921 and 'text' support optional locale specification '(in loc)', which
7922 specifies the default context for interpreting antiquotations. For
7923 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
7925 * Option 'locale=NAME' of antiquotations specifies an alternative
7926 context interpreting the subsequent argument. For example: @{thm
7927 [locale=lattice] inf_assoc}.
7929 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
7932 * Proper output of antiquotations for theory commands involving a
7933 proof context (such as 'locale' or 'theorem (in loc) ...').
7935 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
7936 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
7938 * isatool usedir: new option -C (default true) controls whether option
7939 -D should include a copy of the original document directory; -C false
7940 prevents unwanted effects such as copying of administrative CVS data.
7945 * Considerably improved version of 'constdefs' command. Now performs
7946 automatic type-inference of declared constants; additional support for
7947 local structure declarations (cf. locales and HOL records), see also
7948 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
7949 sequential dependencies of definitions within a single 'constdefs'
7950 section; moreover, the declared name needs to be an identifier. If
7951 all fails, consider to fall back on 'consts' and 'defs' separately.
7953 * Improved indexed syntax and implicit structures. First of all,
7954 indexed syntax provides a notational device for subscripted
7955 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
7956 expressions. Secondly, in a local context with structure
7957 declarations, number indexes \<^sub>n or the empty index (default
7958 number 1) refer to a certain fixed variable implicitly; option
7959 show_structs controls printing of implicit structures. Typical
7960 applications of these concepts involve record types and locales.
7962 * New command 'no_syntax' removes grammar declarations (and
7963 translations) resulting from the given syntax specification, which is
7964 interpreted in the same manner as for the 'syntax' command.
7966 * 'Advanced' translation functions (parse_translation etc.) may depend
7967 on the signature of the theory context being presently used for
7968 parsing/printing, see also isar-ref manual.
7970 * Improved 'oracle' command provides a type-safe interface to turn an
7971 ML expression of type theory -> T -> term into a primitive rule of
7972 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
7973 is already included here); see also FOL/ex/IffExample.thy;
7976 * axclass: name space prefix for class "c" is now "c_class" (was "c"
7977 before); "cI" is no longer bound, use "c.intro" instead.
7978 INCOMPATIBILITY. This change avoids clashes of fact bindings for
7979 axclasses vs. locales.
7981 * Improved internal renaming of symbolic identifiers -- attach primes
7982 instead of base 26 numbers.
7984 * New flag show_question_marks controls printing of leading question
7985 marks in schematic variable names.
7987 * In schematic variable names, *any* symbol following \<^isub> or
7988 \<^isup> is now treated as part of the base name. For example, the
7989 following works without printing of awkward ".0" indexes:
7991 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
7994 * Inner syntax includes (*(*nested*) comments*).
7996 * Pretty printer now supports unbreakable blocks, specified in mixfix
7997 annotations as "(00...)".
7999 * Clear separation of logical types and nonterminals, where the latter
8000 may only occur in 'syntax' specifications or type abbreviations.
8001 Before that distinction was only partially implemented via type class
8002 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
8003 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
8004 exotic syntax specifications may require further adaption
8005 (e.g. Cube/Cube.thy).
8007 * Removed obsolete type class "logic", use the top sort {} instead.
8008 Note that non-logical types should be declared as 'nonterminals'
8009 rather than 'types'. INCOMPATIBILITY for new object-logic
8012 * Attributes 'induct' and 'cases': type or set names may now be
8013 locally fixed variables as well.
8015 * Simplifier: can now control the depth to which conditional rewriting
8016 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
8019 * Simplifier: simplification procedures may now take the current
8020 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
8021 interface), which is very useful for calling the Simplifier
8022 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
8023 is gone -- use prems_of_ss on the simpset instead. Moreover, the
8024 low-level mk_simproc no longer applies Logic.varify internally, to
8025 allow for use in a context of fixed variables.
8027 * thin_tac now works even if the assumption being deleted contains !!
8028 or ==>. More generally, erule now works even if the major premise of
8029 the elimination rule contains !! or ==>.
8031 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
8033 * Reorganized bootstrapping of the Pure theories; CPure is now derived
8034 from Pure, which contains all common declarations already. Both
8035 theories are defined via plain Isabelle/Isar .thy files.
8036 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
8037 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
8038 use isatool fixcpure to adapt your theory and ML sources.
8040 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
8041 selections of theorems in named facts via index ranges.
8043 * 'print_theorems': in theory mode, really print the difference
8044 wrt. the last state (works for interactive theory development only),
8045 in proof mode print all local facts (cf. 'print_facts');
8047 * 'hide': option '(open)' hides only base names.
8049 * More efficient treatment of intermediate checkpoints in interactive
8052 * Code generator is now invoked via code_module (incremental code
8053 generation) and code_library (modular code generation, ML structures
8054 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
8055 must be quoted when used as identifiers.
8057 * New 'value' command for reading, evaluating and printing terms using
8058 the code generator. INCOMPATIBILITY: command keyword 'value' must be
8059 quoted when used as identifier.
8064 * New commands for the interpretation of locale expressions in
8065 theories (1), locales (2) and proof contexts (3). These generate
8066 proof obligations from the expression specification. After the
8067 obligations have been discharged, theorems of the expression are added
8068 to the theory, target locale or proof context. The synopsis of the
8069 commands is a follows:
8071 (1) interpretation expr inst
8072 (2) interpretation target < expr
8073 (3) interpret expr inst
8075 Interpretation in theories and proof contexts require a parameter
8076 instantiation of terms from the current context. This is applied to
8077 specifications and theorems of the interpreted expression.
8078 Interpretation in locales only permits parameter renaming through the
8079 locale expression. Interpretation is smart in that interpretations
8080 that are active already do not occur in proof obligations, neither are
8081 instantiated theorems stored in duplicate. Use 'print_interps' to
8082 inspect active interpretations of a particular locale. For details,
8083 see the Isar Reference manual. Examples can be found in
8084 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
8086 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
8087 'interpret' instead.
8089 * New context element 'constrains' for adding type constraints to
8092 * Context expressions: renaming of parameters with syntax
8095 * Locale declaration: 'includes' disallowed.
8097 * Proper static binding of attribute syntax -- i.e. types / terms /
8098 facts mentioned as arguments are always those of the locale definition
8099 context, independently of the context of later invocations. Moreover,
8100 locale operations (renaming and type / term instantiation) are applied
8101 to attribute arguments as expected.
8103 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
8104 actual attributes; rare situations may require Attrib.attribute to
8105 embed those attributes into Attrib.src that lack concrete syntax.
8106 Attribute implementations need to cooperate properly with the static
8107 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
8108 Attrib.XXX_thm etc. already do the right thing without further
8109 intervention. Only unusual applications -- such as "where" or "of"
8110 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
8111 on the context and the facts involved -- may have to assign parsed
8112 values to argument tokens explicitly.
8114 * Changed parameter management in theorem generation for long goal
8115 statements with 'includes'. INCOMPATIBILITY: produces a different
8116 theorem statement in rare situations.
8118 * Locale inspection command 'print_locale' omits notes elements. Use
8119 'print_locale!' to have them included in the output.
8124 * Provers/hypsubst.ML: improved version of the subst method, for
8125 single-step rewriting: it now works in bound variable contexts. New is
8126 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
8127 rewrite a different subterm than the original subst method, which is
8128 still available as 'simplesubst'.
8130 * Provers/quasi.ML: new transitivity reasoners for transitivity only
8133 * Provers/trancl.ML: new transitivity reasoner for transitive and
8134 reflexive-transitive closure of relations.
8136 * Provers/blast.ML: new reference depth_limit to make blast's depth
8137 limit (previously hard-coded with a value of 20) user-definable.
8139 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
8140 is peformed already. Object-logics merely need to finish their
8141 initial simpset configuration as before. INCOMPATIBILITY.
8146 * Symbolic syntax of Hilbert Choice Operator is now as follows:
8149 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
8151 The symbol \<some> is displayed as the alternative epsilon of LaTeX
8152 and x-symbol; use option '-m epsilon' to get it actually printed.
8153 Moreover, the mathematically important symbolic identifier \<epsilon>
8154 becomes available as variable, constant etc. INCOMPATIBILITY,
8156 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
8157 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
8158 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
8159 support corresponding Isar calculations.
8161 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
8164 * theory SetInterval: changed the syntax for open intervals:
8173 The old syntax is still supported but will disappear in the next
8174 release. For conversion use the following Emacs search and replace
8175 patterns (these are not perfect but work quite well):
8177 {)\([^\.]*\)\.\. -> {\1<\.\.}
8178 \.\.\([^(}]*\)(} -> \.\.<\1}
8180 * Theory Commutative_Ring (in Library): method comm_ring for proving
8181 equalities in commutative rings; method 'algebra' provides a generic
8184 * Theory Finite_Set: changed the syntax for 'setsum', summation over
8185 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
8186 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
8189 Some new syntax forms are available:
8191 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
8192 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
8193 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
8194 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
8196 The latter form "\<Sum>x < k. e" used to be based on a separate
8197 function "Summation", which has been discontinued.
8199 * theory Finite_Set: in structured induction proofs, the insert case
8200 is now 'case (insert x F)' instead of the old counterintuitive 'case
8203 * The 'refute' command has been extended to support a much larger
8204 fragment of HOL, including axiomatic type classes, constdefs and
8205 typedefs, inductive datatypes and recursion.
8207 * New tactics 'sat' and 'satx' to prove propositional tautologies.
8208 Requires zChaff with proof generation to be installed. See
8209 HOL/ex/SAT_Examples.thy for examples.
8211 * Datatype induction via method 'induct' now preserves the name of the
8212 induction variable. For example, when proving P(xs::'a list) by
8213 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
8214 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
8215 in unstructured proof scripts.
8217 * Reworked implementation of records. Improved scalability for
8218 records with many fields, avoiding performance problems for type
8219 inference. Records are no longer composed of nested field types, but
8220 of nested extension types. Therefore the record type only grows linear
8221 in the number of extensions and not in the number of fields. The
8222 top-level (users) view on records is preserved. Potential
8223 INCOMPATIBILITY only in strange cases, where the theory depends on the
8224 old record representation. The type generated for a record is called
8225 <record_name>_ext_type.
8227 Flag record_quick_and_dirty_sensitive can be enabled to skip the
8228 proofs triggered by a record definition or a simproc (if
8229 quick_and_dirty is enabled). Definitions of large records can take
8232 New simproc record_upd_simproc for simplification of multiple record
8233 updates enabled by default. Moreover, trivial updates are also
8234 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
8235 occasionally, since simplification is more powerful by default.
8237 * typedef: proper support for polymorphic sets, which contain extra
8238 type-variables in the term.
8240 * Simplifier: automatically reasons about transitivity chains
8241 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
8242 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
8243 old proofs break occasionally as simplification may now solve more
8244 goals than previously.
8246 * Simplifier: converts x <= y into x = y if assumption y <= x is
8247 present. Works for all partial orders (class "order"), in particular
8248 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
8251 * Simplifier: new simproc for "let x = a in f x". If a is a free or
8252 bound variable or a constant then the let is unfolded. Otherwise
8253 first a is simplified to b, and then f b is simplified to g. If
8254 possible we abstract b from g arriving at "let x = b in h x",
8255 otherwise we unfold the let and arrive at g. The simproc can be
8256 enabled/disabled by the reference use_let_simproc. Potential
8257 INCOMPATIBILITY since simplification is more powerful by default.
8259 * Classical reasoning: the meson method now accepts theorems as arguments.
8261 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
8262 jobs to provide advice on the provability of subgoals.
8264 * Theory OrderedGroup and Ring_and_Field: various additions and
8265 improvements to faciliate calculations involving equalities and
8268 The following theorems have been eliminated or modified
8271 abs_eq now named abs_of_nonneg
8272 abs_of_ge_0 now named abs_of_nonneg
8273 abs_minus_eq now named abs_of_nonpos
8274 imp_abs_id now named abs_of_nonneg
8275 imp_abs_neg_id now named abs_of_nonpos
8276 mult_pos now named mult_pos_pos
8277 mult_pos_le now named mult_nonneg_nonneg
8278 mult_pos_neg_le now named mult_nonneg_nonpos
8279 mult_pos_neg2_le now named mult_nonneg_nonpos2
8280 mult_neg now named mult_neg_neg
8281 mult_neg_le now named mult_nonpos_nonpos
8283 * The following lemmas in Ring_and_Field have been added to the simplifier:
8286 not_square_less_zero
8288 The following lemmas have been deleted from Real/RealPow:
8298 * Theory Parity: added rules for simplifying exponents.
8302 The following theorems have been eliminated or modified
8305 list_all_Nil now named list_all.simps(1)
8306 list_all_Cons now named list_all.simps(2)
8307 list_all_conv now named list_all_iff
8308 set_mem_eq now named mem_iff
8310 * Theories SetsAndFunctions and BigO (see HOL/Library) support
8311 asymptotic "big O" calculations. See the notes in BigO.thy.
8316 * Theory RealDef: better support for embedding natural numbers and
8317 integers in the reals.
8319 The following theorems have been eliminated or modified
8322 exp_ge_add_one_self now requires no hypotheses
8323 real_of_int_add reversed direction of equality (use [symmetric])
8324 real_of_int_minus reversed direction of equality (use [symmetric])
8325 real_of_int_diff reversed direction of equality (use [symmetric])
8326 real_of_int_mult reversed direction of equality (use [symmetric])
8328 * Theory RComplete: expanded support for floor and ceiling functions.
8330 * Theory Ln is new, with properties of the natural logarithm
8332 * Hyperreal: There is a new type constructor "star" for making
8333 nonstandard types. The old type names are now type synonyms:
8337 hcomplex = complex star
8339 * Hyperreal: Many groups of similarly-defined constants have been
8340 replaced by polymorphic versions (INCOMPATIBILITY):
8342 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
8344 starset <-- starsetNat, starsetC
8345 *s* <-- *sNat*, *sc*
8346 starset_n <-- starsetNat_n, starsetC_n
8347 *sn* <-- *sNatn*, *scn*
8348 InternalSets <-- InternalNatSets, InternalCSets
8350 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8351 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
8352 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
8353 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
8354 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
8356 * Hyperreal: Many type-specific theorems have been removed in favor of
8357 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
8359 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
8360 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
8361 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
8362 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
8363 right_minus <-- hypreal_add_minus
8364 left_minus <-- {hypreal,hcomplex}_add_minus_left
8365 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
8366 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
8367 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
8368 mult_1_right <-- hcomplex_mult_one_right
8369 mult_zero_left <-- hcomplex_mult_zero_left
8370 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
8371 right_distrib <-- hypnat_add_mult_distrib2
8372 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
8373 right_inverse <-- hypreal_mult_inverse
8374 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
8375 order_refl <-- {hypreal,hypnat}_le_refl
8376 order_trans <-- {hypreal,hypnat}_le_trans
8377 order_antisym <-- {hypreal,hypnat}_le_anti_sym
8378 order_less_le <-- {hypreal,hypnat}_less_le
8379 linorder_linear <-- {hypreal,hypnat}_le_linear
8380 add_left_mono <-- {hypreal,hypnat}_add_left_mono
8381 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
8382 add_nonneg_nonneg <-- hypreal_le_add_order
8384 * Hyperreal: Separate theorems having to do with type-specific
8385 versions of constants have been merged into theorems that apply to the
8386 new polymorphic constants (INCOMPATIBILITY):
8388 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
8389 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
8390 STAR_Un <-- {STAR,NatStar,STARC}_Un
8391 STAR_Int <-- {STAR,NatStar,STARC}_Int
8392 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
8393 STAR_subset <-- {STAR,NatStar,STARC}_subset
8394 STAR_mem <-- {STAR,NatStar,STARC}_mem
8395 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
8396 STAR_diff <-- {STAR,STARC}_diff
8397 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
8398 STARC_hcomplex_of_complex}_image_subset
8399 starset_n_Un <-- starset{Nat,C}_n_Un
8400 starset_n_Int <-- starset{Nat,C}_n_Int
8401 starset_n_Compl <-- starset{Nat,C}_n_Compl
8402 starset_n_diff <-- starset{Nat,C}_n_diff
8403 InternalSets_Un <-- Internal{Nat,C}Sets_Un
8404 InternalSets_Int <-- Internal{Nat,C}Sets_Int
8405 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
8406 InternalSets_diff <-- Internal{Nat,C}Sets_diff
8407 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
8408 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
8409 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
8410 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
8411 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
8412 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8413 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
8414 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
8415 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
8416 starfun_diff <-- starfun{C,RC,CR}_diff
8417 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
8418 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
8419 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
8420 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
8421 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
8422 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
8423 starfun_Id <-- starfunC_Id
8424 starfun_approx <-- starfun{Nat,CR}_approx
8425 starfun_capprox <-- starfun{C,RC}_capprox
8426 starfun_abs <-- starfunNat_rabs
8427 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
8428 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
8429 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
8430 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
8431 starfun_add_capprox <-- starfun{C,RC}_add_capprox
8432 starfun_add_approx <-- starfunCR_add_approx
8433 starfun_inverse_inverse <-- starfunC_inverse_inverse
8434 starfun_divide <-- starfun{C,CR,RC}_divide
8435 starfun_n <-- starfun{Nat,C}_n
8436 starfun_n_mult <-- starfun{Nat,C}_n_mult
8437 starfun_n_add <-- starfun{Nat,C}_n_add
8438 starfun_n_add_minus <-- starfunNat_n_add_minus
8439 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
8440 starfun_n_minus <-- starfun{Nat,C}_n_minus
8441 starfun_n_eq <-- starfun{Nat,C}_n_eq
8443 star_n_add <-- {hypreal,hypnat,hcomplex}_add
8444 star_n_minus <-- {hypreal,hcomplex}_minus
8445 star_n_diff <-- {hypreal,hcomplex}_diff
8446 star_n_mult <-- {hypreal,hcomplex}_mult
8447 star_n_inverse <-- {hypreal,hcomplex}_inverse
8448 star_n_le <-- {hypreal,hypnat}_le
8449 star_n_less <-- {hypreal,hypnat}_less
8450 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
8451 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
8452 star_n_abs <-- hypreal_hrabs
8453 star_n_divide <-- hcomplex_divide
8455 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
8456 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
8457 star_of_diff <-- hypreal_of_real_diff
8458 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
8459 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
8460 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
8461 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
8462 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
8463 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
8464 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
8465 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
8466 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
8467 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
8468 star_of_number_of <-- {hypreal,hcomplex}_number_of
8469 star_of_number_less <-- number_of_less_hypreal_of_real_iff
8470 star_of_number_le <-- number_of_le_hypreal_of_real_iff
8471 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
8472 star_of_less_number <-- hypreal_of_real_less_number_of_iff
8473 star_of_le_number <-- hypreal_of_real_le_number_of_iff
8474 star_of_power <-- hypreal_of_real_power
8475 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
8477 * Hyperreal: new method "transfer" that implements the transfer
8478 principle of nonstandard analysis. With a subgoal that mentions
8479 nonstandard types like "'a star", the command "apply transfer"
8480 replaces it with an equivalent one that mentions only standard types.
8481 To be successful, all free variables must have standard types; non-
8482 standard variables must have explicit universal quantifiers.
8484 * Hyperreal: A theory of Taylor series.
8489 * Discontinued special version of 'constdefs' (which used to support
8490 continuous functions) in favor of the general Pure one with full
8493 * New simplification procedure for solving continuity conditions; it
8494 is much faster on terms with many nested lambda abstractions (cubic
8495 instead of exponential time).
8497 * New syntax for domain package: selector names are now optional.
8498 Parentheses should be omitted unless argument is lazy, for example:
8500 domain 'a stream = cons "'a" (lazy "'a stream")
8502 * New command 'fixrec' for defining recursive functions with pattern
8503 matching; defining multiple functions with mutual recursion is also
8504 supported. Patterns may include the constants cpair, spair, up, sinl,
8505 sinr, or any data constructor defined by the domain package. The given
8506 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
8507 syntax and examples.
8509 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
8510 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
8511 but the proof obligation additionally includes an admissibility
8512 requirement. The packages generate instances of class cpo or pcpo,
8513 with continuity and strictness theorems for Rep and Abs.
8515 * HOLCF: Many theorems have been renamed according to a more standard naming
8516 scheme (INCOMPATIBILITY):
8518 foo_inject: "foo$x = foo$y ==> x = y"
8519 foo_eq: "(foo$x = foo$y) = (x = y)"
8520 foo_less: "(foo$x << foo$y) = (x << y)"
8521 foo_strict: "foo$UU = UU"
8522 foo_defined: "... ==> foo$x ~= UU"
8523 foo_defined_iff: "(foo$x = UU) = (x = UU)"
8528 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
8529 including the First Isomorphism Theorem (on quotienting by the kernel
8532 * ZF/Simplifier: install second copy of type solver that actually
8533 makes use of TC rules declared to Isar proof contexts (or locales);
8534 the old version is still required for ML proof scripts.
8539 * Converted to Isar theory format; use locales instead of axiomatic
8545 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
8548 * Pure/library.ML no longer defines its own option datatype, but uses
8549 that of the SML basis, which has constructors NONE and SOME instead of
8550 None and Some, as well as exception Option.Option instead of OPTION.
8551 The functions the, if_none, is_some, is_none have been adapted
8552 accordingly, while Option.map replaces apsome.
8554 * Pure/library.ML: the exception LIST has been given up in favour of
8555 the standard exceptions Empty and Subscript, as well as
8556 Library.UnequalLengths. Function like Library.hd and Library.tl are
8557 superceded by the standard hd and tl functions etc.
8559 A number of basic list functions are no longer exported to the ML
8560 toplevel, as they are variants of predefined functions. The following
8561 suggests how one can translate existing code:
8563 rev_append xs ys = List.revAppend (xs, ys)
8564 nth_elem (i, xs) = List.nth (xs, i)
8565 last_elem xs = List.last xs
8566 flat xss = List.concat xss
8567 seq fs = List.app fs
8568 partition P xs = List.partition P xs
8569 mapfilter f xs = List.mapPartial f xs
8571 * Pure/library.ML: several combinators for linear functional
8572 transformations, notably reverse application and composition:
8575 (x, y) |-> f f #-> g
8577 * Pure/library.ML: introduced/changed precedence of infix operators:
8579 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
8581 infix 3 o oo ooo oooo;
8582 infix 4 ~~ upto downto;
8584 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
8587 * Pure/library.ML: natural list combinators fold, fold_rev, and
8588 fold_map support linear functional transformations and nesting. For
8591 fold f [x1, ..., xN] y =
8592 y |> f x1 |> ... |> f xN
8594 (fold o fold) f [xs1, ..., xsN] y =
8595 y |> fold f xs1 |> ... |> fold f xsN
8597 fold f [x1, ..., xN] =
8600 (fold o fold) f [xs1, ..., xsN] =
8601 fold f xs1 #> ... #> fold f xsN
8603 * Pure/library.ML: the following selectors on type 'a option are
8606 the: 'a option -> 'a (*partial*)
8607 these: 'a option -> 'a where 'a = 'b list
8608 the_default: 'a -> 'a option -> 'a
8609 the_list: 'a option -> 'a list
8611 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
8612 basic operations for association lists, following natural argument
8613 order; moreover the explicit equality predicate passed here avoids
8614 potentially expensive polymorphic runtime equality checks.
8615 The old functions may be expressed as follows:
8617 assoc = uncurry (AList.lookup (op =))
8618 assocs = these oo AList.lookup (op =)
8619 overwrite = uncurry (AList.update (op =)) o swap
8621 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
8623 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
8624 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
8626 replacing make_keylist and keyfilter (occassionally used)
8629 make_keylist = AList.make
8630 keyfilter = AList.find (op =)
8632 * eq_fst and eq_snd now take explicit equality parameter, thus
8633 avoiding eqtypes. Naive rewrites:
8635 eq_fst = eq_fst (op =)
8636 eq_snd = eq_snd (op =)
8638 * Removed deprecated apl and apr (rarely used).
8641 apl (n, op) =>>= curry op n
8642 apr (op, m) =>>= fn n => op (n, m)
8644 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
8645 provides a reasonably efficient light-weight implementation of sets as
8648 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
8649 few new operations; existing lookup and update are now curried to
8650 follow natural argument order (for use with fold etc.);
8651 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
8653 * Pure/General: output via the Isabelle channels of
8654 writeln/warning/error etc. is now passed through Output.output, with a
8655 hook for arbitrary transformations depending on the print_mode
8656 (cf. Output.add_mode -- the first active mode that provides a output
8657 function wins). Already formatted output may be embedded into further
8658 text via Output.raw; the result of Pretty.string_of/str_of and derived
8659 functions (string_of_term/cterm/thm etc.) is already marked raw to
8660 accommodate easy composition of diagnostic messages etc. Programmers
8661 rarely need to care about Output.output or Output.raw at all, with
8662 some notable exceptions: Output.output is required when bypassing the
8663 standard channels (writeln etc.), or in token translations to produce
8664 properly formatted results; Output.raw is required when capturing
8665 already output material that will eventually be presented to the user
8666 a second time. For the default print mode, both Output.output and
8667 Output.raw have no effect.
8669 * Pure/General: Output.time_accumulator NAME creates an operator ('a
8670 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
8671 cumulative results are displayed at the end of a batch session.
8673 * Pure/General: File.sysify_path and File.quote_sysify path have been
8674 replaced by File.platform_path and File.shell_path (with appropriate
8675 hooks). This provides a clean interface for unusual systems where the
8676 internal and external process view of file names are different.
8678 * Pure: more efficient orders for basic syntactic entities: added
8679 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
8680 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
8681 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
8682 orders now -- potential INCOMPATIBILITY for code that depends on a
8683 particular order for Symtab.keys, Symtab.dest, etc. (consider using
8684 Library.sort_strings on result).
8686 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
8687 fold_types traverse types/terms from left to right, observing natural
8688 argument order. Supercedes previous foldl_XXX versions, add_frees,
8689 add_vars etc. have been adapted as well: INCOMPATIBILITY.
8691 * Pure: name spaces have been refined, with significant changes of the
8692 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
8693 to extern(_table). The plain name entry path is superceded by a
8694 general 'naming' context, which also includes the 'policy' to produce
8695 a fully qualified name and external accesses of a fully qualified
8696 name; NameSpace.extend is superceded by context dependent
8697 Sign.declare_name. Several theory and proof context operations modify
8698 the naming context. Especially note Theory.restore_naming and
8699 ProofContext.restore_naming to get back to a sane state; note that
8700 Theory.add_path is no longer sufficient to recover from
8701 Theory.absolute_path in particular.
8703 * Pure: new flags short_names (default false) and unique_names
8704 (default true) for controlling output of qualified names. If
8705 short_names is set, names are printed unqualified. If unique_names is
8706 reset, the name prefix is reduced to the minimum required to achieve
8707 the original result when interning again, even if there is an overlap
8708 with earlier declarations.
8710 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
8711 now 'extend', and 'merge' gets an additional Pretty.pp argument
8712 (useful for printing error messages). INCOMPATIBILITY.
8714 * Pure: major reorganization of the theory context. Type Sign.sg and
8715 Theory.theory are now identified, referring to the universal
8716 Context.theory (see Pure/context.ML). Actual signature and theory
8717 content is managed as theory data. The old code and interfaces were
8718 spread over many files and structures; the new arrangement introduces
8719 considerable INCOMPATIBILITY to gain more clarity:
8721 Context -- theory management operations (name, identity, inclusion,
8722 parents, ancestors, merge, etc.), plus generic theory data;
8724 Sign -- logical signature and syntax operations (declaring consts,
8725 types, etc.), plus certify/read for common entities;
8727 Theory -- logical theory operations (stating axioms, definitions,
8728 oracles), plus a copy of logical signature operations (consts,
8729 types, etc.); also a few basic management operations (Theory.copy,
8732 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
8733 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
8734 for convenience -- they merely return the theory.
8736 * Pure: type Type.tsig is superceded by theory in most interfaces.
8738 * Pure: the Isar proof context type is already defined early in Pure
8739 as Context.proof (note that ProofContext.context and Proof.context are
8740 aliases, where the latter is the preferred name). This enables other
8741 Isabelle components to refer to that type even before Isar is present.
8743 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
8744 typeK, constK, axiomK, oracleK), but provide explicit operations for
8745 any of these kinds. For example, Sign.intern typeK is now
8746 Sign.intern_type, Theory.hide_space Sign.typeK is now
8747 Theory.hide_types. Also note that former
8748 Theory.hide_classes/types/consts are now
8749 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
8750 internalize their arguments! INCOMPATIBILITY.
8752 * Pure: get_thm interface (of PureThy and ProofContext) expects
8753 datatype thmref (with constructors Name and NameSelection) instead of
8754 plain string -- INCOMPATIBILITY;
8756 * Pure: cases produced by proof methods specify options, where NONE
8757 means to remove case bindings -- INCOMPATIBILITY in
8760 * Pure: the following operations retrieve axioms or theorems from a
8761 theory node or theory hierarchy, respectively:
8763 Theory.axioms_of: theory -> (string * term) list
8764 Theory.all_axioms_of: theory -> (string * term) list
8765 PureThy.thms_of: theory -> (string * thm) list
8766 PureThy.all_thms_of: theory -> (string * thm) list
8768 * Pure: print_tac now outputs the goal through the trace channel.
8770 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
8771 Reference Toplevel.debug (default false) controls detailed printing
8772 and tracing of low-level exceptions; Toplevel.profiling (default 0)
8773 controls execution profiling -- set to 1 for time and 2 for space
8774 (both increase the runtime).
8776 * Isar session: The initial use of ROOT.ML is now always timed,
8777 i.e. the log will show the actual process times, in contrast to the
8778 elapsed wall-clock time that the outer shell wrapper produces.
8780 * Simplifier: improved handling of bound variables (nameless
8781 representation, avoid allocating new strings). Simprocs that invoke
8782 the Simplifier recursively should use Simplifier.inherit_bounds to
8783 avoid local name clashes. Failure to do so produces warnings
8784 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
8785 for further details.
8787 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
8788 bindings for all theorems stored within a given theory; this may help
8789 in porting non-Isar theories to Isar ones, while keeping ML proof
8790 scripts for the time being.
8792 * ML operator HTML.with_charset specifies the charset begin used for
8793 generated HTML files. For example:
8795 HTML.with_charset "utf-8" use_thy "Hebrew";
8796 HTML.with_charset "utf-8" use_thy "Chinese";
8801 * Allow symlinks to all proper Isabelle executables (Isabelle,
8802 isabelle, isatool etc.).
8804 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
8805 isatool doc, isatool mkdir, display_drafts etc.).
8807 * isatool usedir: option -f allows specification of the ML file to be
8808 used by Isabelle; default is ROOT.ML.
8810 * New isatool version outputs the version identifier of the Isabelle
8811 distribution being used.
8813 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
8814 (containing Boolean satisfiability problems) into Isabelle/HOL
8819 New in Isabelle2004 (April 2004)
8820 --------------------------------
8824 * Provers/order.ML: new efficient reasoner for partial and linear orders.
8825 Replaces linorder.ML.
8827 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
8828 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
8829 (\<a>...\<z>), are now considered normal letters, and can therefore
8830 be used anywhere where an ASCII letter (a...zA...Z) has until
8831 now. COMPATIBILITY: This obviously changes the parsing of some
8832 terms, especially where a symbol has been used as a binder, say
8833 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
8834 as an identifier. Fix it by inserting a space around former
8835 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
8836 existing theory and ML files.
8838 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
8840 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
8841 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
8842 a normal (but invisible) letter. For multiple letter subscripts repeat
8843 \<^isub> like this: x\<^isub>1\<^isub>2.
8845 * Pure: There are now sub-/superscripts that can span more than one
8846 character. Text between \<^bsub> and \<^esub> is set in subscript in
8847 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
8848 superscript. The new control characters are not identifier parts.
8850 * Pure: Control-symbols of the form \<^raw:...> will literally print the
8851 content of "..." to the latex file instead of \isacntrl... . The "..."
8852 may consist of any printable characters excluding the end bracket >.
8854 * Pure: Using new Isar command "finalconsts" (or the ML functions
8855 Theory.add_finals or Theory.add_finals_i) it is now possible to
8856 declare constants "final", which prevents their being given a definition
8857 later. It is useful for constants whose behaviour is fixed axiomatically
8858 rather than definitionally, such as the meta-logic connectives.
8860 * Pure: 'instance' now handles general arities with general sorts
8861 (i.e. intersections of classes),
8863 * Presentation: generated HTML now uses a CSS style sheet to make layout
8864 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
8865 It can be changed to alter the colors/layout of generated pages.
8870 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
8871 cut_tac, subgoal_tac and thin_tac:
8872 - Now understand static (Isar) contexts. As a consequence, users of Isar
8873 locales are no longer forced to write Isar proof scripts.
8874 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
8876 - INCOMPATIBILITY: names of variables to be instantiated may no
8877 longer be enclosed in quotes. Instead, precede variable name with `?'.
8878 This is consistent with the instantiation attribute "where".
8880 * Attributes "where" and "of":
8881 - Now take type variables of instantiated theorem into account when reading
8882 the instantiation string. This fixes a bug that caused instantiated
8883 theorems to have too special types in some circumstances.
8884 - "where" permits explicit instantiations of type variables.
8886 * Calculation commands "moreover" and "also" no longer interfere with
8887 current facts ("this"), admitting arbitrary combinations with "then"
8891 - Goal statements involving the context element "includes" no longer
8892 generate theorems with internal delta predicates (those ending on
8893 "_axioms") in the premise.
8894 Resolve particular premise with <locale>.intro to obtain old form.
8895 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
8896 specification and "includes" elements in goal statement.
8897 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
8898 [intro?] and [elim?] (respectively) by default.
8899 - Experimental command for instantiation of locales in proof contexts:
8900 instantiate <label>[<attrs>]: <loc>
8901 Instantiates locale <loc> and adds all its theorems to the current context
8902 taking into account their attributes. Label and attrs are optional
8903 modifiers, like in theorem declarations. If present, names of
8904 instantiated theorems are qualified with <label>, and the attributes
8905 <attrs> are applied after any attributes these theorems might have already.
8906 If the locale has assumptions, a chained fact of the form
8907 "<loc> t1 ... tn" is expected from which instantiations of the parameters
8908 are derived. The command does not support old-style locales declared
8909 with "locale (open)".
8910 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
8912 * HOL: Tactic emulation methods induct_tac and case_tac understand static
8918 * Proof import: new image HOL4 contains the imported library from
8919 the HOL4 system with about 2500 theorems. It is imported by
8920 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
8921 can be used like any other Isabelle image. See
8922 HOL/Import/HOL/README for more information.
8925 - Much improved handling of linear and partial orders.
8926 Reasoners for linear and partial orders are set up for type classes
8927 "linorder" and "order" respectively, and are added to the default simpset
8928 as solvers. This means that the simplifier can build transitivity chains
8929 to solve goals from the assumptions.
8930 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
8931 of blast or auto after simplification become unnecessary because the goal
8932 is solved by simplification already.
8934 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
8935 all proved in axiomatic type classes for semirings, rings and fields.
8938 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
8939 now formalized using the Ring_and_Field theory mentioned above.
8940 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
8941 than before, because now they are set up once in a generic manner.
8942 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
8943 Look for the general versions in Ring_and_Field (and Power if they concern
8946 * Type "rat" of the rational numbers is now available in HOL-Complex.
8949 - Record types are now by default printed with their type abbreviation
8950 instead of the list of all field types. This can be configured via
8951 the reference "print_record_type_abbr".
8952 - Simproc "record_upd_simproc" for simplification of multiple updates added
8953 (not enabled by default).
8954 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
8955 EX x. x = sel r to True (not enabled by default).
8956 - Tactic "record_split_simp_tac" to split and simplify records added.
8958 * 'specification' command added, allowing for definition by
8959 specification. There is also an 'ax_specification' command that
8960 introduces the new constants axiomatically.
8962 * arith(_tac) is now able to generate counterexamples for reals as well.
8964 * HOL-Algebra: new locale "ring" for non-commutative rings.
8966 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
8967 definitions, thanks to Sava Krsti\'{c} and John Matthews.
8969 * HOL-Matrix: a first theory for matrices in HOL with an application of
8970 matrix theory to linear programming.
8972 * Unions and Intersections:
8973 The latex output syntax of UN and INT has been changed
8974 from "\Union x \in A. B" to "\Union_{x \in A} B"
8975 i.e. the index formulae has become a subscript.
8976 Similarly for "\Union x. B", and for \Inter instead of \Union.
8978 * Unions and Intersections over Intervals:
8979 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
8980 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
8981 like in normal math, and corresponding versions for < and for intersection.
8983 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
8984 lexicographic dictonary ordering has been added as "lexord".
8986 * ML: the legacy theory structures Int and List have been removed. They had
8987 conflicted with ML Basis Library structures having the same names.
8989 * 'refute' command added to search for (finite) countermodels. Only works
8990 for a fragment of HOL. The installation of an external SAT solver is
8991 highly recommended. See "HOL/Refute.thy" for details.
8993 * 'quickcheck' command: Allows to find counterexamples by evaluating
8994 formulae under an assignment of free variables to random values.
8995 In contrast to 'refute', it can deal with inductive datatypes,
8996 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
9002 * Streams now come with concatenation and are part of the HOLCF image
9006 New in Isabelle2003 (May 2003)
9007 ------------------------------
9011 * Provers/simplifier:
9013 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
9014 Assumptions are now subject to complete mutual simplification,
9015 not just from left to right. The simplifier now preserves
9016 the order of assumptions.
9018 Potential INCOMPATIBILITY:
9020 -- simp sometimes diverges where the old version did
9021 not, e.g. invoking simp on the goal
9023 [| P (f x); y = x; f x = f y |] ==> Q
9025 now gives rise to the infinite reduction sequence
9027 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
9029 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
9032 -- Tactics combining classical reasoner and simplification (such as auto)
9033 are also affected by this change, because many of them rely on
9034 simp. They may sometimes diverge as well or yield a different numbers
9035 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
9036 in case of problems. Sometimes subsequent calls to the classical
9037 reasoner will fail because a preceeding call to the simplifier too
9038 eagerly simplified the goal, e.g. deleted redundant premises.
9040 - The simplifier trace now shows the names of the applied rewrite rules
9042 - You can limit the number of recursive invocations of the simplifier
9043 during conditional rewriting (where the simplifie tries to solve the
9044 conditions before applying the rewrite rule):
9045 ML "simp_depth_limit := n"
9046 where n is an integer. Thus you can force termination where previously
9047 the simplifier would diverge.
9049 - Accepts free variables as head terms in congruence rules. Useful in Isar.
9051 - No longer aborts on failed congruence proof. Instead, the
9052 congruence is ignored.
9054 * Pure: New generic framework for extracting programs from constructive
9055 proofs. See HOL/Extraction.thy for an example instantiation, as well
9056 as HOL/Extraction for some case studies.
9058 * Pure: The main goal of the proof state is no longer shown by default, only
9059 the subgoals. This behaviour is controlled by a new flag.
9060 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
9061 (ML: Proof.show_main_goal).
9063 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
9064 rules whose conclusion matches subgoal 1:
9065 PG menu: Isabelle/Isar -> Show me -> matching rules
9066 The rules are ordered by how closely they match the subgoal.
9067 In particular, rules that solve a subgoal outright are displayed first
9068 (or rather last, the way they are printed).
9069 (ML: ProofGeneral.print_intros())
9071 * Pure: New flag trace_unify_fail causes unification to print
9072 diagnostic information (PG: in trace buffer) when it fails. This is
9073 useful for figuring out why single step proofs like rule, erule or
9076 * Pure: Locale specifications now produce predicate definitions
9077 according to the body of text (covering assumptions modulo local
9078 definitions); predicate "loc_axioms" covers newly introduced text,
9079 while "loc" is cumulative wrt. all included locale expressions; the
9080 latter view is presented only on export into the global theory
9081 context; potential INCOMPATIBILITY, use "(open)" option to fall back
9082 on the old view without predicates;
9084 * Pure: predefined locales "var" and "struct" are useful for sharing
9085 parameters (as in CASL, for example); just specify something like
9086 ``var x + var y + struct M'' as import;
9088 * Pure: improved thms_containing: proper indexing of facts instead of
9089 raw theorems; check validity of results wrt. current name space;
9090 include local facts of proof configuration (also covers active
9091 locales), cover fixed variables in index; may use "_" in term
9092 specification; an optional limit for the number of printed facts may
9093 be given (the default is 40);
9095 * Pure: disallow duplicate fact bindings within new-style theory files
9098 * Provers: improved induct method: assumptions introduced by case
9099 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
9100 the goal statement); "foo" still refers to all facts collectively;
9102 * Provers: the function blast.overloaded has been removed: all constants
9103 are regarded as potentially overloaded, which improves robustness in exchange
9104 for slight decrease in efficiency;
9106 * Provers/linorder: New generic prover for transitivity reasoning over
9107 linear orders. Note: this prover is not efficient!
9109 * Isar: preview of problems to finish 'show' now produce an error
9110 rather than just a warning (in interactive mode);
9117 - Produces a counter example if it cannot prove a goal.
9118 Note that the counter example may be spurious if the goal is not a formula
9119 of quantifier-free linear arithmetic.
9120 In ProofGeneral the counter example appears in the trace buffer.
9122 - Knows about div k and mod k where k is a numeral of type nat or int.
9124 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
9125 linear arithmetic fails. This takes account of quantifiers and divisibility.
9126 Presburger arithmetic can also be called explicitly via presburger(_tac).
9128 * simp's arithmetic capabilities have been enhanced a bit: it now
9129 takes ~= in premises into account (by performing a case split);
9131 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
9132 are distributed over a sum of terms;
9134 * New tactic "trans_tac" and method "trans" instantiate
9135 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
9138 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
9139 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
9141 * 'typedef' command has new option "open" to suppress the set
9144 * functions Min and Max on finite sets have been introduced (theory
9147 * attribute [symmetric] now works for relations as well; it turns
9148 (x,y) : R^-1 into (y,x) : R, and vice versa;
9150 * induct over a !!-quantified statement (say !!x1..xn):
9151 each "case" automatically performs "fix x1 .. xn" with exactly those names.
9153 * Map: `empty' is no longer a constant but a syntactic abbreviation for
9154 %x. None. Warning: empty_def now refers to the previously hidden definition
9157 * Algebra: formalization of classical algebra. Intended as base for
9158 any algebraic development in Isabelle. Currently covers group theory
9159 (up to Sylow's theorem) and ring theory (Universal Property of
9160 Univariate Polynomials). Contributions welcome;
9162 * GroupTheory: deleted, since its material has been moved to Algebra;
9164 * Complex: new directory of the complex numbers with numeric constants,
9165 nonstandard complex numbers, and some complex analysis, standard and
9166 nonstandard (Jacques Fleuriot);
9168 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
9170 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
9173 * Real/HahnBanach: updated and adapted to locales;
9175 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
9178 * UNITY: added the Meier-Sanders theory of progress sets;
9180 * MicroJava: bytecode verifier and lightweight bytecode verifier
9181 as abstract algorithms, instantiated to the JVM;
9183 * Bali: Java source language formalization. Type system, operational
9184 semantics, axiomatic semantics. Supported language features:
9185 classes, interfaces, objects,virtual methods, static methods,
9186 static/instance fields, arrays, access modifiers, definite
9187 assignment, exceptions.
9192 * ZF/Constructible: consistency proof for AC (Gdel's constructible
9195 * Main ZF: virtually all theories converted to new-style format;
9200 * Pure: Tactic.prove provides sane interface for internal proofs;
9201 omits the infamous "standard" operation, so this is more appropriate
9202 than prove_goalw_cterm in many situations (e.g. in simprocs);
9204 * Pure: improved error reporting of simprocs;
9206 * Provers: Simplifier.simproc(_i) provides sane interface for setting
9210 *** Document preparation ***
9212 * uses \par instead of \\ for line breaks in theory text. This may
9213 shift some page breaks in large documents. To get the old behaviour
9214 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
9216 * minimized dependencies of isabelle.sty and isabellesym.sty on
9219 * \<euro> now needs package babel/greek instead of marvosym (which
9222 * normal size for \<zero>...\<nine> (uses \mathbf instead of
9227 New in Isabelle2002 (March 2002)
9228 --------------------------------
9230 *** Document preparation ***
9232 * greatly simplified document preparation setup, including more
9233 graceful interpretation of isatool usedir -i/-d/-D options, and more
9234 instructive isatool mkdir; users should basically be able to get
9235 started with "isatool mkdir HOL Test && isatool make"; alternatively,
9236 users may run a separate document processing stage manually like this:
9237 "isatool usedir -D output HOL Test && isatool document Test/output";
9239 * theory dependency graph may now be incorporated into documents;
9240 isatool usedir -g true will produce session_graph.eps/.pdf for use
9241 with \includegraphics of LaTeX;
9243 * proper spacing of consecutive markup elements, especially text
9244 blocks after section headings;
9246 * support bold style (for single symbols only), input syntax is like
9247 this: "\<^bold>\<alpha>" or "\<^bold>A";
9249 * \<bullet> is now output as bold \cdot by default, which looks much
9250 better in printed text;
9252 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
9253 note that these symbols are currently unavailable in Proof General /
9254 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
9256 * isatool latex no longer depends on changed TEXINPUTS, instead
9257 isatool document copies the Isabelle style files to the target
9263 * Pure/Provers: improved proof by cases and induction;
9264 - 'case' command admits impromptu naming of parameters (such as
9266 - 'induct' method divinates rule instantiation from the inductive
9267 claim; no longer requires excessive ?P bindings for proper
9268 instantiation of cases;
9269 - 'induct' method properly enumerates all possibilities of set/type
9270 rules; as a consequence facts may be also passed through *type*
9271 rules without further ado;
9272 - 'induct' method now derives symbolic cases from the *rulified*
9273 rule (before it used to rulify cases stemming from the internal
9274 atomized version); this means that the context of a non-atomic
9275 statement becomes is included in the hypothesis, avoiding the
9276 slightly cumbersome show "PROP ?case" form;
9277 - 'induct' may now use elim-style induction rules without chaining
9278 facts, using ``missing'' premises from the goal state; this allows
9279 rules stemming from inductive sets to be applied in unstructured
9280 scripts, while still benefitting from proper handling of non-atomic
9281 statements; NB: major inductive premises need to be put first, all
9282 the rest of the goal is passed through the induction;
9283 - 'induct' proper support for mutual induction involving non-atomic
9284 rule statements (uses the new concept of simultaneous goals, see
9286 - append all possible rule selections, but only use the first
9287 success (no backtracking);
9288 - removed obsolete "(simplified)" and "(stripped)" options of methods;
9289 - undeclared rule case names default to numbers 1, 2, 3, ...;
9290 - added 'print_induct_rules' (covered by help item in recent Proof
9292 - moved induct/cases attributes to Pure, methods to Provers;
9293 - generic method setup instantiated for FOL and HOL;
9295 * Pure: support multiple simultaneous goal statements, for example
9296 "have a: A and b: B" (same for 'theorem' etc.); being a pure
9297 meta-level mechanism, this acts as if several individual goals had
9298 been stated separately; in particular common proof methods need to be
9299 repeated in order to cover all claims; note that a single elimination
9300 step is *not* sufficient to establish the two conjunctions, so this
9303 assume "A & B" then have A and B .. (*".." fails*)
9305 better use "obtain" in situations as above; alternative refer to
9306 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
9308 * Pure: proper integration with ``locales''; unlike the original
9309 version by Florian Kammller, Isar locales package high-level proof
9310 contexts rather than raw logical ones (e.g. we admit to include
9311 attributes everywhere); operations on locales include merge and
9312 rename; support for implicit arguments (``structures''); simultaneous
9313 type-inference over imports and text; see also HOL/ex/Locales.thy for
9316 * Pure: the following commands have been ``localized'', supporting a
9317 target locale specification "(in name)": 'lemma', 'theorem',
9318 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
9319 stored both within the locale and at the theory level (exported and
9320 qualified by the locale name);
9322 * Pure: theory goals may now be specified in ``long'' form, with
9323 ad-hoc contexts consisting of arbitrary locale elements. for example
9324 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
9325 definitions may be given, too); the result is a meta-level rule with
9326 the context elements being discharged in the obvious way;
9328 * Pure: new proof command 'using' allows to augment currently used
9329 facts after a goal statement ('using' is syntactically analogous to
9330 'apply', but acts on the goal's facts only); this allows chained facts
9331 to be separated into parts given before and after a claim, as in
9332 ``from a and b have C using d and e <proof>'';
9334 * Pure: renamed "antecedent" case to "rule_context";
9336 * Pure: new 'judgment' command records explicit information about the
9337 object-logic embedding (used by several tools internally); no longer
9338 use hard-wired "Trueprop";
9340 * Pure: added 'corollary' command;
9342 * Pure: fixed 'token_translation' command;
9344 * Pure: removed obsolete 'exported' attribute;
9346 * Pure: dummy pattern "_" in is/let is now automatically lifted over
9347 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
9348 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
9350 * Pure: method 'atomize' presents local goal premises as object-level
9351 statements (atomic meta-level propositions); setup controlled via
9352 rewrite rules declarations of 'atomize' attribute; example
9353 application: 'induct' method with proper rule statements in improper
9356 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
9357 now consider the syntactic context of assumptions, giving a better
9358 chance to get type-inference of the arguments right (this is
9359 especially important for locales);
9361 * Pure: "sorry" no longer requires quick_and_dirty in interactive
9364 * Pure/obtain: the formal conclusion "thesis", being marked as
9365 ``internal'', may no longer be reference directly in the text;
9366 potential INCOMPATIBILITY, may need to use "?thesis" in rare
9369 * Pure: generic 'sym' attribute which declares a rule both as pure
9370 'elim?' and for the 'symmetric' operation;
9372 * Pure: marginal comments ``--'' may now occur just anywhere in the
9373 text; the fixed correlation with particular command syntax has been
9376 * Pure: new method 'rules' is particularly well-suited for proof
9377 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
9378 but often produces more compact proof terms with less detours;
9380 * Pure/Provers/classical: simplified integration with pure rule
9381 attributes and methods; the classical "intro?/elim?/dest?"
9382 declarations coincide with the pure ones; the "rule" method no longer
9383 includes classically swapped intros; "intro" and "elim" methods no
9384 longer pick rules from the context; also got rid of ML declarations
9385 AddXIs/AddXEs/AddXDs; all of this has some potential for
9388 * Provers/classical: attribute 'swapped' produces classical inversions
9389 of introduction rules;
9391 * Provers/simplifier: 'simplified' attribute may refer to explicit
9392 rules instead of full simplifier context; 'iff' attribute handles
9395 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
9397 * HOL: 'recdef' now fails on unfinished automated proofs, use
9398 "(permissive)" option to recover old behavior;
9400 * HOL: 'inductive' no longer features separate (collective) attributes
9401 for 'intros' (was found too confusing);
9403 * HOL: properly declared induction rules less_induct and
9409 * HOL: moved over to sane numeral syntax; the new policy is as
9412 - 0 and 1 are polymorphic constants, which are defined on any
9413 numeric type (nat, int, real etc.);
9415 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
9416 binary representation internally;
9418 - type nat has special constructor Suc, and generally prefers Suc 0
9419 over 1::nat and Suc (Suc 0) over 2::nat;
9421 This change may cause significant problems of INCOMPATIBILITY; here
9422 are some hints on converting existing sources:
9424 - due to the new "num" token, "-0" and "-1" etc. are now atomic
9425 entities, so expressions involving "-" (unary or binary minus) need
9426 to be spaced properly;
9428 - existing occurrences of "1" may need to be constraint "1::nat" or
9429 even replaced by Suc 0; similar for old "2";
9431 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
9433 - remove all special provisions on numerals in proofs;
9435 * HOL: simp rules nat_number expand numerals on nat to Suc/0
9436 representation (depends on bin_arith_simps in the default context);
9438 * HOL: symbolic syntax for x^2 (numeral 2);
9440 * HOL: the class of all HOL types is now called "type" rather than
9441 "term"; INCOMPATIBILITY, need to adapt references to this type class
9442 in axclass/classes, instance/arities, and (usually rare) occurrences
9443 in typings (of consts etc.); internally the class is called
9444 "HOL.type", ML programs should refer to HOLogic.typeS;
9446 * HOL/record package improvements:
9447 - new derived operations "fields" to build a partial record section,
9448 "extend" to promote a fixed record to a record scheme, and
9449 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
9450 declared as simp by default;
9451 - shared operations ("more", "fields", etc.) now need to be always
9452 qualified) --- potential INCOMPATIBILITY;
9453 - removed "make_scheme" operations (use "make" with "extend") --
9455 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
9456 - provides cases/induct rules for use with corresponding Isar
9457 methods (for concrete records, record schemes, concrete more
9458 parts, and schematic more parts -- in that order);
9459 - internal definitions directly based on a light-weight abstract
9460 theory of product types over typedef rather than datatype;
9462 * HOL: generic code generator for generating executable ML code from
9463 specifications; specific support for HOL constructs such as inductive
9464 datatypes and sets, as well as recursive functions; can be invoked
9465 via 'generate_code' theory section;
9467 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
9469 * HOL: consolidated and renamed several theories. In particular:
9470 Ord.thy has been absorbed into HOL.thy
9471 String.thy has been absorbed into List.thy
9473 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
9474 (beware of argument permutation!);
9476 * HOL: linorder_less_split superseded by linorder_cases;
9478 * HOL/List: "nodups" renamed to "distinct";
9480 * HOL: added "The" definite description operator; move Hilbert's "Eps"
9481 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
9482 - Ex_def has changed, now need to use some_eq_ex
9484 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
9485 in this (rare) case use:
9487 delSWrapper "split_all_tac"
9488 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
9490 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
9493 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
9494 Isabelle's type classes, ^ on functions and relations has too general
9495 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
9496 necessary to attach explicit type constraints;
9498 * HOL/Relation: the prefix name of the infix "O" has been changed from
9499 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
9500 renamed accordingly (eg "compI" -> "rel_compI").
9502 * HOL: syntax translations now work properly with numerals and records
9505 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
9506 of "lam" -- INCOMPATIBILITY;
9508 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
9509 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
9510 renamed "Product_Type.unit";
9512 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
9514 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
9515 the "cases" method);
9517 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
9520 * HOL/IMP: updated and converted to new-style theory format; several
9521 parts turned into readable document, with proper Isar proof texts and
9522 some explanations (by Gerwin Klein);
9524 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
9526 * HOL-Hyperreal is now a logic image;
9531 * Isar: consts/constdefs supports mixfix syntax for continuous
9534 * Isar: domain package adapted to new-style theory format, e.g. see
9537 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
9538 potential INCOMPATIBILITY; now use plain induct_tac instead of former
9539 lift.induct_tac, always use UU instead of Undef;
9541 * HOLCF/IMP: updated and converted to new-style theory;
9546 * Isar: proper integration of logic-specific tools and packages,
9547 including theory commands '(co)inductive', '(co)datatype',
9548 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
9549 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
9551 * theory Main no longer includes AC; for the Axiom of Choice, base
9552 your theory on Main_ZFC;
9554 * the integer library now covers quotients and remainders, with many
9555 laws relating division to addition, multiplication, etc.;
9557 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
9558 typeless version of the formalism;
9560 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
9563 * ZF/Induct: new directory for examples of inductive definitions,
9564 including theory Multiset for multiset orderings; converted to
9565 new-style theory format;
9567 * ZF: many new theorems about lists, ordinals, etc.;
9572 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
9573 variable proof controls level of detail: 0 = no proofs (only oracle
9574 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
9575 also ref manual for further ML interfaces;
9577 * Pure/axclass: removed obsolete ML interface
9578 goal_subclass/goal_arity;
9580 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
9581 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
9582 separate tokens, so expressions involving minus need to be spaced
9585 * Pure/syntax: support non-oriented infixes, using keyword "infix"
9586 rather than "infixl" or "infixr";
9588 * Pure/syntax: concrete syntax for dummy type variables admits genuine
9589 sort constraint specifications in type inference; e.g. "x::_::foo"
9590 ensures that the type of "x" is of sort "foo" (but not necessarily a
9593 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
9594 control output of nested => (types); the default behavior is
9597 * Pure/syntax: builtin parse translation for "_constify" turns valued
9598 tokens into AST constants;
9600 * Pure/syntax: prefer later declarations of translations and print
9601 translation functions; potential INCOMPATIBILITY: need to reverse
9602 multiple declarations for same syntax element constant;
9604 * Pure/show_hyps reset by default (in accordance to existing Isar
9607 * Provers/classical: renamed addaltern to addafter, addSaltern to
9610 * Provers/clasimp: ``iff'' declarations now handle conditional rules
9613 * system: tested support for MacOS X; should be able to get Isabelle +
9614 Proof General to work in a plain Terminal after installing Poly/ML
9615 (e.g. from the Isabelle distribution area) and GNU bash alone
9616 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
9617 support requires further installations, e.g. from
9618 http://fink.sourceforge.net/);
9620 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
9622 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
9623 of 40 MB), cf. ML_OPTIONS;
9625 * system: Proof General keywords specification is now part of the
9626 Isabelle distribution (see etc/isar-keywords.el);
9628 * system: support for persistent Proof General sessions (refrain from
9629 outdating all loaded theories on startup); user may create writable
9630 logic images like this: ``isabelle -q HOL Test'';
9632 * system: smart selection of Isabelle process versus Isabelle
9633 interface, accommodates case-insensitive file systems (e.g. HFS+); may
9634 run both "isabelle" and "Isabelle" even if file names are badly
9635 damaged (executable inspects the case of the first letter of its own
9636 name); added separate "isabelle-process" and "isabelle-interface";
9638 * system: refrain from any attempt at filtering input streams; no
9639 longer support ``8bit'' encoding of old isabelle font, instead proper
9640 iso-latin characters may now be used; the related isatools
9641 "symbolinput" and "nonascii" have disappeared as well;
9643 * system: removed old "xterm" interface (the print modes "xterm" and
9644 "xterm_color" are still available for direct use in a suitable
9649 New in Isabelle99-2 (February 2001)
9650 -----------------------------------
9652 *** Overview of INCOMPATIBILITIES ***
9654 * HOL: please note that theories in the Library and elsewhere often use the
9655 new-style (Isar) format; to refer to their theorems in an ML script you must
9656 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
9658 * HOL: inductive package no longer splits induction rule aggressively,
9659 but only as far as specified by the introductions given; the old
9660 format may be recovered via ML function complete_split_rule or attribute
9661 'split_rule (complete)';
9663 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
9664 gfp_Tarski to gfp_unfold;
9666 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
9668 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
9669 relation); infix "^^" has been renamed "``"; infix "``" has been
9670 renamed "`"; "univalent" has been renamed "single_valued";
9672 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
9675 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
9677 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
9679 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
9680 consequence, it is no longer monotonic wrt. the local goal context
9681 (which is now passed through the inductive cases);
9683 * Document preparation: renamed standard symbols \<ll> to \<lless> and
9684 \<gg> to \<ggreater>;
9687 *** Document preparation ***
9689 * \isabellestyle{NAME} selects version of Isabelle output (currently
9690 available: are "it" for near math-mode best-style output, "sl" for
9691 slanted text style, and "tt" for plain type-writer; if no
9692 \isabellestyle command is given, output is according to slanted
9695 * support sub/super scripts (for single symbols only), input syntax is
9696 like this: "A\<^sup>*" or "A\<^sup>\<star>";
9698 * some more standard symbols; see Appendix A of the system manual for
9699 the complete list of symbols defined in isabellesym.sty;
9701 * improved isabelle style files; more abstract symbol implementation
9702 (should now use \isamath{...} and \isatext{...} in custom symbol
9705 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
9706 state; Note that presentation of goal states does not conform to
9707 actual human-readable proof documents. Please do not include goal
9708 states into document output unless you really know what you are doing!
9710 * proper indentation of antiquoted output with proportional LaTeX
9713 * no_document ML operator temporarily disables LaTeX document
9716 * isatool unsymbolize tunes sources for plain ASCII communication;
9721 * Pure: Isar now suffers initial goal statements to contain unbound
9722 schematic variables (this does not conform to actual readable proof
9723 documents, due to unpredictable outcome and non-compositional proof
9724 checking); users who know what they are doing may use schematic goals
9725 for Prolog-style synthesis of proven results;
9727 * Pure: assumption method (an implicit finishing) now handles actual
9730 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
9731 initial goal, declare "that" only as Pure intro (only for single
9732 steps); the "that" rule assumption may now be involved in implicit
9733 finishing, thus ".." becomes a feasible for trivial obtains;
9735 * Pure: default proof step now includes 'intro_classes'; thus trivial
9736 instance proofs may be performed by "..";
9738 * Pure: ?thesis / ?this / "..." now work for pure meta-level
9741 * Pure: more robust selection of calculational rules;
9743 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
9744 rule (as well as the assumption rule);
9746 * Pure: 'thm_deps' command visualizes dependencies of theorems and
9747 lemmas, using the graph browser tool;
9749 * Pure: predict failure of "show" in interactive mode;
9751 * Pure: 'thms_containing' now takes actual terms as arguments;
9753 * HOL: improved method 'induct' --- now handles non-atomic goals
9754 (potential INCOMPATIBILITY); tuned error handling;
9756 * HOL: cases and induct rules now provide explicit hints about the
9757 number of facts to be consumed (0 for "type" and 1 for "set" rules);
9758 any remaining facts are inserted into the goal verbatim;
9760 * HOL: local contexts (aka cases) may now contain term bindings as
9761 well; the 'cases' and 'induct' methods new provide a ?case binding for
9762 the result to be shown in each case;
9764 * HOL: added 'recdef_tc' command;
9766 * isatool convert assists in eliminating legacy ML scripts;
9771 * HOL/Library: a collection of generic theories to be used together
9772 with main HOL; the theory loader path already includes this directory
9773 by default; the following existing theories have been moved here:
9774 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
9775 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
9777 * HOL/Unix: "Some aspects of Unix file-system security", a typical
9778 modelling and verification task performed in Isabelle/HOL +
9779 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
9781 * HOL/Algebra: special summation operator SUM no longer exists, it has
9782 been replaced by setsum; infix 'assoc' now has priority 50 (like
9783 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
9784 'domain', this makes the theory consistent with mathematical
9787 * HOL basics: added overloaded operations "inverse" and "divide"
9788 (infix "/"), syntax for generic "abs" operation, generic summation
9791 * HOL/typedef: simplified package, provide more useful rules (see also
9794 * HOL/datatype: induction rule for arbitrarily branching datatypes is
9795 now expressed as a proper nested rule (old-style tactic scripts may
9796 require atomize_strip_tac to cope with non-atomic premises);
9798 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
9799 to "split_conv" (old name still available for compatibility);
9801 * HOL: improved concrete syntax for strings (e.g. allows translation
9802 rules with string literals);
9804 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
9805 and Fleuriot's mechanization of analysis, including the transcendental
9806 functions for the reals;
9808 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
9813 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
9814 "lam" is displayed as TWO lambda-symbols
9816 * CTT: theory Main now available, containing everything (that is, Bool
9822 * Pure: the Simplifier has been implemented properly as a derived rule
9823 outside of the actual kernel (at last!); the overall performance
9824 penalty in practical applications is about 50%, while reliability of
9825 the Isabelle inference kernel has been greatly improved;
9827 * print modes "brackets" and "no_brackets" control output of nested =>
9828 (types) and ==> (props); the default behaviour is "brackets";
9830 * Provers: fast_tac (and friends) now handle actual object-logic rules
9831 as assumptions as well;
9833 * system: support Poly/ML 4.0;
9835 * system: isatool install handles KDE version 1 or 2;
9839 New in Isabelle99-1 (October 2000)
9840 ----------------------------------
9842 *** Overview of INCOMPATIBILITIES ***
9844 * HOL: simplification of natural numbers is much changed; to partly
9845 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
9846 issue the following ML commands:
9848 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
9849 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
9851 * HOL: simplification no longer dives into case-expressions; this is
9852 controlled by "t.weak_case_cong" for each datatype t;
9854 * HOL: nat_less_induct renamed to less_induct;
9856 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
9857 fixsome to patch .thy and .ML sources automatically;
9859 select_equality -> some_equality
9860 select_eq_Ex -> some_eq_ex
9861 selectI2EX -> someI2_ex
9864 select1_equality -> some1_equality
9865 Eps_sym_eq -> some_sym_eq_trivial
9866 Eps_eq -> some_eq_trivial
9868 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
9870 * HOL: removed obsolete theorem binding expand_if (refer to split_if
9873 * HOL: the recursion equations generated by 'recdef' are now called
9874 f.simps instead of f.rules;
9876 * HOL: qed_spec_mp now also handles bounded ALL as well;
9878 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
9879 sometimes be needed;
9881 * HOL: the constant for "f``x" is now "image" rather than "op ``";
9883 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
9885 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
9886 product is now "<*>" instead of "Times"; the lexicographic product is
9887 now "<*lex*>" instead of "**";
9889 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
9890 of main HOL, but was unused); better use HOL's datatype package;
9892 * HOL: removed "symbols" syntax for constant "override" of theory Map;
9893 the old syntax may be recovered as follows:
9896 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
9897 (infixl "\\<oplus>" 100)
9899 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9901 * HOL/ML: even fewer consts are declared as global (see theories Ord,
9902 Lfp, Gfp, WF); this only affects ML packages that refer to const names
9905 * HOL and ZF: syntax for quotienting wrt an equivalence relation
9906 changed from A/r to A//r;
9908 * ZF: new treatment of arithmetic (nat & int) may break some old
9911 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
9912 rulify -> rule_format, elimify -> elim_format, ...);
9914 * Isar/Provers: intro/elim/dest attributes changed; renamed
9915 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
9916 should have to change intro!! to intro? only); replaced "delrule" by
9919 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
9921 * Provers: strengthened force_tac by using new first_best_tac;
9923 * LaTeX document preparation: several changes of isabelle.sty (see
9927 *** Document preparation ***
9929 * formal comments (text blocks etc.) in new-style theories may now
9930 contain antiquotations of thm/prop/term/typ/text to be presented
9931 according to latex print mode; concrete syntax is like this:
9932 @{term[show_types] "f(x) = a + x"};
9934 * isatool mkdir provides easy setup of Isabelle session directories,
9935 including proper document sources;
9937 * generated LaTeX sources are now deleted after successful run
9938 (isatool document -c); may retain a copy somewhere else via -D option
9941 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
9942 style files, achieving self-contained LaTeX sources and simplifying
9945 * old-style theories now produce (crude) LaTeX output as well;
9947 * browser info session directories are now self-contained (may be put
9948 on WWW server seperately); improved graphs of nested sessions; removed
9949 graph for 'all sessions';
9951 * several improvements in isabelle style files; \isabellestyle{it}
9952 produces fake math mode output; \isamarkupheader is now \section by
9953 default; see lib/texinputs/isabelle.sty etc.;
9958 * Isar/Pure: local results and corresponding term bindings are now
9959 subject to Hindley-Milner polymorphism (similar to ML); this
9960 accommodates incremental type-inference very nicely;
9962 * Isar/Pure: new derived language element 'obtain' supports
9963 generalized existence reasoning;
9965 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
9966 support accumulation of results, without applying any rules yet;
9967 useful to collect intermediate results without explicit name
9968 references, and for use with transitivity rules with more than 2
9971 * Isar/Pure: scalable support for case-analysis type proofs: new
9972 'case' language element refers to local contexts symbolically, as
9973 produced by certain proof methods; internally, case names are attached
9974 to theorems as "tags";
9976 * Isar/Pure: theory command 'hide' removes declarations from
9977 class/type/const name spaces;
9979 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
9980 indicate potential overloading;
9982 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
9984 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
9985 "{a,b,c}" instead of {a,b,c};
9987 * Isar/Pure now provides its own version of intro/elim/dest
9988 attributes; useful for building new logics, but beware of confusion
9989 with the version in Provers/classical;
9991 * Isar/Pure: the local context of (non-atomic) goals is provided via
9992 case name 'antecedent';
9994 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
9995 to the current context is now done automatically);
9997 * Isar/Pure: theory command 'method_setup' provides a simple interface
9998 for definining proof methods in ML;
10000 * Isar/Provers: intro/elim/dest attributes changed; renamed
10001 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
10002 most cases, one should have to change intro!! to intro? only);
10003 replaced "delrule" by "rule del";
10005 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
10006 'symmetric' attribute (the latter supercedes [RS sym]);
10008 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
10009 method modifier); 'simp' method: 'only:' modifier removes loopers as
10010 well (including splits);
10012 * Isar/Provers: Simplifier and Classical methods now support all kind
10013 of modifiers used in the past, including 'cong', 'iff', etc.
10015 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
10016 of Simplifier and Classical reasoner);
10018 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
10019 now support named cases; major packages (inductive, datatype, primrec,
10020 recdef) support case names and properly name parameters;
10022 * Isar/HOL: new transitivity rules for substitution in inequalities --
10023 monotonicity conditions are extracted to be proven at end of
10026 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
10029 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
10030 split_if split_if_asm; datatype package provides theorems foo.splits =
10031 foo.split foo.split_asm for each datatype;
10033 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
10034 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
10035 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
10036 use "(cases (simplified))" method in proper proof texts);
10038 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
10040 * Isar: names of theorems etc. may be natural numbers as well;
10042 * Isar: 'pr' command: optional arguments for goals_limit and
10043 ProofContext.prems_limit; no longer prints theory contexts, but only
10046 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
10047 additional print modes to be specified; e.g. "pr(latex)" will print
10048 proof state according to the Isabelle LaTeX style;
10050 * Isar: improved support for emulating tactic scripts, including proof
10051 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
10052 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
10053 (for HOL datatypes);
10055 * Isar: simplified (more robust) goal selection of proof methods: 1st
10056 goal, all goals, or explicit goal specifier (tactic emulation); thus
10057 'proof method scripts' have to be in depth-first order;
10059 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
10061 * Isar: removed 'help' command, which hasn't been too helpful anyway;
10062 should instead use individual commands for printing items
10063 (print_commands, print_methods etc.);
10065 * Isar: added 'nothing' --- the empty list of theorems;
10070 * HOL/MicroJava: formalization of a fragment of Java, together with a
10071 corresponding virtual machine and a specification of its bytecode
10072 verifier and a lightweight bytecode verifier, including proofs of
10073 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
10074 Cornelia Pusch (see also the homepage of project Bali at
10075 http://isabelle.in.tum.de/Bali/);
10077 * HOL/Algebra: new theory of rings and univariate polynomials, by
10080 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
10081 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
10084 * HOL/Lattice: fundamental concepts of lattice theory and order
10085 structures, including duals, properties of bounds versus algebraic
10086 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
10087 Theorem for complete lattices etc.; may also serve as a demonstration
10088 for abstract algebraic reasoning using axiomatic type classes, and
10089 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
10091 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
10094 * HOL/IMPP: extension of IMP with local variables and mutually
10095 recursive procedures, by David von Oheimb;
10097 * HOL/Lambda: converted into new-style theory and document;
10099 * HOL/ex/Multiquote: example of multiple nested quotations and
10100 anti-quotations -- basically a generalized version of de-Bruijn
10101 representation; very useful in avoiding lifting of operations;
10103 * HOL/record: added general record equality rule to simpset; fixed
10104 select-update simplification procedure to handle extended records as
10105 well; admit "r" as field name;
10107 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
10108 other numeric types and also as the identity of groups, rings, etc.;
10110 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
10111 Types nat and int belong to this axclass;
10113 * HOL: greatly improved simplification involving numerals of type nat, int, real:
10114 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
10115 i*j + k + j*#3*i simplifies to #4*(i*j) + k
10116 two terms #m*u and #n*u are replaced by #(m+n)*u
10117 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
10118 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
10119 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
10121 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
10122 powerful prover for predicate logic but knows nothing of clasets; see
10123 ex/mesontest.ML and ex/mesontest2.ML for example applications;
10125 * HOL: new version of "case_tac" subsumes both boolean case split and
10126 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
10127 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
10129 * HOL: simplification no longer dives into case-expressions: only the
10130 selector expression is simplified, but not the remaining arms; to
10131 enable full simplification of case-expressions for datatype t, you may
10132 remove t.weak_case_cong from the simpset, either globally (Delcongs
10133 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
10135 * HOL/recdef: the recursion equations generated by 'recdef' for
10136 function 'f' are now called f.simps instead of f.rules; if all
10137 termination conditions are proved automatically, these simplification
10138 rules are added to the simpset, as in primrec; rules may be named
10139 individually as well, resulting in a separate list of theorems for
10142 * HOL/While is a new theory that provides a while-combinator. It
10143 permits the definition of tail-recursive functions without the
10144 provision of a termination measure. The latter is necessary once the
10145 invariant proof rule for while is applied.
10147 * HOL: new (overloaded) notation for the set of elements below/above
10148 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
10150 * HOL: theorems impI, allI, ballI bound as "strip";
10152 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
10153 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
10154 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
10156 * HOL/Real: "rabs" replaced by overloaded "abs" function;
10158 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
10159 main HOL, but was unused);
10161 * HOL: fewer consts declared as global (e.g. have to refer to
10162 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
10164 * HOL: tuned AST representation of nested pairs, avoiding bogus output
10165 in case of overlap with user translations (e.g. judgements over
10166 tuples); (note that the underlying logical represenation is still
10172 * ZF: simplification automatically cancels common terms in arithmetic
10173 expressions over nat and int;
10175 * ZF: new treatment of nat to minimize type-checking: all operators
10176 coerce their operands to a natural number using the function natify,
10177 making the algebraic laws unconditional;
10179 * ZF: as above, for int: operators coerce their operands to an integer
10180 using the function intify;
10182 * ZF: the integer library now contains many of the usual laws for the
10183 orderings, including $<=, and monotonicity laws for $+ and $*;
10185 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
10188 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
10189 to the simplifier and classical reasoner simultaneously;
10194 * Provers: blast_tac now handles actual object-logic rules as
10195 assumptions; note that auto_tac uses blast_tac internally as well;
10197 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
10198 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
10200 * Provers: delrules now handles destruct rules as well (no longer need
10201 explicit make_elim);
10203 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
10204 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10205 use instead the strong form,
10206 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10207 in HOL, FOL and ZF the function cla_make_elim will create such rules
10208 from destruct-rules;
10210 * Provers: Simplifier.easy_setup provides a fast path to basic
10211 Simplifier setup for new object-logics;
10213 * Pure: AST translation rules no longer require constant head on LHS;
10215 * Pure: improved name spaces: ambiguous output is qualified; support
10216 for hiding of names;
10218 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
10219 XSYMBOL_HOME; no longer need to do manual configuration in most
10222 * system: compression of ML heaps images may now be controlled via -c
10223 option of isabelle and isatool usedir (currently only observed by
10226 * system: isatool installfonts may handle X-Symbol fonts as well (very
10227 useful for remote X11);
10229 * system: provide TAGS file for Isabelle sources;
10231 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
10234 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
10235 timing flag supersedes proof_timing and Toplevel.trace;
10237 * ML: new combinators |>> and |>>> for incremental transformations
10238 with secondary results (e.g. certain theory extensions):
10240 * ML: PureThy.add_defs gets additional argument to indicate potential
10241 overloading (usually false);
10243 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
10248 New in Isabelle99 (October 1999)
10249 --------------------------------
10251 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10253 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
10254 are no longer simplified. (This allows the simplifier to unfold recursive
10255 functional programs.) To restore the old behaviour, declare
10257 Delcongs [if_weak_cong];
10259 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
10262 * HOL: the predicate "inj" is now defined by translation to "inj_on";
10264 * HOL/datatype: mutual_induct_tac no longer exists --
10265 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
10267 * HOL/typedef: fixed type inference for representing set; type
10268 arguments now have to occur explicitly on the rhs as type constraints;
10270 * ZF: The con_defs part of an inductive definition may no longer refer
10271 to constants declared in the same theory;
10273 * HOL, ZF: the function mk_cases, generated by the inductive
10274 definition package, has lost an argument. To simplify its result, it
10275 uses the default simpset instead of a supplied list of theorems.
10277 * HOL/List: the constructors of type list are now Nil and Cons;
10279 * Simplifier: the type of the infix ML functions
10280 setSSolver addSSolver setSolver addSolver
10281 is now simpset * solver -> simpset where `solver' is a new abstract type
10282 for packaging solvers. A solver is created via
10283 mk_solver: string -> (thm list -> int -> tactic) -> solver
10284 where the string argument is only a comment.
10287 *** Proof tools ***
10289 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
10290 decision procedure for linear arithmetic. Currently it is used for
10291 types `nat', `int', and `real' in HOL (see below); it can, should and
10292 will be instantiated for other types and logics as well.
10294 * The simplifier now accepts rewrite rules with flexible heads, eg
10295 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
10296 They are applied like any rule with a non-pattern lhs, i.e. by first-order
10302 * New Isabelle/Isar subsystem provides an alternative to traditional
10303 tactical theorem proving; together with the ProofGeneral/isar user
10304 interface it offers an interactive environment for developing human
10305 readable proof documents (Isar == Intelligible semi-automated
10306 reasoning); for further information see isatool doc isar-ref,
10307 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
10309 * improved and simplified presentation of theories: better HTML markup
10310 (including colors), graph views in several sizes; isatool usedir now
10311 provides a proper interface for user theories (via -P option); actual
10312 document preparation based on (PDF)LaTeX is available as well (for
10313 new-style theories only); see isatool doc system for more information;
10315 * native support for Proof General, both for classic Isabelle and
10318 * ML function thm_deps visualizes dependencies of theorems and lemmas,
10319 using the graph browser tool;
10321 * Isabelle manuals now also available as PDF;
10323 * theory loader rewritten from scratch (may not be fully
10324 bug-compatible); old loadpath variable has been replaced by show_path,
10325 add_path, del_path, reset_path functions; new operations such as
10326 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
10329 * improved isatool install: option -k creates KDE application icon,
10330 option -p DIR installs standalone binaries;
10332 * added ML_PLATFORM setting (useful for cross-platform installations);
10333 more robust handling of platform specific ML images for SML/NJ;
10335 * the settings environment is now statically scoped, i.e. it is never
10336 created again in sub-processes invoked from isabelle, isatool, or
10339 * path element specification '~~' refers to '$ISABELLE_HOME';
10341 * in locales, the "assumes" and "defines" parts may be omitted if
10344 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
10347 * new print_mode "HTML";
10349 * new flag show_tags controls display of tags of theorems (which are
10350 basically just comments that may be attached by some tools);
10352 * Isamode 2.6 requires patch to accomodate change of Isabelle font
10353 mode and goal output format:
10355 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
10357 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
10359 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
10360 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
10362 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
10364 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
10366 * function bind_thms stores lists of theorems (cf. bind_thm);
10368 * new shorthand tactics ftac, eatac, datac, fatac;
10370 * qed (and friends) now accept "" as result name; in that case the
10371 theorem is not stored, but proper checks and presentation of the
10372 result still apply;
10374 * theorem database now also indexes constants "Trueprop", "all",
10375 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
10380 ** HOL arithmetic **
10382 * There are now decision procedures for linear arithmetic over nat and
10385 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
10386 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
10387 are treated as atomic; subformulae not involving type `nat' or `int'
10388 are ignored; quantified subformulae are ignored unless they are
10389 positive universal or negative existential. The tactic has to be
10390 invoked by hand and can be a little bit slow. In particular, the
10391 running time is exponential in the number of occurrences of `min' and
10392 `max', and `-' on `nat'.
10394 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
10395 (negated) (in)equalities among the premises and the conclusion into
10396 account (i.e. no compound formulae) and does not know about `min' and
10397 `max', and `-' on `nat'. It is fast and is used automatically by the
10400 NB: At the moment, these decision procedures do not cope with mixed
10401 nat/int formulae where the two parts interact, such as `m < n ==>
10404 * HOL/Numeral provides a generic theory of numerals (encoded
10405 efficiently as bit strings); setup for types nat/int/real is in place;
10406 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
10407 int, existing theories and proof scripts may require a few additional
10410 * integer division and remainder can now be performed on constant
10413 * many properties of integer multiplication, division and remainder
10416 * An interface to the Stanford Validity Checker (SVC) is available through the
10417 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
10418 are proved automatically. SVC must be installed separately, and its results
10419 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
10420 invocation of the underlying oracle). For SVC see
10421 http://verify.stanford.edu/SVC
10423 * IsaMakefile: the HOL-Real target now builds an actual image;
10428 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
10429 (in Isabelle/Isar) -- by Gertrud Bauer;
10431 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
10432 analysis for assembly languages with subtypes;
10434 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
10435 -- avoids syntactic ambiguities and treats state, transition, and
10436 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
10437 changed syntax and (many) tactics;
10439 * HOL/inductive: Now also handles more general introduction rules such
10440 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
10441 theorems are now maintained within the theory (maintained via the
10444 * HOL/datatype: Now also handles arbitrarily branching datatypes
10445 (using function types) such as
10447 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
10449 * HOL/record: record_simproc (part of the default simpset) takes care
10450 of selectors applied to updated records; record_split_tac is no longer
10451 part of the default claset; update_defs may now be removed from the
10452 simpset in many cases; COMPATIBILITY: old behavior achieved by
10454 claset_ref () := claset() addSWrapper record_split_wrapper;
10455 Delsimprocs [record_simproc]
10457 * HOL/typedef: fixed type inference for representing set; type
10458 arguments now have to occur explicitly on the rhs as type constraints;
10460 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
10461 names rather than an ML expression;
10463 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
10464 supplied later. Program schemes can be defined, such as
10465 "While B C s = (if B s then While B C (C s) else s)"
10466 where the well-founded relation can be chosen after B and C have been given.
10468 * HOL/List: the constructors of type list are now Nil and Cons;
10469 INCOMPATIBILITY: while [] and infix # syntax is still there, of
10470 course, ML tools referring to List.list.op # etc. have to be adapted;
10472 * HOL_quantifiers flag superseded by "HOL" print mode, which is
10473 disabled by default; run isabelle with option -m HOL to get back to
10474 the original Gordon/HOL-style output;
10476 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
10477 ALL x<=y. P, EX x<y. P, EX x<=y. P;
10479 * HOL basic syntax simplified (more orthogonal): all variants of
10480 All/Ex now support plain / symbolic / HOL notation; plain syntax for
10481 Eps operator is provided as well: "SOME x. P[x]";
10483 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
10485 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
10486 thus available for user theories;
10488 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
10489 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
10492 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
10493 several times and then mp;
10498 * the notation <<...>> is now available as a notation for sequences of
10501 * the simplifier is now installed
10503 * the axiom system has been generalized (thanks to Soren Heilmann)
10505 * the classical reasoner now has a default rule database
10510 * new primrec section allows primitive recursive functions to be given
10511 directly (as in HOL) over datatypes and the natural numbers;
10513 * new tactics induct_tac and exhaust_tac for induction (or case
10514 analysis) over datatypes and the natural numbers;
10516 * the datatype declaration of type T now defines the recursor T_rec;
10518 * simplification automatically does freeness reasoning for datatype
10521 * automatic type-inference, with AddTCs command to insert new
10522 type-checking rules;
10524 * datatype introduction rules are now added as Safe Introduction rules
10527 * the syntax "if P then x else y" is now available in addition to
10531 *** Internal programming interfaces ***
10533 * tuned simplifier trace output; new flag debug_simp;
10535 * structures Vartab / Termtab (instances of TableFun) offer efficient
10536 tables indexed by indexname_ord / term_ord (compatible with aconv);
10538 * AxClass.axclass_tac lost the theory argument;
10540 * tuned current_goals_markers semantics: begin / end goal avoids
10541 printing empty lines;
10543 * removed prs and prs_fn hook, which was broken because it did not
10544 include \n in its semantics, forcing writeln to add one
10545 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
10546 string -> unit if you really want to output text without newline;
10548 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
10549 plain output, interface builders may have to enable 'isabelle_font'
10550 mode to get Isabelle font glyphs as before;
10552 * refined token_translation interface; INCOMPATIBILITY: output length
10553 now of type real instead of int;
10555 * theory loader actions may be traced via new ThyInfo.add_hook
10556 interface (see src/Pure/Thy/thy_info.ML); example application: keep
10557 your own database of information attached to *whole* theories -- as
10558 opposed to intra-theory data slots offered via TheoryDataFun;
10560 * proper handling of dangling sort hypotheses (at last!);
10561 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
10562 extra sort hypotheses that can be witnessed from the type signature;
10563 the force_strip_shyps flag is gone, any remaining shyps are simply
10564 left in the theorem (with a warning issued by strip_shyps_warning);
10568 New in Isabelle98-1 (October 1998)
10569 ----------------------------------
10571 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10573 * several changes of automated proof tools;
10575 * HOL: major changes to the inductive and datatype packages, including
10576 some minor incompatibilities of theory syntax;
10578 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
10581 * HOL: removed duplicate thms in Arith:
10582 less_imp_add_less should be replaced by trans_less_add1
10583 le_imp_add_le should be replaced by trans_le_add1
10585 * HOL: unary minus is now overloaded (new type constraints may be
10588 * HOL and ZF: unary minus for integers is now #- instead of #~. In
10589 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
10590 now taken as an integer constant.
10592 * Pure: ML function 'theory_of' renamed to 'theory';
10595 *** Proof tools ***
10598 1. Asm_full_simp_tac is now more aggressive.
10599 1. It will sometimes reorient premises if that increases their power to
10601 2. It does no longer proceed strictly from left to right but may also
10602 rotate premises to achieve further simplification.
10603 For compatibility reasons there is now Asm_lr_simp_tac which is like the
10604 old Asm_full_simp_tac in that it does not rotate premises.
10605 2. The simplifier now knows a little bit about nat-arithmetic.
10607 * Classical reasoner: wrapper mechanism for the classical reasoner now
10608 allows for selected deletion of wrappers, by introduction of names for
10609 wrapper functionals. This implies that addbefore, addSbefore,
10610 addaltern, and addSaltern now take a pair (name, tactic) as argument,
10611 and that adding two tactics with the same name overwrites the first
10612 one (emitting a warning).
10613 type wrapper = (int -> tactic) -> (int -> tactic)
10614 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
10615 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
10616 delWrapper, delSWrapper: claset * string -> claset
10617 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
10619 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
10620 semantics; addbefore now affects only the unsafe part of step_tac
10621 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
10622 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
10625 * Classical reasoner: setwrapper to setWrapper and compwrapper to
10626 compWrapper; added safe wrapper (and access functions for it);
10628 * HOL/split_all_tac is now much faster and fails if there is nothing
10629 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
10630 and the names of the automatically generated variables have changed.
10631 split_all_tac has moved within claset() from unsafe wrappers to safe
10632 wrappers, which means that !!-bound variables are split much more
10633 aggressively, and safe_tac and clarify_tac now split such variables.
10634 If this splitting is not appropriate, use delSWrapper "split_all_tac".
10635 Note: the same holds for record_split_tac, which does the job of
10636 split_all_tac for record fields.
10638 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
10639 permanently to the default simpset using Addsplits just like
10640 Addsimps. They can be removed via Delsplits just like
10641 Delsimps. Lower-case versions are also available.
10643 * HOL/Simplifier: The rule split_if is now part of the default
10644 simpset. This means that the simplifier will eliminate all occurrences
10645 of if-then-else in the conclusion of a goal. To prevent this, you can
10646 either remove split_if completely from the default simpset by
10647 `Delsplits [split_if]' or remove it in a specific call of the
10648 simplifier using `... delsplits [split_if]'. You can also add/delete
10649 other case splitting rules to/from the default simpset: every datatype
10650 generates suitable rules `split_t_case' and `split_t_case_asm' (where
10651 t is the name of the datatype).
10653 * Classical reasoner / Simplifier combination: new force_tac (and
10654 derivatives Force_tac, force) combines rewriting and classical
10655 reasoning (and whatever other tools) similarly to auto_tac, but is
10656 aimed to solve the given subgoal completely.
10661 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
10662 and `goalw': the theory is no longer needed as an explicit argument -
10663 the current theory context is used; assumptions are no longer returned
10664 at the ML-level unless one of them starts with ==> or !!; it is
10665 recommended to convert to these new commands using isatool fixgoal
10666 (backup your sources first!);
10668 * new top-level commands 'thm' and 'thms' for retrieving theorems from
10669 the current theory context, and 'theory' to lookup stored theories;
10671 * new theory section 'locale' for declaring constants, assumptions and
10672 definitions that have local scope;
10674 * new theory section 'nonterminals' for purely syntactic types;
10676 * new theory section 'setup' for generic ML setup functions
10677 (e.g. package initialization);
10679 * the distribution now includes Isabelle icons: see
10680 lib/logo/isabelle-{small,tiny}.xpm;
10682 * isatool install - install binaries with absolute references to
10685 * isatool logo -- create instances of the Isabelle logo (as EPS);
10687 * print mode 'emacs' reserved for Isamode;
10689 * support multiple print (ast) translations per constant name;
10691 * theorems involving oracles are now printed with a suffixed [!];
10696 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
10698 * HOL/inductive package reorganized and improved: now supports mutual
10699 definitions such as
10704 oddI "n : EVEN ==> Suc n : ODD"
10705 evenI "n : ODD ==> Suc n : EVEN"
10707 new theorem list "elims" contains an elimination rule for each of the
10708 recursive sets; inductive definitions now handle disjunctive premises
10709 correctly (also ZF);
10711 INCOMPATIBILITIES: requires Inductive as an ancestor; component
10712 "mutual_induct" no longer exists - the induction rule is always
10713 contained in "induct";
10716 * HOL/datatype package re-implemented and greatly improved: now
10717 supports mutually recursive datatypes such as
10720 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
10721 | SUM ('a aexp) ('a aexp)
10722 | DIFF ('a aexp) ('a aexp)
10725 'a bexp = LESS ('a aexp) ('a aexp)
10726 | AND ('a bexp) ('a bexp)
10727 | OR ('a bexp) ('a bexp)
10729 as well as indirectly recursive datatypes such as
10732 ('a, 'b) term = Var 'a
10733 | App 'b ((('a, 'b) term) list)
10735 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
10736 induction on mutually / indirectly recursive datatypes.
10738 Primrec equations are now stored in theory and can be accessed via
10739 <function_name>.simps.
10743 - Theories using datatypes must now have theory Datatype as an
10745 - The specific <typename>.induct_tac no longer exists - use the
10746 generic induct_tac instead.
10747 - natE has been renamed to nat.exhaust - use exhaust_tac
10748 instead of res_inst_tac ... natE. Note that the variable
10749 names in nat.exhaust differ from the names in natE, this
10750 may cause some "fragile" proofs to fail.
10751 - The theorems split_<typename>_case and split_<typename>_case_asm
10752 have been renamed to <typename>.split and <typename>.split_asm.
10753 - Since default sorts of type variables are now handled correctly,
10754 some datatype definitions may have to be annotated with explicit
10756 - Primrec definitions no longer require function name and type
10757 of recursive argument.
10759 Consider using isatool fixdatatype to adapt your theories and proof
10760 scripts to the new package (backup your sources first!).
10763 * HOL/record package: considerably improved implementation; now
10764 includes concrete syntax for record types, terms, updates; theorems
10765 for surjective pairing and splitting !!-bound record variables; proof
10766 support is as follows:
10768 1) standard conversions (selectors or updates applied to record
10769 constructor terms) are part of the standard simpset;
10771 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
10772 made part of standard simpset and claset via addIffs;
10774 3) a tactic for record field splitting (record_split_tac) is part of
10775 the standard claset (addSWrapper);
10777 To get a better idea about these rules you may retrieve them via
10778 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
10779 the name of your record type.
10781 The split tactic 3) conceptually simplifies by the following rule:
10783 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
10785 Thus any record variable that is bound by meta-all will automatically
10786 blow up into some record constructor term, consequently the
10787 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
10788 solve record problems automatically.
10791 * reorganized the main HOL image: HOL/Integ and String loaded by
10792 default; theory Main includes everything;
10794 * automatic simplification of integer sums and comparisons, using cancellation;
10796 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
10798 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
10800 * many new identities for unions, intersections, set difference, etc.;
10802 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
10803 called split_if, split_split, split_sum_case and split_nat_case (to go
10804 with add/delsplits);
10806 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
10807 (?x::unit) = (); this is made part of the default simpset, which COULD
10808 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
10809 'Delsimprocs [unit_eq_proc];' as last resort); also note that
10810 unit_abs_eta_conv is added in order to counter the effect of
10811 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
10814 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
10817 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10818 It and 'sym RS equals0D' are now in the default claset, giving automatic
10819 disjointness reasoning but breaking a few old proofs.
10821 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
10822 to 'converse' from 'inverse' (for compatibility with ZF and some
10825 * HOL/recdef can now declare non-recursive functions, with {} supplied as
10826 the well-founded relation;
10828 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
10829 Compl A. The "Compl" syntax remains available as input syntax for this
10832 * HOL/Update: new theory of function updates:
10833 f(a:=b) == %x. if x=a then b else f x
10834 may also be iterated as in f(a:=b,c:=d,...);
10836 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
10839 - new function list_update written xs[i:=v] that updates the i-th
10840 list position. May also be iterated as in xs[i:=a,j:=b,...].
10841 - new function `upt' written [i..j(] which generates the list
10842 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
10843 bound write [i..j], which is a shorthand for [i..j+1(].
10844 - new lexicographic orderings and corresponding wellfoundedness theorems.
10847 - removed 'pred' (predecessor) function;
10848 - generalized some theorems about n-1;
10849 - many new laws about "div" and "mod";
10850 - new laws about greatest common divisors (see theory ex/Primes);
10852 * HOL/Relation: renamed the relational operator r^-1 "converse"
10853 instead of "inverse";
10855 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
10856 of the multiset ordering;
10858 * directory HOL/Real: a construction of the reals using Dedekind cuts
10859 (not included by default);
10861 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
10863 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
10864 programs, i.e. different program variables may have different types.
10866 * calling (stac rew i) now fails if "rew" has no effect on the goal
10867 [previously, this check worked only if the rewrite rule was unconditional]
10868 Now rew can involve either definitions or equalities (either == or =).
10873 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
10874 only the theorems proved on ZF.ML;
10876 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10877 It and 'sym RS equals0D' are now in the default claset, giving automatic
10878 disjointness reasoning but breaking a few old proofs.
10880 * ZF/Update: new theory of function updates
10881 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
10882 may also be iterated as in f(a:=b,c:=d,...);
10884 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
10886 * calling (stac rew i) now fails if "rew" has no effect on the goal
10887 [previously, this check worked only if the rewrite rule was unconditional]
10888 Now rew can involve either definitions or equalities (either == or =).
10890 * case_tac provided for compatibility with HOL
10891 (like the old excluded_middle_tac, but with subgoals swapped)
10894 *** Internal programming interfaces ***
10896 * Pure: several new basic modules made available for general use, see
10897 also src/Pure/README;
10899 * improved the theory data mechanism to support encapsulation (data
10900 kind name replaced by private Object.kind, acting as authorization
10901 key); new type-safe user interface via functor TheoryDataFun; generic
10902 print_data function becomes basically useless;
10904 * removed global_names compatibility flag -- all theory declarations
10905 are qualified by default;
10907 * module Pure/Syntax now offers quote / antiquote translation
10908 functions (useful for Hoare logic etc. with implicit dependencies);
10909 see HOL/ex/Antiquote for an example use;
10911 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
10914 * new tactical CHANGED_GOAL for checking that a tactic modifies a
10917 * Display.print_goals function moved to Locale.print_goals;
10919 * standard print function for goals supports current_goals_markers
10920 variable for marking begin of proof, end of proof, start of goal; the
10921 default is ("", "", ""); setting current_goals_markers := ("<proof>",
10922 "</proof>", "<goal>") causes SGML like tagged proof state printing,
10927 New in Isabelle98 (January 1998)
10928 --------------------------------
10930 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10932 * changed lexical syntax of terms / types: dots made part of long
10933 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
10935 * simpset (and claset) reference variable replaced by functions
10936 simpset / simpset_ref;
10938 * no longer supports theory aliases (via merge) and non-trivial
10939 implicit merge of thms' signatures;
10941 * most internal names of constants changed due to qualified names;
10943 * changed Pure/Sequence interface (see Pure/seq.ML);
10946 *** General Changes ***
10948 * hierachically structured name spaces (for consts, types, axms, thms
10949 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
10950 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
10951 isatool fixdots ensures space after dots (e.g. "%x. x"); set
10952 long_names for fully qualified output names; NOTE: ML programs
10953 (special tactics, packages etc.) referring to internal names may have
10954 to be adapted to cope with fully qualified names; in case of severe
10955 backward campatibility problems try setting 'global_names' at compile
10956 time to have enrything declared within a flat name space; one may also
10957 fine tune name declarations in theories via the 'global' and 'local'
10960 * reimplemented the implicit simpset and claset using the new anytype
10961 data filed in signatures; references simpset:simpset ref etc. are
10962 replaced by functions simpset:unit->simpset and
10963 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
10964 to patch your ML files accordingly;
10966 * HTML output now includes theory graph data for display with Java
10967 applet or isatool browser; data generated automatically via isatool
10968 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
10970 * defs may now be conditional; improved rewrite_goals_tac to handle
10971 conditional equations;
10973 * defs now admits additional type arguments, using TYPE('a) syntax;
10975 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
10976 creates a new theory node; implicit merge of thms' signatures is
10977 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
10978 transfer:theory->thm->thm in (rare) cases;
10980 * improved handling of draft signatures / theories; draft thms (and
10981 ctyps, cterms) are automatically promoted to real ones;
10983 * slightly changed interfaces for oracles: admit many per theory, named
10984 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
10986 * print_goals: optional output of const types (set show_consts and
10989 * improved output of warnings (###) and errors (***);
10991 * subgoal_tac displays a warning if the new subgoal has type variables;
10993 * removed old README and Makefiles;
10995 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
10997 * removed obsolete init_pps and init_database;
10999 * deleted the obsolete tactical STATE, which was declared by
11000 fun STATE tacfun st = tacfun st st;
11002 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
11003 (which abbreviates $HOME);
11005 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
11006 use isatool fixseq to adapt your ML programs (this works for fully
11007 qualified references to the Sequence structure only!);
11009 * use_thy no longer requires writable current directory; it always
11010 reloads .ML *and* .thy file, if either one is out of date;
11013 *** Classical Reasoner ***
11015 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
11016 tactics that use classical reasoning to simplify a subgoal without
11017 splitting it into several subgoals;
11019 * Safe_tac: like safe_tac but uses the default claset;
11024 * added simplification meta rules:
11025 (asm_)(full_)simplify: simpset -> thm -> thm;
11027 * simplifier.ML no longer part of Pure -- has to be loaded by object
11030 * added prems argument to simplification procedures;
11032 * HOL, FOL, ZF: added infix function `addsplits':
11033 instead of `<simpset> setloop (split_tac <thms>)'
11034 you can simply write `<simpset> addsplits <thms>'
11039 * TYPE('a) syntax for type reflection terms;
11041 * no longer handles consts with name "" -- declare as 'syntax' instead;
11043 * pretty printer: changed order of mixfix annotation preference (again!);
11045 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
11050 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
11051 with `addloop' of the simplifier to faciliate case splitting in premises.
11053 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
11055 * HOL/Auth: new protocol proofs including some for the Internet
11058 * HOL/Map: new theory of `maps' a la VDM;
11060 * HOL/simplifier: simplification procedures nat_cancel_sums for
11061 cancelling out common nat summands from =, <, <= (in)equalities, or
11062 differences; simplification procedures nat_cancel_factor for
11063 cancelling common factor from =, <, <= (in)equalities over natural
11064 sums; nat_cancel contains both kinds of procedures, it is installed by
11065 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
11067 * HOL/simplifier: terms of the form
11068 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
11070 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
11071 and those of the form
11072 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
11074 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
11077 Each datatype `t' now comes with a theorem `split_t_case' of the form
11079 P(t_case f1 ... fn x) =
11080 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
11082 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
11085 and a theorem `split_t_case_asm' of the form
11087 P(t_case f1 ... fn x) =
11088 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
11090 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
11092 which can be added to a simpset via `addsplits'. The existing theorems
11093 expand_list_case and expand_option_case have been renamed to
11094 split_list_case and split_option_case.
11097 - `pred n' is automatically converted to `n-1'.
11098 Users are strongly encouraged not to use `pred' any longer,
11099 because it will disappear altogether at some point.
11100 - Users are strongly encouraged to write "0 < n" rather than
11101 "n ~= 0". Theorems and proof tools have been modified towards this
11105 the function "set_of_list" has been renamed "set" (and its theorems too);
11106 the function "nth" now takes its arguments in the reverse order and
11107 has acquired the infix notation "!" as in "xs!n".
11109 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
11111 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
11112 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
11114 * HOL/record: extensible records with schematic structural subtyping
11115 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
11116 still lacks various theorems and concrete record syntax;
11121 * removed "axioms" and "generated by" sections;
11123 * replaced "ops" section by extended "consts" section, which is capable of
11124 handling the continuous function space "->" directly;
11127 . proves theorems immediately and stores them in the theory,
11128 . creates hierachical name space,
11129 . now uses normal mixfix annotations (instead of cinfix...),
11130 . minor changes to some names and values (for consistency),
11131 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
11132 . separator between mutual domain defs: changed "," to "and",
11133 . improved handling of sort constraints; now they have to
11134 appear on the left-hand side of the equations only;
11136 * fixed LAM <x,y,zs>.b syntax;
11138 * added extended adm_tac to simplifier in HOLCF -- can now discharge
11139 adm (%x. P (t x)), where P is chainfinite and t continuous;
11144 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
11145 with `addloop' of the simplifier to faciliate case splitting in premises.
11147 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
11148 in HOL, they strip ALL and --> from proved theorems;
11152 New in Isabelle94-8 (May 1997)
11153 ------------------------------
11155 *** General Changes ***
11157 * new utilities to build / run / maintain Isabelle etc. (in parts
11158 still somewhat experimental); old Makefiles etc. still functional;
11160 * new 'Isabelle System Manual';
11162 * INSTALL text, together with ./configure and ./build scripts;
11164 * reimplemented type inference for greater efficiency, better error
11165 messages and clean internal interface;
11167 * prlim command for dealing with lots of subgoals (an easier way of
11168 setting goals_limit);
11173 * supports alternative (named) syntax tables (parser and pretty
11174 printer); internal interface is provided by add_modesyntax(_i);
11176 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
11177 be used in conjunction with the Isabelle symbol font; uses the
11178 "symbols" syntax table;
11180 * added token_translation interface (may translate name tokens in
11181 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
11182 the current print_mode); IMPORTANT: user print translation functions
11183 are responsible for marking newly introduced bounds
11184 (Syntax.mark_boundT);
11186 * token translations for modes "xterm" and "xterm_color" that display
11187 names in bold, underline etc. or colors (which requires a color
11190 * infixes may now be declared with names independent of their syntax;
11192 * added typed_print_translation (like print_translation, but may
11193 access type of constant);
11196 *** Classical Reasoner ***
11198 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
11199 some limitations. Blast_tac...
11200 + ignores addss, addbefore, addafter; this restriction is intrinsic
11201 + ignores elimination rules that don't have the correct format
11202 (the conclusion MUST be a formula variable)
11203 + ignores types, which can make HOL proofs fail
11204 + rules must not require higher-order unification, e.g. apply_type in ZF
11205 [message "Function Var's argument not a bound variable" relates to this]
11206 + its proof strategy is more general but can actually be slower
11208 * substitution with equality assumptions no longer permutes other
11211 * minor changes in semantics of addafter (now called addaltern); renamed
11212 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
11213 (and access functions for it);
11215 * improved combination of classical reasoner and simplifier:
11216 + functions for handling clasimpsets
11217 + improvement of addss: now the simplifier is called _after_ the
11219 + safe variant of addss called addSss: uses safe simplifications
11220 _during_ the safe steps. It is more complete as it allows multiple
11221 instantiations of unknowns (e.g. with slow_tac).
11225 * added interface for simplification procedures (functions that
11226 produce *proven* rewrite rules on the fly, depending on current
11229 * ordering on terms as parameter (used for ordered rewriting);
11231 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
11233 * the solver is now split into a safe and an unsafe part.
11234 This should be invisible for the normal user, except that the
11235 functions setsolver and addsolver have been renamed to setSolver and
11236 addSolver; added safe_asm_full_simp_tac;
11241 * a generic induction tactic `induct_tac' which works for all datatypes and
11242 also for type `nat';
11244 * a generic case distinction tactic `exhaust_tac' which works for all
11245 datatypes and also for type `nat';
11247 * each datatype comes with a function `size';
11249 * patterns in case expressions allow tuple patterns as arguments to
11250 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
11252 * primrec now also works with type nat;
11254 * recdef: a new declaration form, allows general recursive functions to be
11255 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
11257 * the constant for negation has been renamed from "not" to "Not" to
11258 harmonize with FOL, ZF, LK, etc.;
11260 * HOL/ex/LFilter theory of a corecursive "filter" functional for
11263 * HOL/Modelcheck demonstrates invocation of model checker oracle;
11265 * HOL/ex/Ring.thy declares cring_simp, which solves equational
11266 problems in commutative rings, using axiomatic type classes for + and *;
11268 * more examples in HOL/MiniML and HOL/Auth;
11270 * more default rewrite rules for quantifiers, union/intersection;
11272 * a new constant `arbitrary == @x.False';
11274 * HOLCF/IOA replaces old HOL/IOA;
11276 * HOLCF changes: derived all rules and arities
11277 + axiomatic type classes instead of classes
11278 + typedef instead of faking type definitions
11279 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
11280 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
11281 + eliminated the types void, one, tr
11282 + use unit lift and bool lift (with translations) instead of one and tr
11283 + eliminated blift from Lift3.thy (use Def instead of blift)
11284 all eliminated rules are derived as theorems --> no visible changes ;
11289 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
11290 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
11291 as ZF_cs addSIs [equalityI];
11295 New in Isabelle94-7 (November 96)
11296 ---------------------------------
11298 * allowing negative levels (as offsets) in prlev and choplev;
11300 * super-linear speedup for large simplifications;
11302 * FOL, ZF and HOL now use miniscoping: rewriting pushes
11303 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
11304 FAIL); can suppress it using the command Delsimps (ex_simps @
11305 all_simps); De Morgan laws are also now included, by default;
11307 * improved printing of ==> : ~:
11309 * new object-logic "Sequents" adds linear logic, while replacing LK
11310 and Modal (thanks to Sara Kalvala);
11312 * HOL/Auth: correctness proofs for authentication protocols;
11314 * HOL: new auto_tac combines rewriting and classical reasoning (many
11315 examples on HOL/Auth);
11317 * HOL: new command AddIffs for declaring theorems of the form P=Q to
11318 the rewriter and classical reasoner simultaneously;
11320 * function uresult no longer returns theorems in "standard" format;
11321 regain previous version by: val uresult = standard o uresult;
11325 New in Isabelle94-6
11326 -------------------
11328 * oracles -- these establish an interface between Isabelle and trusted
11329 external reasoners, which may deliver results as theorems;
11331 * proof objects (in particular record all uses of oracles);
11333 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
11335 * "constdefs" section in theory files;
11337 * "primrec" section (HOL) no longer requires names;
11339 * internal type "tactic" now simply "thm -> thm Sequence.seq";
11343 New in Isabelle94-5
11344 -------------------
11346 * reduced space requirements;
11348 * automatic HTML generation from theories;
11350 * theory files no longer require "..." (quotes) around most types;
11352 * new examples, including two proofs of the Church-Rosser theorem;
11354 * non-curried (1994) version of HOL is no longer distributed;
11358 New in Isabelle94-4
11359 -------------------
11361 * greatly reduced space requirements;
11363 * theory files (.thy) no longer require \...\ escapes at line breaks;
11365 * searchable theorem database (see the section "Retrieving theorems" on
11366 page 8 of the Reference Manual);
11368 * new examples, including Grabczewski's monumental case study of the
11371 * The previous version of HOL renamed to Old_HOL;
11373 * The new version of HOL (previously called CHOL) uses a curried syntax
11374 for functions. Application looks like f a b instead of f(a,b);
11376 * Mutually recursive inductive definitions finally work in HOL;
11378 * In ZF, pattern-matching on tuples is now available in all abstractions and
11379 translates to the operator "split";
11383 New in Isabelle94-3
11384 -------------------
11386 * new infix operator, addss, allowing the classical reasoner to
11387 perform simplification at each step of its search. Example:
11388 fast_tac (cs addss ss)
11390 * a new logic, CHOL, the same as HOL, but with a curried syntax
11391 for functions. Application looks like f a b instead of f(a,b). Also pairs
11392 look like (a,b) instead of <a,b>;
11394 * PLEASE NOTE: CHOL will eventually replace HOL!
11396 * In CHOL, pattern-matching on tuples is now available in all abstractions.
11397 It translates to the operator "split". A new theory of integers is available;
11399 * In ZF, integer numerals now denote two's-complement binary integers.
11400 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
11402 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
11403 of the Axiom of Choice;
11407 New in Isabelle94-2
11408 -------------------
11410 * Significantly faster resolution;
11412 * the different sections in a .thy file can now be mixed and repeated
11415 * Database of theorems for FOL, HOL and ZF. New
11416 commands including qed, qed_goal and bind_thm store theorems in the database.
11418 * Simple database queries: return a named theorem (get_thm) or all theorems of
11419 a given theory (thms_of), or find out what theory a theorem was proved in
11422 * Bugs fixed in the inductive definition and datatype packages;
11424 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
11425 and HOL_dup_cs obsolete;
11427 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
11430 * Simpler definition of function space in ZF;
11432 * new results about cardinal and ordinal arithmetic in ZF;
11434 * 'subtype' facility in HOL for introducing new types as subsets of existing
11437 :mode=isabelle-news:wrap=hard:maxLineLen=72: