store explicitly quotient types with no_code => more precise registration of code equations
1 Isabelle NEWS -- history of user-relevant changes
2 =================================================
4 New in Isabelle2014 (August 2014)
5 ---------------------------------
9 * Support for official Standard ML within the Isabelle context.
10 Command 'SML_file' reads and evaluates the given Standard ML file.
11 Toplevel bindings are stored within the theory context; the initial
12 environment is restricted to the Standard ML implementation of
13 Poly/ML, without the add-ons of Isabelle/ML. Commands 'SML_import'
14 and 'SML_export' allow to exchange toplevel bindings between the two
15 separate environments. See also ~~/src/Tools/SML/Examples.thy for
18 * Standard tactics and proof methods such as "clarsimp", "auto" and
19 "safe" now preserve equality hypotheses "x = expr" where x is a free
20 variable. Locale assumptions and chained facts containing "x"
21 continue to be useful. The new method "hypsubst_thin" and the
22 configuration option "hypsubst_thin" (within the attribute name space)
23 restore the previous behavior. INCOMPATIBILITY, especially where
24 induction is done after these methods or when the names of free and
25 bound variables clash. As first approximation, old proofs may be
26 repaired by "using [[hypsubst_thin = true]]" in the critical spot.
28 * More static checking of proof methods, which allows the system to
29 form a closure over the concrete syntax. Method arguments should be
30 processed in the original proof context as far as possible, before
31 operating on the goal state. In any case, the standard discipline for
32 subgoal-addressing needs to be observed: no subgoals or a subgoal
33 number that is out of range produces an empty result sequence, not an
34 exception. Potential INCOMPATIBILITY for non-conformant tactical
37 * Lexical syntax (inner and outer) supports text cartouches with
38 arbitrary nesting, and without escapes of quotes etc. The Prover IDE
39 supports input via ` (backquote).
41 * The outer syntax categories "text" (for formal comments and document
42 markup commands) and "altstring" (for literal fact references) allow
43 cartouches as well, in addition to the traditional mix of quotations.
45 * Syntax of document antiquotation @{rail} now uses \<newline> instead
46 of "\\", to avoid the optical illusion of escaped backslash within
47 string token. General renovation of its syntax using text cartouches.
48 Minor INCOMPATIBILITY.
50 * Discontinued legacy_isub_isup, which was a temporary workaround for
51 Isabelle/ML in Isabelle2013-1. The prover process no longer accepts
52 old identifier syntax with \<^isub> or \<^isup>. Potential
55 * Document antiquotation @{url} produces markup for the given URL,
56 which results in an active hyperlink within the text.
58 * Document antiquotation @{file_unchecked} is like @{file}, but does
59 not check existence within the file-system.
61 * Updated and extended manuals: codegen, datatypes, implementation,
62 isar-ref, jedit, system.
65 *** Prover IDE -- Isabelle/Scala/jEdit ***
67 * Improved Document panel: simplified interaction where every single
68 mouse click (re)opens document via desktop environment or as jEdit
71 * Support for Navigator plugin (with toolbar buttons), with connection
74 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.
75 Open text buffers take precedence over copies within the file-system.
77 * Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for
80 * Improved syntactic and semantic completion mechanism, with simple
81 templates, completion language context, name-space completion,
82 file-name completion, spell-checker completion.
84 * Refined GUI popup for completion: more robust key/mouse event
85 handling and propagation to enclosing text area -- avoid loosing
86 keystrokes with slow / remote graphics displays.
88 * Refined insertion of completion items wrt. jEdit text: multiple
89 selections, rectangular selections, rectangular selection as "tall
92 * Integrated spell-checker for document text, comments etc. with
93 completion popup and context-menu.
95 * More general "Query" panel supersedes "Find" panel, with GUI access
96 to commands 'find_theorems' and 'find_consts', as well as print
97 operations for the context. Minor incompatibility in keyboard
98 shortcuts etc.: replace action isabelle-find by isabelle-query.
100 * Search field for all output panels ("Output", "Query", "Info" etc.)
101 to highlight text via regular expression.
103 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /
104 General") allows to specify additional print modes for the prover
105 process, without requiring old-fashioned command-line invocation of
106 "isabelle jedit -m MODE".
108 * More support for remote files (e.g. http) using standard Java
109 networking operations instead of jEdit virtual file-systems.
111 * Improved Console/Scala plugin: more uniform scala.Console output,
112 more robust treatment of threads and interrupts.
114 * Improved management of dockable windows: clarified keyboard focus
115 and window placement wrt. main editor view; optional menu item to
116 "Detach" a copy where this makes sense.
118 * New Simplifier Trace panel provides an interactive view of the
119 simplification process, enabled by the "simp_trace_new" attribute
125 * Low-level type-class commands 'classes', 'classrel', 'arities' have
126 been discontinued to avoid the danger of non-trivial axiomatization
127 that is not immediately visible. INCOMPATIBILITY, use regular
128 'instance' command with proof. The required OFCLASS(...) theorem
129 might be postulated via 'axiomatization' beforehand, or the proof
130 finished trivially if the underlying class definition is made vacuous
131 (without any assumptions). See also Isabelle/ML operations
132 Axclass.class_axiomatization, Axclass.classrel_axiomatization,
133 Axclass.arity_axiomatization.
135 * Basic constants of Pure use more conventional names and are always
136 qualified. Rare INCOMPATIBILITY, but with potentially serious
137 consequences, notably for tools in Isabelle/ML. The following
138 renaming needs to be applied:
144 dummy_pattern ~> Pure.dummy_pattern
146 Systematic porting works by using the following theory setup on a
147 *previous* Isabelle version to introduce the new name accesses for the
153 |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="
154 |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"
155 |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"
156 |> Sign.restore_naming thy
159 Thus ML antiquotations like @{const_name Pure.eq} may be used already.
160 Later the application is moved to the current Isabelle version, and
161 the auxiliary aliases are deleted.
163 * Attributes "where" and "of" allow an optional context of local
164 variables ('for' declaration): these variables become schematic in the
165 instantiated theorem.
167 * Obsolete attribute "standard" has been discontinued (legacy since
168 Isabelle2012). Potential INCOMPATIBILITY, use explicit 'for' context
169 where instantiations with schematic variables are intended (for
170 declaration commands like 'lemmas' or attributes like "of"). The
171 following temporary definition may help to port old applications:
173 attribute_setup standard =
174 "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"
176 * More thorough check of proof context for goal statements and
177 attributed fact expressions (concerning background theory, declared
178 hyps). Potential INCOMPATIBILITY, tools need to observe standard
179 context discipline. See also Assumption.add_assumes and the more
180 primitive Thm.assume_hyps.
182 * Inner syntax token language allows regular quoted strings "..."
183 (only makes sense in practice, if outer syntax is delimited
184 differently, e.g. via cartouches).
186 * Command 'print_term_bindings' supersedes 'print_binds' for clarity,
187 but the latter is retained some time as Proof General legacy.
189 * Code generator preprocessor: explicit control of simp tracing on a
190 per-constant basis. See attribute "code_preproc".
195 * Code generator: enforce case of identifiers only for strict target
196 language requirements. INCOMPATIBILITY.
198 * Code generator: explicit proof contexts in many ML interfaces.
201 * Code generator: minimize exported identifiers by default. Minor
204 * Code generation for SML and OCaml: dropped arcane "no_signatures"
205 option. Minor INCOMPATIBILITY.
207 * "declare [[code abort: ...]]" replaces "code_abort ...".
210 * "declare [[code drop: ...]]" drops all code equations associated
211 with the given constants.
213 * Code generations are provided for make, fields, extend and truncate
214 operations on records.
216 * Command and antiquotation "value" are now hardcoded against nbe and
217 ML. Minor INCOMPATIBILITY.
219 * Renamed command 'enriched_type' to 'functor'. INCOMPATIBILITY.
221 * The symbol "\<newline>" may be used within char or string literals
222 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
224 * Qualified String.implode and String.explode. INCOMPATIBILITY.
226 * Simplifier: Enhanced solver of preconditions of rewrite rules can
227 now deal with conjunctions. For help with converting proofs, the old
228 behaviour of the simplifier can be restored like this: declare/using
229 [[simp_legacy_precond]]. This configuration option will disappear
230 again in the future. INCOMPATIBILITY.
232 * Simproc "finite_Collect" is no longer enabled by default, due to
233 spurious crashes and other surprises. Potential INCOMPATIBILITY.
235 * Moved new (co)datatype package and its dependencies from session
236 "HOL-BNF" to "HOL". The commands 'bnf', 'wrap_free_constructors',
237 'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now
238 part of theory "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/*
265 Wellorder_Extension.thy (split from Zorn.thy)
266 Library/Cardinal_Notations.thy
267 Library/BNF_Axomatization.thy
268 BNF_Examples/Misc_Primcorec.thy
269 BNF_Examples/Stream_Processor.thy
271 Discontinued theories:
273 BNF/Equiv_Relations_More.thy
277 * New (co)datatype package:
278 - Command 'primcorec' is fully implemented.
279 - Command 'datatype_new' generates size functions ("size_xxx" and
280 "size") as required by 'fun'.
281 - BNFs are integrated with the Lifting tool and new-style
282 (co)datatypes with Transfer.
284 datatype_new_compat ~> datatype_compat
285 primrec_new ~> primrec
286 wrap_free_constructors ~> free_constructors
288 - The generated constants "xxx_case" and "xxx_rec" have been renamed
289 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
291 - The constant "xxx_(un)fold" and related theorems are no longer
292 generated. Use "xxx_(co)rec" or define "xxx_(un)fold" manually
295 - No discriminators are generated for nullary constructors by
296 default, eliminating the need for the odd "=:" syntax.
298 - No discriminators or selectors are generated by default by
299 "datatype_new", unless custom names are specified or the new
300 "discs_sels" option is passed.
303 * Old datatype package:
304 - The generated theorems "xxx.cases" and "xxx.recs" have been
305 renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->
306 "sum.case"). INCOMPATIBILITY.
307 - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have
308 been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,
309 "prod_case" ~> "case_prod"). INCOMPATIBILITY.
311 * The types "'a list" and "'a option", their set and map functions,
312 their relators, and their selectors are now produced using the new
313 BNF-based datatype package.
316 Option.set ~> set_option
317 Option.map ~> map_option
318 option_rel ~> rel_option
321 set_def ~> set_rec[abs_def]
322 map_def ~> map_rec[abs_def]
323 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")
324 option.recs ~> option.rec
325 list_all2_def ~> list_all2_iff
326 set.simps ~> set_simps (or the slightly different "list.set")
327 map.simps ~> list.map
328 hd.simps ~> list.sel(1)
329 tl.simps ~> list.sel(2-3)
330 the.simps ~> option.sel
334 * The following map functions and relators have been renamed:
341 filter_rel ~> rel_filter
342 fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")
343 cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")
344 vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")
348 * New internal SAT solver "cdclite" that produces models and proof
349 traces. This solver replaces the internal SAT solvers "enumerate" and
350 "dpll". Applications that explicitly used one of these two SAT
351 solvers should use "cdclite" instead. In addition, "cdclite" is now
352 the default SAT solver for the "sat" and "satx" proof methods and
353 corresponding tactics; the old default can be restored using "declare
354 [[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY.
356 * SMT module: A new version of the SMT module, temporarily called
357 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,
358 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also
359 supported as oracles. Yices is no longer supported, because no version
360 of the solver can handle both SMT-LIB 2 and quantifiers.
362 * Activation of Z3 now works via "z3_non_commercial" system option
363 (without requiring restart), instead of former settings variable
364 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu
365 Plugin Options / Isabelle / General.
368 - Z3 can now produce Isar proofs.
370 . New SML-based learning algorithms eliminate the dependency on
371 Python and increase performance and reliability.
372 . MaSh and MeSh are now used by default together with the
373 traditional MePo (Meng-Paulson) relevance filter. To disable
374 MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin
375 Options / Isabelle / General to "none".
379 isar_compress ~> compress
384 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
387 - Fixed soundness bug whereby mutually recursive datatypes could
388 take infinite values.
389 - Fixed soundness bug with low-level number functions such as
390 "Abs_Integ" and "Rep_Integ".
391 - Removed "std" option.
392 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to
395 * Metis: Removed legacy proof method 'metisFT'. Use 'metis
396 (full_types)' instead. INCOMPATIBILITY.
398 * Try0: Added 'algebra' and 'meson' to the set of proof methods.
400 * Adjustion of INF and SUP operations:
401 - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.
402 - Consolidated theorem names containing INFI and SUPR: have INF and
403 SUP instead uniformly.
404 - More aggressive normalization of expressions involving INF and Inf
406 - INF_image and SUP_image do not unfold composition.
407 - Dropped facts INF_comp, SUP_comp.
408 - Default congruence rules strong_INF_cong and strong_SUP_cong, with
409 simplifier implication in premises. Generalize and replace former
414 * SUP and INF generalized to conditionally_complete_lattice.
416 * Swapped orientation of facts image_comp and vimage_comp:
418 image_compose ~> image_comp [symmetric]
419 image_comp ~> image_comp [symmetric]
420 vimage_compose ~> vimage_comp [symmetric]
421 vimage_comp ~> vimage_comp [symmetric]
425 * Theory reorganization: split of Big_Operators.thy into
426 Groups_Big.thy and Lattices_Big.thy.
428 * Consolidated some facts about big group operators:
430 setsum_0' ~> setsum.neutral
431 setsum_0 ~> setsum.neutral_const
432 setsum_addf ~> setsum.distrib
433 setsum_cartesian_product ~> setsum.cartesian_product
434 setsum_cases ~> setsum.If_cases
435 setsum_commute ~> setsum.commute
436 setsum_cong ~> setsum.cong
437 setsum_delta ~> setsum.delta
438 setsum_delta' ~> setsum.delta'
439 setsum_diff1' ~> setsum.remove
440 setsum_empty ~> setsum.empty
441 setsum_infinite ~> setsum.infinite
442 setsum_insert ~> setsum.insert
443 setsum_inter_restrict'' ~> setsum.inter_filter
444 setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left
445 setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right
446 setsum_mono_zero_left ~> setsum.mono_neutral_left
447 setsum_mono_zero_right ~> setsum.mono_neutral_right
448 setsum_reindex ~> setsum.reindex
449 setsum_reindex_cong ~> setsum.reindex_cong
450 setsum_reindex_nonzero ~> setsum.reindex_nontrivial
451 setsum_restrict_set ~> setsum.inter_restrict
452 setsum_Plus ~> setsum.Plus
453 setsum_setsum_restrict ~> setsum.commute_restrict
454 setsum_Sigma ~> setsum.Sigma
455 setsum_subset_diff ~> setsum.subset_diff
456 setsum_Un_disjoint ~> setsum.union_disjoint
457 setsum_UN_disjoint ~> setsum.UNION_disjoint
458 setsum_Un_Int ~> setsum.union_inter
459 setsum_Union_disjoint ~> setsum.Union_disjoint
460 setsum_UNION_zero ~> setsum.Union_comp
461 setsum_Un_zero ~> setsum.union_inter_neutral
462 strong_setprod_cong ~> setprod.strong_cong
463 strong_setsum_cong ~> setsum.strong_cong
464 setprod_1' ~> setprod.neutral
465 setprod_1 ~> setprod.neutral_const
466 setprod_cartesian_product ~> setprod.cartesian_product
467 setprod_cong ~> setprod.cong
468 setprod_delta ~> setprod.delta
469 setprod_delta' ~> setprod.delta'
470 setprod_empty ~> setprod.empty
471 setprod_infinite ~> setprod.infinite
472 setprod_insert ~> setprod.insert
473 setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left
474 setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right
475 setprod_mono_one_left ~> setprod.mono_neutral_left
476 setprod_mono_one_right ~> setprod.mono_neutral_right
477 setprod_reindex ~> setprod.reindex
478 setprod_reindex_cong ~> setprod.reindex_cong
479 setprod_reindex_nonzero ~> setprod.reindex_nontrivial
480 setprod_Sigma ~> setprod.Sigma
481 setprod_subset_diff ~> setprod.subset_diff
482 setprod_timesf ~> setprod.distrib
483 setprod_Un2 ~> setprod.union_diff2
484 setprod_Un_disjoint ~> setprod.union_disjoint
485 setprod_UN_disjoint ~> setprod.UNION_disjoint
486 setprod_Un_Int ~> setprod.union_inter
487 setprod_Union_disjoint ~> setprod.Union_disjoint
488 setprod_Un_one ~> setprod.union_inter_neutral
490 Dropped setsum_cong2 (simple variant of setsum.cong).
491 Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)
492 Dropped setsum_reindex_id, setprod_reindex_id
493 (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).
497 * Abolished slightly odd global lattice interpretation for min/max.
500 min_max.inf_assoc ~> min.assoc
501 min_max.inf_commute ~> min.commute
502 min_max.inf_left_commute ~> min.left_commute
503 min_max.inf_idem ~> min.idem
504 min_max.inf_left_idem ~> min.left_idem
505 min_max.inf_right_idem ~> min.right_idem
506 min_max.sup_assoc ~> max.assoc
507 min_max.sup_commute ~> max.commute
508 min_max.sup_left_commute ~> max.left_commute
509 min_max.sup_idem ~> max.idem
510 min_max.sup_left_idem ~> max.left_idem
511 min_max.sup_inf_distrib1 ~> max_min_distrib2
512 min_max.sup_inf_distrib2 ~> max_min_distrib1
513 min_max.inf_sup_distrib1 ~> min_max_distrib2
514 min_max.inf_sup_distrib2 ~> min_max_distrib1
515 min_max.distrib ~> min_max_distribs
516 min_max.inf_absorb1 ~> min.absorb1
517 min_max.inf_absorb2 ~> min.absorb2
518 min_max.sup_absorb1 ~> max.absorb1
519 min_max.sup_absorb2 ~> max.absorb2
520 min_max.le_iff_inf ~> min.absorb_iff1
521 min_max.le_iff_sup ~> max.absorb_iff2
522 min_max.inf_le1 ~> min.cobounded1
523 min_max.inf_le2 ~> min.cobounded2
524 le_maxI1, min_max.sup_ge1 ~> max.cobounded1
525 le_maxI2, min_max.sup_ge2 ~> max.cobounded2
526 min_max.le_infI1 ~> min.coboundedI1
527 min_max.le_infI2 ~> min.coboundedI2
528 min_max.le_supI1 ~> max.coboundedI1
529 min_max.le_supI2 ~> max.coboundedI2
530 min_max.less_infI1 ~> min.strict_coboundedI1
531 min_max.less_infI2 ~> min.strict_coboundedI2
532 min_max.less_supI1 ~> max.strict_coboundedI1
533 min_max.less_supI2 ~> max.strict_coboundedI2
534 min_max.inf_mono ~> min.mono
535 min_max.sup_mono ~> max.mono
536 min_max.le_infI, min_max.inf_greatest ~> min.boundedI
537 min_max.le_supI, min_max.sup_least ~> max.boundedI
538 min_max.le_inf_iff ~> min.bounded_iff
539 min_max.le_sup_iff ~> max.bounded_iff
541 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
542 min.left_commute, min.left_idem, max.commute, max.assoc,
543 max.left_commute, max.left_idem directly.
545 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,
546 min.cobounded2, max.cobounded1m max.cobounded2 directly.
548 For min_ac or max_ac, prefer more general collection ac_simps.
552 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>
553 Inf_fin_le_Sup_fin. INCOMPATIBILITY.
555 * Qualified constant names Wellfounded.acc, Wellfounded.accp.
558 * Fact generalization and consolidation:
559 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
563 * Purely algebraic definition of even. Fact generalization and
565 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
566 even_zero_(nat|int) ~> even_zero
570 * Abolished neg_numeral.
571 - Canonical representation for minus one is "- 1".
572 - Canonical representation for other negative numbers is "- (numeral _)".
573 - When devising rule sets for number calculation, consider the
574 following canonical cases: 0, 1, numeral _, - 1, - numeral _.
575 - HOLogic.dest_number also recognizes numerals in non-canonical forms
576 like "numeral One", "- numeral One", "- 0" and even "- ... - _".
577 - Syntax for negative numerals is mere input syntax.
581 * Reduced name variants for rules on associativity and commutativity:
583 add_assoc ~> add.assoc
584 add_commute ~> add.commute
585 add_left_commute ~> add.left_commute
586 mult_assoc ~> mult.assoc
587 mult_commute ~> mult.commute
588 mult_left_commute ~> mult.left_commute
589 nat_add_assoc ~> add.assoc
590 nat_add_commute ~> add.commute
591 nat_add_left_commute ~> add.left_commute
592 nat_mult_assoc ~> mult.assoc
593 nat_mult_commute ~> mult.commute
594 eq_assoc ~> iff_assoc
595 eq_left_commute ~> iff_left_commute
599 * Fact collections add_ac and mult_ac are considered old-fashioned.
600 Prefer ac_simps instead, or specify rules
601 (add|mult).(assoc|commute|left_commute) individually.
603 * Elimination of fact duplicates:
604 equals_zero_I ~> minus_unique
605 diff_eq_0_iff_eq ~> right_minus_eq
606 nat_infinite ~> infinite_UNIV_nat
607 int_infinite ~> infinite_UNIV_int
611 * Fact name consolidation:
612 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
613 minus_le_self_iff ~> neg_less_eq_nonneg
614 le_minus_self_iff ~> less_eq_neg_nonpos
615 neg_less_nonneg ~> neg_less_pos
616 less_minus_self_iff ~> less_neg_neg [simp]
620 * More simplification rules on unary and binary minus:
621 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
622 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
623 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
624 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
625 minus_add_cancel, uminus_add_conv_diff. These correspondingly have
626 been taken away from fact collections algebra_simps and field_simps.
629 To restore proofs, the following patterns are helpful:
631 a) Arbitrary failing proof not involving "diff_def":
632 Consider simplification with algebra_simps or field_simps.
634 b) Lifting rules from addition to subtraction:
635 Try with "using <rule for addition> of [... "- _" ...]" by simp".
637 c) Simplification with "diff_def": just drop "diff_def".
638 Consider simplification with algebra_simps or field_simps;
639 or the brute way with
640 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
642 * Introduce bdd_above and bdd_below in theory
643 Conditionally_Complete_Lattices, use them instead of explicitly
644 stating boundedness of sets.
646 * ccpo.admissible quantifies only over non-empty chains to allow more
647 syntax-directed proof rules; the case of the empty chain shows up as
648 additional case in fixpoint induction proofs. INCOMPATIBILITY.
650 * Removed and renamed theorems in Series:
651 summable_le ~> suminf_le
652 suminf_le ~> suminf_le_const
653 series_pos_le ~> setsum_le_suminf
654 series_pos_less ~> setsum_less_suminf
655 suminf_ge_zero ~> suminf_nonneg
656 suminf_gt_zero ~> suminf_pos
657 suminf_gt_zero_iff ~> suminf_pos_iff
658 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ
659 suminf_0_le ~> suminf_nonneg [rotate]
660 pos_summable ~> summableI_nonneg_bounded
661 ratio_test ~> summable_ratio_test
663 removed series_zero, replaced by sums_finite
665 removed auxiliary lemmas:
667 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,
668 half, le_Suc_ex_iff, lemma_realpow_diff_sumr,
669 real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,
670 sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,
671 summable_convergent_sumr_iff, sumr_diff_mult_const
675 * Replace (F)DERIV syntax by has_derivative:
676 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"
678 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"
680 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax
682 - removed constant isDiff
684 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as
687 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.
689 - Renamed FDERIV_... lemmas to has_derivative_...
691 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV
693 - removed DERIV_intros, has_derivative_eq_intros
695 - introduced derivative_intros and deriative_eq_intros which
696 includes now rules for DERIV, has_derivative and
697 has_vector_derivative.
700 differentiable_def ~> real_differentiable_def
701 differentiableE ~> real_differentiableE
702 fderiv_def ~> has_derivative_at
703 field_fderiv_def ~> field_has_derivative_at
704 isDiff_der ~> differentiable_def
705 deriv_fderiv ~> has_field_derivative_def
706 deriv_def ~> DERIV_def
710 * Include more theorems in continuous_intros. Remove the
711 continuous_on_intros, isCont_intros collections, these facts are now
712 in continuous_intros.
714 * Theorems about complex numbers are now stated only using Re and Im,
715 the Complex constructor is not used anymore. It is possible to use
716 primcorec to defined the behaviour of a complex-valued function.
718 Removed theorems about the Complex constructor from the simpset, they
719 are available as the lemma collection legacy_Complex_simps. This
722 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".
724 Instead the reverse direction is supported with
725 Complex_eq: "Complex a b = a + \<i> * b"
727 Moved csqrt from Fundamental_Algebra_Theorem to Complex.
731 complex_Re/Im_zero ~> zero_complex.sel
732 complex_Re/Im_add ~> plus_complex.sel
733 complex_Re/Im_minus ~> uminus_complex.sel
734 complex_Re/Im_diff ~> minus_complex.sel
735 complex_Re/Im_one ~> one_complex.sel
736 complex_Re/Im_mult ~> times_complex.sel
737 complex_Re/Im_inverse ~> inverse_complex.sel
738 complex_Re/Im_scaleR ~> scaleR_complex.sel
739 complex_Re/Im_i ~> ii.sel
740 complex_Re/Im_cnj ~> cnj.sel
743 complex_divide_def ~> divide_complex_def
744 complex_norm_def ~> norm_complex_def
745 cmod_def ~> norm_complex_de
759 * Theory Lubs moved HOL image to HOL-Library. It is replaced by
760 Conditionally_Complete_Lattices. INCOMPATIBILITY.
762 * HOL-Library: new theory src/HOL/Library/Tree.thy.
764 * HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it
765 is subsumed by session Kleene_Algebra in AFP.
767 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.
769 * HOL-Word: bit representations prefer type bool over type bit.
773 - Abandoned fact collection "word_arith_alts", which is a duplicate
775 - Dropped first (duplicated) element in fact collections
776 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",
777 "uint_word_arith_bintrs".
780 - consolidated the proofs of the binomial theorem
781 - the function fib is again of type nat => nat and not overloaded
782 - no more references to Old_Number_Theory in the HOL libraries
787 * HOL-Multivariate_Analysis:
788 - Type class ordered_real_vector for ordered vector spaces.
789 - New theory Complex_Basic_Analysis defining complex derivatives,
790 holomorphic functions, etc., ported from HOL Light's canal.ml.
791 - Changed order of ordered_euclidean_space to be compatible with
792 pointwise ordering on products. Therefore instance of
793 conditionally_complete_lattice and ordered_real_vector.
794 INCOMPATIBILITY: use box instead of greaterThanLessThan or
795 explicit set-comprehensions with eucl_less for other (half-)open
797 - removed dependencies on type class ordered_euclidean_space with
798 introduction of "cbox" on euclidean_space
801 mem_interval ~> mem_box
802 interval_eq_empty ~> box_eq_empty
803 interval_ne_empty ~> box_ne_empty
804 interval_sing(1) ~> cbox_sing
805 interval_sing(2) ~> box_sing
806 subset_interval_imp ~> subset_box_imp
807 subset_interval ~> subset_box
808 open_interval ~> open_box
809 closed_interval ~> closed_cbox
810 interior_closed_interval ~> interior_cbox
811 bounded_closed_interval ~> bounded_cbox
812 compact_interval ~> compact_cbox
813 bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric
814 bounded_subset_closed_interval ~> bounded_subset_cbox
815 mem_interval_componentwiseI ~> mem_box_componentwiseI
816 convex_box ~> convex_prod
817 rel_interior_real_interval ~> rel_interior_real_box
818 convex_interval ~> convex_box
819 convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox
820 frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox
821 content_closed_interval' ~> content_cbox'
822 elementary_subset_interval ~> elementary_subset_box
823 diameter_closed_interval ~> diameter_cbox
824 frontier_closed_interval ~> frontier_cbox
825 frontier_open_interval ~> frontier_box
826 bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric
827 closure_open_interval ~> closure_box
828 open_closed_interval_convex ~> open_cbox_convex
829 open_interval_midpoint ~> box_midpoint
830 content_image_affinity_interval ~> content_image_affinity_cbox
831 is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval
832 bounded_interval ~> bounded_closed_interval + bounded_boxes
834 - respective theorems for intervals over the reals:
835 content_closed_interval + content_cbox
836 has_integral + has_integral_real
837 fine_division_exists + fine_division_exists_real
838 has_integral_null + has_integral_null_real
839 tagged_division_union_interval + tagged_division_union_interval_real
840 has_integral_const + has_integral_const_real
841 integral_const + integral_const_real
842 has_integral_bound + has_integral_bound_real
843 integrable_continuous + integrable_continuous_real
844 integrable_subinterval + integrable_subinterval_real
845 has_integral_reflect_lemma + has_integral_reflect_lemma_real
846 integrable_reflect + integrable_reflect_real
847 integral_reflect + integral_reflect_real
848 image_affinity_interval + image_affinity_cbox
849 image_smult_interval + image_smult_cbox
850 integrable_const + integrable_const_ivl
851 integrable_on_subinterval + integrable_on_subcbox
854 derivative_linear ~> has_derivative_bounded_linear
855 derivative_is_linear ~> has_derivative_linear
856 bounded_linear_imp_linear ~> bounded_linear.linear
859 - replaced the Lebesgue integral on real numbers by the more general
860 Bochner integral for functions into a real-normed vector space.
862 integral_zero ~> integral_zero / integrable_zero
863 integral_minus ~> integral_minus / integrable_minus
864 integral_add ~> integral_add / integrable_add
865 integral_diff ~> integral_diff / integrable_diff
866 integral_setsum ~> integral_setsum / integrable_setsum
867 integral_multc ~> integral_mult_left / integrable_mult_left
868 integral_cmult ~> integral_mult_right / integrable_mult_right
869 integral_triangle_inequality~> integral_norm_bound
870 integrable_nonneg ~> integrableI_nonneg
871 integral_positive ~> integral_nonneg_AE
872 integrable_abs_iff ~> integrable_abs_cancel
873 positive_integral_lim_INF ~> positive_integral_liminf
874 lebesgue_real_affine ~> lborel_real_affine
875 borel_integral_has_integral ~> has_integral_lebesgue_integral
876 integral_indicator ~>
877 integral_real_indicator / integrable_real_indicator
878 positive_integral_fst ~> positive_integral_fst'
879 positive_integral_fst_measurable ~> positive_integral_fst
880 positive_integral_snd_measurable ~> positive_integral_snd
882 integrable_fst_measurable ~>
883 integral_fst / integrable_fst / AE_integrable_fst
885 integrable_snd_measurable ~>
886 integral_snd / integrable_snd / AE_integrable_snd
888 integral_monotone_convergence ~>
889 integral_monotone_convergence / integrable_monotone_convergence
891 integral_monotone_convergence_at_top ~>
892 integral_monotone_convergence_at_top /
893 integrable_monotone_convergence_at_top
895 has_integral_iff_positive_integral_lebesgue ~>
896 has_integral_iff_has_bochner_integral_lebesgue_nonneg
898 lebesgue_integral_has_integral ~>
899 has_integral_integrable_lebesgue_nonneg
901 positive_integral_lebesgue_has_integral ~>
902 integral_has_integral_lebesgue_nonneg /
903 integrable_has_integral_lebesgue_nonneg
905 lebesgue_integral_real_affine ~>
906 positive_integral_real_affine
908 has_integral_iff_positive_integral_lborel ~>
909 integral_has_integral_nonneg / integrable_has_integral_nonneg
911 The following theorems where removed:
913 lebesgue_integral_nonneg
914 lebesgue_integral_uminus
915 lebesgue_integral_cmult
916 lebesgue_integral_multc
917 lebesgue_integral_cmult_nonneg
918 integral_cmul_indicator
921 - Renamed positive_integral to nn_integral:
923 . Renamed all lemmas "*positive_integral*" to *nn_integral*"
924 positive_integral_positive ~> nn_integral_nonneg
926 . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.
928 - Formalized properties about exponentially, Erlang, and normal
929 distributed random variables.
931 * HOL-Decision_Procs: Separate command 'approximate' for approximative
932 computation in src/HOL/Decision_Procs/Approximation. Minor
938 * The signature and semantics of Document.Snapshot.cumulate_markup /
939 select_markup have been clarified. Markup is now traversed in the
940 order of reports given by the prover: later markup is usually more
941 specific and may override results accumulated so far. The elements
942 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.
944 * Substantial reworking of internal PIDE protocol communication
945 channels. INCOMPATIBILITY.
950 * Subtle change of semantics of Thm.eq_thm: theory stamps are not
951 compared (according to Thm.thm_ord), but assumed to be covered by the
952 current background theory. Thus equivalent data produced in different
953 branches of the theory graph usually coincides (e.g. relevant for
954 theory merge). Note that the softer Thm.eq_thm_prop is often more
955 appropriate than Thm.eq_thm.
957 * Proper context for basic Simplifier operations: rewrite_rule,
958 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
959 pass runtime Proof.context (and ensure that the simplified entity
960 actually belongs to it).
962 * Proper context discipline for read_instantiate and instantiate_tac:
963 variables that are meant to become schematic need to be given as
964 fixed, and are generalized by the explicit context of local variables.
965 This corresponds to Isar attributes "where" and "of" with 'for'
966 declaration. INCOMPATIBILITY, also due to potential change of indices
967 of schematic variables.
969 * Moved ML_Compiler.exn_trace and other operations on exceptions to
970 structure Runtime. Minor INCOMPATIBILITY.
972 * Discontinued old Toplevel.debug in favour of system option
973 "ML_exception_trace", which may be also declared within the context
974 via "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.
976 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor
979 * Configuration option "ML_print_depth" controls the pretty-printing
980 depth of the ML compiler within the context. The old print_depth in
981 ML is still available as default_print_depth, but rarely used. Minor
984 * Toplevel function "use" refers to raw ML bootstrap environment,
985 without Isar context nor antiquotations. Potential INCOMPATIBILITY.
986 Note that 'ML_file' is the canonical command to load ML files into the
989 * Simplified programming interface to define ML antiquotations, see
990 structure ML_Antiquotation. Minor INCOMPATIBILITY.
992 * ML antiquotation @{here} refers to its source position, which is
993 occasionally useful for experimentation and diagnostic purposes.
995 * ML antiquotation @{path} produces a Path.T value, similarly to
996 Path.explode, but with compile-time check against the file-system and
997 some PIDE markup. Note that unlike theory source, ML does not have a
998 well-defined master directory, so an absolute symbolic path
999 specification is usually required, e.g. "~~/src/HOL".
1001 * ML antiquotation @{print} inlines a function to print an arbitrary
1002 ML value, which is occasionally useful for diagnostic or demonstration
1008 * Proof General with its traditional helper scripts is now an optional
1009 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle
1010 component repository http://isabelle.in.tum.de/components/. Note that
1011 the "system" manual provides general explanations about add-on
1012 components, especially those that are not bundled with the release.
1014 * The raw Isabelle process executable has been renamed from
1015 "isabelle-process" to "isabelle_process", which conforms to common
1016 shell naming conventions, and allows to define a shell function within
1017 the Isabelle environment to avoid dynamic path lookup. Rare
1018 incompatibility for old tools that do not use the ISABELLE_PROCESS
1021 * Former "isabelle tty" has been superseded by "isabelle console",
1022 with implicit build like "isabelle jedit", and without the mostly
1023 obsolete Isar TTY loop.
1025 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER
1026 and PDF_VIEWER now refer to the actual programs, not shell
1027 command-lines. Discontinued option -c: invocation may be asynchronous
1028 via desktop environment, without any special precautions. Potential
1029 INCOMPATIBILITY with ambitious private settings.
1031 * Removed obsolete "isabelle unsymbolize". Note that the usual format
1032 for email communication is the Unicode rendering of Isabelle symbols,
1033 as produced by Isabelle/jEdit, for example.
1035 * Removed obsolete tool "wwwfind". Similar functionality may be
1036 integrated into Isabelle/jEdit eventually.
1038 * Improved 'display_drafts' concerning desktop integration and
1039 repeated invocation in PIDE front-end: re-use single file
1040 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
1042 * Session ROOT specifications require explicit 'document_files' for
1043 robust dependencies on LaTeX sources. Only these explicitly given
1044 files are copied to the document output directory, before document
1045 processing is started.
1047 * Windows: support for regular TeX installation (e.g. MiKTeX) instead
1048 of TeX Live from Cygwin.
1051 New in Isabelle2013-2 (December 2013)
1052 -------------------------------------
1054 *** Prover IDE -- Isabelle/Scala/jEdit ***
1056 * More robust editing of running commands with internal forks,
1057 e.g. non-terminating 'by' steps.
1059 * More relaxed Sledgehammer panel: avoid repeated application of query
1060 after edits surrounding the command location.
1062 * More status information about commands that are interrupted
1063 accidentally (via physical event or Poly/ML runtime system signal,
1064 e.g. out-of-memory).
1069 * More robust termination of external processes managed by
1070 Isabelle/ML: support cancellation of tasks within the range of
1071 milliseconds, as required for PIDE document editing with automatically
1072 tried tools (e.g. Sledgehammer).
1074 * Reactivated Isabelle/Scala kill command for external processes on
1075 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
1076 workaround for some Debian/Ubuntu Linux versions from 2013.
1080 New in Isabelle2013-1 (November 2013)
1081 -------------------------------------
1085 * Discontinued obsolete 'uses' within theory header. Note that
1086 commands like 'ML_file' work without separate declaration of file
1087 dependencies. Minor INCOMPATIBILITY.
1089 * Discontinued redundant 'use' command, which was superseded by
1090 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
1092 * Simplified subscripts within identifiers, using plain \<^sub>
1093 instead of the second copy \<^isub> and \<^isup>. Superscripts are
1094 only for literal tokens within notation; explicit mixfix annotations
1095 for consts or fixed variables may be used as fall-back for unusual
1096 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
1097 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
1098 standardize symbols as a starting point for further manual cleanup.
1099 The ML reference variable "legacy_isub_isup" may be set as temporary
1100 workaround, to make the prover accept a subset of the old identifier
1103 * Document antiquotations: term style "isub" has been renamed to
1104 "sub". Minor INCOMPATIBILITY.
1106 * Uniform management of "quick_and_dirty" as system option (see also
1107 "isabelle options"), configuration option within the context (see also
1108 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
1109 INCOMPATIBILITY, need to use more official Isabelle means to access
1110 quick_and_dirty, instead of historical poking into mutable reference.
1112 * Renamed command 'print_configs' to 'print_options'. Minor
1115 * Proper diagnostic command 'print_state'. Old 'pr' (with its
1116 implicit change of some global references) is retained for now as
1117 control command, e.g. for ProofGeneral 3.7.x.
1119 * Discontinued 'print_drafts' command with its old-fashioned PS output
1120 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
1121 'display_drafts' instead and print via the regular document viewer.
1123 * Updated and extended "isar-ref" and "implementation" manual,
1124 eliminated old "ref" manual.
1127 *** Prover IDE -- Isabelle/Scala/jEdit ***
1129 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
1130 Documentation panel.
1132 * Dockable window "Documentation" provides access to Isabelle
1135 * Dockable window "Find" provides query operations for formal entities
1136 (GUI front-end to 'find_theorems' command).
1138 * Dockable window "Sledgehammer" manages asynchronous / parallel
1139 sledgehammer runs over existing document sources, independently of
1140 normal editing and checking process.
1142 * Dockable window "Timing" provides an overview of relevant command
1143 timing information, depending on option jedit_timing_threshold. The
1144 same timing information is shown in the extended tooltip of the
1145 command keyword, when hovering the mouse over it while the CONTROL or
1146 COMMAND modifier is pressed.
1148 * Improved dockable window "Theories": Continuous checking of proof
1149 document (visible and required parts) may be controlled explicitly,
1150 using check box or shortcut "C+e ENTER". Individual theory nodes may
1151 be marked explicitly as required and checked in full, using check box
1152 or shortcut "C+e SPACE".
1154 * Improved completion mechanism, which is now managed by the
1155 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
1156 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
1158 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
1159 isabelle.complete for explicit completion in Isabelle sources.
1160 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
1161 to resolve conflict.
1163 * Improved support of various "minor modes" for Isabelle NEWS,
1164 options, session ROOT etc., with completion and SideKick tree view.
1166 * Strictly monotonic document update, without premature cancellation of
1167 running transactions that are still needed: avoid reset/restart of
1168 such command executions while editing.
1170 * Support for asynchronous print functions, as overlay to existing
1173 * Support for automatic tools in HOL, which try to prove or disprove
1174 toplevel theorem statements.
1176 * Action isabelle.reset-font-size resets main text area font size
1177 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
1178 also "Plugin Options / Isabelle / General"). It can be bound to some
1179 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
1181 * File specifications in jEdit (e.g. file browser) may refer to
1182 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued
1183 obsolete $ISABELLE_HOME_WINDOWS variable.
1185 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
1186 / Global Options / Appearance".
1188 * Improved support of native Mac OS X functionality via "MacOSX"
1189 plugin, which is now enabled by default.
1194 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
1195 In particular, 'interpretation' allows for non-persistent
1196 interpretation within "context ... begin ... end" blocks offering a
1197 light-weight alternative to 'sublocale'. See "isar-ref" manual for
1200 * Improved locales diagnostic command 'print_dependencies'.
1202 * Discontinued obsolete 'axioms' command, which has been marked as
1203 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
1204 instead, while observing its uniform scope for polymorphism.
1206 * Discontinued empty name bindings in 'axiomatization'.
1209 * System option "proofs" has been discontinued. Instead the global
1210 state of Proofterm.proofs is persistently compiled into logic images
1211 as required, notably HOL-Proofs. Users no longer need to change
1212 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
1214 * Syntax translation functions (print_translation etc.) always depend
1215 on Proof.context. Discontinued former "(advanced)" option -- this is
1216 now the default. Minor INCOMPATIBILITY.
1218 * Former global reference trace_unify_fail is now available as
1219 configuration option "unify_trace_failure" (global context only).
1221 * SELECT_GOAL now retains the syntactic context of the overall goal
1222 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
1228 * Stronger precedence of syntax for big intersection and union on
1229 sets, in accordance with corresponding lattice operations.
1232 * Notation "{p:A. P}" now allows tuple patterns as well.
1234 * Nested case expressions are now translated in a separate check phase
1235 rather than during parsing. The data for case combinators is separated
1236 from the datatype package. The declaration attribute
1237 "case_translation" can be used to register new case combinators:
1239 declare [[case_translation case_combinator constructor1 ... constructorN]]
1242 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
1244 - 'code_identifier' declares name hints for arbitrary identifiers in
1245 generated code, subsuming 'code_modulename'.
1247 See the isar-ref manual for syntax diagrams, and the HOL theories for
1250 * Attibute 'code': 'code' now declares concrete and abstract code
1251 equations uniformly. Use explicit 'code equation' and 'code abstract'
1252 to distinguish both when desired.
1254 * Discontinued theories Code_Integer and Efficient_Nat by a more
1255 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
1256 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
1257 generation for details. INCOMPATIBILITY.
1259 * Numeric types are mapped by default to target language numerals:
1260 natural (replaces former code_numeral) and integer (replaces former
1261 code_int). Conversions are available as integer_of_natural /
1262 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
1263 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
1264 ML). INCOMPATIBILITY.
1266 * Function package: For mutually recursive functions f and g, separate
1267 cases rules f.cases and g.cases are generated instead of unusable
1268 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
1269 in the case that the unusable rule was used nevertheless.
1271 * Function package: For each function f, new rules f.elims are
1272 generated, which eliminate equalities of the form "f x = t".
1274 * New command 'fun_cases' derives ad-hoc elimination rules for
1275 function equations as simplified instances of f.elims, analogous to
1276 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
1279 - parametrized correspondence relations are now supported:
1280 + parametricity theorems for the raw term can be specified in
1281 the command lift_definition, which allow us to generate stronger
1283 + setup_lifting generates stronger transfer rules if parametric
1284 correspondence relation can be generated
1285 + various new properties of the relator must be specified to support
1287 + parametricity theorem for the Quotient relation can be specified
1288 - setup_lifting generates domain rules for the Transfer package
1289 - stronger reflexivity prover of respectfulness theorems for type
1291 - ===> and --> are now local. The symbols can be introduced
1292 by interpreting the locale lifting_syntax (typically in an
1294 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
1295 Main. Potential INCOMPATIBILITY
1296 - new commands for restoring and deleting Lifting/Transfer context:
1297 lifting_forget, lifting_update
1298 - the command print_quotmaps was renamed to print_quot_maps.
1302 - better support for domains in Transfer: replace Domainp T
1303 by the actual invariant in a transferred goal
1304 - transfer rules can have as assumptions other transfer rules
1305 - Experimental support for transferring from the raw level to the
1306 abstract level: Transfer.transferred attribute
1307 - Attribute version of the transfer method: untransferred attribute
1309 * Reification and reflection:
1310 - Reification is now directly available in HOL-Main in structure
1312 - Reflection now handles multiple lists with variables also.
1313 - The whole reflection stack has been decomposed into conversions.
1316 * Revised devices for recursive definitions over finite sets:
1317 - Only one fundamental fold combinator on finite set remains:
1318 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
1319 This is now identity on infinite sets.
1320 - Locales ("mini packages") for fundamental definitions with
1321 Finite_Set.fold: folding, folding_idem.
1322 - Locales comm_monoid_set, semilattice_order_set and
1323 semilattice_neutr_order_set for big operators on sets.
1324 See theory Big_Operators for canonical examples.
1325 Note that foundational constants comm_monoid_set.F and
1326 semilattice_set.F correspond to former combinators fold_image
1327 and fold1 respectively. These are now gone. You may use
1328 those foundational constants as substitutes, but it is
1329 preferable to interpret the above locales accordingly.
1330 - Dropped class ab_semigroup_idem_mult (special case of lattice,
1331 no longer needed in connection with Finite_Set.fold etc.)
1333 card.union_inter ~> card_Un_Int [symmetric]
1334 card.union_disjoint ~> card_Un_disjoint
1337 * Locale hierarchy for abstract orderings and (semi)lattices.
1339 * Complete_Partial_Order.admissible is defined outside the type class
1340 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
1341 class predicate assumption or sort constraint when possible.
1344 * Introduce type class "conditionally_complete_lattice": Like a
1345 complete lattice but does not assume the existence of the top and
1346 bottom elements. Allows to generalize some lemmas about reals and
1347 extended reals. Removed SupInf and replaced it by the instantiation
1348 of conditionally_complete_lattice for real. Renamed lemmas about
1349 conditionally-complete lattice from Sup_... to cSup_... and from
1350 Inf_... to cInf_... to avoid hidding of similar complete lattice
1353 * Introduce type class linear_continuum as combination of
1354 conditionally-complete lattices and inner dense linorders which have
1355 more than one element. INCOMPATIBILITY.
1357 * Introduced type classes order_top and order_bot. The old classes top
1358 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
1359 Rename bot -> order_bot, top -> order_top
1361 * Introduce type classes "no_top" and "no_bot" for orderings without
1362 top and bottom elements.
1364 * Split dense_linorder into inner_dense_order and no_top, no_bot.
1366 * Complex_Main: Unify and move various concepts from
1367 HOL-Multivariate_Analysis to HOL-Complex_Main.
1369 - Introduce type class (lin)order_topology and
1370 linear_continuum_topology. Allows to generalize theorems about
1371 limits and order. Instances are reals and extended reals.
1373 - continuous and continuos_on from Multivariate_Analysis:
1374 "continuous" is the continuity of a function at a filter. "isCont"
1375 is now an abbrevitation: "isCont x f == continuous (at _) f".
1377 Generalized continuity lemmas from isCont to continuous on an
1380 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
1381 compactness of closed intervals on reals. Continuous functions
1382 attain infimum and supremum on compact sets. The inverse of a
1383 continuous function is continuous, when the function is continuous
1386 - connected from Multivariate_Analysis. Use it to prove the
1387 intermediate value theorem. Show connectedness of intervals on
1388 linear_continuum_topology).
1390 - first_countable_topology from Multivariate_Analysis. Is used to
1391 show equivalence of properties on the neighbourhood filter of x and
1392 on all sequences converging to x.
1394 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
1395 theorems from Library/FDERIV.thy to Deriv.thy and base the
1396 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
1397 which are restricted to sets, i.e. to represent derivatives from
1400 - Removed the within-filter. It is replaced by the principal filter:
1402 F within X = inf F (principal X)
1404 - Introduce "at x within U" as a single constant, "at x" is now an
1405 abbreviation for "at x within UNIV"
1407 - Introduce named theorem collections tendsto_intros,
1408 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
1409 in tendsto_intros (or FDERIV_intros) are also available as
1410 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
1411 is replaced by a congruence rule. This allows to apply them as
1412 intro rules and then proving equivalence by the simplifier.
1414 - Restructured theories in HOL-Complex_Main:
1416 + Moved RealDef and RComplete into Real
1418 + Introduced Topological_Spaces and moved theorems about
1419 topological spaces, filters, limits and continuity to it
1421 + Renamed RealVector to Real_Vector_Spaces
1423 + Split Lim, SEQ, Series into Topological_Spaces,
1424 Real_Vector_Spaces, and Limits
1426 + Moved Ln and Log to Transcendental
1428 + Moved theorems about continuity from Deriv to Topological_Spaces
1430 - Remove various auxiliary lemmas.
1435 - Added option "spy".
1436 - Reduce incidence of "too high arity" errors.
1440 isar_shrink ~> isar_compress
1442 - Added options "isar_try0", "spy".
1443 - Better support for "isar_proofs".
1444 - MaSh has been fined-tuned and now runs as a local server.
1446 * Improved support for ad hoc overloading of constants (see also
1447 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
1449 * Library/Polynomial.thy:
1450 - Use lifting for primitive definitions.
1451 - Explicit conversions from and to lists of coefficients, used for
1453 - Replaced recursion operator poly_rec by fold_coeffs.
1454 - Prefer pre-existing gcd operation for gcd.
1456 poly_eq_iff ~> poly_eq_poly_eq_iff
1457 poly_ext ~> poly_eqI
1458 expand_poly_eq ~> poly_eq_iff
1461 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
1462 case_of_simps to convert function definitions between a list of
1463 equations with patterns on the lhs and a single equation with case
1464 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
1466 * New Library/FSet.thy: type of finite sets defined as a subtype of
1467 sets defined by Lifting/Transfer.
1469 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
1471 * Consolidation of library theories on product orders:
1473 Product_Lattice ~> Product_Order -- pointwise order on products
1474 Product_ord ~> Product_Lexorder -- lexicographic order on products
1478 * Imperative-HOL: The MREC combinator is considered legacy and no
1479 longer included by default. INCOMPATIBILITY, use partial_function
1480 instead, or import theory Legacy_Mrec as a fallback.
1482 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
1483 ~~/src/HOL/Algebra/poly. Existing theories should be based on
1484 ~~/src/HOL/Library/Polynomial instead. The latter provides
1485 integration with HOL's type classes for rings. INCOMPATIBILITY.
1488 - Various improvements to BNF-based (co)datatype package, including
1489 new commands "primrec_new", "primcorec", and
1490 "datatype_new_compat", as well as documentation. See
1491 "datatypes.pdf" for details.
1492 - New "coinduction" method to avoid some boilerplate (compared to
1495 data ~> datatype_new
1496 codata ~> codatatype
1498 - Renamed many generated theorems, including
1500 map_comp' ~> map_comp
1510 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
1511 "check_property" allows to check specifications of the form "ALL x y
1512 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
1513 Examples.thy in particular.
1515 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
1516 tracing output in the command transaction context instead of physical
1517 stdout. See also Toplevel.debug, Toplevel.debugging and
1518 ML_Compiler.exn_trace.
1520 * ML type "theory" is now immutable, without any special treatment of
1521 drafts or linear updates (which could lead to "stale theory" errors in
1522 the past). Discontinued obsolete operations like Theory.copy,
1523 Theory.checkpoint, and the auxiliary type theory_ref. Minor
1526 * More uniform naming of goal functions for skipped proofs:
1528 Skip_Proof.prove ~> Goal.prove_sorry
1529 Skip_Proof.prove_global ~> Goal.prove_sorry_global
1531 Minor INCOMPATIBILITY.
1533 * Simplifier tactics and tools use proper Proof.context instead of
1534 historic type simpset. Old-style declarations like addsimps,
1535 addsimprocs etc. operate directly on Proof.context. Raw type simpset
1536 retains its use as snapshot of the main Simplifier context, using
1537 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
1538 old tools by making them depend on (ctxt : Proof.context) instead of
1539 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
1541 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
1542 operate on Proof.context instead of claset, for uniformity with addIs,
1543 addEs, addDs etc. Note that claset_of and put_claset allow to manage
1544 clasets separately from the context.
1546 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
1547 INCOMPATIBILITY, use @{context} instead.
1549 * Antiquotation @{theory_context A} is similar to @{theory A}, but
1550 presents the result as initial Proof.context.
1555 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
1556 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
1558 * Discontinued obsolete isabelle-process options -f and -u (former
1559 administrative aliases of option -e). Minor INCOMPATIBILITY.
1561 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
1564 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
1565 document formats: dvi.gz, ps, ps.gz -- the default document format is
1568 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
1569 specify global resources of the JVM process run by isabelle build.
1571 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
1572 to run Isabelle/Scala source files as standalone programs.
1574 * Improved "isabelle keywords" tool (for old-style ProofGeneral
1575 keyword tables): use Isabelle/Scala operations, which inspect outer
1576 syntax without requiring to build sessions first.
1578 * Sessions may be organized via 'chapter' specifications in the ROOT
1579 file, which determines a two-level hierarchy of browser info. The old
1580 tree-like organization via implicit sub-session relation (with its
1581 tendency towards erratic fluctuation of URLs) has been discontinued.
1582 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
1583 for HTML presentation of theories.
1587 New in Isabelle2013 (February 2013)
1588 -----------------------------------
1592 * Theorem status about oracles and unfinished/failed future proofs is
1593 no longer printed by default, since it is incompatible with
1594 incremental / parallel checking of the persistent document model. ML
1595 function Thm.peek_status may be used to inspect a snapshot of the
1596 ongoing evaluation process. Note that in batch mode --- notably
1597 isabelle build --- the system ensures that future proofs of all
1598 accessible theorems in the theory context are finished (as before).
1600 * Configuration option show_markup controls direct inlining of markup
1601 into the printed representation of formal entities --- notably type
1602 and sort constraints. This enables Prover IDE users to retrieve that
1603 information via tooltips in the output window, for example.
1605 * Command 'ML_file' evaluates ML text from a file directly within the
1606 theory, without any predeclaration via 'uses' in the theory header.
1608 * Old command 'use' command and corresponding keyword 'uses' in the
1609 theory header are legacy features and will be discontinued soon.
1610 Tools that load their additional source files may imitate the
1611 'ML_file' implementation, such that the system can take care of
1612 dependencies properly.
1614 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
1615 is called fastforce / fast_force_tac already since Isabelle2011-1.
1617 * Updated and extended "isar-ref" and "implementation" manual, reduced
1618 remaining material in old "ref" manual.
1620 * Improved support for auxiliary contexts that indicate block structure
1621 for specifications. Nesting of "context fixes ... context assumes ..."
1622 and "class ... context ...".
1624 * Attribute "consumes" allows a negative value as well, which is
1625 interpreted relatively to the total number of premises of the rule in
1626 the target context. This form of declaration is stable when exported
1627 from a nested 'context' with additional assumptions. It is the
1628 preferred form for definitional packages, notably cases/rules produced
1629 in HOL/inductive and HOL/function.
1631 * More informative error messages for Isar proof commands involving
1632 lazy enumerations (method applications etc.).
1634 * Refined 'help' command to retrieve outer syntax commands according
1635 to name patterns (with clickable results).
1638 *** Prover IDE -- Isabelle/Scala/jEdit ***
1640 * Parallel terminal proofs ('by') are enabled by default, likewise
1641 proofs that are built into packages like 'datatype', 'function'. This
1642 allows to "run ahead" checking the theory specifications on the
1643 surface, while the prover is still crunching on internal
1644 justifications. Unfinished / cancelled proofs are restarted as
1645 required to complete full proof checking eventually.
1647 * Improved output panel with tooltips, hyperlinks etc. based on the
1648 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
1649 tooltips leads to some window that supports the same recursively,
1650 which can lead to stacks of tooltips as the semantic document content
1651 is explored. ESCAPE closes the whole stack, individual windows may be
1652 closed separately, or detached to become independent jEdit dockables.
1654 * Improved support for commands that produce graph output: the text
1655 message contains a clickable area to open a new instance of the graph
1658 * More robust incremental parsing of outer syntax (partial comments,
1659 malformed symbols). Changing the balance of open/close quotes and
1660 comment delimiters works more conveniently with unfinished situations
1661 that frequently occur in user interaction.
1663 * More efficient painting and improved reactivity when editing large
1664 files. More scalable management of formal document content.
1666 * Smarter handling of tracing messages: prover process pauses after
1667 certain number of messages per command transaction, with some user
1668 dialog to stop or continue. This avoids swamping the front-end with
1669 potentially infinite message streams.
1671 * More plugin options and preferences, based on Isabelle/Scala. The
1672 jEdit plugin option panel provides access to some Isabelle/Scala
1673 options, including tuning parameters for editor reactivity and color
1676 * Dockable window "Symbols" provides some editing support for Isabelle
1679 * Dockable window "Monitor" shows ML runtime statistics. Note that
1680 continuous display of the chart slows down the system.
1682 * Improved editing support for control styles: subscript, superscript,
1683 bold, reset of style -- operating on single symbols or text
1684 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
1686 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
1687 adjust the main text area font size, and its derivatives for output,
1688 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
1689 need to be adapted to local keyboard layouts.
1691 * More reactive completion popup by default: use \t (TAB) instead of
1692 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
1693 also "Plugin Options / SideKick / General / Code Completion Options".
1695 * Implicit check and build dialog of the specified logic session
1696 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
1697 demand, without bundling big platform-dependent heap images in the
1698 Isabelle distribution.
1700 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
1701 from Oracle provide better multi-platform experience. This version is
1702 now bundled exclusively with Isabelle.
1707 * Code generation for Haskell: restrict unqualified imports from
1708 Haskell Prelude to a small set of fundamental operations.
1710 * Command 'export_code': relative file names are interpreted
1711 relatively to master directory of current theory rather than the
1712 rather arbitrary current working directory. INCOMPATIBILITY.
1714 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
1715 use regular rule composition via "OF" / "THEN", or explicit proof
1716 structure instead. Note that Isabelle/ML provides a variety of
1717 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
1718 with some care where this is really required.
1720 * Command 'typ' supports an additional variant with explicit sort
1721 constraint, to infer and check the most general type conforming to a
1722 given sort. Example (in HOL):
1724 typ "_ * _ * bool * unit" :: finite
1726 * Command 'locale_deps' visualizes all locales and their relations as
1734 - Added MaSh relevance filter based on machine-learning; see the
1735 Sledgehammer manual for details.
1736 - Polished Isar proofs generated with "isar_proofs" option.
1737 - Rationalized type encodings ("type_enc" option).
1738 - Renamed "kill_provers" subcommand to "kill_all".
1740 isar_proof ~> isar_proofs
1741 isar_shrink_factor ~> isar_shrink
1742 max_relevant ~> max_facts
1743 relevance_thresholds ~> fact_thresholds
1745 * Quickcheck: added an optimisation for equality premises. It is
1746 switched on by default, and can be switched off by setting the
1747 configuration quickcheck_optimise_equality to false.
1749 * Quotient: only one quotient can be defined by quotient_type
1753 - generation of an abstraction function equation in lift_definition
1754 - quot_del attribute
1755 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
1757 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
1760 * Preprocessing of the code generator rewrites set comprehensions into
1761 pointfree expressions.
1763 * The SMT solver Z3 has now by default a restricted set of directly
1764 supported features. For the full set of features (div/mod, nonlinear
1765 arithmetic, datatypes/records) with potential proof reconstruction
1766 failures, enable the configuration option "z3_with_extensions". Minor
1769 * Simplified 'typedef' specifications: historical options for implicit
1770 set definition and alternative name have been discontinued. The
1771 former behavior of "typedef (open) t = A" is now the default, but
1772 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
1775 * Removed constant "chars"; prefer "Enum.enum" on type "char"
1776 directly. INCOMPATIBILITY.
1778 * Moved operation product, sublists and n_lists from theory Enum to
1779 List. INCOMPATIBILITY.
1781 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
1783 * Class "comm_monoid_diff" formalises properties of bounded
1784 subtraction, with natural numbers and multisets as typical instances.
1786 * Added combinator "Option.these" with type "'a option set => 'a set".
1788 * Theory "Transitive_Closure": renamed lemmas
1790 reflcl_tranclp -> reflclp_tranclp
1791 rtranclp_reflcl -> rtranclp_reflclp
1795 * Theory "Rings": renamed lemmas (in class semiring)
1797 left_distrib ~> distrib_right
1798 right_distrib ~> distrib_left
1802 * Generalized the definition of limits:
1804 - Introduced the predicate filterlim (LIM x F. f x :> G) which
1805 expresses that when the input values x converge to F then the
1806 output f x converges to G.
1808 - Added filters for convergence to positive (at_top) and negative
1811 - Moved infinity in the norm (at_infinity) from
1812 Multivariate_Analysis to Complex_Main.
1814 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
1819 * Theory "Library/Option_ord" provides instantiation of option type to
1820 lattice type classes.
1822 * Theory "Library/Multiset": renamed
1824 constant fold_mset ~> Multiset.fold
1825 fact fold_mset_commute ~> fold_mset_comm
1829 * Renamed theory Library/List_Prefix to Library/Sublist, with related
1832 - Renamed constants (and related lemmas)
1835 strict_prefix ~> prefix
1837 - Replaced constant "postfix" by "suffixeq" with swapped argument
1838 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
1839 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
1840 Renamed lemmas accordingly.
1842 - Added constant "list_hembeq" for homeomorphic embedding on
1843 lists. Added abbreviation "sublisteq" for special case
1844 "list_hembeq (op =)".
1846 - Theory Library/Sublist no longer provides "order" and "bot" type
1847 class instances for the prefix order (merely corresponding locale
1848 interpretations). The type class instances are now in theory
1849 Library/Prefix_Order.
1851 - The sublist relation of theory Library/Sublist_Order is now based
1852 on "Sublist.sublisteq". Renamed lemmas accordingly:
1854 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
1855 le_list_append_mono ~> Sublist.list_hembeq_append_mono
1856 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
1857 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
1858 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
1859 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
1860 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
1861 le_list_drop_many ~> Sublist.sublisteq_drop_many
1862 le_list_filter_left ~> Sublist.sublisteq_filter_left
1863 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
1864 le_list_rev_take_iff ~> Sublist.sublisteq_append
1865 le_list_same_length ~> Sublist.sublisteq_same_length
1866 le_list_take_many_iff ~> Sublist.sublisteq_append'
1867 less_eq_list.drop ~> less_eq_list_drop
1868 less_eq_list.induct ~> less_eq_list_induct
1869 not_le_list_length ~> Sublist.not_sublisteq_length
1873 * New theory Library/Countable_Set.
1875 * Theory Library/Debug and Library/Parallel provide debugging and
1876 parallel execution for code generated towards Isabelle/ML.
1878 * Theory Library/FuncSet: Extended support for Pi and extensional and
1879 introduce the extensional dependent function space "PiE". Replaced
1880 extensional_funcset by an abbreviation, and renamed lemmas from
1881 extensional_funcset to PiE as follows:
1883 extensional_empty ~> PiE_empty
1884 extensional_funcset_empty_domain ~> PiE_empty_domain
1885 extensional_funcset_empty_range ~> PiE_empty_range
1886 extensional_funcset_arb ~> PiE_arb
1887 extensional_funcset_mem ~> PiE_mem
1888 extensional_funcset_extend_domainI ~> PiE_fun_upd
1889 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
1890 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
1891 card_extensional_funcset ~> card_PiE
1892 finite_extensional_funcset ~> finite_PiE
1896 * Theory Library/FinFun: theory of almost everywhere constant
1897 functions (supersedes the AFP entry "Code Generation for Functions as
1900 * Theory Library/Phantom: generic phantom type to make a type
1901 parameter appear in a constant's type. This alternative to adding
1902 TYPE('a) as another parameter avoids unnecessary closures in generated
1905 * Theory Library/RBT_Impl: efficient construction of red-black trees
1906 from sorted associative lists. Merging two trees with rbt_union may
1907 return a structurally different tree than before. Potential
1910 * Theory Library/IArray: immutable arrays with code generation.
1912 * Theory Library/Finite_Lattice: theory of finite lattices.
1914 * HOL/Multivariate_Analysis: replaced
1916 "basis :: 'a::euclidean_space => nat => real"
1917 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
1919 on euclidean spaces by using the inner product "_ \<bullet> _" with
1920 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
1921 "SUM i : Basis. f i * r i".
1923 With this change the following constants are also changed or removed:
1925 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
1926 a $$ i ~> inner a i (where i : Basis)
1928 \<pi>, \<pi>' removed
1930 Theorems about these constants where removed.
1934 component_le_norm ~> Basis_le_norm
1935 euclidean_eq ~> euclidean_eq_iff
1936 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
1937 euclidean_simps ~> inner_simps
1938 independent_basis ~> independent_Basis
1939 span_basis ~> span_Basis
1940 in_span_basis ~> in_span_Basis
1941 norm_bound_component_le ~> norm_boound_Basis_le
1942 norm_bound_component_lt ~> norm_boound_Basis_lt
1943 component_le_infnorm ~> Basis_le_infnorm
1949 - Added simproc "measurable" to automatically prove measurability.
1951 - Added induction rules for sigma sets with disjoint union
1952 (sigma_sets_induct_disjoint) and for Borel-measurable functions
1953 (borel_measurable_induct).
1955 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
1958 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
1959 AFP entry "Ordinals_and_Cardinals").
1961 * HOL/BNF: New (co)datatype package based on bounded natural functors
1962 with support for mixed, nested recursion and interesting non-free
1965 * HOL/Finite_Set and Relation: added new set and relation operations
1966 expressed by Finite_Set.fold.
1968 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
1969 trees for the code generator.
1971 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
1973 possible INCOMPATIBILITY.
1975 * HOL/Set: renamed Set.project -> Set.filter
1979 *** Document preparation ***
1981 * Dropped legacy antiquotations "term_style" and "thm_style", since
1982 styles may be given as arguments to "term" and "thm" already.
1983 Discontinued legacy styles "prem1" .. "prem19".
1985 * Default LaTeX rendering for \<euro> is now based on eurosym package,
1986 instead of slightly exotic babel/greek.
1988 * Document variant NAME may use different LaTeX entry point
1989 document/root_NAME.tex if that file exists, instead of the common
1992 * Simplified custom document/build script, instead of old-style
1993 document/IsaMakefile. Minor INCOMPATIBILITY.
1998 * The default limit for maximum number of worker threads is now 8,
1999 instead of 4, in correspondence to capabilities of contemporary
2000 hardware and Poly/ML runtime system.
2002 * Type Seq.results and related operations support embedded error
2003 messages within lazy enumerations, and thus allow to provide
2004 informative errors in the absence of any usable results.
2006 * Renamed Position.str_of to Position.here to emphasize that this is a
2007 formal device to inline positions into message text, but not
2008 necessarily printing visible text.
2013 * Advanced support for Isabelle sessions and build management, see
2014 "system" manual for the chapter of that name, especially the "isabelle
2015 build" tool and its examples. The "isabelle mkroot" tool prepares
2016 session root directories for use with "isabelle build", similar to
2017 former "isabelle mkdir" for "isabelle usedir". Note that this affects
2018 document preparation as well. INCOMPATIBILITY, isabelle usedir /
2019 mkdir / make are rendered obsolete.
2021 * Discontinued obsolete Isabelle/build script, it is superseded by the
2022 regular isabelle build tool. For example:
2024 isabelle build -s -b HOL
2026 * Discontinued obsolete "isabelle makeall".
2028 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
2029 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
2030 provides some traditional targets that invoke "isabelle build". Note
2031 that this is inefficient! Applications of Isabelle/HOL involving
2032 "isabelle make" should be upgraded to use "isabelle build" directly.
2034 * The "isabelle options" tool prints Isabelle system options, as
2035 required for "isabelle build", for example.
2037 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
2038 Minor INCOMPATIBILITY in command-line options.
2040 * The "isabelle install" tool has now a simpler command-line. Minor
2043 * The "isabelle components" tool helps to resolve add-on components
2044 that are not bundled, or referenced from a bare-bones repository
2045 version of Isabelle.
2047 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
2048 platform family: "linux", "macos", "windows".
2050 * The ML system is configured as regular component, and no longer
2051 picked up from some surrounding directory. Potential INCOMPATIBILITY
2052 for home-made settings.
2054 * Improved ML runtime statistics (heap, threads, future tasks etc.).
2056 * Discontinued support for Poly/ML 5.2.1, which was the last version
2057 without exception positions and advanced ML compiler/toplevel
2060 * Discontinued special treatment of Proof General -- no longer guess
2061 PROOFGENERAL_HOME based on accidental file-system layout. Minor
2062 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
2063 settings manually, or use a Proof General version that has been
2064 bundled as Isabelle component.
2068 New in Isabelle2012 (May 2012)
2069 ------------------------------
2073 * Prover IDE (PIDE) improvements:
2075 - more robust Sledgehammer integration (as before the sledgehammer
2076 command-line needs to be typed into the source buffer)
2077 - markup for bound variables
2078 - markup for types of term variables (displayed as tooltips)
2079 - support for user-defined Isar commands within the running session
2080 - improved support for Unicode outside original 16bit range
2081 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
2083 * Forward declaration of outer syntax keywords within the theory
2084 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
2085 commands to be used in the same theory where defined.
2087 * Auxiliary contexts indicate block structure for specifications with
2088 additional parameters and assumptions. Such unnamed contexts may be
2089 nested within other targets, like 'theory', 'locale', 'class',
2090 'instantiation' etc. Results from the local context are generalized
2091 accordingly and applied to the enclosing target context. Example:
2095 assumes xy: "x = y" and yz: "y = z"
2098 lemma my_trans: "x = z" using xy yz by simp
2104 The most basic application is to factor-out context elements of
2105 several fixes/assumes/shows theorem statements, e.g. see
2106 ~~/src/HOL/Isar_Examples/Group_Context.thy
2108 Any other local theory specification element works within the "context
2109 ... begin ... end" block as well.
2111 * Bundled declarations associate attributed fact expressions with a
2112 given name in the context. These may be later included in other
2113 contexts. This allows to manage context extensions casually, without
2114 the logical dependencies of locales and locale interpretation. See
2115 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
2117 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
2118 declaration, and results are standardized before being stored. Thus
2119 old-style "standard" after instantiation or composition of facts
2120 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
2121 indices of schematic variables.
2123 * Rule attributes in local theory declarations (e.g. locale or class)
2124 are now statically evaluated: the resulting theorem is stored instead
2125 of the original expression. INCOMPATIBILITY in rare situations, where
2126 the historic accident of dynamic re-evaluation in interpretations
2129 * New tutorial "Programming and Proving in Isabelle/HOL"
2130 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
2131 Structured Isar Proofs" ("isar-overview"), which has been removed. It
2132 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
2133 Logic" as the recommended beginners tutorial, but does not cover all
2134 of the material of that old tutorial.
2136 * Updated and extended reference manuals: "isar-ref",
2137 "implementation", "system"; reduced remaining material in old "ref"
2143 * Command 'definition' no longer exports the foundational "raw_def"
2144 into the user context. Minor INCOMPATIBILITY, may use the regular
2145 "def" result with attribute "abs_def" to imitate the old version.
2147 * Attribute "abs_def" turns an equation of the form "f x y == t" into
2148 "f == %x y. t", which ensures that "simp" or "unfold" steps always
2149 expand it. This also works for object-logic equality. (Formerly
2150 undocumented feature.)
2152 * Sort constraints are now propagated in simultaneous statements, just
2153 like type constraints. INCOMPATIBILITY in rare situations, where
2154 distinct sorts used to be assigned accidentally. For example:
2156 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
2158 lemma "P (x::'a)" and "Q (y::'a::bar)"
2159 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
2161 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
2162 tolerant against multiple unifiers, as long as the final result is
2163 unique. (As before, rules are composed in canonical right-to-left
2164 order to accommodate newly introduced premises.)
2166 * Renamed some inner syntax categories:
2172 Minor INCOMPATIBILITY. Note that in practice "num_const" or
2173 "num_position" etc. are mainly used instead (which also include
2174 position information via constraints).
2176 * Simplified configuration options for syntax ambiguity: see
2177 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
2178 manual. Minor INCOMPATIBILITY.
2180 * Discontinued configuration option "syntax_positions": atomic terms
2181 in parse trees are always annotated by position constraints.
2183 * Old code generator for SML and its commands 'code_module',
2184 'code_library', 'consts_code', 'types_code' have been discontinued.
2185 Use commands of the generic code generator instead. INCOMPATIBILITY.
2187 * Redundant attribute "code_inline" has been discontinued. Use
2188 "code_unfold" instead. INCOMPATIBILITY.
2190 * Dropped attribute "code_unfold_post" in favor of the its dual
2191 "code_abbrev", which yields a common pattern in definitions like
2193 definition [code_abbrev]: "f = t"
2197 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
2198 instead. INCOMPATIBILITY.
2200 * Discontinued old "prems" fact, which used to refer to the accidental
2201 collection of foundational premises in the context (already marked as
2202 legacy since Isabelle2011).
2207 * Type 'a set is now a proper type constructor (just as before
2208 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
2209 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
2210 sets separate, it is often sufficient to rephrase some set S that has
2211 been accidentally used as predicates by "%x. x : S", and some
2212 predicate P that has been accidentally used as set by "{x. P x}".
2213 Corresponding proofs in a first step should be pruned from any
2214 tinkering with former theorems mem_def and Collect_def as far as
2217 For developments which deliberately mix predicates and sets, a
2218 planning step is necessary to determine what should become a predicate
2219 and what a set. It can be helpful to carry out that step in
2220 Isabelle2011-1 before jumping right into the current release.
2222 * Code generation by default implements sets as container type rather
2223 than predicates. INCOMPATIBILITY.
2225 * New type synonym 'a rel = ('a * 'a) set
2227 * The representation of numerals has changed. Datatype "num"
2228 represents strictly positive binary numerals, along with functions
2229 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
2230 positive and negated numeric literals, respectively. See also
2231 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
2232 user theories may require adaptations as follows:
2234 - Theorems with number_ring or number_semiring constraints: These
2235 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
2237 - Theories defining numeric types: Remove number, number_semiring,
2238 and number_ring instances. Defer all theorems about numerals until
2239 after classes one and semigroup_add have been instantiated.
2241 - Numeral-only simp rules: Replace each rule having a "number_of v"
2242 pattern with two copies, one for numeral and one for neg_numeral.
2244 - Theorems about subclasses of semiring_1 or ring_1: These classes
2245 automatically support numerals now, so more simp rules and
2246 simprocs may now apply within the proof.
2248 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
2249 Redefine using other integer operations.
2251 * Transfer: New package intended to generalize the existing
2252 "descending" method and related theorem attributes from the Quotient
2253 package. (Not all functionality is implemented yet, but future
2254 development will focus on Transfer as an eventual replacement for the
2255 corresponding parts of the Quotient package.)
2257 - transfer_rule attribute: Maintains a collection of transfer rules,
2258 which relate constants at two different types. Transfer rules may
2259 relate different type instances of the same polymorphic constant,
2260 or they may relate an operation on a raw type to a corresponding
2261 operation on an abstract type (quotient or subtype). For example:
2263 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
2264 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
2266 - transfer method: Replaces a subgoal on abstract types with an
2267 equivalent subgoal on the corresponding raw types. Constants are
2268 replaced with corresponding ones according to the transfer rules.
2269 Goals are generalized over all free variables by default; this is
2270 necessary for variables whose types change, but can be overridden
2271 for specific variables with e.g. "transfer fixing: x y z". The
2272 variant transfer' method allows replacing a subgoal with one that
2273 is logically stronger (rather than equivalent).
2275 - relator_eq attribute: Collects identity laws for relators of
2276 various type constructors, e.g. "list_all2 (op =) = (op =)". The
2277 transfer method uses these lemmas to infer transfer rules for
2278 non-polymorphic constants on the fly.
2280 - transfer_prover method: Assists with proving a transfer rule for a
2281 new constant, provided the constant is defined in terms of other
2282 constants that already have transfer rules. It should be applied
2283 after unfolding the constant definitions.
2285 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
2286 from type nat to type int.
2288 * Lifting: New package intended to generalize the quotient_definition
2289 facility of the Quotient package; designed to work with Transfer.
2291 - lift_definition command: Defines operations on an abstract type in
2292 terms of a corresponding operation on a representation
2293 type. Example syntax:
2295 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
2298 Users must discharge a respectfulness proof obligation when each
2299 constant is defined. (For a type copy, i.e. a typedef with UNIV,
2300 the proof is discharged automatically.) The obligation is
2301 presented in a user-friendly, readable form; a respectfulness
2302 theorem in the standard format and a transfer rule are generated
2305 - Integration with code_abstype: For typedefs (e.g. subtypes
2306 corresponding to a datatype invariant, such as dlist),
2307 lift_definition generates a code certificate theorem and sets up
2308 code generation for each constant.
2310 - setup_lifting command: Sets up the Lifting package to work with a
2311 user-defined type. The user must provide either a quotient theorem
2312 or a type_definition theorem. The package configures transfer
2313 rules for equality and quantifiers on the type, and sets up the
2314 lift_definition command to work with the type.
2316 - Usage examples: See Quotient_Examples/Lift_DList.thy,
2317 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
2318 Word/Word.thy and Library/Float.thy.
2322 - The 'quotient_type' command now supports a 'morphisms' option with
2323 rep and abs functions, similar to typedef.
2325 - 'quotient_type' sets up new types to work with the Lifting and
2326 Transfer packages, as with 'setup_lifting'.
2328 - The 'quotient_definition' command now requires the user to prove a
2329 respectfulness property at the point where the constant is
2330 defined, similar to lift_definition; INCOMPATIBILITY.
2332 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
2333 accordingly, INCOMPATIBILITY.
2335 * New diagnostic command 'find_unused_assms' to find potentially
2336 superfluous assumptions in theorems using Quickcheck.
2340 - Quickcheck returns variable assignments as counterexamples, which
2341 allows to reveal the underspecification of functions under test.
2342 For example, refuting "hd xs = x", it presents the variable
2343 assignment xs = [] and x = a1 as a counterexample, assuming that
2344 any property is false whenever "hd []" occurs in it.
2346 These counterexample are marked as potentially spurious, as
2347 Quickcheck also returns "xs = []" as a counterexample to the
2348 obvious theorem "hd xs = hd xs".
2350 After finding a potentially spurious counterexample, Quickcheck
2351 continues searching for genuine ones.
2353 By default, Quickcheck shows potentially spurious and genuine
2354 counterexamples. The option "genuine_only" sets quickcheck to only
2355 show genuine counterexamples.
2357 - The command 'quickcheck_generator' creates random and exhaustive
2358 value generators for a given type and operations.
2360 It generates values by using the operations as if they were
2361 constructors of that type.
2363 - Support for multisets.
2365 - Added "use_subtype" options.
2367 - Added "quickcheck_locale" configuration to specify how to process
2368 conjectures in a locale context.
2370 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
2371 and affecting 'rat' and 'real'.
2374 - Integrated more tightly with SPASS, as described in the ITP 2012
2375 paper "More SPASS with Isabelle".
2376 - Made it try "smt" as a fallback if "metis" fails or times out.
2377 - Added support for the following provers: Alt-Ergo (via Why3 and
2378 TFF1), iProver, iProver-Eq.
2379 - Sped up the minimizer.
2380 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
2381 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
2382 - Renamed "sound" option to "strict".
2384 * Metis: Added possibility to specify lambda translations scheme as a
2385 parenthesized argument (e.g., "by (metis (lifting) ...)").
2387 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
2389 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
2391 * New "case_product" attribute to generate a case rule doing multiple
2392 case distinctions at the same time. E.g.
2394 list.exhaust [case_product nat.exhaust]
2396 produces a rule which can be used to perform case distinction on both
2399 * New "eventually_elim" method as a generalized variant of the
2400 eventually_elim* rules. Supports structured proofs.
2402 * Typedef with implicit set definition is considered legacy. Use
2403 "typedef (open)" form instead, which will eventually become the
2406 * Record: code generation can be switched off manually with
2408 declare [[record_coden = false]] -- "default true"
2410 * Datatype: type parameters allow explicit sort constraints.
2412 * Concrete syntax for case expressions includes constraints for source
2413 positions, and thus produces Prover IDE markup for its bindings.
2414 INCOMPATIBILITY for old-style syntax translations that augment the
2415 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
2418 * Clarified attribute "mono_set": pure declaration without modifying
2419 the result of the fact expression.
2421 * More default pred/set conversions on a couple of relation operations
2422 and predicates. Added powers of predicate relations. Consolidation
2423 of some relation theorems:
2425 converse_def ~> converse_unfold
2426 rel_comp_def ~> relcomp_unfold
2427 symp_def ~> (modified, use symp_def and sym_def instead)
2428 transp_def ~> transp_trans
2429 Domain_def ~> Domain_unfold
2430 Range_def ~> Domain_converse [symmetric]
2432 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
2434 See theory "Relation" for examples for making use of pred/set
2435 conversions by means of attributes "to_set" and "to_pred".
2439 * Renamed facts about the power operation on relations, i.e., relpow
2440 to match the constant's name:
2442 rel_pow_1 ~> relpow_1
2443 rel_pow_0_I ~> relpow_0_I
2444 rel_pow_Suc_I ~> relpow_Suc_I
2445 rel_pow_Suc_I2 ~> relpow_Suc_I2
2446 rel_pow_0_E ~> relpow_0_E
2447 rel_pow_Suc_E ~> relpow_Suc_E
2448 rel_pow_E ~> relpow_E
2449 rel_pow_Suc_D2 ~> relpow_Suc_D2
2450 rel_pow_Suc_E2 ~> relpow_Suc_E2
2451 rel_pow_Suc_D2' ~> relpow_Suc_D2'
2452 rel_pow_E2 ~> relpow_E2
2453 rel_pow_add ~> relpow_add
2454 rel_pow_commute ~> relpow
2455 rel_pow_empty ~> relpow_empty:
2456 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
2457 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
2458 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
2459 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
2460 rel_pow_fun_conv ~> relpow_fun_conv
2461 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
2462 rel_pow_finite_bounded ~> relpow_finite_bounded
2463 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
2464 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
2465 single_valued_rel_pow ~> single_valued_relpow
2469 * Theory Relation: Consolidated constant name for relation composition
2470 and corresponding theorem names:
2472 - Renamed constant rel_comp to relcomp.
2474 - Dropped abbreviation pred_comp. Use relcompp instead.
2478 rel_compI ~> relcompI
2479 rel_compEpair ~> relcompEpair
2480 rel_compE ~> relcompE
2481 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
2482 rel_comp_empty1 ~> relcomp_empty1
2483 rel_comp_mono ~> relcomp_mono
2484 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
2485 rel_comp_distrib ~> relcomp_distrib
2486 rel_comp_distrib2 ~> relcomp_distrib2
2487 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
2488 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
2489 single_valued_rel_comp ~> single_valued_relcomp
2490 rel_comp_def ~> relcomp_unfold
2491 converse_rel_comp ~> converse_relcomp
2492 pred_compI ~> relcomppI
2493 pred_compE ~> relcomppE
2494 pred_comp_bot1 ~> relcompp_bot1
2495 pred_comp_bot2 ~> relcompp_bot2
2496 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
2497 pred_comp_mono ~> relcompp_mono
2498 pred_comp_distrib ~> relcompp_distrib
2499 pred_comp_distrib2 ~> relcompp_distrib2
2500 converse_pred_comp ~> converse_relcompp
2502 finite_rel_comp ~> finite_relcomp
2504 set_rel_comp ~> set_relcomp
2508 * Theory Divides: Discontinued redundant theorems about div and mod.
2509 INCOMPATIBILITY, use the corresponding generic theorems instead.
2511 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
2512 zdiv_self ~> div_self
2513 zmod_self ~> mod_self
2516 zdiv_zmod_equality ~> div_mod_equality2
2517 zdiv_zmod_equality2 ~> div_mod_equality
2518 zmod_zdiv_trivial ~> mod_div_trivial
2519 zdiv_zminus_zminus ~> div_minus_minus
2520 zmod_zminus_zminus ~> mod_minus_minus
2521 zdiv_zminus2 ~> div_minus_right
2522 zmod_zminus2 ~> mod_minus_right
2523 zdiv_minus1_right ~> div_minus1_right
2524 zmod_minus1_right ~> mod_minus1_right
2525 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
2526 zmod_zmult1_eq ~> mod_mult_right_eq
2527 zpower_zmod ~> power_mod
2528 zdvd_zmod ~> dvd_mod
2529 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
2530 mod_mult_distrib ~> mult_mod_left
2531 mod_mult_distrib2 ~> mult_mod_right
2533 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
2534 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
2536 * Finite_Set.fold now qualified. INCOMPATIBILITY.
2538 * Consolidated theorem names concerning fold combinators:
2540 inf_INFI_fold_inf ~> inf_INF_fold_inf
2541 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
2542 INFI_fold_inf ~> INF_fold_inf
2543 SUPR_fold_sup ~> SUP_fold_sup
2544 union_set ~> union_set_fold
2545 minus_set ~> minus_set_fold
2546 INFI_set_fold ~> INF_set_fold
2547 SUPR_set_fold ~> SUP_set_fold
2548 INF_code ~> INF_set_foldr
2549 SUP_code ~> SUP_set_foldr
2550 foldr.simps ~> foldr.simps (in point-free formulation)
2551 foldr_fold_rev ~> foldr_conv_fold
2552 foldl_fold ~> foldl_conv_fold
2553 foldr_foldr ~> foldr_conv_foldl
2554 foldl_foldr ~> foldl_conv_foldr
2555 fold_set_remdups ~> fold_set_fold_remdups
2556 fold_set ~> fold_set_fold
2557 fold1_set ~> fold1_set_fold
2561 * Dropped rarely useful theorems concerning fold combinators:
2562 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
2563 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
2564 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
2565 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
2566 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
2567 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
2568 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
2569 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
2570 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
2571 unfolding "foldr_conv_fold" and "foldl_conv_fold".
2573 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
2574 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
2575 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
2576 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
2577 lemmas over fold rather than foldr, or make use of lemmas
2578 fold_conv_foldr and fold_rev.
2580 * Congruence rules Option.map_cong and Option.bind_cong for recursion
2581 through option types.
2583 * "Transitive_Closure.ntrancl": bounded transitive closure on
2586 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
2588 * Theory Int: Discontinued many legacy theorems specific to type int.
2589 INCOMPATIBILITY, use the corresponding generic theorems instead.
2591 zminus_zminus ~> minus_minus
2592 zminus_0 ~> minus_zero
2593 zminus_zadd_distrib ~> minus_add_distrib
2594 zadd_commute ~> add_commute
2595 zadd_assoc ~> add_assoc
2596 zadd_left_commute ~> add_left_commute
2599 zadd_0 ~> add_0_left
2600 zadd_0_right ~> add_0_right
2601 zadd_zminus_inverse2 ~> left_minus
2602 zmult_zminus ~> mult_minus_left
2603 zmult_commute ~> mult_commute
2604 zmult_assoc ~> mult_assoc
2605 zadd_zmult_distrib ~> left_distrib
2606 zadd_zmult_distrib2 ~> right_distrib
2607 zdiff_zmult_distrib ~> left_diff_distrib
2608 zdiff_zmult_distrib2 ~> right_diff_distrib
2609 zmult_1 ~> mult_1_left
2610 zmult_1_right ~> mult_1_right
2611 zle_refl ~> order_refl
2612 zle_trans ~> order_trans
2613 zle_antisym ~> order_antisym
2614 zle_linear ~> linorder_linear
2615 zless_linear ~> linorder_less_linear
2616 zadd_left_mono ~> add_left_mono
2617 zadd_strict_right_mono ~> add_strict_right_mono
2618 zadd_zless_mono ~> add_less_le_mono
2619 int_0_less_1 ~> zero_less_one
2620 int_0_neq_1 ~> zero_neq_one
2622 zpower_zadd_distrib ~> power_add
2623 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
2624 zero_le_zpower_abs ~> zero_le_power_abs
2626 * Theory Deriv: Renamed
2628 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
2630 * Theory Library/Multiset: Improved code generation of multisets.
2632 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
2633 are expressed via type classes again. The special syntax
2634 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
2635 setsum_set, which is now subsumed by Big_Operators.setsum.
2638 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
2639 use theory HOL/Library/Nat_Bijection instead.
2641 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
2642 trees is now inside a type class context. Names of affected
2643 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
2644 theories working directly with raw red-black trees, adapt the names as
2648 bulkload -> rbt_bulkload
2649 del_from_left -> rbt_del_from_left
2650 del_from_right -> rbt_del_from_right
2652 delete -> rbt_delete
2654 insert -> rbt_insert
2655 insertw -> rbt_insert_with
2656 insert_with_key -> rbt_insert_with_key
2657 map_entry -> rbt_map_entry
2658 lookup -> rbt_lookup
2659 sorted -> rbt_sorted
2660 tree_greater -> rbt_greater
2661 tree_less -> rbt_less
2662 tree_less_symbol -> rbt_less_symbol
2664 union_with -> rbt_union_with
2665 union_with_key -> rbt_union_with_key
2668 balance_left_sorted -> balance_left_rbt_sorted
2669 balance_left_tree_greater -> balance_left_rbt_greater
2670 balance_left_tree_less -> balance_left_rbt_less
2671 balance_right_sorted -> balance_right_rbt_sorted
2672 balance_right_tree_greater -> balance_right_rbt_greater
2673 balance_right_tree_less -> balance_right_rbt_less
2674 balance_sorted -> balance_rbt_sorted
2675 balance_tree_greater -> balance_rbt_greater
2676 balance_tree_less -> balance_rbt_less
2677 bulkload_is_rbt -> rbt_bulkload_is_rbt
2678 combine_sorted -> combine_rbt_sorted
2679 combine_tree_greater -> combine_rbt_greater
2680 combine_tree_less -> combine_rbt_less
2681 delete_in_tree -> rbt_delete_in_tree
2682 delete_is_rbt -> rbt_delete_is_rbt
2683 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
2684 del_from_left_tree_less -> rbt_del_from_left_rbt_less
2685 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
2686 del_from_right_tree_less -> rbt_del_from_right_rbt_less
2687 del_in_tree -> rbt_del_in_tree
2688 del_inv1_inv2 -> rbt_del_inv1_inv2
2689 del_sorted -> rbt_del_rbt_sorted
2690 del_tree_greater -> rbt_del_rbt_greater
2691 del_tree_less -> rbt_del_rbt_less
2692 dom_lookup_Branch -> dom_rbt_lookup_Branch
2693 entries_lookup -> entries_rbt_lookup
2694 finite_dom_lookup -> finite_dom_rbt_lookup
2695 insert_sorted -> rbt_insert_rbt_sorted
2696 insertw_is_rbt -> rbt_insertw_is_rbt
2697 insertwk_is_rbt -> rbt_insertwk_is_rbt
2698 insertwk_sorted -> rbt_insertwk_rbt_sorted
2699 insertw_sorted -> rbt_insertw_rbt_sorted
2700 ins_sorted -> ins_rbt_sorted
2701 ins_tree_greater -> ins_rbt_greater
2702 ins_tree_less -> ins_rbt_less
2703 is_rbt_sorted -> is_rbt_rbt_sorted
2704 lookup_balance -> rbt_lookup_balance
2705 lookup_bulkload -> rbt_lookup_rbt_bulkload
2706 lookup_delete -> rbt_lookup_rbt_delete
2707 lookup_Empty -> rbt_lookup_Empty
2708 lookup_from_in_tree -> rbt_lookup_from_in_tree
2709 lookup_in_tree -> rbt_lookup_in_tree
2710 lookup_ins -> rbt_lookup_ins
2711 lookup_insert -> rbt_lookup_rbt_insert
2712 lookup_insertw -> rbt_lookup_rbt_insertw
2713 lookup_insertwk -> rbt_lookup_rbt_insertwk
2714 lookup_keys -> rbt_lookup_keys
2715 lookup_map -> rbt_lookup_map
2716 lookup_map_entry -> rbt_lookup_rbt_map_entry
2717 lookup_tree_greater -> rbt_lookup_rbt_greater
2718 lookup_tree_less -> rbt_lookup_rbt_less
2719 lookup_union -> rbt_lookup_rbt_union
2720 map_entry_color_of -> rbt_map_entry_color_of
2721 map_entry_inv1 -> rbt_map_entry_inv1
2722 map_entry_inv2 -> rbt_map_entry_inv2
2723 map_entry_is_rbt -> rbt_map_entry_is_rbt
2724 map_entry_sorted -> rbt_map_entry_rbt_sorted
2725 map_entry_tree_greater -> rbt_map_entry_rbt_greater
2726 map_entry_tree_less -> rbt_map_entry_rbt_less
2727 map_tree_greater -> map_rbt_greater
2728 map_tree_less -> map_rbt_less
2729 map_sorted -> map_rbt_sorted
2730 paint_sorted -> paint_rbt_sorted
2731 paint_lookup -> paint_rbt_lookup
2732 paint_tree_greater -> paint_rbt_greater
2733 paint_tree_less -> paint_rbt_less
2734 sorted_entries -> rbt_sorted_entries
2735 tree_greater_eq_trans -> rbt_greater_eq_trans
2736 tree_greater_nit -> rbt_greater_nit
2737 tree_greater_prop -> rbt_greater_prop
2738 tree_greater_simps -> rbt_greater_simps
2739 tree_greater_trans -> rbt_greater_trans
2740 tree_less_eq_trans -> rbt_less_eq_trans
2741 tree_less_nit -> rbt_less_nit
2742 tree_less_prop -> rbt_less_prop
2743 tree_less_simps -> rbt_less_simps
2744 tree_less_trans -> rbt_less_trans
2745 tree_ord_props -> rbt_ord_props
2746 union_Branch -> rbt_union_Branch
2747 union_is_rbt -> rbt_union_is_rbt
2748 unionw_is_rbt -> rbt_unionw_is_rbt
2749 unionwk_is_rbt -> rbt_unionwk_is_rbt
2750 unionwk_sorted -> rbt_unionwk_rbt_sorted
2752 * Theory HOL/Library/Float: Floating point numbers are now defined as
2753 a subset of the real numbers. All operations are defined using the
2754 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
2761 round_down -> float_round_down
2762 round_up -> float_round_up
2766 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
2769 abs_float_def -> Float.compute_float_abs
2770 bitlen_ge0 -> bitlen_nonneg
2771 bitlen.simps -> Float.compute_bitlen
2772 float_components -> Float_mantissa_exponent
2773 float_divl.simps -> Float.compute_float_divl
2774 float_divr.simps -> Float.compute_float_divr
2775 float_eq_odd -> mult_powr_eq_mult_powr_iff
2776 float_power -> real_of_float_power
2777 lapprox_posrat_def -> Float.compute_lapprox_posrat
2778 lapprox_rat.simps -> Float.compute_lapprox_rat
2779 le_float_def' -> Float.compute_float_le
2780 le_float_def -> less_eq_float.rep_eq
2781 less_float_def' -> Float.compute_float_less
2782 less_float_def -> less_float.rep_eq
2783 normfloat_def -> Float.compute_normfloat
2784 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
2785 normfloat -> normfloat_def
2786 normfloat_unique -> use normfloat_def
2787 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
2788 one_float_def -> Float.compute_float_one
2789 plus_float_def -> Float.compute_float_plus
2790 rapprox_posrat_def -> Float.compute_rapprox_posrat
2791 rapprox_rat.simps -> Float.compute_rapprox_rat
2792 real_of_float_0 -> zero_float.rep_eq
2793 real_of_float_1 -> one_float.rep_eq
2794 real_of_float_abs -> abs_float.rep_eq
2795 real_of_float_add -> plus_float.rep_eq
2796 real_of_float_minus -> uminus_float.rep_eq
2797 real_of_float_mult -> times_float.rep_eq
2798 real_of_float_simp -> Float.rep_eq
2799 real_of_float_sub -> minus_float.rep_eq
2800 round_down.simps -> Float.compute_float_round_down
2801 round_up.simps -> Float.compute_float_round_up
2802 times_float_def -> Float.compute_float_times
2803 uminus_float_def -> Float.compute_float_uminus
2804 zero_float_def -> Float.compute_float_zero
2806 Lemmas not necessary anymore, use the transfer method:
2807 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
2808 float_divr, float_le_simp, float_less1_mantissa_bound,
2809 float_less_simp, float_less_zero, float_le_zero,
2810 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
2811 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
2812 lapprox_rat_bottom, normalized_float, rapprox_posrat,
2813 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
2814 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
2815 round_up, zero_le_float, zero_less_float
2817 * New theory HOL/Library/DAList provides an abstract type for
2818 association lists with distinct keys.
2820 * Session HOL/IMP: Added new theory of abstract interpretation of
2823 * Session HOL-Import: Re-implementation from scratch is faster,
2824 simpler, and more scalable. Requires a proof bundle, which is
2825 available as an external component. Discontinued old (and mostly
2826 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
2828 * Session HOL-Word: Discontinued many redundant theorems specific to
2829 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
2832 word_sub_alt ~> word_sub_wi
2833 word_add_alt ~> word_add_def
2834 word_mult_alt ~> word_mult_def
2835 word_minus_alt ~> word_minus_def
2836 word_0_alt ~> word_0_wi
2837 word_1_alt ~> word_1_wi
2838 word_add_0 ~> add_0_left
2839 word_add_0_right ~> add_0_right
2840 word_mult_1 ~> mult_1_left
2841 word_mult_1_right ~> mult_1_right
2842 word_add_commute ~> add_commute
2843 word_add_assoc ~> add_assoc
2844 word_add_left_commute ~> add_left_commute
2845 word_mult_commute ~> mult_commute
2846 word_mult_assoc ~> mult_assoc
2847 word_mult_left_commute ~> mult_left_commute
2848 word_left_distrib ~> left_distrib
2849 word_right_distrib ~> right_distrib
2850 word_left_minus ~> left_minus
2851 word_diff_0_right ~> diff_0_right
2852 word_diff_self ~> diff_self
2853 word_sub_def ~> diff_minus
2854 word_diff_minus ~> diff_minus
2855 word_add_ac ~> add_ac
2856 word_mult_ac ~> mult_ac
2857 word_plus_ac0 ~> add_0_left add_0_right add_ac
2858 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
2859 word_order_trans ~> order_trans
2860 word_order_refl ~> order_refl
2861 word_order_antisym ~> order_antisym
2862 word_order_linear ~> linorder_linear
2863 lenw1_zero_neq_one ~> zero_neq_one
2864 word_number_of_eq ~> number_of_eq
2865 word_of_int_add_hom ~> wi_hom_add
2866 word_of_int_sub_hom ~> wi_hom_sub
2867 word_of_int_mult_hom ~> wi_hom_mult
2868 word_of_int_minus_hom ~> wi_hom_neg
2869 word_of_int_succ_hom ~> wi_hom_succ
2870 word_of_int_pred_hom ~> wi_hom_pred
2871 word_of_int_0_hom ~> word_0_wi
2872 word_of_int_1_hom ~> word_1_wi
2874 * Session HOL-Word: New proof method "word_bitwise" for splitting
2875 machine word equalities and inequalities into logical circuits,
2876 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
2877 multiplication, shifting by constants, bitwise operators and numeric
2878 constants. Requires fixed-length word types, not 'a word. Solves
2879 many standard word identities outright and converts more into first
2880 order problems amenable to blast or similar. See also examples in
2881 HOL/Word/Examples/WordExamples.thy.
2883 * Session HOL-Probability: Introduced the type "'a measure" to
2884 represent measures, this replaces the records 'a algebra and 'a
2885 measure_space. The locales based on subset_class now have two
2886 locale-parameters the space \<Omega> and the set of measurable sets M.
2887 The product of probability spaces uses now the same constant as the
2888 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
2889 measure". Most constants are defined now outside of locales and gain
2890 an additional parameter, like null_sets, almost_eventually or \<mu>'.
2891 Measure space constructions for distributions and densities now got
2892 their own constants distr and density. Instead of using locales to
2893 describe measure spaces with a finite space, the measure count_space
2894 and point_measure is introduced. INCOMPATIBILITY.
2898 finite_measure.\<mu>' -> measure
2899 product_algebra_generator -> prod_algebra
2900 product_prob_space.emb -> prod_emb
2901 product_prob_space.infprod_algebra -> PiM
2904 completeable_measure_space
2905 finite_measure_space
2907 finite_product_finite_prob_space
2908 finite_product_sigma_algebra
2909 finite_sigma_algebra
2911 pair_finite_prob_space
2912 pair_finite_sigma_algebra
2915 product_sigma_algebra
2919 distribution -> use distr measure, or distributed predicate
2921 joint_distribution -> use distr measure, or distributed predicate
2922 pair_measure_generator
2923 product_prob_space.infprod_algebra -> use PiM
2926 Replacement theorems:
2927 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
2928 finite_measure.empty_measure -> measure_empty
2929 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
2930 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
2931 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
2932 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
2933 finite_measure.finite_measure -> finite_measure.emeasure_finite
2934 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
2935 finite_measure.positive_measure' -> measure_nonneg
2936 finite_measure.real_measure -> finite_measure.emeasure_real
2937 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
2938 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
2939 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
2940 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
2941 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
2942 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
2943 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
2944 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
2945 information_space.entropy_commute -> information_space.entropy_commute_simple
2946 information_space.entropy_eq -> information_space.entropy_simple_distributed
2947 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
2948 information_space.entropy_positive -> information_space.entropy_nonneg_simple
2949 information_space.entropy_uniform_max -> information_space.entropy_uniform
2950 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
2951 information_space.KL_eq_0 -> information_space.KL_same_eq_0
2952 information_space.KL_ge_0 -> information_space.KL_nonneg
2953 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
2954 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
2955 Int_stable_cuboids -> Int_stable_atLeastAtMost
2956 Int_stable_product_algebra_generator -> positive_integral
2957 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
2958 measure_space.additive -> emeasure_additive
2959 measure_space.AE_iff_null_set -> AE_iff_null
2960 measure_space.almost_everywhere_def -> eventually_ae_filter
2961 measure_space.almost_everywhere_vimage -> AE_distrD
2962 measure_space.continuity_from_above -> INF_emeasure_decseq
2963 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
2964 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
2965 measure_space.continuity_from_below -> SUP_emeasure_incseq
2966 measure_space_density -> emeasure_density
2967 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
2968 measure_space.integrable_vimage -> integrable_distr
2969 measure_space.integral_translated_density -> integral_density
2970 measure_space.integral_vimage -> integral_distr
2971 measure_space.measure_additive -> plus_emeasure
2972 measure_space.measure_compl -> emeasure_compl
2973 measure_space.measure_countable_increasing -> emeasure_countable_increasing
2974 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
2975 measure_space.measure_decseq -> decseq_emeasure
2976 measure_space.measure_Diff -> emeasure_Diff
2977 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
2978 measure_space.measure_eq_0 -> emeasure_eq_0
2979 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
2980 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
2981 measure_space.measure_incseq -> incseq_emeasure
2982 measure_space.measure_insert -> emeasure_insert
2983 measure_space.measure_mono -> emeasure_mono
2984 measure_space.measure_not_negative -> emeasure_not_MInf
2985 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
2986 measure_space.measure_setsum -> setsum_emeasure
2987 measure_space.measure_setsum_split -> setsum_emeasure_cover
2988 measure_space.measure_space_vimage -> emeasure_distr
2989 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
2990 measure_space.measure_subadditive -> subadditive
2991 measure_space.measure_top -> emeasure_space
2992 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
2993 measure_space.measure_Un_null_set -> emeasure_Un_null_set
2994 measure_space.positive_integral_translated_density -> positive_integral_density
2995 measure_space.positive_integral_vimage -> positive_integral_distr
2996 measure_space.real_continuity_from_above -> Lim_measure_decseq
2997 measure_space.real_continuity_from_below -> Lim_measure_incseq
2998 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
2999 measure_space.real_measure_Diff -> measure_Diff
3000 measure_space.real_measure_finite_Union -> measure_finite_Union
3001 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
3002 measure_space.real_measure_subadditive -> measure_subadditive
3003 measure_space.real_measure_Union -> measure_Union
3004 measure_space.real_measure_UNION -> measure_UNION
3005 measure_space.simple_function_vimage -> simple_function_comp
3006 measure_space.simple_integral_vimage -> simple_integral_distr
3007 measure_space.simple_integral_vimage -> simple_integral_distr
3008 measure_unique_Int_stable -> measure_eqI_generator_eq
3009 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
3010 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
3011 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
3012 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
3013 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
3014 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
3015 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
3016 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
3017 pair_sigma_algebra.sets_swap -> sets_pair_swap
3018 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
3019 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
3020 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
3021 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
3022 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
3023 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
3024 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
3025 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
3026 prob_space.measure_space_1 -> prob_space.emeasure_space_1
3027 prob_space.prob_space_vimage -> prob_space_distr
3028 prob_space.random_variable_restrict -> measurable_restrict
3029 prob_space_unique_Int_stable -> measure_eqI_prob_space
3030 product_algebraE -> prod_algebraE_all
3031 product_algebra_generator_der -> prod_algebra_eq_finite
3032 product_algebra_generator_into_space -> prod_algebra_sets_into_space
3033 product_algebraI -> sets_PiM_I_finite
3034 product_measure_exists -> product_sigma_finite.sigma_finite
3035 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
3036 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
3037 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
3038 product_prob_space.measurable_component -> measurable_component_singleton
3039 product_prob_space.measurable_emb -> measurable_prod_emb
3040 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
3041 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
3042 product_prob_space.measure_emb -> emeasure_prod_emb
3043 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
3044 product_sigma_algebra.product_algebra_into_space -> space_closed
3045 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
3046 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
3047 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
3048 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
3049 sets_product_algebra -> sets_PiM
3050 sigma_algebra.measurable_sigma -> measurable_measure_of
3051 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
3052 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
3053 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
3054 space_product_algebra -> space_PiM
3056 * Session HOL-TPTP: support to parse and import TPTP problems (all
3057 languages) into Isabelle/HOL.
3062 * New "case_product" attribute (see HOL).
3067 * Greater support for structured proofs involving induction or case
3070 * Much greater use of mathematical symbols.
3072 * Removal of many ML theorem bindings. INCOMPATIBILITY.
3077 * Antiquotation @{keyword "name"} produces a parser for outer syntax
3078 from a minor keyword introduced via theory header declaration.
3080 * Antiquotation @{command_spec "name"} produces the
3081 Outer_Syntax.command_spec from a major keyword introduced via theory
3082 header declaration; it can be passed to Outer_Syntax.command etc.
3084 * Local_Theory.define no longer hard-wires default theorem name
3085 "foo_def", but retains the binding as given. If that is Binding.empty
3086 / Attrib.empty_binding, the result is not registered as user-level
3087 fact. The Local_Theory.define_internal variant allows to specify a
3088 non-empty name (used for the foundation in the background theory),
3089 while omitting the fact binding in the user-context. Potential
3090 INCOMPATIBILITY for derived definitional packages: need to specify
3091 naming policy for primitive definitions more explicitly.
3093 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
3094 conformance with similar operations in structure Term and Logic.
3096 * Antiquotation @{attributes [...]} embeds attribute source
3097 representation into the ML text, which is particularly useful with
3098 declarations like Local_Theory.note.
3100 * Structure Proof_Context follows standard naming scheme. Old
3101 ProofContext has been discontinued. INCOMPATIBILITY.
3103 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
3104 change of semantics: update is applied to auxiliary local theory
3107 * Modernized some old-style infix operations:
3109 addeqcongs ~> Simplifier.add_eqcong
3110 deleqcongs ~> Simplifier.del_eqcong
3111 addcongs ~> Simplifier.add_cong
3112 delcongs ~> Simplifier.del_cong
3113 setmksimps ~> Simplifier.set_mksimps
3114 setmkcong ~> Simplifier.set_mkcong
3115 setmksym ~> Simplifier.set_mksym
3116 setmkeqTrue ~> Simplifier.set_mkeqTrue
3117 settermless ~> Simplifier.set_termless
3118 setsubgoaler ~> Simplifier.set_subgoaler
3119 addsplits ~> Splitter.add_split
3120 delsplits ~> Splitter.del_split
3125 * USER_HOME settings variable points to cross-platform user home
3126 directory, which coincides with HOME on POSIX systems only. Likewise,
3127 the Isabelle path specification "~" now expands to $USER_HOME, instead
3128 of former $HOME. A different default for USER_HOME may be set
3129 explicitly in shell environment, before Isabelle settings are
3130 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
3131 the generic user home was intended.
3133 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
3134 notation, which is useful for the jEdit file browser, for example.
3136 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
3141 New in Isabelle2011-1 (October 2011)
3142 ------------------------------------
3146 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
3147 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
3149 - Management of multiple theory files directly from the editor
3150 buffer store -- bypassing the file-system (no requirement to save
3151 files for checking).
3153 - Markup of formal entities within the text buffer, with semantic
3154 highlighting, tooltips and hyperlinks to jump to defining source
3157 - Improved text rendering, with sub/superscripts in the source
3158 buffer (including support for copy/paste wrt. output panel, HTML
3159 theory output and other non-Isabelle text boxes).
3161 - Refined scheduling of proof checking and printing of results,
3162 based on interactive editor view. (Note: jEdit folding and
3163 narrowing allows to restrict buffer perspectives explicitly.)
3165 - Reduced CPU performance requirements, usable on machines with few
3168 - Reduced memory requirements due to pruning of unused document
3169 versions (garbage collection).
3171 See also ~~/src/Tools/jEdit/README.html for further information,
3172 including some remaining limitations.
3174 * Theory loader: source files are exclusively located via the master
3175 directory of each theory node (where the .thy file itself resides).
3176 The global load path (such as src/HOL/Library) has been discontinued.
3177 Note that the path element ~~ may be used to reference theories in the
3178 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
3181 * Theory loader: source files are identified by content via SHA1
3182 digests. Discontinued former path/modtime identification and optional
3183 ISABELLE_FILE_IDENT plugin scripts.
3185 * Parallelization of nested Isar proofs is subject to
3186 Goal.parallel_proofs_threshold (default 100). See also isabelle
3189 * Name space: former unsynchronized references are now proper
3190 configuration options, with more conventional names:
3192 long_names ~> names_long
3193 short_names ~> names_short
3194 unique_names ~> names_unique
3196 Minor INCOMPATIBILITY, need to declare options in context like this:
3198 declare [[names_unique = false]]
3200 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
3201 that the result needs to be unique, which means fact specifications
3202 may have to be refined after enriching a proof context.
3204 * Attribute "case_names" has been refined: the assumptions in each case
3205 can be named now by following the case name with [name1 name2 ...].
3207 * Isabelle/Isar reference manual has been updated and extended:
3208 - "Synopsis" provides a catalog of main Isar language concepts.
3209 - Formal references in syntax diagrams, via @{rail} antiquotation.
3210 - Updated material from classic "ref" manual, notably about
3211 "Classical Reasoner".
3216 * Class bot and top require underlying partial order rather than
3217 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
3219 * Class complete_lattice: generalized a couple of lemmas from sets;
3220 generalized theorems INF_cong and SUP_cong. New type classes for
3221 complete boolean algebras and complete linear orders. Lemmas
3222 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
3223 class complete_linorder.
3225 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
3226 Sup_fun_def, Inf_apply, Sup_apply.
3228 Removed redundant lemmas (the right hand side gives hints how to
3229 replace them for (metis ...), or (simp only: ...) proofs):
3231 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
3232 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
3233 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
3234 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
3235 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
3236 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
3237 Inter_def ~> INF_def, image_def
3238 Union_def ~> SUP_def, image_def
3239 INT_eq ~> INF_def, and image_def
3240 UN_eq ~> SUP_def, and image_def
3241 INF_subset ~> INF_superset_mono [OF _ order_refl]
3243 More consistent and comprehensive names:
3245 INTER_eq_Inter_image ~> INF_def
3246 UNION_eq_Union_image ~> SUP_def
3249 INF_leI ~> INF_lower
3250 INF_leI2 ~> INF_lower2
3251 le_INFI ~> INF_greatest
3252 le_SUPI ~> SUP_upper
3253 le_SUPI2 ~> SUP_upper2
3254 SUP_leI ~> SUP_least
3255 INFI_bool_eq ~> INF_bool_eq
3256 SUPR_bool_eq ~> SUP_bool_eq
3257 INFI_apply ~> INF_apply
3258 SUPR_apply ~> SUP_apply
3259 INTER_def ~> INTER_eq
3260 UNION_def ~> UNION_eq
3264 * Renamed theory Complete_Lattice to Complete_Lattices.
3267 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
3268 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
3269 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
3270 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
3272 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
3273 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
3274 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
3277 * Added syntactic classes "inf" and "sup" for the respective
3278 constants. INCOMPATIBILITY: Changes in the argument order of the
3279 (mostly internal) locale predicates for some derived classes.
3281 * Theorem collections ball_simps and bex_simps do not contain theorems
3282 referring to UNION any longer; these have been moved to collection
3283 UN_ball_bex_simps. INCOMPATIBILITY.
3285 * Theory Archimedean_Field: floor now is defined as parameter of a
3286 separate type class floor_ceiling.
3288 * Theory Finite_Set: more coherent development of fold_set locales:
3290 locale fun_left_comm ~> locale comp_fun_commute
3291 locale fun_left_comm_idem ~> locale comp_fun_idem
3293 Both use point-free characterization; interpretation proofs may need
3294 adjustment. INCOMPATIBILITY.
3296 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
3297 accordance with standard mathematical terminology. INCOMPATIBILITY.
3299 * Theory Complex_Main: The locale interpretations for the
3300 bounded_linear and bounded_bilinear locales have been removed, in
3301 order to reduce the number of duplicate lemmas. Users must use the
3302 original names for distributivity theorems, potential INCOMPATIBILITY.
3304 divide.add ~> add_divide_distrib
3305 divide.diff ~> diff_divide_distrib
3306 divide.setsum ~> setsum_divide_distrib
3307 mult.add_right ~> right_distrib
3308 mult.diff_right ~> right_diff_distrib
3309 mult_right.setsum ~> setsum_right_distrib
3310 mult_left.diff ~> left_diff_distrib
3312 * Theory Complex_Main: Several redundant theorems have been removed or
3313 replaced by more general versions. INCOMPATIBILITY.
3315 real_diff_def ~> minus_real_def
3316 real_divide_def ~> divide_real_def
3317 real_less_def ~> less_le
3318 real_abs_def ~> abs_real_def
3319 real_sgn_def ~> sgn_real_def
3320 real_mult_commute ~> mult_commute
3321 real_mult_assoc ~> mult_assoc
3322 real_mult_1 ~> mult_1_left
3323 real_add_mult_distrib ~> left_distrib
3324 real_zero_not_eq_one ~> zero_neq_one
3325 real_mult_inverse_left ~> left_inverse
3326 INVERSE_ZERO ~> inverse_zero
3327 real_le_refl ~> order_refl
3328 real_le_antisym ~> order_antisym
3329 real_le_trans ~> order_trans
3330 real_le_linear ~> linear
3331 real_le_eq_diff ~> le_iff_diff_le_0
3332 real_add_left_mono ~> add_left_mono
3333 real_mult_order ~> mult_pos_pos
3334 real_mult_less_mono2 ~> mult_strict_left_mono
3335 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
3336 real_0_le_divide_iff ~> zero_le_divide_iff
3337 realpow_two_disj ~> power2_eq_iff
3338 real_squared_diff_one_factored ~> square_diff_one_factored
3339 realpow_two_diff ~> square_diff_square_factored
3340 reals_complete2 ~> complete_real
3341 real_sum_squared_expand ~> power2_sum
3342 exp_ln_eq ~> ln_unique
3344 expi_zero ~> exp_zero
3345 lemma_DERIV_subst ~> DERIV_cong
3346 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
3347 LIMSEQ_const ~> tendsto_const
3348 LIMSEQ_norm ~> tendsto_norm
3349 LIMSEQ_add ~> tendsto_add
3350 LIMSEQ_minus ~> tendsto_minus
3351 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
3352 LIMSEQ_diff ~> tendsto_diff
3353 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
3354 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
3355 LIMSEQ_mult ~> tendsto_mult
3356 LIMSEQ_inverse ~> tendsto_inverse
3357 LIMSEQ_divide ~> tendsto_divide
3358 LIMSEQ_pow ~> tendsto_power
3359 LIMSEQ_setsum ~> tendsto_setsum
3360 LIMSEQ_setprod ~> tendsto_setprod
3361 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
3362 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
3363 LIMSEQ_imp_rabs ~> tendsto_rabs
3364 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
3365 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
3366 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
3367 LIMSEQ_Complex ~> tendsto_Complex
3368 LIM_ident ~> tendsto_ident_at
3369 LIM_const ~> tendsto_const
3370 LIM_add ~> tendsto_add
3371 LIM_add_zero ~> tendsto_add_zero
3372 LIM_minus ~> tendsto_minus
3373 LIM_diff ~> tendsto_diff
3374 LIM_norm ~> tendsto_norm
3375 LIM_norm_zero ~> tendsto_norm_zero
3376 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
3377 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
3378 LIM_rabs ~> tendsto_rabs
3379 LIM_rabs_zero ~> tendsto_rabs_zero
3380 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
3381 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
3382 LIM_compose ~> tendsto_compose
3383 LIM_mult ~> tendsto_mult
3384 LIM_scaleR ~> tendsto_scaleR
3385 LIM_of_real ~> tendsto_of_real
3386 LIM_power ~> tendsto_power
3387 LIM_inverse ~> tendsto_inverse
3388 LIM_sgn ~> tendsto_sgn
3389 isCont_LIM_compose ~> isCont_tendsto_compose
3390 bounded_linear.LIM ~> bounded_linear.tendsto
3391 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
3392 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
3393 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
3394 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
3395 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
3396 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
3398 * Theory Complex_Main: The definition of infinite series was
3399 generalized. Now it is defined on the type class {topological_space,
3400 comm_monoid_add}. Hence it is useable also for extended real numbers.
3402 * Theory Complex_Main: The complex exponential function "expi" is now
3403 a type-constrained abbreviation for "exp :: complex => complex"; thus
3404 several polymorphic lemmas about "exp" are now applicable to "expi".
3408 - Theory Library/Code_Char_ord provides native ordering of
3409 characters in the target language.
3411 - Commands code_module and code_library are legacy, use export_code
3414 - Method "evaluation" is legacy, use method "eval" instead.
3416 - Legacy evaluator "SML" is deactivated by default. May be
3417 reactivated by the following theory command:
3419 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
3421 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
3423 * New proof method "induction" that gives induction hypotheses the
3424 name "IH", thus distinguishing them from further hypotheses that come
3425 from rule induction. The latter are still called "hyps". Method
3426 "induction" is a thin wrapper around "induct" and follows the same
3429 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
3430 still available as a legacy feature for some time.
3433 - Added "need" and "total_consts" options.
3434 - Reintroduced "show_skolems" option by popular demand.
3435 - Renamed attribute: nitpick_def ~> nitpick_unfold.
3439 - Use quasi-sound (and efficient) translations by default.
3440 - Added support for the following provers: E-ToFoF, LEO-II,
3441 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
3442 - Automatically preplay and minimize proofs before showing them if
3443 this can be done within reasonable time.
3444 - sledgehammer available_provers ~> sledgehammer supported_provers.
3446 - Added "preplay_timeout", "slicing", "type_enc", "sound",
3447 "max_mono_iters", and "max_new_mono_instances" options.
3448 - Removed "explicit_apply" and "full_types" options as well as "Full
3449 Types" Proof General menu item. INCOMPATIBILITY.
3452 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
3453 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
3457 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
3458 "elim:" options. INCOMPATIBILITY.
3459 - Introduced 'try' that not only runs 'try_methods' but also
3460 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
3463 - Added "eval" option to evaluate terms for the found counterexample
3464 (currently only supported by the default (exhaustive) tester).
3465 - Added post-processing of terms to obtain readable counterexamples
3466 (currently only supported by the default (exhaustive) tester).
3467 - New counterexample generator quickcheck[narrowing] enables
3468 narrowing-based testing. Requires the Glasgow Haskell compiler
3469 with its installation location defined in the Isabelle settings
3470 environment as ISABELLE_GHC.
3471 - Removed quickcheck tester "SML" based on the SML code generator
3472 (formly in HOL/Library).
3474 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
3475 use 'partial_function' instead.
3477 * Theory Library/Extended_Reals replaces now the positive extended
3478 reals found in probability theory. This file is extended by
3479 Multivariate_Analysis/Extended_Real_Limits.
3481 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
3482 from where it must be imported explicitly if it is really required.
3485 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
3486 been moved here. INCOMPATIBILITY.
3488 * Theory Library/Saturated provides type of numbers with saturated
3491 * Theory Library/Product_Lattice defines a pointwise ordering for the
3492 product type 'a * 'b, and provides instance proofs for various order
3493 and lattice type classes.
3495 * Theory Library/Countable now provides the "countable_datatype" proof
3496 method for proving "countable" class instances for datatypes.
3498 * Theory Library/Cset_Monad allows do notation for computable sets
3499 (cset) via the generic monad ad-hoc overloading facility.
3501 * Library: Theories of common data structures are split into theories
3502 for implementation, an invariant-ensuring type, and connection to an
3503 abstract type. INCOMPATIBILITY.
3505 - RBT is split into RBT and RBT_Mapping.
3506 - AssocList is split and renamed into AList and AList_Mapping.
3507 - DList is split into DList_Impl, DList, and DList_Cset.
3508 - Cset is split into Cset and List_Cset.
3510 * Theory Library/Nat_Infinity has been renamed to
3511 Library/Extended_Nat, with name changes of the following types and
3514 type inat ~> type enat
3516 Infty ~> infinity (overloaded)
3520 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
3521 been renamed accordingly. INCOMPATIBILITY.
3523 * Session Multivariate_Analysis: The euclidean_space type class now
3524 fixes a constant "Basis :: 'a set" consisting of the standard
3525 orthonormal basis for the type. Users now have the option of
3526 quantifying over this set instead of using the "basis" function, e.g.
3527 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
3529 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
3530 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
3531 "Cart_nth" and "Cart_lambda" have been respectively renamed to
3532 "vec_nth" and "vec_lambda"; theorems mentioning those names have
3533 changed to match. Definition theorems for overloaded constants now use
3534 the standard "foo_vec_def" naming scheme. A few other theorems have
3535 been renamed as follows (INCOMPATIBILITY):
3537 Cart_eq ~> vec_eq_iff
3538 dist_nth_le_cart ~> dist_vec_nth_le
3539 tendsto_vector ~> vec_tendstoI
3540 Cauchy_vector ~> vec_CauchyI
3542 * Session Multivariate_Analysis: Several duplicate theorems have been
3543 removed, and other theorems have been renamed or replaced with more
3544 general versions. INCOMPATIBILITY.
3546 finite_choice ~> finite_set_choice
3547 eventually_conjI ~> eventually_conj
3548 eventually_and ~> eventually_conj_iff
3549 eventually_false ~> eventually_False
3550 setsum_norm ~> norm_setsum
3551 Lim_sequentially ~> LIMSEQ_def
3552 Lim_ident_at ~> LIM_ident
3553 Lim_const ~> tendsto_const
3554 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
3555 Lim_neg ~> tendsto_minus
3556 Lim_add ~> tendsto_add
3557 Lim_sub ~> tendsto_diff
3558 Lim_mul ~> tendsto_scaleR
3559 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
3560 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
3561 Lim_linear ~> bounded_linear.tendsto
3562 Lim_component ~> tendsto_euclidean_component
3563 Lim_component_cart ~> tendsto_vec_nth
3564 Lim_inner ~> tendsto_inner [OF tendsto_const]
3565 dot_lsum ~> inner_setsum_left
3566 dot_rsum ~> inner_setsum_right
3567 continuous_cmul ~> continuous_scaleR [OF continuous_const]
3568 continuous_neg ~> continuous_minus
3569 continuous_sub ~> continuous_diff
3570 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
3571 continuous_mul ~> continuous_scaleR
3572 continuous_inv ~> continuous_inverse
3573 continuous_at_within_inv ~> continuous_at_within_inverse
3574 continuous_at_inv ~> continuous_at_inverse
3575 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
3576 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
3577 continuous_at_component ~> continuous_component [OF continuous_at_id]
3578 continuous_on_neg ~> continuous_on_minus
3579 continuous_on_sub ~> continuous_on_diff
3580 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
3581 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
3582 continuous_on_mul ~> continuous_on_scaleR
3583 continuous_on_mul_real ~> continuous_on_mult
3584 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
3585 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
3586 continuous_on_inverse ~> continuous_on_inv
3587 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
3588 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
3589 subset_interior ~> interior_mono
3590 subset_closure ~> closure_mono
3591 closure_univ ~> closure_UNIV
3592 real_arch_lt ~> reals_Archimedean2
3593 real_arch ~> reals_Archimedean3
3594 real_abs_norm ~> abs_norm_cancel
3595 real_abs_sub_norm ~> norm_triangle_ineq3
3596 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
3598 * Session HOL-Probability:
3599 - Caratheodory's extension lemma is now proved for ring_of_sets.
3600 - Infinite products of probability measures are now available.
3601 - Sigma closure is independent, if the generator is independent
3602 - Use extended reals instead of positive extended
3603 reals. INCOMPATIBILITY.
3605 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
3607 expand_fun_below ~> fun_below_iff
3608 below_fun_ext ~> fun_belowI
3609 expand_cfun_eq ~> cfun_eq_iff
3610 ext_cfun ~> cfun_eqI
3611 expand_cfun_below ~> cfun_below_iff
3612 below_cfun_ext ~> cfun_belowI
3613 monofun_fun_fun ~> fun_belowD
3614 monofun_fun_arg ~> monofunE
3615 monofun_lub_fun ~> adm_monofun [THEN admD]
3616 cont_lub_fun ~> adm_cont [THEN admD]
3617 cont2cont_Rep_CFun ~> cont2cont_APP
3618 cont_Rep_CFun_app ~> cont_APP_app
3619 cont_Rep_CFun_app_app ~> cont_APP_app_app
3620 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
3621 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
3622 contlub_cfun ~> lub_APP [symmetric]
3623 contlub_LAM ~> lub_LAM [symmetric]
3626 lift_distinct1 ~> lift.distinct(1)
3627 lift_distinct2 ~> lift.distinct(2)
3628 Def_not_UU ~> lift.distinct(2)
3629 Def_inject ~> lift.inject
3630 below_UU_iff ~> below_bottom_iff
3631 eq_UU_iff ~> eq_bottom_iff
3634 *** Document preparation ***
3636 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
3637 isar-ref manual, both for description and actual application of the
3640 * Antiquotation @{value} evaluates the given term and presents its
3643 * Antiquotations: term style "isub" provides ad-hoc conversion of
3644 variables x1, y23 into subscripted form x\<^isub>1,
3645 y\<^isub>2\<^isub>3.
3647 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
3648 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
3650 * Localized \isabellestyle switch can be used within blocks or groups
3653 \isabellestyle{it} %preferred default
3654 {\isabellestylett @{text "typewriter stuff"}}
3656 * Discontinued special treatment of hard tabulators. Implicit
3657 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
3663 * The inner syntax of sort/type/term/prop supports inlined YXML
3664 representations within quoted string tokens. By encoding logical
3665 entities via Term_XML (in ML or Scala) concrete syntax can be
3666 bypassed, which is particularly useful for producing bits of text
3667 under external program control.
3669 * Antiquotations for ML and document preparation are managed as theory
3670 data, which requires explicit setup.
3672 * Isabelle_Process.is_active allows tools to check if the official
3673 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
3674 (better known as Proof General).
3676 * Structure Proof_Context follows standard naming scheme. Old
3677 ProofContext is still available for some time as legacy alias.
3679 * Structure Timing provides various operations for timing; supersedes
3680 former start_timing/end_timing etc.
3682 * Path.print is the official way to show file-system paths to users
3683 (including quotes etc.).
3685 * Inner syntax: identifiers in parse trees of generic categories
3686 "logic", "aprop", "idt" etc. carry position information (disguised as
3687 type constraints). Occasional INCOMPATIBILITY with non-compliant
3688 translations that choke on unexpected type constraints. Positions can
3689 be stripped in ML translations via Syntax.strip_positions /
3690 Syntax.strip_positions_ast, or via the syntax constant
3691 "_strip_positions" within parse trees. As last resort, positions can
3692 be disabled via the configuration option Syntax.positions, which is
3693 called "syntax_positions" in Isar attribute syntax.
3695 * Discontinued special status of various ML structures that contribute
3696 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
3697 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
3698 refer directly to Ast.Constant, Lexicon.is_identifier,
3699 Syntax_Trans.mk_binder_tr etc.
3701 * Typed print translation: discontinued show_sorts argument, which is
3702 already available via context of "advanced" translation.
3704 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
3705 goal states; body tactic needs to address all subgoals uniformly.
3707 * Slightly more special eq_list/eq_set, with shortcut involving
3708 pointer equality (assumes that eq relation is reflexive).
3710 * Classical tactics use proper Proof.context instead of historic types
3711 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
3712 operate directly on Proof.context. Raw type claset retains its use as
3713 snapshot of the classical context, which can be recovered via
3714 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
3715 INCOMPATIBILITY, classical tactics and derived proof methods require
3716 proper Proof.context.
3721 * Discontinued support for Poly/ML 5.2, which was the last version
3722 without proper multithreading and TimeLimit implementation.
3724 * Discontinued old lib/scripts/polyml-platform, which has been
3725 obsolete since Isabelle2009-2.
3727 * Various optional external tools are referenced more robustly and
3728 uniformly by explicit Isabelle settings as follows:
3730 ISABELLE_CSDP (formerly CSDP_EXE)
3731 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
3732 ISABELLE_OCAML (formerly EXEC_OCAML)
3733 ISABELLE_SWIPL (formerly EXEC_SWIPL)
3734 ISABELLE_YAP (formerly EXEC_YAP)
3736 Note that automated detection from the file-system or search path has
3737 been discontinued. INCOMPATIBILITY.
3739 * Scala layer provides JVM method invocation service for static
3740 methods of type (String)String, see Invoke_Scala.method in ML. For
3743 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
3745 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
3746 this allows to pass structured values between ML and Scala.
3748 * The IsabelleText fonts includes some further glyphs to support the
3749 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
3750 installed a local copy (which is normally *not* required) need to
3751 delete or update it from ~~/lib/fonts/.
3755 New in Isabelle2011 (January 2011)
3756 ----------------------------------
3760 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
3761 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
3762 useful tooltips and hyperlinks produced from its static analysis. The
3763 bundled component provides an executable Isabelle tool that can be run
3766 Isabelle2011/bin/isabelle jedit
3768 * Significantly improved Isabelle/Isar implementation manual.
3770 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
3771 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
3772 while the default heap location within that directory lacks that extra
3773 suffix. This isolates multiple Isabelle installations from each
3774 other, avoiding problems with old settings in new versions.
3775 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
3777 * Source files are always encoded as UTF-8, instead of old-fashioned
3778 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
3779 the following package declarations:
3781 \usepackage[utf8]{inputenc}
3782 \usepackage{textcomp}
3784 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
3785 a Unicode character is treated as a single symbol, not a sequence of
3786 non-ASCII bytes as before. Since Isabelle/ML string literals may
3787 contain symbols without further backslash escapes, Unicode can now be
3788 used here as well. Recall that Symbol.explode in ML provides a
3789 consistent view on symbols, while raw explode (or String.explode)
3790 merely give a byte-oriented representation.
3792 * Theory loader: source files are primarily located via the master
3793 directory of each theory node (where the .thy file itself resides).
3794 The global load path is still partially available as legacy feature.
3795 Minor INCOMPATIBILITY due to subtle change in file lookup: use
3796 explicit paths, relatively to the theory.
3798 * Special treatment of ML file names has been discontinued.
3799 Historically, optional extensions .ML or .sml were added on demand --
3800 at the cost of clarity of file dependencies. Recall that Isabelle/ML
3801 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
3803 * Various options that affect pretty printing etc. are now properly
3804 handled within the context via configuration options, instead of
3805 unsynchronized references or print modes. There are both ML Config.T
3806 entities and Isar declaration attributes to access these.
3808 ML (Config.T) Isar (attribute)
3810 eta_contract eta_contract
3811 show_brackets show_brackets
3812 show_sorts show_sorts
3813 show_types show_types
3814 show_question_marks show_question_marks
3815 show_consts show_consts
3816 show_abbrevs show_abbrevs
3818 Syntax.ast_trace syntax_ast_trace
3819 Syntax.ast_stat syntax_ast_stat
3820 Syntax.ambiguity_level syntax_ambiguity_level
3822 Goal_Display.goals_limit goals_limit
3823 Goal_Display.show_main_goal show_main_goal
3825 Method.rule_trace rule_trace
3827 Thy_Output.display thy_output_display
3828 Thy_Output.quotes thy_output_quotes
3829 Thy_Output.indent thy_output_indent
3830 Thy_Output.source thy_output_source
3831 Thy_Output.break thy_output_break
3833 Note that corresponding "..._default" references in ML may only be
3834 changed globally at the ROOT session setup, but *not* within a theory.
3835 The option "show_abbrevs" supersedes the former print mode
3836 "no_abbrevs" with inverted meaning.
3838 * More systematic naming of some configuration options.
3841 trace_simp ~> simp_trace
3842 debug_simp ~> simp_debug
3844 * Support for real valued configuration options, using simplistic
3845 floating-point notation that coincides with the inner syntax for
3848 * Support for real valued preferences (with approximative PGIP type):
3849 front-ends need to accept "pgint" values in float notation.
3852 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
3855 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
3860 * Command 'type_synonym' (with single argument) replaces somewhat
3861 outdated 'types', which is still available as legacy feature for some
3864 * Command 'nonterminal' (with 'and' separated list of arguments)
3865 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
3867 * Command 'notepad' replaces former 'example_proof' for
3868 experimentation in Isar without any result. INCOMPATIBILITY.
3870 * Locale interpretation commands 'interpret' and 'sublocale' accept
3871 lists of equations to map definitions in a locale to appropriate
3872 entities in the context of the interpretation. The 'interpretation'
3873 command already provided this functionality.
3875 * Diagnostic command 'print_dependencies' prints the locale instances
3876 that would be activated if the specified expression was interpreted in
3877 the current context. Variant "print_dependencies!" assumes a context
3878 without interpretations.
3880 * Diagnostic command 'print_interps' prints interpretations in proofs
3881 in addition to interpretations in theories.
3883 * Discontinued obsolete 'global' and 'local' commands to manipulate
3884 the theory name space. Rare INCOMPATIBILITY. The ML functions
3885 Sign.root_path and Sign.local_path may be applied directly where this
3886 feature is still required for historical reasons.
3888 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
3889 'definition' instead.
3891 * The "prems" fact, which refers to the accidental collection of
3892 foundational premises in the context, is now explicitly marked as
3893 legacy feature and will be discontinued soon. Consider using "assms"
3894 of the head statement or reference facts by explicit names.
3896 * Document antiquotations @{class} and @{type} print classes and type
3899 * Document antiquotation @{file} checks file/directory entries within
3900 the local file system.
3905 * Coercive subtyping: functions can be declared as coercions and type
3906 inference will add them as necessary upon input of a term. Theory
3907 Complex_Main declares real :: nat => real and real :: int => real as
3908 coercions. A coercion function f is declared like this:
3910 declare [[coercion f]]
3912 To lift coercions through type constructors (e.g. from nat => real to
3913 nat list => real list), map functions can be declared, e.g.
3915 declare [[coercion_map map]]
3917 Currently coercion inference is activated only in theories including
3918 real numbers, i.e. descendants of Complex_Main. This is controlled by
3919 the configuration option "coercion_enabled", e.g. it can be enabled in
3920 other theories like this:
3922 declare [[coercion_enabled]]
3924 * Command 'partial_function' provides basic support for recursive
3925 function definitions over complete partial orders. Concrete instances
3926 are provided for i) the option type, ii) tail recursion on arbitrary
3927 types, and iii) the heap monad of Imperative_HOL. See
3928 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
3931 * Function package: f.psimps rules are no longer implicitly declared
3932 as [simp]. INCOMPATIBILITY.
3934 * Datatype package: theorems generated for executable equality (class
3935 "eq") carry proper names and are treated as default code equations.
3937 * Inductive package: now offers command 'inductive_simps' to
3938 automatically derive instantiated and simplified equations for
3939 inductive predicates, similar to 'inductive_cases'.
3941 * Command 'enriched_type' allows to register properties of the
3942 functorial structure of types.
3944 * Improved infrastructure for term evaluation using code generator
3945 techniques, in particular static evaluation conversions.
3947 * Code generator: Scala (2.8 or higher) has been added to the target
3950 * Code generator: globbing constant expressions "*" and "Theory.*"
3951 have been replaced by the more idiomatic "_" and "Theory._".
3954 * Code generator: export_code without explicit file declaration prints
3955 to standard output. INCOMPATIBILITY.
3957 * Code generator: do not print function definitions for case
3958 combinators any longer.
3960 * Code generator: simplification with rules determined with
3961 src/Tools/Code/code_simp.ML and method "code_simp".
3963 * Code generator for records: more idiomatic representation of record
3964 types. Warning: records are not covered by ancient SML code
3965 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
3966 rep_datatype declaration helps to succeed then:
3970 rep_datatype foo_ext ...
3972 * Records: logical foundation type for records does not carry a
3973 '_type' suffix any longer (obsolete due to authentic syntax).
3976 * Quickcheck now by default uses exhaustive testing instead of random
3977 testing. Random testing can be invoked by "quickcheck [random]",
3978 exhaustive testing by "quickcheck [exhaustive]".
3980 * Quickcheck instantiates polymorphic types with small finite
3981 datatypes by default. This enables a simple execution mechanism to
3982 handle quantifiers and function equality over the finite datatypes.
3984 * Quickcheck random generator has been renamed from "code" to
3985 "random". INCOMPATIBILITY.
3987 * Quickcheck now has a configurable time limit which is set to 30
3988 seconds by default. This can be changed by adding [timeout = n] to the
3989 quickcheck command. The time limit for Auto Quickcheck is still set
3992 * Quickcheck in locales considers interpretations of that locale for
3993 counter example search.
3996 - Added "smt" and "remote_smt" provers based on the "smt" proof
3997 method. See the Sledgehammer manual for details ("isabelle doc
4000 sledgehammer atp_info ~> sledgehammer running_provers
4001 sledgehammer atp_kill ~> sledgehammer kill_provers
4002 sledgehammer available_atps ~> sledgehammer available_provers
4005 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
4006 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
4007 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
4008 (and "ms" and "min" are no longer supported)
4013 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
4014 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
4016 - Added support for partial quotient types.
4017 - Added local versions of the "Nitpick.register_xxx" functions.
4018 - Added "whack" option.
4019 - Allow registration of quotient types as codatatypes.
4020 - Improved "merge_type_vars" option to merge more types.
4021 - Removed unsound "fast_descrs" option.
4022 - Added custom symmetry breaking for datatypes, making it possible to reach
4023 higher cardinalities.
4024 - Prevent the expansion of too large definitions.
4026 * Proof methods "metis" and "meson" now have configuration options
4027 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
4028 to diagnose these tools. E.g.
4030 using [[metis_trace = true]]
4032 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
4033 manually as command 'solve_direct'.
4035 * The default SMT solver Z3 must be enabled explicitly (due to
4036 licensing issues) by setting the environment variable
4037 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
4038 commercial applications, the SMT solver CVC3 is provided as fall-back;
4039 changing the SMT solver is done via the configuration option
4042 * Remote SMT solvers need to be referred to by the "remote_" prefix,
4043 i.e. "remote_cvc3" and "remote_z3".
4045 * Added basic SMT support for datatypes, records, and typedefs using
4046 the oracle mode (no proofs). Direct support of pairs has been dropped
4047 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
4048 support for a similar behavior). Minor INCOMPATIBILITY.
4050 * Changed SMT configuration options:
4052 z3_proofs ~> smt_oracle (with inverted meaning)
4053 z3_trace_assms ~> smt_trace_used_facts
4066 * Boogie output files (.b2i files) need to be declared in the theory
4069 * Simplification procedure "list_to_set_comprehension" rewrites list
4070 comprehensions applied to List.set to set comprehensions. Occasional
4071 INCOMPATIBILITY, may be deactivated like this:
4073 declare [[simproc del: list_to_set_comprehension]]
4075 * Removed old version of primrec package. INCOMPATIBILITY.
4077 * Removed simplifier congruence rule of "prod_case", as has for long
4078 been the case with "split". INCOMPATIBILITY.
4080 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
4082 * Removed [split_format ... and ... and ...] version of
4083 [split_format]. Potential INCOMPATIBILITY.
4085 * Predicate "sorted" now defined inductively, with nice induction
4086 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
4088 * Constant "contents" renamed to "the_elem", to free the generic name
4089 contents for other uses. INCOMPATIBILITY.
4091 * Renamed class eq and constant eq (for code generation) to class
4092 equal and constant equal, plus renaming of related facts and various
4093 tuning. INCOMPATIBILITY.
4095 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
4097 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
4100 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
4101 avoid confusion with finite sets. INCOMPATIBILITY.
4103 * Abandoned locales equiv, congruent and congruent2 for equivalence
4104 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
4107 * Some previously unqualified names have been qualified:
4114 Trueprop ~> HOL.Trueprop
4119 op --> ~> HOL.implies
4131 Pair ~> Product_Type.Pair
4132 fst ~> Product_Type.fst
4133 snd ~> Product_Type.snd
4134 curry ~> Product_Type.curry
4136 Collect ~> Set.Collect
4140 * More canonical naming convention for some fundamental definitions:
4142 bot_bool_eq ~> bot_bool_def
4143 top_bool_eq ~> top_bool_def
4144 inf_bool_eq ~> inf_bool_def
4145 sup_bool_eq ~> sup_bool_def
4146 bot_fun_eq ~> bot_fun_def
4147 top_fun_eq ~> top_fun_def
4148 inf_fun_eq ~> inf_fun_def
4149 sup_fun_eq ~> sup_fun_def
4153 * More stylized fact names:
4155 expand_fun_eq ~> fun_eq_iff
4156 expand_set_eq ~> set_eq_iff
4158 nat_number ~> eval_nat_numeral
4162 * Refactoring of code-generation specific operations in theory List:
4168 mem_iff ~> member_def
4169 null_empty ~> null_def
4171 INCOMPATIBILITY. Note that these were not supposed to be used
4172 regularly unless for striking reasons; their main purpose was code
4175 Various operations from the Haskell prelude are used for generating
4178 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
4179 "surj f" is now an abbreviation of "range f = UNIV". The theorems
4180 bij_def and surj_def are unchanged. INCOMPATIBILITY.
4182 * Abolished some non-alphabetic type names: "prod" and "sum" replace
4183 "*" and "+" respectively. INCOMPATIBILITY.
4185 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
4186 "Sum_Type.Plus" instead.
4188 * Constant "split" has been merged with constant "prod_case"; names of
4189 ML functions, facts etc. involving split have been retained so far,
4190 though. INCOMPATIBILITY.
4192 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
4193 instead. INCOMPATIBILITY.
4195 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
4198 * Former theory Library/Enum is now part of the HOL-Main image.
4199 INCOMPATIBILITY: all constants of the Enum theory now have to be
4200 referred to by its qualified name.
4203 nlists ~> Enum.nlists
4204 product ~> Enum.product
4206 * Theory Library/Monad_Syntax provides do-syntax for monad types.
4207 Syntax in Library/State_Monad has been changed to avoid ambiguities.
4210 * Theory Library/SetsAndFunctions has been split into
4211 Library/Function_Algebras and Library/Set_Algebras; canonical names
4212 for instance definitions for functions; various improvements.
4215 * Theory Library/Multiset provides stable quicksort implementation of
4218 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
4221 * Session Multivariate_Analysis: introduced a type class for euclidean
4222 space. Most theorems are now stated in terms of euclidean spaces
4223 instead of finite cartesian products.
4226 real ^ 'n ~> 'a::real_vector
4227 ~> 'a::euclidean_space
4228 ~> 'a::ordered_euclidean_space
4229 (depends on your needs)
4233 \<chi> x. _ ~> \<chi>\<chi> x. _
4236 Also note that the indices are now natural numbers and not from some
4237 finite type. Finite cartesian products of euclidean spaces, products
4238 of euclidean spaces the real and complex numbers are instantiated to
4239 be euclidean_spaces. INCOMPATIBILITY.
4241 * Session Probability: introduced pextreal as positive extended real
4242 numbers. Use pextreal as value for measures. Introduce the
4243 Radon-Nikodym derivative, product spaces and Fubini's theorem for
4244 arbitrary sigma finite measures. Introduces Lebesgue measure based on
4245 the integral in Multivariate Analysis. INCOMPATIBILITY.
4247 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
4250 * Session SPARK (with image HOL-SPARK) provides commands to load and
4251 prove verification conditions generated by the SPARK Ada program
4252 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
4257 * Theorems for additive ring operations (locale abelian_monoid and
4258 descendants) are generated by interpretation from their multiplicative
4259 counterparts. Names (in particular theorem names) have the mandatory
4260 qualifier 'add'. Previous theorem names are redeclared for
4263 * Structure "int_ring" is now an abbreviation (previously a
4264 definition). This fits more natural with advanced interpretations.
4269 * The domain package now runs in definitional mode by default: The
4270 former command 'new_domain' is now called 'domain'. To use the domain
4271 package in its original axiomatic mode, use 'domain (unsafe)'.
4274 * The new class "domain" is now the default sort. Class "predomain"
4275 is an unpointed version of "domain". Theories can be updated by
4276 replacing sort annotations as shown below. INCOMPATIBILITY.
4278 'a::type ~> 'a::countable
4279 'a::cpo ~> 'a::predomain
4280 'a::pcpo ~> 'a::domain
4282 * The old type class "rep" has been superseded by class "domain".
4283 Accordingly, users of the definitional package must remove any
4284 "default_sort rep" declarations. INCOMPATIBILITY.
4286 * The domain package (definitional mode) now supports unpointed
4287 predomain argument types, as long as they are marked 'lazy'. (Strict
4288 arguments must be in class "domain".) For example, the following
4289 domain definition now works:
4291 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
4293 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
4294 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
4295 'a option, and 'a list. Additionally, it configures fixrec and the
4296 domain package to work with these types. For example:
4298 fixrec isInl :: "('a + 'b) u -> tr"
4299 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
4301 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
4303 * The "(permissive)" option of fixrec has been replaced with a
4304 per-equation "(unchecked)" option. See
4305 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
4307 * The "bifinite" class no longer fixes a constant "approx"; the class
4308 now just asserts that such a function exists. INCOMPATIBILITY.
4310 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
4311 defines an embedding of type 'a defl into udom by default; instances
4312 of "bifinite" and "domain" classes are available in
4313 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
4315 * The syntax "REP('a)" has been replaced with "DEFL('a)".
4317 * The predicate "directed" has been removed. INCOMPATIBILITY.
4319 * The type class "finite_po" has been removed. INCOMPATIBILITY.
4321 * The function "cprod_map" has been renamed to "prod_map".
4324 * The monadic bind operator on each powerdomain has new binder syntax
4325 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
4326 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
4328 * The infix syntax for binary union on each powerdomain has changed
4329 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
4330 syntax. INCOMPATIBILITY.
4332 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
4333 still supported as an input translation.
4335 * Renamed some theorems (the original names are also still available).
4337 expand_fun_below ~> fun_below_iff
4338 below_fun_ext ~> fun_belowI
4339 expand_cfun_eq ~> cfun_eq_iff
4340 ext_cfun ~> cfun_eqI
4341 expand_cfun_below ~> cfun_below_iff
4342 below_cfun_ext ~> cfun_belowI
4343 cont2cont_Rep_CFun ~> cont2cont_APP
4345 * The Abs and Rep functions for various types have changed names.
4346 Related theorem names have also changed to match. INCOMPATIBILITY.
4348 Rep_CFun ~> Rep_cfun
4349 Abs_CFun ~> Abs_cfun
4350 Rep_Sprod ~> Rep_sprod
4351 Abs_Sprod ~> Abs_sprod
4352 Rep_Ssum ~> Rep_ssum
4353 Abs_Ssum ~> Abs_ssum
4355 * Lemmas with names of the form *_defined_iff or *_strict_iff have
4356 been renamed to *_bottom_iff. INCOMPATIBILITY.
4358 * Various changes to bisimulation/coinduction with domain package:
4360 - Definitions of "bisim" constants no longer mention definedness.
4361 - With mutual recursion, "bisim" predicate is now curried.
4362 - With mutual recursion, each type gets a separate coind theorem.
4363 - Variable names in bisim_def and coinduct rules have changed.
4367 * Case combinators generated by the domain package for type "foo" are
4368 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
4370 * Several theorems have been renamed to more accurately reflect the
4371 names of constants and types involved. INCOMPATIBILITY.
4373 thelub_const ~> lub_const
4374 lub_const ~> is_lub_const
4376 is_lub_lub ~> is_lubD2
4378 unique_lub ~> is_lub_unique
4379 is_ub_lub ~> is_lub_rangeD1
4380 lub_bin_chain ~> is_lub_bin_chain
4381 lub_fun ~> is_lub_fun
4382 thelub_fun ~> lub_fun
4383 thelub_cfun ~> lub_cfun
4384 thelub_Pair ~> lub_Pair
4385 lub_cprod ~> is_lub_prod
4386 thelub_cprod ~> lub_prod
4387 minimal_cprod ~> minimal_prod
4388 inst_cprod_pcpo ~> inst_prod_pcpo
4390 compact_UU ~> compact_bottom
4391 deflation_UU ~> deflation_bottom
4392 finite_deflation_UU ~> finite_deflation_bottom
4394 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
4396 sq_ord_less_eq_trans ~> below_eq_trans
4397 sq_ord_eq_less_trans ~> eq_below_trans
4398 refl_less ~> below_refl
4399 trans_less ~> below_trans
4400 antisym_less ~> below_antisym
4401 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
4402 box_less ~> box_below
4403 rev_trans_less ~> rev_below_trans
4404 not_less2not_eq ~> not_below2not_eq
4405 less_UU_iff ~> below_UU_iff
4406 flat_less_iff ~> flat_below_iff
4407 adm_less ~> adm_below
4408 adm_not_less ~> adm_not_below
4409 adm_compact_not_less ~> adm_compact_not_below
4410 less_fun_def ~> below_fun_def
4411 expand_fun_less ~> fun_below_iff
4412 less_fun_ext ~> fun_belowI
4413 less_discr_def ~> below_discr_def
4414 discr_less_eq ~> discr_below_eq
4415 less_unit_def ~> below_unit_def
4416 less_cprod_def ~> below_prod_def
4417 prod_lessI ~> prod_belowI
4418 Pair_less_iff ~> Pair_below_iff
4419 fst_less_iff ~> fst_below_iff
4420 snd_less_iff ~> snd_below_iff
4421 expand_cfun_less ~> cfun_below_iff
4422 less_cfun_ext ~> cfun_belowI
4423 injection_less ~> injection_below
4424 less_up_def ~> below_up_def
4425 not_Iup_less ~> not_Iup_below
4426 Iup_less ~> Iup_below
4428 Def_inject_less_eq ~> Def_below_Def
4429 Def_less_is_eq ~> Def_below_iff
4430 spair_less_iff ~> spair_below_iff
4431 less_sprod ~> below_sprod
4432 spair_less ~> spair_below
4433 sfst_less_iff ~> sfst_below_iff
4434 ssnd_less_iff ~> ssnd_below_iff
4435 fix_least_less ~> fix_least_below
4436 dist_less_one ~> dist_below_one
4437 less_ONE ~> below_ONE
4438 ONE_less_iff ~> ONE_below_iff
4439 less_sinlD ~> below_sinlD
4440 less_sinrD ~> below_sinrD
4445 * All constant names are now qualified internally and use proper
4446 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
4451 * Antiquotation @{assert} inlines a function bool -> unit that raises
4452 Fail if the argument is false. Due to inlining the source position of
4453 failed assertions is included in the error output.
4455 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
4456 text is in practice always evaluated with a stable theory checkpoint.
4457 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
4459 * Antiquotation @{theory A} refers to theory A from the ancestry of
4460 the current context, not any accidental theory loader state as before.
4461 Potential INCOMPATIBILITY, subtle change in semantics.
4463 * Syntax.pretty_priority (default 0) configures the required priority
4464 of pretty-printed output and thus affects insertion of parentheses.
4466 * Syntax.default_root (default "any") configures the inner syntax
4467 category (nonterminal symbol) for parsing of terms.
4469 * Former exception Library.UnequalLengths now coincides with
4470 ListPair.UnequalLengths.
4472 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
4473 main functionality is provided by structure Simplifier.
4475 * Renamed raw "explode" function to "raw_explode" to emphasize its
4476 meaning. Note that internally to Isabelle, Symbol.explode is used in
4477 almost all situations.
4479 * Discontinued obsolete function sys_error and exception SYS_ERROR.
4480 See implementation manual for further details on exceptions in
4483 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
4486 * Renamed structure PureThy to Pure_Thy and moved most of its
4487 operations to structure Global_Theory, to emphasize that this is
4488 rarely-used global-only stuff.
4490 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
4491 instead (or tracing for high-volume output).
4493 * Configuration option show_question_marks only affects regular pretty
4494 printing of types and terms, not raw Term.string_of_vname.
4496 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
4497 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
4498 @{thms} for most purposes.
4500 * ML structure Unsynchronized is never opened, not even in Isar
4501 interaction mode as before. Old Unsynchronized.set etc. have been
4502 discontinued -- use plain := instead. This should be *rare* anyway,
4503 since modern tools always work via official context data, notably
4504 configuration options.
4506 * Parallel and asynchronous execution requires special care concerning
4507 interrupts. Structure Exn provides some convenience functions that
4508 avoid working directly with raw Interrupt. User code must not absorb
4509 interrupts -- intermediate handling (for cleanup etc.) needs to be
4510 followed by re-raising of the original exception. Another common
4511 source of mistakes are "handle _" patterns, which make the meaning of
4512 the program subject to physical effects of the environment.
4516 New in Isabelle2009-2 (June 2010)
4517 ---------------------------------
4521 * Authentic syntax for *all* logical entities (type classes, type
4522 constructors, term constants): provides simple and robust
4523 correspondence between formal entities and concrete syntax. Within
4524 the parse tree / AST representations, "constants" are decorated by
4525 their category (class, type, const) and spelled out explicitly with
4526 their full internal name.
4528 Substantial INCOMPATIBILITY concerning low-level syntax declarations
4529 and translations (translation rules and translation functions in ML).
4530 Some hints on upgrading:
4532 - Many existing uses of 'syntax' and 'translations' can be replaced
4533 by more modern 'type_notation', 'notation' and 'abbreviation',
4534 which are independent of this issue.
4536 - 'translations' require markup within the AST; the term syntax
4537 provides the following special forms:
4539 CONST c -- produces syntax version of constant c from context
4540 XCONST c -- literally c, checked as constant from context
4541 c -- literally c, if declared by 'syntax'
4543 Plain identifiers are treated as AST variables -- occasionally the
4544 system indicates accidental variables via the error "rhs contains
4547 Type classes and type constructors are marked according to their
4548 concrete syntax. Some old translations rules need to be written
4549 for the "type" category, using type constructor application
4550 instead of pseudo-term application of the default category
4553 - 'parse_translation' etc. in ML may use the following
4556 @{class_syntax c} -- type class c within parse tree / AST
4557 @{term_syntax c} -- type constructor c within parse tree / AST
4558 @{const_syntax c} -- ML version of "CONST c" above
4559 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
4561 - Literal types within 'typed_print_translations', i.e. those *not*
4562 represented as pseudo-terms are represented verbatim. Use @{class
4563 c} or @{type_name c} here instead of the above syntax
4566 Note that old non-authentic syntax was based on unqualified base
4567 names, so all of the above "constant" names would coincide. Recall
4568 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
4569 diagnose syntax problems.
4571 * Type constructors admit general mixfix syntax, not just infix.
4573 * Concrete syntax may be attached to local entities without a proof
4574 body, too. This works via regular mixfix annotations for 'fix',
4575 'def', 'obtain' etc. or via the explicit 'write' command, which is
4576 similar to the 'notation' command in theory specifications.
4578 * Discontinued unnamed infix syntax (legacy feature for many years) --
4579 need to specify constant name and syntax separately. Internal ML
4580 datatype constructors have been renamed from InfixName to Infix etc.
4581 Minor INCOMPATIBILITY.
4583 * Schematic theorem statements need to be explicitly markup as such,
4584 via commands 'schematic_lemma', 'schematic_theorem',
4585 'schematic_corollary'. Thus the relevance of the proof is made
4586 syntactically clear, which impacts performance in a parallel or
4587 asynchronous interactive environment. Minor INCOMPATIBILITY.
4589 * Use of cumulative prems via "!" in some proof methods has been
4590 discontinued (old legacy feature).
4592 * References 'trace_simp' and 'debug_simp' have been replaced by
4593 configuration options stored in the context. Enabling tracing (the
4594 case of debugging is similar) in proofs works via
4596 using [[trace_simp = true]]
4598 Tracing is then active for all invocations of the simplifier in
4599 subsequent goal refinement steps. Tracing may also still be enabled or
4600 disabled via the ProofGeneral settings menu.
4602 * Separate commands 'hide_class', 'hide_type', 'hide_const',
4603 'hide_fact' replace the former 'hide' KIND command. Minor
4606 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
4607 more efficient than combinations with -q1 or -q2.
4612 * Proofterms record type-class reasoning explicitly, using the
4613 "unconstrain" operation internally. This eliminates all sort
4614 constraints from a theorem and proof, introducing explicit
4615 OFCLASS-premises. On the proof term level, this operation is
4616 automatically applied at theorem boundaries, such that closed proofs
4617 are always free of sort constraints. INCOMPATIBILITY for tools that
4618 inspect proof terms.
4620 * Local theory specifications may depend on extra type variables that
4621 are not present in the result type -- arguments TYPE('a) :: 'a itself
4622 are added internally. For example:
4624 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
4626 * Predicates of locales introduced by classes carry a mandatory
4627 "class" prefix. INCOMPATIBILITY.
4629 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
4631 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
4634 * Command 'code_reflect' allows to incorporate generated ML code into
4635 runtime environment; replaces immature code_datatype antiquotation.
4638 * Code generator: simple concept for abstract datatypes obeying
4641 * Code generator: details of internal data cache have no impact on the
4642 user space functionality any longer.
4644 * Methods "unfold_locales" and "intro_locales" ignore non-locale
4645 subgoals. This is more appropriate for interpretations with 'where'.
4648 * Command 'example_proof' opens an empty proof body. This allows to
4649 experiment with Isar, without producing any persistent result.
4651 * Commands 'type_notation' and 'no_type_notation' declare type syntax
4652 within a local theory context, with explicit checking of the
4653 constructors involved (in contrast to the raw 'syntax' versions).
4655 * Commands 'types' and 'typedecl' now work within a local theory
4656 context -- without introducing dependencies on parameters or
4657 assumptions, which is not possible in Isabelle/Pure.
4659 * Command 'defaultsort' has been renamed to 'default_sort', it works
4660 within a local theory context. Minor INCOMPATIBILITY.
4665 * Command 'typedef' now works within a local theory context -- without
4666 introducing dependencies on parameters or assumptions, which is not
4667 possible in Isabelle/Pure/HOL. Note that the logical environment may
4668 contain multiple interpretations of local typedefs (with different
4669 non-emptiness proofs), even in a global theory context.
4671 * New package for quotient types. Commands 'quotient_type' and
4672 'quotient_definition' may be used for defining types and constants by
4673 quotient constructions. An example is the type of integers created by
4674 quotienting pairs of natural numbers:
4677 intrel :: "(nat * nat) => (nat * nat) => bool"
4679 "intrel (x, y) (u, v) = (x + v = u + y)"
4681 quotient_type int = "nat * nat" / intrel
4682 by (auto simp add: equivp_def expand_fun_eq)
4685 "0::int" is "(0::nat, 0::nat)"
4687 The method "lifting" can be used to lift of theorems from the
4688 underlying "raw" type to the quotient type. The example
4689 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
4690 construction and provides a reasoning infrastructure for finite sets.
4692 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
4693 clash with new theory Quotient in Main HOL.
4695 * Moved the SMT binding into the main HOL session, eliminating
4696 separate HOL-SMT session.
4698 * List membership infix mem operation is only an input abbreviation.
4701 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
4702 for future developements; former Library/Word.thy is still present in
4703 the AFP entry RSAPPS.
4705 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
4706 longer shadowed. INCOMPATIBILITY.
4708 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
4711 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
4714 * Dropped normalizing_semiring etc; use the facts in semiring classes
4715 instead. INCOMPATIBILITY.
4717 * Dropped several real-specific versions of lemmas about floor and
4718 ceiling; use the generic lemmas from theory "Archimedean_Field"
4719 instead. INCOMPATIBILITY.
4721 floor_number_of_eq ~> floor_number_of
4722 le_floor_eq_number_of ~> number_of_le_floor
4723 le_floor_eq_zero ~> zero_le_floor
4724 le_floor_eq_one ~> one_le_floor
4725 floor_less_eq_number_of ~> floor_less_number_of
4726 floor_less_eq_zero ~> floor_less_zero
4727 floor_less_eq_one ~> floor_less_one
4728 less_floor_eq_number_of ~> number_of_less_floor
4729 less_floor_eq_zero ~> zero_less_floor
4730 less_floor_eq_one ~> one_less_floor
4731 floor_le_eq_number_of ~> floor_le_number_of
4732 floor_le_eq_zero ~> floor_le_zero
4733 floor_le_eq_one ~> floor_le_one
4734 floor_subtract_number_of ~> floor_diff_number_of
4735 floor_subtract_one ~> floor_diff_one
4736 ceiling_number_of_eq ~> ceiling_number_of
4737 ceiling_le_eq_number_of ~> ceiling_le_number_of
4738 ceiling_le_zero_eq ~> ceiling_le_zero
4739 ceiling_le_eq_one ~> ceiling_le_one
4740 less_ceiling_eq_number_of ~> number_of_less_ceiling
4741 less_ceiling_eq_zero ~> zero_less_ceiling
4742 less_ceiling_eq_one ~> one_less_ceiling
4743 ceiling_less_eq_number_of ~> ceiling_less_number_of
4744 ceiling_less_eq_zero ~> ceiling_less_zero
4745 ceiling_less_eq_one ~> ceiling_less_one
4746 le_ceiling_eq_number_of ~> number_of_le_ceiling
4747 le_ceiling_eq_zero ~> zero_le_ceiling
4748 le_ceiling_eq_one ~> one_le_ceiling
4749 ceiling_subtract_number_of ~> ceiling_diff_number_of
4750 ceiling_subtract_one ~> ceiling_diff_one
4752 * Theory "Finite_Set": various folding_XXX locales facilitate the
4753 application of the various fold combinators on finite sets.
4755 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
4756 provides abstract red-black tree type which is backed by "RBT_Impl" as
4757 implementation. INCOMPATIBILTY.
4759 * Theory Library/Coinductive_List has been removed -- superseded by
4760 AFP/thys/Coinductive.
4762 * Theory PReal, including the type "preal" and related operations, has
4763 been removed. INCOMPATIBILITY.
4765 * Real: new development using Cauchy Sequences.
4767 * Split off theory "Big_Operators" containing setsum, setprod,
4768 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
4770 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
4771 "Int" etc. INCOMPATIBILITY.
4773 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
4775 * New set of rules "ac_simps" provides combined assoc / commute
4776 rewrites for all interpretations of the appropriate generic locales.
4778 * Renamed theory "OrderedGroup" to "Groups" and split theory
4779 "Ring_and_Field" into theories "Rings" and "Fields"; for more
4780 appropriate and more consistent names suitable for name prefixes
4781 within the HOL theories. INCOMPATIBILITY.
4783 * Some generic constants have been put to appropriate theories:
4784 - less_eq, less: Orderings
4785 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
4786 - inverse, divide: Rings
4789 * More consistent naming of type classes involving orderings (and
4792 lower_semilattice ~> semilattice_inf
4793 upper_semilattice ~> semilattice_sup
4795 dense_linear_order ~> dense_linorder
4797 pordered_ab_group_add ~> ordered_ab_group_add
4798 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
4799 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
4800 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
4801 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
4802 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
4803 pordered_cancel_semiring ~> ordered_cancel_semiring
4804 pordered_comm_monoid_add ~> ordered_comm_monoid_add
4805 pordered_comm_ring ~> ordered_comm_ring
4806 pordered_comm_semiring ~> ordered_comm_semiring
4807 pordered_ring ~> ordered_ring
4808 pordered_ring_abs ~> ordered_ring_abs
4809 pordered_semiring ~> ordered_semiring
4811 ordered_ab_group_add ~> linordered_ab_group_add
4812 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
4813 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
4814 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
4815 ordered_field ~> linordered_field
4816 ordered_field_no_lb ~> linordered_field_no_lb
4817 ordered_field_no_ub ~> linordered_field_no_ub
4818 ordered_field_dense_linear_order ~> dense_linordered_field
4819 ordered_idom ~> linordered_idom
4820 ordered_ring ~> linordered_ring
4821 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
4822 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
4823 ordered_ring_strict ~> linordered_ring_strict
4824 ordered_semidom ~> linordered_semidom
4825 ordered_semiring ~> linordered_semiring
4826 ordered_semiring_1 ~> linordered_semiring_1
4827 ordered_semiring_1_strict ~> linordered_semiring_1_strict
4828 ordered_semiring_strict ~> linordered_semiring_strict
4830 The following slightly odd type classes have been moved to a
4831 separate theory Library/Lattice_Algebras:
4833 lordered_ab_group_add ~> lattice_ab_group_add
4834 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
4835 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
4836 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
4837 lordered_ring ~> lattice_ring
4841 * Refined field classes:
4842 - classes division_ring_inverse_zero, field_inverse_zero,
4843 linordered_field_inverse_zero include rule inverse 0 = 0 --
4844 subsumes former division_by_zero class;
4845 - numerous lemmas have been ported from field to division_ring.
4848 * Refined algebra theorem collections:
4849 - dropped theorem group group_simps, use algebra_simps instead;
4850 - dropped theorem group ring_simps, use field_simps instead;
4851 - proper theorem collection field_simps subsumes former theorem
4852 groups field_eq_simps and field_simps;
4853 - dropped lemma eq_minus_self_iff which is a duplicate for
4857 * Theory Finite_Set and List: some lemmas have been generalized from
4860 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
4861 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
4862 inter_Inter_fold_inter ~> inf_Inf_fold_inf
4863 union_Union_fold_union ~> sup_Sup_fold_sup
4864 Inter_fold_inter ~> Inf_fold_inf
4865 Union_fold_union ~> Sup_fold_sup
4866 inter_INTER_fold_inter ~> inf_INFI_fold_inf
4867 union_UNION_fold_union ~> sup_SUPR_fold_sup
4868 INTER_fold_inter ~> INFI_fold_inf
4869 UNION_fold_union ~> SUPR_fold_sup
4871 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
4872 replaced by the more convenient lemmas Inf_empty and Sup_empty.
4873 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
4874 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
4875 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
4876 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
4878 * Reorganized theory Multiset: swapped notation of pointwise and
4881 - pointwise ordering is instance of class order with standard syntax
4883 - multiset ordering has syntax <=# and <#; partial order properties
4884 are provided by means of interpretation with prefix
4886 - less duplication, less historical organization of sections,
4887 conversion from associations lists to multisets, rudimentary code
4889 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
4894 multiset_eq_conv_count_eq ~> multiset_ext_iff
4895 multi_count_ext ~> multiset_ext
4896 diff_union_inverse2 ~> diff_union_cancelR
4900 * Theory Permutation: replaced local "remove" by List.remove1.
4902 * Code generation: ML and OCaml code is decorated with signatures.
4904 * Theory List: added transpose.
4906 * Library/Nat_Bijection.thy is a collection of bijective functions
4907 between nat and other types, which supersedes the older libraries
4908 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
4911 Nat_Int_Bij.nat2_to_nat ~> prod_encode
4912 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
4913 Nat_Int_Bij.int_to_nat_bij ~> int_encode
4914 Nat_Int_Bij.nat_to_int_bij ~> int_decode
4915 Countable.pair_encode ~> prod_encode
4916 NatIso.prod2nat ~> prod_encode
4917 NatIso.nat2prod ~> prod_decode
4918 NatIso.sum2nat ~> sum_encode
4919 NatIso.nat2sum ~> sum_decode
4920 NatIso.list2nat ~> list_encode
4921 NatIso.nat2list ~> list_decode
4922 NatIso.set2nat ~> set_encode
4923 NatIso.nat2set ~> set_decode
4926 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
4927 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
4928 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
4929 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
4930 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
4931 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
4932 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
4933 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
4934 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
4935 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
4936 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
4937 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
4938 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
4941 - Renamed ATP commands:
4942 atp_info ~> sledgehammer running_atps
4943 atp_kill ~> sledgehammer kill_atps
4944 atp_messages ~> sledgehammer messages
4945 atp_minimize ~> sledgehammer minimize
4946 print_atps ~> sledgehammer available_atps
4948 - Added user's manual ("isabelle doc sledgehammer").
4949 - Added option syntax and "sledgehammer_params" to customize
4950 Sledgehammer's behavior. See the manual for details.
4951 - Modified the Isar proof reconstruction code so that it produces
4952 direct proofs rather than proofs by contradiction. (This feature
4953 is still experimental.)
4954 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
4956 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
4959 - Added and implemented "binary_ints" and "bits" options.
4960 - Added "std" option and implemented support for nonstandard models.
4961 - Added and implemented "finitize" option to improve the precision
4962 of infinite datatypes based on a monotonicity analysis.
4963 - Added support for quotient types.
4964 - Added support for "specification" and "ax_specification"
4966 - Added support for local definitions (for "function" and
4967 "termination" proofs).
4968 - Added support for term postprocessors.
4969 - Optimized "Multiset.multiset" and "FinFun.finfun".
4970 - Improved efficiency of "destroy_constrs" optimization.
4971 - Fixed soundness bugs related to "destroy_constrs" optimization and
4973 - Fixed soundness bug related to higher-order constructors.
4974 - Fixed soundness bug when "full_descrs" is enabled.
4975 - Improved precision of set constructs.
4976 - Added "atoms" option.
4977 - Added cache to speed up repeated Kodkod invocations on the same
4979 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
4980 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
4981 "SAT4J_Light". INCOMPATIBILITY.
4982 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
4983 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
4984 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
4986 * Method "induct" now takes instantiations of the form t, where t is not
4987 a variable, as a shorthand for "x == t", where x is a fresh variable.
4988 If this is not intended, t has to be enclosed in parentheses.
4989 By default, the equalities generated by definitional instantiations
4990 are pre-simplified, which may cause parameters of inductive cases
4991 to disappear, or may even delete some of the inductive cases.
4992 Use "induct (no_simp)" instead of "induct" to restore the old
4993 behaviour. The (no_simp) option is also understood by the "cases"
4994 and "nominal_induct" methods, which now perform pre-simplification, too.
5000 * Variable names in lemmas generated by the domain package have
5001 changed; the naming scheme is now consistent with the HOL datatype
5002 package. Some proof scripts may be affected, INCOMPATIBILITY.
5004 * The domain package no longer defines the function "foo_copy" for
5005 recursive domain "foo". The reach lemma is now stated directly in
5006 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
5007 be reformulated in terms of "foo_take", INCOMPATIBILITY.
5009 * Most definedness lemmas generated by the domain package (previously
5010 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
5011 like "foo$x = UU <-> x = UU", which works better as a simp rule.
5012 Proofs that used definedness lemmas as intro rules may break,
5013 potential INCOMPATIBILITY.
5015 * Induction and casedist rules generated by the domain package now
5016 declare proper case_names (one called "bottom", and one named for each
5017 constructor). INCOMPATIBILITY.
5019 * For mutually-recursive domains, separate "reach" and "take_lemma"
5020 rules are generated for each domain, INCOMPATIBILITY.
5022 foo_bar.reach ~> foo.reach bar.reach
5023 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
5025 * Some lemmas generated by the domain package have been renamed for
5026 consistency with the datatype package, INCOMPATIBILITY.
5028 foo.ind ~> foo.induct
5029 foo.finite_ind ~> foo.finite_induct
5030 foo.coind ~> foo.coinduct
5031 foo.casedist ~> foo.exhaust
5032 foo.exhaust ~> foo.nchotomy
5034 * For consistency with other definition packages, the fixrec package
5035 now generates qualified theorem names, INCOMPATIBILITY.
5037 foo_simps ~> foo.simps
5038 foo_unfold ~> foo.unfold
5039 foo_induct ~> foo.induct
5041 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
5042 method and internal fixrec proofs now use the default simpset instead.
5045 * The "contlub" predicate has been removed. Proof scripts should use
5046 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
5048 * The "admw" predicate has been removed, INCOMPATIBILITY.
5050 * The constants cpair, cfst, and csnd have been removed in favor of
5051 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
5056 * Antiquotations for basic formal entities:
5058 @{class NAME} -- type class
5059 @{class_syntax NAME} -- syntax representation of the above
5061 @{type_name NAME} -- logical type
5062 @{type_abbrev NAME} -- type abbreviation
5063 @{nonterminal NAME} -- type of concrete syntactic category
5064 @{type_syntax NAME} -- syntax representation of any of the above
5066 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
5067 @{const_abbrev NAME} -- abbreviated constant
5068 @{const_syntax NAME} -- syntax representation of any of the above
5070 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
5071 syntax constant (cf. 'syntax' command).
5073 * Antiquotation @{make_string} inlines a function to print arbitrary
5074 values similar to the ML toplevel. The result is compiler dependent
5075 and may fall back on "?" in certain situations.
5077 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
5078 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
5079 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
5080 not work with the asynchronous Isar document model.
5082 * Configuration options now admit dynamic default values, depending on
5083 the context or even global references.
5085 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
5086 uses an efficient external library if available (for Poly/ML).
5088 * Renamed some important ML structures, while keeping the old names
5089 for some time as aliases within the structure Legacy:
5091 OuterKeyword ~> Keyword
5094 OuterSyntax ~> Outer_Syntax
5095 PrintMode ~> Print_Mode
5096 SpecParse ~> Parse_Spec
5099 ThyOutput ~> Thy_Output
5100 TypeInfer ~> Type_Infer
5102 Note that "open Legacy" simplifies porting of sources, but forgetting
5103 to remove it again will complicate porting again in the future.
5105 * Most operations that refer to a global context are named
5106 accordingly, e.g. Simplifier.global_context or
5107 ProofContext.init_global. There are some situations where a global
5108 context actually works, but under normal circumstances one needs to
5109 pass the proper local context through the code!
5111 * Discontinued old TheoryDataFun with its copy/init operation -- data
5112 needs to be pure. Functor Theory_Data_PP retains the traditional
5113 Pretty.pp argument to merge, which is absent in the standard
5114 Theory_Data version.
5116 * Sorts.certify_sort and derived "cert" operations for types and terms
5117 no longer minimize sorts. Thus certification at the boundary of the
5118 inference kernel becomes invariant under addition of class relations,
5119 which is an important monotonicity principle. Sorts are now minimized
5120 in the syntax layer only, at the boundary between the end-user and the
5121 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
5122 explicitly in rare situations.
5124 * Renamed old-style Drule.standard to Drule.export_without_context, to
5125 emphasize that this is in no way a standard operation.
5128 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
5129 usual for resolution. Rare INCOMPATIBILITY.
5131 * Renamed varify/unvarify operations to varify_global/unvarify_global
5132 to emphasize that these only work in a global situation (which is
5135 * Curried take and drop in library.ML; negative length is interpreted
5136 as infinity (as in chop). Subtle INCOMPATIBILITY.
5138 * Proof terms: type substitutions on proof constants now use canonical
5139 order of type variables. INCOMPATIBILITY for tools working with proof
5142 * Raw axioms/defs may no longer carry sort constraints, and raw defs
5143 may no longer carry premises. User-level specifications are
5144 transformed accordingly by Thm.add_axiom/add_def.
5149 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
5150 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
5151 proof terms are enabled unconditionally in the new HOL-Proofs image.
5153 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
5154 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
5157 * Old lib/scripts/polyml-platform is superseded by the
5158 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
5159 variant, even on a 64 bit machine. The following example setting
5160 prefers 64 bit if available:
5162 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
5164 * The preliminary Isabelle/jEdit application demonstrates the emerging
5165 Isabelle/Scala layer for advanced prover interaction and integration.
5166 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
5169 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
5170 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
5171 similar to the default assignment of the document preparation system
5172 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
5173 provides some operations for direct access to the font without asking
5174 the user for manual installation.
5178 New in Isabelle2009-1 (December 2009)
5179 -------------------------------------
5183 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
5184 one backslash should be used, even in ML sources.
5189 * Locale interpretation propagates mixins along the locale hierarchy.
5190 The currently only available mixins are the equations used to map
5191 local definitions to terms of the target domain of an interpretation.
5193 * Reactivated diagnostic command 'print_interps'. Use "print_interps
5194 loc" to print all interpretations of locale "loc" in the theory.
5195 Interpretations in proofs are not shown.
5197 * Thoroughly revised locales tutorial. New section on conditional
5200 * On instantiation of classes, remaining undefined class parameters
5201 are formally declared. INCOMPATIBILITY.
5204 *** Document preparation ***
5206 * New generalized style concept for printing terms: @{foo (style) ...}
5207 instead of @{foo_style style ...} (old form is still retained for
5208 backward compatibility). Styles can be also applied for
5209 antiquotations prop, term_type and typeof.
5214 * New proof method "smt" for a combination of first-order logic with
5215 equality, linear and nonlinear (natural/integer/real) arithmetic, and
5216 fixed-size bitvectors; there is also basic support for higher-order
5217 features (esp. lambda abstractions). It is an incomplete decision
5218 procedure based on external SMT solvers using the oracle mechanism;
5219 for the SMT solver Z3, this method is proof-producing. Certificates
5220 are provided to avoid calling the external solvers solely for
5221 re-checking proofs. Due to a remote SMT service there is no need for
5222 installing SMT solvers locally. See src/HOL/SMT.
5224 * New commands to load and prove verification conditions generated by
5225 the Boogie program verifier or derived systems (e.g. the Verifying C
5226 Compiler (VCC) or Spec#). See src/HOL/Boogie.
5228 * New counterexample generator tool 'nitpick' based on the Kodkod
5229 relational model finder. See src/HOL/Tools/Nitpick and
5230 src/HOL/Nitpick_Examples.
5232 * New commands 'code_pred' and 'values' to invoke the predicate
5233 compiler and to enumerate values of inductive predicates.
5235 * A tabled implementation of the reflexive transitive closure.
5237 * New implementation of quickcheck uses generic code generator;
5238 default generators are provided for all suitable HOL types, records
5239 and datatypes. Old quickcheck can be re-activated importing theory
5240 Library/SML_Quickcheck.
5242 * New testing tool Mirabelle for automated proof tools. Applies
5243 several tools and tactics like sledgehammer, metis, or quickcheck, to
5244 every proof step in a theory. To be used in batch mode via the
5245 "mirabelle" utility.
5247 * New proof method "sos" (sum of squares) for nonlinear real
5248 arithmetic (originally due to John Harison). It requires theory
5249 Library/Sum_Of_Squares. It is not a complete decision procedure but
5250 works well in practice on quantifier-free real arithmetic with +, -,
5251 *, ^, =, <= and <, i.e. boolean combinations of equalities and
5252 inequalities between polynomials. It makes use of external
5253 semidefinite programming solvers. Method "sos" generates a
5254 certificate that can be pasted into the proof thus avoiding the need
5255 to call an external tool every time the proof is checked. See
5256 src/HOL/Library/Sum_Of_Squares.
5258 * New method "linarith" invokes existing linear arithmetic decision
5261 * New command 'atp_minimal' reduces result produced by Sledgehammer.
5263 * New Sledgehammer option "Full Types" in Proof General settings menu.
5264 Causes full type information to be output to the ATPs. This slows
5265 ATPs down considerably but eliminates a source of unsound "proofs"
5268 * New method "metisFT": A version of metis that uses full type
5269 information in order to avoid failures of proof reconstruction.
5271 * New evaluator "approximate" approximates an real valued term using
5272 the same method as the approximation method.
5274 * Method "approximate" now supports arithmetic expressions as
5275 boundaries of intervals and implements interval splitting and Taylor
5278 * ML antiquotation @{code_datatype} inserts definition of a datatype
5279 generated by the code generator; e.g. see src/HOL/Predicate.thy.
5281 * New theory SupInf of the supremum and infimum operators for sets of
5284 * New theory Probability, which contains a development of measure
5285 theory, eventually leading to Lebesgue integration and probability.
5287 * Extended Multivariate Analysis to include derivation and Brouwer's
5290 * Reorganization of number theory, INCOMPATIBILITY:
5291 - new number theory development for nat and int, in theories Divides
5292 and GCD as well as in new session Number_Theory
5293 - some constants and facts now suffixed with _nat and _int
5295 - former session NumberTheory now named Old_Number_Theory, including
5296 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
5297 - moved theory Pocklington from src/HOL/Library to
5298 src/HOL/Old_Number_Theory
5300 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
5301 lcm of finite and infinite sets. It is shown that they form a complete
5304 * Class semiring_div requires superclass no_zero_divisors and proof of
5305 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
5306 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
5307 generalized to class semiring_div, subsuming former theorems
5308 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
5309 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
5312 * Refinements to lattice classes and sets:
5313 - less default intro/elim rules in locale variant, more default
5314 intro/elim rules in class variant: more uniformity
5315 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
5317 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
5319 - renamed ACI to inf_sup_aci
5320 - new class "boolean_algebra"
5321 - class "complete_lattice" moved to separate theory
5322 "Complete_Lattice"; corresponding constants (and abbreviations)
5323 renamed and with authentic syntax:
5324 Set.Inf ~> Complete_Lattice.Inf
5325 Set.Sup ~> Complete_Lattice.Sup
5326 Set.INFI ~> Complete_Lattice.INFI
5327 Set.SUPR ~> Complete_Lattice.SUPR
5328 Set.Inter ~> Complete_Lattice.Inter
5329 Set.Union ~> Complete_Lattice.Union
5330 Set.INTER ~> Complete_Lattice.INTER
5331 Set.UNION ~> Complete_Lattice.UNION
5332 - authentic syntax for
5335 - mere abbreviations:
5338 Set.inter (for inf, formerly Set.Int)
5339 Set.union (for sup, formerly Set.Un)
5340 Complete_Lattice.Inter (for Inf)
5341 Complete_Lattice.Union (for Sup)
5342 Complete_Lattice.INTER (for INFI)
5343 Complete_Lattice.UNION (for SUPR)
5344 - object-logic definitions as far as appropriate
5346 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
5347 Un_subset_iff are explicitly deleted as default simp rules; then also
5348 their lattice counterparts le_inf_iff and le_sup_iff have to be
5349 deleted to achieve the desired effect.
5351 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
5352 rules by default any longer; the same applies to min_max.inf_absorb1
5353 etc. INCOMPATIBILITY.
5355 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
5356 pred_set_conv by default. INCOMPATIBILITY.
5358 * Power operations on relations and functions are now one dedicated
5359 constant "compow" with infix syntax "^^". Power operation on
5360 multiplicative monoids retains syntax "^" and is now defined generic
5361 in class power. INCOMPATIBILITY.
5363 * Relation composition "R O S" now has a more standard argument order:
5364 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
5365 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
5366 break, since the O_assoc rule was not rewritten like this. Fix using
5367 O_assoc[symmetric]. The same applies to the curried version "R OO S".
5369 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
5370 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
5373 * Most rules produced by inductive and datatype package have mandatory
5374 prefixes. INCOMPATIBILITY.
5376 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
5377 the attribute of the same name. Each of the theorems in the list
5378 DERIV_intros assumes composition with an additional function and
5379 matches a variable to the derivative, which has to be solved by the
5380 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
5381 of most elementary terms. Former Maclauren.DERIV_tac and
5382 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
5385 * Code generator attributes follow the usual underscore convention:
5386 code_unfold replaces code unfold
5387 code_post replaces code post
5392 sizechange -> size_change
5393 induct_scheme -> induction_schema
5396 * Discontinued abbreviation "arbitrary" of constant "undefined".
5397 INCOMPATIBILITY, use "undefined" directly.
5400 Suc_eq_add_numeral_1 -> Suc_eq_plus1
5401 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
5402 Suc_plus1 -> Suc_eq_plus1
5403 *anti_sym -> *antisym*
5404 vector_less_eq_def -> vector_le_def
5407 * Added theorem List.map_map as [simp]. Removed List.map_compose.
5410 * Removed predicate "M hassize n" (<--> card M = n & finite M).
5416 * Theory Representable defines a class "rep" of domains that are
5417 representable (via an ep-pair) in the universal domain type "udom".
5418 Instances are provided for all type constructors defined in HOLCF.
5420 * The 'new_domain' command is a purely definitional version of the
5421 domain package, for representable domains. Syntax is identical to the
5422 old domain package. The 'new_domain' package also supports indirect
5423 recursion using previously-defined type constructors. See
5424 src/HOLCF/ex/New_Domain.thy for examples.
5426 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
5427 on the left-hand side of an equation, and then performs
5428 simplification. Rewriting is done using rules declared with the
5429 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
5430 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
5432 * The pattern-match compiler in 'fixrec' can now handle constructors
5433 with HOL function types. Pattern-match combinators for the Pair
5434 constructor are pre-configured.
5436 * The 'fixrec' package now produces better fixed-point induction rules
5437 for mutually-recursive definitions: Induction rules have conclusions
5438 of the form "P foo bar" instead of "P <foo, bar>".
5440 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
5441 been renamed to "below". The name "below" now replaces "less" in many
5442 theorem names. (Legacy theorem names using "less" are still supported
5445 * The 'fixrec' package now supports "bottom patterns". Bottom
5446 patterns can be used to generate strictness rules, or to make
5447 functions more strict (much like the bang-patterns supported by the
5448 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
5454 * Support for Poly/ML 5.3.0, with improved reporting of compiler
5455 errors and run-time exceptions, including detailed source positions.
5457 * Structure Name_Space (formerly NameSpace) now manages uniquely
5458 identified entries, with some additional information such as source
5459 position, logical grouping etc.
5461 * Theory and context data is now introduced by the simplified and
5462 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
5463 to be pure, but the old TheoryDataFun for mutable data (with explicit
5464 copy operation) is still available for some time.
5466 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
5467 provides a high-level programming interface to synchronized state
5468 variables with atomic update. This works via pure function
5469 application within a critical section -- its runtime should be as
5470 short as possible; beware of deadlocks if critical code is nested,
5471 either directly or indirectly via other synchronized variables!
5473 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
5474 wraps raw ML references, explicitly indicating their non-thread-safe
5475 behaviour. The Isar toplevel keeps this structure open, to
5476 accommodate Proof General as well as quick and dirty interactive
5477 experiments with references.
5479 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
5480 parallel tactical reasoning.
5482 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
5483 are similar to SUBPROOF, but are slightly more flexible: only the
5484 specified parts of the subgoal are imported into the context, and the
5485 body tactic may introduce new subgoals and schematic variables.
5487 * Old tactical METAHYPS, which does not observe the proof context, has
5488 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
5489 or Subgoal.FOCUS etc.
5491 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
5492 functors have their own ML name space there is no point to mark them
5493 separately.) Minor INCOMPATIBILITY.
5495 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
5497 * Renamed several structures FooBar to Foo_Bar. Occasional,
5500 * Operations of structure Skip_Proof no longer require quick_and_dirty
5501 mode, which avoids critical setmp.
5503 * Eliminated old Attrib.add_attributes, Method.add_methods and related
5504 combinators for "args". INCOMPATIBILITY, need to use simplified
5505 Attrib/Method.setup introduced in Isabelle2009.
5507 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
5508 back on global_simpset_of, global_claset_of, global_clasimpset_of as
5509 last resort. INCOMPATIBILITY.
5511 * Display.pretty_thm now requires a proper context (cf. former
5512 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
5513 or even Display.pretty_thm_without_context as last resort.
5516 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
5517 Syntax.pretty_typ/term directly, preferably with proper context
5518 instead of global theory.
5523 * Further fine tuning of parallel proof checking, scales up to 8 cores
5524 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
5527 * Support for additional "Isabelle components" via etc/components, see
5528 also the system manual.
5530 * The isabelle makeall tool now operates on all components with
5531 IsaMakefile, not just hardwired "logics".
5533 * Removed "compress" option from isabelle-process and isabelle usedir;
5534 this is always enabled.
5536 * Discontinued support for Poly/ML 4.x versions.
5538 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
5539 on a given logic image. This requires the lighttpd webserver and is
5540 currently supported on Linux only.
5544 New in Isabelle2009 (April 2009)
5545 --------------------------------
5549 * Simplified main Isabelle executables, with less surprises on
5550 case-insensitive file-systems (such as Mac OS).
5552 - The main Isabelle tool wrapper is now called "isabelle" instead of
5555 - The former "isabelle" alias for "isabelle-process" has been
5556 removed (should rarely occur to regular users).
5558 - The former "isabelle-interface" and its alias "Isabelle" have been
5559 removed (interfaces are now regular Isabelle tools).
5561 Within scripts and make files, the Isabelle environment variables
5562 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
5563 respectively. (The latter are still available as legacy feature.)
5565 The old isabelle-interface wrapper could react in confusing ways if
5566 the interface was uninstalled or changed otherwise. Individual
5567 interface tool configuration is now more explicit, see also the
5568 Isabelle system manual. In particular, Proof General is now available
5569 via "isabelle emacs".
5571 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
5572 purge installed copies of Isabelle executables and re-run "isabelle
5573 install -p ...", or use symlinks.
5575 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
5576 old ~/isabelle, which was slightly non-standard and apt to cause
5577 surprises on case-insensitive file-systems (such as Mac OS).
5579 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
5580 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
5581 care is required when using older releases of Isabelle. Note that
5582 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
5583 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
5585 * Proofs of fully specified statements are run in parallel on
5586 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
5587 a regular 4-core machine, if the initial heap space is made reasonably
5588 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
5590 * The main reference manuals ("isar-ref", "implementation", and
5591 "system") have been updated and extended. Formally checked references
5592 as hyperlinks are now available uniformly.
5597 * Complete re-implementation of locales. INCOMPATIBILITY in several
5598 respects. The most important changes are listed below. See the
5599 Tutorial on Locales ("locales" manual) for details.
5601 - In locale expressions, instantiation replaces renaming. Parameters
5602 must be declared in a for clause. To aid compatibility with previous
5603 parameter inheritance, in locale declarations, parameters that are not
5604 'touched' (instantiation position "_" or omitted) are implicitly added
5605 with their syntax at the beginning of the for clause.
5607 - Syntax from abbreviations and definitions in locales is available in
5608 locale expressions and context elements. The latter is particularly
5609 useful in locale declarations.
5611 - More flexible mechanisms to qualify names generated by locale
5612 expressions. Qualifiers (prefixes) may be specified in locale
5613 expressions, and can be marked as mandatory (syntax: "name!:") or
5614 optional (syntax "name?:"). The default depends for plain "name:"
5615 depends on the situation where a locale expression is used: in
5616 commands 'locale' and 'sublocale' prefixes are optional, in
5617 'interpretation' and 'interpret' prefixes are mandatory. The old
5618 implicit qualifiers derived from the parameter names of a locale are
5619 no longer generated.
5621 - Command "sublocale l < e" replaces "interpretation l < e". The
5622 instantiation clause in "interpretation" and "interpret" (square
5623 brackets) is no longer available. Use locale expressions.
5625 - When converting proof scripts, mandatory qualifiers in
5626 'interpretation' and 'interpret' should be retained by default, even
5627 if this is an INCOMPATIBILITY compared to former behavior. In the
5628 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
5629 in locale expressions range over a single locale instance only.
5631 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
5632 In existing theorem specifications replace the includes element by the
5633 respective context elements of the included locale, omitting those
5634 that are already present in the theorem specification. Multiple
5635 assume elements of a locale should be replaced by a single one
5636 involving the locale predicate. In the proof body, declarations (most
5637 notably theorems) may be regained by interpreting the respective
5638 locales in the proof context as required (command "interpret").
5640 If using "includes" in replacement of a target solely because the
5641 parameter types in the theorem are not as general as in the target,
5642 consider declaring a new locale with additional type constraints on
5643 the parameters (context element "constrains").
5645 - Discontinued "locale (open)". INCOMPATIBILITY.
5647 - Locale interpretation commands no longer attempt to simplify goal.
5648 INCOMPATIBILITY: in rare situations the generated goal differs. Use
5649 methods intro_locales and unfold_locales to clarify.
5651 - Locale interpretation commands no longer accept interpretation
5652 attributes. INCOMPATIBILITY.
5654 * Class declaration: so-called "base sort" must not be given in import
5655 list any longer, but is inferred from the specification. Particularly
5662 class foo = type + ...
5664 * Class target: global versions of theorems stemming do not carry a
5665 parameter prefix any longer. INCOMPATIBILITY.
5667 * Class 'instance' command no longer accepts attached definitions.
5668 INCOMPATIBILITY, use proper 'instantiation' target instead.
5670 * Recovered hiding of consts, which was accidentally broken in
5671 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
5672 makes c inaccessible; consider using ``hide (open) const c'' instead.
5674 * Slightly more coherent Pure syntax, with updated documentation in
5675 isar-ref manual. Removed locales meta_term_syntax and
5676 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
5677 INCOMPATIBILITY in rare situations. Note that &&& should not be used
5678 directly in regular applications.
5680 * There is a new syntactic category "float_const" for signed decimal
5681 fractions (e.g. 123.45 or -123.45).
5683 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
5684 interface with 'setup' command instead.
5686 * Command 'local_setup' is similar to 'setup', but operates on a local
5689 * The 'axiomatization' command now only works within a global theory
5690 context. INCOMPATIBILITY.
5692 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
5693 hypotheses. Sorts required in the course of reasoning need to be
5694 covered by the constraints in the initial statement, completed by the
5695 type instance information of the background theory. Non-trivial sort
5696 hypotheses, which rarely occur in practice, may be specified via
5697 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
5699 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
5701 The result contains an implicit sort hypotheses as before --
5702 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
5705 * Generalized Isar history, with support for linear undo, direct state
5708 * Changed defaults for unify configuration options:
5710 unify_trace_bound = 50 (formerly 25)
5711 unify_search_bound = 60 (formerly 30)
5713 * Different bookkeeping for code equations (INCOMPATIBILITY):
5715 a) On theory merge, the last set of code equations for a particular
5716 constant is taken (in accordance with the policy applied by other
5717 parts of the code generator framework).
5719 b) Code equations stemming from explicit declarations (e.g. code
5720 attribute) gain priority over default code equations stemming
5721 from definition, primrec, fun etc.
5723 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
5725 * Unified theorem tables for both code generators. Thus [code
5726 func] has disappeared and only [code] remains. INCOMPATIBILITY.
5728 * Command 'find_consts' searches for constants based on type and name
5731 find_consts "_ => bool"
5733 By default, matching is against subtypes, but it may be restricted to
5734 the whole type. Searching by name is possible. Multiple queries are
5735 conjunctive and queries may be negated by prefixing them with a
5738 find_consts strict: "_ => bool" name: "Int" -"int => int"
5740 * New 'find_theorems' criterion "solves" matches theorems that
5741 directly solve the current goal (modulo higher-order unification).
5743 * Auto solve feature for main theorem statements: whenever a new goal
5744 is stated, "find_theorems solves" is called; any theorems that could
5745 solve the lemma directly are listed as part of the goal state.
5746 Cf. associated options in Proof General Isabelle settings menu,
5747 enabled by default, with reasonable timeout for pathological cases of
5748 higher-order unification.
5751 *** Document preparation ***
5753 * Antiquotation @{lemma} now imitates a regular terminal proof,
5754 demanding keyword 'by' and supporting the full method expression
5755 syntax just like the Isar command 'by'.
5760 * Integrated main parts of former image HOL-Complex with HOL. Entry
5761 points Main and Complex_Main remain as before.
5763 * Logic image HOL-Plain provides a minimal HOL with the most important
5764 tools available (inductive, datatype, primrec, ...). This facilitates
5765 experimentation and tool development. Note that user applications
5766 (and library theories) should never refer to anything below theory
5769 * Logic image HOL-Main stops at theory Main, and thus facilitates
5770 experimentation due to shorter build times.
5772 * Logic image HOL-NSA contains theories of nonstandard analysis which
5773 were previously part of former HOL-Complex. Entry point Hyperreal
5774 remains valid, but theories formerly using Complex_Main should now use
5775 new entry point Hypercomplex.
5777 * Generic ATP manager for Sledgehammer, based on ML threads instead of
5778 Posix processes. Avoids potentially expensive forking of the ML
5779 process. New thread-based implementation also works on non-Unix
5780 platforms (Cygwin). Provers are no longer hardwired, but defined
5781 within the theory via plain ML wrapper functions. Basic Sledgehammer
5782 commands are covered in the isar-ref manual.
5784 * Wrapper scripts for remote SystemOnTPTP service allows to use
5785 sledgehammer without local ATP installation (Vampire etc.). Other
5786 provers may be included via suitable ML wrappers, see also
5787 src/HOL/ATP_Linkup.thy.
5789 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
5792 * The metis method no longer fails because the theorem is too trivial
5793 (contains the empty clause).
5795 * The metis method now fails in the usual manner, rather than raising
5796 an exception, if it determines that it cannot prove the theorem.
5798 * Method "coherent" implements a prover for coherent logic (see also
5799 src/Tools/coherent.ML).
5801 * Constants "undefined" and "default" replace "arbitrary". Usually
5802 "undefined" is the right choice to replace "arbitrary", though
5803 logically there is no difference. INCOMPATIBILITY.
5805 * Command "value" now integrates different evaluation mechanisms. The
5806 result of the first successful evaluation mechanism is printed. In
5807 square brackets a particular named evaluation mechanisms may be
5808 specified (currently, [SML], [code] or [nbe]). See further
5809 src/HOL/ex/Eval_Examples.thy.
5811 * Normalization by evaluation now allows non-leftlinear equations.
5812 Declare with attribute [code nbe].
5814 * Methods "case_tac" and "induct_tac" now refer to the very same rules
5815 as the structured Isar versions "cases" and "induct", cf. the
5816 corresponding "cases" and "induct" attributes. Mutual induction rules
5817 are now presented as a list of individual projections
5818 (e.g. foo_bar.inducts for types foo and bar); the old format with
5819 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
5820 rare situations a different rule is selected --- notably nested tuple
5821 elimination instead of former prod.exhaust: use explicit (case_tac t
5822 rule: prod.exhaust) here.
5824 * Attributes "cases", "induct", "coinduct" support "del" option.
5826 * Removed fact "case_split_thm", which duplicates "case_split".
5828 * The option datatype has been moved to a new theory Option. Renamed
5829 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
5831 * New predicate "strict_mono" classifies strict functions on partial
5832 orders. With strict functions on linear orders, reasoning about
5833 (in)equalities is facilitated by theorems "strict_mono_eq",
5834 "strict_mono_less_eq" and "strict_mono_less".
5836 * Some set operations are now proper qualified constants with
5837 authentic syntax. INCOMPATIBILITY:
5848 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
5851 * Auxiliary class "itself" has disappeared -- classes without any
5852 parameter are treated as expected by the 'class' command.
5854 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
5856 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
5857 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
5859 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
5860 method "approximation". It proves formulas on real values by using
5861 interval arithmetic. In the formulas are also the transcendental
5862 functions sin, cos, tan, atan, ln, exp and the constant pi are
5863 allowed. For examples see
5864 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
5866 * Theory "Reflection" now resides in HOL/Library.
5868 * Entry point to Word library now simply named "Word".
5871 * Made source layout more coherent with logical distribution
5874 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
5875 src/HOL/Library/Code_Message.thy ~> src/HOL/
5876 src/HOL/Library/GCD.thy ~> src/HOL/
5877 src/HOL/Library/Order_Relation.thy ~> src/HOL/
5878 src/HOL/Library/Parity.thy ~> src/HOL/
5879 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
5880 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
5881 src/HOL/Real/Lubs.thy ~> src/HOL/
5882 src/HOL/Real/PReal.thy ~> src/HOL/
5883 src/HOL/Real/Rational.thy ~> src/HOL/
5884 src/HOL/Real/RComplete.thy ~> src/HOL/
5885 src/HOL/Real/RealDef.thy ~> src/HOL/
5886 src/HOL/Real/RealPow.thy ~> src/HOL/
5887 src/HOL/Real/Real.thy ~> src/HOL/
5888 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
5889 src/HOL/Complex/Complex.thy ~> src/HOL/
5890 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
5891 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
5892 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
5893 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
5894 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
5895 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
5896 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
5897 src/HOL/Hyperreal/Log.thy ~> src/HOL/
5898 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
5899 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
5900 src/HOL/Hyperreal/Series.thy ~> src/HOL/
5901 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
5902 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
5903 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
5904 src/HOL/Real/Float ~> src/HOL/Library/
5905 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
5906 src/HOL/Real/RealVector.thy ~> src/HOL/
5908 src/HOL/arith_data.ML ~> src/HOL/Tools
5909 src/HOL/hologic.ML ~> src/HOL/Tools
5910 src/HOL/simpdata.ML ~> src/HOL/Tools
5911 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
5912 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
5913 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
5914 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
5915 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
5916 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
5917 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
5919 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
5920 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
5921 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
5922 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
5923 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
5924 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
5926 * If methods "eval" and "evaluation" encounter a structured proof
5927 state with !!/==>, only the conclusion is evaluated to True (if
5928 possible), avoiding strange error messages.
5930 * Method "sizechange" automates termination proofs using (a
5931 modification of) the size-change principle. Requires SAT solver. See
5932 src/HOL/ex/Termination.thy for examples.
5934 * Simplifier: simproc for let expressions now unfolds if bound
5935 variable occurs at most once in let expression body. INCOMPATIBILITY.
5937 * Method "arith": Linear arithmetic now ignores all inequalities when
5938 fast_arith_neq_limit is exceeded, instead of giving up entirely.
5940 * New attribute "arith" for facts that should always be used
5941 automatically by arithmetic. It is intended to be used locally in
5944 assumes [arith]: "x > 0"
5946 Global usage is discouraged because of possible performance impact.
5948 * New classes "top" and "bot" with corresponding operations "top" and
5949 "bot" in theory Orderings; instantiation of class "complete_lattice"
5950 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
5952 * Changed definition lemma "less_fun_def" in order to provide an
5953 instance for preorders on functions; use lemma "less_le" instead.
5956 * Theory Orderings: class "wellorder" moved here, with explicit
5957 induction rule "less_induct" as assumption. For instantiation of
5958 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
5961 * Theory Orderings: added class "preorder" as superclass of "order".
5962 INCOMPATIBILITY: Instantiation proofs for order, linorder
5963 etc. slightly changed. Some theorems named order_class.* now named
5966 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
5969 * Theory Finite_Set: added a new fold combinator of type
5971 ('a => 'b => 'b) => 'b => 'a set => 'b
5973 Occasionally this is more convenient than the old fold combinator
5974 which is now defined in terms of the new one and renamed to
5977 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
5978 and "ring_simps" have been replaced by "algebra_simps" (which can be
5979 extended with further lemmas!). At the moment both still exist but
5980 the former will disappear at some point.
5982 * Theory Power: Lemma power_Suc is now declared as a simp rule in
5983 class recpower. Type-specific simp rules for various recpower types
5984 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
5986 rat_power_0 -> power_0
5987 rat_power_Suc -> power_Suc
5988 realpow_0 -> power_0
5989 realpow_Suc -> power_Suc
5990 complexpow_0 -> power_0
5991 complexpow_Suc -> power_Suc
5992 power_poly_0 -> power_0
5993 power_poly_Suc -> power_Suc
5995 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
5996 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
5997 dvd has been generalized to class comm_semiring_1. Likewise a bunch
5998 of lemmas from Divides has been generalized from nat to class
5999 semiring_div. INCOMPATIBILITY. This involves the following theorem
6000 renames resulting from duplicate elimination:
6002 dvd_def_mod ~> dvd_eq_mod_eq_0
6003 zero_dvd_iff ~> dvd_0_left_iff
6004 dvd_0 ~> dvd_0_right
6005 DIVISION_BY_ZERO_DIV ~> div_by_0
6006 DIVISION_BY_ZERO_MOD ~> mod_by_0
6007 mult_div ~> div_mult_self2_is_id
6008 mult_mod ~> mod_mult_self2_is_0
6010 * Theory IntDiv: removed many lemmas that are instances of class-based
6011 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
6012 rename old lemmas as follows:
6014 dvd_diff -> nat_dvd_diff
6015 dvd_zminus_iff -> dvd_minus_iff
6016 mod_add1_eq -> mod_add_eq
6017 mod_mult1_eq -> mod_mult_right_eq
6018 mod_mult1_eq' -> mod_mult_left_eq
6019 mod_mult_distrib_mod -> mod_mult_eq
6020 nat_mod_add_left_eq -> mod_add_left_eq
6021 nat_mod_add_right_eq -> mod_add_right_eq
6022 nat_mod_div_trivial -> mod_div_trivial
6023 nat_mod_mod_trivial -> mod_mod_trivial
6024 zdiv_zadd_self1 -> div_add_self1
6025 zdiv_zadd_self2 -> div_add_self2
6026 zdiv_zmult_self1 -> div_mult_self2_is_id
6027 zdiv_zmult_self2 -> div_mult_self1_is_id
6028 zdvd_triv_left -> dvd_triv_left
6029 zdvd_triv_right -> dvd_triv_right
6030 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
6031 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
6032 zmod_zadd_left_eq -> mod_add_left_eq
6033 zmod_zadd_right_eq -> mod_add_right_eq
6034 zmod_zadd_self1 -> mod_add_self1
6035 zmod_zadd_self2 -> mod_add_self2
6036 zmod_zadd1_eq -> mod_add_eq
6037 zmod_zdiff1_eq -> mod_diff_eq
6038 zmod_zdvd_zmod -> mod_mod_cancel
6039 zmod_zmod_cancel -> mod_mod_cancel
6040 zmod_zmult_self1 -> mod_mult_self2_is_0
6041 zmod_zmult_self2 -> mod_mult_self1_is_0
6044 zdvd_abs1 -> abs_dvd_iff
6045 zdvd_abs2 -> dvd_abs_iff
6046 zdvd_refl -> dvd_refl
6047 zdvd_trans -> dvd_trans
6048 zdvd_zadd -> dvd_add
6049 zdvd_zdiff -> dvd_diff
6050 zdvd_zminus_iff -> dvd_minus_iff
6051 zdvd_zminus2_iff -> minus_dvd_iff
6052 zdvd_zmultD -> dvd_mult_right
6053 zdvd_zmultD2 -> dvd_mult_left
6054 zdvd_zmult_mono -> mult_dvd_mono
6055 zdvd_0_right -> dvd_0_right
6056 zdvd_0_left -> dvd_0_left_iff
6057 zdvd_1_left -> one_dvd
6058 zminus_dvd_iff -> minus_dvd_iff
6060 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
6062 * The real numbers offer decimal input syntax: 12.34 is translated
6063 into 1234/10^2. This translation is not reversed upon output.
6065 * Theory Library/Polynomial defines an abstract type 'a poly of
6066 univariate polynomials with coefficients of type 'a. In addition to
6067 the standard ring operations, it also supports div and mod. Code
6068 generation is also supported, using list-style constructors.
6070 * Theory Library/Inner_Product defines a class of real_inner for real
6071 inner product spaces, with an overloaded operation inner :: 'a => 'a
6072 => real. Class real_inner is a subclass of real_normed_vector from
6075 * Theory Library/Product_Vector provides instances for the product
6076 type 'a * 'b of several classes from RealVector and Inner_Product.
6077 Definitions of addition, subtraction, scalar multiplication, norms,
6078 and inner products are included.
6080 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
6081 addition to the field operations, numerals and case syntax are also
6084 * Theory Library/Diagonalize provides constructive version of Cantor's
6085 first diagonalization argument.
6087 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
6088 zlcm (for int); carried together from various gcd/lcm developements in
6089 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
6090 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
6091 may recover tupled syntax as follows:
6093 hide (open) const gcd
6094 abbreviation gcd where
6095 "gcd == (%(a, b). GCD.gcd a b)"
6097 GCD.gcd ("gcd '(_, _')")
6099 The same works for lcm, zgcd, zlcm.
6101 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
6102 instantiations for algebraic structures. Removed some duplicate
6103 theorems. Changes in simp rules. INCOMPATIBILITY.
6105 * ML antiquotation @{code} takes a constant as argument and generates
6106 corresponding code in background and inserts name of the corresponding
6107 resulting ML value/function/datatype constructor binding in place.
6108 All occurrences of @{code} with a single ML block are generated
6109 simultaneously. Provides a generic and safe interface for
6110 instrumentalizing code generation. See
6111 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
6112 In future you ought to refrain from ad-hoc compiling generated SML
6113 code on the ML toplevel. Note that (for technical reasons) @{code}
6114 cannot refer to constants for which user-defined serializations are
6115 set. Refer to the corresponding ML counterpart directly in that
6118 * Command 'rep_datatype': instead of theorem names the command now
6119 takes a list of terms denoting the constructors of the type to be
6120 represented as datatype. The characteristic theorems have to be
6121 proven. INCOMPATIBILITY. Also observe that the following theorems
6122 have disappeared in favour of existing ones:
6124 unit_induct ~> unit.induct
6125 prod_induct ~> prod.induct
6126 sum_induct ~> sum.induct
6127 Suc_Suc_eq ~> nat.inject
6128 Suc_not_Zero Zero_not_Suc ~> nat.distinct
6133 * New locales for orders and lattices where the equivalence relation
6134 is not restricted to equality. INCOMPATIBILITY: all order and lattice
6135 locales use a record structure with field eq for the equivalence.
6137 * New theory of factorial domains.
6139 * Units_l_inv and Units_r_inv are now simp rules by default.
6140 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
6141 and/or r_inv will now also require deletion of these lemmas.
6143 * Renamed the following theorems, INCOMPATIBILITY:
6145 UpperD ~> Upper_memD
6146 LowerD ~> Lower_memD
6147 least_carrier ~> least_closed
6148 greatest_carrier ~> greatest_closed
6149 greatest_Lower_above ~> greatest_Lower_below
6150 one_zero ~> carrier_one_zero
6151 one_not_zero ~> carrier_one_not_zero (collision with assumption)
6156 * Nominal datatypes can now contain type-variables.
6158 * Commands 'nominal_inductive' and 'equivariance' work with local
6161 * Nominal primrec can now works with local theory targets and its
6162 specification syntax now conforms to the general format as seen in
6165 * Method "perm_simp" honours the standard simplifier attributes
6166 (no_asm), (no_asm_use) etc.
6168 * The new predicate #* is defined like freshness, except that on the
6169 left hand side can be a set or list of atoms.
6171 * Experimental command 'nominal_inductive2' derives strong induction
6172 principles for inductive definitions. In contrast to
6173 'nominal_inductive', which can only deal with a fixed number of
6174 binders, it can deal with arbitrary expressions standing for sets of
6175 atoms to be avoided. The only inductive definition we have at the
6176 moment that needs this generalisation is the typing rule for Lets in
6179 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
6180 -----------------------------------------------------------------
6181 Gamma |- Let x be t1 in t2 : T2
6183 In this rule one wants to avoid all the binders that are introduced by
6184 "close Gamma T1". We are looking for other examples where this
6185 feature might be useful. Please let us know.
6190 * Reimplemented the simplification procedure for proving continuity
6191 subgoals. The new simproc is extensible; users can declare additional
6192 continuity introduction rules with the attribute [cont2cont].
6194 * The continuity simproc now uses a different introduction rule for
6195 solving continuity subgoals on terms with lambda abstractions. In
6196 some rare cases the new simproc may fail to solve subgoals that the
6197 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
6198 Potential INCOMPATIBILITY.
6200 * Command 'fixrec': specification syntax now conforms to the general
6201 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
6202 examples. INCOMPATIBILITY.
6207 * Proof of Zorn's Lemma for partial orders.
6212 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
6213 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
6214 depends on multithreading, so timouts will not work before Poly/ML
6217 * High-level support for concurrent ML programming, see
6218 src/Pure/Cuncurrent. The data-oriented model of "future values" is
6219 particularly convenient to organize independent functional
6220 computations. The concept of "synchronized variables" provides a
6221 higher-order interface for components with shared state, avoiding the
6222 delicate details of mutexes and condition variables. (Requires
6223 Poly/ML 5.2.1 or later.)
6225 * ML bindings produced via Isar commands are stored within the Isar
6226 context (theory or proof). Consequently, commands like 'use' and 'ML'
6227 become thread-safe and work with undo as expected (concerning
6228 top-level bindings, not side-effects on global references).
6229 INCOMPATIBILITY, need to provide proper Isar context when invoking the
6230 compiler at runtime; really global bindings need to be given outside a
6231 theory. (Requires Poly/ML 5.2 or later.)
6233 * Command 'ML_prf' is analogous to 'ML' but works within a proof
6234 context. Top-level ML bindings are stored within the proof context in
6235 a purely sequential fashion, disregarding the nested proof structure.
6236 ML bindings introduced by 'ML_prf' are discarded at the end of the
6237 proof. (Requires Poly/ML 5.2 or later.)
6239 * Simplified ML attribute and method setup, cf. functions Attrib.setup
6240 and Method.setup, as well as Isar commands 'attribute_setup' and
6241 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
6242 existing code accordingly, or use plain 'setup' together with old
6245 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
6246 to 'a -> thm, while results are always tagged with an authentic oracle
6247 name. The Isar command 'oracle' is now polymorphic, no argument type
6248 is specified. INCOMPATIBILITY, need to simplify existing oracle code
6249 accordingly. Note that extra performance may be gained by producing
6250 the cterm carefully, avoiding slow Thm.cterm_of.
6252 * Simplified interface for defining document antiquotations via
6253 ThyOutput.antiquotation, ThyOutput.output, and optionally
6254 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
6255 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
6258 * More systematic treatment of long names, abstract name bindings, and
6259 name space operations. Basic operations on qualified names have been
6260 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
6261 Long_Name.append. Old type bstring has been mostly replaced by
6262 abstract type binding (see structure Binding), which supports precise
6263 qualification by packages and local theory targets, as well as proper
6264 tracking of source positions. INCOMPATIBILITY, need to wrap old
6265 bstring values into Binding.name, or better pass through abstract
6266 bindings everywhere. See further src/Pure/General/long_name.ML,
6267 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
6269 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
6270 LocalTheory.note etc.) now refer to the *full* internal name, not the
6271 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
6273 * Disposed old type and term read functions (Sign.read_def_typ,
6274 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
6275 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
6276 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
6277 Syntax.read_term_global etc.; see also OldGoals.read_term as last
6278 resort for legacy applications.
6280 * Disposed old declarations, tactics, tactic combinators that refer to
6281 the simpset or claset of an implicit theory (such as Addsimps,
6282 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
6283 embedded ML text, or local_simpset_of with a proper context passed as
6284 explicit runtime argument.
6286 * Rules and tactics that read instantiations (read_instantiate,
6287 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
6288 context, which is required for parsing and type-checking. Moreover,
6289 the variables are specified as plain indexnames, not string encodings
6290 thereof. INCOMPATIBILITY.
6292 * Generic Toplevel.add_hook interface allows to analyze the result of
6293 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
6294 for theorem dependency output of transactions resulting in a new
6297 * ML antiquotations: block-structured compilation context indicated by
6298 \<lbrace> ... \<rbrace>; additional antiquotation forms:
6300 @{binding name} - basic name binding
6301 @{let ?pat = term} - term abbreviation (HO matching)
6302 @{note name = fact} - fact abbreviation
6303 @{thm fact} - singleton fact (with attributes)
6304 @{thms fact} - general fact (with attributes)
6305 @{lemma prop by method} - singleton goal
6306 @{lemma prop by meth1 meth2} - singleton goal
6307 @{lemma prop1 ... propN by method} - general goal
6308 @{lemma prop1 ... propN by meth1 meth2} - general goal
6309 @{lemma (open) ...} - open derivation
6314 * The Isabelle "emacs" tool provides a specific interface to invoke
6315 Proof General / Emacs, with more explicit failure if that is not
6316 installed (the old isabelle-interface script silently falls back on
6317 isabelle-process). The PROOFGENERAL_HOME setting determines the
6318 installation location of the Proof General distribution.
6320 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
6321 the Isabelle process into a JVM/Scala application. See
6322 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
6323 process wrapper has been discontinued.)
6325 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
6327 * Various status messages (with exact source position information) are
6328 emitted, if proper markup print mode is enabled. This allows
6329 user-interface components to provide detailed feedback on internal
6334 New in Isabelle2008 (June 2008)
6335 -------------------------------
6339 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
6340 and updated, with formally checked references as hyperlinks.
6342 * Theory loader: use_thy (and similar operations) no longer set the
6343 implicit ML context, which was occasionally hard to predict and in
6344 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
6345 provides a proper context already.
6347 * Theory loader: old-style ML proof scripts being *attached* to a thy
6348 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
6349 'use' within a theory file will do the job.
6351 * Name space merge now observes canonical order, i.e. the second space
6352 is inserted into the first one, while existing entries in the first
6353 space take precedence. INCOMPATIBILITY in rare situations, may try to
6354 swap theory imports.
6356 * Syntax: symbol \<chi> is now considered a letter. Potential
6357 INCOMPATIBILITY in identifier syntax etc.
6359 * Outer syntax: string tokens no longer admit escaped white space,
6360 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
6361 white space without escapes.
6363 * Outer syntax: string tokens may contain arbitrary character codes
6364 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
6370 * Context-dependent token translations. Default setup reverts locally
6371 fixed variables, and adds hilite markup for undeclared frees.
6373 * Unused theorems can be found using the new command 'unused_thms'.
6374 There are three ways of invoking it:
6377 Only finds unused theorems in the current theory.
6379 (2) unused_thms thy_1 ... thy_n -
6380 Finds unused theorems in the current theory and all of its ancestors,
6381 excluding the theories thy_1 ... thy_n and all of their ancestors.
6383 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
6384 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
6385 their ancestors, excluding the theories thy_1 ... thy_n and all of
6388 In order to increase the readability of the list produced by
6389 unused_thms, theorems that have been created by a particular instance
6390 of a theory command such as 'inductive' or 'function' are considered
6391 to belong to the same "group", meaning that if at least one theorem in
6392 this group is used, the other theorems in the same group are no longer
6393 reported as unused. Moreover, if all theorems in the group are
6394 unused, only one theorem in the group is displayed.
6396 Note that proof objects have to be switched on in order for
6397 unused_thms to work properly (i.e. !proofs must be >= 1, which is
6398 usually the case when using Proof General with the default settings).
6400 * Authentic naming of facts disallows ad-hoc overwriting of previous
6401 theorems within the same name space. INCOMPATIBILITY, need to remove
6402 duplicate fact bindings, or even accidental fact duplications. Note
6403 that tools may maintain dynamically scoped facts systematically, using
6404 PureThy.add_thms_dynamic.
6406 * Command 'hide' now allows to hide from "fact" name space as well.
6408 * Eliminated destructive theorem database, simpset, claset, and
6409 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
6410 update of theories within ML code.
6412 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
6413 INCOMPATIBILITY, object-logics depending on former Pure require
6414 additional setup PureThy.old_appl_syntax_setup; object-logics
6415 depending on former CPure need to refer to Pure.
6417 * Commands 'use' and 'ML' are now purely functional, operating on
6418 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
6419 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
6422 * Command 'setup': discontinued implicit version with ML reference.
6424 * Instantiation target allows for simultaneous specification of class
6425 instance operations together with an instantiation proof.
6426 Type-checking phase allows to refer to class operations uniformly.
6427 See src/HOL/Complex/Complex.thy for an Isar example and
6428 src/HOL/Library/Eval.thy for an ML example.
6430 * Indexing of literal facts: be more serious about including only
6431 facts from the visible specification/proof context, but not the
6432 background context (locale etc.). Affects `prop` notation and method
6433 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
6436 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
6437 "(open)" option, which used to expose internal bound variables to the
6440 * Isar statements: removed obsolete case "rule_context".
6441 INCOMPATIBILITY, better use explicit fixes/assumes.
6443 * Locale proofs: default proof step now includes 'unfold_locales';
6444 hence 'proof' without argument may be used to unfold locale
6448 *** Document preparation ***
6450 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
6451 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
6452 obsolete thumbpdf setup (contemporary PDF viewers do this on the
6453 spot); renamed link color from "darkblue" to "linkcolor" (default
6454 value unchanged, can be redefined via \definecolor); no longer sets
6455 "a4paper" option (unnecessary or even intrusive).
6457 * Antiquotation @{lemma A method} proves proposition A by the given
6458 method (either a method name or a method name plus (optional) method
6459 arguments in parentheses) and prints A just like @{prop A}.
6464 * New primrec package. Specification syntax conforms in style to
6465 definition/function/.... No separate induction rule is provided. The
6466 "primrec" command distinguishes old-style and new-style specifications
6467 by syntax. The former primrec package is now named OldPrimrecPackage.
6468 When adjusting theories, beware: constants stemming from new-style
6469 primrec specifications have authentic syntax.
6471 * Metis prover is now an order of magnitude faster, and also works
6472 with multithreading.
6474 * Metis: the maximum number of clauses that can be produced from a
6475 theorem is now given by the attribute max_clauses. Theorems that
6476 exceed this number are ignored, with a warning printed.
6478 * Sledgehammer no longer produces structured proofs by default. To
6479 enable, declare [[sledgehammer_full = true]]. Attributes
6480 reconstruction_modulus, reconstruction_sorts renamed
6481 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
6483 * Method "induct_scheme" derives user-specified induction rules
6484 from well-founded induction and completeness of patterns. This factors
6485 out some operations that are done internally by the function package
6486 and makes them available separately. See
6487 src/HOL/ex/Induction_Scheme.thy for examples.
6489 * More flexible generation of measure functions for termination
6490 proofs: Measure functions can be declared by proving a rule of the
6491 form "is_measure f" and giving it the [measure_function] attribute.
6492 The "is_measure" predicate is logically meaningless (always true), and
6493 just guides the heuristic. To find suitable measure functions, the
6494 termination prover sets up the goal "is_measure ?f" of the appropriate
6495 type and generates all solutions by Prolog-style backward proof using
6498 This setup also deals with rules like
6500 "is_measure f ==> is_measure (list_size f)"
6502 which accommodates nested datatypes that recurse through lists.
6503 Similar rules are predeclared for products and option types.
6505 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
6509 - Definitions of overloaded constants on sets have to be replaced by
6510 definitions on => and bool.
6512 - Some definitions of overloaded operators on sets can now be proved
6513 using the definitions of the operators on => and bool. Therefore,
6514 the following theorems have been renamed:
6516 subset_def -> subset_eq
6517 psubset_def -> psubset_eq
6518 set_diff_def -> set_diff_eq
6519 Compl_def -> Compl_eq
6520 Sup_set_def -> Sup_set_eq
6521 Inf_set_def -> Inf_set_eq
6522 sup_set_def -> sup_set_eq
6523 inf_set_def -> inf_set_eq
6525 - Due to the incompleteness of the HO unification algorithm, some
6526 rules such as subst may require manual instantiation, if some of
6527 the unknowns in the rule is a set.
6529 - Higher order unification and forward proofs:
6532 have "P (S::'a set)" <...>
6533 then have "EX S. P S" ..
6535 no longer works (due to the incompleteness of the HO unification
6536 algorithm) and must be replaced by the pattern
6543 - Calculational reasoning with subst (or similar rules):
6546 have "P (S::'a set)" <...>
6547 also have "S = T" <...>
6548 finally have "P T" .
6550 no longer works (for similar reasons as the previous example) and
6551 must be replaced by something like
6553 have "P (S::'a set)" <...>
6554 moreover have "S = T" <...>
6555 ultimately have "P T" by simp
6557 - Tactics or packages written in ML code:
6558 Code performing pattern matching on types via
6560 Type ("set", [T]) => ...
6562 must be rewritten. Moreover, functions like strip_type or
6563 binder_types no longer return the right value when applied to a
6566 T1 => ... => Tn => U => bool
6570 T1 => ... => Tn => U set
6572 * Merged theories Wellfounded_Recursion, Accessible_Part and
6573 Wellfounded_Relations to theory Wellfounded.
6575 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
6577 * Class finite no longer treats UNIV as class parameter. Use class
6578 enum from theory Library/Enum instead to achieve a similar effect.
6581 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
6582 and "Cons". INCOMPATIBILITY.
6584 * HOL (and FOL): renamed variables in rules imp_elim and swap.
6585 Potential INCOMPATIBILITY.
6587 * Theory Product_Type: duplicated lemmas split_Pair_apply and
6588 injective_fst_snd removed, use split_eta and prod_eqI instead.
6589 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
6591 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
6592 the same name in theory Orderings:
6602 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
6603 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
6604 and different variable names.
6606 * Library/Option_ord.thy: Canonical order on option type.
6608 * Library/RBT.thy: Red-black trees, an efficient implementation of
6611 * Library/Countable.thy: Type class for countable types.
6613 * Theory Int: The representation of numerals has changed. The infix
6614 operator BIT and the bit datatype with constructors B0 and B1 have
6615 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
6616 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
6617 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
6620 * Theory Nat: definition of <= and < on natural numbers no longer
6621 depend on well-founded relations. INCOMPATIBILITY. Definitions
6622 le_def and less_def have disappeared. Consider lemmas not_less
6623 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
6625 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
6626 (whose purpose mainly is for various fold_set functionals) have been
6627 abandoned in favor of the existing algebraic classes
6628 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
6629 lower_semilattice (resp. upper_semilattice) and linorder.
6632 * Theory Transitive_Closure: induct and cases rules now declare proper
6633 case_names ("base" and "step"). INCOMPATIBILITY.
6635 * Theorem Inductive.lfp_ordinal_induct generalized to complete
6636 lattices. The form set-specific version is available as
6637 Inductive.lfp_ordinal_induct_set.
6639 * Renamed theorems "power.simps" to "power_int.simps".
6642 * Class semiring_div provides basic abstract properties of semirings
6643 with division and modulo operations. Subsumes former class dvd_mod.
6645 * Merged theories IntDef, Numeral and IntArith into unified theory
6646 Int. INCOMPATIBILITY.
6648 * Theory Library/Code_Index: type "index" now represents natural
6649 numbers rather than integers. INCOMPATIBILITY.
6651 * New class "uminus" with operation "uminus" (split of from class
6652 "minus" which now only has operation "minus", binary).
6655 * Constants "card", "internal_split", "option_map" now with authentic
6656 syntax. INCOMPATIBILITY.
6658 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
6659 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
6660 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
6661 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
6662 Sup_set_def, le_def, less_def, option_map_def now with object
6663 equality. INCOMPATIBILITY.
6665 * Records. Removed K_record, and replaced it by pure lambda term
6666 %x. c. The simplifier setup is now more robust against eta expansion.
6667 INCOMPATIBILITY: in cases explicitly referring to K_record.
6669 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
6671 * Library/ListVector: new theory of arithmetic vector operations.
6673 * Library/Order_Relation: new theory of various orderings as sets of
6674 pairs. Defines preorders, partial orders, linear orders and
6675 well-orders on sets and on types.
6680 * Renamed some theories to allow to loading both ZF and HOL in the
6683 Datatype -> Datatype_ZF
6684 Inductive -> Inductive_ZF
6691 INCOMPATIBILITY: ZF theories that import individual theories below
6692 Main might need to be adapted. Regular theory Main is still
6693 available, as trivial extension of Main_ZF.
6698 * ML within Isar: antiquotation @{const name} or @{const
6699 name(typargs)} produces statically-checked Const term.
6701 * Functor NamedThmsFun: data is available to the user as dynamic fact
6702 (of the same name). Removed obsolete print command.
6704 * Removed obsolete "use_legacy_bindings" function.
6706 * The ``print mode'' is now a thread-local value derived from a global
6707 template (the former print_mode reference), thus access becomes
6708 non-critical. The global print_mode reference is for session
6709 management only; user-code should use print_mode_value,
6710 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
6712 * Functions system/system_out provide a robust way to invoke external
6713 shell commands, with propagation of interrupts (requires Poly/ML
6714 5.2.1). Do not use OS.Process.system etc. from the basis library!
6719 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
6720 in accordance with Proof General 3.7, which prefers GNU emacs.
6722 * isatool tty runs Isabelle process with plain tty interaction;
6723 optional line editor may be specified via ISABELLE_LINE_EDITOR
6724 setting, the default settings attempt to locate "ledit" and "rlwrap".
6726 * isatool browser now works with Cygwin as well, using general
6727 "javapath" function defined in Isabelle process environment.
6729 * YXML notation provides a simple and efficient alternative to
6730 standard XML transfer syntax. See src/Pure/General/yxml.ML and
6731 isatool yxml as described in the Isabelle system manual.
6733 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
6734 provides general wrapper for managing an Isabelle process in a robust
6735 fashion, with ``cooked'' output from stdin/stderr.
6737 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
6738 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
6740 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
6741 way of changing the user's settings is via
6742 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
6745 * Multithreading.max_threads := 0 refers to the number of actual CPU
6746 cores of the underlying machine, which is a good starting point for
6747 optimal performance tuning. The corresponding usedir option -M allows
6748 "max" as an alias for "0". WARNING: does not work on certain versions
6749 of Mac OS (with Poly/ML 5.1).
6751 * isabelle-process: non-ML sessions are run with "nice", to reduce the
6752 adverse effect of Isabelle flooding interactive front-ends (notably
6753 ProofGeneral / XEmacs).
6757 New in Isabelle2007 (November 2007)
6758 -----------------------------------
6762 * More uniform information about legacy features, notably a
6763 warning/error of "Legacy feature: ...", depending on the state of the
6764 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
6765 legacy features will disappear eventually.
6767 * Theory syntax: the header format ``theory A = B + C:'' has been
6768 discontinued in favour of ``theory A imports B C begin''. Use isatool
6769 fixheaders to convert existing theory files. INCOMPATIBILITY.
6771 * Theory syntax: the old non-Isar theory file format has been
6772 discontinued altogether. Note that ML proof scripts may still be used
6773 with Isar theories; migration is usually quite simple with the ML
6774 function use_legacy_bindings. INCOMPATIBILITY.
6776 * Theory syntax: some popular names (e.g. 'class', 'declaration',
6777 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
6780 * Theory loader: be more serious about observing the static theory
6781 header specifications (including optional directories), but not the
6782 accidental file locations of previously successful loads. The strict
6783 update policy of former update_thy is now already performed by
6784 use_thy, so the former has been removed; use_thys updates several
6785 theories simultaneously, just as 'imports' within a theory header
6786 specification, but without merging the results. Potential
6787 INCOMPATIBILITY: may need to refine theory headers and commands
6788 ROOT.ML which depend on load order.
6790 * Theory loader: optional support for content-based file
6791 identification, instead of the traditional scheme of full physical
6792 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
6793 (cf. the system manual). The new scheme allows to work with
6794 non-finished theories in persistent session images, such that source
6795 files may be moved later on without requiring reloads.
6797 * Theory loader: old-style ML proof scripts being *attached* to a thy
6798 file (with the same base name as the theory) are considered a legacy
6799 feature, which will disappear eventually. Even now, the theory loader
6800 no longer maintains dependencies on such files.
6802 * Syntax: the scope for resolving ambiguities via type-inference is
6803 now limited to individual terms, instead of whole simultaneous
6804 specifications as before. This greatly reduces the complexity of the
6805 syntax module and improves flexibility by separating parsing and
6806 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
6807 'fixes' etc.) are required in rare situations.
6809 * Syntax: constants introduced by new-style packages ('definition',
6810 'abbreviation' etc.) are passed through the syntax module in
6811 ``authentic mode''. This means that associated mixfix annotations
6812 really stick to such constants, independently of potential name space
6813 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
6814 trees are represented slightly differently, may need to adapt syntax
6815 translations accordingly. Use CONST marker in 'translations' and
6816 @{const_syntax} antiquotation in 'parse_translation' etc.
6818 * Legacy goal package: reduced interface to the bare minimum required
6819 to keep existing proof scripts running. Most other user-level
6820 functions are now part of the OldGoals structure, which is *not* open
6821 by default (consider isatool expandshort before open OldGoals).
6822 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
6823 these tend to cause confusion about the actual goal (!) context being
6824 used here, which is not necessarily the same as the_context().
6826 * Command 'find_theorems': supports "*" wild-card in "name:"
6827 criterion; "with_dups" option. Certain ProofGeneral versions might
6828 support a specific search form (see ProofGeneral/CHANGES).
6830 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
6831 by default, which means that "prems" (and also "fixed variables") are
6832 suppressed from proof state output. Note that the ProofGeneral
6833 settings mechanism allows to change and save options persistently, but
6834 older versions of Isabelle will fail to start up if a negative prems
6837 * Local theory targets may be specified by non-nested blocks of
6838 ``context/locale/class ... begin'' followed by ``end''. The body may
6839 contain definitions, theorems etc., including any derived mechanism
6840 that has been implemented on top of these primitives. This concept
6841 generalizes the existing ``theorem (in ...)'' towards more versatility
6844 * Proof General interface: proper undo of final 'end' command;
6845 discontinued Isabelle/classic mode (ML proof scripts).
6848 *** Document preparation ***
6850 * Added antiquotation @{theory name} which prints the given name,
6851 after checking that it refers to a valid ancestor theory in the
6854 * Added antiquotations @{ML_type text} and @{ML_struct text} which
6855 check the given source text as ML type/structure, printing verbatim.
6857 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
6858 "c args == rhs" given in the current context. (Any number of
6859 arguments may be given on the LHS.)
6864 * The 'class' package offers a combination of axclass and locale to
6865 achieve Haskell-like type classes in Isabelle. Definitions and
6866 theorems within a class context produce both relative results (with
6867 implicit parameters according to the locale context), and polymorphic
6868 constants with qualified polymorphism (according to the class
6869 context). Within the body context of a 'class' target, a separate
6870 syntax layer ("user space type system") takes care of converting
6871 between global polymorphic consts and internal locale representation.
6872 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
6873 "isatool doc classes" provides a tutorial.
6875 * Generic code generator framework allows to generate executable
6876 code for ML and Haskell (including Isabelle classes). A short usage
6879 internal compilation:
6880 export_code <list of constants (term syntax)> in SML
6881 writing SML code to a file:
6882 export_code <list of constants (term syntax)> in SML <filename>
6883 writing OCaml code to a file:
6884 export_code <list of constants (term syntax)> in OCaml <filename>
6885 writing Haskell code to a bunch of files:
6886 export_code <list of constants (term syntax)> in Haskell <filename>
6888 evaluating closed propositions to True/False using code generation:
6891 Reasonable default setup of framework in HOL.
6893 Theorem attributs for selecting and transforming function equations theorems:
6895 [code fun]: select a theorem as function equation for a specific constant
6896 [code fun del]: deselect a theorem as function equation for a specific constant
6897 [code inline]: select an equation theorem for unfolding (inlining) in place
6898 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
6900 User-defined serializations (target in {SML, OCaml, Haskell}):
6902 code_const <and-list of constants (term syntax)>
6903 {(target) <and-list of const target syntax>}+
6905 code_type <and-list of type constructors>
6906 {(target) <and-list of type target syntax>}+
6908 code_instance <and-list of instances>
6910 where instance ::= <type constructor> :: <class>
6912 code_class <and_list of classes>
6913 {(target) <and-list of class target syntax>}+
6914 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
6916 code_instance and code_class only are effective to target Haskell.
6918 For example usage see src/HOL/ex/Codegenerator.thy and
6919 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
6920 generation from Isabelle/HOL theories is available via "isatool doc
6923 * Code generator: consts in 'consts_code' Isar commands are now
6924 referred to by usual term syntax (including optional type
6927 * Command 'no_translations' removes translation rules from theory
6930 * Overloaded definitions are now actually checked for acyclic
6931 dependencies. The overloading scheme is slightly more general than
6932 that of Haskell98, although Isabelle does not demand an exact
6933 correspondence to type class and instance declarations.
6934 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
6935 exotic versions of overloading -- at the discretion of the user!
6937 Polymorphic constants are represented via type arguments, i.e. the
6938 instantiation that matches an instance against the most general
6939 declaration given in the signature. For example, with the declaration
6940 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
6941 as c(nat). Overloading is essentially simultaneous structural
6942 recursion over such type arguments. Incomplete specification patterns
6943 impose global constraints on all occurrences, e.g. c('a * 'a) on the
6944 LHS means that more general c('a * 'b) will be disallowed on any RHS.
6945 Command 'print_theory' outputs the normalized system of recursive
6946 equations, see section "definitions".
6948 * Configuration options are maintained within the theory or proof
6949 context (with name and type bool/int/string), providing a very simple
6950 interface to a poor-man's version of general context data. Tools may
6951 declare options in ML (e.g. using Attrib.config_int) and then refer to
6952 these values using Config.get etc. Users may change options via an
6953 associated attribute of the same name. This form of context
6954 declaration works particularly well with commands 'declare' or
6955 'using', for example ``declare [[foo = 42]]''. Thus it has become
6956 very easy to avoid global references, which would not observe Isar
6957 toplevel undo/redo and fail to work with multithreading.
6959 Various global ML references of Pure and HOL have been turned into
6960 configuration options:
6962 Unify.search_bound unify_search_bound
6963 Unify.trace_bound unify_trace_bound
6964 Unify.trace_simp unify_trace_simp
6965 Unify.trace_types unify_trace_types
6966 Simplifier.simp_depth_limit simp_depth_limit
6967 Blast.depth_limit blast_depth_limit
6968 DatatypeProp.dtK datatype_distinctness_limit
6969 fast_arith_neq_limit fast_arith_neq_limit
6970 fast_arith_split_limit fast_arith_split_limit
6972 * Named collections of theorems may be easily installed as context
6973 data using the functor NamedThmsFun (see also
6974 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
6975 attributes; there is also a toplevel print command. This facility is
6976 just a common case of general context data, which is the preferred way
6977 for anything more complex than just a list of facts in canonical
6980 * Isar: command 'declaration' augments a local theory by generic
6981 declaration functions written in ML. This enables arbitrary content
6982 being added to the context, depending on a morphism that tells the
6983 difference of the original declaration context wrt. the application
6984 context encountered later on.
6986 * Isar: proper interfaces for simplification procedures. Command
6987 'simproc_setup' declares named simprocs (with match patterns, and body
6988 text in ML). Attribute "simproc" adds/deletes simprocs in the current
6989 context. ML antiquotation @{simproc name} retrieves named simprocs.
6991 * Isar: an extra pair of brackets around attribute declarations
6992 abbreviates a theorem reference involving an internal dummy fact,
6993 which will be ignored later --- only the effect of the attribute on
6994 the background context will persist. This form of in-place
6995 declarations is particularly useful with commands like 'declare' and
6996 'using', for example ``have A using [[simproc a]] by simp''.
6998 * Isar: method "assumption" (and implicit closing of subproofs) now
6999 takes simple non-atomic goal assumptions into account: after applying
7000 an assumption as a rule the resulting subgoals are solved by atomic
7001 assumption steps. This is particularly useful to finish 'obtain'
7002 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
7003 without referring to the original premise "!!x. P x ==> thesis" in the
7004 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
7007 * Isar: implicit use of prems from the Isar proof context is
7008 considered a legacy feature. Common applications like ``have A .''
7009 may be replaced by ``have A by fact'' or ``note `A`''. In general,
7010 referencing facts explicitly here improves readability and
7011 maintainability of proof texts.
7013 * Isar: improper proof element 'guess' is like 'obtain', but derives
7014 the obtained context from the course of reasoning! For example:
7016 assume "EX x y. A x & B y" -- "any previous fact"
7017 then guess x and y by clarify
7019 This technique is potentially adventurous, depending on the facts and
7020 proof tools being involved here.
7022 * Isar: known facts from the proof context may be specified as literal
7023 propositions, using ASCII back-quote syntax. This works wherever
7024 named facts used to be allowed so far, in proof commands, proof
7025 methods, attributes etc. Literal facts are retrieved from the context
7026 according to unification of type and term parameters. For example,
7027 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
7028 theorems in the current context, then these are valid literal facts:
7029 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
7031 There is also a proof method "fact" which does the same composition
7032 for explicit goal states, e.g. the following proof texts coincide with
7033 certain special cases of literal facts:
7035 have "A" by fact == note `A`
7036 have "A ==> B" by fact == note `A ==> B`
7037 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
7038 have "P a ==> Q a" by fact == note `P a ==> Q a`
7040 * Isar: ":" (colon) is no longer a symbolic identifier character in
7041 outer syntax. Thus symbolic identifiers may be used without
7042 additional white space in declarations like this: ``assume *: A''.
7044 * Isar: 'print_facts' prints all local facts of the current context,
7045 both named and unnamed ones.
7047 * Isar: 'def' now admits simultaneous definitions, e.g.:
7049 def x == "t" and y == "u"
7051 * Isar: added command 'unfolding', which is structurally similar to
7052 'using', but affects both the goal state and facts by unfolding given
7053 rewrite rules. Thus many occurrences of the 'unfold' method or
7054 'unfolded' attribute may be replaced by first-class proof text.
7056 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
7057 and command 'unfolding' now all support object-level equalities
7058 (potentially conditional). The underlying notion of rewrite rule is
7059 analogous to the 'rule_format' attribute, but *not* that of the
7060 Simplifier (which is usually more generous).
7062 * Isar: the new attribute [rotated n] (default n = 1) rotates the
7063 premises of a theorem by n. Useful in conjunction with drule.
7065 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
7066 method expression within a sandbox consisting of the first N
7067 sub-goals, which need to exist. For example, ``simp_all [3]''
7068 simplifies the first three sub-goals, while (rule foo, simp_all)[]
7069 simplifies all new goals that emerge from applying rule foo to the
7070 originally first one.
7072 * Isar: schematic goals are no longer restricted to higher-order
7073 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
7076 * Isar: the conclusion of a long theorem statement is now either
7077 'shows' (a simultaneous conjunction, as before), or 'obtains'
7078 (essentially a disjunction of cases with local parameters and
7079 assumptions). The latter allows to express general elimination rules
7080 adequately; in this notation common elimination rules look like this:
7082 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
7084 obtains x where "P x"
7086 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
7090 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
7096 The subsequent classical rules even refer to the formal "thesis"
7099 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
7102 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
7103 obtains "thesis ==> something"
7105 The actual proof of an 'obtains' statement is analogous to that of the
7106 Isar proof element 'obtain', only that there may be several cases.
7107 Optional case names may be specified in parentheses; these will be
7108 available both in the present proof and as annotations in the
7109 resulting rule, for later use with the 'cases' method (cf. attribute
7112 * Isar: the assumptions of a long theorem statement are available as
7113 "assms" fact in the proof context. This is more appropriate than the
7114 (historical) "prems", which refers to all assumptions of the current
7115 context, including those from the target locale, proof body etc.
7117 * Isar: 'print_statement' prints theorems from the current theory or
7118 proof context in long statement form, according to the syntax of a
7121 * Isar: 'obtain' takes an optional case name for the local context
7122 introduction rule (default "that").
7124 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
7125 explicit (is "_ ==> ?foo") in the rare cases where this still happens
7128 * Pure: syntax "CONST name" produces a fully internalized constant
7129 according to the current context. This is particularly useful for
7130 syntax translations that should refer to internal constant
7131 representations independently of name spaces.
7133 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
7134 instead of "FOO ". This allows multiple binder declarations to coexist
7135 in the same context. INCOMPATIBILITY.
7137 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
7138 primitive that also works in a locale context (both for constants and
7139 fixed variables). Type declaration and internal syntactic representation
7140 of given constants retrieved from the context. Likewise, the
7141 'no_notation' command allows to remove given syntax annotations from the
7144 * Isar/locales: new derived specification elements 'axiomatization',
7145 'definition', 'abbreviation', which support type-inference, admit
7146 object-level specifications (equality, equivalence). See also the
7147 isar-ref manual. Examples:
7150 eq (infix "===" 50) where
7151 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
7153 definition "f x y = x + y + 1"
7154 definition g where "g x = f x x"
7157 neq (infix "=!=" 50) where
7158 "x =!= y == ~ (x === y)"
7160 These specifications may be also used in a locale context. Then the
7161 constants being introduced depend on certain fixed parameters, and the
7162 constant name is qualified by the locale base name. An internal
7163 abbreviation takes care for convenient input and output, making the
7164 parameters implicit and using the original short name. See also
7165 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
7166 entities from a monomorphic theory.
7168 Presently, abbreviations are only available 'in' a target locale, but
7169 not inherited by general import expressions. Also note that
7170 'abbreviation' may be used as a type-safe replacement for 'syntax' +
7171 'translations' in common applications. The "no_abbrevs" print mode
7172 prevents folding of abbreviations in term output.
7174 Concrete syntax is attached to specified constants in internal form,
7175 independently of name spaces. The parse tree representation is
7176 slightly different -- use 'notation' instead of raw 'syntax', and
7177 'translations' with explicit "CONST" markup to accommodate this.
7179 * Pure/Isar: unified syntax for new-style specification mechanisms
7180 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
7181 full type inference and dummy patterns ("_"). For example:
7183 definition "K x _ = x"
7185 inductive conj for A B
7186 where "A ==> B ==> conj A B"
7188 * Pure: command 'print_abbrevs' prints all constant abbreviations of
7189 the current context. Print mode "no_abbrevs" prevents inversion of
7190 abbreviations on output.
7192 * Isar/locales: improved parameter handling: use of locales "var" and
7193 "struct" no longer necessary; - parameter renamings are no longer
7194 required to be injective. For example, this allows to define
7195 endomorphisms as locale endom = homom mult mult h.
7197 * Isar/locales: changed the way locales with predicates are defined.
7198 Instead of accumulating the specification, the imported expression is
7199 now an interpretation. INCOMPATIBILITY: different normal form of
7200 locale expressions. In particular, in interpretations of locales with
7201 predicates, goals repesenting already interpreted fragments are not
7202 removed automatically. Use methods `intro_locales' and
7203 `unfold_locales'; see below.
7205 * Isar/locales: new methods `intro_locales' and `unfold_locales'
7206 provide backward reasoning on locales predicates. The methods are
7207 aware of interpretations and discharge corresponding goals.
7208 `intro_locales' is less aggressive then `unfold_locales' and does not
7209 unfold predicates to assumptions.
7211 * Isar/locales: the order in which locale fragments are accumulated
7212 has changed. This enables to override declarations from fragments due
7213 to interpretations -- for example, unwanted simp rules.
7215 * Isar/locales: interpretation in theories and proof contexts has been
7216 extended. One may now specify (and prove) equations, which are
7217 unfolded in interpreted theorems. This is useful for replacing
7218 defined concepts (constants depending on locale parameters) by
7219 concepts already existing in the target context. Example:
7221 interpretation partial_order ["op <= :: [int, int] => bool"]
7222 where "partial_order.less (op <=) (x::int) y = (x < y)"
7224 Typically, the constant `partial_order.less' is created by a
7225 definition specification element in the context of locale
7228 * Method "induct": improved internal context management to support
7229 local fixes and defines on-the-fly. Thus explicit meta-level
7230 connectives !! and ==> are rarely required anymore in inductive goals
7231 (using object-logic connectives for this purpose has been long
7232 obsolete anyway). Common proof patterns are explained in
7233 src/HOL/Induct/Common_Patterns.thy, see also
7234 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
7237 * Method "induct": improved handling of simultaneous goals. Instead of
7238 introducing object-level conjunction, the statement is now split into
7239 several conclusions, while the corresponding symbolic cases are nested
7240 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
7241 see src/HOL/Induct/Common_Patterns.thy, for example.
7243 * Method "induct": mutual induction rules are now specified as a list
7244 of rule sharing the same induction cases. HOL packages usually provide
7245 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
7246 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
7247 mutual induction rules differently, i.e. like this:
7249 (induct rule: foo_bar.inducts)
7250 (induct set: foo bar)
7251 (induct pred: foo bar)
7252 (induct type: foo bar)
7254 The ML function ProjectRule.projections turns old-style rules into the
7257 * Method "coinduct": dual of induction, see
7258 src/HOL/Library/Coinductive_List.thy for various examples.
7260 * Method "cases", "induct", "coinduct": the ``(open)'' option is
7261 considered a legacy feature.
7263 * Attribute "symmetric" produces result with standardized schematic
7264 variables (index 0). Potential INCOMPATIBILITY.
7266 * Simplifier: by default the simplifier trace only shows top level
7267 rewrites now. That is, trace_simp_depth_limit is set to 1 by
7268 default. Thus there is less danger of being flooded by the trace. The
7269 trace indicates where parts have been suppressed.
7271 * Provers/classical: removed obsolete classical version of elim_format
7272 attribute; classical elim/dest rules are now treated uniformly when
7273 manipulating the claset.
7275 * Provers/classical: stricter checks to ensure that supplied intro,
7276 dest and elim rules are well-formed; dest and elim rules must have at
7279 * Provers/classical: attributes dest/elim/intro take an optional
7280 weight argument for the rule (just as the Pure versions). Weights are
7281 ignored by automated tools, but determine the search order of single
7284 * Syntax: input syntax now supports dummy variable binding "%_. b",
7285 where the body does not mention the bound variable. Note that dummy
7286 patterns implicitly depend on their context of bounds, which makes
7287 "{_. _}" match any set comprehension as expected. Potential
7288 INCOMPATIBILITY -- parse translations need to cope with syntactic
7289 constant "_idtdummy" in the binding position.
7291 * Syntax: removed obsolete syntactic constant "_K" and its associated
7292 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
7293 for example "A -> B" => "Pi A (%_. B)".
7295 * Pure: 'class_deps' command visualizes the subclass relation, using
7296 the graph browser tool.
7298 * Pure: 'print_theory' now suppresses certain internal declarations by
7299 default; use '!' option for full details.
7304 * Method "metis" proves goals by applying the Metis general-purpose
7305 resolution prover (see also http://gilith.com/software/metis/).
7306 Examples are in the directory MetisExamples. WARNING: the
7307 Isabelle/HOL-Metis integration does not yet work properly with
7310 * Command 'sledgehammer' invokes external automatic theorem provers as
7311 background processes. It generates calls to the "metis" method if
7312 successful. These can be pasted into the proof. Users do not have to
7313 wait for the automatic provers to return. WARNING: does not really
7314 work with multi-threading.
7316 * New "auto_quickcheck" feature tests outermost goal statements for
7317 potential counter-examples. Controlled by ML references
7318 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
7319 5000 milliseconds). Fails silently if statements is outside of
7320 executable fragment, or any other codgenerator problem occurs.
7322 * New constant "undefined" with axiom "undefined x = undefined".
7324 * Added class "HOL.eq", allowing for code generation with polymorphic
7327 * Some renaming of class constants due to canonical name prefixing in
7328 the new 'class' package:
7330 HOL.abs ~> HOL.abs_class.abs
7331 HOL.divide ~> HOL.divide_class.divide
7332 0 ~> HOL.zero_class.zero
7333 1 ~> HOL.one_class.one
7334 op + ~> HOL.plus_class.plus
7335 op - ~> HOL.minus_class.minus
7336 uminus ~> HOL.minus_class.uminus
7337 op * ~> HOL.times_class.times
7338 op < ~> HOL.ord_class.less
7339 op <= > HOL.ord_class.less_eq
7340 Nat.power ~> Power.power_class.power
7341 Nat.size ~> Nat.size_class.size
7342 Numeral.number_of ~> Numeral.number_class.number_of
7343 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
7344 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
7345 Orderings.min ~> Orderings.ord_class.min
7346 Orderings.max ~> Orderings.ord_class.max
7347 Divides.op div ~> Divides.div_class.div
7348 Divides.op mod ~> Divides.div_class.mod
7349 Divides.op dvd ~> Divides.div_class.dvd
7351 INCOMPATIBILITY. Adaptions may be required in the following cases:
7353 a) User-defined constants using any of the names "plus", "minus",
7354 "times", "less" or "less_eq". The standard syntax translations for
7355 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
7358 b) Variables named "plus", "minus", "times", "less", "less_eq"
7359 INCOMPATIBILITY: use more specific names.
7361 c) Permutative equations (e.g. "a + b = b + a")
7362 Since the change of names also changes the order of terms, permutative
7363 rewrite rules may get applied in a different order. Experience shows
7364 that this is rarely the case (only two adaptions in the whole Isabelle
7365 distribution). INCOMPATIBILITY: rewrite proofs
7367 d) ML code directly refering to constant names
7368 This in general only affects hand-written proof tactics, simprocs and
7369 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
7370 Consider using @{const_name} antiquotation.
7372 * New class "default" with associated constant "default".
7374 * Function "sgn" is now overloaded and available on int, real, complex
7375 (and other numeric types), using class "sgn". Two possible defs of
7376 sgn are given as equational assumptions in the classes sgn_if and
7377 sgn_div_norm; ordered_idom now also inherits from sgn_if.
7380 * Locale "partial_order" now unified with class "order" (cf. theory
7381 Orderings), added parameter "less". INCOMPATIBILITY.
7383 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
7384 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
7385 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
7387 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
7388 changed order of proof goals in instance proofs.
7390 * The transitivity reasoner for partial and linear orders is set up
7391 for classes "order" and "linorder". Instances of the reasoner are available
7392 in all contexts importing or interpreting the corresponding locales.
7393 Method "order" invokes the reasoner separately; the reasoner
7394 is also integrated with the Simplifier as a solver. Diagnostic
7395 command 'print_orders' shows the available instances of the reasoner
7396 in the current context.
7398 * Localized monotonicity predicate in theory "Orderings"; integrated
7399 lemmas max_of_mono and min_of_mono with this predicate.
7402 * Formulation of theorem "dense" changed slightly due to integration
7403 with new class dense_linear_order.
7405 * Uniform lattice theory development in HOL.
7407 constants "meet" and "join" now named "inf" and "sup"
7408 constant "Meet" now named "Inf"
7410 classes "meet_semilorder" and "join_semilorder" now named
7411 "lower_semilattice" and "upper_semilattice"
7412 class "lorder" now named "lattice"
7413 class "comp_lat" now named "complete_lattice"
7415 Instantiation of lattice classes allows explicit definitions
7416 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
7418 INCOMPATIBILITY. Theorem renames:
7420 meet_left_le ~> inf_le1
7421 meet_right_le ~> inf_le2
7422 join_left_le ~> sup_ge1
7423 join_right_le ~> sup_ge2
7424 meet_join_le ~> inf_sup_ord
7427 le_meet ~> le_inf_iff
7428 le_join ~> ge_sup_conv
7429 meet_idempotent ~> inf_idem
7430 join_idempotent ~> sup_idem
7431 meet_comm ~> inf_commute
7432 join_comm ~> sup_commute
7433 meet_leI1 ~> le_infI1
7434 meet_leI2 ~> le_infI2
7435 le_joinI1 ~> le_supI1
7436 le_joinI2 ~> le_supI2
7437 meet_assoc ~> inf_assoc
7438 join_assoc ~> sup_assoc
7439 meet_left_comm ~> inf_left_commute
7440 meet_left_idempotent ~> inf_left_idem
7441 join_left_comm ~> sup_left_commute
7442 join_left_idempotent ~> sup_left_idem
7445 le_def_meet ~> le_iff_inf
7446 le_def_join ~> le_iff_sup
7447 join_absorp2 ~> sup_absorb2
7448 join_absorp1 ~> sup_absorb1
7449 meet_absorp1 ~> inf_absorb1
7450 meet_absorp2 ~> inf_absorb2
7451 meet_join_absorp ~> inf_sup_absorb
7452 join_meet_absorp ~> sup_inf_absorb
7453 distrib_join_le ~> distrib_sup_le
7454 distrib_meet_le ~> distrib_inf_le
7456 add_meet_distrib_left ~> add_inf_distrib_left
7457 add_join_distrib_left ~> add_sup_distrib_left
7458 is_join_neg_meet ~> is_join_neg_inf
7459 is_meet_neg_join ~> is_meet_neg_sup
7460 add_meet_distrib_right ~> add_inf_distrib_right
7461 add_join_distrib_right ~> add_sup_distrib_right
7462 add_meet_join_distribs ~> add_sup_inf_distribs
7463 join_eq_neg_meet ~> sup_eq_neg_inf
7464 meet_eq_neg_join ~> inf_eq_neg_sup
7465 add_eq_meet_join ~> add_eq_inf_sup
7466 meet_0_imp_0 ~> inf_0_imp_0
7467 join_0_imp_0 ~> sup_0_imp_0
7468 meet_0_eq_0 ~> inf_0_eq_0
7469 join_0_eq_0 ~> sup_0_eq_0
7470 neg_meet_eq_join ~> neg_inf_eq_sup
7471 neg_join_eq_meet ~> neg_sup_eq_inf
7472 join_eq_if ~> sup_eq_if
7474 mono_meet ~> mono_inf
7475 mono_join ~> mono_sup
7476 meet_bool_eq ~> inf_bool_eq
7477 join_bool_eq ~> sup_bool_eq
7478 meet_fun_eq ~> inf_fun_eq
7479 join_fun_eq ~> sup_fun_eq
7480 meet_set_eq ~> inf_set_eq
7481 join_set_eq ~> sup_set_eq
7482 meet1_iff ~> inf1_iff
7483 meet2_iff ~> inf2_iff
7492 join1_iff ~> sup1_iff
7493 join2_iff ~> sup2_iff
7503 is_meet_Meet ~> is_meet_Inf
7504 Meet_bool_def ~> Inf_bool_def
7505 Meet_fun_def ~> Inf_fun_def
7506 Meet_greatest ~> Inf_greatest
7507 Meet_lower ~> Inf_lower
7508 Meet_set_def ~> Inf_set_def
7511 Sup_bool_eq ~> Sup_bool_def
7512 Sup_fun_eq ~> Sup_fun_def
7513 Sup_set_eq ~> Sup_set_def
7515 listsp_meetI ~> listsp_infI
7516 listsp_meet_eq ~> listsp_inf_eq
7521 * Added syntactic class "size"; overloaded constant "size" now has
7522 type "'a::size ==> bool"
7524 * Internal reorganisation of `size' of datatypes: size theorems
7525 "foo.size" are no longer subsumed by "foo.simps" (but are still
7526 simplification rules by default!); theorems "prod.size" now named
7529 * Class "div" now inherits from class "times" rather than "type".
7532 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
7533 Linorder etc. have disappeared; operations defined in terms of
7534 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
7536 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
7538 * HOL-Word: New extensive library and type for generic, fixed size
7539 machine words, with arithmetic, bit-wise, shifting and rotating
7540 operations, reflection into int, nat, and bool lists, automation for
7541 linear arithmetic (by automatic reflection into nat or int), including
7542 lemmas on overflow and monotonicity. Instantiated to all appropriate
7543 arithmetic type classes, supporting automatic simplification of
7544 numerals on all operations.
7546 * Library/Boolean_Algebra: locales for abstract boolean algebras.
7548 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
7550 * Code generator library theories:
7551 - Code_Integer represents HOL integers by big integer literals in target
7553 - Code_Char represents HOL characters by character literals in target
7555 - Code_Char_chr like Code_Char, but also offers treatment of character
7556 codes; includes Code_Integer.
7557 - Executable_Set allows to generate code for finite sets using lists.
7558 - Executable_Rat implements rational numbers as triples (sign, enumerator,
7560 - Executable_Real implements a subset of real numbers, namly those
7561 representable by rational numbers.
7562 - Efficient_Nat implements natural numbers by integers, which in general will
7563 result in higher efficency; pattern matching with 0/Suc is eliminated;
7564 includes Code_Integer.
7565 - Code_Index provides an additional datatype index which is mapped to
7566 target-language built-in integers.
7567 - Code_Message provides an additional datatype message_string which is isomorphic to
7568 strings; messages are mapped to target-language strings.
7570 * New package for inductive predicates
7572 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
7575 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7576 for z_1 :: U_1 and ... and z_n :: U_m
7578 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7581 with full support for type-inference, rather than
7583 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7585 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7586 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7588 inductive "s z_1 ... z_m"
7590 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7593 For backward compatibility, there is a wrapper allowing inductive
7594 sets to be defined with the new package via
7597 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7598 for z_1 :: U_1 and ... and z_n :: U_m
7600 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7606 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7607 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7608 for z_1 :: U_1 and ... and z_n :: U_m
7610 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7611 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7614 if the additional syntax "p ..." is required.
7616 Numerous examples can be found in the subdirectories src/HOL/Auth,
7617 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
7621 - Since declaration and definition of inductive sets or predicates
7622 is no longer separated, abbreviations involving the newly
7623 introduced sets or predicates must be specified together with the
7624 introduction rules after the 'where' keyword (see above), rather
7625 than before the actual inductive definition.
7627 - The variables in induction and elimination rules are now
7628 quantified in the order of their occurrence in the introduction
7629 rules, rather than in alphabetical order. Since this may break
7630 some proofs, these proofs either have to be repaired, e.g. by
7631 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
7632 statements of the form
7634 case (rule_i a_i_1 ... a_i_{k_i})
7636 or the old order of quantification has to be restored by explicitly adding
7637 meta-level quantifiers in the introduction rules, i.e.
7639 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
7641 - The format of the elimination rules is now
7643 p z_1 ... z_m x_1 ... x_n ==>
7644 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7649 (x_1, ..., x_n) : s z_1 ... z_m ==>
7650 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7653 for sets rather than
7655 x : s z_1 ... z_m ==>
7656 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
7659 This may require terms in goals to be expanded to n-tuples
7660 (e.g. using case_tac or simplification with the split_paired_all
7661 rule) before the above elimination rule is applicable.
7663 - The elimination or case analysis rules for (mutually) inductive
7664 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
7665 list of rules "p_1_..._p_k.elims" is no longer available.
7667 * New package "function"/"fun" for general recursive functions,
7668 supporting mutual and nested recursion, definitions in local contexts,
7669 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
7670 for small examples, and the separate tutorial on the function
7671 package. The old recdef "package" is still available as before, but
7672 users are encouraged to use the new package.
7674 * Method "lexicographic_order" automatically synthesizes termination
7675 relations as lexicographic combinations of size measures.
7677 * Case-expressions allow arbitrary constructor-patterns (including
7678 "_") and take their order into account, like in functional
7679 programming. Internally, this is translated into nested
7680 case-expressions; missing cases are added and mapped to the predefined
7681 constant "undefined". In complicated cases printing may no longer show
7682 the original input but the internal form. Lambda-abstractions allow
7683 the same form of pattern matching: "% pat1 => e1 | ..." is an
7684 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
7687 * IntDef: The constant "int :: nat => int" has been removed; now "int"
7688 is an abbreviation for "of_nat :: nat => int". The simplification
7689 rules for "of_nat" have been changed to work like "int" did
7690 previously. Potential INCOMPATIBILITY:
7691 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
7692 - of_nat_diff and of_nat_mult are no longer default simp rules
7694 * Method "algebra" solves polynomial equations over (semi)rings using
7695 Groebner bases. The (semi)ring structure is defined by locales and the
7696 tool setup depends on that generic context. Installing the method for
7697 a specific type involves instantiating the locale and possibly adding
7698 declarations for computation on the coefficients. The method is
7699 already instantiated for natural numbers and for the axiomatic class
7700 of idoms with numerals. See also the paper by Chaieb and Wenzel at
7701 CALCULEMUS 2007 for the general principles underlying this
7702 architecture of context-aware proof-tools.
7704 * Method "ferrack" implements quantifier elimination over
7705 special-purpose dense linear orders using locales (analogous to
7706 "algebra"). The method is already installed for class
7707 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
7710 * Former constant "List.op @" now named "List.append". Use ML
7711 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
7712 circumvent possible incompatibilities when working on ML level.
7714 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
7716 * New function listsum :: 'a list => 'a for arbitrary monoids.
7717 Special syntax: "SUM x <- xs. f x" (and latex variants)
7719 * New syntax for Haskell-like list comprehension (input only), eg.
7720 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
7722 * The special syntax for function "filter" has changed from [x :
7723 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
7724 comprehension syntax, and for uniformity. INCOMPATIBILITY.
7726 * [a..b] is now defined for arbitrary linear orders. It used to be
7727 defined on nat only, as an abbreviation for [a..<Suc b]
7730 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
7732 * New functions "sorted" and "sort" in src/HOL/List.thy.
7734 * New lemma collection field_simps (an extension of ring_simps) for
7735 manipulating (in)equations involving division. Multiplies with all
7736 denominators that can be proved to be non-zero (in equations) or
7737 positive/negative (in inequations).
7739 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
7740 have been improved and renamed to ring_simps, group_simps and
7741 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
7742 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
7744 * Theory Library/Commutative_Ring: switched from recdef to function
7745 package; constants add, mul, pow now curried. Infix syntax for
7746 algebraic operations.
7748 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
7751 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
7754 * HOL/records: generalised field-update to take a function on the
7755 field rather than the new value: r(|A := x|) is translated to A_update
7756 (K x) r The K-combinator that is internally used is called K_record.
7757 INCOMPATIBILITY: Usage of the plain update functions has to be
7760 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
7761 * x = 0, which are required for a semiring. Richer structures do not
7762 inherit from semiring_0 anymore, because this property is a theorem
7763 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
7764 there is more to prove, but this is mostly trivial.
7766 * Class "recpower" is generalized to arbitrary monoids, not just
7767 commutative semirings. INCOMPATIBILITY: may need to incorporate
7768 commutativity or semiring properties additionally.
7770 * Constant "List.list_all2" in List.thy now uses authentic syntax.
7771 INCOMPATIBILITY: translations containing list_all2 may go wrong,
7772 better use 'abbreviation'.
7774 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
7776 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
7777 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
7778 significant changes for setting up numeral syntax for types:
7779 - New constants Numeral.pred and Numeral.succ instead
7780 of former Numeral.bin_pred and Numeral.bin_succ.
7781 - Use integer operations instead of bin_add, bin_mult and so on.
7782 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
7783 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
7785 See src/HOL/Integ/IntArith.thy for an example setup.
7787 * Command 'normal_form' computes the normal form of a term that may
7788 contain free variables. For example ``normal_form "rev [a, b, c]"''
7789 produces ``[b, c, a]'' (without proof). This command is suitable for
7790 heavy-duty computations because the functions are compiled to ML
7791 first. Correspondingly, a method "normalization" is provided. See
7792 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
7794 * Alternative iff syntax "A <-> B" for equality on bool (with priority
7795 25 like -->); output depends on the "iff" print_mode, the default is
7796 "A = B" (with priority 50).
7798 * Relations less (<) and less_eq (<=) are also available on type bool.
7799 Modified syntax to disallow nesting without explicit parentheses,
7800 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
7803 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
7805 * Relation composition operator "op O" now has precedence 75 and binds
7806 stronger than union and intersection. INCOMPATIBILITY.
7808 * The old set interval syntax "{m..n(}" (and relatives) has been
7809 removed. Use "{m..<n}" (and relatives) instead.
7811 * In the context of the assumption "~(s = t)" the Simplifier rewrites
7812 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
7813 ``declare [[simproc del: neq]]''.
7815 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
7818 * Theorem Cons_eq_map_conv no longer declared as "simp".
7820 * Theorem setsum_mult renamed to setsum_right_distrib.
7822 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
7825 * Reimplemented methods "sat" and "satx", with several improvements:
7826 goals no longer need to be stated as "<prems> ==> False", equivalences
7827 (i.e. "=" on type bool) are handled, variable names of the form
7828 "lit_<n>" are no longer reserved, significant speedup.
7830 * Methods "sat" and "satx" can now replay MiniSat proof traces.
7831 zChaff is still supported as well.
7833 * 'inductive' and 'datatype': provide projections of mutual rules,
7834 bundled as foo_bar.inducts;
7836 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
7839 * Library: moved theory Accessible_Part to main HOL.
7841 * Library: added theory Coinductive_List of potentially infinite lists
7842 as greatest fixed-point.
7844 * Library: added theory AssocList which implements (finite) maps as
7847 * Method "evaluation" solves goals (i.e. a boolean expression)
7848 efficiently by compiling it to ML. The goal is "proved" (via an
7849 oracle) if it evaluates to True.
7851 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
7852 also when invoked by the simplifier. This results in the Simplifier
7853 being more powerful on arithmetic goals. INCOMPATIBILITY.
7854 Configuration option fast_arith_split_limit=0 recovers the old
7857 * Support for hex (0x20) and binary (0b1001) numerals.
7859 * New method: reify eqs (t), where eqs are equations for an
7860 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
7861 parameter, computes a term s::'b and a list xs::'a list and proves the
7862 theorem I xs s = t. This is also known as reification or quoting. The
7863 resulting theorem is applied to the subgoal to substitute t with I xs
7864 s. If t is omitted, the subgoal itself is reified.
7866 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
7867 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
7868 where f is supposed to be a computable function (in the sense of code
7869 generattion). The method uses reify to compute s and xs as above then
7870 applies corr_thm and uses normalization by evaluation to "prove" f s =
7871 r and finally gets the theorem t = r, which is again applied to the
7872 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
7874 * Reflection: Automatic reification now handels binding, an example is
7875 available in src/HOL/ex/ReflectionEx.thy
7877 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
7878 command 'statespace' that is similar to 'record', but introduces an
7879 abstract specification based on the locale infrastructure instead of
7880 HOL types. This leads to extra flexibility in composing state spaces,
7881 in particular multiple inheritance and renaming of components.
7886 * Hyperreal: Functions root and sqrt are now defined on negative real
7887 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
7888 Nonnegativity side conditions have been removed from many lemmas, so
7889 that more subgoals may now be solved by simplification; potential
7892 * Real: new type classes formalize real normed vector spaces and
7893 algebras, using new overloaded constants scaleR :: real => 'a => 'a
7894 and norm :: 'a => real.
7896 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
7897 reals into other types. The overloaded constant Reals :: 'a set is now
7898 defined as range of_real; potential INCOMPATIBILITY.
7900 * Real: proper support for ML code generation, including 'quickcheck'.
7901 Reals are implemented as arbitrary precision rationals.
7903 * Hyperreal: Several constants that previously worked only for the
7904 reals have been generalized, so they now work over arbitrary vector
7905 spaces. Type annotations may need to be added in some cases; potential
7908 Infinitesimal :: ('a::real_normed_vector) star set
7909 HFinite :: ('a::real_normed_vector) star set
7910 HInfinite :: ('a::real_normed_vector) star set
7911 approx :: ('a::real_normed_vector) star => 'a star => bool
7912 monad :: ('a::real_normed_vector) star => 'a star set
7913 galaxy :: ('a::real_normed_vector) star => 'a star set
7914 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
7915 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
7916 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
7917 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
7918 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
7919 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
7920 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
7921 sgn :: 'a::real_normed_vector => 'a
7922 exp :: 'a::{recpower,real_normed_field,banach} => 'a
7924 * Complex: Some complex-specific constants are now abbreviations for
7925 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
7926 hnorm. Other constants have been entirely removed in favor of the
7927 polymorphic versions (INCOMPATIBILITY):
7931 HInfinite <-- CInfinite
7932 Infinitesimal <-- CInfinitesimal
7935 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
7936 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
7937 (ns)deriv <-- (ns)cderiv
7942 * Formalisation of ideals and the quotient construction over rings.
7944 * Order and lattice theory no longer based on records.
7947 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
7948 greatest_closed. INCOMPATIBILITY.
7950 * Method algebra is now set up via an attribute. For examples see
7951 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
7952 of algebraic structures.
7954 * Renamed theory CRing to Ring.
7959 * Substantial, yet incomplete support for nominal datatypes (binding
7960 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
7961 src/HOL/Nominal/Examples. Prospective users should consult
7962 http://isabelle.in.tum.de/nominal/
7967 * ML basics: just one true type int, which coincides with IntInf.int
7970 * ML within Isar: antiquotations allow to embed statically-checked
7971 formal entities in the source, referring to the context available at
7972 compile-time. For example:
7974 ML {* @{sort "{zero,one}"} *}
7975 ML {* @{typ "'a => 'b"} *}
7976 ML {* @{term "%x. x"} *}
7977 ML {* @{prop "x == y"} *}
7978 ML {* @{ctyp "'a => 'b"} *}
7979 ML {* @{cterm "%x. x"} *}
7980 ML {* @{cprop "x == y"} *}
7981 ML {* @{thm asm_rl} *}
7982 ML {* @{thms asm_rl} *}
7983 ML {* @{type_name c} *}
7984 ML {* @{type_syntax c} *}
7985 ML {* @{const_name c} *}
7986 ML {* @{const_syntax c} *}
7989 ML {* @{theory Pure} *}
7990 ML {* @{theory_ref} *}
7991 ML {* @{theory_ref Pure} *}
7994 ML {* @{clasimpset} *}
7996 The same works for sources being ``used'' within an Isar context.
7998 * ML in Isar: improved error reporting; extra verbosity with
7999 ML_Context.trace enabled.
8001 * Pure/General/table.ML: the join operations now works via exceptions
8002 DUP/SAME instead of type option. This is simpler in simple cases, and
8003 admits slightly more efficient complex applications.
8005 * Pure: 'advanced' translation functions (parse_translation etc.) now
8006 use Context.generic instead of just theory.
8008 * Pure: datatype Context.generic joins theory/Proof.context and
8009 provides some facilities for code that works in either kind of
8010 context, notably GenericDataFun for uniform theory and proof data.
8012 * Pure: simplified internal attribute type, which is now always
8013 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
8014 local (Proof.context) attributes have been discontinued, while
8015 minimizing code duplication. Thm.rule_attribute and
8016 Thm.declaration_attribute build canonical attributes; see also structure
8017 Context for further operations on Context.generic, notably
8018 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
8019 declarations and definitions.
8021 * Context data interfaces (Theory/Proof/GenericDataFun): removed
8022 name/print, uninitialized data defaults to ad-hoc copy of empty value,
8023 init only required for impure data. INCOMPATIBILITY: empty really need
8024 to be empty (no dependencies on theory content!)
8026 * Pure/kernel: consts certification ignores sort constraints given in
8027 signature declarations. (This information is not relevant to the
8028 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
8029 potential INCOMPATIBILITY.
8031 * Pure: axiomatic type classes are now purely definitional, with
8032 explicit proofs of class axioms and super class relations performed
8033 internally. See Pure/axclass.ML for the main internal interfaces --
8034 notably AxClass.define_class supercedes AxClass.add_axclass, and
8035 AxClass.axiomatize_class/classrel/arity supersede
8036 Sign.add_classes/classrel/arities.
8038 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
8039 global/local versions on theory vs. Proof.context have been
8040 discontinued; Attrib.syntax and Method.syntax have been adapted
8041 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
8042 attributes, methods, etc.
8044 * Pure: several functions of signature "... -> theory -> theory * ..."
8045 have been reoriented to "... -> theory -> ... * theory" in order to
8046 allow natural usage in combination with the ||>, ||>>, |-> and
8047 fold_map combinators.
8049 * Pure: official theorem names (closed derivations) and additional
8050 comments (tags) are now strictly separate. Name hints -- which are
8051 maintained as tags -- may be attached any time without affecting the
8054 * Pure: primitive rule lift_rule now takes goal cterm instead of an
8055 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
8056 achieve the old behaviour.
8058 * Pure: the "Goal" constant is now called "prop", supporting a
8059 slightly more general idea of ``protecting'' meta-level rule
8062 * Pure: Logic.(un)varify only works in a global context, which is now
8063 enforced instead of silently assumed. INCOMPATIBILITY, may use
8064 Logic.legacy_(un)varify as temporary workaround.
8066 * Pure: structure Name provides scalable operations for generating
8067 internal variable names, notably Name.variants etc. This replaces
8068 some popular functions from term.ML:
8070 Term.variant -> Name.variant
8071 Term.variantlist -> Name.variant_list
8072 Term.invent_names -> Name.invent_list
8074 Note that low-level renaming rarely occurs in new code -- operations
8075 from structure Variable are used instead (see below).
8077 * Pure: structure Variable provides fundamental operations for proper
8078 treatment of fixed/schematic variables in a context. For example,
8079 Variable.import introduces fixes for schematics of given facts and
8080 Variable.export reverses the effect (up to renaming) -- this replaces
8081 various freeze_thaw operations.
8083 * Pure: structure Goal provides simple interfaces for
8084 init/conclude/finish and tactical prove operations (replacing former
8085 Tactic.prove). Goal.prove is the canonical way to prove results
8086 within a given context; Goal.prove_global is a degraded version for
8087 theory level goals, including a global Drule.standard. Note that
8088 OldGoals.prove_goalw_cterm has long been obsolete, since it is
8089 ill-behaved in a local proof context (e.g. with local fixes/assumes or
8090 in a locale context).
8092 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
8093 and type checking (Syntax.check_term etc.), with common combinations
8094 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
8095 which are considered legacy and await removal.
8097 * Pure/Syntax: generic interfaces for type unchecking
8098 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
8099 with common combinations (Syntax.pretty_term, Syntax.string_of_term
8100 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
8101 available for convenience, but refer to the very same operations using
8102 a mere theory instead of a full context.
8104 * Isar: simplified treatment of user-level errors, using exception
8105 ERROR of string uniformly. Function error now merely raises ERROR,
8106 without any side effect on output channels. The Isar toplevel takes
8107 care of proper display of ERROR exceptions. ML code may use plain
8108 handle/can/try; cat_error may be used to concatenate errors like this:
8110 ... handle ERROR msg => cat_error msg "..."
8112 Toplevel ML code (run directly or through the Isar toplevel) may be
8113 embedded into the Isar toplevel with exception display/debug like
8116 Isar.toplevel (fn () => ...)
8118 INCOMPATIBILITY, removed special transform_error facilities, removed
8119 obsolete variants of user-level exceptions (ERROR_MESSAGE,
8120 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
8121 -- use plain ERROR instead.
8123 * Isar: theory setup now has type (theory -> theory), instead of a
8124 list. INCOMPATIBILITY, may use #> to compose setup functions.
8126 * Isar: ML toplevel pretty printer for type Proof.context, subject to
8127 ProofContext.debug/verbose flags.
8129 * Isar: Toplevel.theory_to_proof admits transactions that modify the
8130 theory before entering a proof state. Transactions now always see a
8131 quasi-functional intermediate checkpoint, both in interactive and
8134 * Isar: simplified interfaces for outer syntax. Renamed
8135 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
8136 OuterSyntax.add_parsers -- this functionality is now included in
8137 OuterSyntax.command etc. INCOMPATIBILITY.
8139 * Simplifier: the simpset of a running simplification process now
8140 contains a proof context (cf. Simplifier.the_context), which is the
8141 very context that the initial simpset has been retrieved from (by
8142 simpset_of/local_simpset_of). Consequently, all plug-in components
8143 (solver, looper etc.) may depend on arbitrary proof data.
8145 * Simplifier.inherit_context inherits the proof context (plus the
8146 local bounds) of the current simplification process; any simproc
8147 etc. that calls the Simplifier recursively should do this! Removed
8148 former Simplifier.inherit_bounds, which is already included here --
8149 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
8150 specify an explicit context using Simplifier.context/theory_context.
8152 * Simplifier/Classical Reasoner: more abstract interfaces
8153 change_simpset/claset for modifying the simpset/claset reference of a
8154 theory; raw versions simpset/claset_ref etc. have been discontinued --
8157 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
8163 * settings: the default heap location within ISABELLE_HOME_USER now
8164 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
8165 Isabelle installations.
8167 * isabelle-process: option -S (secure mode) disables some critical
8168 operations, notably runtime compilation and evaluation of ML source
8171 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
8173 * Support for parallel execution, using native multicore support of
8174 Poly/ML 5.1. The theory loader exploits parallelism when processing
8175 independent theories, according to the given theory header
8176 specifications. The maximum number of worker threads is specified via
8177 usedir option -M or the "max-threads" setting in Proof General. A
8178 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
8179 to 6 on a 8-core machine. User-code needs to observe certain
8180 guidelines for thread-safe programming, see appendix A in the Isar
8181 Implementation manual.
8185 New in Isabelle2005 (October 2005)
8186 ----------------------------------
8190 * Theory headers: the new header syntax for Isar theories is
8193 imports <theory1> ... <theoryN>
8194 uses <file1> ... <fileM>
8197 where the 'uses' part is optional. The previous syntax
8199 theory <name> = <theory1> + ... + <theoryN>:
8201 will disappear in the next release. Use isatool fixheaders to convert
8202 existing theory files. Note that there is no change in ancient
8203 non-Isar theories now, but these will disappear soon.
8205 * Theory loader: parent theories can now also be referred to via
8206 relative and absolute paths.
8208 * Command 'find_theorems' searches for a list of criteria instead of a
8209 list of constants. Known criteria are: intro, elim, dest, name:string,
8210 simp:term, and any term. Criteria can be preceded by '-' to select
8211 theorems that do not match. Intro, elim, dest select theorems that
8212 match the current goal, name:s selects theorems whose fully qualified
8213 name contain s, and simp:term selects all simplification rules whose
8214 lhs match term. Any other term is interpreted as pattern and selects
8215 all theorems matching the pattern. Available in ProofGeneral under
8216 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
8218 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
8220 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
8221 matching the current goal as introduction rule and not having "HOL."
8222 in their name (i.e. not being defined in theory HOL).
8224 * Command 'thms_containing' has been discontinued in favour of
8225 'find_theorems'; INCOMPATIBILITY.
8227 * Communication with Proof General is now 8bit clean, which means that
8228 Unicode text in UTF-8 encoding may be used within theory texts (both
8229 formal and informal parts). Cf. option -U of the Isabelle Proof
8230 General interface. Here are some simple examples (cf. src/HOL/ex):
8232 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
8233 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
8235 * Improved efficiency of the Simplifier and, to a lesser degree, the
8236 Classical Reasoner. Typical big applications run around 2 times
8240 *** Document preparation ***
8242 * Commands 'display_drafts' and 'print_drafts' perform simple output
8243 of raw sources. Only those symbols that do not require additional
8244 LaTeX packages (depending on comments in isabellesym.sty) are
8245 displayed properly, everything else is left verbatim. isatool display
8246 and isatool print are used as front ends (these are subject to the
8247 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
8249 * Command tags control specific markup of certain regions of text,
8250 notably folding and hiding. Predefined tags include "theory" (for
8251 theory begin and end), "proof" for proof commands, and "ML" for
8252 commands involving ML code; the additional tags "visible" and
8253 "invisible" are unused by default. Users may give explicit tag
8254 specifications in the text, e.g. ''by %invisible (auto)''. The
8255 interpretation of tags is determined by the LaTeX job during document
8256 preparation: see option -V of isatool usedir, or options -n and -t of
8257 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
8260 Several document versions may be produced at the same time via isatool
8261 usedir (the generated index.html will link all of them). Typical
8262 specifications include ''-V document=theory,proof,ML'' to present
8263 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
8264 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
8265 these parts without any formal replacement text. The Isabelle site
8266 default settings produce ''document'' and ''outline'' versions as
8269 * Several new antiquotations:
8271 @{term_type term} prints a term with its type annotated;
8273 @{typeof term} prints the type of a term;
8275 @{const const} is the same as @{term const}, but checks that the
8276 argument is a known logical constant;
8278 @{term_style style term} and @{thm_style style thm} print a term or
8279 theorem applying a "style" to it
8283 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
8284 definitions, equations, inequations etc., 'concl' printing only the
8285 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
8286 to print the specified premise. TermStyle.add_style provides an ML
8287 interface for introducing further styles. See also the "LaTeX Sugar"
8288 document practical applications. The ML antiquotation prints
8289 type-checked ML expressions verbatim.
8291 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
8292 and 'text' support optional locale specification '(in loc)', which
8293 specifies the default context for interpreting antiquotations. For
8294 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
8296 * Option 'locale=NAME' of antiquotations specifies an alternative
8297 context interpreting the subsequent argument. For example: @{thm
8298 [locale=lattice] inf_assoc}.
8300 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
8303 * Proper output of antiquotations for theory commands involving a
8304 proof context (such as 'locale' or 'theorem (in loc) ...').
8306 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
8307 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
8309 * isatool usedir: new option -C (default true) controls whether option
8310 -D should include a copy of the original document directory; -C false
8311 prevents unwanted effects such as copying of administrative CVS data.
8316 * Considerably improved version of 'constdefs' command. Now performs
8317 automatic type-inference of declared constants; additional support for
8318 local structure declarations (cf. locales and HOL records), see also
8319 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
8320 sequential dependencies of definitions within a single 'constdefs'
8321 section; moreover, the declared name needs to be an identifier. If
8322 all fails, consider to fall back on 'consts' and 'defs' separately.
8324 * Improved indexed syntax and implicit structures. First of all,
8325 indexed syntax provides a notational device for subscripted
8326 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
8327 expressions. Secondly, in a local context with structure
8328 declarations, number indexes \<^sub>n or the empty index (default
8329 number 1) refer to a certain fixed variable implicitly; option
8330 show_structs controls printing of implicit structures. Typical
8331 applications of these concepts involve record types and locales.
8333 * New command 'no_syntax' removes grammar declarations (and
8334 translations) resulting from the given syntax specification, which is
8335 interpreted in the same manner as for the 'syntax' command.
8337 * 'Advanced' translation functions (parse_translation etc.) may depend
8338 on the signature of the theory context being presently used for
8339 parsing/printing, see also isar-ref manual.
8341 * Improved 'oracle' command provides a type-safe interface to turn an
8342 ML expression of type theory -> T -> term into a primitive rule of
8343 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
8344 is already included here); see also FOL/ex/IffExample.thy;
8347 * axclass: name space prefix for class "c" is now "c_class" (was "c"
8348 before); "cI" is no longer bound, use "c.intro" instead.
8349 INCOMPATIBILITY. This change avoids clashes of fact bindings for
8350 axclasses vs. locales.
8352 * Improved internal renaming of symbolic identifiers -- attach primes
8353 instead of base 26 numbers.
8355 * New flag show_question_marks controls printing of leading question
8356 marks in schematic variable names.
8358 * In schematic variable names, *any* symbol following \<^isub> or
8359 \<^isup> is now treated as part of the base name. For example, the
8360 following works without printing of awkward ".0" indexes:
8362 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
8365 * Inner syntax includes (*(*nested*) comments*).
8367 * Pretty printer now supports unbreakable blocks, specified in mixfix
8368 annotations as "(00...)".
8370 * Clear separation of logical types and nonterminals, where the latter
8371 may only occur in 'syntax' specifications or type abbreviations.
8372 Before that distinction was only partially implemented via type class
8373 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
8374 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
8375 exotic syntax specifications may require further adaption
8376 (e.g. Cube/Cube.thy).
8378 * Removed obsolete type class "logic", use the top sort {} instead.
8379 Note that non-logical types should be declared as 'nonterminals'
8380 rather than 'types'. INCOMPATIBILITY for new object-logic
8383 * Attributes 'induct' and 'cases': type or set names may now be
8384 locally fixed variables as well.
8386 * Simplifier: can now control the depth to which conditional rewriting
8387 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
8390 * Simplifier: simplification procedures may now take the current
8391 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
8392 interface), which is very useful for calling the Simplifier
8393 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
8394 is gone -- use prems_of_ss on the simpset instead. Moreover, the
8395 low-level mk_simproc no longer applies Logic.varify internally, to
8396 allow for use in a context of fixed variables.
8398 * thin_tac now works even if the assumption being deleted contains !!
8399 or ==>. More generally, erule now works even if the major premise of
8400 the elimination rule contains !! or ==>.
8402 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
8404 * Reorganized bootstrapping of the Pure theories; CPure is now derived
8405 from Pure, which contains all common declarations already. Both
8406 theories are defined via plain Isabelle/Isar .thy files.
8407 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
8408 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
8409 use isatool fixcpure to adapt your theory and ML sources.
8411 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
8412 selections of theorems in named facts via index ranges.
8414 * 'print_theorems': in theory mode, really print the difference
8415 wrt. the last state (works for interactive theory development only),
8416 in proof mode print all local facts (cf. 'print_facts');
8418 * 'hide': option '(open)' hides only base names.
8420 * More efficient treatment of intermediate checkpoints in interactive
8423 * Code generator is now invoked via code_module (incremental code
8424 generation) and code_library (modular code generation, ML structures
8425 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
8426 must be quoted when used as identifiers.
8428 * New 'value' command for reading, evaluating and printing terms using
8429 the code generator. INCOMPATIBILITY: command keyword 'value' must be
8430 quoted when used as identifier.
8435 * New commands for the interpretation of locale expressions in
8436 theories (1), locales (2) and proof contexts (3). These generate
8437 proof obligations from the expression specification. After the
8438 obligations have been discharged, theorems of the expression are added
8439 to the theory, target locale or proof context. The synopsis of the
8440 commands is a follows:
8442 (1) interpretation expr inst
8443 (2) interpretation target < expr
8444 (3) interpret expr inst
8446 Interpretation in theories and proof contexts require a parameter
8447 instantiation of terms from the current context. This is applied to
8448 specifications and theorems of the interpreted expression.
8449 Interpretation in locales only permits parameter renaming through the
8450 locale expression. Interpretation is smart in that interpretations
8451 that are active already do not occur in proof obligations, neither are
8452 instantiated theorems stored in duplicate. Use 'print_interps' to
8453 inspect active interpretations of a particular locale. For details,
8454 see the Isar Reference manual. Examples can be found in
8455 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
8457 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
8458 'interpret' instead.
8460 * New context element 'constrains' for adding type constraints to
8463 * Context expressions: renaming of parameters with syntax
8466 * Locale declaration: 'includes' disallowed.
8468 * Proper static binding of attribute syntax -- i.e. types / terms /
8469 facts mentioned as arguments are always those of the locale definition
8470 context, independently of the context of later invocations. Moreover,
8471 locale operations (renaming and type / term instantiation) are applied
8472 to attribute arguments as expected.
8474 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
8475 actual attributes; rare situations may require Attrib.attribute to
8476 embed those attributes into Attrib.src that lack concrete syntax.
8477 Attribute implementations need to cooperate properly with the static
8478 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
8479 Attrib.XXX_thm etc. already do the right thing without further
8480 intervention. Only unusual applications -- such as "where" or "of"
8481 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
8482 on the context and the facts involved -- may have to assign parsed
8483 values to argument tokens explicitly.
8485 * Changed parameter management in theorem generation for long goal
8486 statements with 'includes'. INCOMPATIBILITY: produces a different
8487 theorem statement in rare situations.
8489 * Locale inspection command 'print_locale' omits notes elements. Use
8490 'print_locale!' to have them included in the output.
8495 * Provers/hypsubst.ML: improved version of the subst method, for
8496 single-step rewriting: it now works in bound variable contexts. New is
8497 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
8498 rewrite a different subterm than the original subst method, which is
8499 still available as 'simplesubst'.
8501 * Provers/quasi.ML: new transitivity reasoners for transitivity only
8504 * Provers/trancl.ML: new transitivity reasoner for transitive and
8505 reflexive-transitive closure of relations.
8507 * Provers/blast.ML: new reference depth_limit to make blast's depth
8508 limit (previously hard-coded with a value of 20) user-definable.
8510 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
8511 is peformed already. Object-logics merely need to finish their
8512 initial simpset configuration as before. INCOMPATIBILITY.
8517 * Symbolic syntax of Hilbert Choice Operator is now as follows:
8520 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
8522 The symbol \<some> is displayed as the alternative epsilon of LaTeX
8523 and x-symbol; use option '-m epsilon' to get it actually printed.
8524 Moreover, the mathematically important symbolic identifier \<epsilon>
8525 becomes available as variable, constant etc. INCOMPATIBILITY,
8527 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
8528 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
8529 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
8530 support corresponding Isar calculations.
8532 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
8535 * theory SetInterval: changed the syntax for open intervals:
8544 The old syntax is still supported but will disappear in the next
8545 release. For conversion use the following Emacs search and replace
8546 patterns (these are not perfect but work quite well):
8548 {)\([^\.]*\)\.\. -> {\1<\.\.}
8549 \.\.\([^(}]*\)(} -> \.\.<\1}
8551 * Theory Commutative_Ring (in Library): method comm_ring for proving
8552 equalities in commutative rings; method 'algebra' provides a generic
8555 * Theory Finite_Set: changed the syntax for 'setsum', summation over
8556 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
8557 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
8560 Some new syntax forms are available:
8562 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
8563 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
8564 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
8565 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
8567 The latter form "\<Sum>x < k. e" used to be based on a separate
8568 function "Summation", which has been discontinued.
8570 * theory Finite_Set: in structured induction proofs, the insert case
8571 is now 'case (insert x F)' instead of the old counterintuitive 'case
8574 * The 'refute' command has been extended to support a much larger
8575 fragment of HOL, including axiomatic type classes, constdefs and
8576 typedefs, inductive datatypes and recursion.
8578 * New tactics 'sat' and 'satx' to prove propositional tautologies.
8579 Requires zChaff with proof generation to be installed. See
8580 HOL/ex/SAT_Examples.thy for examples.
8582 * Datatype induction via method 'induct' now preserves the name of the
8583 induction variable. For example, when proving P(xs::'a list) by
8584 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
8585 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
8586 in unstructured proof scripts.
8588 * Reworked implementation of records. Improved scalability for
8589 records with many fields, avoiding performance problems for type
8590 inference. Records are no longer composed of nested field types, but
8591 of nested extension types. Therefore the record type only grows linear
8592 in the number of extensions and not in the number of fields. The
8593 top-level (users) view on records is preserved. Potential
8594 INCOMPATIBILITY only in strange cases, where the theory depends on the
8595 old record representation. The type generated for a record is called
8596 <record_name>_ext_type.
8598 Flag record_quick_and_dirty_sensitive can be enabled to skip the
8599 proofs triggered by a record definition or a simproc (if
8600 quick_and_dirty is enabled). Definitions of large records can take
8603 New simproc record_upd_simproc for simplification of multiple record
8604 updates enabled by default. Moreover, trivial updates are also
8605 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
8606 occasionally, since simplification is more powerful by default.
8608 * typedef: proper support for polymorphic sets, which contain extra
8609 type-variables in the term.
8611 * Simplifier: automatically reasons about transitivity chains
8612 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
8613 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
8614 old proofs break occasionally as simplification may now solve more
8615 goals than previously.
8617 * Simplifier: converts x <= y into x = y if assumption y <= x is
8618 present. Works for all partial orders (class "order"), in particular
8619 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
8622 * Simplifier: new simproc for "let x = a in f x". If a is a free or
8623 bound variable or a constant then the let is unfolded. Otherwise
8624 first a is simplified to b, and then f b is simplified to g. If
8625 possible we abstract b from g arriving at "let x = b in h x",
8626 otherwise we unfold the let and arrive at g. The simproc can be
8627 enabled/disabled by the reference use_let_simproc. Potential
8628 INCOMPATIBILITY since simplification is more powerful by default.
8630 * Classical reasoning: the meson method now accepts theorems as arguments.
8632 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
8633 jobs to provide advice on the provability of subgoals.
8635 * Theory OrderedGroup and Ring_and_Field: various additions and
8636 improvements to faciliate calculations involving equalities and
8639 The following theorems have been eliminated or modified
8642 abs_eq now named abs_of_nonneg
8643 abs_of_ge_0 now named abs_of_nonneg
8644 abs_minus_eq now named abs_of_nonpos
8645 imp_abs_id now named abs_of_nonneg
8646 imp_abs_neg_id now named abs_of_nonpos
8647 mult_pos now named mult_pos_pos
8648 mult_pos_le now named mult_nonneg_nonneg
8649 mult_pos_neg_le now named mult_nonneg_nonpos
8650 mult_pos_neg2_le now named mult_nonneg_nonpos2
8651 mult_neg now named mult_neg_neg
8652 mult_neg_le now named mult_nonpos_nonpos
8654 * The following lemmas in Ring_and_Field have been added to the simplifier:
8657 not_square_less_zero
8659 The following lemmas have been deleted from Real/RealPow:
8669 * Theory Parity: added rules for simplifying exponents.
8673 The following theorems have been eliminated or modified
8676 list_all_Nil now named list_all.simps(1)
8677 list_all_Cons now named list_all.simps(2)
8678 list_all_conv now named list_all_iff
8679 set_mem_eq now named mem_iff
8681 * Theories SetsAndFunctions and BigO (see HOL/Library) support
8682 asymptotic "big O" calculations. See the notes in BigO.thy.
8687 * Theory RealDef: better support for embedding natural numbers and
8688 integers in the reals.
8690 The following theorems have been eliminated or modified
8693 exp_ge_add_one_self now requires no hypotheses
8694 real_of_int_add reversed direction of equality (use [symmetric])
8695 real_of_int_minus reversed direction of equality (use [symmetric])
8696 real_of_int_diff reversed direction of equality (use [symmetric])
8697 real_of_int_mult reversed direction of equality (use [symmetric])
8699 * Theory RComplete: expanded support for floor and ceiling functions.
8701 * Theory Ln is new, with properties of the natural logarithm
8703 * Hyperreal: There is a new type constructor "star" for making
8704 nonstandard types. The old type names are now type synonyms:
8708 hcomplex = complex star
8710 * Hyperreal: Many groups of similarly-defined constants have been
8711 replaced by polymorphic versions (INCOMPATIBILITY):
8713 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
8715 starset <-- starsetNat, starsetC
8716 *s* <-- *sNat*, *sc*
8717 starset_n <-- starsetNat_n, starsetC_n
8718 *sn* <-- *sNatn*, *scn*
8719 InternalSets <-- InternalNatSets, InternalCSets
8721 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8722 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
8723 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
8724 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
8725 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
8727 * Hyperreal: Many type-specific theorems have been removed in favor of
8728 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
8730 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
8731 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
8732 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
8733 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
8734 right_minus <-- hypreal_add_minus
8735 left_minus <-- {hypreal,hcomplex}_add_minus_left
8736 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
8737 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
8738 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
8739 mult_1_right <-- hcomplex_mult_one_right
8740 mult_zero_left <-- hcomplex_mult_zero_left
8741 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
8742 right_distrib <-- hypnat_add_mult_distrib2
8743 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
8744 right_inverse <-- hypreal_mult_inverse
8745 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
8746 order_refl <-- {hypreal,hypnat}_le_refl
8747 order_trans <-- {hypreal,hypnat}_le_trans
8748 order_antisym <-- {hypreal,hypnat}_le_anti_sym
8749 order_less_le <-- {hypreal,hypnat}_less_le
8750 linorder_linear <-- {hypreal,hypnat}_le_linear
8751 add_left_mono <-- {hypreal,hypnat}_add_left_mono
8752 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
8753 add_nonneg_nonneg <-- hypreal_le_add_order
8755 * Hyperreal: Separate theorems having to do with type-specific
8756 versions of constants have been merged into theorems that apply to the
8757 new polymorphic constants (INCOMPATIBILITY):
8759 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
8760 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
8761 STAR_Un <-- {STAR,NatStar,STARC}_Un
8762 STAR_Int <-- {STAR,NatStar,STARC}_Int
8763 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
8764 STAR_subset <-- {STAR,NatStar,STARC}_subset
8765 STAR_mem <-- {STAR,NatStar,STARC}_mem
8766 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
8767 STAR_diff <-- {STAR,STARC}_diff
8768 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
8769 STARC_hcomplex_of_complex}_image_subset
8770 starset_n_Un <-- starset{Nat,C}_n_Un
8771 starset_n_Int <-- starset{Nat,C}_n_Int
8772 starset_n_Compl <-- starset{Nat,C}_n_Compl
8773 starset_n_diff <-- starset{Nat,C}_n_diff
8774 InternalSets_Un <-- Internal{Nat,C}Sets_Un
8775 InternalSets_Int <-- Internal{Nat,C}Sets_Int
8776 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
8777 InternalSets_diff <-- Internal{Nat,C}Sets_diff
8778 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
8779 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
8780 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
8781 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
8782 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
8783 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8784 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
8785 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
8786 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
8787 starfun_diff <-- starfun{C,RC,CR}_diff
8788 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
8789 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
8790 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
8791 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
8792 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
8793 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
8794 starfun_Id <-- starfunC_Id
8795 starfun_approx <-- starfun{Nat,CR}_approx
8796 starfun_capprox <-- starfun{C,RC}_capprox
8797 starfun_abs <-- starfunNat_rabs
8798 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
8799 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
8800 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
8801 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
8802 starfun_add_capprox <-- starfun{C,RC}_add_capprox
8803 starfun_add_approx <-- starfunCR_add_approx
8804 starfun_inverse_inverse <-- starfunC_inverse_inverse
8805 starfun_divide <-- starfun{C,CR,RC}_divide
8806 starfun_n <-- starfun{Nat,C}_n
8807 starfun_n_mult <-- starfun{Nat,C}_n_mult
8808 starfun_n_add <-- starfun{Nat,C}_n_add
8809 starfun_n_add_minus <-- starfunNat_n_add_minus
8810 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
8811 starfun_n_minus <-- starfun{Nat,C}_n_minus
8812 starfun_n_eq <-- starfun{Nat,C}_n_eq
8814 star_n_add <-- {hypreal,hypnat,hcomplex}_add
8815 star_n_minus <-- {hypreal,hcomplex}_minus
8816 star_n_diff <-- {hypreal,hcomplex}_diff
8817 star_n_mult <-- {hypreal,hcomplex}_mult
8818 star_n_inverse <-- {hypreal,hcomplex}_inverse
8819 star_n_le <-- {hypreal,hypnat}_le
8820 star_n_less <-- {hypreal,hypnat}_less
8821 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
8822 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
8823 star_n_abs <-- hypreal_hrabs
8824 star_n_divide <-- hcomplex_divide
8826 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
8827 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
8828 star_of_diff <-- hypreal_of_real_diff
8829 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
8830 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
8831 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
8832 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
8833 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
8834 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
8835 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
8836 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
8837 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
8838 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
8839 star_of_number_of <-- {hypreal,hcomplex}_number_of
8840 star_of_number_less <-- number_of_less_hypreal_of_real_iff
8841 star_of_number_le <-- number_of_le_hypreal_of_real_iff
8842 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
8843 star_of_less_number <-- hypreal_of_real_less_number_of_iff
8844 star_of_le_number <-- hypreal_of_real_le_number_of_iff
8845 star_of_power <-- hypreal_of_real_power
8846 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
8848 * Hyperreal: new method "transfer" that implements the transfer
8849 principle of nonstandard analysis. With a subgoal that mentions
8850 nonstandard types like "'a star", the command "apply transfer"
8851 replaces it with an equivalent one that mentions only standard types.
8852 To be successful, all free variables must have standard types; non-
8853 standard variables must have explicit universal quantifiers.
8855 * Hyperreal: A theory of Taylor series.
8860 * Discontinued special version of 'constdefs' (which used to support
8861 continuous functions) in favor of the general Pure one with full
8864 * New simplification procedure for solving continuity conditions; it
8865 is much faster on terms with many nested lambda abstractions (cubic
8866 instead of exponential time).
8868 * New syntax for domain package: selector names are now optional.
8869 Parentheses should be omitted unless argument is lazy, for example:
8871 domain 'a stream = cons "'a" (lazy "'a stream")
8873 * New command 'fixrec' for defining recursive functions with pattern
8874 matching; defining multiple functions with mutual recursion is also
8875 supported. Patterns may include the constants cpair, spair, up, sinl,
8876 sinr, or any data constructor defined by the domain package. The given
8877 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
8878 syntax and examples.
8880 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
8881 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
8882 but the proof obligation additionally includes an admissibility
8883 requirement. The packages generate instances of class cpo or pcpo,
8884 with continuity and strictness theorems for Rep and Abs.
8886 * HOLCF: Many theorems have been renamed according to a more standard naming
8887 scheme (INCOMPATIBILITY):
8889 foo_inject: "foo$x = foo$y ==> x = y"
8890 foo_eq: "(foo$x = foo$y) = (x = y)"
8891 foo_less: "(foo$x << foo$y) = (x << y)"
8892 foo_strict: "foo$UU = UU"
8893 foo_defined: "... ==> foo$x ~= UU"
8894 foo_defined_iff: "(foo$x = UU) = (x = UU)"
8899 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
8900 including the First Isomorphism Theorem (on quotienting by the kernel
8903 * ZF/Simplifier: install second copy of type solver that actually
8904 makes use of TC rules declared to Isar proof contexts (or locales);
8905 the old version is still required for ML proof scripts.
8910 * Converted to Isar theory format; use locales instead of axiomatic
8916 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
8919 * Pure/library.ML no longer defines its own option datatype, but uses
8920 that of the SML basis, which has constructors NONE and SOME instead of
8921 None and Some, as well as exception Option.Option instead of OPTION.
8922 The functions the, if_none, is_some, is_none have been adapted
8923 accordingly, while Option.map replaces apsome.
8925 * Pure/library.ML: the exception LIST has been given up in favour of
8926 the standard exceptions Empty and Subscript, as well as
8927 Library.UnequalLengths. Function like Library.hd and Library.tl are
8928 superceded by the standard hd and tl functions etc.
8930 A number of basic list functions are no longer exported to the ML
8931 toplevel, as they are variants of predefined functions. The following
8932 suggests how one can translate existing code:
8934 rev_append xs ys = List.revAppend (xs, ys)
8935 nth_elem (i, xs) = List.nth (xs, i)
8936 last_elem xs = List.last xs
8937 flat xss = List.concat xss
8938 seq fs = List.app fs
8939 partition P xs = List.partition P xs
8940 mapfilter f xs = List.mapPartial f xs
8942 * Pure/library.ML: several combinators for linear functional
8943 transformations, notably reverse application and composition:
8946 (x, y) |-> f f #-> g
8948 * Pure/library.ML: introduced/changed precedence of infix operators:
8950 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
8952 infix 3 o oo ooo oooo;
8953 infix 4 ~~ upto downto;
8955 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
8958 * Pure/library.ML: natural list combinators fold, fold_rev, and
8959 fold_map support linear functional transformations and nesting. For
8962 fold f [x1, ..., xN] y =
8963 y |> f x1 |> ... |> f xN
8965 (fold o fold) f [xs1, ..., xsN] y =
8966 y |> fold f xs1 |> ... |> fold f xsN
8968 fold f [x1, ..., xN] =
8971 (fold o fold) f [xs1, ..., xsN] =
8972 fold f xs1 #> ... #> fold f xsN
8974 * Pure/library.ML: the following selectors on type 'a option are
8977 the: 'a option -> 'a (*partial*)
8978 these: 'a option -> 'a where 'a = 'b list
8979 the_default: 'a -> 'a option -> 'a
8980 the_list: 'a option -> 'a list
8982 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
8983 basic operations for association lists, following natural argument
8984 order; moreover the explicit equality predicate passed here avoids
8985 potentially expensive polymorphic runtime equality checks.
8986 The old functions may be expressed as follows:
8988 assoc = uncurry (AList.lookup (op =))
8989 assocs = these oo AList.lookup (op =)
8990 overwrite = uncurry (AList.update (op =)) o swap
8992 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
8994 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
8995 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
8997 replacing make_keylist and keyfilter (occassionally used)
9000 make_keylist = AList.make
9001 keyfilter = AList.find (op =)
9003 * eq_fst and eq_snd now take explicit equality parameter, thus
9004 avoiding eqtypes. Naive rewrites:
9006 eq_fst = eq_fst (op =)
9007 eq_snd = eq_snd (op =)
9009 * Removed deprecated apl and apr (rarely used).
9012 apl (n, op) =>>= curry op n
9013 apr (op, m) =>>= fn n => op (n, m)
9015 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
9016 provides a reasonably efficient light-weight implementation of sets as
9019 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
9020 few new operations; existing lookup and update are now curried to
9021 follow natural argument order (for use with fold etc.);
9022 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
9024 * Pure/General: output via the Isabelle channels of
9025 writeln/warning/error etc. is now passed through Output.output, with a
9026 hook for arbitrary transformations depending on the print_mode
9027 (cf. Output.add_mode -- the first active mode that provides a output
9028 function wins). Already formatted output may be embedded into further
9029 text via Output.raw; the result of Pretty.string_of/str_of and derived
9030 functions (string_of_term/cterm/thm etc.) is already marked raw to
9031 accommodate easy composition of diagnostic messages etc. Programmers
9032 rarely need to care about Output.output or Output.raw at all, with
9033 some notable exceptions: Output.output is required when bypassing the
9034 standard channels (writeln etc.), or in token translations to produce
9035 properly formatted results; Output.raw is required when capturing
9036 already output material that will eventually be presented to the user
9037 a second time. For the default print mode, both Output.output and
9038 Output.raw have no effect.
9040 * Pure/General: Output.time_accumulator NAME creates an operator ('a
9041 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
9042 cumulative results are displayed at the end of a batch session.
9044 * Pure/General: File.sysify_path and File.quote_sysify path have been
9045 replaced by File.platform_path and File.shell_path (with appropriate
9046 hooks). This provides a clean interface for unusual systems where the
9047 internal and external process view of file names are different.
9049 * Pure: more efficient orders for basic syntactic entities: added
9050 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
9051 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
9052 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
9053 orders now -- potential INCOMPATIBILITY for code that depends on a
9054 particular order for Symtab.keys, Symtab.dest, etc. (consider using
9055 Library.sort_strings on result).
9057 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
9058 fold_types traverse types/terms from left to right, observing natural
9059 argument order. Supercedes previous foldl_XXX versions, add_frees,
9060 add_vars etc. have been adapted as well: INCOMPATIBILITY.
9062 * Pure: name spaces have been refined, with significant changes of the
9063 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
9064 to extern(_table). The plain name entry path is superceded by a
9065 general 'naming' context, which also includes the 'policy' to produce
9066 a fully qualified name and external accesses of a fully qualified
9067 name; NameSpace.extend is superceded by context dependent
9068 Sign.declare_name. Several theory and proof context operations modify
9069 the naming context. Especially note Theory.restore_naming and
9070 ProofContext.restore_naming to get back to a sane state; note that
9071 Theory.add_path is no longer sufficient to recover from
9072 Theory.absolute_path in particular.
9074 * Pure: new flags short_names (default false) and unique_names
9075 (default true) for controlling output of qualified names. If
9076 short_names is set, names are printed unqualified. If unique_names is
9077 reset, the name prefix is reduced to the minimum required to achieve
9078 the original result when interning again, even if there is an overlap
9079 with earlier declarations.
9081 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
9082 now 'extend', and 'merge' gets an additional Pretty.pp argument
9083 (useful for printing error messages). INCOMPATIBILITY.
9085 * Pure: major reorganization of the theory context. Type Sign.sg and
9086 Theory.theory are now identified, referring to the universal
9087 Context.theory (see Pure/context.ML). Actual signature and theory
9088 content is managed as theory data. The old code and interfaces were
9089 spread over many files and structures; the new arrangement introduces
9090 considerable INCOMPATIBILITY to gain more clarity:
9092 Context -- theory management operations (name, identity, inclusion,
9093 parents, ancestors, merge, etc.), plus generic theory data;
9095 Sign -- logical signature and syntax operations (declaring consts,
9096 types, etc.), plus certify/read for common entities;
9098 Theory -- logical theory operations (stating axioms, definitions,
9099 oracles), plus a copy of logical signature operations (consts,
9100 types, etc.); also a few basic management operations (Theory.copy,
9103 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
9104 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
9105 for convenience -- they merely return the theory.
9107 * Pure: type Type.tsig is superceded by theory in most interfaces.
9109 * Pure: the Isar proof context type is already defined early in Pure
9110 as Context.proof (note that ProofContext.context and Proof.context are
9111 aliases, where the latter is the preferred name). This enables other
9112 Isabelle components to refer to that type even before Isar is present.
9114 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
9115 typeK, constK, axiomK, oracleK), but provide explicit operations for
9116 any of these kinds. For example, Sign.intern typeK is now
9117 Sign.intern_type, Theory.hide_space Sign.typeK is now
9118 Theory.hide_types. Also note that former
9119 Theory.hide_classes/types/consts are now
9120 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
9121 internalize their arguments! INCOMPATIBILITY.
9123 * Pure: get_thm interface (of PureThy and ProofContext) expects
9124 datatype thmref (with constructors Name and NameSelection) instead of
9125 plain string -- INCOMPATIBILITY;
9127 * Pure: cases produced by proof methods specify options, where NONE
9128 means to remove case bindings -- INCOMPATIBILITY in
9131 * Pure: the following operations retrieve axioms or theorems from a
9132 theory node or theory hierarchy, respectively:
9134 Theory.axioms_of: theory -> (string * term) list
9135 Theory.all_axioms_of: theory -> (string * term) list
9136 PureThy.thms_of: theory -> (string * thm) list
9137 PureThy.all_thms_of: theory -> (string * thm) list
9139 * Pure: print_tac now outputs the goal through the trace channel.
9141 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
9142 Reference Toplevel.debug (default false) controls detailed printing
9143 and tracing of low-level exceptions; Toplevel.profiling (default 0)
9144 controls execution profiling -- set to 1 for time and 2 for space
9145 (both increase the runtime).
9147 * Isar session: The initial use of ROOT.ML is now always timed,
9148 i.e. the log will show the actual process times, in contrast to the
9149 elapsed wall-clock time that the outer shell wrapper produces.
9151 * Simplifier: improved handling of bound variables (nameless
9152 representation, avoid allocating new strings). Simprocs that invoke
9153 the Simplifier recursively should use Simplifier.inherit_bounds to
9154 avoid local name clashes. Failure to do so produces warnings
9155 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
9156 for further details.
9158 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
9159 bindings for all theorems stored within a given theory; this may help
9160 in porting non-Isar theories to Isar ones, while keeping ML proof
9161 scripts for the time being.
9163 * ML operator HTML.with_charset specifies the charset begin used for
9164 generated HTML files. For example:
9166 HTML.with_charset "utf-8" use_thy "Hebrew";
9167 HTML.with_charset "utf-8" use_thy "Chinese";
9172 * Allow symlinks to all proper Isabelle executables (Isabelle,
9173 isabelle, isatool etc.).
9175 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
9176 isatool doc, isatool mkdir, display_drafts etc.).
9178 * isatool usedir: option -f allows specification of the ML file to be
9179 used by Isabelle; default is ROOT.ML.
9181 * New isatool version outputs the version identifier of the Isabelle
9182 distribution being used.
9184 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
9185 (containing Boolean satisfiability problems) into Isabelle/HOL
9190 New in Isabelle2004 (April 2004)
9191 --------------------------------
9195 * Provers/order.ML: new efficient reasoner for partial and linear orders.
9196 Replaces linorder.ML.
9198 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
9199 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
9200 (\<a>...\<z>), are now considered normal letters, and can therefore
9201 be used anywhere where an ASCII letter (a...zA...Z) has until
9202 now. COMPATIBILITY: This obviously changes the parsing of some
9203 terms, especially where a symbol has been used as a binder, say
9204 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
9205 as an identifier. Fix it by inserting a space around former
9206 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
9207 existing theory and ML files.
9209 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
9211 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
9212 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
9213 a normal (but invisible) letter. For multiple letter subscripts repeat
9214 \<^isub> like this: x\<^isub>1\<^isub>2.
9216 * Pure: There are now sub-/superscripts that can span more than one
9217 character. Text between \<^bsub> and \<^esub> is set in subscript in
9218 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
9219 superscript. The new control characters are not identifier parts.
9221 * Pure: Control-symbols of the form \<^raw:...> will literally print the
9222 content of "..." to the latex file instead of \isacntrl... . The "..."
9223 may consist of any printable characters excluding the end bracket >.
9225 * Pure: Using new Isar command "finalconsts" (or the ML functions
9226 Theory.add_finals or Theory.add_finals_i) it is now possible to
9227 declare constants "final", which prevents their being given a definition
9228 later. It is useful for constants whose behaviour is fixed axiomatically
9229 rather than definitionally, such as the meta-logic connectives.
9231 * Pure: 'instance' now handles general arities with general sorts
9232 (i.e. intersections of classes),
9234 * Presentation: generated HTML now uses a CSS style sheet to make layout
9235 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
9236 It can be changed to alter the colors/layout of generated pages.
9241 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
9242 cut_tac, subgoal_tac and thin_tac:
9243 - Now understand static (Isar) contexts. As a consequence, users of Isar
9244 locales are no longer forced to write Isar proof scripts.
9245 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
9247 - INCOMPATIBILITY: names of variables to be instantiated may no
9248 longer be enclosed in quotes. Instead, precede variable name with `?'.
9249 This is consistent with the instantiation attribute "where".
9251 * Attributes "where" and "of":
9252 - Now take type variables of instantiated theorem into account when reading
9253 the instantiation string. This fixes a bug that caused instantiated
9254 theorems to have too special types in some circumstances.
9255 - "where" permits explicit instantiations of type variables.
9257 * Calculation commands "moreover" and "also" no longer interfere with
9258 current facts ("this"), admitting arbitrary combinations with "then"
9262 - Goal statements involving the context element "includes" no longer
9263 generate theorems with internal delta predicates (those ending on
9264 "_axioms") in the premise.
9265 Resolve particular premise with <locale>.intro to obtain old form.
9266 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
9267 specification and "includes" elements in goal statement.
9268 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
9269 [intro?] and [elim?] (respectively) by default.
9270 - Experimental command for instantiation of locales in proof contexts:
9271 instantiate <label>[<attrs>]: <loc>
9272 Instantiates locale <loc> and adds all its theorems to the current context
9273 taking into account their attributes. Label and attrs are optional
9274 modifiers, like in theorem declarations. If present, names of
9275 instantiated theorems are qualified with <label>, and the attributes
9276 <attrs> are applied after any attributes these theorems might have already.
9277 If the locale has assumptions, a chained fact of the form
9278 "<loc> t1 ... tn" is expected from which instantiations of the parameters
9279 are derived. The command does not support old-style locales declared
9280 with "locale (open)".
9281 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
9283 * HOL: Tactic emulation methods induct_tac and case_tac understand static
9289 * Proof import: new image HOL4 contains the imported library from
9290 the HOL4 system with about 2500 theorems. It is imported by
9291 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
9292 can be used like any other Isabelle image. See
9293 HOL/Import/HOL/README for more information.
9296 - Much improved handling of linear and partial orders.
9297 Reasoners for linear and partial orders are set up for type classes
9298 "linorder" and "order" respectively, and are added to the default simpset
9299 as solvers. This means that the simplifier can build transitivity chains
9300 to solve goals from the assumptions.
9301 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
9302 of blast or auto after simplification become unnecessary because the goal
9303 is solved by simplification already.
9305 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
9306 all proved in axiomatic type classes for semirings, rings and fields.
9309 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
9310 now formalized using the Ring_and_Field theory mentioned above.
9311 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
9312 than before, because now they are set up once in a generic manner.
9313 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
9314 Look for the general versions in Ring_and_Field (and Power if they concern
9317 * Type "rat" of the rational numbers is now available in HOL-Complex.
9320 - Record types are now by default printed with their type abbreviation
9321 instead of the list of all field types. This can be configured via
9322 the reference "print_record_type_abbr".
9323 - Simproc "record_upd_simproc" for simplification of multiple updates added
9324 (not enabled by default).
9325 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
9326 EX x. x = sel r to True (not enabled by default).
9327 - Tactic "record_split_simp_tac" to split and simplify records added.
9329 * 'specification' command added, allowing for definition by
9330 specification. There is also an 'ax_specification' command that
9331 introduces the new constants axiomatically.
9333 * arith(_tac) is now able to generate counterexamples for reals as well.
9335 * HOL-Algebra: new locale "ring" for non-commutative rings.
9337 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
9338 definitions, thanks to Sava Krsti\'{c} and John Matthews.
9340 * HOL-Matrix: a first theory for matrices in HOL with an application of
9341 matrix theory to linear programming.
9343 * Unions and Intersections:
9344 The latex output syntax of UN and INT has been changed
9345 from "\Union x \in A. B" to "\Union_{x \in A} B"
9346 i.e. the index formulae has become a subscript.
9347 Similarly for "\Union x. B", and for \Inter instead of \Union.
9349 * Unions and Intersections over Intervals:
9350 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
9351 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
9352 like in normal math, and corresponding versions for < and for intersection.
9354 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
9355 lexicographic dictonary ordering has been added as "lexord".
9357 * ML: the legacy theory structures Int and List have been removed. They had
9358 conflicted with ML Basis Library structures having the same names.
9360 * 'refute' command added to search for (finite) countermodels. Only works
9361 for a fragment of HOL. The installation of an external SAT solver is
9362 highly recommended. See "HOL/Refute.thy" for details.
9364 * 'quickcheck' command: Allows to find counterexamples by evaluating
9365 formulae under an assignment of free variables to random values.
9366 In contrast to 'refute', it can deal with inductive datatypes,
9367 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
9373 * Streams now come with concatenation and are part of the HOLCF image
9377 New in Isabelle2003 (May 2003)
9378 ------------------------------
9382 * Provers/simplifier:
9384 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
9385 Assumptions are now subject to complete mutual simplification,
9386 not just from left to right. The simplifier now preserves
9387 the order of assumptions.
9389 Potential INCOMPATIBILITY:
9391 -- simp sometimes diverges where the old version did
9392 not, e.g. invoking simp on the goal
9394 [| P (f x); y = x; f x = f y |] ==> Q
9396 now gives rise to the infinite reduction sequence
9398 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
9400 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
9403 -- Tactics combining classical reasoner and simplification (such as auto)
9404 are also affected by this change, because many of them rely on
9405 simp. They may sometimes diverge as well or yield a different numbers
9406 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
9407 in case of problems. Sometimes subsequent calls to the classical
9408 reasoner will fail because a preceeding call to the simplifier too
9409 eagerly simplified the goal, e.g. deleted redundant premises.
9411 - The simplifier trace now shows the names of the applied rewrite rules
9413 - You can limit the number of recursive invocations of the simplifier
9414 during conditional rewriting (where the simplifie tries to solve the
9415 conditions before applying the rewrite rule):
9416 ML "simp_depth_limit := n"
9417 where n is an integer. Thus you can force termination where previously
9418 the simplifier would diverge.
9420 - Accepts free variables as head terms in congruence rules. Useful in Isar.
9422 - No longer aborts on failed congruence proof. Instead, the
9423 congruence is ignored.
9425 * Pure: New generic framework for extracting programs from constructive
9426 proofs. See HOL/Extraction.thy for an example instantiation, as well
9427 as HOL/Extraction for some case studies.
9429 * Pure: The main goal of the proof state is no longer shown by default, only
9430 the subgoals. This behaviour is controlled by a new flag.
9431 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
9432 (ML: Proof.show_main_goal).
9434 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
9435 rules whose conclusion matches subgoal 1:
9436 PG menu: Isabelle/Isar -> Show me -> matching rules
9437 The rules are ordered by how closely they match the subgoal.
9438 In particular, rules that solve a subgoal outright are displayed first
9439 (or rather last, the way they are printed).
9440 (ML: ProofGeneral.print_intros())
9442 * Pure: New flag trace_unify_fail causes unification to print
9443 diagnostic information (PG: in trace buffer) when it fails. This is
9444 useful for figuring out why single step proofs like rule, erule or
9447 * Pure: Locale specifications now produce predicate definitions
9448 according to the body of text (covering assumptions modulo local
9449 definitions); predicate "loc_axioms" covers newly introduced text,
9450 while "loc" is cumulative wrt. all included locale expressions; the
9451 latter view is presented only on export into the global theory
9452 context; potential INCOMPATIBILITY, use "(open)" option to fall back
9453 on the old view without predicates;
9455 * Pure: predefined locales "var" and "struct" are useful for sharing
9456 parameters (as in CASL, for example); just specify something like
9457 ``var x + var y + struct M'' as import;
9459 * Pure: improved thms_containing: proper indexing of facts instead of
9460 raw theorems; check validity of results wrt. current name space;
9461 include local facts of proof configuration (also covers active
9462 locales), cover fixed variables in index; may use "_" in term
9463 specification; an optional limit for the number of printed facts may
9464 be given (the default is 40);
9466 * Pure: disallow duplicate fact bindings within new-style theory files
9469 * Provers: improved induct method: assumptions introduced by case
9470 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
9471 the goal statement); "foo" still refers to all facts collectively;
9473 * Provers: the function blast.overloaded has been removed: all constants
9474 are regarded as potentially overloaded, which improves robustness in exchange
9475 for slight decrease in efficiency;
9477 * Provers/linorder: New generic prover for transitivity reasoning over
9478 linear orders. Note: this prover is not efficient!
9480 * Isar: preview of problems to finish 'show' now produce an error
9481 rather than just a warning (in interactive mode);
9488 - Produces a counter example if it cannot prove a goal.
9489 Note that the counter example may be spurious if the goal is not a formula
9490 of quantifier-free linear arithmetic.
9491 In ProofGeneral the counter example appears in the trace buffer.
9493 - Knows about div k and mod k where k is a numeral of type nat or int.
9495 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
9496 linear arithmetic fails. This takes account of quantifiers and divisibility.
9497 Presburger arithmetic can also be called explicitly via presburger(_tac).
9499 * simp's arithmetic capabilities have been enhanced a bit: it now
9500 takes ~= in premises into account (by performing a case split);
9502 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
9503 are distributed over a sum of terms;
9505 * New tactic "trans_tac" and method "trans" instantiate
9506 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
9509 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
9510 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
9512 * 'typedef' command has new option "open" to suppress the set
9515 * functions Min and Max on finite sets have been introduced (theory
9518 * attribute [symmetric] now works for relations as well; it turns
9519 (x,y) : R^-1 into (y,x) : R, and vice versa;
9521 * induct over a !!-quantified statement (say !!x1..xn):
9522 each "case" automatically performs "fix x1 .. xn" with exactly those names.
9524 * Map: `empty' is no longer a constant but a syntactic abbreviation for
9525 %x. None. Warning: empty_def now refers to the previously hidden definition
9528 * Algebra: formalization of classical algebra. Intended as base for
9529 any algebraic development in Isabelle. Currently covers group theory
9530 (up to Sylow's theorem) and ring theory (Universal Property of
9531 Univariate Polynomials). Contributions welcome;
9533 * GroupTheory: deleted, since its material has been moved to Algebra;
9535 * Complex: new directory of the complex numbers with numeric constants,
9536 nonstandard complex numbers, and some complex analysis, standard and
9537 nonstandard (Jacques Fleuriot);
9539 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
9541 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
9544 * Real/HahnBanach: updated and adapted to locales;
9546 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
9549 * UNITY: added the Meier-Sanders theory of progress sets;
9551 * MicroJava: bytecode verifier and lightweight bytecode verifier
9552 as abstract algorithms, instantiated to the JVM;
9554 * Bali: Java source language formalization. Type system, operational
9555 semantics, axiomatic semantics. Supported language features:
9556 classes, interfaces, objects,virtual methods, static methods,
9557 static/instance fields, arrays, access modifiers, definite
9558 assignment, exceptions.
9563 * ZF/Constructible: consistency proof for AC (Gdel's constructible
9566 * Main ZF: virtually all theories converted to new-style format;
9571 * Pure: Tactic.prove provides sane interface for internal proofs;
9572 omits the infamous "standard" operation, so this is more appropriate
9573 than prove_goalw_cterm in many situations (e.g. in simprocs);
9575 * Pure: improved error reporting of simprocs;
9577 * Provers: Simplifier.simproc(_i) provides sane interface for setting
9581 *** Document preparation ***
9583 * uses \par instead of \\ for line breaks in theory text. This may
9584 shift some page breaks in large documents. To get the old behaviour
9585 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
9587 * minimized dependencies of isabelle.sty and isabellesym.sty on
9590 * \<euro> now needs package babel/greek instead of marvosym (which
9593 * normal size for \<zero>...\<nine> (uses \mathbf instead of
9598 New in Isabelle2002 (March 2002)
9599 --------------------------------
9601 *** Document preparation ***
9603 * greatly simplified document preparation setup, including more
9604 graceful interpretation of isatool usedir -i/-d/-D options, and more
9605 instructive isatool mkdir; users should basically be able to get
9606 started with "isatool mkdir HOL Test && isatool make"; alternatively,
9607 users may run a separate document processing stage manually like this:
9608 "isatool usedir -D output HOL Test && isatool document Test/output";
9610 * theory dependency graph may now be incorporated into documents;
9611 isatool usedir -g true will produce session_graph.eps/.pdf for use
9612 with \includegraphics of LaTeX;
9614 * proper spacing of consecutive markup elements, especially text
9615 blocks after section headings;
9617 * support bold style (for single symbols only), input syntax is like
9618 this: "\<^bold>\<alpha>" or "\<^bold>A";
9620 * \<bullet> is now output as bold \cdot by default, which looks much
9621 better in printed text;
9623 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
9624 note that these symbols are currently unavailable in Proof General /
9625 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
9627 * isatool latex no longer depends on changed TEXINPUTS, instead
9628 isatool document copies the Isabelle style files to the target
9634 * Pure/Provers: improved proof by cases and induction;
9635 - 'case' command admits impromptu naming of parameters (such as
9637 - 'induct' method divinates rule instantiation from the inductive
9638 claim; no longer requires excessive ?P bindings for proper
9639 instantiation of cases;
9640 - 'induct' method properly enumerates all possibilities of set/type
9641 rules; as a consequence facts may be also passed through *type*
9642 rules without further ado;
9643 - 'induct' method now derives symbolic cases from the *rulified*
9644 rule (before it used to rulify cases stemming from the internal
9645 atomized version); this means that the context of a non-atomic
9646 statement becomes is included in the hypothesis, avoiding the
9647 slightly cumbersome show "PROP ?case" form;
9648 - 'induct' may now use elim-style induction rules without chaining
9649 facts, using ``missing'' premises from the goal state; this allows
9650 rules stemming from inductive sets to be applied in unstructured
9651 scripts, while still benefitting from proper handling of non-atomic
9652 statements; NB: major inductive premises need to be put first, all
9653 the rest of the goal is passed through the induction;
9654 - 'induct' proper support for mutual induction involving non-atomic
9655 rule statements (uses the new concept of simultaneous goals, see
9657 - append all possible rule selections, but only use the first
9658 success (no backtracking);
9659 - removed obsolete "(simplified)" and "(stripped)" options of methods;
9660 - undeclared rule case names default to numbers 1, 2, 3, ...;
9661 - added 'print_induct_rules' (covered by help item in recent Proof
9663 - moved induct/cases attributes to Pure, methods to Provers;
9664 - generic method setup instantiated for FOL and HOL;
9666 * Pure: support multiple simultaneous goal statements, for example
9667 "have a: A and b: B" (same for 'theorem' etc.); being a pure
9668 meta-level mechanism, this acts as if several individual goals had
9669 been stated separately; in particular common proof methods need to be
9670 repeated in order to cover all claims; note that a single elimination
9671 step is *not* sufficient to establish the two conjunctions, so this
9674 assume "A & B" then have A and B .. (*".." fails*)
9676 better use "obtain" in situations as above; alternative refer to
9677 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
9679 * Pure: proper integration with ``locales''; unlike the original
9680 version by Florian Kammller, Isar locales package high-level proof
9681 contexts rather than raw logical ones (e.g. we admit to include
9682 attributes everywhere); operations on locales include merge and
9683 rename; support for implicit arguments (``structures''); simultaneous
9684 type-inference over imports and text; see also HOL/ex/Locales.thy for
9687 * Pure: the following commands have been ``localized'', supporting a
9688 target locale specification "(in name)": 'lemma', 'theorem',
9689 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
9690 stored both within the locale and at the theory level (exported and
9691 qualified by the locale name);
9693 * Pure: theory goals may now be specified in ``long'' form, with
9694 ad-hoc contexts consisting of arbitrary locale elements. for example
9695 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
9696 definitions may be given, too); the result is a meta-level rule with
9697 the context elements being discharged in the obvious way;
9699 * Pure: new proof command 'using' allows to augment currently used
9700 facts after a goal statement ('using' is syntactically analogous to
9701 'apply', but acts on the goal's facts only); this allows chained facts
9702 to be separated into parts given before and after a claim, as in
9703 ``from a and b have C using d and e <proof>'';
9705 * Pure: renamed "antecedent" case to "rule_context";
9707 * Pure: new 'judgment' command records explicit information about the
9708 object-logic embedding (used by several tools internally); no longer
9709 use hard-wired "Trueprop";
9711 * Pure: added 'corollary' command;
9713 * Pure: fixed 'token_translation' command;
9715 * Pure: removed obsolete 'exported' attribute;
9717 * Pure: dummy pattern "_" in is/let is now automatically lifted over
9718 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
9719 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
9721 * Pure: method 'atomize' presents local goal premises as object-level
9722 statements (atomic meta-level propositions); setup controlled via
9723 rewrite rules declarations of 'atomize' attribute; example
9724 application: 'induct' method with proper rule statements in improper
9727 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
9728 now consider the syntactic context of assumptions, giving a better
9729 chance to get type-inference of the arguments right (this is
9730 especially important for locales);
9732 * Pure: "sorry" no longer requires quick_and_dirty in interactive
9735 * Pure/obtain: the formal conclusion "thesis", being marked as
9736 ``internal'', may no longer be reference directly in the text;
9737 potential INCOMPATIBILITY, may need to use "?thesis" in rare
9740 * Pure: generic 'sym' attribute which declares a rule both as pure
9741 'elim?' and for the 'symmetric' operation;
9743 * Pure: marginal comments ``--'' may now occur just anywhere in the
9744 text; the fixed correlation with particular command syntax has been
9747 * Pure: new method 'rules' is particularly well-suited for proof
9748 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
9749 but often produces more compact proof terms with less detours;
9751 * Pure/Provers/classical: simplified integration with pure rule
9752 attributes and methods; the classical "intro?/elim?/dest?"
9753 declarations coincide with the pure ones; the "rule" method no longer
9754 includes classically swapped intros; "intro" and "elim" methods no
9755 longer pick rules from the context; also got rid of ML declarations
9756 AddXIs/AddXEs/AddXDs; all of this has some potential for
9759 * Provers/classical: attribute 'swapped' produces classical inversions
9760 of introduction rules;
9762 * Provers/simplifier: 'simplified' attribute may refer to explicit
9763 rules instead of full simplifier context; 'iff' attribute handles
9766 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
9768 * HOL: 'recdef' now fails on unfinished automated proofs, use
9769 "(permissive)" option to recover old behavior;
9771 * HOL: 'inductive' no longer features separate (collective) attributes
9772 for 'intros' (was found too confusing);
9774 * HOL: properly declared induction rules less_induct and
9780 * HOL: moved over to sane numeral syntax; the new policy is as
9783 - 0 and 1 are polymorphic constants, which are defined on any
9784 numeric type (nat, int, real etc.);
9786 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
9787 binary representation internally;
9789 - type nat has special constructor Suc, and generally prefers Suc 0
9790 over 1::nat and Suc (Suc 0) over 2::nat;
9792 This change may cause significant problems of INCOMPATIBILITY; here
9793 are some hints on converting existing sources:
9795 - due to the new "num" token, "-0" and "-1" etc. are now atomic
9796 entities, so expressions involving "-" (unary or binary minus) need
9797 to be spaced properly;
9799 - existing occurrences of "1" may need to be constraint "1::nat" or
9800 even replaced by Suc 0; similar for old "2";
9802 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
9804 - remove all special provisions on numerals in proofs;
9806 * HOL: simp rules nat_number expand numerals on nat to Suc/0
9807 representation (depends on bin_arith_simps in the default context);
9809 * HOL: symbolic syntax for x^2 (numeral 2);
9811 * HOL: the class of all HOL types is now called "type" rather than
9812 "term"; INCOMPATIBILITY, need to adapt references to this type class
9813 in axclass/classes, instance/arities, and (usually rare) occurrences
9814 in typings (of consts etc.); internally the class is called
9815 "HOL.type", ML programs should refer to HOLogic.typeS;
9817 * HOL/record package improvements:
9818 - new derived operations "fields" to build a partial record section,
9819 "extend" to promote a fixed record to a record scheme, and
9820 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
9821 declared as simp by default;
9822 - shared operations ("more", "fields", etc.) now need to be always
9823 qualified) --- potential INCOMPATIBILITY;
9824 - removed "make_scheme" operations (use "make" with "extend") --
9826 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
9827 - provides cases/induct rules for use with corresponding Isar
9828 methods (for concrete records, record schemes, concrete more
9829 parts, and schematic more parts -- in that order);
9830 - internal definitions directly based on a light-weight abstract
9831 theory of product types over typedef rather than datatype;
9833 * HOL: generic code generator for generating executable ML code from
9834 specifications; specific support for HOL constructs such as inductive
9835 datatypes and sets, as well as recursive functions; can be invoked
9836 via 'generate_code' theory section;
9838 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
9840 * HOL: consolidated and renamed several theories. In particular:
9841 Ord.thy has been absorbed into HOL.thy
9842 String.thy has been absorbed into List.thy
9844 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
9845 (beware of argument permutation!);
9847 * HOL: linorder_less_split superseded by linorder_cases;
9849 * HOL/List: "nodups" renamed to "distinct";
9851 * HOL: added "The" definite description operator; move Hilbert's "Eps"
9852 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
9853 - Ex_def has changed, now need to use some_eq_ex
9855 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
9856 in this (rare) case use:
9858 delSWrapper "split_all_tac"
9859 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
9861 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
9864 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
9865 Isabelle's type classes, ^ on functions and relations has too general
9866 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
9867 necessary to attach explicit type constraints;
9869 * HOL/Relation: the prefix name of the infix "O" has been changed from
9870 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
9871 renamed accordingly (eg "compI" -> "rel_compI").
9873 * HOL: syntax translations now work properly with numerals and records
9876 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
9877 of "lam" -- INCOMPATIBILITY;
9879 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
9880 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
9881 renamed "Product_Type.unit";
9883 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
9885 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
9886 the "cases" method);
9888 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
9891 * HOL/IMP: updated and converted to new-style theory format; several
9892 parts turned into readable document, with proper Isar proof texts and
9893 some explanations (by Gerwin Klein);
9895 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
9897 * HOL-Hyperreal is now a logic image;
9902 * Isar: consts/constdefs supports mixfix syntax for continuous
9905 * Isar: domain package adapted to new-style theory format, e.g. see
9908 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
9909 potential INCOMPATIBILITY; now use plain induct_tac instead of former
9910 lift.induct_tac, always use UU instead of Undef;
9912 * HOLCF/IMP: updated and converted to new-style theory;
9917 * Isar: proper integration of logic-specific tools and packages,
9918 including theory commands '(co)inductive', '(co)datatype',
9919 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
9920 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
9922 * theory Main no longer includes AC; for the Axiom of Choice, base
9923 your theory on Main_ZFC;
9925 * the integer library now covers quotients and remainders, with many
9926 laws relating division to addition, multiplication, etc.;
9928 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
9929 typeless version of the formalism;
9931 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
9934 * ZF/Induct: new directory for examples of inductive definitions,
9935 including theory Multiset for multiset orderings; converted to
9936 new-style theory format;
9938 * ZF: many new theorems about lists, ordinals, etc.;
9943 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
9944 variable proof controls level of detail: 0 = no proofs (only oracle
9945 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
9946 also ref manual for further ML interfaces;
9948 * Pure/axclass: removed obsolete ML interface
9949 goal_subclass/goal_arity;
9951 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
9952 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
9953 separate tokens, so expressions involving minus need to be spaced
9956 * Pure/syntax: support non-oriented infixes, using keyword "infix"
9957 rather than "infixl" or "infixr";
9959 * Pure/syntax: concrete syntax for dummy type variables admits genuine
9960 sort constraint specifications in type inference; e.g. "x::_::foo"
9961 ensures that the type of "x" is of sort "foo" (but not necessarily a
9964 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
9965 control output of nested => (types); the default behavior is
9968 * Pure/syntax: builtin parse translation for "_constify" turns valued
9969 tokens into AST constants;
9971 * Pure/syntax: prefer later declarations of translations and print
9972 translation functions; potential INCOMPATIBILITY: need to reverse
9973 multiple declarations for same syntax element constant;
9975 * Pure/show_hyps reset by default (in accordance to existing Isar
9978 * Provers/classical: renamed addaltern to addafter, addSaltern to
9981 * Provers/clasimp: ``iff'' declarations now handle conditional rules
9984 * system: tested support for MacOS X; should be able to get Isabelle +
9985 Proof General to work in a plain Terminal after installing Poly/ML
9986 (e.g. from the Isabelle distribution area) and GNU bash alone
9987 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
9988 support requires further installations, e.g. from
9989 http://fink.sourceforge.net/);
9991 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
9993 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
9994 of 40 MB), cf. ML_OPTIONS;
9996 * system: Proof General keywords specification is now part of the
9997 Isabelle distribution (see etc/isar-keywords.el);
9999 * system: support for persistent Proof General sessions (refrain from
10000 outdating all loaded theories on startup); user may create writable
10001 logic images like this: ``isabelle -q HOL Test'';
10003 * system: smart selection of Isabelle process versus Isabelle
10004 interface, accommodates case-insensitive file systems (e.g. HFS+); may
10005 run both "isabelle" and "Isabelle" even if file names are badly
10006 damaged (executable inspects the case of the first letter of its own
10007 name); added separate "isabelle-process" and "isabelle-interface";
10009 * system: refrain from any attempt at filtering input streams; no
10010 longer support ``8bit'' encoding of old isabelle font, instead proper
10011 iso-latin characters may now be used; the related isatools
10012 "symbolinput" and "nonascii" have disappeared as well;
10014 * system: removed old "xterm" interface (the print modes "xterm" and
10015 "xterm_color" are still available for direct use in a suitable
10020 New in Isabelle99-2 (February 2001)
10021 -----------------------------------
10023 *** Overview of INCOMPATIBILITIES ***
10025 * HOL: please note that theories in the Library and elsewhere often use the
10026 new-style (Isar) format; to refer to their theorems in an ML script you must
10027 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
10029 * HOL: inductive package no longer splits induction rule aggressively,
10030 but only as far as specified by the introductions given; the old
10031 format may be recovered via ML function complete_split_rule or attribute
10032 'split_rule (complete)';
10034 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
10035 gfp_Tarski to gfp_unfold;
10037 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
10039 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
10040 relation); infix "^^" has been renamed "``"; infix "``" has been
10041 renamed "`"; "univalent" has been renamed "single_valued";
10043 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
10046 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
10048 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
10050 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
10051 consequence, it is no longer monotonic wrt. the local goal context
10052 (which is now passed through the inductive cases);
10054 * Document preparation: renamed standard symbols \<ll> to \<lless> and
10055 \<gg> to \<ggreater>;
10058 *** Document preparation ***
10060 * \isabellestyle{NAME} selects version of Isabelle output (currently
10061 available: are "it" for near math-mode best-style output, "sl" for
10062 slanted text style, and "tt" for plain type-writer; if no
10063 \isabellestyle command is given, output is according to slanted
10066 * support sub/super scripts (for single symbols only), input syntax is
10067 like this: "A\<^sup>*" or "A\<^sup>\<star>";
10069 * some more standard symbols; see Appendix A of the system manual for
10070 the complete list of symbols defined in isabellesym.sty;
10072 * improved isabelle style files; more abstract symbol implementation
10073 (should now use \isamath{...} and \isatext{...} in custom symbol
10076 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
10077 state; Note that presentation of goal states does not conform to
10078 actual human-readable proof documents. Please do not include goal
10079 states into document output unless you really know what you are doing!
10081 * proper indentation of antiquoted output with proportional LaTeX
10084 * no_document ML operator temporarily disables LaTeX document
10087 * isatool unsymbolize tunes sources for plain ASCII communication;
10092 * Pure: Isar now suffers initial goal statements to contain unbound
10093 schematic variables (this does not conform to actual readable proof
10094 documents, due to unpredictable outcome and non-compositional proof
10095 checking); users who know what they are doing may use schematic goals
10096 for Prolog-style synthesis of proven results;
10098 * Pure: assumption method (an implicit finishing) now handles actual
10101 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
10102 initial goal, declare "that" only as Pure intro (only for single
10103 steps); the "that" rule assumption may now be involved in implicit
10104 finishing, thus ".." becomes a feasible for trivial obtains;
10106 * Pure: default proof step now includes 'intro_classes'; thus trivial
10107 instance proofs may be performed by "..";
10109 * Pure: ?thesis / ?this / "..." now work for pure meta-level
10110 statements as well;
10112 * Pure: more robust selection of calculational rules;
10114 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
10115 rule (as well as the assumption rule);
10117 * Pure: 'thm_deps' command visualizes dependencies of theorems and
10118 lemmas, using the graph browser tool;
10120 * Pure: predict failure of "show" in interactive mode;
10122 * Pure: 'thms_containing' now takes actual terms as arguments;
10124 * HOL: improved method 'induct' --- now handles non-atomic goals
10125 (potential INCOMPATIBILITY); tuned error handling;
10127 * HOL: cases and induct rules now provide explicit hints about the
10128 number of facts to be consumed (0 for "type" and 1 for "set" rules);
10129 any remaining facts are inserted into the goal verbatim;
10131 * HOL: local contexts (aka cases) may now contain term bindings as
10132 well; the 'cases' and 'induct' methods new provide a ?case binding for
10133 the result to be shown in each case;
10135 * HOL: added 'recdef_tc' command;
10137 * isatool convert assists in eliminating legacy ML scripts;
10142 * HOL/Library: a collection of generic theories to be used together
10143 with main HOL; the theory loader path already includes this directory
10144 by default; the following existing theories have been moved here:
10145 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
10146 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
10148 * HOL/Unix: "Some aspects of Unix file-system security", a typical
10149 modelling and verification task performed in Isabelle/HOL +
10150 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
10152 * HOL/Algebra: special summation operator SUM no longer exists, it has
10153 been replaced by setsum; infix 'assoc' now has priority 50 (like
10154 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
10155 'domain', this makes the theory consistent with mathematical
10158 * HOL basics: added overloaded operations "inverse" and "divide"
10159 (infix "/"), syntax for generic "abs" operation, generic summation
10162 * HOL/typedef: simplified package, provide more useful rules (see also
10165 * HOL/datatype: induction rule for arbitrarily branching datatypes is
10166 now expressed as a proper nested rule (old-style tactic scripts may
10167 require atomize_strip_tac to cope with non-atomic premises);
10169 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
10170 to "split_conv" (old name still available for compatibility);
10172 * HOL: improved concrete syntax for strings (e.g. allows translation
10173 rules with string literals);
10175 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
10176 and Fleuriot's mechanization of analysis, including the transcendental
10177 functions for the reals;
10179 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
10184 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
10185 "lam" is displayed as TWO lambda-symbols
10187 * CTT: theory Main now available, containing everything (that is, Bool
10193 * Pure: the Simplifier has been implemented properly as a derived rule
10194 outside of the actual kernel (at last!); the overall performance
10195 penalty in practical applications is about 50%, while reliability of
10196 the Isabelle inference kernel has been greatly improved;
10198 * print modes "brackets" and "no_brackets" control output of nested =>
10199 (types) and ==> (props); the default behaviour is "brackets";
10201 * Provers: fast_tac (and friends) now handle actual object-logic rules
10202 as assumptions as well;
10204 * system: support Poly/ML 4.0;
10206 * system: isatool install handles KDE version 1 or 2;
10210 New in Isabelle99-1 (October 2000)
10211 ----------------------------------
10213 *** Overview of INCOMPATIBILITIES ***
10215 * HOL: simplification of natural numbers is much changed; to partly
10216 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
10217 issue the following ML commands:
10219 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
10220 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
10222 * HOL: simplification no longer dives into case-expressions; this is
10223 controlled by "t.weak_case_cong" for each datatype t;
10225 * HOL: nat_less_induct renamed to less_induct;
10227 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
10228 fixsome to patch .thy and .ML sources automatically;
10230 select_equality -> some_equality
10231 select_eq_Ex -> some_eq_ex
10232 selectI2EX -> someI2_ex
10235 select1_equality -> some1_equality
10236 Eps_sym_eq -> some_sym_eq_trivial
10237 Eps_eq -> some_eq_trivial
10239 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
10241 * HOL: removed obsolete theorem binding expand_if (refer to split_if
10244 * HOL: the recursion equations generated by 'recdef' are now called
10245 f.simps instead of f.rules;
10247 * HOL: qed_spec_mp now also handles bounded ALL as well;
10249 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
10250 sometimes be needed;
10252 * HOL: the constant for "f``x" is now "image" rather than "op ``";
10254 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
10256 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
10257 product is now "<*>" instead of "Times"; the lexicographic product is
10258 now "<*lex*>" instead of "**";
10260 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
10261 of main HOL, but was unused); better use HOL's datatype package;
10263 * HOL: removed "symbols" syntax for constant "override" of theory Map;
10264 the old syntax may be recovered as follows:
10267 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
10268 (infixl "\\<oplus>" 100)
10270 * HOL/Real: "rabs" replaced by overloaded "abs" function;
10272 * HOL/ML: even fewer consts are declared as global (see theories Ord,
10273 Lfp, Gfp, WF); this only affects ML packages that refer to const names
10276 * HOL and ZF: syntax for quotienting wrt an equivalence relation
10277 changed from A/r to A//r;
10279 * ZF: new treatment of arithmetic (nat & int) may break some old
10282 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
10283 rulify -> rule_format, elimify -> elim_format, ...);
10285 * Isar/Provers: intro/elim/dest attributes changed; renamed
10286 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
10287 should have to change intro!! to intro? only); replaced "delrule" by
10290 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
10292 * Provers: strengthened force_tac by using new first_best_tac;
10294 * LaTeX document preparation: several changes of isabelle.sty (see
10298 *** Document preparation ***
10300 * formal comments (text blocks etc.) in new-style theories may now
10301 contain antiquotations of thm/prop/term/typ/text to be presented
10302 according to latex print mode; concrete syntax is like this:
10303 @{term[show_types] "f(x) = a + x"};
10305 * isatool mkdir provides easy setup of Isabelle session directories,
10306 including proper document sources;
10308 * generated LaTeX sources are now deleted after successful run
10309 (isatool document -c); may retain a copy somewhere else via -D option
10312 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
10313 style files, achieving self-contained LaTeX sources and simplifying
10316 * old-style theories now produce (crude) LaTeX output as well;
10318 * browser info session directories are now self-contained (may be put
10319 on WWW server seperately); improved graphs of nested sessions; removed
10320 graph for 'all sessions';
10322 * several improvements in isabelle style files; \isabellestyle{it}
10323 produces fake math mode output; \isamarkupheader is now \section by
10324 default; see lib/texinputs/isabelle.sty etc.;
10329 * Isar/Pure: local results and corresponding term bindings are now
10330 subject to Hindley-Milner polymorphism (similar to ML); this
10331 accommodates incremental type-inference very nicely;
10333 * Isar/Pure: new derived language element 'obtain' supports
10334 generalized existence reasoning;
10336 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
10337 support accumulation of results, without applying any rules yet;
10338 useful to collect intermediate results without explicit name
10339 references, and for use with transitivity rules with more than 2
10342 * Isar/Pure: scalable support for case-analysis type proofs: new
10343 'case' language element refers to local contexts symbolically, as
10344 produced by certain proof methods; internally, case names are attached
10345 to theorems as "tags";
10347 * Isar/Pure: theory command 'hide' removes declarations from
10348 class/type/const name spaces;
10350 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
10351 indicate potential overloading;
10353 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
10355 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
10356 "{a,b,c}" instead of {a,b,c};
10358 * Isar/Pure now provides its own version of intro/elim/dest
10359 attributes; useful for building new logics, but beware of confusion
10360 with the version in Provers/classical;
10362 * Isar/Pure: the local context of (non-atomic) goals is provided via
10363 case name 'antecedent';
10365 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
10366 to the current context is now done automatically);
10368 * Isar/Pure: theory command 'method_setup' provides a simple interface
10369 for definining proof methods in ML;
10371 * Isar/Provers: intro/elim/dest attributes changed; renamed
10372 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
10373 most cases, one should have to change intro!! to intro? only);
10374 replaced "delrule" by "rule del";
10376 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
10377 'symmetric' attribute (the latter supercedes [RS sym]);
10379 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
10380 method modifier); 'simp' method: 'only:' modifier removes loopers as
10381 well (including splits);
10383 * Isar/Provers: Simplifier and Classical methods now support all kind
10384 of modifiers used in the past, including 'cong', 'iff', etc.
10386 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
10387 of Simplifier and Classical reasoner);
10389 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
10390 now support named cases; major packages (inductive, datatype, primrec,
10391 recdef) support case names and properly name parameters;
10393 * Isar/HOL: new transitivity rules for substitution in inequalities --
10394 monotonicity conditions are extracted to be proven at end of
10397 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
10400 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
10401 split_if split_if_asm; datatype package provides theorems foo.splits =
10402 foo.split foo.split_asm for each datatype;
10404 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
10405 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
10406 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
10407 use "(cases (simplified))" method in proper proof texts);
10409 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
10411 * Isar: names of theorems etc. may be natural numbers as well;
10413 * Isar: 'pr' command: optional arguments for goals_limit and
10414 ProofContext.prems_limit; no longer prints theory contexts, but only
10417 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
10418 additional print modes to be specified; e.g. "pr(latex)" will print
10419 proof state according to the Isabelle LaTeX style;
10421 * Isar: improved support for emulating tactic scripts, including proof
10422 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
10423 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
10424 (for HOL datatypes);
10426 * Isar: simplified (more robust) goal selection of proof methods: 1st
10427 goal, all goals, or explicit goal specifier (tactic emulation); thus
10428 'proof method scripts' have to be in depth-first order;
10430 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
10432 * Isar: removed 'help' command, which hasn't been too helpful anyway;
10433 should instead use individual commands for printing items
10434 (print_commands, print_methods etc.);
10436 * Isar: added 'nothing' --- the empty list of theorems;
10441 * HOL/MicroJava: formalization of a fragment of Java, together with a
10442 corresponding virtual machine and a specification of its bytecode
10443 verifier and a lightweight bytecode verifier, including proofs of
10444 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
10445 Cornelia Pusch (see also the homepage of project Bali at
10446 http://isabelle.in.tum.de/Bali/);
10448 * HOL/Algebra: new theory of rings and univariate polynomials, by
10451 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
10452 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
10455 * HOL/Lattice: fundamental concepts of lattice theory and order
10456 structures, including duals, properties of bounds versus algebraic
10457 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
10458 Theorem for complete lattices etc.; may also serve as a demonstration
10459 for abstract algebraic reasoning using axiomatic type classes, and
10460 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
10462 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
10465 * HOL/IMPP: extension of IMP with local variables and mutually
10466 recursive procedures, by David von Oheimb;
10468 * HOL/Lambda: converted into new-style theory and document;
10470 * HOL/ex/Multiquote: example of multiple nested quotations and
10471 anti-quotations -- basically a generalized version of de-Bruijn
10472 representation; very useful in avoiding lifting of operations;
10474 * HOL/record: added general record equality rule to simpset; fixed
10475 select-update simplification procedure to handle extended records as
10476 well; admit "r" as field name;
10478 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
10479 other numeric types and also as the identity of groups, rings, etc.;
10481 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
10482 Types nat and int belong to this axclass;
10484 * HOL: greatly improved simplification involving numerals of type nat, int, real:
10485 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
10486 i*j + k + j*#3*i simplifies to #4*(i*j) + k
10487 two terms #m*u and #n*u are replaced by #(m+n)*u
10488 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
10489 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
10490 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
10492 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
10493 powerful prover for predicate logic but knows nothing of clasets; see
10494 ex/mesontest.ML and ex/mesontest2.ML for example applications;
10496 * HOL: new version of "case_tac" subsumes both boolean case split and
10497 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
10498 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
10500 * HOL: simplification no longer dives into case-expressions: only the
10501 selector expression is simplified, but not the remaining arms; to
10502 enable full simplification of case-expressions for datatype t, you may
10503 remove t.weak_case_cong from the simpset, either globally (Delcongs
10504 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
10506 * HOL/recdef: the recursion equations generated by 'recdef' for
10507 function 'f' are now called f.simps instead of f.rules; if all
10508 termination conditions are proved automatically, these simplification
10509 rules are added to the simpset, as in primrec; rules may be named
10510 individually as well, resulting in a separate list of theorems for
10513 * HOL/While is a new theory that provides a while-combinator. It
10514 permits the definition of tail-recursive functions without the
10515 provision of a termination measure. The latter is necessary once the
10516 invariant proof rule for while is applied.
10518 * HOL: new (overloaded) notation for the set of elements below/above
10519 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
10521 * HOL: theorems impI, allI, ballI bound as "strip";
10523 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
10524 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
10525 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
10527 * HOL/Real: "rabs" replaced by overloaded "abs" function;
10529 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
10530 main HOL, but was unused);
10532 * HOL: fewer consts declared as global (e.g. have to refer to
10533 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
10535 * HOL: tuned AST representation of nested pairs, avoiding bogus output
10536 in case of overlap with user translations (e.g. judgements over
10537 tuples); (note that the underlying logical represenation is still
10543 * ZF: simplification automatically cancels common terms in arithmetic
10544 expressions over nat and int;
10546 * ZF: new treatment of nat to minimize type-checking: all operators
10547 coerce their operands to a natural number using the function natify,
10548 making the algebraic laws unconditional;
10550 * ZF: as above, for int: operators coerce their operands to an integer
10551 using the function intify;
10553 * ZF: the integer library now contains many of the usual laws for the
10554 orderings, including $<=, and monotonicity laws for $+ and $*;
10556 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
10559 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
10560 to the simplifier and classical reasoner simultaneously;
10565 * Provers: blast_tac now handles actual object-logic rules as
10566 assumptions; note that auto_tac uses blast_tac internally as well;
10568 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
10569 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
10571 * Provers: delrules now handles destruct rules as well (no longer need
10572 explicit make_elim);
10574 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
10575 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10576 use instead the strong form,
10577 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10578 in HOL, FOL and ZF the function cla_make_elim will create such rules
10579 from destruct-rules;
10581 * Provers: Simplifier.easy_setup provides a fast path to basic
10582 Simplifier setup for new object-logics;
10584 * Pure: AST translation rules no longer require constant head on LHS;
10586 * Pure: improved name spaces: ambiguous output is qualified; support
10587 for hiding of names;
10589 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
10590 XSYMBOL_HOME; no longer need to do manual configuration in most
10593 * system: compression of ML heaps images may now be controlled via -c
10594 option of isabelle and isatool usedir (currently only observed by
10597 * system: isatool installfonts may handle X-Symbol fonts as well (very
10598 useful for remote X11);
10600 * system: provide TAGS file for Isabelle sources;
10602 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
10605 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
10606 timing flag supersedes proof_timing and Toplevel.trace;
10608 * ML: new combinators |>> and |>>> for incremental transformations
10609 with secondary results (e.g. certain theory extensions):
10611 * ML: PureThy.add_defs gets additional argument to indicate potential
10612 overloading (usually false);
10614 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
10619 New in Isabelle99 (October 1999)
10620 --------------------------------
10622 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10624 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
10625 are no longer simplified. (This allows the simplifier to unfold recursive
10626 functional programs.) To restore the old behaviour, declare
10628 Delcongs [if_weak_cong];
10630 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
10633 * HOL: the predicate "inj" is now defined by translation to "inj_on";
10635 * HOL/datatype: mutual_induct_tac no longer exists --
10636 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
10638 * HOL/typedef: fixed type inference for representing set; type
10639 arguments now have to occur explicitly on the rhs as type constraints;
10641 * ZF: The con_defs part of an inductive definition may no longer refer
10642 to constants declared in the same theory;
10644 * HOL, ZF: the function mk_cases, generated by the inductive
10645 definition package, has lost an argument. To simplify its result, it
10646 uses the default simpset instead of a supplied list of theorems.
10648 * HOL/List: the constructors of type list are now Nil and Cons;
10650 * Simplifier: the type of the infix ML functions
10651 setSSolver addSSolver setSolver addSolver
10652 is now simpset * solver -> simpset where `solver' is a new abstract type
10653 for packaging solvers. A solver is created via
10654 mk_solver: string -> (thm list -> int -> tactic) -> solver
10655 where the string argument is only a comment.
10658 *** Proof tools ***
10660 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
10661 decision procedure for linear arithmetic. Currently it is used for
10662 types `nat', `int', and `real' in HOL (see below); it can, should and
10663 will be instantiated for other types and logics as well.
10665 * The simplifier now accepts rewrite rules with flexible heads, eg
10666 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
10667 They are applied like any rule with a non-pattern lhs, i.e. by first-order
10673 * New Isabelle/Isar subsystem provides an alternative to traditional
10674 tactical theorem proving; together with the ProofGeneral/isar user
10675 interface it offers an interactive environment for developing human
10676 readable proof documents (Isar == Intelligible semi-automated
10677 reasoning); for further information see isatool doc isar-ref,
10678 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
10680 * improved and simplified presentation of theories: better HTML markup
10681 (including colors), graph views in several sizes; isatool usedir now
10682 provides a proper interface for user theories (via -P option); actual
10683 document preparation based on (PDF)LaTeX is available as well (for
10684 new-style theories only); see isatool doc system for more information;
10686 * native support for Proof General, both for classic Isabelle and
10689 * ML function thm_deps visualizes dependencies of theorems and lemmas,
10690 using the graph browser tool;
10692 * Isabelle manuals now also available as PDF;
10694 * theory loader rewritten from scratch (may not be fully
10695 bug-compatible); old loadpath variable has been replaced by show_path,
10696 add_path, del_path, reset_path functions; new operations such as
10697 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
10700 * improved isatool install: option -k creates KDE application icon,
10701 option -p DIR installs standalone binaries;
10703 * added ML_PLATFORM setting (useful for cross-platform installations);
10704 more robust handling of platform specific ML images for SML/NJ;
10706 * the settings environment is now statically scoped, i.e. it is never
10707 created again in sub-processes invoked from isabelle, isatool, or
10710 * path element specification '~~' refers to '$ISABELLE_HOME';
10712 * in locales, the "assumes" and "defines" parts may be omitted if
10715 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
10718 * new print_mode "HTML";
10720 * new flag show_tags controls display of tags of theorems (which are
10721 basically just comments that may be attached by some tools);
10723 * Isamode 2.6 requires patch to accomodate change of Isabelle font
10724 mode and goal output format:
10726 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
10728 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
10730 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
10731 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
10733 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
10735 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
10737 * function bind_thms stores lists of theorems (cf. bind_thm);
10739 * new shorthand tactics ftac, eatac, datac, fatac;
10741 * qed (and friends) now accept "" as result name; in that case the
10742 theorem is not stored, but proper checks and presentation of the
10743 result still apply;
10745 * theorem database now also indexes constants "Trueprop", "all",
10746 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
10751 ** HOL arithmetic **
10753 * There are now decision procedures for linear arithmetic over nat and
10756 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
10757 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
10758 are treated as atomic; subformulae not involving type `nat' or `int'
10759 are ignored; quantified subformulae are ignored unless they are
10760 positive universal or negative existential. The tactic has to be
10761 invoked by hand and can be a little bit slow. In particular, the
10762 running time is exponential in the number of occurrences of `min' and
10763 `max', and `-' on `nat'.
10765 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
10766 (negated) (in)equalities among the premises and the conclusion into
10767 account (i.e. no compound formulae) and does not know about `min' and
10768 `max', and `-' on `nat'. It is fast and is used automatically by the
10771 NB: At the moment, these decision procedures do not cope with mixed
10772 nat/int formulae where the two parts interact, such as `m < n ==>
10775 * HOL/Numeral provides a generic theory of numerals (encoded
10776 efficiently as bit strings); setup for types nat/int/real is in place;
10777 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
10778 int, existing theories and proof scripts may require a few additional
10781 * integer division and remainder can now be performed on constant
10784 * many properties of integer multiplication, division and remainder
10787 * An interface to the Stanford Validity Checker (SVC) is available through the
10788 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
10789 are proved automatically. SVC must be installed separately, and its results
10790 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
10791 invocation of the underlying oracle). For SVC see
10792 http://verify.stanford.edu/SVC
10794 * IsaMakefile: the HOL-Real target now builds an actual image;
10799 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
10800 (in Isabelle/Isar) -- by Gertrud Bauer;
10802 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
10803 analysis for assembly languages with subtypes;
10805 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
10806 -- avoids syntactic ambiguities and treats state, transition, and
10807 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
10808 changed syntax and (many) tactics;
10810 * HOL/inductive: Now also handles more general introduction rules such
10811 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
10812 theorems are now maintained within the theory (maintained via the
10815 * HOL/datatype: Now also handles arbitrarily branching datatypes
10816 (using function types) such as
10818 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
10820 * HOL/record: record_simproc (part of the default simpset) takes care
10821 of selectors applied to updated records; record_split_tac is no longer
10822 part of the default claset; update_defs may now be removed from the
10823 simpset in many cases; COMPATIBILITY: old behavior achieved by
10825 claset_ref () := claset() addSWrapper record_split_wrapper;
10826 Delsimprocs [record_simproc]
10828 * HOL/typedef: fixed type inference for representing set; type
10829 arguments now have to occur explicitly on the rhs as type constraints;
10831 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
10832 names rather than an ML expression;
10834 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
10835 supplied later. Program schemes can be defined, such as
10836 "While B C s = (if B s then While B C (C s) else s)"
10837 where the well-founded relation can be chosen after B and C have been given.
10839 * HOL/List: the constructors of type list are now Nil and Cons;
10840 INCOMPATIBILITY: while [] and infix # syntax is still there, of
10841 course, ML tools referring to List.list.op # etc. have to be adapted;
10843 * HOL_quantifiers flag superseded by "HOL" print mode, which is
10844 disabled by default; run isabelle with option -m HOL to get back to
10845 the original Gordon/HOL-style output;
10847 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
10848 ALL x<=y. P, EX x<y. P, EX x<=y. P;
10850 * HOL basic syntax simplified (more orthogonal): all variants of
10851 All/Ex now support plain / symbolic / HOL notation; plain syntax for
10852 Eps operator is provided as well: "SOME x. P[x]";
10854 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
10856 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
10857 thus available for user theories;
10859 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
10860 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
10863 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
10864 several times and then mp;
10869 * the notation <<...>> is now available as a notation for sequences of
10872 * the simplifier is now installed
10874 * the axiom system has been generalized (thanks to Soren Heilmann)
10876 * the classical reasoner now has a default rule database
10881 * new primrec section allows primitive recursive functions to be given
10882 directly (as in HOL) over datatypes and the natural numbers;
10884 * new tactics induct_tac and exhaust_tac for induction (or case
10885 analysis) over datatypes and the natural numbers;
10887 * the datatype declaration of type T now defines the recursor T_rec;
10889 * simplification automatically does freeness reasoning for datatype
10892 * automatic type-inference, with AddTCs command to insert new
10893 type-checking rules;
10895 * datatype introduction rules are now added as Safe Introduction rules
10898 * the syntax "if P then x else y" is now available in addition to
10902 *** Internal programming interfaces ***
10904 * tuned simplifier trace output; new flag debug_simp;
10906 * structures Vartab / Termtab (instances of TableFun) offer efficient
10907 tables indexed by indexname_ord / term_ord (compatible with aconv);
10909 * AxClass.axclass_tac lost the theory argument;
10911 * tuned current_goals_markers semantics: begin / end goal avoids
10912 printing empty lines;
10914 * removed prs and prs_fn hook, which was broken because it did not
10915 include \n in its semantics, forcing writeln to add one
10916 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
10917 string -> unit if you really want to output text without newline;
10919 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
10920 plain output, interface builders may have to enable 'isabelle_font'
10921 mode to get Isabelle font glyphs as before;
10923 * refined token_translation interface; INCOMPATIBILITY: output length
10924 now of type real instead of int;
10926 * theory loader actions may be traced via new ThyInfo.add_hook
10927 interface (see src/Pure/Thy/thy_info.ML); example application: keep
10928 your own database of information attached to *whole* theories -- as
10929 opposed to intra-theory data slots offered via TheoryDataFun;
10931 * proper handling of dangling sort hypotheses (at last!);
10932 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
10933 extra sort hypotheses that can be witnessed from the type signature;
10934 the force_strip_shyps flag is gone, any remaining shyps are simply
10935 left in the theorem (with a warning issued by strip_shyps_warning);
10939 New in Isabelle98-1 (October 1998)
10940 ----------------------------------
10942 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10944 * several changes of automated proof tools;
10946 * HOL: major changes to the inductive and datatype packages, including
10947 some minor incompatibilities of theory syntax;
10949 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
10952 * HOL: removed duplicate thms in Arith:
10953 less_imp_add_less should be replaced by trans_less_add1
10954 le_imp_add_le should be replaced by trans_le_add1
10956 * HOL: unary minus is now overloaded (new type constraints may be
10959 * HOL and ZF: unary minus for integers is now #- instead of #~. In
10960 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
10961 now taken as an integer constant.
10963 * Pure: ML function 'theory_of' renamed to 'theory';
10966 *** Proof tools ***
10969 1. Asm_full_simp_tac is now more aggressive.
10970 1. It will sometimes reorient premises if that increases their power to
10972 2. It does no longer proceed strictly from left to right but may also
10973 rotate premises to achieve further simplification.
10974 For compatibility reasons there is now Asm_lr_simp_tac which is like the
10975 old Asm_full_simp_tac in that it does not rotate premises.
10976 2. The simplifier now knows a little bit about nat-arithmetic.
10978 * Classical reasoner: wrapper mechanism for the classical reasoner now
10979 allows for selected deletion of wrappers, by introduction of names for
10980 wrapper functionals. This implies that addbefore, addSbefore,
10981 addaltern, and addSaltern now take a pair (name, tactic) as argument,
10982 and that adding two tactics with the same name overwrites the first
10983 one (emitting a warning).
10984 type wrapper = (int -> tactic) -> (int -> tactic)
10985 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
10986 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
10987 delWrapper, delSWrapper: claset * string -> claset
10988 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
10990 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
10991 semantics; addbefore now affects only the unsafe part of step_tac
10992 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
10993 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
10996 * Classical reasoner: setwrapper to setWrapper and compwrapper to
10997 compWrapper; added safe wrapper (and access functions for it);
10999 * HOL/split_all_tac is now much faster and fails if there is nothing
11000 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
11001 and the names of the automatically generated variables have changed.
11002 split_all_tac has moved within claset() from unsafe wrappers to safe
11003 wrappers, which means that !!-bound variables are split much more
11004 aggressively, and safe_tac and clarify_tac now split such variables.
11005 If this splitting is not appropriate, use delSWrapper "split_all_tac".
11006 Note: the same holds for record_split_tac, which does the job of
11007 split_all_tac for record fields.
11009 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
11010 permanently to the default simpset using Addsplits just like
11011 Addsimps. They can be removed via Delsplits just like
11012 Delsimps. Lower-case versions are also available.
11014 * HOL/Simplifier: The rule split_if is now part of the default
11015 simpset. This means that the simplifier will eliminate all occurrences
11016 of if-then-else in the conclusion of a goal. To prevent this, you can
11017 either remove split_if completely from the default simpset by
11018 `Delsplits [split_if]' or remove it in a specific call of the
11019 simplifier using `... delsplits [split_if]'. You can also add/delete
11020 other case splitting rules to/from the default simpset: every datatype
11021 generates suitable rules `split_t_case' and `split_t_case_asm' (where
11022 t is the name of the datatype).
11024 * Classical reasoner / Simplifier combination: new force_tac (and
11025 derivatives Force_tac, force) combines rewriting and classical
11026 reasoning (and whatever other tools) similarly to auto_tac, but is
11027 aimed to solve the given subgoal completely.
11032 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
11033 and `goalw': the theory is no longer needed as an explicit argument -
11034 the current theory context is used; assumptions are no longer returned
11035 at the ML-level unless one of them starts with ==> or !!; it is
11036 recommended to convert to these new commands using isatool fixgoal
11037 (backup your sources first!);
11039 * new top-level commands 'thm' and 'thms' for retrieving theorems from
11040 the current theory context, and 'theory' to lookup stored theories;
11042 * new theory section 'locale' for declaring constants, assumptions and
11043 definitions that have local scope;
11045 * new theory section 'nonterminals' for purely syntactic types;
11047 * new theory section 'setup' for generic ML setup functions
11048 (e.g. package initialization);
11050 * the distribution now includes Isabelle icons: see
11051 lib/logo/isabelle-{small,tiny}.xpm;
11053 * isatool install - install binaries with absolute references to
11056 * isatool logo -- create instances of the Isabelle logo (as EPS);
11058 * print mode 'emacs' reserved for Isamode;
11060 * support multiple print (ast) translations per constant name;
11062 * theorems involving oracles are now printed with a suffixed [!];
11067 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
11069 * HOL/inductive package reorganized and improved: now supports mutual
11070 definitions such as
11075 oddI "n : EVEN ==> Suc n : ODD"
11076 evenI "n : ODD ==> Suc n : EVEN"
11078 new theorem list "elims" contains an elimination rule for each of the
11079 recursive sets; inductive definitions now handle disjunctive premises
11080 correctly (also ZF);
11082 INCOMPATIBILITIES: requires Inductive as an ancestor; component
11083 "mutual_induct" no longer exists - the induction rule is always
11084 contained in "induct";
11087 * HOL/datatype package re-implemented and greatly improved: now
11088 supports mutually recursive datatypes such as
11091 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
11092 | SUM ('a aexp) ('a aexp)
11093 | DIFF ('a aexp) ('a aexp)
11096 'a bexp = LESS ('a aexp) ('a aexp)
11097 | AND ('a bexp) ('a bexp)
11098 | OR ('a bexp) ('a bexp)
11100 as well as indirectly recursive datatypes such as
11103 ('a, 'b) term = Var 'a
11104 | App 'b ((('a, 'b) term) list)
11106 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
11107 induction on mutually / indirectly recursive datatypes.
11109 Primrec equations are now stored in theory and can be accessed via
11110 <function_name>.simps.
11114 - Theories using datatypes must now have theory Datatype as an
11116 - The specific <typename>.induct_tac no longer exists - use the
11117 generic induct_tac instead.
11118 - natE has been renamed to nat.exhaust - use exhaust_tac
11119 instead of res_inst_tac ... natE. Note that the variable
11120 names in nat.exhaust differ from the names in natE, this
11121 may cause some "fragile" proofs to fail.
11122 - The theorems split_<typename>_case and split_<typename>_case_asm
11123 have been renamed to <typename>.split and <typename>.split_asm.
11124 - Since default sorts of type variables are now handled correctly,
11125 some datatype definitions may have to be annotated with explicit
11127 - Primrec definitions no longer require function name and type
11128 of recursive argument.
11130 Consider using isatool fixdatatype to adapt your theories and proof
11131 scripts to the new package (backup your sources first!).
11134 * HOL/record package: considerably improved implementation; now
11135 includes concrete syntax for record types, terms, updates; theorems
11136 for surjective pairing and splitting !!-bound record variables; proof
11137 support is as follows:
11139 1) standard conversions (selectors or updates applied to record
11140 constructor terms) are part of the standard simpset;
11142 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
11143 made part of standard simpset and claset via addIffs;
11145 3) a tactic for record field splitting (record_split_tac) is part of
11146 the standard claset (addSWrapper);
11148 To get a better idea about these rules you may retrieve them via
11149 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
11150 the name of your record type.
11152 The split tactic 3) conceptually simplifies by the following rule:
11154 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
11156 Thus any record variable that is bound by meta-all will automatically
11157 blow up into some record constructor term, consequently the
11158 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
11159 solve record problems automatically.
11162 * reorganized the main HOL image: HOL/Integ and String loaded by
11163 default; theory Main includes everything;
11165 * automatic simplification of integer sums and comparisons, using cancellation;
11167 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
11169 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
11171 * many new identities for unions, intersections, set difference, etc.;
11173 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
11174 called split_if, split_split, split_sum_case and split_nat_case (to go
11175 with add/delsplits);
11177 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
11178 (?x::unit) = (); this is made part of the default simpset, which COULD
11179 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
11180 'Delsimprocs [unit_eq_proc];' as last resort); also note that
11181 unit_abs_eta_conv is added in order to counter the effect of
11182 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
11185 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
11188 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
11189 It and 'sym RS equals0D' are now in the default claset, giving automatic
11190 disjointness reasoning but breaking a few old proofs.
11192 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
11193 to 'converse' from 'inverse' (for compatibility with ZF and some
11196 * HOL/recdef can now declare non-recursive functions, with {} supplied as
11197 the well-founded relation;
11199 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
11200 Compl A. The "Compl" syntax remains available as input syntax for this
11203 * HOL/Update: new theory of function updates:
11204 f(a:=b) == %x. if x=a then b else f x
11205 may also be iterated as in f(a:=b,c:=d,...);
11207 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
11210 - new function list_update written xs[i:=v] that updates the i-th
11211 list position. May also be iterated as in xs[i:=a,j:=b,...].
11212 - new function `upt' written [i..j(] which generates the list
11213 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
11214 bound write [i..j], which is a shorthand for [i..j+1(].
11215 - new lexicographic orderings and corresponding wellfoundedness theorems.
11218 - removed 'pred' (predecessor) function;
11219 - generalized some theorems about n-1;
11220 - many new laws about "div" and "mod";
11221 - new laws about greatest common divisors (see theory ex/Primes);
11223 * HOL/Relation: renamed the relational operator r^-1 "converse"
11224 instead of "inverse";
11226 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
11227 of the multiset ordering;
11229 * directory HOL/Real: a construction of the reals using Dedekind cuts
11230 (not included by default);
11232 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
11234 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
11235 programs, i.e. different program variables may have different types.
11237 * calling (stac rew i) now fails if "rew" has no effect on the goal
11238 [previously, this check worked only if the rewrite rule was unconditional]
11239 Now rew can involve either definitions or equalities (either == or =).
11244 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
11245 only the theorems proved on ZF.ML;
11247 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
11248 It and 'sym RS equals0D' are now in the default claset, giving automatic
11249 disjointness reasoning but breaking a few old proofs.
11251 * ZF/Update: new theory of function updates
11252 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
11253 may also be iterated as in f(a:=b,c:=d,...);
11255 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
11257 * calling (stac rew i) now fails if "rew" has no effect on the goal
11258 [previously, this check worked only if the rewrite rule was unconditional]
11259 Now rew can involve either definitions or equalities (either == or =).
11261 * case_tac provided for compatibility with HOL
11262 (like the old excluded_middle_tac, but with subgoals swapped)
11265 *** Internal programming interfaces ***
11267 * Pure: several new basic modules made available for general use, see
11268 also src/Pure/README;
11270 * improved the theory data mechanism to support encapsulation (data
11271 kind name replaced by private Object.kind, acting as authorization
11272 key); new type-safe user interface via functor TheoryDataFun; generic
11273 print_data function becomes basically useless;
11275 * removed global_names compatibility flag -- all theory declarations
11276 are qualified by default;
11278 * module Pure/Syntax now offers quote / antiquote translation
11279 functions (useful for Hoare logic etc. with implicit dependencies);
11280 see HOL/ex/Antiquote for an example use;
11282 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
11285 * new tactical CHANGED_GOAL for checking that a tactic modifies a
11288 * Display.print_goals function moved to Locale.print_goals;
11290 * standard print function for goals supports current_goals_markers
11291 variable for marking begin of proof, end of proof, start of goal; the
11292 default is ("", "", ""); setting current_goals_markers := ("<proof>",
11293 "</proof>", "<goal>") causes SGML like tagged proof state printing,
11298 New in Isabelle98 (January 1998)
11299 --------------------------------
11301 *** Overview of INCOMPATIBILITIES (see below for more details) ***
11303 * changed lexical syntax of terms / types: dots made part of long
11304 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
11306 * simpset (and claset) reference variable replaced by functions
11307 simpset / simpset_ref;
11309 * no longer supports theory aliases (via merge) and non-trivial
11310 implicit merge of thms' signatures;
11312 * most internal names of constants changed due to qualified names;
11314 * changed Pure/Sequence interface (see Pure/seq.ML);
11317 *** General Changes ***
11319 * hierachically structured name spaces (for consts, types, axms, thms
11320 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
11321 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
11322 isatool fixdots ensures space after dots (e.g. "%x. x"); set
11323 long_names for fully qualified output names; NOTE: ML programs
11324 (special tactics, packages etc.) referring to internal names may have
11325 to be adapted to cope with fully qualified names; in case of severe
11326 backward campatibility problems try setting 'global_names' at compile
11327 time to have enrything declared within a flat name space; one may also
11328 fine tune name declarations in theories via the 'global' and 'local'
11331 * reimplemented the implicit simpset and claset using the new anytype
11332 data filed in signatures; references simpset:simpset ref etc. are
11333 replaced by functions simpset:unit->simpset and
11334 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
11335 to patch your ML files accordingly;
11337 * HTML output now includes theory graph data for display with Java
11338 applet or isatool browser; data generated automatically via isatool
11339 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
11341 * defs may now be conditional; improved rewrite_goals_tac to handle
11342 conditional equations;
11344 * defs now admits additional type arguments, using TYPE('a) syntax;
11346 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
11347 creates a new theory node; implicit merge of thms' signatures is
11348 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
11349 transfer:theory->thm->thm in (rare) cases;
11351 * improved handling of draft signatures / theories; draft thms (and
11352 ctyps, cterms) are automatically promoted to real ones;
11354 * slightly changed interfaces for oracles: admit many per theory, named
11355 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
11357 * print_goals: optional output of const types (set show_consts and
11360 * improved output of warnings (###) and errors (***);
11362 * subgoal_tac displays a warning if the new subgoal has type variables;
11364 * removed old README and Makefiles;
11366 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
11368 * removed obsolete init_pps and init_database;
11370 * deleted the obsolete tactical STATE, which was declared by
11371 fun STATE tacfun st = tacfun st st;
11373 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
11374 (which abbreviates $HOME);
11376 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
11377 use isatool fixseq to adapt your ML programs (this works for fully
11378 qualified references to the Sequence structure only!);
11380 * use_thy no longer requires writable current directory; it always
11381 reloads .ML *and* .thy file, if either one is out of date;
11384 *** Classical Reasoner ***
11386 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
11387 tactics that use classical reasoning to simplify a subgoal without
11388 splitting it into several subgoals;
11390 * Safe_tac: like safe_tac but uses the default claset;
11395 * added simplification meta rules:
11396 (asm_)(full_)simplify: simpset -> thm -> thm;
11398 * simplifier.ML no longer part of Pure -- has to be loaded by object
11401 * added prems argument to simplification procedures;
11403 * HOL, FOL, ZF: added infix function `addsplits':
11404 instead of `<simpset> setloop (split_tac <thms>)'
11405 you can simply write `<simpset> addsplits <thms>'
11410 * TYPE('a) syntax for type reflection terms;
11412 * no longer handles consts with name "" -- declare as 'syntax' instead;
11414 * pretty printer: changed order of mixfix annotation preference (again!);
11416 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
11421 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
11422 with `addloop' of the simplifier to faciliate case splitting in premises.
11424 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
11426 * HOL/Auth: new protocol proofs including some for the Internet
11429 * HOL/Map: new theory of `maps' a la VDM;
11431 * HOL/simplifier: simplification procedures nat_cancel_sums for
11432 cancelling out common nat summands from =, <, <= (in)equalities, or
11433 differences; simplification procedures nat_cancel_factor for
11434 cancelling common factor from =, <, <= (in)equalities over natural
11435 sums; nat_cancel contains both kinds of procedures, it is installed by
11436 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
11438 * HOL/simplifier: terms of the form
11439 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
11441 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
11442 and those of the form
11443 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
11445 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
11448 Each datatype `t' now comes with a theorem `split_t_case' of the form
11450 P(t_case f1 ... fn x) =
11451 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
11453 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
11456 and a theorem `split_t_case_asm' of the form
11458 P(t_case f1 ... fn x) =
11459 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
11461 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
11463 which can be added to a simpset via `addsplits'. The existing theorems
11464 expand_list_case and expand_option_case have been renamed to
11465 split_list_case and split_option_case.
11468 - `pred n' is automatically converted to `n-1'.
11469 Users are strongly encouraged not to use `pred' any longer,
11470 because it will disappear altogether at some point.
11471 - Users are strongly encouraged to write "0 < n" rather than
11472 "n ~= 0". Theorems and proof tools have been modified towards this
11476 the function "set_of_list" has been renamed "set" (and its theorems too);
11477 the function "nth" now takes its arguments in the reverse order and
11478 has acquired the infix notation "!" as in "xs!n".
11480 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
11482 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
11483 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
11485 * HOL/record: extensible records with schematic structural subtyping
11486 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
11487 still lacks various theorems and concrete record syntax;
11492 * removed "axioms" and "generated by" sections;
11494 * replaced "ops" section by extended "consts" section, which is capable of
11495 handling the continuous function space "->" directly;
11498 . proves theorems immediately and stores them in the theory,
11499 . creates hierachical name space,
11500 . now uses normal mixfix annotations (instead of cinfix...),
11501 . minor changes to some names and values (for consistency),
11502 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
11503 . separator between mutual domain defs: changed "," to "and",
11504 . improved handling of sort constraints; now they have to
11505 appear on the left-hand side of the equations only;
11507 * fixed LAM <x,y,zs>.b syntax;
11509 * added extended adm_tac to simplifier in HOLCF -- can now discharge
11510 adm (%x. P (t x)), where P is chainfinite and t continuous;
11515 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
11516 with `addloop' of the simplifier to faciliate case splitting in premises.
11518 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
11519 in HOL, they strip ALL and --> from proved theorems;
11523 New in Isabelle94-8 (May 1997)
11524 ------------------------------
11526 *** General Changes ***
11528 * new utilities to build / run / maintain Isabelle etc. (in parts
11529 still somewhat experimental); old Makefiles etc. still functional;
11531 * new 'Isabelle System Manual';
11533 * INSTALL text, together with ./configure and ./build scripts;
11535 * reimplemented type inference for greater efficiency, better error
11536 messages and clean internal interface;
11538 * prlim command for dealing with lots of subgoals (an easier way of
11539 setting goals_limit);
11544 * supports alternative (named) syntax tables (parser and pretty
11545 printer); internal interface is provided by add_modesyntax(_i);
11547 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
11548 be used in conjunction with the Isabelle symbol font; uses the
11549 "symbols" syntax table;
11551 * added token_translation interface (may translate name tokens in
11552 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
11553 the current print_mode); IMPORTANT: user print translation functions
11554 are responsible for marking newly introduced bounds
11555 (Syntax.mark_boundT);
11557 * token translations for modes "xterm" and "xterm_color" that display
11558 names in bold, underline etc. or colors (which requires a color
11561 * infixes may now be declared with names independent of their syntax;
11563 * added typed_print_translation (like print_translation, but may
11564 access type of constant);
11567 *** Classical Reasoner ***
11569 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
11570 some limitations. Blast_tac...
11571 + ignores addss, addbefore, addafter; this restriction is intrinsic
11572 + ignores elimination rules that don't have the correct format
11573 (the conclusion MUST be a formula variable)
11574 + ignores types, which can make HOL proofs fail
11575 + rules must not require higher-order unification, e.g. apply_type in ZF
11576 [message "Function Var's argument not a bound variable" relates to this]
11577 + its proof strategy is more general but can actually be slower
11579 * substitution with equality assumptions no longer permutes other
11582 * minor changes in semantics of addafter (now called addaltern); renamed
11583 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
11584 (and access functions for it);
11586 * improved combination of classical reasoner and simplifier:
11587 + functions for handling clasimpsets
11588 + improvement of addss: now the simplifier is called _after_ the
11590 + safe variant of addss called addSss: uses safe simplifications
11591 _during_ the safe steps. It is more complete as it allows multiple
11592 instantiations of unknowns (e.g. with slow_tac).
11596 * added interface for simplification procedures (functions that
11597 produce *proven* rewrite rules on the fly, depending on current
11600 * ordering on terms as parameter (used for ordered rewriting);
11602 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
11604 * the solver is now split into a safe and an unsafe part.
11605 This should be invisible for the normal user, except that the
11606 functions setsolver and addsolver have been renamed to setSolver and
11607 addSolver; added safe_asm_full_simp_tac;
11612 * a generic induction tactic `induct_tac' which works for all datatypes and
11613 also for type `nat';
11615 * a generic case distinction tactic `exhaust_tac' which works for all
11616 datatypes and also for type `nat';
11618 * each datatype comes with a function `size';
11620 * patterns in case expressions allow tuple patterns as arguments to
11621 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
11623 * primrec now also works with type nat;
11625 * recdef: a new declaration form, allows general recursive functions to be
11626 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
11628 * the constant for negation has been renamed from "not" to "Not" to
11629 harmonize with FOL, ZF, LK, etc.;
11631 * HOL/ex/LFilter theory of a corecursive "filter" functional for
11634 * HOL/Modelcheck demonstrates invocation of model checker oracle;
11636 * HOL/ex/Ring.thy declares cring_simp, which solves equational
11637 problems in commutative rings, using axiomatic type classes for + and *;
11639 * more examples in HOL/MiniML and HOL/Auth;
11641 * more default rewrite rules for quantifiers, union/intersection;
11643 * a new constant `arbitrary == @x.False';
11645 * HOLCF/IOA replaces old HOL/IOA;
11647 * HOLCF changes: derived all rules and arities
11648 + axiomatic type classes instead of classes
11649 + typedef instead of faking type definitions
11650 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
11651 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
11652 + eliminated the types void, one, tr
11653 + use unit lift and bool lift (with translations) instead of one and tr
11654 + eliminated blift from Lift3.thy (use Def instead of blift)
11655 all eliminated rules are derived as theorems --> no visible changes ;
11660 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
11661 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
11662 as ZF_cs addSIs [equalityI];
11666 New in Isabelle94-7 (November 96)
11667 ---------------------------------
11669 * allowing negative levels (as offsets) in prlev and choplev;
11671 * super-linear speedup for large simplifications;
11673 * FOL, ZF and HOL now use miniscoping: rewriting pushes
11674 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
11675 FAIL); can suppress it using the command Delsimps (ex_simps @
11676 all_simps); De Morgan laws are also now included, by default;
11678 * improved printing of ==> : ~:
11680 * new object-logic "Sequents" adds linear logic, while replacing LK
11681 and Modal (thanks to Sara Kalvala);
11683 * HOL/Auth: correctness proofs for authentication protocols;
11685 * HOL: new auto_tac combines rewriting and classical reasoning (many
11686 examples on HOL/Auth);
11688 * HOL: new command AddIffs for declaring theorems of the form P=Q to
11689 the rewriter and classical reasoner simultaneously;
11691 * function uresult no longer returns theorems in "standard" format;
11692 regain previous version by: val uresult = standard o uresult;
11696 New in Isabelle94-6
11697 -------------------
11699 * oracles -- these establish an interface between Isabelle and trusted
11700 external reasoners, which may deliver results as theorems;
11702 * proof objects (in particular record all uses of oracles);
11704 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
11706 * "constdefs" section in theory files;
11708 * "primrec" section (HOL) no longer requires names;
11710 * internal type "tactic" now simply "thm -> thm Sequence.seq";
11714 New in Isabelle94-5
11715 -------------------
11717 * reduced space requirements;
11719 * automatic HTML generation from theories;
11721 * theory files no longer require "..." (quotes) around most types;
11723 * new examples, including two proofs of the Church-Rosser theorem;
11725 * non-curried (1994) version of HOL is no longer distributed;
11729 New in Isabelle94-4
11730 -------------------
11732 * greatly reduced space requirements;
11734 * theory files (.thy) no longer require \...\ escapes at line breaks;
11736 * searchable theorem database (see the section "Retrieving theorems" on
11737 page 8 of the Reference Manual);
11739 * new examples, including Grabczewski's monumental case study of the
11742 * The previous version of HOL renamed to Old_HOL;
11744 * The new version of HOL (previously called CHOL) uses a curried syntax
11745 for functions. Application looks like f a b instead of f(a,b);
11747 * Mutually recursive inductive definitions finally work in HOL;
11749 * In ZF, pattern-matching on tuples is now available in all abstractions and
11750 translates to the operator "split";
11754 New in Isabelle94-3
11755 -------------------
11757 * new infix operator, addss, allowing the classical reasoner to
11758 perform simplification at each step of its search. Example:
11759 fast_tac (cs addss ss)
11761 * a new logic, CHOL, the same as HOL, but with a curried syntax
11762 for functions. Application looks like f a b instead of f(a,b). Also pairs
11763 look like (a,b) instead of <a,b>;
11765 * PLEASE NOTE: CHOL will eventually replace HOL!
11767 * In CHOL, pattern-matching on tuples is now available in all abstractions.
11768 It translates to the operator "split". A new theory of integers is available;
11770 * In ZF, integer numerals now denote two's-complement binary integers.
11771 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
11773 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
11774 of the Axiom of Choice;
11778 New in Isabelle94-2
11779 -------------------
11781 * Significantly faster resolution;
11783 * the different sections in a .thy file can now be mixed and repeated
11786 * Database of theorems for FOL, HOL and ZF. New
11787 commands including qed, qed_goal and bind_thm store theorems in the database.
11789 * Simple database queries: return a named theorem (get_thm) or all theorems of
11790 a given theory (thms_of), or find out what theory a theorem was proved in
11793 * Bugs fixed in the inductive definition and datatype packages;
11795 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
11796 and HOL_dup_cs obsolete;
11798 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
11801 * Simpler definition of function space in ZF;
11803 * new results about cardinal and ordinal arithmetic in ZF;
11805 * 'subtype' facility in HOL for introducing new types as subsets of existing
11808 :mode=isabelle-news:wrap=hard:maxLineLen=72: